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
0
votes
0
answers
1
Data Structures in C by Sahni  Circular Queue using Dynamic Arrays
I'm learning data structures from a book. In the topic, Circular Queue using Dynamic Array, the author has mentioned below point, Let capacity be the initial capacity of the circular queue,We must first increase the size of ... capacity elements. But how does array doubling and slide to right copy at most 2 * capacity 2 elements??
asked
Apr 14, 2019
in
DS
by
Durga Teja
(
31
points)

140
views
datastructures
queues
0
votes
0
answers
2
# Binary tree
A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left sub tree is atleast half and at most twice the no. of nodes in the right sub tree. The maximum possible height of such a tree with n nodes is best described by which of the following? (a) log2 n (b) log4/3 n (c) log3 n (d) log3/2 n
[closed]
asked
Apr 13, 2019
in
DS
by
Golam Murtuza
(
421
points)

39
views
0
votes
0
answers
3
AVL Tree Balancing
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZAIMRANNAVEEN or RL rotation from IMRANNAVEENLOVELY
asked
Apr 13, 2019
in
DS
by
kd.....
Junior
(
853
points)

55
views
avltree
datastructures
tree
bst
algorithms
0
votes
0
answers
4
Made Easy:Programming &DS
The number of possible ordered trees with 3 nodes A,B,C is ??
asked
Mar 22, 2019
in
DS
by
sandeep singh gaur
(
307
points)

69
views
tree
+1
vote
1
answer
5
Self doubt
I have a confusion regarding the array implementation of binary tree ,i.e what are the index locations of the left child of a node whether it is 2i+1 or 2i and same for right child ,can anyone explain?
asked
Mar 17, 2019
in
DS
by
Winner
(
431
points)

61
views
datastructures
0
votes
0
answers
6
JNU , DS TREE, INORDER
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal would return (a) FAEKCDBHG (b) FAEKCDHGB (c) EAFKHDCBG (d) FEAKDCHBG
asked
Feb 24, 2019
in
DS
by
8676rau
(
9
points)

192
views
0
votes
0
answers
7
DataStructureDeQueue
Suppose a dequeue is stored in a circular array with N memory cells. At which of the following condition is the dequeue is full? (i) LEFT = N and RIGHT = 1 (ii) LEFT = RIGHT + 1 (iii) LEFT = 1 and RIGHT = N (iv) LEFT = RIGHT  1 + N (i) and (iii) (iii) and (iv) (ii) and (iii) (i) and (iv)
asked
Feb 24, 2019
in
DS
by
Abhisek Tiwari 4
Loyal
(
5.2k
points)

586
views
0
votes
0
answers
8
self doubt
somewhere we seen that formula How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.
asked
Feb 23, 2019
in
DS
by
sandeep singh gaur
(
307
points)

75
views
binarytree
0
votes
1
answer
9
ARRAY
A Sorted array of n elements contains 0 and 1 to find out majority of 0 and 1.How much time it will take??? and please explain Meaning majority of 0 and 1??
asked
Feb 19, 2019
in
DS
by
sandeep singh gaur
(
307
points)

119
views
arrays
0
votes
1
answer
10
MCA ARRAY ADDRESS CALCULATION
Find the address of the position [10, 11, 12] of array A in column major order? Given Dimension is A[1:10, 5:15, 10:15], w is two word count, and Base address is 200.
asked
Feb 17, 2019
in
DS
by
SKR1997
(
5
points)

159
views
+3
votes
5
answers
11
GATE201940
Consider the following statements: The smallest element in a maxheap is always at a leaf node The second largest element in a maxheap is always a child of a root node A maxheap can be constructed from a binary search tree in $\theta(n)$ time A binary search tree can be ... time Which of te above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
asked
Feb 7, 2019
in
DS
by
Arjun
Veteran
(
431k
points)

3k
views
gate2019
datastructures
heap
+14
votes
7
answers
12
GATE201946
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
asked
Feb 7, 2019
in
DS
by
Arjun
Veteran
(
431k
points)

6.6k
views
gate2019
numericalanswers
datastructures
binarytree
+1
vote
1
answer
13
gate 2019
Consider the following statements. (i) In max Heap smallest element is at the leaf node. (ii) In max Heap second largest element always the child of root. (iii) Binary search tree can be constructed from max heap in θ(n). (iv) Max Heap can be build from Binary search tree in θ(n) Which of the above ... ) and (iii) (b) (i), (ii) and (iv) (c) (ii), (iii) and (iv) (d) (i), (iii) and (iv)
asked
Feb 4, 2019
in
DS
by
pream sagar
Active
(
2.3k
points)

