Algorithms-Greedy Approach (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1 - 7 of 9

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 » Greedy Approach

MCQ▾

Question

A tree on n nodes has ________edges.

Choices

Choice (4) Response

a.

N

b.

N-1

c.

n-2

d.

All of the above

Question number: 2

» Algorithms » Greedy Approach

MCQ▾

Question

An undirected graph is a ________if and only if there is a unique path between any pair of nodes.

Choices

Choice (4) Response

a.

Circle

b.

Graph

c.

Tree

d.

All of the above

Question number: 3

» Algorithms » Greedy Approach

MCQ▾

Question

Dynamic programming solutions are associated with

Choices

Choice (4) Response

a.

Brute force

b.

Space-time tradeoffs

c.

Intractability

d.

Probabilistic algorithms

Question number: 4

» Algorithms » Greedy Approach

MCQ▾

Question

Building a spanning tree by finding at each step the minimal edge adjacent to a partial sub tree is an Instance of ________ algorithms

Choices

Choice (4) Response

a.

brute-force

b.

Divide and conquer

c.

Greedy

d.

dynamic-programming

Question number: 5

» Algorithms » Greedy Approach

MCQ▾

Question

A solution to the knapsack problem that uses a table to store evolving estimates of solution values uses

Choices

Choice (4) Response

a.

The optimal-substructure property

b.

Hill climbing

c.

Dynamic programming

d.

A divide-and conquer approach

Question number: 6

» Algorithms » Greedy Approach

MCQ▾

Question

A minimal spanning tree can be found by

Choices

Choice (4) Response

a.

Subtracting edges greedily

b.

Adding edges greedily

c.

Recursive traversal

d.

Seeking the shortest path

Question number: 7

» Algorithms » Greedy Approach

MCQ▾

Question

The Kruskal, Prim, and Dijkstra algorithms have what approach to algorithm design in common?

Choices

Choice (4) Response

a.

Divide and conquer

b.

Greedy

c.

Brute force

d.

Dynamic programming

f Page
Sign In