Hot questions in Programming & DS

+2 votes

1 answer

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

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

+32 votes

9 answers

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 Veteran (45.7k points) | 4.2k views

+21 votes

7 answers

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 ... the end of list n. (C) cause a null pointer dereference for all inputs. (D) append list n to the end of list m for all inputs.

asked Feb 14 in DS by khushtak Boss (7.6k points) | 3.2k views

+6 votes

5 answers

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. ... (I) only. (B) (II) only. (C) Both (I) and (II). (D) Neither (I) nor (II).

asked Feb 14 in DS by Madhav Active (2k points) | 3.5k views

+26 votes

7 answers

GATE 2016-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 ... ); 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 Boss (9.2k points) | 3.4k views

+17 votes

5 answers

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 ... 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 Veteran (45.7k points) | 3.5k views

+2 votes

4 answers

ISRO2017-53
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list

asked May 7 in DS by sh!va Veteran (30.2k points) | 2.8k views

+11 votes

5 answers

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 \\ ... 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 Boss (9.2k points) | 3.4k views

+7 votes

8 answers

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); ... n); } The output printed when $\text{fun1}(5)$ is called is (A) $53423122233445$ (B) $53423120112233$ (C) $53423122132435$ (D) $53423120213243$

asked Feb 14 in Programming by Arjun Veteran (319k points) | 1.7k views

+14 votes

3 answers

GATE 2016-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) ... 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 Boss (9.2k points) | 2.6k views

+31 votes

2 answers

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 Veteran (39.7k points) | 2.7k views

+2 votes

6 answers

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 in DS by sh!va Veteran (30.2k points) | 1.7k views

+6 votes

5 answers

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 in DS by Arjun Veteran (319k points) | 1.4k views

+3 votes

6 answers

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 in Programming by sh!va Veteran (30.2k points) | 1.5k views

+27 votes

7 answers

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 (92.6k points) | 3.6k views

+18 votes

4 answers

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" ... 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 in Programming by srestha Veteran (65.1k points) | 2.7k views

+11 votes

5 answers

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 in Programming by Madhav Active (2k points) | 2.5k views

+14 votes

8 answers

GATE 2016-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 Boss (9.2k points) | 2.4k views

+16 votes

4 answers

GATE2016-2-36
Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order; Visit the left subtree using New-order; The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is ... * 3 4 - + 1 * 7 6 ^ 2 - 5 * 4 3 1 7 6 * + 2 5 4 3 * - ^ -

asked Feb 12, 2016 in DS by Akash Kanase Veteran (45.7k points) | 1.8k views

+2 votes

5 answers

ISRO2017-50
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be + , -, *, a,b,c,d a, -,b,+,c,*,d a,b,c,d,-,*,+ -,a,b,+,*,c,d

asked May 7 in DS by sh!va Veteran (30.2k points) | 1.3k views

+8 votes

5 answers

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++) ... i-1]) { swap(&array[i], array[i-1]); done =0; } } } printf( %d , array[3]); } The output of the program is _______

asked Feb 14 in Programming by Arjun Veteran (319k points) | 1.4k views

+3 votes

2 answers

ISRO2007-16, ISRO2009-30, ISRO2014-43

asked Jun 10, 2016 in DS by jothee Veteran (92.6k points) | 1.9k views

+5 votes

5 answers

GATE2017-2-36
The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is 2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20 2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12 7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12 7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12

asked Feb 14 in DS by Arjun Veteran (319k points) | 979 views

+3 votes

4 answers

ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List

asked May 7 in DS by sh!va Veteran (30.2k points) | 1k views

+7 votes

3 answers

Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)

asked Aug 16 in DS by Chandramani Adil (181 points) | 299 views

+7 votes

2 answers

Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??

asked Oct 2 in DS by Ravi prakash pandey (289 points) | 112 views

+3 votes

7 answers

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 (111 points) | 1.2k views

+6 votes

7 answers

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 (61 points) | 1.8k views

+6 votes

7 answers

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 in Programming by Madhav Active (2k points) | 1k views

+1 vote

0 answers

binary tree
Given a binary tree with n nodes and assuming size(x) denotes the number of nodes in the subtree rooted at the node x,how long does it take,in the worst case to compute size(x) for every node x of the tree? Choose the tightest upper bound. A-O(height) B-O(n) C-O(nlogn) D-O(n^2)

asked Oct 6 in DS by mayur ganatra 1 (251 points) | 332 views

Page:

Experts in Programming & DS

Member Since: August 2014
Net Votes: 4153 Best Ans: 122

Arjun

18066 Points

Member Since: March 2016
Net Votes: 1957 Best Ans: 74

rude

9834 Points

Member Since: February 2016
Net Votes: 1295 Best Ans: 48

Debashish Deka

6430 Points

Member Since: September 2016
Net Votes: 1059 Best Ans: 52

Habibkhan

6278 Points

Member Since: November 2014
Net Votes: 1298 Best Ans: 29

Prashant.

4916 Points

Member Since: December 2015
Net Votes: 1000 Best Ans: 35

Kapil

4800 Points

Member Since: January 2015
Net Votes: 917 Best Ans: 32

ManojK

4394 Points

Member Since: March 2015
Net Votes: 890 Best Ans: 31

Digvijay Pandey

4260 Points

Member Since: July 2015
Net Votes: 876 Best Ans: 26

srestha

3832 Points

Member Since: December 2014
Net Votes: 1119 Best Ans: 17

Akash Kanase

3598 Points

Quick search syntax

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

Follow @csegate

Gatecse

Hot questions in Programming & DS

Experts in Programming & DS

Recent Posts

Recent Blog Comments

Recent Badges