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 tagged datastructure
Webpage for Data Structures
+1
vote
1
answer
1
Hashing with Linear probing
Consider an initially empty hash table of length 10. Following are the keys in hash table inserted using mod function h(k)=k mod 10. Slot Number Value 0 1 91 2 3 33 4 44 5 23 6 64 7 77 8 9 How many different insertion sequences of keys would result in the above hash table? My answer comes to be 56, is it correct?
asked
23 hours
ago
in
Programming
by
Ayush Upadhyaya
Boss
(
12.5k
points)

63
views
hashing
datastructure
0
votes
1
answer
2
conceptual doubt
WHAT IS THE TIME COMPLEXITY TO ENQUEUE AN ELEMENT IF THE QUEUE IS IMPLEMENTED AS A CIRCULAR QUEUE AND WE HAVE GOT ONLY ONE POINTER TO FRONT ELEMENT??
asked
3 days
ago
in
DS
by
sushmita
Boss
(
13.9k
points)

42
views
datastructure
linkedlists
timecomplexity
queues
0
votes
0
answers
3
Linked List Problem
struct node* foo(struct node* a, struct node* b) { struct node* result, *rec; if(a==null) return b; else if(b==null) return a; else { rec=foo(a>next,b>next); result=a; a>next=b; b>next=rec; return result; } }
asked
6 days
ago
in
Programming
by
Vaishnavi01
(
89
points)

26
views
datastructure
linkedlists
algorithms
0
votes
0
answers
4
Expression Tree Evaluation
While evaluating the expression tree, if the left or right child is not present then the value of that particular missing child is taken as 0? Have a look at this question In my evaluation, I am getting: ( (a0)  b )  0 + e! = ab+e! Answer is given as option c but by this approach, I am getting option (d) as the answer.
asked
Sep 11
in
DS
by
garvit_vijai
(
29
points)

15
views
expressionevaluation
datastructure
0
votes
0
answers
5
Algorithm and data structure
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
asked
Sep 10
in
Algorithms
by
manvi_agarwal
(
109
points)

29
views
datastructure
algorithms
heap
0
votes
0
answers
6
# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
asked
Sep 10
in
Algorithms
by
LavTheRawkstar
Active
(
5.1k
points)

19
views
algorithms
heap
sorting
datastructure
binomial
tree
btree
0
votes
0
answers
7
# Backtracking
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25> using Backtracking. I am totally confused hence please provide me the solution for it.
asked
Sep 10
in
Algorithms
by
LavTheRawkstar
Active
(
5.1k
points)

9
views
algorithms
datastructure
backtracking
0
votes
0
answers
8
# B Tree
Please Derive the Relation in between degree and the height of n keys B Tree. Insert the following information into an Empty B Tree with Degree t=3. F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E
asked
Sep 10
in
Algorithms
by
LavTheRawkstar
Active
(
5.1k
points)

11
views
btree
datastructure
algorithms
0
votes
1
answer
9
circular queue
asked
Sep 9
in
DS
by
pritigoya
(
19
points)

45
views
datastructure
0
votes
1
answer
10
Data Structure  Postfix
asked
Sep 2
in
Programming
by
sidlewis
(
327
points)

95
views
datastructure
infixpostfix
0
votes
1
answer
11
hashing
given keys: 224562,137456,214562 140145,214576,162145 144467,199645,234534 Using the digitextraction method (first, third and fifth digits) and quadratic probing, stores the keys shown above in an array with 19 elements. What is the indexes of bin into which all the records are inserted? hint : digit extraction(1,3,5) for 224562>246 mod 19 = 18 and soon.
asked
Aug 31
in
DS
by
balaganesh
(
95
points)

22
views
quadratic
probing
hashing
datastructure
0
votes
2
answers
12
Linked list
What are sequential access structures? Are arrays or linked list the sequential access structures?
asked
Aug 30
in
Programming
by
Mizuki
Junior
(
783
points)

42
views
datastructure
0
votes
0
answers
13
AVL tree
How to solve question of the following type without creating a tree for each given option. Which of the following order of elements are inserted into an empty AVL tree so that it is possible to get the above AVL tree. A. 94,71,86,25,98,83,27,90 B 98,94,90,83,86,25,71,27 C. 86,25,98,83,27,90,71,94 D. None of these
asked
Aug 27
in
DS
by
hrcule
(
267
points)

34
views
avltree
datastructure
tree
0
votes
0
answers
14
back edge and no forward edge
Which does this sentence mean? In BFS of an undirected graph, there are no back edge and no forward edge.
asked
Aug 23
in
DS
by
syncronizing
(
477
points)

23
views
programminginc
datastructure
bfs
0
votes
0
answers
15
Test series
The answer is 'd' will be printed. Can someone draw the linked list after the operations are performed. I think the second operation of the code doesn't bring in any change to the list. thanks in advance
asked
Aug 23
in
Programming
by
Kalpataru Bose
(
429
points)

