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 in DS
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
+1
vote
1
answer
1
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

212
views
isro2020
datastructures
arrays
normal
+1
vote
1
answer
2
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

112
views
isro2020
datastructures
bfs
normal
+2
votes
2
answers
3
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

111
views
isro2020
datastructures
trees
normal
+2
votes
1
answer
4
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)$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

110
views
isro2020
datastructures
infixpostfix
normal
+1
vote
1
answer
5
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

145
views
isro2020
datastructures
avltree
normal
+1
vote
2
answers
6
ISRO202019
What is the inorder successor of $15$ in the given binary search tree? $18$ $6$ $17$ $20$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

74
views
isro2020
datastructures
binarysearchtree
easy
+2
votes
1
answer
7
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

77
views
isro2020
datastructures
stack
normal
+1
vote
0
answers
8
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$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

66
views
isro2020
datastructures
hashing
normal
+1
vote
1
answer
9
ISRO202023
The postorder traversal of binary tree is $ACEDBHIGF$. The preorder traversal is $ABCDEFGHI$ $FBADCEGIH$ $FABCDEGHI$ $ACDEFGIH$
asked
5 days
ago
in
DS
by
Satbir
Boss
(
23.7k
points)

99
views
isro2020
datastructures
binarytree
normal
0
votes
3
answers
10
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
+4
votes
2
answers
11
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$
asked
Sep 13, 2019
in
DS
by
gatecse
Boss
(
17.5k
points)

144
views
cmi2019
datastructures
trees
binarysearchtree
+1
vote
1
answer
12
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)

60
views
cmi2018
datastructures
queues
descriptive
+1
vote
0
answers
13
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)

227
views
datastructures
circularqueue
0
votes
0
answers
14
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
15
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)

176
views
madeeasytestseries
binarytree
0
votes
0
answers
16
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
17
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)

189
views
madeeasytestseries
datastructures
stack
+4
votes
3
answers
18
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)

164
views
datastructures
madeeasytestseries
hashing
0
votes
1
answer
19
Made Easy Test Series:DSBinary 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; else{ int i=foobar(root>left); int j=foobar(root> ... $C)$ Sum of leaves node of binary tree. $D)$ None What return $10$ actually means?
asked
May 4, 2019
in
DS
by
srestha
Veteran
(
118k
points)

71
views
madeeasytestseries
datastructures
0
votes
1
answer
20
Made Easy Test Series: Array
Consider a 2D array $A\left [ 40.........95,40........95 \right ]$ in lower triangular matrix representation. Size of each element of array is $1B.$ If the array is implemented in memory in the form of row major order and base address of the array is $1000.$, the address of $A\left [66 \right ]\left [ 50 \right ]$ will be__________ will it be 1361 or 1362?
asked
May 3, 2019
in
DS
by
srestha
Veteran
(
118k
points)

54
views
datastructures
madeeasytestseries
0
votes
1
answer
21
Made Easy Test Series: DS
A $d$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $dary$ heap can be represented by $1D$ array as follows. The root is kept in $A[1]$, and it's $d$ children are kept in order in $A[2]$ through $A[d+1]$ ... $A\left [ d^{2}+d+2 \right ]$
asked
May 2, 2019
in
DS
by
srestha
Veteran
(
118k
points)

90
views
madeeasytestseries
datastructures
0
votes
1
answer
22
Made Easy Test Series: Data Structure
$A)$ Rotation operation of AVL tree always preserves the inorder numbering. $B)$ If every node of BST has either $0$ or $2$ children , then searching time is $O(log n)$ Which statement is correct? Given $A)$ is correct but $B)$ is not. Plz explain how?
asked
May 2, 2019
in
DS
by
srestha
Veteran
(
118k
points)

56
views
datastructures
madeeasytestseries
0
votes
1
answer
23
Made Easy Test Series:Binary Tree
Consider the following function with a binary tree with atleast one node: int path(struct node *x, int len){ if(x==NULL) return B; else return A; } Assume the above function is used to check the given binary tree has any path with specified length from root to ... $B$ is $(len== 1)$ which of these two option correct? Please Explain.
asked
Apr 30, 2019
in
DS
by
srestha
Veteran
(
118k
points)

116
views
madeeasytestseries
datastructures
0
votes
1
answer
24
Made Easy Test Series:Data Structure
Assume a Binary Search Tree is not allowed to have duplicates, there is more than one way to delete a node in the tree when the node has two children.If we resolve the situation in favor of choosing element for replacement from ... ? If we resolve the situation in favor of choosing element for replacement from left substructure what this line exactly means?
asked
Apr 30, 2019
in
DS
by
srestha
Veteran
(
118k
points)

85
views
datastructures
madeeasytestseries
0
votes
1
answer
25
Self Doubt on Linked List
Can somebody write the code or algorithm, how merge sort works efficiently in linked list? Is Heap sort most inefficient in Linked List Sorting? Elaborate plz
asked
Apr 29, 2019
in
DS
by
srestha
Veteran
(
118k
points)

61
views
linkedlists
datastructures
0
votes
1
answer
26
IIIT PGEE 2019
Which of the following gives O(1) complexity if we want to check whether an edge exists between two given nodes in a graph? Adjacency List Adjacency Matrix Incidence Matrix None of these
asked
Apr 29, 2019
in
DS
by
manikgupta123
(
81
points)

153
views
iiithpgee
graphtheory
timecomplexity
0
votes
2
answers
27
Made Easy Test Series:DSStack and Queue
Consider a single array $A\left [ 0...........(n1) \right ]$ is used to implement two stacks. Two stacks grows from opposite end of the array. Variable $top_{1}$ and $top_{2}$ points to the location of the topmost elements in each of the stacks ... the number of elements are present in the array at any time? $A)ntop_{2}+top_{1}$ $B)n+1top_{2}+top_{1}$
asked
Apr 26, 2019
in
DS
by
srestha
Veteran
(
118k
points)

82
views
datastructures
madeeasytestseries
+1
vote
3
answers
28
Made Easy Test Series:Programming and DS
Which of the following data structure is efficient to implement priority queue such as insertion ,deletion, searching? A)Linked List B)Heap C)Sorted Array D)Unsorted Array How priority queue can work more efficiently in any data structure, other than heap?
asked
Apr 24, 2019
in
DS
by
srestha
Veteran
(
118k
points)

187
views
madeeasytestseries
programminginc
programming
0
votes
1
answer
29
Made Easy Test Series:DS
I want longest path from root to leaf. Then which code is correct among Code1 or Code2? Code1) int tree(Struct node *root){ int a=0, b=0,c=0; if(root==NULL) return 0; if((root>left==NULL)&&(root>right==NULL)) return 1; a=1+tree(root ... )&&(root>right==NULL)) return 1; a=tree(root>left); b=tree(root>right); c=1+max(a,b); return c; }
asked
Apr 22, 2019
in
DS
by
srestha
Veteran
(
118k
points)

76
views
madeeasytestseries
datastructures
0
votes
0
answers
30
Assignment 2.9 (b) page no. 28 from book Classic Data Structures Second Edition by Debasis Samanta
asked
Apr 18, 2019
in
DS
by
mahi.0409
(
5
points)

76
views
datastructures
debasissamanta
Page:
1
2
3
4
5
6
...
45
next »
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 in DS
Recent Blog Comments
Hey all! I can't see the CS branch here? How...
it's depends year to year
What was the average cutoff that was maintained...
@Shivateja MST I don't think it will go high
http://univ.tifr.res.in/gs2020/Test_Results/INT_Sh...
50,741
questions
57,251
answers
198,044
comments
104,652
users