Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 94  98 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: 94
» Algorithms » Tree and Graph Traversals
Question
Who many chromatic number in following graph?
Choices
Choice (4)  Response  

a.  3 

b.  5 

c.  4 

d.  All of the above 

Question number: 95
» Algorithms » Dynamic Programming
Question
A record is related to a file, as a statement is related to a
Choices
Choice (4)  Response  

a.  program 

b.  procedure 

c.  data 

d.  Question does not provide sufficient data or is vague 

Question number: 96
» Algorithms » Analysis
Question
The concatenations of two lists is to be performed in o (1) time. Which of the following implementations of a list should be used?
Choices
Choice (4)  Response  

a.  Circular doubly linked list 

b.  Singly linked list 

c.  Doubly linked list 

d.  None of the above 

Question number: 97
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
NPcomplete and in P respectively
Choices
Choice (4)  Response  

a.  Undecidable and NPcomplete respectively 

b.  NP  complete 

c.  The problems 3SAT and 2SAT are 

d.  in P 

Question number: 98
» Algorithms » Dynamic Programming
Question
Dynamic programming uses optimal sub structure in a ________fashion.
Choices
Choice (4)  Response  

a.  Bottomup 

b.  topdown 

c.  down 

d.  Question does not provide sufficient data or is vague 
