Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

64 votes
7 answers
81
GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h 0$, then the m...
User Avatar
53 votes
7 answers
82
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
User Avatar
54 votes
7 answers
83
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
User Avatar
49 votes
7 answers
84
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is:$AB + CD + *F/D +E*$$ABCD + *F/DE* ++$$A * B + CD/F *DE ++$$A + *BCD/F* DE ++$
User Avatar
22 votes
7 answers
88
GATE CSE 2001 | Question: 2.16
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$?OneTwoThreeFour
User Avatar
2 votes
6 answers
91
UGC NET CSE | December 2005 | Part 2 | Question: 11
What is the output of the following $C$-program main() { printf("%d %d %d",size of (3.14f), size of (3.14), size of (3.141)); } 4 4 4 4 8 10 8 4 8 8 8 8
What is the output of the following $C$-programmain() { printf("%d %d %d",size of (3.14f), size of (3.14), size of (3.141)); }4 4 44 8 108 4 88 8 8
User Avatar
28 votes
6 answers
93
GATE CSE 2020 | Question: 47
Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is ___________.
Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is _________...
User Avatar
5 votes
6 answers
96
ISRO2018-60
What is the output of tho following program? main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); } $z2$ $z1z2$ Compilation error None of these
What is the output of tho following program?main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); }$z2$$z1z2$Compilation errorNone of these
User Avatar
2 votes
6 answers
98
c programming
what is the o/p #include<stdio.h> void main() { int a=5; printf("%d %d %d",a++,++a,--a); } also suggest me notes so i can clear my concept about printf function (For Gate)
what is the o/p #include<stdio.h void main() { int a=5; printf("%d %d %d",a++,++a, a); }also suggest me notes so i can clear my concept about printf function (For Gate)
User Avatar
5 votes
6 answers
100
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
User Avatar
Page: