The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
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 tagged datastructure
Webpage for Data Structures
0
votes
0
answers
1
self doubt
asked
2 minutes
ago
in
Programming
by
Raj Kumar 7
Active
(
1.1k
points)

1
view
datastructure
hashing
0
votes
0
answers
2
Insertion in Hash table. (M.E.)
The number of different insertion sequences of numbers $\left \{ 7,20,32,50,66,77 \right \}$ on an initially empty hash table H of size $6$ and a hash function $h\left ( k \right )=k\mod6$ with linear probing scheme for collision resolution such that the hash table obtained ... ${\color{Blue} {2}}$ ${\color{Blue} {3}}$. ${\color{Blue} {4}}$ ${\color{Blue} {5}}$
asked
1 day
ago
in
DS
by
srestha
Veteran
(
106k
points)

37
views
hashing
datastructure
0
votes
0
answers
3
Binary tree
Consider a binary tree for every node  P  Q  <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)
asked
1 day
ago
in
Programming
by
Na462
Loyal
(
8k
points)

5
views
datastructure
binarytree
algorithms
madeeasytestseries
0
votes
0
answers
4
MeTestBST
When searching for the key value 50 in the binary search tree, node containing the key values 10,30,40,70,90,120,150,175 are traversed in any order.The number of different orders possible in which these keys values can occur on the search path from root to the node containing the value 50 are?
asked
1 day
ago
in
Programming
by
Ayush Upadhyaya
Boss
(
22.8k
points)

28
views
datastructure
+1
vote
0
answers
5
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
asked
1 day
ago
in
DS
by
sripo
Active
(
1.3k
points)

14
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructure
0
votes
0
answers
6
DFS tree
Statement: DFS of an undirected graph contains tree edges and back edges but can never contain forward edges and cross ege. TRUE if it is a undirected graph then there is no difference between forward and backward edges hence above statement should be false, but it is given true. please clear my doubts
asked
1 day
ago
in
Programming
by
harsh yadav
(
83
points)

8
views
datastructure
0
votes
1
answer
7
DS and programming
#include <stdio.h> int arr[] = { 10, 20, 30, 40, 50 }; static int count ; inc() { return ++count; } int main() { arr[count++]=inc(); printf("%d ", arr[count]); printf("%d ", arr[0]); } i am thinking it will print 30 2
asked
3 days
ago
in
Programming
by
Gurdeep Saini
Loyal
(
7.6k
points)

44
views
datastructure
programminginc
output
0
votes
0
answers
8
Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?
asked
4 days
ago
in
Algorithms
by
Markzuck
(
393
points)

96
views
heap
datastructure
binaryheap
algorithms
madeeasytestseries
0
votes
0
answers
9
me test
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above? (given ans is 128 but i am getting 288)
asked
4 days
ago
in
Programming
by
newdreamz a1z0
Active
(
1.1k
points)

24
views
datastructure
hashing
linear
probing
0
votes
0
answers
10
Madeaeasy
Total number of ordering possible with 12,10,8,5,3,2,1,7,9 such that if node of the below graph is filled with given elements , such that it satisfy MAXHeap property How to solve such question accurately
asked
6 days
ago
in
Programming & DS
by
jatin khachane 1
Loyal
(
5.5k
points)

79
views
datastructure
heap
0
votes
0
answers
11
Postfix expression doubt
What is the significance of the underlined sentence ??
asked
Jan 9
in
DS
by
Nandkishor3939
Junior
(
665
points)

12
views
datastructure
0
votes
1
answer
12
AVL TREE
I am getting level order traversal(3,2,1,5,4,6,7)….. where i am wrong..??
asked
Jan 8
in
Algorithms
by
Vikas123
(
355
points)

50
views
avltree
datastructure
tree
bst
algorithms
0
votes
0
answers
13
PREORDER, POSTORDER INORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
asked
Jan 8
in
Algorithms
by
Vikas123
(
355
points)

24
views
treetraversal
datastructure
0
votes
0
answers
14
Made Easy Test Series
AVL tree is created by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order (Assume the tree is initially empty). Then the level order traversals of the tree would be. 2, 1, 3, 5, 4, 6, 7 3, 2, 5, 1, 6, 4, 7 2, 1 ... knowing all the concepts. After 2 or 3 rotations I get stuck trying to figure out which way to rotate. Please help me with the proper steps in this question.
asked
Jan 6
in
DS
by
Gupta731
Active
(
4.3k
points)

52
views
madeeasytestseries
datastructure
0
votes
0
answers
15
Stack implementation by using queue
true/false ? ) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time. )if stack is implemented as a linked list ,all operation ,is emptystack(),delete stack() can be performed in constant time.
asked
Jan 2
in
Programming
by
Gurdeep Saini
Loyal
(
7.6k
points)

53
views
datastructure
queues
stack
0
votes
0
answers
16
Made Easy Advance FT6 Question 35
Consider the hashing table with m' slots and n' keys. If the expected number of probes in unsuccessful search is 3, the expected number of probes in successful search is _____(Upto 2 decimals) Ans. 1.647 Here by default which hashing should ... given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing I am getting around 1.61
asked
Jan 2
in
Programming
by
MiNiPanda
Boss
(
19.7k
points)

