The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions and answers in DS
+2
votes
2
answers
1
ISRO20204
Convert the prefix expression to infix $*+ABC*DE+FG$ $(AB)*C+(D*E)(F+G)$ $(A+B)*C(DE)*(FG)$ $(A+BC)*(DE)*(F+G)$ $(A+B)*C(D*E)(F+G)$
answered
5 hours
ago
in
DS
by
smsubham
Boss
(
11.5k
points)

127
views
isro2020
datastructures
infixpostfix
normal
+1
vote
1
answer
2
ISRO202024
In linear hashing, if blocking factor $bfr$, loading factor $i$ and file buckets $N$ are known, the number of records will be $cr= i+bfr+N$ $r=ibfrN$ $r=i+bfrN$ $r=i*bfr*N$
answered
23 hours
ago
in
DS
by
arjun0001
(
57
points)

79
views
isro2020
datastructures
hashing
normal
+53
votes
9
answers
3
GATE2014112
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
answered
1 day
ago
in
DS
by
JashanArora
Loyal
(
6.2k
points)

6.6k
views
gate20141
datastructures
binarytree
numericalanswers
normal
+3
votes
2
answers
4
Hashing
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a chain of 3 created?
answered
2 days
ago
in
DS
by
vizzard110
(
423
points)

205
views
+1
vote
1
answer
5
ISRO202018
Consider a $2$dimensional array $x$ with $10$ rows and $4$ columns, with each element storing a value equivalent to the product of row number and column number. The arrow is stored in rowmajor format. If the first element $x[0][0]$ occupies the memory location ... , which all locations (in decimal) will be holding a value of $10$? $1018,1019$ $1022,1041$ $1013,1014$ $1000,1399$
answered
5 days
ago
in
DS
by
arvin
Boss
(
12.1k
points)

237
views
isro2020
datastructures
arrays
normal
+1
vote
1
answer
6
ISRO202032
$G$ is an undirected graph with vertex set $\{v1,v2,v3,v4,v5,v6,v7\}$ and edge set $\{v1v2,\ v1v3,\ v1v4\ ,v2v4,\ v2v5,\ v3v4,\ v4v5,\ v4v6,\ v5v6,\ v6v7\ \}$. A breadth first search of the graph is performed with $v1$ as the root node. Which of the following is a tree edge ? $v2v4$ $v1v4$ $v4v5$ $v3v4$
answered
Jan 13
in
DS
by
habedo007
Active
(
2.8k
points)

120
views
isro2020
datastructures
bfs
normal
+2
votes
2
answers
7
ISRO202071
Of the following which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$ary tree of depth $N$ ? $1/N$ $N1/N$ $1/K$ $K1/K$
answered
Jan 13
in
DS
by
Prithwish Jana
(
77
points)

122
views
isro2020
datastructures
trees
normal
+2
votes
1
answer
8
ISRO202072
A stack is implemented with an array of $A[0...N1]$' and a variable $pos$'. The push and pop operations are defined by the following code. push (x) A[pos] < x pos < pos 1 end push pop() pos < pos+1 return A[pos] end ... will initialize an empty stack with capacity $N$ for the above implementation $pos \leftarrow 1$ $pos\leftarrow 0$ $pos\leftarrow 1$ $pos\leftarrow N1$
answered
Jan 13
in
DS
by
habedo007
Active
(
2.8k
points)

81
views
isro2020
datastructures
stack
normal
+1
vote
2
answers
9
ISRO202019
What is the inorder successor of $15$ in the given binary search tree? $18$ $6$ $17$ $20$
answered
Jan 13
in
DS
by
Ashwani Kumar 2
Boss
(
16.3k
points)

77
views
isro2020
datastructures
binarysearchtree
easy
+1
vote
1
answer
10
ISRO202020
The minimum height of an AVL tree with $n$ nodes is $Ceil\ (\log_2(n+1))$ $1.44\ \log_2n$ $Floor\ (\log_2(n+1))$ $1.64\ \log_2n$
answered
Jan 13
in
DS
by
`JEET
Boss
(
18.9k
points)

161
views
isro2020
datastructures
avltree
normal
+2
votes
1
answer
11
ISRO202023
The postorder traversal of binary tree is $ACEDBHIGF$. The preorder traversal is $ABCDEFGHI$ $FBADCEGIH$ $FABCDEGHI$ $ACDEFGIH$
answered
Jan 13
in
DS
by
STUDYGATE2019
(
249
points)

110
views
isro2020
datastructures
binarytree
normal
+23
votes
9
answers
12
GATE199819b
Compute the post fix equivalent of the following expression $3^*\log(x+1)\frac{a}{2}$
answered
Jan 7
in
DS
by
Dex_sazzy
(
11
points)

3.5k
views
gate1998
stack
infixpostfix
+40
votes
6
answers
13
GATE200842
$G$ is a graph on $n$ vertices and $2n2$ edges. The edges of $G$ can be partitioned into two edgedisjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ ... are at least $2$ edgedisjoint paths between every pair of vertices. There are at least $2$ vertexdisjoint paths between every pair of vertices.
answered
Jan 3
in
DS
by
JashanArora
Loyal
(
6.2k
points)

8.3k
views
gate2008
datastructures
graphs
normal
0
votes
1
answer
14
AVL tree
Consider following statements: S1: Rotation operation in AVL always preserves the Inorder ordering. S2: The median of all elements in AVL tree is always at root or one of its two children. S3: If every node in BST has either 0 or 2 children,then searching is O(logn) S4: In a 3 array tree. If number of internal node is 20 then number of Leaves are 41. True Statements ? Ans: Only S1 and S4
answered
Jan 3
in
DS
by
Sahin
(
361
points)

383
views
avltree
datastructures
tree
bst
+28
votes
6
answers
15
GATE20043
A single array $A[1 .. MAXSIZE]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the ... $top1 + top2 = MAXSIZE$ $(top1 = MAXSIZE / 2)$ or $(top2 = MAXSIZE)$ $top1 = top2  1$
answered
Jan 1
in
DS
by
JashanArora
Loyal
(
6.2k
points)

5.1k
views
gate2004
datastructures
stack
easy
+22
votes
6
answers
16
GATE19982.14
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in rowmajor order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$
answered
Jan 1
in
DS
by
JashanArora
Loyal
(
6.2k
points)

3.2k
views
gate1998
datastructures
arrays
easy
+21
votes
4
answers
17
GATE200746
Consider the following C program segment where $CellNode$ represents a node in a binary tree: struct CellNode { struct CellNode *leftChild; int element; struct CellNode *rightChild; }; int Getvalue (struct CellNode *ptr) { int value = 0; if (ptr != NULL) { if (( ... of nodes in the tree the number of internal nodes in the tree the number of leaf nodes in the tree the height of the tree
answered
Dec 30, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

2.1k
views
gate2007
datastructures
binarytree
normal
+3
votes
3
answers
18
GATE19887iii
Consider the tree given in the below figure, insert $13$ and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required rebalancing of the tree and show the new tree with the balance factors on each mode.
answered
Dec 30, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

488
views
gate1988
normal
descriptive
datastructures
binarytree
+28
votes
5
answers
19
GATE2006IT71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil  1$
answered
Dec 29, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

3.4k
views
gate2006it
datastructures
binarytree
normal
+37
votes
5
answers
20
GATE2016236
Consider the following Neworder strategy for traversing a binary tree: Visit the root; Visit the right subtree using Neworder; Visit the left subtree using Neworder; The Neworder traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5  2 ^ 6 7 * 1 +  is given by: ... $1 \ 7 \ 6 * + \ 2 \ 5 \ 4 \ 3 \ * \  \wedge $
answered
Dec 29, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

5.2k
views
gate20162
datastructures
binarytree
normal
+12
votes
4
answers
21
GATE20046
Level order traversal of a rooted tree can be done by starting from the root and performing preorder traversal inorder traversal depth first search breadth first search
answered
Dec 29, 2019
in
DS
by
immanujs
(
439
points)

1.6k
views
gate2004
datastructures
trees
easy
+6
votes
4
answers
22
Two dimensional array
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory as Row major,with base address as 1000,the address of A[66][50] is ..... Ans. 1361
answered
Dec 28, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

699
views
arrays
programminginc
0
votes
2
answers
23
Upper Triangular Matrix
answered
Dec 28, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

372
views
+3
votes
2
answers
24
MadeEasy Subject Test: Programming & DS  Stack
answered
Dec 28, 2019
in
DS
by
Spidey_guy
(
205
points)

135
views
madeeasytestseries
datastructures
stack
queues
+1
vote
2
answers
25
stack operations using queue
Suppose Stack operations are implemented using Queue Operation. Push(x) and Pop() are stack operations whereas enqueue(x) and dequeue are Queue operations. Consider the code: pop() { return Q.dequeue(); } push(x) { n= Q.size(); //Q.size() returns the number of ... operation correctly (A) Q.enqueue(x) (B) Q.enqueue(Q.deqeue()) (C) Q.dequeue(Q.enqueue(x)) (D) Q.dequeue()
answered
Dec 28, 2019
in
DS
by
Spidey_guy
(
205
points)

411
views
datastructures
stack
queues
priorityqueue
+27
votes
4
answers
26
GATE19952.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
answered
Dec 28, 2019
in
DS
by
Kushagra गुप्ता
Active
(
4k
points)

4k
views
gate1995
datastructures
stack
easy
+99
votes
8
answers
27
GATE2007IT29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
answered
Dec 27, 2019
in
DS
by
rohith1001
Active
(
1.9k
points)

12.7k
views
gate2007it
datastructures
binarysearchtree
normal
+4
votes
2
answers
28
CMI2019A3
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, in terms of value, of the root node $A?$ $D$ $H$ $I$ $M$
answered
Dec 27, 2019
in
DS
by
mehulshankhapal
(
17
points)

145
views
cmi2019
datastructures
trees
binarysearchtree
0
votes
2
answers
29
MadeEasy Subject Test: Programming & DS  Hashing
True Or False.....? Explain...?
answered
Dec 27, 2019
in
DS
by
blackcloud
(
469
points)

196
views
madeeasytestseries
datastructures
hashing
0
votes
1
answer
30
MadeEasy Subject Test: Programming & DS  Hashing
answered
Dec 27, 2019
in
DS
by
blackcloud
(
469
points)

172
views
madeeasytestseries
datastructures
hashing
+1
vote
2
answers
31
Minimum Spanning Tree ( TestBook Test Series 2)
answered
Dec 17, 2019
in
DS
by
smsubham
Boss
(
11.5k
points)

149
views
minimumspanningtrees
graphalgorithms
+46
votes
4
answers
32
GATE20036
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k1)T(x)$, where $x$ is $nk+1$ $nk$ $nk1$ $nk2$
answered
Dec 13, 2019
in
DS
by
AkshayBatheja1996
(
43
points)

5.2k
views
gate2003
normal
binarysearchtree
0
votes
3
answers
33
Book: MCQs in Computer Science by TJ williams
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
asked
Sep 22, 2019
in
DS
by
Nukku
(
13
points)

152
views
+1
vote
1
answer
34
CMI2018B7
A First In First Out queue is a data structure supporting the operation Enque, Deque, Print, Enque(x) adds the item $x$ to the tail of the queue. Deque removes the element at the head of the queue and returns its value. Print prints the head of the ... reverse order. If the queue had $n$ elements to begin with, how many statements would you need to print the queue in reverse order?
asked
Sep 13, 2019
in
DS
by
gatecse
Boss
(
17.5k
points)

61
views
cmi2018
datastructures
queues
descriptive
+1
vote
0
answers
35
Allen Career Institute:Circular Queue
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack
asked
May 24, 2019
in
DS
by
srestha
Veteran
(
118k
points)

228
views
datastructures
circularqueue
0
votes
0
answers
36
doubly linked linked list
why we use double pointer struct Node** head here? can anyone explain with details /* Given a reference (pointer to pointer) to the head of a DLL and an int, appends a new node at the end */ void append(struct Node** head_ref, int new_data) { struct Node* ... } while (last>next != NULL) last = last>next; last>next = new_node; new_node>prev = last; return; }
asked
May 24, 2019
in
DS
by
Arun Rout
(
117
points)

77
views
linkedlists
+1
vote
2
answers
37
Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________
asked
May 22, 2019
in
DS
by
srestha
Veteran
(
118k
points)

180
views
madeeasytestseries
binarytree
0
votes
0
answers
38
Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$
asked
May 22, 2019
in
DS
by
srestha
Veteran
(
118k
points)

122
views
madeeasytestseries
datastructures
stack
+1
vote
2
answers
39
Made Easy Test Series:Data StructureStack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??
asked
May 6, 2019
in
DS
by
srestha
Veteran
(
118k
points)

190
views
madeeasytestseries
datastructures
stack
+4
votes
3
answers
40
Made Easy Test Series: DSHash 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 unfilled after the first $'r'$ insertions? $A)\left ( 1\frac{N}{k} \right )^{r}$ ... $C)\left ( 1+\frac{N}{k} \right )^{r1}$ $D)\left ( 1\frac{k}{N} \right )^{r1}$
asked
May 5, 2019
in
DS
by
srestha
Veteran
(
118k
points)

165
views
datastructures
madeeasytestseries
hashing
To see more, click for all the
questions in this category
.
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Management Trainee Recruitment COAL INDIA 2020
ECIL Interview Experience
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent questions and answers in DS
Recent Blog Comments
Q42 C option is correct for C set as it is an...
@ smsubham The SQL query question No...
Are SQL query and that case 1, case 2 answer in...
@ Debapaul Correct answer should be...
Question No. 42 (BIG ENDIAN QUESTION) in Set 'C'...
50,737
questions
57,271
answers
198,135
comments
104,777
users