Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged data-structures
0
votes
2
answers
241
ACE Test Series
A ) B ) C ) D )
ramakrushna
asked
in
DS
Jan 27, 2022
by
ramakrushna
395
views
data-structures
binary-heap
ace-test-series
0
votes
1
answer
242
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)
Sagar475
asked
in
DS
Jan 21, 2022
by
Sagar475
359
views
data-structures
binary-heap
numerical-answers
applied-gate-test-series
0
votes
1
answer
243
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
atulcse
asked
in
DS
Jan 16, 2022
by
atulcse
331
views
data-structures
binary-heap
made-easy-test-series
numerical-answers
1
vote
2
answers
244
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)
lalitver10
asked
in
Programming
Jan 13, 2022
by
lalitver10
607
views
binary-heap
data-structures
heap-sort
time-complexity
0
votes
1
answer
245
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?
Crackcer
asked
in
Databases
Jan 10, 2022
by
Crackcer
139
views
data-structures
0
votes
2
answers
246
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
lalitver10
asked
in
Programming
Jan 10, 2022
by
lalitver10
215
views
data-structures
binary-heap
1
vote
1
answer
247
Applied Test Series: Live Mock
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexing starts at 0 what would be the address of element with index (25,25)), ... integer takes up two bytes of memory.___ Need help in this one. Didn't get the solution properly provided by them. Anyone!
ramakrushna
asked
in
DS
Jan 10, 2022
by
ramakrushna
351
views
test-series
data-structures
array
4
votes
1
answer
248
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!
ramakrushna
asked
in
Programming
Dec 31, 2021
by
ramakrushna
648
views
test-series
data-structures
binary-search-tree
0
votes
1
answer
249
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.$
Nishisahu
asked
in
DS
Dec 25, 2021
by
Nishisahu
767
views
data-structures
binary-tree
made-easy-test-series
numerical-answers
0
votes
1
answer
250
Geeks Quiz
rsansiya111
asked
in
DS
Dec 18, 2021
by
rsansiya111
211
views
data-structures
linked-list
geeksforgeeks-test-series
0
votes
1
answer
251
Testbook Test Series
rsansiya111
asked
in
DS
Dec 16, 2021
by
rsansiya111
185
views
data-structures
avl-tree
testbook-test-series
1
vote
1
answer
252
NPTEL Assignment Question
What is the complexity of inorder traversal for a binary search tree with n nodes? O(log n) whether the tree is balanced or unbalanced. O(log n) if the tree is balanced, O(n) otherwise. O(n) whether the tree is balanced or unbalanced. O(n) if the tree is balanced, O(n log n) otherwise.
rsansiya111
asked
in
DS
Dec 8, 2021
by
rsansiya111
299
views
data-structures
nptel-quiz
binary-search-tree
time-complexity
0
votes
0
answers
253
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.
Rajat Agrawal007
asked
in
DS
Dec 7, 2021
by
Rajat Agrawal007
238
views
made-easy-test-series
data-structures
avl-tree
1
vote
0
answers
254
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$
rsansiya111
asked
in
DS
Dec 6, 2021
by
rsansiya111
240
views
data-structures
0
votes
1
answer
255
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
rsansiya111
asked
in
DS
Dec 6, 2021
by
rsansiya111
305
views
data-structures
0
votes
1
answer
256
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
rsansiya111
asked
in
Algorithms
Dec 6, 2021
by
rsansiya111
151
views
data-structures
algorithms
2
votes
0
answers
257
TestBook
In a Binary Search Tree, a key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessary in the same order. Lets P is the probability that 3rd element in the search path beginning from root is either 3 or 8, and N ... orders possible in which given nodes can be traversed before finding node with value 5. Find (N/10) + P Please someone explain the solution.
Rajat Agrawal007
asked
in
DS
Dec 5, 2021
by
Rajat Agrawal007
208
views
testbook-test-series
data-structures
binary-search-tree
1
vote
1
answer
258
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 ?
Rajat Agrawal007
asked
in
Programming
Dec 3, 2021
by
Rajat Agrawal007
283
views
made-easy-test-series
data-structures
programming-in-c
0
votes
1
answer
259
#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)
Shraddha dwevedi
asked
in
Algorithms
Nov 25, 2021
by
Shraddha dwevedi
190
views
made-easy-booklet
data-structures
huffman-code
0
votes
1
answer
260
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
Shraddha dwevedi
asked
in
DS
Nov 25, 2021
by
Shraddha dwevedi
213
views
made-easy-booklet
data-structures
priority-queue
1
vote
1
answer
261
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
casberg
asked
in
DS
Nov 23, 2021
by
casberg
244
views
data-structures
b-tree
tree
ace-booklet
0
votes
1
answer
262
Data structure: hashing
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______. 10% of 50 = 5, so we need to find the probability of collision before we insert 5 slots. *When hash table empty, prob. of ... no. of slots = 200 then probability = 0.95 Why probability of collision is increasing very rapidly? Please give a detailed explanation.
Crackca
asked
in
DS
Nov 22, 2021
by
Crackca
527
views
hashing
data-structures
1
vote
1
answer
263
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___.
LRU
asked
in
DS
Nov 22, 2021
by
LRU
537
views
data-structures
binary-search-tree
numerical-answers
applied-gate-test-series
1
vote
1
answer
264
Self Doubt
What order should we insert the elements {1, 2. . . , 7} into an empty AVL tree so that we don’t have to perform any rotations on it ?
LRU
asked
in
DS
Nov 18, 2021
by
LRU
239
views
data-structures
avl-tree
2
votes
1
answer
265
Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
LRU
asked
in
DS
Nov 3, 2021
by
LRU
547
views
data-structures
binary-heap
time-complexity
applied-gate-test-series
1
vote
1
answer
266
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
LRU
asked
in
DS
Oct 4, 2021
by
LRU
244
views
data-structures
binary-search-tree
applied-gate-test-series
0
votes
2
answers
267
Data Structure
How to use substitution method
flash12
asked
in
Programming
Sep 26, 2021
by
flash12
217
views
data-structures
1
vote
2
answers
268
Self Doubt
How many min heap possible with 6 distinct node?
Nishisahu
asked
in
DS
Sep 23, 2021
by
Nishisahu
266
views
data-structures
binary-heap
counting
Page:
« prev
1
...
4
5
6
7
8
9
10
11
12
13
14
...
55
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent questions tagged data-structures
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...