Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

6 votes
3 answers
4772
ISRO2009-29
A one dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting address of A[49] is 1267 1164 1264 1169
A one dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting addres...
User Avatar
0 votes
1 answer
4775
C \ predict the output
void main() { int i=100,j=10,k; int *p=&j; k=i/(*p); printf("%d",k); } OPTIONS : [ a] 0 [b] 10 [c] 100 [d] None of the above
void main() { int i=100,j=10,k; int *p=&j; k=i/(*p); printf("%d",k); }OPTIONS : [ a] 0 [b] 10 [c] 100 [d] None of the above
User Avatar
0 votes
1 answer
4776
C \ predict output
User Avatar
0 votes
1 answer
4777
C \ predict output
int main(){ static int arr[20]; int x=0; arr[x] = x++; printf("\n %d %d %d", arr[0],arr[1],x); } OPTIONS : A) 000 b) 101 c) 001 D) can't say
int main(){ static int arr[20]; int x=0; arr[x] = x++; printf("\n %d %d %d", arr[0],arr ,x); }OPTIONS :A) 000b) 101c) 001D) can't say
User Avatar
0 votes
1 answer
4778
C\ predict output
main(){ int i=400,j=300; printf("%d..%d"); } OPTIONS :
main(){ int i=400,j=300; printf("%d..%d"); }OPTIONS :
User Avatar
0 votes
2 answers
4779
C \ predict the output
int main(){ int x=5,y; x++; printf("x=%d\n",x); y=x= ++x+10/x; printf("new x= %d",x); } OPTIONS :
int main(){ int x=5,y; x++; printf("x=%d\n",x); y=x= ++x+10/x; printf("new x= %d",x); }OPTIONS :
User Avatar
0 votes
2 answers
4780
What is the size of stack?
Consider the following infix expression which is to be converted to postfix expression using stack. (((P+Q)*(R+S))/T)+(A*(B+C))
Consider the following infix expression which is to be converted to postfix expression using stack.(((P+Q)*(R+S))/T)+(A*(B+C))
User Avatar
0 votes
2 answers
4781
Calculate address
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume the first element us stored at A[1][1][1].
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume...
User Avatar
–1 votes
3 answers
4782
What is height of bst?
The following numbers are inserted into an empty bst in given order 10,1,3,5,15,12,16. What is the height of the bst( the height is the maximum distance of a leaf node from the root)
The following numbers are inserted into an empty bst in given order 10,1,3,5,15,12,16. What is the height of the bst( the height is the maximum distance of a leaf node fr...
User Avatar
0 votes
1 answer
4783
storage classes in arguments
why we can not have storage classes identifier in arguments and what is actual arguments/formal arguments/paramater etc
why we can not have storage classes identifier in argumentsand what is actual arguments/formal arguments/paramater etc
User Avatar
3 votes
1 answer
4784
Which is correct and why?
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), then a) B[i,j]=C[i,j+1] b)B[i,j]=C[j+1,i] c)B[i,j]=C[j, i+1]
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), thena) B[i,j]...
User Avatar
5 votes
1 answer
4785
What is the expected number of probes in a successful search
consider an open address hash table with a total of 10000 slots containing 9800 entries. a) 2 b) 3 c) 4 d) 4.5
consider an open address hash table with a total of 10000 slots containing 9800 entries. a) 2b) 3c) 4d) 4.5
User Avatar
1 votes
1 answer
4786
Which of the following in correct
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), then a) B[i,j]=C[i,j+1] b)B[i,j]=C[j+1,i] c)B[i,j]=C[j, i+1]
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), thena) B[i,j]...
User Avatar
0 votes
0 answers
4787
compiler
In which file the compiler manage the various objects, which are used in windows programming ? (A) Control File (B) Binary File (C) Text File (D) Obj File
In which file the compiler manage thevarious objects, which are used inwindows programming ?(A) Control File(B) Binary File(C) Text File(D) Obj File
User Avatar
0 votes
2 answers
4790
Post order traversal
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree? (A) Min heap (B) Max heap (C) Strict binary tree (D) None of these
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree?(A) Min heap(B) Max heap(C) Strict binary tree(D) None of these
User Avatar
Page: