Register

Recent questions tagged data-structures

1 votes
1 answer
391
Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element i...
User Avatar
1 votes
2 answers
393
Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
Question The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
User Avatar
0 votes
1 answer
394
Order of B and B+ tree(ACE academy test series)
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103. 2. A B+ tree with internal order is 171 and leaf node with order 103. In both scenarios what is the order of the tree?
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
User Avatar
0 votes
2 answers
395
Gate-Applied-test
Which of the following arrays do not represent a min heap. A. 1, 2, 4, 8, 12, 6, 7, 10, 11 7, 10, 12, 11, 17, 19, 2 25, 27, 28, 30, 32, 34, 27 90, 95, 100, 110, 120, 130, 99
Which of the following arrays do not represent a min heap. A. 1, 2, 4, 8, 12, 6, 7, 10, 11 7, 10, 12, 11, 17, 19, 2 25, 27, 28, 30, 32, 34, 27 90, 95, 100, 11...
User Avatar
4 votes
1 answer
397
Applied Test series: DS
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BST How to tackle this kind of problem. Anyone!
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!
User Avatar
1 votes
1 answer
398
Made Easy Test
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is divisible by $4.$
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is di...
User Avatar
0 votes
1 answer
399
Geeks Quiz
User Avatar
0 votes
1 answer
400
Testbook Test Series
User Avatar
0 votes
0 answers
402
made easy
Given AVL tree is originally balanced. If a node is added to T1 so that height T1 becomes h+1 from h and z is the first node which is now imbalanced, Then find the height of T3? h h+1 h+2 h+3 Please someone explain the solution.
Given AVL tree is originally balanced. If a node is added to T1 so that height T1 becomes h+1 from h and z is the first node which is now imbalanced, Then find the height...
User Avatar
1 votes
0 answers
403
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$ (n + m) $log_{2} m$ mn $log_{2} n$ mn $log_{2} m$
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
User Avatar
0 votes
1 answer
404
NIELIT STA 2021
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1 $2n^{2}$ 2^n 2n – 1
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1$2n^{2}$2^n2n – 1
User Avatar
0 votes
1 answer
405
NIELIT STA 2021
Worst Case scenario in case of linear search algorithm is_______________. Item is somewhere in the middle of the array Item is not in the array at all Item is the last element in the array Item is the last element in the array or is not there at all
Worst Case scenario in case of linear search algorithm is_______________.Item is somewhere in the middle of the arrayItem is not in the array at allItem is the last eleme...
User Avatar
2 votes
1 answer
407
MadeEasy Test Series
#include <stdio.h> int main() { static int i = 6; if(--i) { main(); printf("%d", i+1); } return 0; } Please explain the output of this program ?
#include <stdio.h>int main(){ static int i = 6; if( i) { main(); printf("%d", i+1); } return 0;}Please explain the output of this program ?
User Avatar
0 votes
1 answer
408
#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...
User Avatar
0 votes
1 answer
409
Made easy workbook question
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue? a. Binary heap b. Height balanced binary tree. c. Sorted array
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?a. Binary heapb. Height balanced binary tree.c. Sorted array
User Avatar
1 votes
1 answer
410
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
User Avatar
2 votes
1 answer
412
Applied Grand Test 2
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
User Avatar
2 votes
1 answer
413
Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
User Avatar
1 votes
1 answer
414
Applied Test Series
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order
User Avatar
0 votes
2 answers
415
Data Structure
How to use substitution method
How to use substitution method
User Avatar
1 votes
2 answers
416
Self Doubt
How many min heap possible with 6 distinct node?
How many min heap possible with 6 distinct node?
User Avatar
0 votes
2 answers
417
#self_doubt #BST
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 $5$, is _________. Note: The height of a tree with a single node is 0.
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 $5$, is _________.Note: Th...
User Avatar
Page: