Register

Made Easy DS doubt
closed

• closed by
1,013 views
0 0 votes
closed as a duplicate of: MADEASY TESTSERIES DS

IS IT CORRECT…??

 

Voting & Accepting an answer helps improve the community
← Previous · Fixed partitioningNext → · Made Easy2019
← Previous in category · GATE Overflow | Mock...Next in category → · Made Easy2019
Position:
Show:

Related questions

7 7 votes
4 4 answers
6.2k
6.2k views
srestha asked May 5, 2019
6,196 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 th...
0 0 votes
1 1 answer
2.3k
2.3k views
srestha asked May 3, 2019
2,349 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)) return 10;...
1 1 vote
1 1 answer
929
929 views
srestha asked May 2, 2019
929 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 is kept in $A...
1 1 vote
2 answers 2 answers
3.3k
3.3k views
srestha asked Apr 26, 2019
3,311 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}$ and $t...