Most answered questions in Programming and DS

+93 votes

14 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 (41.9k points) | 13.6k views

+16 votes

12 answers

2

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 (1.6k points) | 2.8k views

+28 votes

11 answers

3

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 (431k points) | 5.7k views

+29 votes

11 answers

4

GATE2007-IT-28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$

asked Oct 30, 2014 in DS by Ishrat Jahan Boss (16.3k points) | 6.7k views

+42 votes

11 answers

5

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$ ... 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 (52.2k points) | 6.9k views

+32 votes

11 answers

6

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 (105k points) | 3.9k views

+30 votes

10 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.2k points) | 5k views

+19 votes

10 answers

8

GATE2015-2-10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.

asked Feb 12, 2015 in DS by jothee Veteran (105k points) | 4.9k views

+13 votes

9 answers

9

GATE2019-27
Consider the following C program: #include <stdio.h> int r() { static int num=7; return num--; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; } Which one of the following values will be displayed on execution of the programs? $41$ $52$ $63$ $630$

asked Feb 7, 2019 in Programming by Arjun Veteran (431k points) | 4.6k views

+40 votes

9 answers

10

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 (1.6k points) | 9.2k views

+21 votes

9 answers

11

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 (431k points) | 4.1k views

+19 votes

9 answers

12

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 (1.6k points) | 8.5k views

+46 votes

9 answers

13

GATE2010-53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: mod \: 10$, and linear probing. After inserting $6$ ... sequences of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$

asked Apr 21, 2016 in DS by jothee Veteran (105k points) | 6.9k views

+74 votes

9 answers

14

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$. ... else x:= 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.2k points) | 10.1k views

+23 votes

9 answers

15

GATE1998-19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$

asked Aug 29, 2015 in DS by Arjun Veteran (431k points) | 3.6k views

+33 votes

9 answers

16

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 (16.3k points) | 5.3k views

+55 votes

9 answers

17

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 (105k points) | 6.7k views

+45 votes

9 answers

18

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 operation ... 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 (52.2k points) | 7.1k views

+52 votes

8 answers

19

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.1k points) | 8.8k views

+4 votes

8 answers

20

GO2017-Programming-1-3
What will be the output of the following code? #include <stdio.h> #include <string.h> int main() { char string[] = "Hello"; if(sizeof(string) <= strlen(string)) printf("1"); printf("0"); } ______

asked Oct 19, 2016 in Programming by Arjun Veteran (431k points) | 787 views

+28 votes

8 answers

21

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 (105k points) | 4.5k views

+100 votes

8 answers

22

GATE2007-IT-29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$

asked Oct 30, 2014 in DS by Ishrat Jahan Boss (16.3k points) | 12.8k views

+29 votes

8 answers

23

GATE2011-29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

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

+35 votes

8 answers

24

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[ ... 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 (105k points) | 4.1k views

+32 votes

8 answers

25

GATE2014-2-41
Suppose a stack implementation supports an instruction $REVERSE$, which reverses the order of elements on the stack, in addition to the $PUSH$ and $POP$ instructions. Which one of the following statements is TRUE (with respect to this modified stack)? A ... $ENQUEUE$ and $DEQUEUE$ take a single instruction each.

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

+22 votes

8 answers

26

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 (52.2k points) | 3k views

+14 votes

7 answers

27

GATE2019-46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

asked Feb 7, 2019 in DS by Arjun Veteran (431k points) | 6.6k views

+17 votes

7 answers

28

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, 2018 in Programming by gatecse Boss (17.5k points) | 4.9k views

+61 votes

7 answers

29

GATE2017-1-53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } void main() ... is defined in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .

asked Feb 14, 2017 in Programming by srestha Veteran (119k points) | 8.8k views

+31 votes

7 answers

30

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[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 (431k points) | 5.4k 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 and DS

Recent Posts

Recent Blog Comments