29
views
madeeasytestseries
testbooktestseries
linkedlists
datastructure
programminginc
0
votes
2
answers
16
Calculating array address
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each element is 1 Byte,and stored in row major, then address of A[100][50] ?
asked
Aug 22
in
DS
by
Na462
Loyal
(
5.6k
points)

77
views
datastructure
arrays
0
votes
1
answer
17
Link list
Suppose we are deleting a node with data field as x. Which can be present anywhere in the list. Consider following Scenarios : S1 : You're only provided with pointer to the node which needs to be deleted. S2 : You're only provided with the pointer to the starting ... cases for S2. D. Deletion is not possible for certain cases in S2, but deletion is possible in all cases for S1. Ans. C
asked
Aug 22
in
DS
by
Na462
Loyal
(
5.6k
points)

31
views
linkedlists
datastructure
0
votes
1
answer
18
Postfix Expression
Let The value of below expression is A. 6 2 3 +  3 8 2 / + * 3 ^ 3 + and Let the value of below expression is Y: 2 A * 16 + What is value of sqrt(Y) Ans. 16
asked
Aug 22
in
DS
by
Na462
Loyal
(
5.6k
points)

47
views
datastructure
infixpostfix
+2
votes
0
answers
19
Breadth first Search
Which of following statement is true ? A. In BFS of UDG there are no back edges and forward edges. B. In BFS of Directed Graph there is no back edge and forward edges. C. In BFS of UDG for each back edge(u,v) we have 0<= v.d <= u.d D. Both b and c. Ans. A
asked
Aug 21
in
DS
by
Na462
Loyal
(
5.6k
points)

88
views
bfs
datastructure
graphalgorithms
0
votes
0
answers
20
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
asked
Aug 21
in
DS
by
Na462
Loyal
(
5.6k
points)

64
views
avltree
datastructure
tree
bst
+1
vote
0
answers
21
Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
asked
Aug 21
in
DS
by
Na462
Loyal
(
5.6k
points)

25
views
dfs
datastructure
graphalgorithms
0
votes
2
answers
22
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l1 b) l1 c) l d) 2l
asked
Aug 19
in
Programming
by
pradeepchaudhary
(
231
points)

33
views
binarysearchtree
binarytree
datastructure
0
votes
1
answer
23
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
asked
Aug 19
in
Programming
by
pradeepchaudhary
(
231
points)

41
views
linkedlists
datastructure
algorithms
0
votes
1
answer
24
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
asked
Aug 19
in
Programming
by
pradeepchaudhary
(
231
points)

21
views
asymptoticnotations
datastructure
0
votes
1
answer
25
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
asked
Aug 19
in
Programming
by
pradeepchaudhary
(
231
points)

30
views
datastructure
binarysearchtree
bst
binarytree
algorithms
+1
vote
1
answer
26
Binary Search Tree
1) How many ways we can traverse 1,2,3,4 in BST? 2) How many ways we can insert 1,2,3,4 in BST? ______________________________________________________________________ How both are different in calculation of BST?Why they are use different formula?
asked
Aug 18
in
DS
by
srestha
Veteran
(
96k
points)

53
views
datastructure
binarysearchtree
bst
0
votes
4
answers
27
Ugc Net july 2018 paper 2
Can anyone solve the following recurrence relation problem which was asked in this year Ugc net paper 2
asked
Aug 18
in
Others
by
Ammu9682
(
47
points)

66
views
ugcnetjuly2018ii
datastructure
+2
votes
1
answer
28
Binary Search Tree
Number of ways we can insert 5,6,9,10 in the nodes of BST, such that height of BST is either 2 or 3?
asked
Aug 17
in
DS
by
srestha
Veteran
(
96k
points)

128
views
datastructure
bst
binarysearchtree
0
votes
0
answers
29
Heap data structure
a)Deletion of smallest element in heap b)Insertion of an element in a heap will take $O(n)$ or $O(logn)$ time?
asked
Aug 16
in
DS
by
srestha
Veteran
(
96k
points)

44
views
heap
timecomplexity
datastructure
0
votes
0
answers
30
GO 2017 datastructures
https://gateoverflow.in/73066/go2017datastructures124 can anyone explain this question's best answer ?
asked
Aug 15
in
DS
by
Shivani gaikawad
(
467
points)

26
views
datastructure
Page:
1
2
3
4
5
6
...
31
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
self doubt
Mutual Exclusion vs. Hold and Wait
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Follow @csegate
Gatecse
Recent questions tagged datastructure
Recent Blog Comments
[email protected]
post it as question
[email protected]
@Swaraj i got 74.22 %
@sanjay sharma , my gmail id ...
39,697
questions
46,749
answers
140,529
comments
58,309
users