Recent questions and answers in DS - GATE CSE Doubts

0 votes

0 answers

NIELIT Scientist B CSE
The number of unused pointers in a complete binary tree of depth 5 is : (A) 4 (B) 8 (C) 16 (D) 32 According to me answer should be option (D), as there are 16 leaf nodes and therefore 32 pointers are unused at depth 5.

asked 1 day ago in DS by Ollie (7 points) | 4 views

0 votes

0 answers

ISI 2020 pcb cse
In a binary tree T, for a node v, the LEFT-HEIGHT(v) is the length of the longest path from v to any leaf in the left subtree of v. If v has no left child then LEFT-HEIGHT(v) = 0. The RIGHT-HEIGHT(v) is defined accordingly. A node v ... -HEIGHT(v) -RIGHT-HEIGHT(v)| ≤ 1. Design an efficient algorithm that, given a binary tree, enumerates all the nodes which are properly balanced.

asked Mar 24 in DS by Dn0047 (10 points) | 5 views

0 votes

0 answers

What is size of a heap? Is it the number of nodes that satisfy heap property? Please provide some examples, if possible

asked Mar 23 in DS by akshay7797 (8 points) | 8 views

0 votes

1 answer

icegate test series
the number of leaf nodes in a rooted tree of n nodes ,with each nodes having 0 or 3 children node is (A) n/2 (B) (n-1)/3 (C) (n-1)/2 (D) (2n+1)/3

answered Mar 3 in DS by Kushagra गुप्ता (297 points) | 24 views

0 votes

0 answers

Made aesy test series : BFS
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Take size of queue as by maximum number of elements at any time). What will be the correct answer for the foolowing question?

asked Feb 5 in DS by vishal burnwal (135 points) | 31 views

0 votes

0 answers

Testbook: Mock
In a BST, the key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9, not necessarily in that order. What is the probability that the 3rd element on the search path beginning from the root is either 3 or 8?

asked Jan 29 in DS by Sambhrant Maurya (401 points) | 83 views

0 votes

0 answers

applied gate mock 5
[closed]

asked Jan 27 in DS by abhinav649 (67 points) | 37 views

0 votes

1 answer

madeeasy test series answer doubt
https://csedoubts.gateoverflow.in/8774/made-easy-test-series-2020-min-heap what is the correct answer? 6 or 7

answered Jan 25 in DS by shashin (1.9k points) | 31 views

0 votes

0 answers

ISRO-2020 Exam
The Postorder traversal of a binary tree is ACEDBHIGF. the preorder Traversal is? ABCDEFGHI FBADCEGIH FABCDEGHI ABDCEFGIH

asked Jan 25 in DS by aditya dhanraj (7 points) | 13 views

0 votes

0 answers

Madeeasy test series - Retrieve address of element in matrix

asked Jan 21 in DS by luc_Bloodstone (36 points) | 20 views

0 votes

0 answers

Madeeasy test series - recurrence relation

asked Jan 21 in DS by luc_Bloodstone (36 points) | 7 views

0 votes

0 answers

Made Easy test series data structure binary search tree

asked Jan 21 in DS by Ram Swaroop (305 points) | 26 views

0 votes

0 answers

Enqueue and Dequeue

asked Jan 20 in DS by Akash Papnai (17 points) | 6 views

+1 vote

0 answers

Gatebook Heaps
What is the minimum number of comparisons required in the worst case to find the smallest element in a min-heap? Can someone please explain the procedure. The answer is 50*51 / 2

asked Jan 20 in DS by neeraj_bhatt (275 points) | 9 views

0 votes

0 answers

Applied course test series- DS
Which of the following statements is/are true? Converting an adjacency matrix representation to an adjacency list representation takes O(V+E) time. In any connected undirected graph with exactly 5 simple cycles (that do not share any edges), there are at most 10 ... between every pair of vertices Options: Only I Only II Both I and II Neither I nor II PS.: Answer is d.

asked Jan 18 in DS by Shubhranshu Maurya (8 points) | 18 views

0 votes

0 answers

Test series gateflix
No. of possible BST with n elements numbered 1,2,…,n with exactly two leaf nodes ?

asked Jan 12 in DS by Dipanshu Rana (34 points) | 13 views

0 votes

0 answers

Applied course test series : Queue
Consider a circular queue q' is implemented whose size is given 15 and the locations of the elements of the queue are q[0],q[1],q[2], .,q[14]. In this given circular queue currently rear is pointing at q[7] after inserting 11th element, then find the position of front ... ,...). A) q[2] B) q[3] C) q[11] D) q[12] What will be the correct answer for above question?

asked Jan 7 in DS by vishal burnwal (135 points) | 15 views

0 votes

0 answers

MadeEasy FULL SYLLABUS TEST-5 (ADVANCE LEVEL) GATE 2020 - Q35 BST

asked Jan 5 in DS by DukeThunders (415 points) | 19 views

0 votes

0 answers

Cormen 3e BST Exercise-12.2-8 page no-294
Prove that no matter what node we start at in a height-h binary search tree, k successive calls to TREE-SUCCESSOR take O(k + h) time

asked Jan 3 in DS by aditi19 (55 points) | 16 views

0 votes

0 answers

Made easy Q48 Full length 2019
Please Explain

asked Jan 1 in DS by ssap09 (42 points) | 29 views

0 votes

1 answer

ACE Subject wise test
, A tree is an undirected graph G that satisfies Q)G is connected and the 3-vertex complete graph K3 is not a minor of G. T/F (what is minor of G)??

answered Dec 29, 2019 in DS by Pratyush Priyam Kuan (804 points) | 31 views

0 votes

1 answer

MadeEasy FULL SYLLABUS TEST-1 (BASIC LEVEL) GATE 2020 Q58

answered Dec 29, 2019 in DS by neeraj_bhatt (275 points) | 27 views

0 votes

1 answer

ACE FULL LENGTH MOCK TEST-1
What is the converse pre-order of the following binary tree if the given in-order and post-order as follows In-order:ACDEBGHF Post-order:ADECHFGB a)BCAEDGFH b)BCAEDGHF c)BCADEGFH d)BGFHCEDA

answered Dec 24, 2019 in DS by Pratyush Priyam Kuan (804 points) | 33 views

0 votes

0 answers

ACE- DS Test Series
Consider a BST T with all distinct keys. If the right subtree of a node X in the tree T is empty and X has inorder successor, the minimum number of ancestor of node X is_______________(Every node is considered to be it’s own ancestor also) Given ans 2 and my ans 1. Which one correct?

asked Dec 22, 2019 in DS by srestha (683 points) | 15 views

0 votes

0 answers

MadeEasy Multi Subject DS+Algo 2020 Test Q33 Max Heap

asked Dec 21, 2019 in DS by DukeThunders (415 points) | 31 views

+1 vote

0 answers

#data structute
Q.how many stack are required to calculate prefix and postfix expression?

asked Dec 17, 2019 in DS by amit166 (139 points) | 7 views

0 votes

2 answers

Self Doubt-Arrays
$3-d\ array:$ $A[5….11,3…7,6….16]$ Using column major order and row major order find: $location\left ( A[9][5][14] \right )=?$ take BA: 1000 and int size: 10 bytes

answered Dec 13, 2019 in DS by Mk Utkarsh (505 points) | 81 views

0 votes

0 answers

Applied course test series : Topological sorting
Which of the following is not the topological sorting of the below graph. A) 1,2,3,4,5,6,7,8,9,10,11 B) 1,3,2,5,4,6,7,8,9,10,11 C) 1,3,2,4,5,6,8,7,10,9,11 D) 1,3,2,4,5,6,8,7,9,10,11 My doubt is that according to me all the four orders given are correct ,but they provided (D) as the answer. Are they right?

asked Dec 12, 2019 in DS by vishal burnwal (135 points) | 23 views

0 votes

1 answer

ME - test series
Consider 3 dimensional array $A[90][30][40]$ stored in linear array in column major order, if the base address starts at $10$, what is the location of $A[20][20][30]$? Assume the first element is stored at $A[1][1][1]$. Solution given is: But I think that is row major order. Isn’t it?

