1

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 ____

2

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+1

-0.3

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the
running time of Depth First Search on G, when G is represented as an adjacency matrix?

3

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 ____

4

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 computingQuestions Asked from Graphs (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages