Algorithms (GATE Computer Science): Questions 39  45 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 exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 39
» 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 

Question number: 40
» Algorithms » Dynamic Programming
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: 41
» Algorithms » Searching
Question
Sequential searching is a also known as
Choices
Choice (4)  Response  

a.  External searching 

b.  searching 

c.  Linear search 

d.  Question does not provide sufficient data or is vague 

Question number: 42
» Algorithms » Greedy Approach
Question
Bellman –fordalgorithm is based on 
Choices
Choice (4)  Response  

a.  A Path 

b.  A singlesource shortest path 

c.  A spanning tree 

d.  All pair short algorithm 

Question number: 43
» Algorithms » Dynamic Programming
Question
Matrix chain multiplication problem solved by 
Choices
Choice (4)  Response  

a.  Back tracing 

b.  A divideand conquer approach 

c.  Dynamic programming 

d.  Question does not provide sufficient data or is vague 

Question number: 44
» Algorithms » Upper and Lower Bounds
Question
________ is a memorymanagement scheme that permits the physical address space of a process to be noncontiguous.
Choices
Choice (4)  Response  

a.  Process 

b.  Paging 

c.  Segment 

d.  Question does not provide sufficient data or is vague 

Question number: 45
» Algorithms » Greedy Approach
Question
Removing a cycle edge________ disconnect a graph.
Choices
Choice (4)  Response  

a.  Can 

b.  Cannot 

c.  May be cannot and can 

d.  None of the above 
