**ISC Practical (**

__Expected__**)**

1. Binary Conversions

2. Hamming Distance

3. Mobius function

4. Sorting Rows / Columns of 2D Array

5. Finding maximum and minimum value of a 2D Array

6. Reversing words of a sentence

7. Sorting of words of a sentence

1. Binary Conversions

2. Hamming Distance

3. Mobius function

4. Sorting Rows / Columns of 2D Array

5. Finding maximum and minimum value of a 2D Array

6. Reversing words of a sentence

7. Sorting of words of a sentence

## 4 comments:

HELLOO SIR...

WILL DATE PROGRAMS ARE ALSO EXPECTED THIS YEAR ....

and thanks alot for your help .

your programs are really helping me...

thanku

thanks alooootttt :-) :-) :-)

thank u... sir for ur help ...

thanks alot...

and plz mail more questions which u think that they are/will come in board (11/02/2013)

:)

AND YES ITS TRUE THAT U ARE REALLLY HELPING US IN AN EXCELLLENT WAY

AGAIN THANKSSSSSS ALOT... :)

sir could you please send me the solution of this question-

Write the program to do the following:

Read in an integer n (which can be at most 50). Then read in n integers one by one

and store them in an array data from index 0 to n-1. Now we want to rearrange the

integers in data in the following way :

Find the maximum value in data and put in the centre of the array (that is at (n/2);

find the next largest value and put it to its right; then the next largest and place it to

its left and so on alternating right and left until all integers in data are done. For

example, if the array is initially:

7, 3, 1, 6, 4, 2, 5 then after rearranging it becomes 1, 3, 5, 7, 6, 4, 2

However, since we have very little memory, you are not allowed to use any other array from data.

Sir your site is a great help....Thanks a lot sir.

Post a Comment