# Algorithms-Tree and Graph Traversals (GATE Computer Science): Questions 8 - 14 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: 8

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The circuit statistical problem belongs to the class of________

### Choices

Choice (4) Response

a.

p

b.

q

c.

n - p

d.

None of the above

## Question number: 9

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

What is a pre order of this binary tree?

### Choices

Choice (4) Response

a.

ABDECFG

b.

DBEAFCG

c.

DEBFGCA

d.

All of the above

## Question number: 10

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

What is a post order of this binary tree?

### Choices

Choice (4) Response

a.

ABDECFG

b.

DEBFGCA

c.

DBEAFCG

d.

None of the above

## Question number: 11

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

What is the height of a red black tree with n internal nodes?

### Choices

Choice (4) Response

a.

2logn-1

b.

2log (n + 1)

c.

2logn

d.

Question does not provide sufficient data or is vague

## Question number: 12

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

How many draw a possible tree with three nodes?

### Choices

Choice (4) Response

a.

7

b.

3

c.

5

d.

None of the above

## Question number: 13

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

If every non-leaf node in a binary tree has non –empty left and right sub trees, the tree is called a

### Choices

Choice (4) Response

a.

B-tree

b.

binary tree

c.

Strictly binary tree

d.

All of the above

## Question number: 14

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

### Choices

Choice (4) Response

a.

T (n) =2T (n1) +1

b.

T (n) =2T (n1) / 1

c.

T (n) =2T (n1) - 2

d.

All of the above