Most viewed questions in Programming and DS

+3 votes

1 answer

1

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

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

+92 votes

14 answers

2

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

+99 votes

8 answers

3

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

+64 votes

5 answers

4

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

+50 votes

6 answers

5

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 list in ... 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 (41.9k points) | 10.7k views

+65 votes

6 answers

6

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

+74 votes

9 answers

7

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

+16 votes

3 answers

8

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 (3.5k points) | 9.6k views

+40 votes

6 answers

9

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 (81 points) | 9.4k views

+54 votes

7 answers

10

GATE2004-85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ is: $\Large \min \left ( \substack{\text{number of leaf-nodes}\\\text{in left-subtree of $ ... worst-case time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$

asked Sep 19, 2014 in DS by Kathleen Veteran (52.2k points) | 9.1k views

+40 votes

9 answers

11

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

+46 votes

5 answers

12

GATE2013-44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$

asked Aug 7, 2014 in DS by gatecse Boss (17.5k points) | 8.8k views

+52 votes

8 answers

13

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

+61 votes

7 answers

14

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

+48 votes

6 answers

15

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 + bar( ... 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 (431k points) | 8.6k views

+19 votes

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

+69 votes

5 answers

17

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 (30.8k points) | 8.3k views

+40 votes

6 answers

18

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$ ... are 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 (385 points) | 8.3k views

+34 votes

7 answers

19

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$ ... 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.2k points) | 8.3k views

+21 votes

4 answers

20

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

+34 votes

6 answers

21

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 = ( ... 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 (431k points) | 7.7k views

+35 votes

3 answers

22

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

+38 votes

5 answers

23

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 (119k points) | 7.2k views

+29 votes

8 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) | 7.2k views

+30 votes

3 answers

25

GATE1989-1-vii, ISRO2015-14
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$

asked Jun 1, 2015 in DS by Anu Loyal (5.8k points) | 7.1k views

+45 votes

9 answers

26

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

+56 votes

3 answers

27

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

+50 votes

6 answers

28

GATE2006-49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop(S1); push(S2 ... $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $

asked Sep 26, 2014 in DS by Rucha Shelke Active (3.3k points) | 7k views

+50 votes

5 answers

29

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

+46 votes

9 answers

30

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

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 viewed questions in Programming and DS

Recent Posts

Recent Blog Comments