# Algorithms (GATE Computer Science): Questions 87 - 93 of 98

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

» 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: 88

» 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: 89

» 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: 90

» 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: 91

» Algorithms » Worst and Average Case Analysis

MCQ▾

### Question

When consider n elements are to be sorted then the worst case time complexity of quick sort is-

### Choices

Choice (4) Response

a.

0 (1)

b.

0 (n)

c.

0 (n^2)

d.

Question does not provide sufficient data or is vague

## Question number: 92

» Algorithms » Worst and Average Case Analysis

MCQ▾

### Question

When consider n elements are to be sorted then the worst case time complexity of insertion sort is -

### Choices

Choice (4) Response

a.

0 (n^2)

b.

0 (nlog3n)

c.

0 (n)

d.

None of the above

## Question number: 93

» Algorithms » Sorting

MCQ▾

### Question

In fold and method of hashing we can

### Choices

Choice (4) Response

a.

only digits

b.

Fold only digits

c.

We can fold either from left or right or both sides

d.

All of the above

f Page