Dark Mode

Recent questions tagged data-structures

2 votes

1 answer

1

GO Classes 2023 | IIITH Mock Test 3 | Question: 16
In a binary search tree the following key values (not necessarily in the order given) are encountered while searching for the key $29.$ $3,7,13,19, 37,43,51,59.$ The total number of possible orders in which the given keys of the binary search tree could have been visited is $60$ $70$ $50$ $80$

GO Classes asked in DS Apr 15

240 views

1 vote

1 answer

2

GO Classes 2023 | IIITH Mock Test 3 | Question: 17
The prefix form of $A/B- (C * D * E)$ is? $-/* * ABCDE$ $-/ABCD**DE$ $-/AB**CDE$ $-A/BC*DE*$

GO Classes asked in DS Apr 15

132 views

1 vote

1 answer

3

GO Classes 2023 | IIITH Mock Test 3 | Question: 20
The best data structures in terms of asymptotic time complexities for performing the following operations respectively are CONCATENATION (A, B): Concatenate all elements of A and B together Insert(T, key): Insert key to T Delete (T ... Array Linked List, Stack, Sorted Array, Binary Search Tree Stack, Linked List, Sorted Array, Binary Search Tree

GO Classes asked in DS Apr 15

129 views

1 vote

1 answer

4

GO Classes 2023 | IIITH Mock Test 3 | Question: 21
Consider a min heap with $1023$ distinct integers. If root is at $0$th level then fill the blank given in below sentence. The $10$th minimum of the heap might be at _______ level. $1$ $3$ $8$ $9$

GO Classes asked in DS Apr 15

210 views

2 votes

0 answers

5

GO Classes 2023 | IIITH Mock Test 3 | Question: 22
If a node in the given binary search tree is to be located by binary tree search, what is the expected number of comparisons required to locate one of the items (nodes) in the tree chosen at random? $1.75$ $2$ $2.75$ $3.25$

GO Classes asked in DS Apr 15

161 views

1 vote

1 answer

6

GO Classes 2023 | IIITH Mock Test 2 | Question: 68
The concatenation of $2$ lists can be performed $O(1)$ time. Following are the constraints - Only Pointer to head is given Swap of node values is not allowed The order should be preserved in concatenation. I.e. ... implementations of the list should be used? Singly Linked List Doubly Linked List Circular Linked List Circular Doubly Linked List

GO Classes asked in DS Apr 8

203 views

1 vote

2 answers

7

GO Classes 2023 | IIITH Mock Test 2 | Question: 71
You are given a binary min heap of height $6.$ Let the minimum and maximum number of comparisons we might have to do when doing a delete min respectively are $\text{M}$ and $\text{N}.$ What will be the value of $\text{N-M}?$ $2$ $10$ $12$ $6$

GO Classes asked in DS Apr 8

261 views

1 vote

1 answer

8

GO Classes 2023 | IIITH Mock Test 2 | Question: 72
The keys $2, 4, 6, 7,$ and $8$ have been inserted, one by one, in some unknown order, into an initially empty BST. The result is this BST: How many permutations of the $2, 4, 6, 7,$ and $8$ will generate this particular BST? $6$ $8$ $4$ $12$

GO Classes asked in DS Apr 8

161 views

0 votes

1 answer

9

Data Structure | Set | IIT Kanpur Interview question
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible? $n^{2}$ nlogn n logn

Souvik33 asked in DS Apr 3

163 views

3 votes

0 answers

10

GO Classes 2023 | IIITH Mock Test 1 | Question: 14
Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0$ and leaves are at height $0.$ Assume Expected height of any ... $S1$ is correct but $S2$ is incorrect $S1$ is incorrect but $S2$ is correct Both are correct Both are incorrect

GO Classes asked in DS Mar 26

199 views

1 vote

1 answer

11

GO Classes 2023 | IIITH Mock Test 1 | Question: 15
In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the array starts from $1.$ $4i + 3$ $2i + 1$ $4i + 1$ $2i + 2$

GO Classes asked in DS Mar 26

178 views

1 vote

1 answer

12

GO Classes 2023 | IIITH Mock Test 1 | Question: 31
Suppose numbers from $1$ to $1000$ are saved in a binary search tree and we want to find $363.$ Which of the following sequences cannot be the order of elements while reaching the searched value? $925,202,911,240,912,245,363$ $924,220,911,244,898,258,362,363$ $2,252,401,398,330,344,397,363$ $2,399,387,219,266,382,381,278,363$

GO Classes asked in DS Mar 26

175 views

1 vote

2 answers

13

GO Classes 2023 | IIITH Mock Test 1 | Question: 32
Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element? $2$ $3$ $4$ $5$

GO Classes asked in DS Mar 26

193 views

1 vote

0 answers

14

GO Classes 2023 | IIITH Mock Test 1 | Question: 44
Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list. Which of the following(s) is/are true? Asymptotic time complexity of finding the smallest element in the list is $O(1)$ Asymptotic ... complexity of deleting a given element e in the list (not including the cost of finding it) is $O(1)$

GO Classes asked in DS Mar 26

212 views

0 votes

1 answer

15

Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.

Ujjaval251 asked in Programming Mar 14

170 views

2 votes

1 answer

16

TIFR CSE 2023 | Part B | Question: 8
Let $U$ be a finite set and let $h$ be a function mapping $U \times U$ to $U$. Consider the following process that assigns values to all nodes of a complete binary tree with $128$ leaves. Initially, the leaf nodes are assigned arbitrary values from $U$ ... algorithm need to recompute $h$ in order to obtain the correct value of the tree? $7$ $8$ $53$ $127$ $255$

admin asked in DS Mar 14

by admin

81 views

0 votes

1 answer

17

binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 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 value 4?

someshawasthi asked in DS Feb 27

by someshawasthi

171 views

4 votes

3 answers

18

GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$

admin asked in DS Feb 15

by admin

1.8k views

Page:

1
2
3
4
5
6
...
56
next »

Recent questions tagged data-structures