Most answered questions in Programming & DS

+62 votes

12 answers

1

GATE2016-2-40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.

asked Feb 12, 2016 in DS by Akash Kanase Boss (42.5k points) | 7.3k views

+20 votes

9 answers

2

GATE2017-1-35
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); fun1(++n); printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$

asked Feb 14, 2017 in Programming by Arjun Veteran (349k points) | 3.2k views

+54 votes

9 answers

3

GATE2016-1-41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing it from $S$. Consider ... Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

asked Feb 12, 2016 in DS by Sandeep Singh Loyal (7.8k points) | 5.5k views

+22 votes

9 answers

4

GATE2010-10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$

asked Sep 29, 2014 in DS by jothee Veteran (98.5k points) | 2.1k views

+18 votes

8 answers

5

GATE2017-1-6
Let $T$ be a binary search tree with 15 nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.

asked Feb 14, 2017 in DS by Arjun Veteran (349k points) | 2.8k views

+13 votes

8 answers

6

GATE2017-2-14
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$

asked Feb 14, 2017 in Programming by Madhav Active (2k points) | 1.7k views

+18 votes

8 answers

7

GATE2016-1-35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$

asked Feb 12, 2016 in Programming by Sandeep Singh Loyal (7.8k points) | 3.4k views

+21 votes

8 answers

8

GATE2014-3-42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if (x ... $listA$. It is an implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.

asked Sep 28, 2014 in DS by jothee Veteran (98.5k points) | 2.1k views

+44 votes

8 answers

9

GATE2014-3-39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.

asked Sep 28, 2014 in DS by jothee Veteran (98.5k points) | 5.6k views

+37 votes

8 answers

10

GATE2014-1-12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.

asked Sep 26, 2014 in DS by jothee Veteran (98.5k points) | 3.5k views

+11 votes

7 answers

11

GATE2018-2
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'

asked Feb 14 in Programming by gatecse Boss (18k points) | 1.9k views

+40 votes

7 answers

12

GATE2017-1-08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n point to valid NULL- ... or append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.

asked Feb 14, 2017 in DS by khushtak Loyal (7.6k points) | 5.3k views

+12 votes

7 answers

13

GATE2017-2-54
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n--; --n1; n-=n1; printf(“%d”, n); return 0; } The output of the program is ______

asked Feb 14, 2017 in Programming by Madhav Active (2k points) | 2k views

+15 votes

7 answers

14

GATE2017-2-13
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. Which of ... node points to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).

asked Feb 14, 2017 in DS by Madhav Active (2k points) | 5.6k views

+7 votes

7 answers

15

ISRO2014-3
What is the output of the following C program? #include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; } 14 36 18 20

asked Jun 22, 2016 in Programming by pooja14 (89 points) | 2.5k views

+7 votes

7 answers

16

ISRO2011-19
If node A has three siblings and B is parent of A, what is the degree of A? 0 3 4 5

asked Jun 15, 2016 in DS by shibu (53 points) | 2.9k views

+22 votes

7 answers

17

GATE2015-3-25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.

asked Feb 14, 2015 in DS by jothee Veteran (98.5k points) | 2.9k views

+28 votes

7 answers

18

GATE2004-IT-13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$

asked Nov 2, 2014 in DS by Ishrat Jahan Boss (19.1k points) | 2.8k views

+33 votes

7 answers

19

GATE2006-IT-49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, "brother"}; ... 8, nclastor}$ $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$

asked Nov 1, 2014 in Programming by Ishrat Jahan Boss (19.1k points) | 3.5k views

+28 votes

7 answers

20

GATE1994-1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... new representation is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$

asked Oct 4, 2014 in DS by Kathleen Veteran (59.4k points) | 3.6k views

+18 votes

7 answers

21

GATE1998-2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$

asked Sep 26, 2014 in DS by Kathleen Veteran (59.4k points) | 1.6k views

+29 votes

7 answers

22

GATE2003-64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such stack ... $m$ from S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$

asked Sep 17, 2014 in DS by Kathleen Veteran (59.4k points) | 4.2k views

+6 votes

6 answers

23

GATE2018-21
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.

asked Feb 14 in Programming by gatecse Boss (18k points) | 1.5k views

+2 votes

6 answers

24

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)

asked Jun 22, 2017 in Programming by Nitesh Choudhary Active (2.5k points) | 163 views

+6 votes

6 answers

25

ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh

asked May 7, 2017 in DS by sh!va Boss (34.1k points) | 2.8k views

+5 votes

6 answers

26

ISRO2017-64
What is the output of the following program? #include<stdio.h> int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d", tmp); } 20 10 10 20 10 20 20 20 20 10 10 10

asked May 7, 2017 in Programming by sh!va Boss (34.1k points) | 2.8k views

+4 votes

6 answers

27

ISRO2017-41
What is the output of the C++ program? #include <iostream> using namespace std; void square(int *x){ *x = (*x)++ * (*x); } void square(int *x, int *y){ *x = (*x) * --(*y); } int main() { int number = 30; square(&number, &number); cout<<number; return 0; } 910 920 870 900

asked May 7, 2017 in Programming by kauray (299 points) | 2.2k views

+20 votes

6 answers

28

GATE2017-2-43
Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$: int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done =0; int i; while (done==0) { done =1; for (i=0; i<=4; i++) { if (array ... > array[i-1]) { swap(&array[i], array[i-1]); done =0; } } } printf( %d , array[3]); } The output of the program is _______

asked Feb 14, 2017 in Programming by Arjun Veteran (349k points) | 3k views

+23 votes

6 answers

29

GATE2017-2-55
Consider the following C program. #include<stdio.h> #include<string.h> int main() { char* c=”GATECSIT2017”; char* p=c; printf(“%d”, (int)strlen(c+2[p]-6[p]-1)); return 0; } The output of the program is _______

asked Feb 14, 2017 in Programming by Madhav Active (2k points) | 5.1k views

+18 votes

6 answers

30

GATE2017-1-20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________

asked Feb 14, 2017 in DS by Arjun Veteran (349k points) | 3k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Most answered questions in Programming & DS

Recent Posts

Recent Blog Comments