answered Dec 11, 2019 in DS by arya_stark (64 points) | 77 views

0 votes

1 answer

GATEBOOK DSA
You are given a hash table with n keys and m slots, with the simple uniform hashing (assume each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. What is the expected number of slots that end up not being empty ?

answered Dec 10, 2019 in DS by goxul (377 points) | 39 views

0 votes

1 answer

GATE GURU:DSA 596
What is the worst case time complexity to delete random element in a binary heap 1. O(nlogn) 2. O(logn) 3. O(n2) 4. O(n)

answered Dec 7, 2019 in DS by Pratyush Priyam Kuan (804 points) | 19 views

0 votes

0 answers

Made easy test series : Binary Search Tree
A binary search tree with n nodes is constructed. Along with the key each node stores the no. of elements in the sub tree rooted at that node . We have given two elements a and b ,such that a<b . What will be the no. of comparisons and addition ... n) C.) O(log n) and O(loglog n) D.) O(n) and O(n) Plz explain above question and give solution.

asked Dec 5, 2019 in DS by vishal burnwal (135 points) | 14 views

0 votes

0 answers

#DataStructure#METest_Series
Why b option is wrong? For root it should be valid. Plz explain

asked Dec 3, 2019 in DS by nandani17 (33 points) | 12 views

0 votes

1 answer

Made Easy Test Series:DS
The number of min heaps possible with 15 distinct elements such that every leaf node is greater than all the non-leaf nodes are ______ [closed]

answered Nov 27, 2019 in DS by srestha (683 points) | 43 views

0 votes

0 answers

Made Easy Test Series DS
The number of BSTs possible with 6 nodes numbered 1,2,3,4,5,6 with exactly one leaf node are _______

asked Nov 27, 2019 in DS by Sambhrant Maurya (401 points) | 39 views

0 votes

0 answers

GATE GURU: P & DS
The height h of an AVL tree with n nodes lies in the interval: 1. log10 (n) ≤ h < c log10 (n+1)+b 2. log2 (n) ≤ h < c log2 (n+1)+b 3. log10 (n+1) ≤ h < c log10 (n+2)+b 4. log2 (n+1) ≤ h < c log2 (n+2)+b Not able to understand the question, can anyone answer?

asked Nov 21, 2019 in DS by Debapaul (699 points) | 12 views

0 votes

1 answer

GATE GURU :DSA 2020 TOPIC TEST
Which of the following does not define a tree ? 1. A tree is an acyclic graph with n-1 edges where n' is the number of vertices in the graph. 2. A tree is a connected acyclic graph. 3. A tree is an acyclic connected graph with n-1 edges where n' is ... 't all the options right? Ans given is D, but how can D be the ans, as a graph with no cycles must be a tree right?

answered Nov 21, 2019 in DS by Satbir (4.1k points) | 14 views

0 votes

0 answers

GATE GURU TEST : DSA
consider the following infix expression (P+Q*R^S)/(P+Q^S) What is the minimum size of stack required to convert this infix expression to postfix expression?

asked Nov 19, 2019 in DS by Debapaul (699 points) | 36 views

0 votes

0 answers

madeeasy test
Number of min heap tree possible with 15 distinct element such that every leaf node must be greater than all non-leaf nodes of the tree are_______________. ans given as 8! * 4! * 2! *1( as it's assuming that always leaf nodes are maximum than any other ... other non-leaf node). suppose, 2648957(consider elements in an array) see 5 & 6 How can we count this type of combinatons.

asked Nov 17, 2019 in DS by MRINMOY_HALDER (37 points) | 22 views

0 votes

0 answers

Made Easy Test Series 2020 Min heap
Consider the following array elements <40,35,20,10,15,16,17,8,4,30> The minimum number of interchanges needed to convert into a min heap using build heap method is ? I am getting 7 as the answer but it is given 6 as the answer kindly help me understand where i am going wrong.

asked Nov 7, 2019 in DS by Piyush #### (9 points) | 38 views

To see more, click for all the questions in this category.

Recent questions and answers in DS

3,522 questions

1,658 answers

10,465 comments

90,046 users