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 tagged graphsearch
0
votes
2
answers
1
MadeEasy Test Series: Algorithms  Graph Algorithms
Which of the following statement is true? For a directed graph, the absence of back edges in a DFS tree can have cycle. If all edge in a graph have distinct weight then the shortest path between two vertices is unique. The depth of any DFS ( ... tree rooted at a vertex is atleast as depth of any BFS tree rooted at the same vertex. Both (a) and (c)
asked
Jan 4
in
Algorithms
by
Abhishek Kumar 38
(
107
points)

161
views
madeeasytestseries
algorithms
graphsearch
graphalgorithms
+15
votes
9
answers
2
GATE201830
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ is between ... then $\mid ij \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
asked
Feb 14, 2018
in
Graph Theory
by
gatecse
Boss
(
16.8k
points)

5.5k
views
gate2018
graphtheory
graphsearch
normal
+7
votes
2
answers
3
GATE19893ixa
Answer the following: Which one of the following statements (s) is/are FALSE? Overlaying is used to run a program, which is longer than the address space of the computer. Optimal binary search tree construction can be performed efficiently by using dynamic ... components of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
asked
Nov 27, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.1k
points)

949
views
normal
gate1989
binarytree
graphsearch
+4
votes
1
answer
4
#Algorithm # DFS
Let G be a graph with n vertices and m edges. a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees? b. True or false: All its DFS forests will have the same number of tree edges and the same number of back edges?
asked
Oct 26, 2016
in
Algorithms
by
Geet
(
169
points)

617
views
graphsearch
dfs
+2
votes
1
answer
5
UGCNETJune2012III51
The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is Minmax strategy Alphabeta pruning strategy Constraint satisfaction strategy Static max strategy
asked
Jul 7, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

731
views
ugcnetjune2012iii
algorithms
graphsearch
treesearch
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
Recent Posts
REGARDING ISRO TEST SERIES BY MADEESASY
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged graphsearch
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,647
questions
56,459
answers
195,376
comments
100,265
users