Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 59  65 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: 59
» Algorithms » Notions of Space and Time Complexity
Question
The list of coded instructions is called 
Choices
Choice (4)  Response  

a.  Utility programs 

b.  Computer program 

c.  Algorithm 

d.  Question does not provide sufficient data or is vague 

Question number: 60
» Algorithms » Worst and Average Case Analysis
Question
Which of the following sorting procedure is the slowest?
Choices
Choice (4)  Response  

a.  Heap sort 

b.  Quick sort 

c.  Bubble sort 

d.  All of the above 

Question number: 61
» Algorithms » Tree and Graph Traversals
Question
Sparse matrix is
Choices
Choice (4)  Response  

a.  Mostly with OS 

b.  With more no of 1’s 

c.  Non singular matrix 

d.  All of the above 

Question number: 62
» Algorithms » Worst and Average Case Analysis
Question
When consider n elements are to be sorted then the worst case time complexity of bubble sort is
Choices
Choice (4)  Response  

a.  0 (n) 

b.  o (1) 

c.  0 (n^2) 

d.  Question does not provide sufficient data or is vague 

Question number: 63
» Algorithms » Upper and Lower Bounds
Question
The complexity of the average case of an algorithm is
Choices
Choice (4)  Response  

a.  Much more complicated to analyze than that of worst case 

b.  Simple to analyze than that of worst case 

c.  Sometimes more complicated and some other times simpler than that of worst case 

d.  All of the above 

Question number: 64
» Algorithms » Tree and Graph Traversals
Question
The data structure required for breadth first traversal on a graph is
Choices
Choice (4)  Response  

a.  Array 

b.  Queue 

c.  Stack 

d.  Question does not provide sufficient data or is vague 

Question number: 65
» Algorithms » Notions of Space and Time Complexity
Question
Which sorting algorithm also known as partition exchange sort
Choices
Choice (4)  Response  

a.  Selection sort 

b.  Quick sort 

c.  Merge sort 

d.  None of the above 
