Register

Recent questions tagged data-structures

0 votes
2 answers
1411
build heap
how to merge two binary max heaps ? size of first heap is m+n and size of second heap is n and also find the complexity.
how to merge two binary max heaps ?size of first heap is m+n and size of second heap is nand also find the complexity.
User Avatar
0 votes
1 answer
1412
daa doubt
how to decide height , depth and level of tree and no. of internal nodes in tree some books take root as internal node height as no. of edges b/w root and leaf(longest path), some take level starting from root as 0
how to decide height , depth and level of treeand no. of internal nodes in treesome books take root as internal nodeheight as no. of edges b/w root and leaf(longest path)...
User Avatar
5 votes
3 answers
1413
Hashing : Quadratic Probing
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resolution. What is the index into which 59 will be inserted ? $a). 3$ $b). 6$ $c). 8$ $d). 5$
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resoluti...
User Avatar
3 votes
1 answer
1414
Ace Test Series: Programming & DS - Binary Tree
A binary tree has 127 nodes. Which of the following is an invalid height for this tree ? $a). 16 $ $b). 6$ $c). 21$ $d). 43$
A binary tree has 127 nodes. Which of the following is an invalid height for this tree ?$a). 16 $$b). 6$$c). 21$$d). 43$
User Avatar
1 votes
1 answer
1415
stack_time_complexity
Is any operations in stack array implementation is linear time complexity? If there what is operation and explain abt that?
Is any operations in stack array implementation is linear time complexity?If there what is operation and explain abt that?
User Avatar
2 votes
2 answers
1416
Heap IMP
A max heap stores unique digits from 1 to 100 in an array.(total 100 elements) What is the maximum possible index number for element 92 ?
A max heap stores unique digits from 1 to 100 in an array.(total 100 elements)What is the maximum possible index number for element 92 ?
User Avatar
4 votes
1 answer
1418
UGC NET CSE | June 2011 | Part 2 | Question: 24
Consider a hash table of size $m = 10000$ and the hash function $ h(k) = \lfloor m (KA \bmod 1) ' \rfloor$ for $A= \frac{(\sqrt{5}-1}{2}$ . The location to the key $k = 123456$ is 46 47 41 43
Consider a hash table of size $m = 10000$ and the hash function $ h(k) = \lfloor m (KA \bmod 1) ' \rfloor$ for $A= \frac{(\sqrt{5}-1}{2}$ . The location to the key $k = ...
User Avatar
1 votes
2 answers
1419
practice questions
the time required to find 7th smallest element in min heap of size n vertices? solve and plz explain how?
the time required to find 7th smallest element in min heap of size n vertices? solve and plz explain how?
User Avatar
2 votes
1 answer
1423
UGC NET CSE | June 2016 | Part 3 | Question: 33
Which one of the following array represents a binary max-heap? [26, 13, 17, 14, 11, 9, 15] [26, 15, 14, 17, 11, 9, 13] [26, 15, 17, 14, 11, 9, 13] [26, 15, 13, 14, 11, 9, 17]
Which one of the following array represents a binary max-heap?[26, 13, 17, 14, 11, 9, 15][26, 15, 14, 17, 11, 9, 13][26, 15, 17, 14, 11, 9, 13][26, 15, 13, 14, 11, 9, 17]...
User Avatar
2 votes
1 answer
1424
Cormen page 155
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half full Plz explain this so i get a picture in my head
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half fullPlz explain this so i get a picture in my he...
User Avatar
3 votes
2 answers
1425
UGC NET CSE | June 2016 | Part 2 | Question: 24
Which of the following is not an inherent application of stack? Implementation of recursion Evaluation of a postfix expression Job scheduling Reverse a string
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
User Avatar
3 votes
3 answers
1426
UGC NET CSE | June 2016 | Part 2 | Question: 23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}-1$ $\frac{n}{2}+1$ $(n-1)/2$ $(n+1)/2$
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
User Avatar
7 votes
1 answer
1428
UGC NET CSE | June 2016 | Part 2 | Question: 5
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
User Avatar
3 votes
2 answers
1429
UGC NET CSE | June 2016 | Part 2 | Question: 2
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively. 14, 14 16, 14 16, 4 14, 4
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively.14, 1416, 1416, 414, 4
User Avatar
1 votes
2 answers
1430
UGC NET CSE | December 2011 | Part 2 | Question: 6
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full. $.25$ $.20$ $.35$ $.30$
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full.$.25$$.20$ $.35$$.30$
User Avatar
3 votes
3 answers
1431
UGC NET CSE | December 2011 | Part 2 | Question: 1
Which of the following data structure is Non-linear type ? Strings Lists Stacks None of the above
Which of the following data structure is Non-linear type ?StringsListsStacksNone of the above
User Avatar
3 votes
2 answers
1432
UGC NET CSE | December 2015 | Part 2 | Question: 35
The hash function used in double hashing is of the form: $h(k,i)=(h_1(k)+h_2(k)+i) \: mod \: m$ $h(k,i)=(h_1(k)+h_2(k)-i) \: mod \: m$ $h(k,i)=(h_1(k)+i \: h_2(k)) \: mod \: m$ $h(k,i)=(h_1(k)-i \: h_2(k)) \: mod \: m$
The hash function used in double hashing is of the form:$h(k,i)=(h_1(k)+h_2(k)+i) \: mod \: m$$h(k,i)=(h_1(k)+h_2(k)-i) \: mod \: m$$h(k,i)=(h_1(k)+i \: h_2(k)) \: mod \:...
User Avatar
1 votes
1 answer
1434
UGC NET CSE | December 2015 | Part 2 | Question: 38
The inorder traversal of the following tree is $2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$ ...
The inorder traversal of the following tree is$2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$$20 \...
User Avatar
3 votes
2 answers
1435
UGC NET CSE | Junet 2015 | Part 3 | Question: 36
The number of nodes in height h in any n-element heap is $h$ $z^h$ ceil $\biggl(\frac{n}{z^h} \biggr)$ ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
The number of nodes in height h in any n-element heap is$h$$z^h$ceil $\biggl(\frac{n}{z^h} \biggr)$ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
User Avatar
3 votes
2 answers
1436
UGC NET CSE | Junet 2015 | Part 3 | Question: 34
Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for $A=\frac{ (\sqrt{5}-1)}{2} = 0.618033$. Compute the location to which the key k=123456 is placed in hash table 77 82 88 89
Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for $A=\frac{ (\sqrt{5}-1)}{2} = 0.618033$. Compute the location to which the key k=123...
User Avatar
2 votes
1 answer
1437
UGC NET CSE | Junet 2015 | Part 2 | Question: 23
Level order Traversal of a rooted Tree can be done by starting from root and performing: Breadth First Search Depth First Search Root Search Deep Search
Level order Traversal of a rooted Tree can be done by starting from root and performing:Breadth First SearchDepth First SearchRoot SearchDeep Search
User Avatar
Page: