Algorithm Placement/ Interview Question 2019

Algorithm Placement/ Interview Question 2019

This is a set of multiple choice questions, provided entirely for your self-assessment, and is based on the most fundamental aspects of

Question 1.
Which of these is the worst case time complexity of Quick Sort - and cannot be expressed in lower order terms?
(a) O(n)
(b) O(n log n)
(c) O(n2)
(d) O(n3)
(e) O(log n)

Question 2.
Which of these is the worst case time complexity of MergeSort - and cannot be expressed in lower order terms?
(a) O(n)
(b) O(n log n)
(c) O(n2)
(d) O(n3)
(e) O(log n)

Question 3.
Which of these is the average case time complexity of MergeSort - and cannot be expressed in lower order terms?
(a) O(n)
(b) O(n log n)
(c) O(n2)
(d) O(n3)
(e) O(log n)

Question 4.
Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms?
(a) O(n)
(b) O(n log n)
(c) O(n2)
(d) O(n3)
(e) O(log n)

Question 5.
A heap is a particular kind of a binary search tree. This statement is:
(a) True
(b) False

Question 6.
The Dijkstra algorithm for finding the shortest paths involves the traversal of nodes in an order similar to (a) Breadth-first search
(b) Depth-first search
(c) Topological sort
(d) None of these

Question 7.
Which of the following statements is true? (The total number of push/pop/enqueue/deque calls made should not depend on the number of elements
(a) A queue can be created using two stack data-structures.
(b) A stack can be created using two queue data-structures. (c) Both the above statements (a and b) are true.
(d) Both the above statements (a and b) are false.

Question 8.
A union finds data-structure is commonly applied while implementing:
(a) A depth-first search traversal of a graph.
(b) A breadth-first search traversal of a graph.
(c) Computing the minimum spanning tree of a graph.
(d) Computing the all-pairs shortest path in a graph.

Question 9.
Which of these is the worst case time complexity for looking up a key in a binary search tree - and cannot be expressed in lower order terms
(a) O(n)
(b) O(n log n)
(c) O(n2)
(d) O(n3)
(e) O(log n)

Question 10.
The graph algorithm which forms an essential component of the ‘make’ or ‘ant build’ used by programmers and software developers is:
(a) Flow maximization algorithm (b) Shortest path algorithm
(c) Minimum spanning tree algorithm
(d) Bipartite matching
(e) Topological sort


More questions are coming..subscribe the page!! Thank you!

How was the Page please comment below in comment box.



Tags->
Algorithm Placement/ Interview Question 2019

data structure interview questions,

coding interview questions,

data structure and algorithm interview questions,

algorithm interview questions and answers pdf,

analysis and design of algorithms viva voce questions and answers,

design and analysis of algorithms objective questions with answers,

algorithm questions for beginners,

design and analysis of algorithms lab viva questions and answers,