Register
Filter

Questions by A_i_$_h

0 votes
1 answer
401
Programming
Main() { unsigned int x[4][3]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}}; printf("%u %u %u",x+3,*(x+3),*(x+2)+3); } A) 2036,2036,2036 b)2012,4,2204 c)2036,10,10 d)2012,4,6
Main(){unsigned int x[4][3]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}};printf("%u %u %u",x+3,*(x+3),*(x+2)+3);}A) 2036,2036,2036b)2012,4,2204c)2036,10,10d)2012,4,6
1 votes
1 answer
402
Programming
main() { Char str[]="%d%s",arr[]="GatesQuiz"; printf(str,0[arr],2[arr+3]); } a)GQ b)71 81 c)71 Q d) compile time error
main(){Char str[]="%d%s",arr[]="GatesQuiz";printf(str,0[arr],2[arr+3]);}a)GQb)71 81c)71 Qd) compile time error
1 votes
1 answer
403
Programming
void my-toupper(char *str,int index) { *(str+index)&=~32; } main() { char *arr="gatequiz"; my-toupper(arr,0); my-toupper(arr,5); printf("%s",arr); } a)Gatesquiz b)gatesquiz c)compilerdependent answer with explanation please
void my-toupper(char *str,int index){*(str+index)&=~32;}main(){char *arr="gatequiz";my-toupper(arr,0);my-toupper(arr,5);printf("%s",arr);}a)Gatesquizb)gatesquizc)compiler...
2 votes
1 answer
404
Programming
main() { char a[2][3][3] = {'g','a','t','e','s','q','u','I','z'}; printf("%s",**a); the answer is gatequiz, to refer to a 3dimensional array the printf statement should be ***a right?
main(){char a [3][3] = {'g','a','t','e','s','q','u','I','z'};printf("%s", a);the answer is gatequiz, to refer to a 3dimensional array the printf statement should be *a r...
1 votes
1 answer
405
Programming
Int fun( char *str1) { char *str2=str1; while(* ++str1); || here it accesses the data then increments or increments and then checks the data? return(str1-str2); } main() { char * str = "Ravindran"; printf("%d",fun(str)); } a)10 b)9 c)8 d)random number
Int fun( char *str1){char *str2=str1;while(* ++str1); || here it accesses the data then increments or increments and then checks the data?return(str1-str2);}main(){char *...
1 votes
1 answer
406
Programming
n=3; printf("%d %d",n++,++n); 1) 3 5 b) 4 5 c) 4 4 d) implementation dependent
n=3;printf("%d %d",n++,++n);1) 3 5b) 4 5c) 4 4d) implementation dependent
0 votes
1 answer
407
Programming
Int x,y=2,z,a; x=(y*=2)+(z=a=y); printf("%d",x); 1) 8 2) 6 3) 8 or 6 depends on compiler 4) syntax error
Int x,y=2,z,a;x=(y*=2)+(z=a=y);printf("%d",x);1) 82) 63) 8 or 6 depends on compiler4) syntax error
0 votes
1 answer
408
Programming
Let a Nd b be two positive integers,which correctly relates / and % b=(a/b)*b+a%b b=(a%b)*b+a/b a=(a/b)*b+a%b a=(a%b)*b+a/b
Let a Nd b be two positive integers,which correctly relates / and %b=(a/b)*b+a%bb=(a%b)*b+a/ba=(a/b)*b+a%ba=(a%b)*b+a/b
1 votes
1 answer
409
Programming
Consider putchar(getchar()); Putchar(getchar()); the input is a and b then 1.error message 2.this cannot be the input 3.ab 4.a b
Consider putchar(getchar()); Putchar(getchar());the input is a and b then1.error message2.this cannot be the input3.ab4.a b
0 votes
0 answers
410
Binary tree
A weight balanced tree is a binary tree in which for each node the number of nodes in LST ias at least half and almost twice the number of nodes in RST. Maximum possible height of such a tree on n nodes is best described by log n base 2 log n base 4/3 log n base 3 log n base 3/2
A weight balanced tree is a binary tree in which for each node the number of nodes in LST ias at least half and almost twice the number of nodes in RST. Maximum possible ...
0 votes
3 answers
411
Binary tree
Every full binary tree is also a complete binary tree true false
Every full binary tree is also a complete binary treetruefalse
0 votes
1 answer
412
Graph
What can be used to find if a graph is disconnected BFS DFS Both
What can be used to find if a graph is disconnectedBFSDFSBoth
0 votes
2 answers
413
Binary tree
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is (i-2)/2 (i/2)-1
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is(i-2)/2(i/2)-1
1 votes
1 answer
414
Binary trees
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST 0 1 n! 2nCn / (n+1)
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST01n...
1 votes
1 answer
415
Binary
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST 0 1 n! 2nCn / (n+1)
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST01n...
Page: