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
1
answer
1
array
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
Dec 28, 2018
in
DS
by
Rahul_Rathod_
(
431
points)

269
views
arrays
datastructures
programminginc
0
votes
0
answers
2
Self doubt on DFS
How to count the number of different DFS possible? For given question https://www.google.com/amp/s/www.geeksforgeeks.org/gategatecs2003question21/amp/
[closed]
asked
Dec 28, 2018
in
DS
by
vg653
(
191
points)

35
views
0
votes
1
answer
3
Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix : 2 5 x 6 + 4 2 x  MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??
asked
Dec 27, 2018
in
DS
by
Vikas123
(
321
points)

254
views
datastructures
programminginc
gate2019
preparation
0
votes
0
answers
4
Made Easy DS doubt
IS IT CORRECT…??
[closed]
asked
Dec 27, 2018
in
DS
by
Vikas123
(
321
points)

70
views
+5
votes
1
answer
5
GO2019FLT113
For a given $m$ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary approximations to nearest integer if required (Integer type)
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
2.7k
points)

297
views
go2019flt1
numericalanswers
trees
datastructures
+1
vote
0
answers
6
GO2019FLT143
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In case of even number of elements the recently popped out element is again pushed back either on the top or bottom of the stack randomly. ... i, ii ii, iii iii, iv ii, iv
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
2.7k
points)

253
views
go2019flt1
datastructures
stack
+1
vote
1
answer
7
GO2019FLT149
The path length of a node is defined as the number of edges from root to that node. For a given full binary tree, the sum of path length of all leaf nodes is equal to $16$. The total number of internal nodes present is equal to $5$. What is the sum of path length of all internal nodes? (Note: A full binary tree is a tree in which every node other than the leaves has 2 children)
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
2.7k
points)

273
views
go2019flt1
binarytree
datastructures
0
votes
0
answers
8
Testbook Test Series: Programming & DS  Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
asked
Dec 27, 2018
in
DS
by
Magma
Boss
(
13.8k
points)

