HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 2 Experiments

Aim

Overview

Recap

Pretest

Topological Sort

Aim Concept Through DFS Quiz

Kahns Algorithm

Aim Concept Demo Practice Exercise Quiz

Analysis

Aim Time and Space Complexity Quiz

Posttest

Topological Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. Which of the following values should be non-zero in a graph ?

a: Number of Edges Explanation

Explanation

b: Number of Vertices Explanation

Explanation

c: Number of Cycles. Explanation

Explanation

d: All of the above. Explanation

Explanation

2. How many edges are there in a complete graph ( n = number of vertices) ?

a: n*(n+1)/2 Explanation

Explanation

b: n Explanation

Explanation

c: n*(n-1)/2 Explanation

Explanation

d: None of these Explanation

Explanation

3. What is the special feature of a Regular Graph ?

a: All the vertices have the same degree. Explanation

Explanation

b: There is an edge between each pair of vertices. Explanation

Explanation

c: It contains only one vertex with no edges. Explanation

Explanation

d: It contains at least one cycle. Explanation

Explanation

4. What is the maximum degree a node can have in a simple graph?
(n = number of nodes in graph)

a: n Explanation

Explanation

b: 2*n Explanation

Explanation

c: n+1 Explanation

Explanation

d: n-1 Explanation

Explanation

5. An adjacency matrix representation of a graph contains information of :

a: Nodes Explanation

Explanation

b: Edges Explanation

Explanation

c: Direction Explanation

Explanation

d: All of the above Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)