Register

Recent questions tagged data-structures

0 votes
1 answer
1201
Binary Tree
User Avatar
0 votes
1 answer
1205
AVL trees
User Avatar
0 votes
0 answers
1206
Hashing Question
Why 4 is multiplied in part. In the solution.
Why 4 is multiplied in part. In the solution.
User Avatar
5 votes
6 answers
1207
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
User Avatar
0 votes
1 answer
1208
Made easy
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the following will represents the worst case time complexity ? Ο(n) Ο(n log n) Ο(n2) Ο(1)
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the followin...
User Avatar
2 votes
1 answer
1209
Stack Doubt
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n) I thought in terms of push - pop pairs but cant arrive at the answer @arjun sir , @bikram sir
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n)I thought in terms of push - pop pairs but cant arrive at the answer ...
User Avatar
1 votes
1 answer
1213
Test by Bikram | Mock GATE | Test 2 | Question: 32
Suppose that six keys are inserted into an unbalanced binary search tree in the following order: $4, 6, 3, 8, 2$, and $5$ ... without adding another level to the tree. I and II only I and III only II and III only I, II, and III
Suppose that six keys are inserted into an unbalanced binary search tree in the following order: $4, 6, 3, 8, 2$, and $5$.Then which of the following statements is/are co...
User Avatar
0 votes
1 answer
1219
Testbook
#plz check?? i think its 7 ??
#plz check?? i think its 7 ??
User Avatar
0 votes
0 answers
1220
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
User Avatar
1 votes
1 answer
1223
MadeEasy Subject Test: Algorithms - Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtreewhat is the time complexity?
User Avatar
0 votes
0 answers
1224
MadeEasy Subject Test: Programming & DS - Stack
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operations, the keys chosen are in Strictly decreasing order. How?
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operati...
User Avatar
1 votes
2 answers
1225
Virtual Gate Test Series: Programming & DS - Infix Notation
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
User Avatar
4 votes
1 answer
1227
Time to build a heap
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
User Avatar
0 votes
1 answer
1228
testbook
is it correct >>??
is it correct >>??
User Avatar
3 votes
1 answer
1230
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
Page: