Register

Recent questions tagged data-structures

3 votes
1 answer
1231
quadratic probing collison loop count??
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions occured while mapping the given sequence is?
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions o...
User Avatar
0 votes
1 answer
1232
ace mock test
How many binary search trees can be formed with n distinct and designated(labeled) nodes...??
How many binary search trees can be formed with n distinct and designated(labeled) nodes...??
User Avatar
5 votes
4 answers
1233
Complexity of AVL
What is the worst case time complexity to construct an AVL tree from an array which satisfies the min heap property ? a) O(n log n) b) O(n2) c) O(n2 log n) d) O(n)
What is the worst case time complexity to construct an AVL tree from an array which satisfies the min heap property ?a) O(n log n)b) O(n2)c) O(n2 log n)d) O(n)
User Avatar
4 votes
2 answers
1238
Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision? $0.123$ $0.145$ $0.800$ $0.750$
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...
User Avatar
0 votes
1 answer
1239
Say true or false?
preorder traversal of a tree resemble to the DFS traversal of graph?
preorder traversal of a tree resemble to the DFS traversal of graph?
User Avatar
5 votes
2 answers
1243
Tree DFS
int func(Node root) { if(root == NULL) return 0; else if(root->left == NULL && root->right == NULL) return 2; else return(3 + func(root->left) + func(root->right)); } Above code is executed on the following rooted tree. What will be the output?
int func(Node root) { if(root == NULL) return 0; else if(root->left == NULL && root->right == NULL) return 2; else return(3 + func(root->left) + func(root->right)); }Abov...
User Avatar
0 votes
0 answers
1244
Stack
Consider a stack is implemented using an array. What is worst case time complexity of push operation? A) O(n) B) O(log n) C) O(n log n) D) O(1)
Consider a stack is implemented using an array. What is worst case time complexity of push operation?A) O(n)B) O(log n)C) O(n log n)D) O(1)
User Avatar
0 votes
0 answers
1245
testbook
what will be differnece if we use c)option and d) option explain ??
what will be differnece if we use c)option and d) option explain ??
User Avatar
6 votes
2 answers
1246
DS-CLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is NisA)O(1)B)O(log N)C)O(N)D)O(N...
User Avatar
2 votes
1 answer
1247
doubt
User Avatar
0 votes
1 answer
1248
General doubt on calculating the Time complexity for the given Insertion Sort Algorithm in the worst and average case
INSERTION-SORT (A, n) ⊳ A[1 . . n]for (j ← 2 to len(A) ){key ← A[ j];i ← j – 1 ; while (i 0 and A[i] key) { A[...
User Avatar
1 votes
0 answers
1250
MadeEasy Subject Test: Programming & DS - Binary Tree
here i have doubt what are the meaning of 4th if statement???
here i have doubt what are the meaning of 4th if statement???
User Avatar
4 votes
2 answers
1251
DS-BST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
If preorder of a BST is passed as an argument to the above function. Function returns 1 if,a)All the leaf nodes of the tree are at same levelb) All the nodes of the tree ...
User Avatar
3 votes
2 answers
1252
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data st...
User Avatar
4 votes
1 answer
1256
AVL Tree
What are we suppose to take? LR - 2 rotations. RL- 2 rotations. OR LR - 1 rotation. RL- 1 rotation. Kindly Solve and Verify the Total Numbers of Rotations Performed.
What are we suppose to take?LR - 2 rotations.RL- 2 rotations.ORLR - 1 rotation.RL- 1 rotation.Kindly Solve and Verify the Total Numbers of Rotations Performed.
User Avatar
1 votes
2 answers
1258
B + TREE DELETION
CAN SOMEONE PLZ EXPLAIN TO ME DELETION IN B+ TREES?? I AM NOT ABLE TO UNDERSTAND CLEARLY.
CAN SOMEONE PLZ EXPLAIN TO ME DELETION IN B+ TREES?? I AM NOT ABLE TO UNDERSTAND CLEARLY.
User Avatar
1 votes
1 answer
1260
MadeEasy Subject Test: Programming & DS - Heap
It should be 5 according to me.Pleas explain if they are correct.
It should be 5 according to me.Pleas explain if they are correct.
User Avatar
Page: