Recent questions in DS

Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&0&2&3&1&1&1&0&1.3&3
\\\hline\textbf{2 Marks Count}&2&0&0&1&3&3&0&1.5&3
\\\hline\textbf{Total Marks}&4&2&3&3&7&7&\bf{2}&\bf{4.3}&\bf{7}\\\hline
\end{array}}}$$

0 votes

1 answer

NIELIT 2016 MAR Scientist B - Section C: 21
A polynomial $p(x)$ is such that $p(0)=5, \: p(1)=4, \: p(2)=9$ and $p(3)=20$. The minimum degree it can have is $1$ $2$ $3$ $4$

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 57 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (IT) - Section B: 15
A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue.

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 47 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (IT) - Section B: 17
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$ $^*/\%+-=$ $=^*/\%+-$ $/^*\%-+=$ $^*\% /-+=$

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 39 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (IT) - Section B: 30
What data structures is used for depth first traversal of a graph? Queue Stack List None of the above

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 39 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (IT) - Section B: 42
In the ________ traversal we process all of a vertex's descendants before we move to an adjacent vertex. Depth First Breadth First Width First Depth Limited

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 49 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (CS) - Section B: 15
Which of the following need not be a binary tree? Search tree Heap AVL tree B tree

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 32 views

0 votes

1 answer

NIELIT 2016 DEC Scientist B (CS) - Section B: 42
The maximum number of nodes in a binary tree of level $k, k\geq1$ is: $2^k+1$ $2^{k-1}$ $2^k-1$ $2^{k-1}-1$

asked Mar 31 in DS by Lakshman Patel RJIT Veteran | 44 views

0 votes

1 answer

NIELIT 2017 July Scientist B (CS) - Section B: 6
Assume that the operators $+,-,\times$ are left associative and $\wedge$ is right associative. The order of precedence(from highest to lowest) is $\wedge,\times+,-$ ... $abc\times+de\wedge f\wedge-$ $ab+c\times d-e\wedge f\wedge $ $-+a\times bc\wedge\wedge def$

asked Mar 30 in DS by Lakshman Patel RJIT Veteran | 18 views

0 votes

1 answer

NIELIT 2017 July Scientist B (CS) - Section B: 7
A balance factor in AVL tree is used to check what rotation to make. if all child nodes are at same level. when the last rotation occurred. if the tree is unbalanced.

asked Mar 30 in DS by Lakshman Patel RJIT Veteran | 21 views

0 votes

1 answer

NIELIT 2017 July Scientist B (CS) - Section B: 8
A priority queue is implemented as a Max-heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10,8,5,3,2$. Two new elements $1$ and $7$ are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is $10,8,7,3,2,1,5$ $10,8,7,2,3,1,5$ $10,8,7,1,2,3,5$ $10,8,7,5,3,2,1$

asked Mar 30 in DS by Lakshman Patel RJIT Veteran | 22 views

0 votes

0 answers

NIELIT 2017 July Scientist B (CS) - Section B: 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$ ... operations will be $\Omega(n)$. Worst case time complexity for both operations will be $\Omega(\log n)$.

asked Mar 30 in DS by Lakshman Patel RJIT Veteran | 17 views

0 votes

0 answers

NIELIT 2017 July Scientist B (CS) - Section B: 54
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is $nk$ $(n-1)k+1$ $n(k-1)+1$ $n(k-1)$

asked Mar 30 in DS by Lakshman Patel RJIT Veteran | 12 views

0 votes

1 answer

UGCNET-Dec2007-II: 12
Consider the following linked list : Which of the following piece of code will insert the node pointed to by q at the end of the list ? $\text{for (p=list; p !=NULL; p=p → next);}\\ p=q;$ $\text{for (p=list; p !=NULL; p=p → next);}\\ \text{p→next=q;}$ $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p=q;$ $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p→next=q;$

asked Mar 28 in DS by jothee Veteran | 26 views

0 votes

1 answer

UGCNET-Dec2007-II: 21
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > $0$) of the tree ? Assume that the root is at level $0$: $3^i$ $3i$ $3$ $3i+1$

asked Mar 28 in DS by jothee Veteran | 33 views

0 votes

1 answer

UGCNET-Dec2007-II: 22
Which of the following data structure is used to implement recursion ? Arrays. Stacks. Queues. Linked lists.

asked Mar 28 in DS by jothee Veteran | 24 views

0 votes

1 answer

UGCNET-Dec2007-II: 23
The height of a binary tree with n nodes, in the worst case is : $O(log n)$ $O(n)$ $\Omega(n\log n)$ $\Omega(n^2)$

asked Mar 28 in DS by jothee Veteran | 26 views

0 votes

1 answer

UGCNET-Dec2006-II: 11
When a function is recursively called, all automatic variables : are initialized during each execution of the function. are retained from the last execution. are maintained in a stack. are ignored.

asked Mar 27 in DS by jothee Veteran | 24 views

0 votes

1 answer

UGCNET-Dec2006-II: 23
What is the time required to insert an element in a stack with linked implementation ? $O (log_2^n)$ $O (n)$ $O (n\:log_2^n)$ $O (1)$

asked Mar 27 in DS by jothee Veteran | 32 views

0 votes

1 answer

UGCNET-Dec2006-II: 24
The equivalent postfix expression for $d{\large /}(e+f)+b*c$ : $defbc/++*$ $def+/bc+*$ $def+/bc*+$ None of these.

asked Mar 27 in DS by jothee Veteran | 22 views

0 votes

1 answer

UGCNET-Dec2006-II: 25
Which one of the following is a physical data structure ? Array Linked lists Stacks Tables

asked Mar 27 in DS by jothee Veteran | 24 views

Page:

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

Subjects

Network Sites

Recent questions in DS

Recent Posts

Subjects

Recent Blog Comments

Network Sites