Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 73  79 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: 73
» Algorithms » Sorting
Question
What is an infix notation to postfix notation of following question ?
A * B+C/D
Choices
Choice (4)  Response  

a.  AB * CD/+ 

b.  AB* 

c.  AB*+CD/ 

d.  All of the above 

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

a.  0 (log2n) 

b.  0 (n) 

c.  0 (n^2) 

d.  None of the above 

Question number: 75
» Algorithms » Tree and Graph Traversals
Question
If each node in a tree has value greater than every value in its left sub tree and has value less than every in the its right sub tree, the tree is called
Choices
Choice (4)  Response  

a.  Full binary tree 

b.  Complete tree 

c.  Binary search tree 

d.  Thread tree 

Question number: 76
» Algorithms » Sorting
Question
Which principle is used to implement abstraction data type?
Choices
Choice (4)  Response  

a.  Dequeues 

b.  Queues 

c.  Stack 

d.  All of the above 

Question number: 77
» Algorithms » Searching
Question
When deleting an element is possible only at one end but operation of deletion is possible at both end of queues is a called
Choices
Choice (4)  Response  

a.  dequeues 

b.  Input restricted dequeues 

c.  Output restricted dequeues 

d.  None of the above 

Question number: 78
» Algorithms » Tree and Graph Traversals
Question
The number of edges in a regular graph of degree d and n vertices is
Choices
Choice (4)  Response  

a.  nd/2 

b.  Maximum of n, d 

c.  Nd 

d.  n + d 

Question number: 79
» Algorithms » Tree and Graph Traversals
Question
A given connected graph G is an Euler graph, if and only if all vertices of G are of
Choices
Choice (4)  Response  

a.  odd number of degree 

b.  Same degree 

c.  Even number of degree 

d.  None of the above 
