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
+1
vote
0
answers
1
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
4 hours
ago
in
DS
by
srestha
Veteran
(
92k
points)

25
views
datastructure
binarysearchtree
bst
0
votes
0
answers
2
Heap Sorting
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree? $A)O(\log n)$ or $o(n)$ $B)\Omega (\log n)$ or $\omega(n)$ $C)\Theta (\log n)$ or $\theta (n)$ $D)\text{None of these}$
asked
10 hours
ago
in
DS
by
srestha
Veteran
(
92k
points)

60
views
algorithms
sorting
heap
binaryheap
timecomplexity
0
votes
0
answers
3
multi dimensional array
Let A be a twodimensional array declared as follows: A: array[1..23][1..19] 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 the location. Find out the address of the address of the element A[i][j].
asked
1 day
ago
in
DS
by
ritus
(
27
points)

17
views
+2
votes
1
answer
4
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
1 day
ago
in
DS
by
srestha
Veteran
(
92k
points)

122
views
datastructure
bst
binarysearchtree
0
votes
0
answers
5
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
2 days
ago
in
DS
by
srestha
Veteran
(
92k
points)

28
views
heap
timecomplexity
datastructure
0
votes
0
answers
6
GO 2017 datastructures
https://gateoverflow.in/73066/go2017datastructures124 can anyone explain this question's best answer ?
asked
3 days
ago
in
DS
by
Shivani gaikawad
(
331
points)

24
views
datastructure
0
votes
1
answer
7
Program of Binary Tree
Why not this code not printing 10? (It is just a binary tree with one node i.e. root. And value of root is 10) #include <stdio.h> #include<stdlib.h> struct BinaryTree *root=NULL; struct BinaryTree{ int data; struct BinaryTree *left; struct BinaryTree * ... root=node(data1); return root; } } int main() { insert(root,10); printf("%d",*root); return 0; }
asked
4 days
ago
in
DS
by
srestha
Veteran
(
92k
points)

43
views
datastructure
binarytree
binarysearchtree
0
votes
0
answers
8
Hashing
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is used.
asked
Aug 9
in
DS
by
hrcule
(
251
points)

14
views
hashing
datastructure
uniformhashing
probability
0
votes
1
answer
9
work book
pseudo code of stack declare a stack of characters while (there are more character in the word to read) { read a character push the character on the stack } while(the stack is not empty) { pop a character off the stack write the character to the screen } What is the output of input "192761"?
asked
Aug 8
in
DS
by
amit166
(
39
points)

26
views
stack
0
votes
0
answers
10
work book
Let S be a stack with operations push, pop, top, empty. What is displayed after following segment of code executes . for(i=1; i<=5; i++) s.push(i); while(!s.empty()) printf("%d", s.top()); ans with explanation
asked
Aug 8
in
DS
by
amit166
(
39
points)

42
views
stack
+3
votes
2
answers
11
Data Structure
Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file? The answer given is Minheap anybody please explain?
asked
Aug 6
in
DS
by
Gatetarget_100
(
89
points)

30
views
+1
vote
0
answers
12
Discrete mathematics and its application ,kenneth h rosen ,seventh edition,chapter 8, exercise 8.4 ques 6
asked
Aug 4
in
DS
by
saurab
(
17
points)

21
views
kennethrosen
discretemathematics
graphconnectivity
connected
component
0
votes
1
answer
13
Tree DS
1. How many Binary trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 2. How many Binary Search trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 3. How many AVL trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? Can these be generalised for 'n' nodes?
asked
Aug 4
in
DS
by
Naveen Kumar 3
Active
(
1.4k
points)

23
views
datastructure
tree
0
votes
1
answer
14
madeeasy
which is an efficient tree structure in terms of space and time complexity? a) AVL Tree b)Full Binary tree c)Complete binary tree d)Binary tree
asked
Aug 4
in
DS
by
manvi_agarwal
(
37
points)

22
views
datastructure
trees
0
votes
1
answer
15
Hash Function
Which of the following is the least suitable hash function H(x) where X is some non negative integer ? 1. h(k) =k%n 2.h(k) =k*k %n 3.h(k)=(gcd(k+1,2k+2) +k ) %n Linear probing is used for collision resolution .
asked
Aug 4
in
DS
by
ashwina
Active
(
2k
points)

49
views
hashing
datastructure
0
votes
1
answer
16
Made easy
https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664 Approach for Q9 please . (Please note: it is the last question on left hand side, and part of it is written on right hand side) Answer is d, but according to me it should be b as in 3 situation ... elements but won't be restored in it's original state as mentioned in question. So only 1 and 2 is possible. Is it correct?
asked
Jul 30
in
DS
by
manvi_agarwal
(
37
points)

47
views
madeeasybooklet
datastructure
queues
0
votes
1
answer
17
Made easy
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
asked
Jul 30
in
DS
by
manvi_agarwal
(
37
points)

20
views
madeeasytestseries
#ds
#queues
+1
vote
1
answer
18
Modify question gate 2003
A data structure is required for storing a set of integers such that each of the following operations can be done in O(logn) time, where n is the number of elements in the set. Deletion of the smallest element Insertion of an element. Which of the following data ... balance Bst also it should be O(logn) as for balancing it will take O(logn) time . Correct me if i am wrong
asked
Jul 28
in
DS
by
Prince Sindhiya
Active
(
1.9k
points)

26
views
datastructure
0
votes
1
answer
19
GeeksForGeeks Question
If arity of operators is fixed, then which of the following notations can be used to parse expressions without parentheses? a) Infix Notation (Inorder traversal of a expression tree) b) Postfix Notation (Postorder traversal of a expression tree) c) Prefix Notation (Preorder traversal of a expression tree) A b and c B Only b C a, b and c D None of them What arity of operators?
asked
Jul 28
in
DS
by
pream sagar
(
385
points)

42
views
+1
vote
2
answers
20
Made Easy test series DS
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the root of binary search tree and 8 is immediate right child of 4 are ________.
asked
Jul 27
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

74
views
0
votes
0
answers
21
Made Easy test series DS
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 the leaf node . Let ... , B is (len=1) d) A is path(x >left, len)  path(x> right, len), B is (len=1)
asked
Jul 27
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

36
views
0
votes
1
answer
22
Made Easy test series DS
Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary tree of height h = 4 _________. (Assume root is at height 0)
asked
Jul 27
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

45
views
0
votes
1
answer
23
Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
asked
Jul 26
in
DS
by
kapilbk1996
(
265
points)

54
views
stack
queues
datastructure
pointers
0
votes
0
answers
24
Hashing
Keys 9,19,29,39,49,59,69 are inserted into a hash table containing entries from 0 to 9 using hash function H=kmod10 and quadratic probing is used for collision resolution. What is the index into which 59 will be inserted? a)3 b)6 c)8 d)5
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

27
views
0
votes
1
answer
25
Ace Programming and DS
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

42
views
0
votes
0
answers
26
Ace Programming and DS
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

34
views
0
votes
1
answer
27
Ace Programming and DS
a) Reverse the linked list b)Convert to circular linked list c)Converting a given singly linked list to have alternate nodes of singly linked list d)Converting a given singly linked list to have alternate nodes of circular linked list
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

41
views
0
votes
1
answer
28
Ace Programming and DS
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

27
views
0
votes
0
answers
29
Ace Programming and DS
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

31
views
+1
vote
0
answers
30
Made Easy Programming and DS
asked
Jul 26
in
DS
by
Sambhrant Maurya
Junior
(
609
points)

22
views
Page:
1
2
3
4
5
6
...
35
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
Members at the site
Deepalitrapti
Rishav Kumar Singh
Shri Navdurga Navgra
POSHAN
BASANT KUMAR
Venus tyagi
Shubhgupta
Saurabh singh second
mainaksen
Recent Posts
Donation (Kerala Flood)
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
All categories
General Aptitude
1.3k
Engineering Mathematics
5.5k
Digital Logic
2.1k
Programming & DS
4k
Programming
2.9k
DS
1k
Algorithms
3.4k
Theory of Computation
4.2k
Compiler Design
1.6k
Operating System
3k
Databases
3.1k
CO & Architecture
2.7k
Computer Networks
3.1k
Non GATE
1.1k
Others
1.4k
Admissions
501
Exam Queries
450
Tier 1 Placement Questions
19
Job Queries
62
Projects
12
Follow @csegate
Gatecse
Recent questions in DS
Recent Blog Comments
Sir I have ordered GO PDF on 16 Aug 2018 still ...
gate overflow books are awesome; every one should ...
Books are there but don't think any will leave ...
Sir i have placed the order Details are PAYMENT ...
Sir i am placing order for gate overflew book ...
38,115
questions
45,621
answers
132,330
comments
49,305
users