The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged graphsearch
+7
votes
8
answers
1
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 two nodes ... 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
in
Graph Theory
by
gatecse
Boss
(
18k
points)

2.2k
views
gate2018
graphtheory
graphsearch
normal
+7
votes
1
answer
2
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
(
40k
points)

519
views
normal
gate1989
overlay
binarytree
graphsearch
+4
votes
1
answer
3
#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
(
247
points)

419
views
graphsearch
dfs
+2
votes
1
answer
4
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
(
98.7k
points)

465
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
AAI Junior Exceutive(Information Technology)
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Follow @csegate
Gatecse
Recent questions tagged graphsearch
Recent Blog Comments
You are welcome.
Oh ok..got it now! Thank you Sir!!
@Arjun Thank You sir.. it is working now.
@Karan Now it should work for you as well as ...
@Sumaiya The red mark is normal  it is just for ...
37,056
questions
44,636
answers
127,000
comments
43,686
users