Scribd
Upload
8 views4 pages

Objective Important Questions For MID 2

Important questions

Uploaded by

22tq1a6740
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views4 pages

Objective Important Questions For MID 2

Important questions

Uploaded by

22tq1a6740
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

● To which class does the Euler’s circuit problem belong____________

● Halting problem is an example for___________


● How many stages of procedure does a non-deterministic algorithm consist
of__________
● How many conditions have to be met if an NP- complete problem is polynomially
reducible________
● To which of the following class does a CNF-satisfiability problem belong________
● How many steps are required to prove that a decision problem is NP
complete_______
● The choice of polynomial class has led to the development of an extensive theory
called ____
● What is the worst case time complexity of dynamic programming solution of the
subset sum problem(sum=given subset sum)___________
● Backtracking algorithm is implemented by constructing a tree of choices called
as____
● What happens when the backtracking algorithm reaches a complete solution____

● If a problem can be solved by combining optimal solutions to non-overlapping


problems, the strategy is called _____________
●
● In dynamic programming, the technique of storing the previously calculated values is
called ___________
●
● Dijkstra’s Algorithm is the prime example for ___________

● Problems that can be solved in polynomial time are known as______________


●
● To which class does the Euler’s circuit problem belong_______________
●
● The Knapsack problem is an example of __________
●
● _________data structure is used for implementing a LIFO branch and bound
strategy
●
● Branch and bound is a __________technique

● In recursion, the condition for which the function will stop calling itself is
____________case
●
● Fractional knapsack problem is solved most efficiently by_________the following
algorithm

● Which of the following is/are property/properties of a dynamic programming


problem? ( )
a) Optimal substructure b) Overlapping subproblems c) Greedy approach
d) Both optimal substructure and overlapping subproblems
● If an optimal solution can be created for a problem by constructing optimal solutions
for its subproblems, the problem possesses ____________ property. ( )
a) Overlapping subproblems b) Optimal substructure c) Memoization d) Greedy

● If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.( )
a) Overlapping subproblems b) Optimal substructure c) Memoization d) Greedy

● Which of the following problems is NOT solved using dynamic programming? ( )


a) 0/1 knapsack problem b) Matrix chain multiplication problem c) Edit distance
problem
d) Fractional knapsack problem

● Which of the following problems should be solved using dynamic programming? (


)
a) Mergesort b) Binary search c) Longest common subsequence d) Quicksort

● Which of the following problems should be solved using dynamic programming? (


)
a) Mergesort b) Binary search c) Longest common subsequence d) Quicksort

● Which of the following algorithms is the best approach for solving Huffman codes? (
)
a) greedy algorithm b) exhaustive search c) divide and conquer algorithm
d) brute force algorithm

● Which of the following is false about Kruskal's algorithm? ( )


a) It constructs MST by selecting edges in increasing order of their weights
b) It is a greedy algorithm c) It uses union-find data structure d) It can accept cycles
in the MST
● The worst-case efficiency of solving a problem in polynomial time is? ( )
a) O(p(n)) b) O(p( n log n)) c) O(p(n2)) d) O(p(m log n))
● ________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms.( )
a) NP b) P c) Hard d) Complete
● Which of the following is false in the case of a spanning tree of a graph G?
( )
a) It is tree that spans G b) It is a subgraph of the G c) It includes every vertex of the
G
d) It can be either cyclic or acyclic

● Consider a complete graph G with 4 vertices. The graph G has ____ spanning
trees.( )
a) 15 b) 8 c) 16 d) 13

● The travelling salesman problem can be solved using _________ ( )


a) A spanning tree b) A minimum spanning tree c) Bellman – Ford algorithm
d) DFS traversal

● Which of the following is not the algorithm to find the minimum spanning tree of the
given graph?( )
a) Boruvka’s algorithm b) Prim’s algorithm c) Kruskal’s algorithm d) Bellman–Ford
algorithm

● Which of the following is false? ( )


a) The spanning trees do not have any cycles b) MST have n – 1 edges if the graph
has n edges
c) Edge e belonging to a cut of the graph if has the weight smaller than any other
edge in the same cut, then the edge e is present in all the MSTs of the graph
d) Removing one edge from the spanning tree will not make the graph disconnected

● Which of the following is true? ( )


a) Prim’s algorithm initialises with a vertex b) Prim’s algorithm initialises with an edge
c) Prim’s algorithm initialises with a vertex which has smallest edge d) Prim’s
algorithm initialises with a forest
● What is the weight of the minimum spanning tree using the Prim’s algorithm,starting from vertex a?(
)
a) 23 b) 28 c) 27 d) 11

● Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?( )
a) O(log V) b) O(V2) c) O(E2) d) O(V log E)

● Fractional knapsack problem is also known as __________( )


a) 0/1 knapsack problem b) Continuous knapsack problem c) Divisible knapsack problem
d) Non continuous knapsack problem

● Fractional knapsack problem is solved most efficiently by which of the following algorithm? ( )
a) Divide and conquer b) Dynamic programming c) Greedy algorithm d) Backtracking

You might also like