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
NOTE_C/DS_1_31
Consider the integer array A[1…...100, 1…...100] in which the elements are stored in Z representation. If the base address of A is starting from 1000 onwards, size of each element is 1 byte and A is stored in Row Major Order, then the address corresponding to A[100][55] is ________.
asked
Dec 17, 2018
in
DS
by
BOB
(
321
points)

49
views
0
votes
0
answers
2
NOTE_C/DS_1_16
consider a hash table of size 10 that employs open addressing with linear probing. The hash function is given by h(k)=k mod 10. The hash table contains bins indexed from 0 to 9. A sequence of records with keys given below is inserted into ... ,23,86,41,62,72. The number of unsuccessful probes required to find the index of bin which contains the last elements is______________________.
asked
Dec 17, 2018
in
DS
by
BOB
(
321
points)

53
views
0
votes
0
answers
3
Aspire Buzz #hashing
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is : a.)Less than 1 b.)Less than n c.)Less than m d.)Less than n/2. My thought: If all the elements maps to same key then number of collisions would be less than n, am I wrong anywhere
asked
Dec 17, 2018
in
DS
by
Hemanth_13
Loyal
(
6.7k
points)

73
views
hashing
0
votes
0
answers
4
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
Dec 13, 2018
in
DS
by
Jeeva Shetty
(
113
points)

33
views
0
votes
1
answer
5
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)
asked
Dec 13, 2018
in
DS
by
pream sagar
Active
(
2.3k
points)

58
views
0
votes
1
answer
6
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
asked
Dec 13, 2018
in
DS
by
pream sagar
Active
(
2.3k
points)

63
views
0
votes
1
answer
7
ME Test Series
The minimum number of comparisons required to find the $65^{th}$ smallest element in a minheap is equal to _____
[closed]
asked
Dec 13, 2018
in
DS
by
Shadan Karim
Junior
(
649
points)

37
views
0
votes
0
answers
8
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
Dec 13, 2018
in
DS
by
himgta
Active
(
3.7k
points)

48
views
0
votes
0
answers
9
ME TEST SERIES
https://gateoverflow.in/201903/lastlevelorder How to solve it? Last level order?
asked
Dec 12, 2018
in
DS
by
himgta
Active
(
3.7k
points)

45
views
+2
votes
2
answers
10
Gateforum Test Series: Programming & DS  Binary Tree
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as BAC . The exact pre order traversal of the tree is? A)CAB B)ABC C)CBA D)Can't be determined from given information.
asked
Dec 11, 2018
in
DS
by
Parth Shah
Junior
(
745
points)

120
views
gateforumtestseries
datastructures
binarytree
+1
vote
1
answer
11
MadeEasy Test Series 2019: Programming & DS  Arrays
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] ?
asked
Dec 11, 2018
in
DS
by
Shamim Ahmed
Active
(
2.5k
points)

115
views
madeeasytestseries
datastructures
arrays
0
votes
0
answers
12
avl treeAAI exam
asked
Dec 11, 2018
in
DS
by
SeemaTanwar
Junior
(
501
points)

66
views
0
votes
1
answer
13
MadeEasy Subject Test 2019: Programming & DS  Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
asked
Dec 10, 2018
in
DS
by
CHïntän ÞäTël
(
217
points)

142
views
madeeasytestseries
datastructures
binarytree
0
votes
0
answers
14
DataStructure
is hashing there in gate 2019 syllabus?
asked
Dec 9, 2018
in
DS
by
abhishek1995_cse
(
111
points)

93
views
datastructures
hashing
+1
vote
1
answer
15
Depth First Search: Finding if The graph is connected
Better Explanation??
asked
Dec 8, 2018
in
DS
by
pradeepchaudhary
Active
(
1.2k
points)

57
views
datastructures
dfs
graphalgorithms
+1
vote
2
answers
16
NIELIT 201854
______ to evaluate an expression without any embedded function calls. Two stacks are required one stack is needed Three stacks are required More than three stacks are required
asked
Dec 7, 2018
in
DS
by
Arjun
Veteran
(
431k
points)

79
views
nielit2018
stack
expressionevaluation
0
votes
1
answer
17
NIELIT 201884
For the given nodes: $89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$ minimum ______ number of interchanges are required to convert it into a maxheap. $3$ $4$ $5$ $6$
asked
Dec 7, 2018
in
DS
by
Arjun
Veteran
(
431k
points)

45
views
nielit2018
heap
datastructures
+1
vote
0
answers
18
MadeEasy Test Series: Programming & DS  Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown. The number of elements that will remain in the stack after the parsing of the input string according to the above SDT rules is _______ I think the answer should be 5 but 4 is provided as answer.
asked
Dec 7, 2018
in
DS
by
Gupta731
Active
(
4.8k
points)

108
views
madeeasytestseries
datastructures
stack
0
votes
1
answer
19
WHAT IS CORRECT ANSWER
https://gateoverflow.in/17423/isro201436 WE WILL START INSERING FROM q[2] OR FROM q[3]
asked
Dec 6, 2018
in
DS
by
eyeamgj
Loyal
(
6.2k
points)

32
views
0
votes
0
answers
20
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, 2018
in
DS
by
Mk Utkarsh
Boss
(
36.6k
points)

148
views
linkedlists
datastructures
0
votes
1
answer
21
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.
asked
Dec 3, 2018
in
DS
by
jatin khachane 1
Loyal
(
7.5k
points)

69
views
algorithms
graphtheory
0
votes
0
answers
22
MadeEasy Test Series: Programming & DS  Linked Lists
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 ... pointer to the starling node of the linked list. Which of the following options is correct? How deletion possible with S2?
asked
Dec 3, 2018
in
DS
by
Ashish Roy 1
(
167
points)

195
views
madeeasytestseries
datastructures
linkedlists
–1
vote
0
answers
23
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?
[closed]
asked
Dec 2, 2018
in
DS
by
Hemant Soni 1
(
31
points)

81
views
+1
vote
1
answer
24
MadeEasy Test Series: Programming & DS  Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
asked
Dec 1, 2018
in
DS
by
jatin khachane 1
Loyal
(
7.5k
points)

155
views
madeeasytestseries
datastructures
stack
infixpostfix
0
votes
0
answers
25
If G is an undirected planar graph on
[closed]
asked
Nov 28, 2018
in
DS
by
Neeru
(
23
points)

22
views
0
votes
0
answers
26
Tower of Hanoi Please explain this question
asked
Nov 26, 2018
in
DS
by
Ankit Garg 2
(
73
points)

47
views
towersofhanoi
+1
vote
1
answer
27
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
asked
Nov 26, 2018
in
DS
by
Gate Fever
Active
(
4.7k
points)

105
views
0
votes
0
answers
28
MadeEasy Test Series 2018: Programming & DS  Hashing
What is the number of collisions while doing insert operation on the hash table? Options are 3 4 5 6 Answer is 4 Can anyone tell me how?
asked
Nov 25, 2018
in
DS
by
Jyoti Kumari97
(
187
points)

120
views
programming
datastructures
hashing
madeeasybooklet
0
votes
2
answers
29
#made esay book
Number of possible ordered trees with 3 nodes x,y,z
asked
Nov 24, 2018
in
DS
by
amit166
Junior
(
775
points)

29
views
+2
votes
1
answer
30
MadeEasy Subject Test 2019: Programming & DS  Heap
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
asked
Nov 24, 2018
in
DS
by
Utkarsh Joshi
Loyal
(
7.8k
points)

617
views
madeeasytestseries
datastructures
heap
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
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
@MiNiPanda Congrax mate for this success !
Mostly authentic links, it can be Stackoverflow,...
While raising objections what works as...
It is mentioned "Left for Evaluation" so no...
I think this discussion will keep on going till...
50,737
questions
57,324
answers
198,405
comments
105,169
users