Algorithms-Dynamic Programming (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1 - 7 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: 1

» Algorithms » Dynamic Programming

MCQ▾

Question

The delay (complexity) of a carry propagation adder is

Choices

Choice (4) Response

a.

o (n)

b.

O (logn)

c.

O (nlogn)

d.

Question does not provide sufficient data or is vague

Question number: 2

» Algorithms » Dynamic Programming

MCQ▾

Question

Longest common subsequence problem solved by-

Choices

Choice (4) Response

a.

Divide and conquer

b.

Dynamic programming

c.

back-tracking

d.

None of the above

Question number: 3

» Algorithms » Dynamic Programming

MCQ▾

Question

Adding elements to a set according to weight and value solves the ________ problem

Choices

Choice (4) Response

a.

convex-hull

b.

shortest-path

c.

Knapsack

d.

minimal-spanning-tree

Question number: 4

» Algorithms » Dynamic Programming

MCQ▾

Question

What is a complexity of dynamic programming-based Floyd-Warshall algorithm?

Choices

Choice (4) Response

a.

O (| V| ^3)

b.

O (| V| ^4)

c.

O (| v| ^2)

d.

Question does not provide sufficient data or is vague

Question number: 5

» Algorithms » Dynamic Programming

MCQ▾

Question

What is the minimum number edge in a connected cycle graph on ________ vertices?

Choices

Choice (4) Response

a.

n

b.

n + 1

c.

n-1

d.

None of the above

Question number: 6

» Algorithms » Dynamic Programming

MCQ▾

Question

What is a maximum number of edges in a planar graph with 5 vertices?

Choices

Choice (4) Response

a.

6

b.

20

c.

18

d.

None of the above

Question number: 7

» Algorithms » Dynamic Programming

MCQ▾

Question

A common approach for handling address spaces larger than 32 bits is to use a ________.

Choices

Choice (4) Response

a.

Hashed page table.

b.

Base address

c.

Virtual memory

d.

Question does not provide sufficient data or is vague

f Page
Sign In