3) Int Matrix of certain size was given, We had few valu=
es in it like this.
=97=97=97=97=97=97=97=97=97=97=97
1 = | 4 | | 5 | &= nbsp; | 45
=97=97=97=97=97=97=97=97=97=97=97
&n= bsp; | 3 | 3 | 5 | = | 4
=97=97=97=97=97=97=97=97=97=97=97
34 |&nbs= p; 3 | 3 | | 12 | &= nbsp;
=97=97=97=97=97=97=97=97=97=97=97
3 | &nbs= p; | 3 | 4 | = | 3
=97=97=97=97=97=97=97=97=97=97=97
3 | = ; | | | = ; 3 |
=97=97=97=97=97=97=97=97=97=97=97
&= nbsp; | | 4 | = ; | 4 | 3
We w= ere supposed to move back all the spaces in it at the
end.
Note: = If implemented this prog using recursion, would get
higher preference.
No Answer is Posted For this Question
Be the First to Post Answer
What is data _null_? ,Explain with code when u need to use it in data step programming ?
#include <stdio.h> #define a 10 main() { #define a 50 printf("%d",a); }
main() { if (!(1&&0)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above
how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns
func(a,b) int a,b; { return( a= (a==b) ); } main() { int process(),func(); printf("The value of process is %d !\n ",process(func,3,6)); } process(pf,val1,val2) int (*pf) (); int val1,val2; { return((*pf) (val1,val2)); }
In the following pgm add a stmt in the function fun such that the address of 'a' gets stored in 'j'. main(){ int * j; void fun(int **); fun(&j); } void fun(int **k) { int a =0; /* add a stmt here*/ }
x=2 y=3 z=2 x++ + y++; printf("%d%d" x,y);
#include<stdio.h> main() { int a[2][2][2] = { {10,2,3,4}, {5,6,7,8} }; int *p,*q; p=&a[2][2][2]; *q=***a; printf("%d----%d",*p,*q); }
PROG. TO PRODUCE 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1
find A^B using Recursive function
Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
union u { struct st { int i : 4; int j : 4; int k : 4; int l; }st; int i; }u; main() { u.i = 100; printf("%d, %d, %d",u.i, u.st.i, u.st.l); } a. 4, 4, 0 b. 0, 0, 0 c. 100, 4, 0 d. 40, 4, 0