# Algorithms-Tree and Graph Traversals (GATE Computer Science): Questions 15 - 20 of 34

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 15

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

If any undirected graph, the sum of degrees of all the nodes

### Choices

Choice (4) Response

a.

Need not be even

b.

Must be odd

c.

Is twice the number of edge?

d.

Question does not provide sufficient data or is vague

## Question number: 16

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

When converting binary tree into extended binary tree, all the original nodes in binary tree are

### Choices

Choice (4) Response

a.

internal nodes on extended tree

b.

external nodes on extended tree

c.

vanished on extended tree

d.

None of the above

## Question number: 17

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

Who many chromatic number in following graph?

### Choices

Choice (4) Response

a.

2

b.

3

c.

8

d.

All of the above

## Question number: 18

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A classical application of DFS that is decomposing a directed graph into its ________after decomposition the algorithm is run separately on each SCC.

### Choices

Choice (4) Response

a.

Stack

b.

Strongly connected components

c.

Queue

d.

Question does not provide sufficient data or is vague

## Question number: 19

» Algorithms » Tree and Graph Traversals

MCQ▾

Sparse matrix is

### Choices

Choice (4) Response

a.

Mostly with OS

b.

With more no of 1’s

c.

Non singular matrix

d.

All of the above

## Question number: 20

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The data structure required for breadth first traversal on a graph is

### Choices

Choice (4) Response

a.

Array

b.

Queue

c.

Stack

d.

Question does not provide sufficient data or is vague

f Page