Register

Made Easy DS doubt
closed

• closed by
470 views
0 votes
0 votes
closed as a duplicate of: MADEASY TESTSERIES DS

IS IT CORRECT…??

 

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5.2k
views
4 answers
7 votes
srestha asked May 5, 2019
5,199 views
Made Easy Test Series: DS-Hash Table
Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that the last $k$ slots are ... {r-1}$D)\left ( 1-\frac{k}{N} \right )^{r-1}$
User Avatar
2.0k
views
1 answers
0 votes
srestha asked May 3, 2019
2,003 views
Made Easy Test Series:DS-Binary Tree
Consider the following function foobar(), which takes binary tree as input.int foobar(struct node *root){ if(!root) return 0; if((!root->left)&&(!root->right) ... $D)$ NoneWhat return $10$ actually means?
User Avatar
527
views
1 answers
1 votes
srestha asked May 2, 2019
527 views
Made Easy Test Series: DS
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root ... in solving it, because of this equation $A\left [ d^{2}+d+2 \right ]$
User Avatar
2.3k
views
2 answers
1 votes
srestha asked Apr 26, 2019
2,277 views
Made Easy Test Series:DS-Stack and Queue
Consider a single array $A\left [ 0...........(n-1) \right ]$ is used to implement two stacks. Two stacks grows from opposite end of the array. Variable $top_{1}$ ... $B)n+1-top_{2}+top_{1}$
User Avatar
Link Copied!