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
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 and answers in DS
0
votes
1
answer
1
aai 2018
Consider an AVL tree constructed by inserting the elements 18, 10,5,3,27,7,35,43,32 one by one . Which of following options gives the number of comparisions to search the key value 45 in this AVL tree? 3 5 4 2 in this question ans 5 is correct or 4 ? i think ans 5 is correct 4 for non match element one for not present so ans will be 5
answered
2 days
ago
in
DS
by
Lakshman Patel RJIT
Boss
(
20.2k
points)

39
views
0
votes
0
answers
2
data structure array
Which of the following C expressions access the (i, j)th entry of an (mn) matrix strored in column major order? n(i1)+j m(j1)+i m(nj)+j n(mi)+j
[closed]
asked
2 days
ago
in
DS
by
Jeeva Shetty
(
37
points)

12
views
0
votes
1
answer
3
ME Test Series
The minimum number of comparisons required to find the $65^{th}$ smallest element in a minheap is equal to _____
[closed]
answered
2 days
ago
in
DS
by
Devwritt
Active
(
3.9k
points)

17
views
0
votes
1
answer
4
aai 2018
Which of the following is the time complexity to find the determinant of an upper triangular matrix of order n*n? O(n^2.5) O(n) O(n^2) O(1)
answered
2 days
ago
in
DS
by
Devwritt
Active
(
3.9k
points)

