Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

9 votes
2 answers
2401
ISRO-DEC2017-80
Consider the following $C$ function #include<stdio.h> int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; } The output of the program is $\text{SI}$ $\text{IT}$ $\text{T1}$ $17$
Consider the following $C$ function#include<stdio.h int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; }The output of the program is ...
User Avatar
2 votes
1 answer
2402
ISRO-DEC2017-73
Consider the function int fun(x: integer) { If x>100 then fun=x-10; else fun=fun(fun(x+11)); } For the input $x=95$, the function will return $89$ $90$ $91$ $92$
Consider the functionint fun(x: integer) { If x>100 then fun=x-10; else fun=fun(fun(x+11)); }For the input $x=95$, the function will return$89$$90$$91$$92$
User Avatar
3 votes
2 answers
2403
ISRO-DEC2017-74
Consider the function int func(int num) { int count=0; while(num) { count++; num>>=1; } return(count); } For $func(435)$ the value returned is $9$ $8$ $0$ $10$
Consider the functionint func(int num) { int count=0; while(num) { count++; num>>=1; } return(count); }For $func(435)$ the value returned is$9$$8$$0$$10$
User Avatar
5 votes
1 answer
2404
ISRO-DEC2017-65
Which one of the following are essential features of object-oriented language? A. Abstraction and encapsulation B. Strictly-typed C. Type-safe property coupled with sub-type rule D. Polymorphism in the presence of inheritance $A$ and $B$ only $A,D$ and $B$ only $A$ and $D$ only $A,C$ and $D$ only
Which one of the following are essential features of object-oriented language? A.Abstraction and encapsulation B.Strictly-typed C.Type-safe property coupled with sub-type...
User Avatar
1 votes
1 answer
2406
ISRO-DEC2017-53
The minimum number of stacks needed to implement a queue is $3$ $1$ $2$ $4$
The minimum number of stacks needed to implement a queue is$3$$1$$2$$4$
User Avatar
2 votes
2 answers
2407
ISRO-DEC2017-54
A strictly binary tree with $10$ leaves cannot have more than $19$ nodes has exactly $19$ nodes has exactly $17$ nodes has exactly $20$ nodes
A strictly binary tree with $10$ leavescannot have more than $19$ nodeshas exactly $19$ nodeshas exactly $17$ nodeshas exactly $20$ nodes
User Avatar
3 votes
2 answers
2408
ISRO-DEC2017-56
Which one of the following property is correct for a red-black tree? Every simple path from anode to a descendant leaf contains the same number of black nodes. If a node is red, then one children is red and another is black. If a node is red, then both its children are red. Every leaf node (sentinel node) is red.
Which one of the following property is correct for a red-black tree?Every simple path from anode to a descendant leaf contains the same number of black nodes.If a node is...
User Avatar
3 votes
2 answers
2409
ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary ...
User Avatar
3 votes
1 answer
2410
ISRO-DEC2017-47
Which of the following permutation can be obtained in the same order using a stack assuming that input is the sequence $5,6,7,8,9$ in that order? $7,8,9,5,6$ $5,9,6,7,8$ $7,8,9,6,5$ $9,8,7,5,6$
Which of the following permutation can be obtained in the same order using a stack assuming thatinput is the sequence $5,6,7,8,9$ in that order?$7,8,9,5,6$$5,9,6,7,8$$7,8...
User Avatar
3 votes
2 answers
2411
ISRO-DEC2017-49
A binary search tree is used to locate the number $43.$ Which one of the following probe sequence is not possible? $61,52,14,17,40,43$ $10,65,31,48,37,43$ $81,61,52,14,41,43$ $17,77,27,66,18,43$
A binary search tree is used to locate the number $43.$ Which one of the followingprobe sequence is not possible?$61,52,14,17,40,43$$10,65,31,48,37,43$$81,61,52,14,41,43$...
User Avatar
7 votes
2 answers
2413
ISRO-DEC2017-45
Match the following and choose the correct answer in the order $A, B,C$ ... be asymptotically tight) $a-q,b- r, c-p$ $a-p, b-q, c-r$ $a-q, b-p, c-r$ $a-r, b-q, c-p$
Match the following and choose the correct answer in the order $A, B,C$$\begin{array}{|ll|ll|} \hline \text{A.} & \text{Heap Construction} & \text{p.} & O(n\log n) \\\hli...
User Avatar
5 votes
2 answers
2415
ISRO-DEC2017-28
The number of structurally different possible binary trees with $4$ nodes is $14$ $12$ $336$ $168$
The number of structurally different possible binary trees with $4$ nodes is $14$$12$$336$$168$
User Avatar
1 votes
1 answer
2416
ISRO-DEC2017-14
$\text{Type-IV} JDBC$ driver is a driver which is written in $C++$ which requires an intermediate layer which communicates through Java sockets which translates $JDBC$ function calls into $API$ not native to $DBMS$
$\text{Type-IV} JDBC$ driver is a driverwhich is written in $C++$which requires an intermediate layerwhich communicates through Java socketswhich translates $JDBC$ functi...
User Avatar
3 votes
2 answers
2417
ISRO-DEC2017-19
//Consider the program void function(int n) { int i,j,count=0; for(i=n/2;i<=n;i++) for(j=1;j<=n;j=j*2) count++; } The complexity of the program is $O(\log n)$ $O(n^2)$ $O(n^2 \log n)$ $O(n \log n)$
//Consider the program void function(int n) { int i,j,count=0; for(i=n/2;i<=n;i++) for(j=1;j<=n;j=j*2) count++; }The complexity of the program is$O(\log n)$$O(n^2)$$O(n^2...
User Avatar
0 votes
0 answers
2420
Static and dynamic scoping
Can anyone please explain what is the answer to this question by static and dynamic scoping?
Can anyone please explain what is the answer to this question by static and dynamic scoping?
User Avatar
Page: