# Algorithms-Tree and Graph Traversals (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 28 - 34 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: 28

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A simple graph in which there exists an edge between every pair of vertices is called

### Choices

Choice (4) Response

a.

planer graph

b.

Euler graph

c.

Complete graph

d.

All of the above

## Question number: 29

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

Two isomorphic graphs must have

### Choices

Choice (4) Response

a.

Equal number of vertices

b.

sum of degree both graph is same

c.

Same number of edges

d.

All a. , b. and c. are correct

## Question number: 30

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A graph G is called ________ if vertices V can be partition into two sub set V1 and V2.

### Choices

Choice (4) Response

a.

Planner graph

b.

Connected graph

c.

Bipartite graph

d.

All of the above

## Question number: 31

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A connected graph T without any cycles is called

### Choices

Choice (4) Response

a.

A tree graph

b.

Free tree

c.

A tree

d.

All a. , b. and c. are correct

## Question number: 32

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

Which of the following data structure is not linear data structure?

### Choices

Choice (4) Response

a.

list

b.

Arrays

c.

Tree

d.

All of the above

## Question number: 33

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

If in binary tree n > 1, then for any n = key B-tree T of height is h min degree t > 2 has height (h) is-

### Choices

Choice (4) Response

a.

h < logt (n + 1/6

b.

h < logt (n + 1/2)

c.

h < logt (2n + 1/2)

d.

None of the above

## Question number: 34

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

Who many chromatic number in following graph?

### Choices

Choice (4) Response

a.

3

b.

5

c.

4

d.

All of the above

f Page