29
views
0
votes
0
answers
5
Made easy
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11. 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21 Where hash table using quarditic probing of (key, i) = (H (key) + ... , after inserting the above keys in table. Then find the number of keys cannot go inside the hash table ________ (value will be a whole number).
asked
2 days
ago
in
DS
by
himgta
Active
(
2.8k
points)

10
views
0
votes
1
answer
6
last level order.
Consider the following last level order strategy for traversing a binary tree: Visit right sub tree using last level order. Visit left sub tree using last level order. Visit root. Assume ↑ is power operator and it has the highest precedence and follows right associativity. The last level order traversal of ... 7, *, 1, 7, ↑, /, 7, +,  7, 7, 1, *, 1, 7, ↑, /, 7, +, 
answered
3 days
ago
in
DS
by
Shaik Masthan
Boss
(
42.4k
points)

122
views
datastructure
0
votes
0
answers
7
ME TEST SERIES
https://gateoverflow.in/201903/lastlevelorder How to solve it? Last level order?
asked
3 days
ago
in
DS
by
himgta
Active
(
2.8k
points)

24
views
+1
vote
1
answer
8
Made Easy Test
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 Byte Array implemented in row major order, base address is 1000 Address of A[66][50] ?
answered
4 days
ago
in
DS
by
Devwritt
Active
(
3.9k
points)

30
views
madeeasytestseries
datastructure
array
+3
votes
1
answer
9
GATE19902viii
Match the pairs in the following questions: (a) A heap construction (p) $\Omega (n \log_{10} n)$ (b) Constructing Hashtable with linear probing (q) $O (n)$ (c) AVL Tree construction (r) $O (n^{2}$ (d) Digital trie construction (s) $O (n \log_{10} n)$
answered
4 days
ago
in
DS
by
Aizaz ahammad
(
11
points)

544
views
gate1990
matchthefollowing
datastructure
0
votes
0
answers
10
avl treeAAI exam
asked
4 days
ago
in
DS
by
SeemaTanwar
(
493
points)

39
views
0
votes
0
answers
11
DataStructure
is hashing there in gate 2019 syllabus?
asked
6 days
ago
in
DS
by
abhishek1995_cse
(
159
points)

30
views
datastructure
hashing
+1
vote
1
answer
12
GATEBOOK2019DS112
Let the minimum number of stack(s) required to evaluate a prefix expression is $A$ and the value of the prefix expression $+2*34+/8215$ (all numbers are unit digit) evaluated using the same number of stack(s) is $B$. What are the values of $A$ and $B$? $1,4$ $2,6$ $1,6$ $2,4$
answered
6 days
ago
in
DS
by
Arjun
Veteran
(
369k
points)

119
views
gb2019ds1
stack
+1
vote
0
answers
13
Depth First Search: Finding if The graph is connected
asked
Dec 8
in
DS
by
pradeepchaudhary
Junior
(
919
points)

15
views
datastructure
dfs
graphalgorithms
0
votes
1
answer
14
WHAT IS CORRECT ANSWER
https://gateoverflow.in/17423/isro201436 WE WILL START INSERING FROM q[2] OR FROM q[3]
answered
Dec 7
in
DS
by
Devwritt
Active
(
3.9k
points)

14
views
0
votes
0
answers
15
Testbook  Linked List
int find (struct node * first, int n) { while (first data ! = n) first = first — next; if (first data = = n) return(1); else return (1); in the above code segment if the value of 'n' is 5, then the function return 1, but if the value of 'n' is 9, then what does it do ?
asked
Dec 5
in
DS
by
Mk Utkarsh
Boss
(
29.7k
points)

81
views
linkedlists
datastructure
+30
votes
8
answers
16
GATE2004IT13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worstcase time complexity of the bestknown algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
answered
Dec 4
in
DS
by
vcrname9295
(
69
points)

3.6k
views
gate2004it
datastructure
linkedlists
normal
ambiguous
0
votes
1
answer
17
Self Doubt
If a graph with n vertices has more than $\left ( n1 \right )\left ( n2 \right ) / 2$ edges then it is connected. I am a bit confused about this question, since I can always prove that for a graph to connected you need more than $\geq n1$ edges.
answered
Dec 3
in
DS
by
Jaideep Bankoti
Junior
(
505
points)

54
views
algorithms
graphtheory
+1
vote
3
answers
18
If Inorder and Preorder is given then what will be the time complexity of creating binary tree?
answered
Dec 3
in
DS
by
neerajyadav
(
171
points)

609
views
0
votes
0
answers
19
Made easy Test Series
You're entrusted with the task of deleting a node in a singly linkedlist, whose data field is 'x'. Note that, the node which is to be deleted can be at any arbitrary position in the linked list. Consider the following scenarios. S1. You're only ... with a pointer to the starling node of the linked list. Which of the following options is correct? How deletion possible with S2?
asked
Dec 3
in
DS
by
Ashish Roy 1
(
111
points)

73
views
madeeasytestseries
datastructure
–1
vote
0
answers
20
nielit
A program P reads 1000 integers in the range[0...100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?
asked
Dec 2
in
DS
by
Hemant Soni 1
(
35
points)

51
views
+4
votes
4
answers
21
Hashing
Suppose you insert three keys into a hash table with m slots. Assuming the simple uniform hashing assumption, and given that collisions are resolved by chaining, what is the probability that both slots 0 and 1 are empty? (A) (m−2) /(m−1) (B) (m−2) /m (C) ((m−2) /m )3 (D) None
answered
Dec 2
in
DS
by
pradeepchaudhary
Junior
(
919
points)

142
views
hashing
datastructure
uniformhashing
+22
votes
8
answers
22
GATE2007IT28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
answered
Dec 2
in
DS
by
pradeepchaudhary
Junior
(
919
points)

4.3k
views
gate2007it
datastructure
hashing
probability
normal
+2
votes
1
answer
23
Double hashing
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) = x mod 7 + 1 ? I am getting collision even after using h2(x) for 16 Please somebody can explain it? Given solution :
answered
Dec 1
in
DS
by
pradeepchaudhary
Junior
(
919
points)

286
views
hashing
datastructure
0
votes
0
answers
24
If G is an undirected planar graph on
[closed]
asked
Nov 28
in
DS
by
Neeru
(
25
points)

14
views
+1
vote
1
answer
25
made easy 2018
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ? 3 will be popped out from stack at 3rd position what does this mean?? 1) third pop operation performed should be of 3 2)3 is at third position while pushing into the stack really confused , pls help
answered
Nov 27
in
DS
by
Shaik Masthan
Boss
(
42.4k
points)

75
views
0
votes
1
answer
26
GATE19887ii
Mark the balance factor of each on the tree given on the below figure and state whether it is heightbalanced.
answered
Nov 26
in
DS
by
Gurdeep Saini
Active
(
5.2k
points)

75
views
gate1988
normal
descriptive
0
votes
0
answers
27
Tower of Hanoi Please explain this question
asked
Nov 26
in
DS
by
Ankit Garg 2
(
75
points)

27
views
towersofhanoi
+14
votes
5
answers
28
GATE2015312
The result evaluating the postfix expression $10 \ 5 + 60 \ 6 / * 8 $ is $284$ $213$ $142$ $71$
answered
Nov 26
in
DS
by
Asim Siddiqui 4
(
275
points)

2.9k
views
gate20153
datastructure
stack
normal
+77
votes
13
answers
29
GATE2016240
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
answered
Nov 26
in
DS
by
ambikesh
(
213
points)

9.1k
views
gate20162
datastructure
binarysearchtree
normal
numericalanswers
+33
votes
2
answers
30
GATE200747
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$
answered
Nov 25
in
DS
by
Rajesh Panwar
(
271
points)

3.5k
views
gate2007
datastructure
heap
normal
+28
votes
7
answers
31
GATE2014241
Suppose a stack implementation supports an instruction $REVERSE$, which reverses the order of elements on the stack, in addition to the $PUSH$ and $POP$ instructions. Which one of the following statements is TRUE (with respect to this modified stack)? A ... $ENQUEUE$ and $DEQUEUE$ take a single instruction each.
answered
Nov 25
in
DS
by
Rajat Agrawal007
(
417
points)

4.7k
views
gate20142
datastructure
stack
easy
0
votes
2
answers
32
#made esay book
Number of possible ordered trees with 3 nodes x,y,z
answered
Nov 25
in
DS
by
`JEET
Active
(
2.2k
points)

20
views
+1
vote
1
answer
33
MADEEASY DS
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
answered
Nov 24
in
DS
by
srestha
Veteran
(
103k
points)

150
views
madeeasytestseries
datastructure
heap
0
votes
1
answer
34
#test_series_made_easy
a min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in an array of 1024 indices. the maximum difference between element 512 present at the maximum level and minimum level is (assume root is present at level 1)
answered
Nov 23
in
DS
by
Shaik Masthan
Boss
(
42.4k
points)

44
views
0
votes
1
answer
35
#topological
number of toplogical sort sequence
answered
Nov 23
in
DS
by
Shaik Masthan
Boss
(
42.4k
points)

77
views
topologicalsort
+7
votes
8
answers
36
ISRO201119
If node A has three siblings and B is parent of A, what is the degree of A? 0 3 4 5
answered
Nov 22
in
DS
by
anchitjindal07
Active
(
2.2k
points)

3k
views
isro2011
datastructure
trees
0
votes
0
answers
37
SELF DOUBT
https://gateoverflow.in/2716/gate1996112 WHAT CAN BE THE SITUATION WHERE B AND C BOT CAN BE SAID TRUE ?
asked
Nov 22
in
DS
by
eyeamgj
Loyal
(
6.3k
points)

24
views
+1
vote
1
answer
38
#doubt
Q.which give unique Binary tree? 1.level order and preorder 2.level order and postorder 3.level order and inorder
answered
Nov 21
in
DS
by
anjali007
Active
(
2.9k
points)

38
views
0
votes
0
answers
39
#data structure
what is the difference between full binary tree,stricly binary tree,complete tree,perfect tree,alomst complete tree?
asked
Nov 20
in
DS
by
amit166
Junior
(
529
points)

20
views
0
votes
0
answers
40
Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node? my approach is... As there is no previous pointer so we traverse the list from the starting to just ... complexity as O(n) and space complexity O(1). but in the book the time complexity is mentioned O(1) where am I going wrong?
asked
Nov 20
in
DS
by
aditi19
Active
(
2.1k
points)

35
views
timecomplexity
linkedlists
datastructure
To see more, click for all the
questions in this category
.
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
abhinav03
Mk Utkarsh
amitpandey675
SomeEarth
PiratedVirus
pps121
Kapil
tusharp
Recent Posts
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
All categories
General Aptitude
1.4k
Engineering Mathematics
6.5k
Digital Logic
2.5k
Programming & DS
4.6k
Programming
3.3k
DS
1.2k
Algorithms
4k
Theory of Computation
5k
Compiler Design
1.9k
Operating System
3.7k
Databases
3.7k
CO & Architecture
3.2k
Computer Networks
3.7k
Non GATE
1.2k
Others
1.3k
Admissions
512
Exam Queries
504
Tier 1 Placement Questions
23
Job Queries
66
Projects
18
Follow @csegate
Gatecse
Recent questions and answers in DS
Recent Blog Comments
Please elucidate this really important...
when will be the grand/full test added??
There is one more problem. Ppl who have...
44,284
questions
49,774
answers
164,287
comments
65,856
users