Hot questions in Programming & DS

+72 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 (43k points) | 8.7k views

+68 votes

5 answers

2

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 (19.1k points) | 7.6k views

+3 votes

1 answer

3

what is the difference between type conversion and type casting in c ?

asked May 10, 2016 in Programming by Vivek Jain Junior (847 points) | 15.8k views

+58 votes

8 answers

4

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) | 6.6k views

+25 votes

8 answers

5

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) | 6.1k views

+45 votes

5 answers

6

GATE2008-46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this? $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined

asked Sep 12, 2014 in DS by Kathleen Veteran (59.6k points) | 7.9k views

+51 votes

3 answers

7

GATE2015-1-35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$

asked Feb 13, 2015 in Programming by makhdoom ghaya Boss (40.4k points) | 5.5k views

+26 votes

4 answers

8

GATE2017-1-36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x= x + ... (3)$ will result in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.

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

+28 votes

3 answers

9

GATE2017-1-55
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i--) { x = x + total(i); } printf("%d\n", x); }

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

+45 votes

7 answers

10

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

+31 votes

4 answers

11

GATE2016-1-10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ time. At most one ... for both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$

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

+40 votes

6 answers

12

GATE2016-2-15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the ... operations put together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

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

+32 votes

6 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$ values into an empty hash table, the table is shown as below $0$ $1$ $2$ $42$ $3$ $23$ $4$ $34$ $5$ $52$ $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) | 4.5k views

+40 votes

5 answers

14

GATE2016-2-34
A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.

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

+14 votes

3 answers

15

Find address of element in 3d array
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________.

asked Dec 4, 2015 in DS by shikharV Active (4.2k points) | 8.1k views

+17 votes

7 answers

16

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) | 6.3k views

+21 votes

10 answers

17

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 (362k points) | 3.7k views

+30 votes

5 answers

18

GATE2003-23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$

asked Sep 19, 2014 in DS by Disha (121 points) | 6.4k views

+31 votes

5 answers

19

GATE2008-42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at most $2k-2$ ... at least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.

asked Sep 27, 2014 in DS by Akshay Jindal (457 points) | 5.2k views

+34 votes

10 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.6k points) | 4.6k views

+51 votes

8 answers

21

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

+17 votes

2 answers

22

GATE2009-37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$

asked Sep 22, 2014 in DS by Kathleen Veteran (59.6k points) | 6.5k views

+45 votes

3 answers

23

GATE2002-2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) ... described by which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$

asked Sep 16, 2014 in DS by Kathleen Veteran (59.6k points) | 4.6k views

+28 votes

7 answers

24

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) | 4.8k views

+21 votes

5 answers

25

GATE2017-1-13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); if (x) { x = ... made as $x == NULL$ and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.

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

+21 votes

10 answers

26

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.8k views

+18 votes

9 answers

27

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 (362k points) | 3.1k views

+26 votes

6 answers

28

GATE2016-1-38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &5 \\ 2&0 &5 &8 \\ 8&5 &0 ... possible integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

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

+45 votes

5 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); } ... $strlen$ 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 (101k points) | 6k views

+22 votes

7 answers

30

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 (19.1k points) | 4.2k 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

Hot questions in Programming & DS

Recent Posts

Recent Blog Comments