Algorithm

Recursion in Data Structure and Algorithms MCQs

Q1. Recursion is similar to which of the following?.  A.  Switch Case.  B.  Loop.  C.  If-else.  D.  None of the mentioned.  Answer=  Loop Q2. In recursion, the condition for which the function will stop calling itself is ______…

Bipartite Graphs in Data Structure and Algorithms MCQs

Q1. There are four students in a class namely A, B, C and D. A tells that a triangle is a bipartite graph. B tells pentagon is a bipartite graph. C tells square is a bipartite graph. D tells heptagon is a bipartite graph. Who am…

Shortest Path in Data Structure and Algorithms MCQs

Q1. What is the time complexity of Dijikstra’s algorithm?.  A.  O(N).  B.  O(N3).  C.  O(N^2).  D.  O(logN).  Answer=  O(N^2) Q2. Dijkstra’s Algorithm cannot be applied on ______________.  A.  Directed and weighted graphs.  B.  …

Minimum Spanning Tree MCQs

Q1. Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees..  A. 15.  B. 8.  C. 16.  D. 13.  Answer= 16 Q2. The travelling salesman problem can be solved using _________.  A.  A spanning tree.  B.  A mi…

Graph Search in Data Structure and Algorithms MCQs

Q1. The Data structure used in standard implementation of Breadth First Search is?.  A.  Stack.  B.  Queue  C.  Linked List.  D.  None of the mentioned.  Answer=  Stack Q2. The Depth First Search traversal of a graph will result…

Computational Geometry in Data structure and Algorithms MCQs

Q1. What will be the slope of the line given by ax + by + c = 0?.  A.  -a/b.  B.  -b/a.  C.  -c/a.  D.  a/c.  Answer=  -a/b Q2. What will be the slope of the line given by 10x + 5y + 8=0?.  A. -5.  B. -2.  C. -1.25.  D. 5.  Answ…

Number Theory in Data Structure and Algorithms MCQs

Q1. If 4 is the GCD of 16 and 12, What is the GCD of 12 and 4?.  A. 12.  B. 6.  C. 4.  D. 2.  Answer= 4 Q2. Which of the following is not an application of Euclid’s algorithm?.  A.  Simplification of fractions.  B.  Performing d…

Load More
That is All