☞ C program to swap any two bits in the given number.
☞ Given an n-by-n matrix of 0's and 1's where all 1's in each row come before all 0's, find the most efficient way to return the row with the maximum number of 0's.
☞ C program to print following pattern.(Dec,2017)
1
3*2
4*5*6
10*9*8*7
☞ C program to print following pattern.
1
2 3
4 5 6
4 5 6
2 3
1
☞ C program to print following pattern.
1*2*3*10*11*12
4*5*8*9
6*7
☞ Given an n-by-n matrix of 0's and 1's where all 1's in each row come before all 0's, find the most efficient way to return the row with the maximum number of 0's.
☞ C program to print following pattern.(Dec,2017)
1
3*2
4*5*6
10*9*8*7
☞ C program to print following pattern.
1
2 3
4 5 6
4 5 6
2 3
1
☞ C program to print following pattern.
1*2*3*10*11*12
4*5*8*9
6*7
No comments:
Post a Comment