Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 66  72 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: 66
» Algorithms » Sorting
Question
The complexity of Binary search algorithm is
Choices
Choice (4)  Response  

a.  O (n) 

b.  O (n log n) 

c.  O (log) 

d.  O (n2) 

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

a.  0 (2logn) 

b.  0 (n^3) 

c.  0 (nlogn) 

d.  None of the above 

Question number: 68
» Algorithms » Tree and Graph Traversals
Question
A directed graph G is ________ if and only if a DFS (Depth first search) of G produces no back edge.
Choices
Choice (4)  Response  

a.  Graph 

b.  Cyclic 

c.  Acyclic 

d.  All of the above 

Question number: 69
» Algorithms » Tree and Graph Traversals
Question
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
Choices
Choice (4)  Response  

a.  Path 

b.  Leaf 

c.  thread 

d.  Branch 

Question number: 70
» Algorithms » Tree and Graph Traversals
Question
A graph is set to be, if it can be draw in a planner show that the edge does not intersect to another edge is called
Choices
Choice (4)  Response  

a.  Regular 

b.  Nonplanner graph 

c.  Planner graph 

d.  All of the above 

Question number: 71
» Algorithms » Sorting
Question
Hashing collision resolution techniques are
Choices
Choice (4)  Response  

a.  Bucket addressing, Huffman coding 

b.  Chaining, Huffman coding 

c.  Huffman coding, linear hashing 

d.  Chaining, Bucket addressing 

Question number: 72
» Algorithms » Tree and Graph Traversals
Question
The complete graph KN has n^n2 different spanning tree is called which theorem?
Choices
Choice (4)  Response  

a.  Cyley’s theorem 

b.  Lagrange’s theorem 

c.  theoem 

d.  All of the above 
