Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 17  23 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: 17
» Algorithms » Dynamic Programming
Question
What is the minimum number edge in a connected cycle graph on ________ vertices?
Choices
Choice (4)  Response  

a.  n 

b.  n + 1 

c.  n1 

d.  None of the above 

Question number: 18
» 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: 19
» Algorithms » Tree and Graph Traversals
Question
What is a pre order of this binary tree?
Choices
Choice (4)  Response  

a.  ABDECFG 

b.  DEBFGCA 

c.  DBEAFCG 

d.  All of the above 

Question number: 20
» Algorithms » Asymptotic Notation
Question
For the function f (n) =7n + 5. Find out the order of this function in Big theta notation.
Choices
Choice (4)  Response  

a.  θ (n^2) 

b.  θ (n) 

c.  θ (n^3) 

d.  All of the above 

Question number: 21
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
Travelling salesperson problem solved by
Choices
Choice (4)  Response  

a.  Branch and bound method 

b.  Back tracking 

c.  Dynamic programming 

d.  All of the above 

Question number: 22
» Algorithms » Tree and Graph Traversals
Question
Backtracking can be used to solve 
Choices
Choice (4)  Response  

a.  Sum of subset problem 

b.  Queen problem 

c.  Knapsack problem 

d.  All a. , b. and c. are correct 

Question number: 23
» Algorithms » Tree and Graph Traversals
Question
How many perfect matching’s are there in a complete graph of 6 vertices
Choices
Choice (4)  Response  

a.  16 

b.  15 

c.  19 

d.  18 
