Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

9 votes
5 answers
4803
ISRO2015-75
The for loop for (i=0; i<10; ++i) printf("%d", i&1); prints 0101010101 0111111111 0000000000 1111111111
The for loopfor (i=0; i<10; ++i) printf("%d", i&1);prints0101010101011111111100000000001111111111
User Avatar
10 votes
4 answers
4804
ISRO2015-73
The output of the following program is main() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); } 1 2 3 3 5 5 7 8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 1 2 3 5 4 6 7 8
The output of the following program ismain() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); }1 2 3 ...
User Avatar
8 votes
2 answers
4805
ISRO2015-71
Consider the following program fragment i=6720; j=4; while (i%j)==0 { i=i/j; j=j+1; } On termination j will have the value 4 8 9 6720
Consider the following program fragmenti=6720; j=4; while (i%j)==0 { i=i/j; j=j+1; }On termination j will have the value4896720
User Avatar
7 votes
3 answers
4806
ISRO2015-70
The following program main() { inc(); inc(); inc(); } inc() { static int x; printf("%d", ++x); } prints 012 prints 123 prints 3 consecutive, but unpredictable numbers prints 111
The following programmain() { inc(); inc(); inc(); } inc() { static int x; printf("%d", ++x); }prints 012prints 123prints 3 consecutive, but unpredictable numbersprints 1...
User Avatar
0 votes
0 answers
4807
in a b-tree of order m with p nodes the ang number of splits is at most
In a B tree of order m with p nodes the average number of splits is at most: $\frac{1}{(\lceil \frac{m}{2} \rceil -1)}$ $(\lceil \frac{m}{2} \rceil -1)$ $\frac{1}{\frac{m}{2}}$ None
In a B tree of order m with p nodes the average number of splits is at most:$\frac{1}{(\lceil \frac{m}{2} \rceil -1)}$$(\lceil \frac{m}{2} \rceil -1)$$\frac{1}{\frac{m}{2...
User Avatar
1 votes
1 answer
4808
UGC NET CSE | December 2013 | Part 3 | Question: 34
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. 2n &ndash; 2 n + floor (lg n) &ndash; 2 floor ($\frac{3n}{2}$) &ndash; 2 2 lg n &ndash; 2
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.2n &ndash; 2n + floor (lg n) &ndash; 2floor ($\frac{3n}{2}$) &ndash; ...
User Avatar
1 votes
1 answer
4809
Data Structure
What are the 3 Most Prominent use of Data Structure That creates the requirement of Data structure in every programming language . ​
What are the 3 Most Prominent use of Data Structure That creates the requirement of Data structure in every programming language . ​
User Avatar
0 votes
1 answer
4810
Programming
main ( ) { int a = 2, b, c; a* = b = c = 4; a = b = c; printf (“%d”, a); a = = (b = c); printf (“%d”, a); } What will be the output? (a) 1, 4 (b) 4, 4 (c) 1, 1 (d) 8, 1
main ( ){ int a = 2, b, c; a* = b = c = 4; a = b = c;printf (“%d”, a);a = = (b = c);printf (“%d”, a);} What will be the output?(a) 1, 4 ...
User Avatar
0 votes
0 answers
4812
isro 2011 19
User Avatar
0 votes
1 answer
4813
pointer type
If we delete a record to which another record contains a pointer, then that pointer is called a Pinned pointer Dangling pointer Pointless pointer None of the above
If we delete a record to which another record contains a pointer, then that pointer is called aPinned pointerDangling pointerPointless pointerNone of the above
User Avatar
0 votes
1 answer
4814
C programming
"a healthy mind resides in a healthy body"
"a healthy mind resides in a healthy body"
User Avatar
9 votes
2 answers
4815
ISRO2015-15
The queue data structure is to be realized by using stack. The number of stacks needed would be It cannot be implemented 2 stacks 4 stacks 1 stack
The queue data structure is to be realized by using stack. The number of stacks needed would beIt cannot be implemented2 stacks4 stacks1 stack
User Avatar
7 votes
1 answer
4816
ISRO2015-11
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values 2,2,1,1,2 2,2,1,2,2 2,1,2,2,1 2,1,2,2,2
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values2,2,1...
User Avatar
2 votes
1 answer
4817
UGC NET CSE | December 2012 | Part 2 | Question: 2
The worst case time complexity of AVL is tree is better in comparison to binary search tree for Search and Insert Operations Search and Delete Operations Insert and Delete Operations Search, Insert and Delete Operations
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
User Avatar
0 votes
1 answer
4819
Data structure Array
Suppose we have a circular array implementation of a queue, with 9 items in the queue stored at data[7] through data[15]. The CAPACITY is 19. Where does the push member function place the new entry in the array? Explain via exp.
Suppose we have a circular array implementation of a queue, with 9 items in the queue stored at data[7] through data[15]. The CAPACITY is 19. Where does the push member f...
User Avatar
Page: