# GATE Computer Science: Questions 365 - 372 of 913

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: 365

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: 366

MCQ▾

### Question

The total number of spanning trees that can be drawn using five labeled vertices is

### Choices

Choice (4) Response

a.

64

b.

125

c.

36

d.

16

## Question number: 367

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: 368

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: 369

MCQ▾

### Question

A computer hard work on a – number system.

### Choices

Choice (4) Response

a.

b.

Binary

c.

Decimal

d.

Octal

## Question number: 370

MCQ▾

### Question

Which of the following is useful in implementation quick sort?

### Choices

Choice (4) Response

a.

Queue

b.

List

c.

Stack

d.

Question does not provide sufficient data or is vague

## Question number: 371

MCQ▾

### Question

Stack is useful for implementing

### Choices

Choice (4) Response

a.

Depth first search

b.

c.

d.

None of the above

## Question number: 372

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

f Page