80
views
testbooktestseries
datastructures
hashing
0
votes
1
answer
9
Linked list
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ; if (b = = NULL) return (a) ; If (a → data <= ... two linked lists by selecting the alternate nodes merges two sorted linked lists into final sorted linked list merges two linked lists by selecting the nodes in reverse.
asked
Dec 27, 2018
in
DS
by
sharadsingh
(
29
points)

128
views
linkedlists
datastructures
programminginc
0
votes
1
answer
10
MadeEasy Test Series: Programming & DS  Binary Tree
asked
Dec 26, 2018
in
DS
by
Shamim Ahmed
Active
(
2.5k
points)

140
views
madeeasytestseries
datastructures
binarytree
0
votes
2
answers
11
In a 3array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
asked
Dec 25, 2018
in
DS
by
sripo
Active
(
2.5k
points)

433
views
binarytree
trees
graphtheory
algorithms
datastructures
+1
vote
0
answers
12
Gateforum Test Series: Programming & DS  Linked Lists
asked
Dec 24, 2018
in
DS
by
Gupta731
Active
(
4.8k
points)

127
views
gateforumtestseries
datastructures
linkedlists
0
votes
1
answer
13
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
asked
Dec 24, 2018
in
DS
by
srestha
Veteran
(
119k
points)

214
views
stack
datastructures
0
votes
0
answers
14
Gateforum Class Notes
The array implementation of Queue throws an error when the array limit has been reached. So we consider the following alternative. Create a larger array using redefine function. The cost of the redefine that makes the array larger is proportional to the new size. Suppose we expand the array ... $N$ insertions will take. $O(N^2)$ $O(N^3)$ $O(N)$ $O(log_2N)$ Answer provided: $A$
asked
Dec 23, 2018
in
DS
by
Gupta731
Active
(
4.8k
points)

138
views
datastructures
queues
0
votes
0
answers
15
geeksforgeeks linklist
Consider the following function to traverse a linked list. void traverse(struct Node *head) { while (head>next != NULL) { printf("%d ", head>data); head = head>next; } } Which of the following is FALSE about above ... function doesn't print the last node when the linked list is not empty (C) The function is implemented incorrectly because it changes head
asked
Dec 23, 2018
in
DS
by
pream sagar
Active
(
2.3k
points)

62
views
0
votes
0
answers
16
Priority Queue
Is priority queue work efficiently with sorted array than unsorted array and heap for insertion and deletion operation? Then why do we apply priority queue in heap specially
asked
Dec 22, 2018
in
DS
by
srestha
Veteran
(
119k
points)

114
views
datastructures
priorityqueue
queues
0
votes
0
answers
17
GO MOCK2 Doubt
Consider the following possible data structures for a set of n distinct integers. A minheap An array of length sorted in increasing order A balanced binary search tree For which of these data structures, the number of steps needed to find and remove the 9th largest element in 0(logn) time in the worst case? I and III II and III I and II II only
asked
Dec 21, 2018
in
DS
by
jatin khachane 1
Loyal
(
7.5k
points)

59
views
datastructures
binarysearchtree
+1
vote
1
answer
18
Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?
asked
Dec 21, 2018
in
DS
by
Avijit Shaw
(
125
points)

353
views
heap
binaryheap
timecomplexity
datastructures
0
votes
0
answers
19
Question about Complete binary tree
4. Which of the following is a true about Binary trees? (a) Every binary tree is either complete or full (b) Every complete binary tree is also a full binary tree (c) Every full binary tree is also a complete binary tree (d) None of these Solution: Option (d) Please Explain why option c is not correct?
asked
Dec 21, 2018
in
DS
by
sagarkhatri
(
93
points)

182
views
0
votes
1
answer
20
Selfdoubt
Suppose we have an array with base address 2000. Each element of the array occupies 2 bytes. And we want to fetch the first 8 bits of the first element of the array. What will it return? More precisely I want to know what is stored in memory location 2000 to 2001 are stored in binary in the array? 400 401 402 403 404
asked
Dec 19, 2018
in
DS
by
Sweta Shaw
(
297
points)

150
views
arrays
array
datastructures
0
votes
0
answers
21
Testbook
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is: (A) O(1) (B) O(logn) (C) O(n) (D) O((logn)$^{2}$)
asked
Dec 19, 2018
in
DS
by
Rajat Agrawal007
Junior
(
675
points)

44
views
0
votes
1
answer
22
Testbook
Consider an open address hash table with uniform hashing. What is the time complexity of sucessfull search ? (A)O($\alpha$^{2}$) (B)O($\alpha$) (C)O(1$\alpha$) (D)O(1/1$\alpha$)
asked
Dec 19, 2018
in
DS
by
Rajat Agrawal007
Junior
(
675
points)

105
views
uniformhashing
+1
vote
0
answers
23
ME Test Series
Consider the following keys that are hashed into the hash table in the order given using the hash function $H(i) = (3i + 5) \ mod \ 11 $ 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 Where to handle the collision chaining is used, after ... all the above keys in table if 2 new keys inserted into table the what is the probability new items hashed into empty slot, (upto 2 decimal places)
asked
Dec 18, 2018
in
DS
by
Shadan Karim
Junior
(
649
points)

219
views
hashing
0
votes
1
answer
24
Gateforum Class Notes
Suppose we have a BST and we run a program on the BST with n leaf nodes and compute the value of a function $g(x)$ for each node in BST. If the cost of computing $g(x)$ is minimum of number of leaf node in left subtree and number of leaf node in right subtree. The worst case time complexity of the program is: $O(n)$ $O(nlog_2n)$ $O(n^2)^2$ $O(n^2log_2n)$
asked
Dec 18, 2018
in
DS
by
Gupta731
Active
(
4.8k
points)

84
views
datastructures
binarysearchtree
0
votes
0
answers
25
No Book
Consider the following function with a Binary Tree with atleat 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 T be a binary ... B is (len==1) D) A is path (x> left, len1)  path(x> right, len1), B is (len)
[closed]
asked
Dec 18, 2018
in
DS
by
kavya kamish upadhya
Junior
(
579
points)

42
views
0
votes
1
answer
26
Bookies
Which of the following algorithm is best suitable for sorting of linked list? A) Quick B) Merge C) Heap D) None
asked
Dec 18, 2018
in
DS
by
G4TE Hunter
(
181
points)

25
views
0
votes
1
answer
27
No Book
Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching? A) Linked list B) Sorted array C) Heap D) Hash table
asked
Dec 18, 2018
in
DS
by
kavya kamish upadhya
Junior
(
579
points)

38
views
0
votes
1
answer
28
NOTE_C/DS_1_27
Consider the following functions foobar(), which takes a binary tree as input: int foobar (struct node * root) { if(!root) return 0; if(!root → left && !root → right) return 10; else { int i = foobar (root → left); int j = foobar (root → right ... internal nodes of the binary tree (B) number of leaves of the binary tree (C) sum of leaves of the binary tree (D) none of these
asked
Dec 17, 2018
in
DS
by
BOB
(
321
points)

52
views
+1
vote
0
answers
29
NOTE_C/DS_1_30
Consider the following program: void ME(int n) { printf(“*”); if(n>1) { ME(n/4); ME(n/4); ME(n/4); ME(n/4); } } lets X be the number of asterisks printed by the above function when n=1024. Then the value of X will be___________. (Hint: take n as a power of 4)
asked
Dec 17, 2018
in
DS
by
BOB
(
321
points)

86
views
0
votes
0
answers
30
ME T1
Total number of nodes in tree number of leaves The number of edges in the longest path from root to leaf in T The number of nodes in the longest path from root to leaf in T
asked
Dec 17, 2018
in
DS
by
himgta
Active
(
3.7k
points)

25
views
Page:
« prev
1
2
3
4
5
6
7
8
9
...
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,404
comments
105,169
users