AlgorithmsSorting (GATE Computer Science): Questions 1  8 of 8
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: 1
» Algorithms » Sorting
Question
The number of elements that can be sorted in θ (logn) time using heap sort is ________
Choices
Choice (4)  Response  

a.  Θ (1) 

b.  Θ (logn/log logn) 

c.  Θ (logn) 

d.  Question does not provide sufficient data or is vague 

Question number: 2
» 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: 3
» 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: 4
» 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: 5
» 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: 6
» Algorithms » Sorting
Question
Shell sort was developed by
Choices
Choice (4)  Response  

a.  Donald L 

b.  Ruskin Bond 

c.  Bill Gates 

d.  All of the above 

Question number: 7
» Algorithms » Sorting
Question
Hashing is
Choices
Choice (4)  Response  

a.  A statement as header files inclusion 

b.  Address finding in sequential files origination 

c.  Address finding in random files origination 

d.  None of the above 

Question number: 8
» Algorithms » Sorting
Question
In fold and method of hashing we can
Choices
Choice (4)  Response  

a.  only digits 

b.  Fold only digits 

c.  We can fold either from left or right or both sides 

d.  All of the above 
