# Algorithms-Dynamic Programming (GATE Computer Science): Questions 8 - 13 of 13

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 » Dynamic Programming

MCQ▾

### Question

what is a complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edge if the edge are sorted is-

### Choices

Choice (4) Response

a.

0 (m + n)

b.

0 (m)

c.

0 (n)

d.

All of the above

## Question number: 9

» Algorithms » Dynamic Programming

MCQ▾

### Question

Matrix chain multiplication problem solved by -

### Choices

Choice (4) Response

a.

Back tracing

b.

A divide-and conquer approach

c.

Dynamic programming

d.

Question does not provide sufficient data or is vague

## Question number: 10

» Algorithms » Dynamic Programming

MCQ▾

### Question

Spanning tree is defines only for a ________

### Choices

Choice (4) Response

a.

The optimal substructure property

b.

A divide-and-conquer approach

c.

Tables

d.

Hill climbing

## Question number: 11

» Algorithms » Dynamic Programming

MCQ▾

### Question

Which of the following algorithm is used finding all pairs of shortest distance in the graph?

### Choices

Choice (4) Response

a.

algorithm

b.

Dijkstra algorithm

c.

Foly Warshall algorithm

d.

Question does not provide sufficient data or is vague

## Question number: 12

» Algorithms » Dynamic Programming

MCQ▾

### Question

A record is related to a file, as a statement is related to a

### Choices

Choice (4) Response

a.

program

b.

procedure

c.

data

d.

Question does not provide sufficient data or is vague

## Question number: 13

» Algorithms » Dynamic Programming

MCQ▾

### Question

Dynamic programming uses optimal sub structure in a ________fashion.

### Choices

Choice (4) Response

a.

Bottom-up

b.

top-down

c.

down

d.

Question does not provide sufficient data or is vague

f Page