Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged explain
0
votes
1
answer
#algoritm#heap
What is the difference between max heap and max heapify..?
asked
2 days
ago
in
Algorithms
by
Allica
(
13
points)

13
views
explain
0
votes
1
answer
#gate2017 #algorithms
In question given below plz explain how we know that which searching algorithms is fit in Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.
asked
2 days
ago
in
Algorithms
by
Allica
(
13
points)

20
views
plzz
explain
0
votes
1
answer
#gate2000#cse#graph
Why b option is incorrect Let G be an undirected graph. Consider a depthfirst traversal of G, and let T be the resulting depthfirst search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following ... u is a leaf in T (D) If {u,v} is not an edge in G then u and v must have the same parent in T
asked
4 days
ago
in
DS
by
Allica
(
13
points)

23
views
plzz
explain
0
votes
0
answers
Ace Bits and bytes practice question
please explain options A and B. How does the correlated query work with both the outside query and inside query. I don't understand how C.ESSN = SSN and C.PNO = B.PNO both are checked at the same time with the NOT EXISTS condition of the outside main query in option A.
asked
Dec 8, 2020
in
Databases
by
Lax 98
(
5
points)

9
views
explain
0
votes
0
answers
Ace bits and bytes
asked
Aug 26, 2020
in
Theory of Computation
by
Priya Singh 6
(
9
points)

16
views
explain
types
given
inque
0
votes
0
answers
Sorting & Searching
Consider a sequence A of length n which is sorted except for one item that appears out of order. Which of the following can sort the sequence in O(n) time ? A.) Heap sort B.) Quick sort C.) Merge sort D.) Insertion sort
asked
Sep 12, 2019
in
Algorithms
by
Harshverm776
(
5
points)

29
views
explain
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
8,968
questions
3,119
answers
14,340
comments
95,792
users