The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent questions in DS
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
+1
vote
1
answer
1
#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)
asked
Nov 23, 2018
in
DS
by
vaibhav singh 3
(
129
points)

64
views
0
votes
1
answer
2
#topological
number of toplogical sort sequence
asked
Nov 22, 2018
in
DS
by
amit166
Junior
(
775
points)

100
views
topologicalsort
0
votes
0
answers
3
SELF DOUBT
https://gateoverflow.in/2716/gate1996112 WHAT CAN BE THE SITUATION WHERE B AND C BOT CAN BE SAID TRUE ?
asked
Nov 22, 2018
in
DS
by
eyeamgj
Loyal
(
6.2k
points)

34
views
+1
vote
1
answer
4
#doubt
Q.which give unique Binary tree? 1.level order and preorder 2.level order and postorder 3.level order and inorder
asked
Nov 21, 2018
in
DS
by
amit166
Junior
(
775
points)

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

26
views
0
votes
0
answers
6
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, 2018
in
DS
by
aditi19
Loyal
(
5.2k
points)

124
views
timecomplexity
linkedlists
datastructures
+1
vote
0
answers
7
BINARY MIN HEAP MADE EASY TEST
Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.
asked
Nov 20, 2018
in
DS
by
codingo1234
Junior
(
937
points)

184
views
min
binaryheap
+1
vote
0
answers
8
homework
Consider the following recursive C function. If get (6) function is being called in main () then how many times will they get () Function be invoked before returning to the main ()?
[closed]
asked
Nov 17, 2018
in
DS
by
deepanshu sharma 3
(
83
points)

42
views
+1
vote
1
answer
9
homework
Given an array A[1:6,2:10]. The base address of array is 1000. If every elements takes 4 bytes for storage then compute the address of element A[5,7] answer given is 1348
asked
Nov 17, 2018
in
DS
by
deepanshu sharma 3
(
83
points)

33
views
0
votes
0
answers
10
LinkedList
[closed]
asked
Nov 16, 2018
in
DS
by
Abhisek Tiwari 4
Loyal
(
5.2k
points)

57
views
0
votes
0
answers
11
Max heap when stored in an array is always in sorted order
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true? I have a counter example for ... it an heapified representation or not? If we heapify after deletion and store max deleted element then we get sorted array.
asked
Nov 15, 2018
in
DS
by
sripo
Active
(
2.5k
points)

239
views
sorting
binaryheap
arrays
heap
datastructures
algorithms
0
votes
0
answers
12
Heaps
How to detect the maximum level and minimum level at which an element of heap can be made to be present? Suppose a min heap has elements from 1 to 1024 . Suppose a max heap has elements from 1 to 1024. Find for : 9, 100, 512. (Both max and min heap, max and min level possible) Root is at level 1.
asked
Nov 11, 2018
in
DS
by
roh6jmon
(
123
points)

33
views
0
votes
0
answers
13
DATA STRUCTURES
WHY?? CAN ANYONE EXPLAIN
asked
Nov 11, 2018
in
DS
by
nag.swarna
(
191
points)

73
views
testseries
+1
vote
0
answers
14
made easy 2019 Q33
how many of the following statements is incorrect regarding the time complexity of binary search tree,AVL Tree, min heap, binary tree? i assumed non existent elements are those which do not exists in a tree, acc to me only (a) is incorrect! because to find any element in BST, It takes O(n) time
asked
Nov 11, 2018
in
DS
by
Gate Fever
Active
(
4.7k
points)

289
views
0
votes
0
answers
15
made easy tt2 Q11
how is this working????
asked
Nov 11, 2018
in
DS
by
Gate Fever
Active
(
4.7k
points)

46
views
0
votes
1
answer
16
made easy tt2
No. of BST possible with 12 keys , when 1,2,....12 are inserted into empty BST with a condition that 4 is the root and 8 is the immediate right child of 4 are....?? pls tell me why my approach is wrong?? since 4 is the root so 4 should come first in all sequence ... rest of the element 5,6,7,9,10,11,12 they can also come in order , s0 it becomes = 7! =5040 TOTAL WAYS = 24*5040=120960
[closed]
asked
Nov 11, 2018
in
DS
by
Gate Fever
Active
(
4.7k
points)

