1

GATE CSE 2016 Set 2

Numerical

+1

-0

Breadth First Search $$(BFS)$$ is started on a binary tree beginning from the root vertex. There is a vertex $$t$$ at a distance four from the root. If t is the $$n$$-th vertex in this $$BFS$$ traversal, then the maximum possible value of $$n$$ is ___________.

Your input ____

2

GATE CSE 2016 Set 1

Numerical

+1

-0

Consider the following directed graph:

The number of different topological orderings of the vertices of the graph is ________________.

Your input ____

3

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

+1

-0.3

Consider the tree arcs of a BFS traversal from a source node

**W**in an unweighted, connected, undirected graph. The tree**T**formed by the tree arcs is a data structure for computing4

GATE CSE 2014 Set 3

Numerical

+1

-0

Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.

Your input ____

Questions Asked from Graphs (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude