Recent questions in DS

Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&4&2&2&0&2&3&1&1&1&0&1.7&4
\\\hline\textbf{2 Marks Count}&1&0&3&2&0&0&1&3&3&0&1.2&3
\\\hline\textbf{Total Marks}&6&2&4&4&2&3&3&7&7&\bf{2}&\bf{4.2}&\bf{7}\\\hline
\end{array}}}$$

0 votes

0 answers

BARC 2020 CS interview question
In a program, you build a tree(non-empty) according to some inputs in the program. Now you have to shutdown your computer and the next day you need to work on this already build tree(do not build the tree again from scratch). How would ... something else to get the already build tree? The tree can be binary or non-binary but non-empty. Give a detailed explanation.

rayg asked in DS 5 days ago

by rayg

53 views

1 vote

2 answers

Self Doubt
How many min heap possible with 6 distinct node?

Nishisahu asked in DS Sep 23

by Nishisahu

73 views

0 votes

1 answer

#self_doubt #BST
The number of ways in which the numbers $1,2,3,4,5,6,7$ can be inserted in an empty binary search tree, such that the resulting tree has height $5$, is _________. Note: The height of a tree with a single node is 0.

Divyanshu Shukla asked in DS Sep 20

by Divyanshu Shukla

103 views

0 votes

2 answers

#linkedlist #pointers #datastructure
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perform this task?

Crackca asked in DS Sep 9

by Crackca

73 views

4 votes

3 answers

GATE CSE 2021 Set 2 | Question: 2
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in $H$? $\Theta (1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$

Arjun asked in DS Feb 18

by Arjun

2.2k views

4 votes

3 answers

GATE CSE 2021 Set 2 | Question: 16
Consider a complete binary tree with $7$ nodes. Let $A$ denote the set of first $3$ elements obtained by performing Breadth-First Search $\text{(BFS)}$ starting from the root. Let $B$ denote the set of first $3$ elements obtained by performing Depth-First Search $\text{(DFS)}$ starting from the root. The value of $\mid A-B \mid $ is _____________

Arjun asked in DS Feb 18

by Arjun

2.3k views

7 votes

4 answers

GATE CSE 2021 Set 1 | Question: 2
Let $P$ be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct ... $t>\lceil \log_2(n)\rceil \text{ and } t\leq n$

Arjun asked in DS Feb 18

by Arjun

2.8k views

8 votes

3 answers

GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$

Arjun asked in DS Feb 18

by Arjun

2.8k views

2 votes

3 answers

GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.

Arjun asked in DS Feb 18

by Arjun

1.8k views

7 votes

2 answers

GATE CSE 2021 Set 1 | Question: 41
An $articulation$ $point$ in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let $T$ be a $\text{DFS}$ tree obtained by doing $\text{DFS}$ ... is a descendent of $u$ in $T$, then all paths from $x$ to $y$ in $G$ must pass through $u$.

Arjun asked in DS Feb 18

by Arjun

3.4k views

1 vote

1 answer

NIELIT Scientist B 2020 November: 45
The Preorder traversal of a tree given below is: $\text{A B D F E C G I H J K L}$ $\text{A B C D E G H F I J K L}$ $\text{A B E D F C G H I J K L}$ $\text{A B D F E C G I J H K L}$

gatecse asked in DS Dec 9, 2020

by gatecse

113 views

0 votes

2 answers

UGCNET-Oct2020-II: 23
A complete $n$-ary tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n$-ary tree. If $L=41$, and $I=10$, what is the value of $n$? $3$ $4$ $5$ $6$

jothee asked in DS Nov 20, 2020

by jothee

719 views

3 votes

2 answers

UGCNET-Oct2020-II: 24
In a binary max heap containing $n$ numbers, the smallest element can be found in ______ $O(n)$ $O(\log _2 n)$ $O(1)$ $O(\log_2 \log_2 n)$

jothee asked in DS Nov 20, 2020

by jothee

450 views

0 votes

1 answer

UGCNET-Oct2020-II: 63
Which of the following statements are true? Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level. The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined The alpha-beta search algorithms ... $(a)$ and $(d)$ only $(b)$ and $(c)$ only $(c)$ and $(d)$ only

jothee asked in DS Nov 20, 2020

by jothee

715 views

0 votes

1 answer

UGCNET-Oct2020-II: 64
Match $\text{List I}$ with $\text{List II}$ Let $R_1=\{(1,1), (2,2), (3,3)\}$ and $R_2=\{(1,1), (1,2), (1,3), (1,4)\}$ ... given below: $A-I, B-II, C-IV, D-III$ $A-I, B-IV, C-III, D-II$ $A-I, B-III, C-II, D-IV$ $A-I, B-IV, C-II, D-III$

jothee asked in DS Nov 20, 2020

by jothee

293 views

1 vote

2 answers

NIELIT 2016 MAR Scientist C - Section C: 30
A hash table with $10$ buckets with one slot per bucket is depicted. The symbols, $S1$ to $S7$ are initially emerged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is $6$ $5$ $4$ $3$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

454 views

1 vote

1 answer

NIELIT 2016 MAR Scientist C - Section C: 31
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

345 views

0 votes

1 answer

NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

293 views

0 votes

1 answer

NIELIT 2016 MAR Scientist C - Section C: 50
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient ... $\Theta(n)$ $\Theta(n \log n)$ None of the above, as the tree cannot be uniquely determined.

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

328 views

0 votes

1 answer

NIELIT 2016 MAR Scientist C - Section C: 52
Consider the process of inserting an element into a $Max\ Heap$, where the $Max\ Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ ... $\Theta(n\log _{2} \log_2 n)$ $\Theta (n)$ $\Theta(n\log _{2}n)$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

923 views

Page:

Ask

Follow @gateoverflow

GATE Overflow

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions in DS

GO Book for GATECSE 2022

Subscribe to GATE CSE 2022 Test Series

Subscribe to GO Classes for GATE CSE 2022

Subjects

Network Sites

Recent questions in DS

GO Book for GATECSE 2022

Subscribe to GATE CSE 2022 Test Series

Subscribe to GO Classes for GATE CSE 2022

Recent Posts

Subjects

Recent Blog Comments

Network Sites