65
views
0
votes
1
answer
17
DATA STRUCTURES
Can anyone explain answer is A
asked
Nov 9, 2018
in
DS
by
nag.swarna
(
191
points)

200
views
datastructures
strings
0
votes
0
answers
18
Tree doubt
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal. Respectively, of a complete binary tree. Which of the following is always true? (a) LASTIN = LASTPOST (b) LASTIN = LASTPRE (c) LASTPRE = LASTPOST (d) None of the above
[closed]
asked
Nov 9, 2018
in
DS
by
Surya Dhanraj
Active
(
2.3k
points)

29
views
0
votes
0
answers
19
seld doubt epl
https://gateoverflow.in/84828/gate19903iv answer ? how to calculate epl can any one give example?
asked
Nov 9, 2018
in
DS
by
eyeamgj
Loyal
(
6.2k
points)

44
views
0
votes
1
answer
20
SELF DOUBT
https://gateoverflow.in/83993/gate19902viii WHAT IS CORRECT ANSWER FOR HEAP?
asked
Nov 9, 2018
in
DS
by
eyeamgj
Loyal
(
6.2k
points)

24
views
0
votes
0
answers
21
made easy
Consider a hashing function that resolves collision by quadratic probing.Assume the address space is indexed from 1 to 8.Which of the following location will never be probed if a collison occurs at a position 4? a) 4 b)5 c)8 d)2
asked
Nov 8, 2018
in
DS
by
Piyush mishra
(
385
points)

69
views
0
votes
1
answer
22
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
asked
Nov 8, 2018
in
DS
by
sripo
Active
(
2.5k
points)

98
views
datastructures
binarytree
heap
binaryheap
0
votes
1
answer
23
Binary Search Tree
Consider the following routine bool do(struct node *root) { if(!root) return true; else if(( root > left != NULL && root > data < root > left> data) (root>right != NULL && root > data > root > ... > right)); } What does they do() check whether a given tree is: $A)$ Max heap $B)$ Min Heap $C)$BST $D)$ Binary Tree
asked
Nov 6, 2018
in
DS
by
Lakshman Patel RJIT
Veteran
(
59.4k
points)

67
views
datastructures
binarysearchtree
0
votes
1
answer
24
AVL Tree
The minimum number of node in an AVL Tree of height $10$ is ____________
asked
Nov 6, 2018
in
DS
by
Lakshman Patel RJIT
Veteran
(
59.4k
points)

92
views
datastructures
avltree
0
votes
0
answers
25
Rank of the index
Consider the following What is the rank(index) of the node $50?$
asked
Nov 6, 2018
in
DS
by
Lakshman Patel RJIT
Veteran
(
59.4k
points)

83
views
datastructures
testseries
0
votes
0
answers
26
Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the postorder traversal for the tree is BAC. The exact preorder traversal for the tree is. CAB ABC CBA A definite preorder traversal cannot be determined from the information given
[closed]
asked
Nov 6, 2018
in
DS
by
shgarg
(
21
points)

204
views
datastructures
binarytree
madeeasybooklet
treetraversal
0
votes
0
answers
27
Intersection among elements of Linked List
Given two unsorted singlylinked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to use constant extra space only?
asked
Nov 4, 2018
in
DS
by
srestha
Veteran
(
119k
points)

208
views
linkedlists
datastructures
0
votes
1
answer
28
trees
formula for which maximum number of nodes will be present in complete narray tree?
asked
Nov 2, 2018
in
DS
by
suneetha
(
447
points)

40
views
datastructures
0
votes
1
answer
29
2DArray
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 ________.
[closed]
asked
Nov 1, 2018
in
DS
by
Ankish Gupta 3
(
81
points)

173
views
programminginc
arrays
pointers
datastructures
+1
vote
0
answers
30
Testbook Test Series: Programming & DS  Hashing
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be ... a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.
asked
Oct 31, 2018
in
DS
by
vinay chauhan
Active
(
1.2k
points)

184
views
testbooktestseries
datastructures
hashing
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
45
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent questions in DS
Recent Blog Comments
@saransh0 ...... I am getting 108... is there any...
Yes you are through! Prepare for Interview
Guys do you think I have a chance? I am getting...
And there is some question like where they...
Yes post order question is also wrong.....
50,737
questions
57,391
answers
198,589
comments
105,442
users