Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged data-structures
13
votes
3
answers
271
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, 2021
by
Arjun
7.2k
views
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
6
votes
3
answers
272
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, 2021
by
Arjun
5.2k
views
gatecse-2021-set1
data-structures
stack
numerical-answers
1-mark
14
votes
2
answers
273
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, 2021
by
Arjun
9.1k
views
gatecse-2021-set1
multiple-selects
data-structures
tree
2-marks
1
vote
1
answer
274
NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
139
views
nielit-sta-2020
data-structures
queue
1
vote
1
answer
275
NIELIT Scientific Assistant A 2020 November: 93
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Heap tree almost complete binary tree Binary search tree Cannot be determined
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
113
views
nielit-sta-2020
data-structures
binary-search-tree
1
vote
1
answer
276
NIELIT Scientific Assistant A 2020 November: 109
A program $\text{P}$ reads in $500$ integers in the range $[0\dots100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50.$ What would be the best way for $\text{P}$ to store the ... An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
364
views
nielit-sta-2020
data-structures
array
easy
1
vote
1
answer
277
NIELIT Scientific Assistant A 2020 November: 114
Priority queue is implemented by : Doubly link list Graph Heap Stack
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
154
views
nielit-sta-2020
data-structures
queue
1
vote
1
answer
278
NIELIT Scientific Assistant A 2020 November: 115
A recursive problem like tower of hanoi can be rewritten without recursion using: stack priority queue graph cycles
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
138
views
nielit-sta-2020
data-structures
stack
0
votes
3
answers
279
UGC NET CSE | October 2020 | Part 2 | Question: 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$
go_editor
asked
in
DS
Nov 20, 2020
by
go_editor
2.9k
views
ugcnetcse-oct2020-paper2
data-structures
binary-tree
3
votes
2
answers
280
UGC NET CSE | October 2020 | Part 2 | Question: 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)$
go_editor
asked
in
DS
Nov 20, 2020
by
go_editor
865
views
ugcnetcse-oct2020-paper2
data-structures
binary-heap
0
votes
1
answer
281
UGC NET CSE | October 2020 | Part 2 | Question: 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- ... $(a)$ and $(d)$ only $(b)$ and $(c)$ only $(c)$ and $(d)$ only
go_editor
asked
in
DS
Nov 20, 2020
by
go_editor
1.6k
views
ugcnetcse-oct2020-paper2
data-structures
breadth-first-search
1
vote
2
answers
282
UGC NET CSE | October 2020 | Part 2 | Question: 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)\}$ ... $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$
go_editor
asked
in
DS
Nov 20, 2020
by
go_editor
597
views
ugcnetcse-oct2020-paper2
data-structures
relational-algebra
1
vote
2
answers
283
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
725
views
nielit2016mar-scientistc
data-structures
hashing
1
vote
2
answers
284
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
576
views
nielit2016mar-scientistc
data-structures
binary-tree
0
votes
1
answer
285
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
445
views
nielit2016mar-scientistc
data-structures
binary-heap
0
votes
1
answer
286
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
536
views
nielit2016mar-scientistc
data-structures
binary-search-tree
2
votes
1
answer
287
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
1.4k
views
nielit2016mar-scientistc
data-structures
binary-search
time-complexity
heap
0
votes
2
answers
288
NIELIT 2016 MAR Scientist C - Section C: 54
In a circularly linked list organization, insertion of a record involves the modification of no pointer $1$ pointer $2$ pointers $3$ pointers
Lakshman Patel RJIT
asked
in
DS
Apr 2, 2020
by
Lakshman Patel RJIT
619
views
nielit2016mar-scientistc
data-structures
linked-list
2
votes
0
answers
289
NIELIT 2016 MAR Scientist C - Section C: 55
To sort many large objects or structures, it would be most efficient to place them in an array and sort the array pointers to them in an array and sort the array them in a linked list and sort the linked list references to them in an array and sort the array
Lakshman Patel RJIT
asked
in
DS
Apr 2, 2020
by
Lakshman Patel RJIT
934
views
nielit2016mar-scientistc
data-structures
array
2
votes
2
answers
290
NIELIT 2016 MAR Scientist C - Section C: 56
The average search time of hashing, with linear probing will be less if the load factor is far less than one equals one is far greater than one none of these
Lakshman Patel RJIT
asked
in
DS
Apr 2, 2020
by
Lakshman Patel RJIT
557
views
nielit2016mar-scientistc
data-structures
hashing
1
vote
1
answer
291
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
800
views
nielit2017oct-assistanta-it
data-structures
binary-tree
0
votes
2
answers
292
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
494
views
nielit2017oct-assistanta-it
data-structures
queue
0
votes
2
answers
293
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
1.9k
views
nielit2017oct-assistanta-it
data-structures
queue
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
54
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged data-structures
Recent Blog Comments
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man