Register

Recent questions tagged data-structures

0 votes
3 answers
211
Stacks
The maximum size of the operator stack when converting the following infix to postfix expression a ^ b * c * d + e * f ^ g (assume that “^” has highest precedence and right associativity) and also output the postfix expression.
The maximum size of the operator stack when converting the following infix to postfix expressiona ^ b * c * d + e * f ^ g (assume that “^” has highest precedence and ...
User Avatar
0 votes
1 answer
212
Ace Test Series Data Structure Q9
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristics Singly link list with head and tail pointer Doubly link list with only head pointer Binary tree Array
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...
User Avatar
1 votes
0 answers
213
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
User Avatar
0 votes
0 answers
214
Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
User Avatar
0 votes
1 answer
215
Self-Doubt: Stack Overflow in LinkedList
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
User Avatar
–4 votes
2 answers
216
Data Structure- Tree & Graphs
*MSQ* The following figure depicts a a. A tree and only tree b. A tree with 3 nodes c. A graph (Since every tree is a graph) d. A graph and only graph
*MSQ*The following figure depicts a a. A tree and only treeb. A tree with 3 nodesc. A graph (Since every tree is a graph)d. A graph and only graph
User Avatar
1 votes
0 answers
217
AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
User Avatar
6 votes
0 answers
218
5. Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume the first element is stored at A [2][2][2] and each element take 2 byte.
Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume ...
User Avatar
0 votes
0 answers
219
Data Structure
Not able to understand the last option.
Not able to understand the last option.
User Avatar
0 votes
1 answer
220
Data Structure
Can we determine unique tree by Inorder and level order traversal .
Can we determine unique tree by Inorder and level order traversal .
User Avatar
0 votes
0 answers
221
Doubt
DOUBT 1: if head = P → link. is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them? and we will left with only three nodes like DOUBT 2: what does head = (*P).link; equals to?
DOUBT 1: if head = P → link.is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them?and we will ...
User Avatar
Page: