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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions in DS
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Webpage
Arrays,
Stacks,
Queues,
Linked lists,
Trees,
Binary search trees,
Binary heaps,
Graphs.
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
1
answer
1
SelfDoubt
What is the timecomplexity of Enqueue and Dequeue operations when Queue is implemented using linked list? What is the time complexity of inserting a element in single linked list ?
asked
10 hours
ago
in
DS
by
Phlegmatic
(
149
points)

26
views
0
votes
1
answer
2
#DataStructure Heaps Self Doubt.
In a binary Heap of 100 elements time taken to find the 99th element? or in a binary heap on "n" elements, time taken to find (n1)th element? Note ; I'm not asking about smallest or largest, but simply the 99th element.
asked
18 hours
ago
in
DS
by
iarnav
Loyal
(
7.2k
points)

62
views
algorithms
heap
0
votes
1
answer
3
#Binary Max Heap Question (Doubt)
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap property? My main doubt is  will it O(n) time to reach to leaf nodes?
asked
2 days
ago
in
DS
by
iarnav
Loyal
(
7.2k
points)

51
views
binaryheap
heap
0
votes
1
answer
4
depth first traversal
asked
2 days
ago
in
DS
by
eyeamgj
Active
(
2.3k
points)

33
views
0
votes
2
answers
5
data structure
To remove recursion from a program we have to use which of the following data structure? array stack queue list
asked
3 days
ago
in
DS
by
eyeamgj
Active
(
2.3k
points)

46
views
datastructure
recursion
stack
0
votes
1
answer
6
ds wrk book
Assume that there are two lower triangular matrices $A$ and $B$ of size $n*n$. If matrix $A$ and transpose of $B$ are fit into a rectangular matrix $C$ of size $n*(n+1)$, then $B[i,j]=C[i,j+1]$ $B[i,j]=C[j+1,i]$ $B[i,j]=C[j, i+1]$ I m getting $c$ .is it correct???
asked
3 days
ago
in
DS
by
eyeamgj
Active
(
2.3k
points)

18
views
0
votes
1
answer
7
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
asked
4 days
ago
in
DS
by
Balaji Jegan
Active
(
1.1k
points)

39
views
datastructure
heapsort
0
votes
0
answers
8
Heaps
What is the recurrence relation / math expression for the number of binary min heaps possible with "n" elements on which "k" elements are repeated "t" times where t=2 to n?
asked
4 days
ago
in
DS
by
Balaji Jegan
Active
(
1.1k
points)

13
views
heap
datastructure
0
votes
1
answer
9
#DataStructure Time Complexity in Sorted Array.
asked
Jun 12
in
DS
by
iarnav
Loyal
(
7.2k
points)

51
views
algorithms
timecomplexity
arrays
datastructure
0
votes
0
answers
10
self doubt
if we know that the inorder of a balanced binary search tree is in ascending order, than can we say that the tym complexity to find this is O(1)??????
asked
Jun 8
in
DS
by
eyeamgj
Active
(
2.3k
points)

32
views
0
votes
2
answers
11
ACE TEST SERIES QUESTION
asked
Jun 6
in
DS
by
Shankar Kakde
(
41
points)

116
views
acetestseries
binarytree
0
votes
1
answer
12
ACE Test Series Question
Suppose a stack $S$. Which is empty initially consider the following code: int values[] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19}; for(int i=0; i<10; i++) { S.PUSH = (values[i]); } int n = 25; for (int i=0; i<4; i++) { n+= S.POP(); } for(int i=0; i<2; i++) { n= S.POP(); } printf("%d",n); The output of the program code is _________ .
asked
Jun 6
in
DS
by
Shankar Kakde
(
41
points)

74
views
datastructure
stack
programming
+1
vote
1
answer
13
Sorting
Which sorting algorithm is good if we already knew the range of number  Counting Sort OR Radix Sort
asked
Jun 5
in
DS
by
jatinkumar
(
203
points)

65
views
sorting
timecomplexity
algorithms
0
votes
0
answers
14
Mind blowing question
How many maxheaps can be formed with the following elements? $\{1,1,1,2,2,2,3,3,3,4,4,4\}$
asked
Jun 4
in
DS
by
Balaji Jegan
Active
(
1.1k
points)

98
views
datastructure
permutationsandcombinations
binaryheap
heap
0
votes
1
answer
15
Made_Easy Test Series_2019
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each operand is placed on the stack and operators operate on top two elements of the stack. The minimum size of stack required to evaluate given expression is ________. (((2 × 5) + 6) – (4 × 3))
asked
May 31
in
DS
by
shivamg
(
7
points)

56
views
0
votes
2
answers
16
DATA STRUCTURES
What is the difference between full binary tree ,almost complete binary tree and complete binary tree? explain by drawing trees
asked
May 29
in
DS
by
kamakshi
Junior
(
521
points)

95
views
datastructure
binarytree
0
votes
2
answers
17
Binary Tree
$\text{Given preorder and inorder, how many binary trees are possible?}$
asked
May 26
in
DS
by
sanny_1
(
37
points)

96
views
datastructure
binarytree
0
votes
1
answer
18
Interpretation of Array dimensions
What is the correct interpretation of an $array[a][b][c]$? I have solved questions where $a$ is the number of layers, $b$ number of rows and $c$ number of columns. I have also seen questions where $a$ is the number of rows, $b$ is columns and $c$ is layers. Which one to follow to solve questions in GATE exam?
asked
May 24
in
DS
by
mohitjarvissharma
(
113
points)

56
views
arrays
datastructure
+1
vote
1
answer
19
GATE CS Mock 2018
Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node and lengths of lists are not known. What is worst case time complexity of optimal ... n), where m, n are lengths of given lists D) Θ(min(n, m)), where m, n are lengths of given lists
asked
May 22
in
DS
by
Nikhil Patil
(
365
points)

91
views
usergate2018
usermod
0
votes
0
answers
20
Reema Thareja
Is reema thareja a suitable book for GATE Data structures?
asked
May 21
in
DS
by
mohitjarvissharma
(
113
points)

64
views
programminginc
datastructure
0
votes
0
answers
21
Data Structures Resource
Hello everyone. Can anyone suggest me a good book for Data Structures for GATE. Horowitz and Weiss are available in .chm format and its really difficult to read from them. Any other suggestions. Also, I have a good knowledge of C, but i have to formally study it for GATE. Any suggestions for this too?
asked
May 21
in
DS
by
mohitjarvissharma
(
113
points)

38
views
datastructure
programminginc
0
votes
1
answer
22
AVL Tree
Minimum number of internal nodes in an AVL tree with height 5? Please give a standard procedure that can be applied to larger heights as well. I know the formula: S(h) = S(h1) + S(h2) + 1, but here it is asked for internal nodes only. Drawing a tree is tedious.
asked
May 15
in
DS
by
Akhilesh Singla
Active
(
4.7k
points)

48
views
avltree
tree
0
votes
0
answers
23
MinHeap
In a minheap with $n$ elements with the smallest element at the root, the $log n^{th}$ smallest element can be found in time. Is this approach correct? For $1$ st smallest  root node is the element  takes $0$ comparison For $2$ nd smallest  $2$ elements are to be compared  ... . . . . + (logn1)$ = $\frac{(logn)(logn+1)}{2}$ = $O$$(logn)$$2$ Please suggest is this correct approach??
asked
May 13
in
DS
by
!KARAN
(
329
points)

31
views
0
votes
0
answers
24
ISI PCB C4 2017
A file F holds the nonzero elements of two large n n matrices, A and B. The matrix entries are stored as triplets (i,j,value), where value is the (i,j)th element of a matrix. The file first stores the elements of A and then those of B. ... , give reasons. If yes, provide a solution. Clearly explain the data structure and how you are going to store, retrieve, and add the elements.
asked
May 9
in
DS
by
tathatj
(
67
points)

44
views
datastructure
algorithms
userisi2017
usermod
0
votes
1
answer
25
Evaluation of Postfix expression using stack
asked
May 6
in
DS
by
JaiKumar Guwalani
(
11
points)

119
views
datastructure
timecomplexity
spacecomplexity
infixpostfix
stack
0
votes
1
answer
26
GATE 2013
Its GATE 2013 question Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m  1 } } What is the worst case time complexity of a ... performed on nonempty or full queue?? Due to this change will the answer remain same?? Θ(n) Θ(n + k) Θ(nk) Θ(n2)
asked
May 1
in
DS
by
!KARAN
(
329
points)

68
views
queues
0
votes
0
answers
27
#Test_Series
Consider implementation of stack using queue by following algorithm. Let $x$ be an element to be pushed in the stack push(q1,x) { EQ(q1,x) while(q1 does not contain 1 element) { k=DQ(q1) EQ(q1,k) } } pop(q1) { DQ(q1) } How many enqueue and dequeue operations required to push $2$ and pop $2$ elements in the empty stack?
asked
Apr 30
in
DS
by
himgta
(
477
points)

58
views
datastructure
stack
queues
0
votes
1
answer
28
MY DOUBT: Worst case space complexity of Quick sort (NOT FOR A STRAIGHT ANSWER)
asked
Apr 21
in
DS
by
Akash Kumar Roy
(
473
points)

84
views
algorithms
sorting
datastructure
spacecomplexity
0
votes
0
answers
29
#Testseries
The number of binary search tree’s with 4 nodes (1, 2, 3, 4) possible where in every binary search tree ‘1’ is leaf node are ..... How to solve such type of questions in the simple way?
asked
Apr 13
in
DS
by
himgta
(
477
points)

52
views
0
votes
1
answer
30
Data Structures
Arrange the following Datastructures in the nondecreasing order of worst case time complexities on the operation $Search$ Binary Search Trees, Linked List, Array, Hash Table
asked
Apr 10
in
DS
by
Neelay Upadhyaya
Active
(
1.1k
points)

53
views
Page:
1
2
3
4
5
6
...
34
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
UGC NET 2018 Admit Card available for Download
IIIT Hyderabad Interview Experience
The GATE journey
BARC Interview Experience 15th June 2018
COAP Admission and IITD, IITK Interview Experience 2018
All categories
General Aptitude
1.3k
Engineering Mathematics
5.2k
Digital Logic
2k
Programming & DS
3.7k
Programming
2.7k
DS
991
Algorithms
3.2k
Theory of Computation
4k
Compiler Design
1.6k
Operating System
2.8k
Databases
3k
CO & Architecture
2.6k
Computer Networks
3k
Non GATE
1k
Others
1.3k
Admissions
486
Exam Queries
434
Tier 1 Placement Questions
17
Job Queries
56
Projects
9
Follow @csegate
Gatecse
Recent questions in DS
Recent Blog Comments
Congrats.
Congratulations Priyendu, thanks for sharing the ...
Most probably IITK. Analyzed a lot and finally ...
Congratulations! Which college are you aiming for ...
yes. I'm joining bits goa. I'm from goa also so ...
36,136
questions
43,587
answers
123,889
comments
42,832
users