AlgorithmsGreedy Approach (GATE 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 exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 1
» Algorithms » Greedy Approach
Question
A tree on n nodes has ________edges.
Choices
Choice (4)  Response  

a.  N 

b.  N1 

c.  n2 

d.  All of the above 

Question number: 2
» Algorithms » Greedy Approach
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
Question
Dynamic programming solutions are associated with
Choices
Choice (4)  Response  

a.  Brute force 

b.  Spacetime tradeoffs 

c.  Intractability 

d.  Probabilistic algorithms 

Question number: 4
» Algorithms » Greedy Approach
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.  bruteforce 

b.  Divide and conquer 

c.  Greedy 

d.  dynamicprogramming 

Question number: 5
» Algorithms » Greedy Approach
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 optimalsubstructure property 

b.  Hill climbing 

c.  Dynamic programming 

d.  A divideand conquer approach 

Question number: 6
» Algorithms » Greedy Approach
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
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 