58
views
madeeasytestseries
datastructure
0
votes
0
answers
17
Made Easy Test DS
An array A of size n is known to be sorted except for the first k elements and the last k elements, where k is a constant. Which of the following algorithms will be the best choice for sorting the array A ? Insertion Sort Bubble sort Quick sort Selection sort
asked
Jan 1
in
DS
by
Shamim Ahmed
Active
(
2.2k
points)

73
views
datastructure
madeeasytestseries
+2
votes
1
answer
18
HEAP (MAX/MIN HEAP)
what is the time complexity of various problems such as: 1) Creating the heap 2) Getting maximum element in the max heap 3) Getting minimum element in the max heap 4) Getting maximum element in min heap 5) Getting minimum element in min heap 6) Heapify the ... of an element in the max heap 10) Insertion of an element in the max heap 11) Insertion of an element in min heap
asked
Jan 1
in
Programming
by
Hira Thakur
Boss
(
13.8k
points)

41
views
heap
datastructure
0
votes
0
answers
19
Trees
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
asked
Jan 1
in
Programming
by
Mudita
(
53
points)

15
views
datastructure
0
votes
0
answers
20
#madeeasy
asked
Dec 28, 2018
in
Programming
by
Ramij
(
315
points)

53
views
madeeasytestseries
arrays
datastructure
0
votes
1
answer
21
avl tree
what is the maximum possible hight of AVL tree with 54 node? is there any general method to solve this question?
asked
Dec 28, 2018
in
DS
by
Rahul_Rathod_
Junior
(
543
points)

79
views
avltree
datastructure
tree
0
votes
0
answers
22
hashing
A) (1(N / K)) ^ r b) (1(K / N)) ^ r c) (1+(N / K)) ^ r1 d) (1(K / N)) ^ r1
asked
Dec 28, 2018
in
DS
by
Rahul_Rathod_
Junior
(
543
points)

20
views
hashing
datastructure
probability
uniformhashing
0
votes
1
answer
23
array
Consider a 2 dimensional array A[40 ..... 95, 40 ..... 95] in lower triangular matrix representation. The size of each element in the array is 1 byte. If the array is implemented in the memory in the form of row major order and base address of the array is 1000, the address of A[66] [50] will be
asked
Dec 28, 2018
in
DS
by
Rahul_Rathod_
Junior
(
543
points)

40
views
arrays
datastructure
programminginc
0
votes
0
answers
24
data structure
let R be the class of recursive program and l be the class of iterative program now consider below statement S S : every program in R uses strictly more space compare to its equivalent program in class I TRUE of FALSE ?
asked
Dec 28, 2018
in
Programming
by
Rahul_Rathod_
Junior
(
543
points)

29
views
datastructure
algorithms
programminginc
0
votes
1
answer
25
Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix : 2 5 x 6 + 4 2 x  MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??
asked
Dec 27, 2018
in
DS
by
Vikas123
(
355
points)

134
views
datastructure
programminginc
gate2019
preparation
0
votes
0
answers
26
GO2019FLT143
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In case of even number of elements the recently popped out element is again pushed back either on the top or bottom of the stack randomly. ... i, ii ii, iii iii, iv ii, iv
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
1.9k
points)

136
views
go2019flt1
datastructure
stack
0
votes
1
answer
27
Linked list
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ; if (b = = NULL) return (a) ; If (a → data <= ... two linked lists by selecting the alternate nodes merges two sorted linked lists into final sorted linked list merges two linked lists by selecting the nodes in reverse.
asked
Dec 27, 2018
in
DS
by
sharadsingh
(
21
points)

45
views
linkedlists
datastructure
programminginc
0
votes
1
answer
28
self doubt
Please solve this by taking some example Back edge cross edge tree edge Thankyou.
asked
Dec 27, 2018
in
Programming
by
iamdeepakji
(
195
points)

33
views
data
datastructure
0
votes
1
answer
29
Made Easy Test
asked
Dec 26, 2018
in
DS
by
Shamim Ahmed
Active
(
2.2k
points)

67
views
madeeasytestseries
datastructure
0
votes
0
answers
30
made easy _algori
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!! like 111212 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.
asked
Dec 26, 2018
in
Algorithms
by
CHïntän ÞäTël
(
273
points)

49
views
madeeasytestseries
databases
erdiagram
madeeasybooklet
datastructure
Page:
1
2
3
4
5
6
...
36
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
Decidability Slides
How to Revise?
AAI JE IT results out! Adv no 02/2018
Graph Theory Slides for GATECSE
Generating Function Useful Link
Follow @csegate
Gatecse
Recent questions tagged datastructure
Recent Blog Comments
@arjun sir along with this are there any other...
Thanks :)
You don't have to be,I know what you are going...
Thank you sir!
46,787
questions
51,234
answers
176,582
comments
66,585
users