799
views
0
votes
3
answers
14
ternary tree
In a ternary tree the number of internal nodes of degree 1,2 and 3 is 4,3 and 3 respectively.The number of leaf nodes in the ternary is a)12 b)11 c)9 d)10
asked
Feb 3, 2019
in
DS
by
abc1
(
45
points)

1.1k
views
0
votes
1
answer
15
ME MOCK 2
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n; } } Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called. Then the value of X is _______________
asked
Jan 30, 2019
in
DS
by
himgta
Active
(
3.7k
points)

95
views
algorithms
0
votes
1
answer
16
Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9
asked
Jan 28, 2019
in
DS
by
Ram Swaroop
Loyal
(
5.3k
points)

138
views
datastructures
binarytree
0
votes
0
answers
17
MadeEasy Test Series 2019: Programming & DS  Hashing
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 a successful search is_ Answer 1.647
asked
Jan 27, 2019
in
DS
by
Ram Swaroop
Loyal
(
5.3k
points)

238
views
programminginc
datastructures
hashing
madeeasytestseries2019
madeeasytestseries
+1
vote
0
answers
18
made easy test
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from stack at 3rd position are _______ (assume one element enter in stack only one time).
asked
Jan 26, 2019
in
DS
by
pream sagar
Active
(
2.3k
points)

163
views
0
votes
0
answers
19
Quora
In a directed graph, a path is called special if every subpath of the path is shortest path. Subpath of a path P means every path in the path P, except P. A. Every shortest path is special B. Every special path is shortest
asked
Jan 25, 2019
in
DS
by
Cpt.Nemo143
(
49
points)

33
views
0
votes
0
answers
20
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
asked
Jan 25, 2019
in
DS
by
Nandkishor3939
Active
(
1.3k
points)

96
views
datastructures
binarytree
0
votes
0
answers
21
Number of sub graphs possible
Number of labelled subgraphs possible for the graph given below______________
asked
Jan 25, 2019
in
DS
by
Nandkishor3939
Active
(
1.3k
points)

109
views
graphtheory
datastructures
0
votes
0
answers
22
Gate cs 2017
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, ... node to front. We dont need to do this. So why B is the correct answer?D should be correct ? please explain.
asked
Jan 22, 2019
in
DS
by
sadiashafaque
(
35
points)

28
views
#g
usergate2017
usermod
#queue
+1
vote
0
answers
23
Madeeasy
Consider a procedure find ( ) which take array of n integers as input and produce pair of elements of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent worst case time ... difference. Also do elements in pair need to be adjutant to each other? It will really helpful if explained with small example
asked
Jan 17, 2019
in
DS
by
mehul vaidya
Loyal
(
5.3k
points)

56
views
0
votes
0
answers
24
Please solve this Q
asked
Jan 17, 2019
in
DS
by
kallu singh
Junior
(
659
points)

47
views
0
votes
1
answer
25
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
Jan 16, 2019
in
DS
by
srestha
Veteran
(
119k
points)

214
views
hashing
datastructures
+2
votes
1
answer
26
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
Jan 16, 2019
in
DS
by
sripo
Active
(
2.5k
points)

532
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructures
0
votes
0
answers
27
Testbook.com Test Series
When searching for the key value 50 in a binary search tree, nodes containing the key values 10,15,20,30,60,80,89,90 are traversed, not necessarily in the given order. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 50?
asked
Jan 16, 2019
in
DS
by
Rishav Chetan
(
35
points)

75
views
binarysearchtree
0
votes
1
answer
28
Finding the minimum element in a Heap
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap? Thank you:)
asked
Jan 15, 2019
in
DS
by
Nandkishor3939
Active
(
1.3k
points)

290
views
heap
binaryheap
timecomplexity
0
votes
0
answers
29
ME Test
[closed]
asked
Jan 13, 2019
in
DS
by
Shadan Karim
Junior
(
649
points)

46
views
0
votes
0
answers
30
MadeEasy Test Series: Programming & DS  Hashing
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11. 12,44,13,88,23,94,11,39,20,16,5 where to handle the collision chaining is used, after inserting ... in table if 2 new keys inserted into table, what is the probability new items hashed into empty slot?(upto 2 decimal places)
asked
Jan 11, 2019
in
DS
by
Ollie
(
481
points)

77
views
madeeasytestseries
hashing
probability
Page:
« prev
1
2
3
4
5
6
7
...
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
@Abhisheksawarn608 what makes you think...
I am getting 151 marks excluding question not...
Thank you @Arjun sir :)
Thanks for that @rohit1001
@Dumbest Kid > Jocko Podcast
50,737
questions
57,297
answers
198,265
comments
104,979
users