12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?

testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Seat No -
Total number of questions : 60

PWD10271_DESIGN AND ANALYSIS OF ALGORITHMS

Time : 1hr
Max Marks : 50
N.B

1) All questions are Multiple Choice Questions having single correct option.

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

7) Use only black/blue ball point pen to darken the appropriate circle.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 1. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}

A : O(N)

B : O(N*log(N))

C : O(N * Sqrt(N))

D : O(N*N)

Q.no 2. The best suited algorithm could be decided using proof technique

A : false

B : true

C:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 1/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 3. Algorithm must have atleast one external input

A : true

B : false

C:

D:

Q.no 4. Running time of algorithm varies with the size of the input called____

A : Growth of Function

B : Order of growth

C : Growth Rate

D : Growth of log function

Q.no 5. In Huffman coding, data in a tree always occur?

A : roots

B : leaves

C : left sub trees

D : right sub trees

Q.no 6. Which is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.

A : Debugging

B : Profiling

C : Conquer

D : Combining

Q.no 7. Which of the following problems should be solved using dynamic programming?

A : Mergesort

B : Binary search

C : Longest Common Subsequence

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 2/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Quicksort

Q.no 8. Express the formula (n-1)*(n-5) in terms of big Oh notation

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 9. Choose the correct option

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iterative function is always better and simpler to write than recursion

Q.no 10. What is order of resultant heap after merging two trees of order k in binomial heap?

A : 2*k

B : k+1

C : k*k

D : k + log k

Q.no 11. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 12. What approach is being followed in Floyd Warshall Algorithm?

A : Greedy Technique

B : Dynamic Programming

C : Linear Programming

D : Backtracking
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 3/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 13. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 14. 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

Q.no 15. Which of the following is true about Huffman Coding.

A : Huffman coding may become lossy in some cases

B : Huffman Codes may not be optimal lossless codes in some cases

C : In Huffman coding, no code is prefix of any other code.

D : Huffman Codes may not be optimal lossy codes in some cases

Q.no 16. The algorithm that do NOT have O(1) time complexity is____

A : Multiplying two numbers.

B : assigning some value to a variable

C : displaying some integer on console

D : Addition of n numbers

Q.no 17. What is tail recursion?

A : A recursive function that has two base cases

B : A function where the recursive functions leads to an infinite loop

C : A recursive function where the function doesn’t return anything and just prints the values

D : A function where the recursive call is the last thing executed by the function

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 4/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 18. Who created the Rabin Karp Algorithm?

A : Joseph Rabin and Michael Karp

B : Michael Rabin and Joseph Karp

C : Richard Karp and Michael Rabin

D : Michael Karp and Richard Rabin

Q.no 19. Recursion is similar to which of the following?

A : Switch Case

B : Loop

C : If else

D : if elif else

Q.no 20. Which of the following methods can be used to solve the longest common subsequence
problem?

A : Not Recursion

B : Dynamic Programming

C : Branch And Bound

D : Greedy Algorithm

Q.no 21. Which of the following are not in NP?

A : All problems in P

B : Boolean Satisfiability problems

C : Integer factorization problem

D : Halting problem

Q.no 22. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 5/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 23. What will be the position of 6, when a max heap is constructed on the input elements 6,
71, 46, 8, 13, 16, 14, 66, 31, 27?

A : 6 will be at the root

B : 6 will be at the last level

C : 6 will be at the second level

D : 6 can be anywhere in the heap

Q.no 24. Which of the following is/are property/properties of a dynamic programming problem?

A : Evolutionary Approach

B : Require More Time

C : Greedy Approach

D : Optimal Substructure And Overlapping Subproblems

Q.no 25. A strand of maximal length is called as ______________

A : Process

B : Work

C : Thread

D : Span

Q.no 26. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 27. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 6/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 28. Loop invariant is inert assertion and not useful in analysis of program.

A : true

B : false

C:

D:

Q.no 29. Which of these is false about recursion?

A : Recursive function can be replaced by a non-recursive function

B : Recursive functions usually take more memory space than non-recursive function

C : Recursive functions run faster than non-recursive function

D : Recursion makes programs easier to understand

Q.no 30. Which of the following problems is equivalent to the 0-1 Knapsack problem?

A : You are given a bag that can carry a maximum weight of W. You are given N items which have a
weight of {w1, w2, w3,…., wn} and a value of {v1, v2, v3,…., vn}. You can break the items into
smaller pieces. Choose the items in such a way that you get the maximum value

B : You are studying for an exam and you have to study N questions. The questions take {t1, t2, t3,….,
tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. You can study for a maximum of T hours.
You can either study a question or leave it. Choose the questions in such a way that your score is
maximized

C : You are given infinite coins of denominations {v1, v2, v3,….., vn} and a sum S. You have to find
the minimum number of coins required to get the sum S

D : You are given a suitcase that can carry a maximum weight of 15kg. You are given 4 items which
have a weight of {10, 20, 15,40} and a value of {1, 2, 3,4}. You can break the items into smaller
pieces. Choose the items in such a way that you get the maximum value

Q.no 31. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 32. The number of trees in a binomial heap with n nodes is

A : log n

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 7/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B:n

C : n log n

D : n/2

Q.no 33. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 34. The Knapsack problem where the objective function is to minimize the profit is______

A : Greedy

B : Dynamic Programming

C : Back Tracking

D : Branch & Bound

Q.no 35. Choose the correct steps required to prove that a problem is NP complete?

A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.

B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.

C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
question in polynomial time.

D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.

Q.no 36. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

A : P is infinite set

B : P is finite set

C:

D:
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 8/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 37. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 38. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : C, B ,A

D : B,A, C

Q.no 39. What are desirable characteristics of Algorithm with efficiency 1)Generality 2)
Availability 3) Simplicity

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 40. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

Q.no 41. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 9/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Both problems belong to NP complete set

Q.no 42. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 43. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 44. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 45. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 46. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 10/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : 20*30

C : 10*30

D : 10*20*30

Q.no 47. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 48. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 49. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 50. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 51. What is worst case in Rabin-Karp string matching algorithm.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 11/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 52. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 53. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 54. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 55. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 12/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 56. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 57. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 58. 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

Q.no 59. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 60. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 13/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 500

D : 440

Q.no 1. When an algorithm is written in the form of a specific programming language, it becomes
a _________

A : Pseudocode

B : Programme

C:

D:

Q.no 2. Which of the following algorithms has better time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 3. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 4. Genetic algorithms are

A : Adaptive Heuristic Search Algorithm

B : Binary search algorithm

C : Simulated Annealing

D : Adaptive Linear

Q.no 5. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?

A : NP

B:P

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 14/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Hard

D : Complete

Q.no 6. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 7. Steps of Divide and Conquer approach are______

A : Divide, Conquer And Combine

B : Combine, Conquer and Divide

C : Combine, Divide And Conquer

D : Divide, Combine And Conquer

Q.no 8. Two main measure of efficiency of an algorithm

A : processor and memory

B : time and space

C : date and space

D : date and capacity

Q.no 9. From the following which is not return optimal solution

A : Dynamic Programming

B : Branch And Bound

C : Backtracking

D : Greedy Method

Q.no 10. In a computational complexity theory, a problem with decision making is said to be NP-
complete when it is both in NP and NP-hard. What does NP mean?

A : Non Polynomial time

B : Non-deterministic Probabilistic

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 15/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Non-deterministic Polynomial time

D : Non Probabilistic time

Q.no 11. State whether True or False An algorithm is said to be correct if, for every input
instance, it halts with the correct output

A : true

B : false

C:

D:

Q.no 12. _____is the minimum number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 13. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra's shortest path algorithm

B : Prim's algorithm

C : Kruskal algorithm

D : Bellmen Ford Shortest path algorithm

Q.no 14. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 15. Which of the following is incorrect? Algorithms can be represented:

A : Pseudocode

B : Programme

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 16/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Grammar

D : flowchart

Q.no 16. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

Q.no 17. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’

A : NP problems

B : P problem

C : NP complete problem

D : NP hard problem

Q.no 18. In recursion, the condition for which the function will stop calling itself is

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 19. Two main measures for the efficiency of an algorithm are 1)time 2) space 3) lines of code

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 20. Which design strategy stops the execution when it finds the solution otherwise starts the
problem from top again?

A : Back Tracking

B : Branch and Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 17/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Divide And Conquer

D : Dynamic Programming

Q.no 21. Which of the following method is used for sorting in merge sort?

A : Merging

B : Partitioning

C : Selection

D : Exchanging

Q.no 22. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 23. Mathematical induction proves

A : Correctness of algorithm

B : Efficiency of algorithm

C : both

D:

Q.no 24. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 25. What is worst case in Naive Pattern matching algorithm.

A : The first character of the pattern is not present in text at all.

B : When all characters of the text and pattern are same.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 18/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : when only the last character is different.

D : Both B and C

Q.no 26. Which of the following problems is similar to that of a Hamiltonian path problem?

A : knapsack problem

B : closest pair problem

C : travelling salesman problem

D : assignment problem

Q.no 27. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 28. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 29. The speed up of a computation on P processors is defined as

A : T1 / T∞

B : T1 / Tp

C : Tp / T1

D : T∞/T1

Q.no 30. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 19/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : divide and conquer

Q.no 31. The time taken by nondeterministic sorting algorithm is ______

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 32. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

D : O(n-1)

Q.no 33. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 34. Consider the following function f:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
What is the asymptotic complexity in terms of n? (Pick the smallest correct answer)

A : O(nlog n)

B : O(n^2 )

C : O(n)

D : O(log n )
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 20/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 35. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection

D : Multiplication

Q.no 36. Running the program many times is sufficient to prove the correctness of program

A : true

B : false

C:

D:

Q.no 37. 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

Q.no 38. Proof by contradiction is also known as

A : inverse proof

B : indirect proof

C : reverse proof

D:

Q.no 39. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

B : proof by deduction

C : proof by contradiction

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 21/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 40. What is work?

A : Execution time of single thread

B : Average of all threads

C : Sum of the times taken by each thread

D : Sum of the times taken by child threads only

Q.no 41. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 42. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 43. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 44. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 22/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Is A Meta Heuristic Search Method

Q.no 45. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 46. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 47. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 48. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 23/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 49. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 50. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 51. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 52. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 53. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 24/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 54. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 55. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 56. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 57. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 58. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 25/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : m divided by P

D : P divided by m

Q.no 59. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 60. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 1. Which strategy is followed by QuickSort?

A : Greedy strategy

B : Brute Force technique

C : Dynamic programming

D : Divide and conquer

Q.no 2. Algorithm must produce one output

A : true

B : false

C:

D:

Q.no 3. If f(n) = ______, then there exists positive constants c1, c2, n0 such that 0 ≤ c1.g(n) ≤ f(n)
≤ c2.g(n), for all n ≥ n0

A : Θ(g(n))

B : O(g(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 26/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Ω(g(n))

D : little Ω(g(n))

Q.no 4. Dijkstra’s Algorithm cannot be applied on ………….

A : Directed and weighted graphs

B : Graphs having negative weight function

C : Unweighted graphs

D : Undirected and unweighted graphs

Q.no 5. Dijkstra’s Algorithm is used to solve ………. problems.

A : All pair shortest path

B : Single source shortest path

C : Network flow

D : Sorting

Q.no 6. waiting for the hardware advancements are always fruitful than finding the better
algorithm

A : true

B : false

C:

D:

Q.no 7. Which of the following is not characteristic of Algorithm

A : Definiteness

B : finiteness

C : scalability

D : effectiveness

Q.no 8. which of the following is not a proof technique

A : Contradiction

B : Approximation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 27/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Mathematical induction

D:

Q.no 9. In an amortized analysis, the time required to perform a sequence of data structure
operations is summed over all the operations performed. This statement is true or false.

A : true

B : false

C:

D:

Q.no 10. What is the time complexity of following code: int a = 0, i = N;

while (i > 0) {
a += i;
i /= 2;
}

A : O(n)

B : O(Logn)

C : O(n^2)

D : O(n^2Logn)

Q.no 11. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.

A : True

B : FALSE

C:

D:

Q.no 12. What is the average case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 13. In the absence of a exit condition in a recursive function, the following error is given by?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 28/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Compile time error

B : Run time error

C : Logical error

D : No error

Q.no 14. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.

A : true

B : false

C:

D:

Q.no 15. parallel algorithms that can run on a ____________ that permits multiple instructions to
execute concurrently

A : Uniprocessor

B : Serial Computer

C : Mainframe Computer

D : Multiprocessor computer

Q.no 16. The fundamental unit of neural network is

A : Brain

B : Nucleus

C : Neuron

D : Axon

Q.no 17. Two main measures for the efficiency of an algorithm are

A : Processor and memory

B : Complexity and capacity

C : Time and Space

D : Speed and Storage

Q.no 18. 0 1 knapsack is based on which method?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 29/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 19. What is the best case time complexity of binary search?

A : O(n)

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 20. In a binomial heap the root value is greater than left child and less than right child.

A : true

B : false

C:

D:

Q.no 21. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 22. Which of the following problems can’t be solved using recursion?

A : Factorial of a number

B : Nth fibonacci number

C : Length of a string

D : Problems without base case

Q.no 23. Consider the following three claims

1. (n + k)m = Θ(nm), where k and m are constants

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 30/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
Which of these claims are correct ?

A : 1 and 2

B : 1 and 3

C : 2 and 3

D : 1, 2, and 3

Q.no 24. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 25. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 26. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 27. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 31/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Aggregate method

B : Accounting method

C : Potential method

D : Both aggregate and potential method

Q.no 28. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 29. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?

A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible

B : Both are the same

C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming

D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible

Q.no 30. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

D : 1,3,7,4,8,5,9,10

Q.no 31. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 32/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 32. What is the basic principle in Rabin Karp algorithm?

A : Sorting

B : Hashing

C : Augmenting

D : Dynamic Programming

Q.no 33. Let X be a problem that belongs to the class NP. Then which one of the following is
TRUE?

A : There is no polynomial time algorithm for X.

B : If X can be solved deterministically in polynomial time, then P = NP.

C : If X is NP-hard, then it is NP-complete.

D : X may be undecidable.

Q.no 34. Time complexity of fractional knapsack problem is

A : O(n log n)

B : O(n)

C : O(1)

D : O(nW)

Q.no 35. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 36. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 33/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 37. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….

A : logarithmic and linear time constant respectively

B : constant and linear time respectively

C : constant and quadratic time respectively

D : constant and logarithmic time respectively

Q.no 38. Problems that can be solved in polynomial time are known as ……… problems.

A : Intractable

B : Tractable

C : Undecidable

D : Decidable

Q.no 39. loop termination condition along with what makes loop correct

A : loop condition

B : loop increment variable

C : loop invariant

D : none of these

Q.no 40. 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

Q.no 41. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 34/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 42. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 43. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 44. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 45. 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

Q.no 46. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 35/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : B1,B2,B3

Q.no 47. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 48. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 49. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 50. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 51. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 36/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 52. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 53. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 54. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 55. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 56. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 37/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 57. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 58. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 59. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 60. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 38/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 1. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 2. The choice of polynomial class has led to the development of an extensive theory called
________

A : computational complexity

B : time complexity

C : problem complexity

D : decision complexity

Q.no 3. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ f(n) ≤ c.g(n), for all
n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

D : Little o(g(n))

Q.no 4. The space factor when determining the efficiency of algorithm is measured by

A : Counting the maximum memory needed by the algorithm

B : Counting the minimum memory needed by the algorithm

C : Counting the average memory needed by the algorithm

D : Counting the maximum disk space needed by the algorithm

Q.no 5. Tractable Problem is a problem that is not solvable by a polynomial-time algorithm

A : true

B : false

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 39/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 6. Hamiltonian path problem is _________

A : NP problem

B : N class problem

C : P class problem

D : NP complete problem

Q.no 7. What does the algorithmic analysis count?

A : The number of arithmetic and the operations that are required to run the program

B : The number of lines required by the program

C : The number of seconds required by the program to execute

D : The size of the input

Q.no 8. Which data structure is used for implementing a LIFO branch and bound strategy?

A : Stack

B : Queue

C : Array

D : Linked List

Q.no 9. Problems that cannot be solved by any algorithm are called?

A : tractable problems

B : intractable problems

C : undecidable problems

D : decidable problems

Q.no 10. q29.jpeg

A : 111

B : 101

C : 110

D : 11

Q.no 11. What is best case complexity of selection sort

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 40/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A:n

B : n^2

C : nlogn

D:

Q.no 12. Fractional knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 13. Which of the following problems is NOT NP complete?

A : Hamiltonian circuit

B : Bin packing

C : Partition problem

D : Halting problem

Q.no 14. Matrix chain multiplication problem is solved by which approach?

A : Divide And Conquer

B : Dynamic Programming

C : Backtracking

D : Greedy Approach

Q.no 15. Algorithm can be represented as

A : Pseudocode

B : Flowchart

C : None of the above

D : both 1and 2

Q.no 16. What term is used to describe O(n) algorithm?

A : Constant
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 41/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Non polynomial deterministic

C : logarithmic

D : linear

Q.no 17. The goal of structured programming is to

A : have well indented programs

B : be able to infer the flow of control from the compiled code

C : be able to infer the flow of control from the program text

D : avoid the use of GOTO statements

Q.no 18. The Data structure used in standard implementation of Breadth First search
is___________

A : Stack

B : Queue

C : Linked List

D : Tree

Q.no 19. What is a splay operation?

A : moving parent node to down of child

B : moving a node to root

C : ) moving root to leaf

D : removing leaf node

Q.no 20. Problems that can be solved in polynomial time are known as?

A : intractable

B : tractable

C : decision

D : complete

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 42/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 21.

A : 10

B:1

C : 10 9 8 ……1 0

D : 10 9 8 ……1

Q.no 22. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 23. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.

A : Minimum & Maximum problem

B : Knapsack problem

C : Selection problem

D : Merge sort

Q.no 24. The Knapsack problem where the objective function is to minimize the profit is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 43/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Greedy

B : Dynamic 0 / 1

C : Back tracking

D : Branch & Bound 0/1

Q.no 25. The first step of the genetic algorithm is

A : Applying Selection Of Letter

B : Applying Crossover Operator

C : Applying Nutrition Operator

D : Generated Initial Population

Q.no 26. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 27. which of the following is not a characteristics of good algorithm

A : precise

B : Ambigous

C : finite number of steps

D : logical flow of control

Q.no 28. In the principle of mathematical induction, which of the following steps is mandatory?

A : induction hypothesis

B : induction reference

C : induction set assumption

D:

Q.no 29. which is not the important aspect of Loop

A : Initial condition
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 44/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : nested loop

C : invariant relation

D : termination

Q.no 30. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

Q.no 31. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : A, C, B

D : B,A, C

Q.no 32. subjective decision is important aspect of algorithm

A : true

B : false

C:

D:

Q.no 33. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false

C:

D:

Q.no 34. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using

A : Central tendency

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 45/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Differential equation

C : Order of execution

D : Order of Storage

Q.no 35. What is base case in the given code?

A : Fn(10)

B : return

C : if (n==0)

D : Fn(n-1)

Q.no 36. Which of the following method is used for sorting in merge sort?

A : Merging

B : Partitioning

C : Selection

D : Exchanging

Q.no 37. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

B : proof by deduction

C : proof by contradiction

D:

Q.no 38. If T= abcabaabc & P= abaa then what will be the value of s?

A:4

B:2

C:3

D:1

Q.no 39. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions

A : Dynamic Programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 46/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Backtracking

C : Branch And Bound

D : Greedy Method

Q.no 40. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 41. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 42. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 43. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 44. Identify incorrect statement

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 47/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 45. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 46. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 47. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 48. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 48/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : 11080

Q.no 49. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 50. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 51. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 52. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 53. Genetic Algorithm is a part of

A : Not Evolutionary Computing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 49/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 54. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 55. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 56. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 57. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 58. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 50/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 59. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 60. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 1. What’s happen if base condition is not defined in recursion ?

A : stack underflow

B : stack overflow

C : both

D:

Q.no 2. In artificial Neural Network interconnected processing elements are called

A : Nodes Or Neurons

B : Weights

C : Axons

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 51/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Soma

Q.no 3. Master theorem applies to recurrences of the form (a=1 and b>1) are two constants.
Select one:

A : T(N)=A.T(N/B)+F(N)

B : T(n)=n.T(n/2)+b.f(n)

C : T(N)=A.T(N-1)+B

D : T(N)=N.T(N-3)+B

Q.no 4. Pseudocode is______________

A : Language dependent

B : Language independent

C:

D:

Q.no 5. Example of O(n) algorithms is______________

A : Multiplying two numbers.

B : linear search

C : assigning a value to a variable

D : displaying some integer on console

Q.no 6. What is the type of the algorithm used in solving the 8 Queens problem?

A : Backtracking

B : Dynamic Programming

C : Branch And Bound

D : Divide And Conquer

Q.no 7. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 52/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Time complexity

Q.no 8. Operations in the neural networks can perform what kind of operations?

A : Not In Serial

B : Not In Parallel

C : Serial Or Parallel

D : Partial

Q.no 9. Recursive function must have

A : switch -case

B : exit condition

C : loop

D:

Q.no 10. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 11. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra’s shortest path algorithm

B : Prim’s algorithm

C : Huffman Coding

D : Bellmen Ford Shortest path algorithm

Q.no 12. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ c.g(n) ≤ f(n), for
all n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 53/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : little Ω(g(n))

Q.no 13. If a problem X is in NP and a polynomial time algorithm for X could also be used to
solve problem Y in polynomial time, then Y is also in NP

A : true

B : false

C:

D:

Q.no 14. Which of the following statements is true?

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 15. What is adaline in neural networks?

A : Adaptive Linear Element

B : Automatic Linear Element

C : Adaptive Line Element

D : Adaptive Nonlinear Element

Q.no 16. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 17. Which of the following is the most commonly used data structure for implementing
Dijkstra’s Algorithm?

A : Max priority queue

B : Stack

C : Circular queue

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 54/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Min priority queue

Q.no 18. Express the formula (n-2)*(n-4) in terms of Theta Ɵ Notation

A : Ɵ(n^2)

B : Ɵ(8)

C : Ɵ(log n)

D : Ɵ(n)

Q.no 19. The time factor when determining the efficiency of algorithm is measured by

A : Counting microseconds

B : Counting the number of key operations

C : Counting the kilobytes of algorithm

D:

Q.no 20. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.

A : A1

B : A2

C : A3

D : A4

Q.no 21. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 22. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 55/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 23. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

Q.no 24. An algorithm that always runs in polynomial time but possibly returns erroneous
answers is called a …………

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 25. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 26. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

B : Bottom Up Fashion

C : In Any Way

D : Random

Q.no 27. Which of the following is false in the case of a spanning tree of a graph G?

A : It is tree that spans G

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 56/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : It is a subgraph of the G

C : It includes every vertex of the G

D : It can be either cyclic or acyclic

Q.no 28. Which data structure is most suitable for implementing best first branch and bound
strategy?

A : Stack

B : Queue

C : Priority Queue

D : Linked List

Q.no 29. What is the basic principle in Rabin Karp algorithm?

A : Sorting

B : Hashing

C : Augmenting

D : Dynamic Programming

Q.no 30. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?

A : 160

B : 200

C : 170

D : 90

Q.no 31. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 32. What is base case in the given code?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 57/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : F1()

B : return

C : both

D : neither 1 nor 2

Q.no 33. What will be the position of 6, when a max heap is constructed on the input elements 6,
71, 46, 8, 13, 16, 14, 66, 31, 27?

A : 6 will be at the root

B : 6 will be at the last level

C : 6 will be at the second level

D : 6 can be anywhere in the heap

Q.no 34. When a thread u spawns a new thread v, then (u,v) is called a

A : Simple edge

B : Return edge

C : Continuation edge

D : spawn edge

Q.no 35. Dynamic programming is used to find:

A : All Optimal Solution Is Generated

B : One Solution Is Generated

C : No Optimal Solution Is Generated

D : Partial Solution Is Generated

Q.no 36. What is work?

A : Execution time of single thread

B : Average of all threads

C : Sum of the times taken by each thread

D : Sum of the times taken by child threads only

Q.no 37. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 58/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : P is infinite set

B : P is finite set

C:

D:

Q.no 38. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1

B:2

C:3

D:4

Q.no 39. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?

A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible

B : Both are the same

C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming

D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible

Q.no 40. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 41. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 59/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 42. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 43. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 44. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 45. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 46. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 60/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Minimize Functions

Q.no 47. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 48. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 49. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 50. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 51. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 61/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : O(nW)

Q.no 52. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 53. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 54. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 55. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 56. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 62/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : B1,B2,B3

Q.no 57. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 58. 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

Q.no 59. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 60. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 1. Which of the following algorithms has worst time complexity?

A : insertion sort

B : binary search

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 63/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : linear search

D : merge sort

Q.no 2. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 3. Which Programming is based on stepwise refinement process.

A : Structural

B : C programming

C : Procedural

D : Fine

Q.no 4. One can have __________, where each processor can directly access any location of
memory

A : Shared Memory

B : Cache Memory

C : Distributed Memory

D : Private Memory

Q.no 5. Heap can be used as ……………….

A : Priority queue

B : Stack

C : A decreasing order array

D : Normal Array

Q.no 6. The complexity of Binary search algorithm is___

A : O(n)

B : O(log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 64/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O( n^2)

D : O(n log n)

Q.no 7. Matrix chain multiplication problem is solved by which approach?

A : Divide And Conquer

B : Dynamic Programming

C : Backtracking

D : Greedy Approach

Q.no 8. Which algorithm design strategy is followed by Dijkstra’s Algorithm?

A : Greedy strategy

B : Branch and bound

C : Backtracking

D : Dynamic programming

Q.no 9. If the children of the root,from left to right, are the roots of Bk−1, Bk−2, . . . , B1, B0,
then root has degree .........

A : K-1

B:K

C : K+1

D : K+2

Q.no 10. In a max-heap, element with the greatest key is always in the which node?

A : Leaf node

B : First node of left sub tree

C : Root node

D : First node of right sub tree

Q.no 11. In recursion, the condition for which the function will stop calling itself is

A : Best case

B : Worst case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 65/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Base case

D : There is no such condition

Q.no 12. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 13. For the improvement of efficiency of quick sort the pivot can be____

A : the first element

B : the middle element

C : the last element

D : any random element

Q.no 14. Branch and bound is a __________

A : Problem Solving Technique

B : Data Structure

C : Sorting Algorithm

D : Type Of Tree

Q.no 15. goto statement is?

A : Used to jump the control of program.

B : Used for iteration

C : same as switch statement

D : Not Used for iteration

Q.no 16. The best suited algorithm could be decided using proof technique

A : false

B : true

C:
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 66/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 17. The goal of structured programming is to

A : have well indented programs

B : be able to infer the flow of control from the compiled code

C : be able to infer the flow of control from the program text

D : avoid the use of GOTO statements

Q.no 18. Keywords________indicates that iteration of the loop may run concurrently.

A : Parallel loop

B : Thread

C : Parallel for

D : Multithreading

Q.no 19. In recursion, the condition for which the function will stop calling itself is?

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 20. Uniprocessor executes____instruction at a time

A : Many

B : Two

C : One

D : Three

Q.no 21. Consider the following function f:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 67/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

}
What is the asymptotic complexity in terms of n? (Pick the smallest correct answer)

A : O(nlog n)

B : O(n^2 )

C : O(n)

D : O(log n )

Q.no 22. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem

A : only I

B : only II

C : both I and II

D : neither I nor II

Q.no 23. The Knapsack problem where the objective function is to minimize the profit is______

A : Greedy

B : Dynamic Programming

C : Back Tracking

D : Branch & Bound

Q.no 24. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

A : O(n)

B : O(nLogn)

C : O(n^2)

D : O(n^2Logn)

Q.no 25. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 68/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 26. Parallel loops are like an ordinary_______________except that the iterations of the loop
can execute concurrently.

A : While loop

B : For Loop

C : Do while loop

D : If statement

Q.no 27. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

Q.no 28. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 29. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 69/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 30. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

Q.no 31. Choose the correct steps to prove if the 3 SAT CNF problem is NP-Complete. I-- SAT
problem is in NP II--3 SAT CNF problem is in NP III--Prove that SAT ≤ 3 SAT CNF Problem in
polynomial time IV---Prove that 3 SAT CNF problem ≤ SAT Problem in polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 32. Generally greedy algorithms are are in nature of

A : Iterative

B : Recursive

C : Both A and B

D : Neither A Nor B

Q.no 33. The parallelism of a multithreaded computation is given by

A : T1 / Tp

B : T1 / T∞

C : T∞/T1

D : Tp / T1

Q.no 34. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 70/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : O(n-1)

Q.no 35. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 36. Genetic algorithm is

A : A Intelligent Simple Specified Search Technique

B : Used To Solve Non Optimization Problem

C : Is A Part Of Evolutionary Computing

D : Simulated Annealing

Q.no 37. Which of the following statements about loop invariants is false?

A : Loop invariants are used to show that algorithms produce the correct results.

B : A loop invariant is the opposite, that is the negation, of the condition of the loop.

C : To prove that a statement is a loop invariant, we use mathematical induction.

D : Loop invariants remain true each time a loop is executed.

Q.no 38. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?

A : Aggregate method

B : Accounting method

C : Potential method

D : Both aggregate and potential method

Q.no 39. The term ________ refers to all state space search methods in which all children of the –
nodes are generated before any other live node can become the E-node.

A : Backtacking

B : Depth First Search

C : Branch And Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 71/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Breadth First Search

Q.no 40. A problem in NP is NP-complete if

A : It can be reduced to the 3-SAT problem in polynomial time

B : The 3-SAT problem can be reduced to it in polynomial time

C : It can be reduced to any other problem in NP in polynomial time

D : some problem in NP can be reduced to it in polynomial time

Q.no 41. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 42. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 43. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 44. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 72/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : 420

C : 500

D : 440

Q.no 45. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 46. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 47. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 48. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 73/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 49. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 50. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 51. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 52. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 53. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 74/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 54. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 55. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 56. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 57. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 58. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 75/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 59. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 60. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 1. O(2^n) means computing time is ____

A : Linear

B : polynomial

C : quadratic

D : exponential

Q.no 2. Which data structure is used for implementing a FIFO branch and bound strategy?

A : Stack

B : Queue

C : Array

D : Linked List

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 76/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 3. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 4. If a problem X is in NP and a polynomial time algorithm for X could also be used to solve
problem Y in polynomial time, then Y is also in NP

A : true

B : false

C:

D:

Q.no 5. Dijkstra algorithm, which solves the single-source shortest--paths problem, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 6. Which of the following algorithms is the best approach for solving Huffman codes?

A : Exhaustive Search

B : Greedy Algorithm

C : Brute Force Algorithm

D : Divide And Conquer Algorithm

Q.no 7. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 77/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 8. Which design strategy stops the execution when it finds the solution otherwise starts the
problem from top again?

A : Back Tracking

B : Branch and Bound

C : Divide And Conquer

D : Dynamic Programming

Q.no 9. which of the following is not a proof technique

A : Contradiction

B : Approximation

C : Mathematical induction

D:

Q.no 10. If t1 (n) = O(f(n)), t2 (n)= O(g(n)). Then t1 (n).t2 (n)=_____

A : O(f(n))

B : O(g(n))

C : O(f(n)g(n))

D : O(f(n)+ g(n))

Q.no 11. 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

Q.no 12. In an amortized analysis, the time required to perform a sequence of data structure
operations is summed over all the operations performed. This statement is true or false.

A : true

B : false

C:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 78/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 13. Halting problem is an example for?

A : decidable problem

B : undecidable problem

C : complete problem

D : trackable problem

Q.no 14. Recursion is a method in which the solution of a problem depends on?

A : Larger instances of different problems

B : Larger instances of the same problem

C : Smaller instances of the same problem

D : Smaller instances of different problems

Q.no 15. Which of the following is true about Huffman Coding.

A : Huffman coding may become lossy in some cases

B : Huffman Codes may not be optimal lossless codes in some cases

C : In Huffman coding, no code is prefix of any other code.

D : Huffman Codes may not be optimal lossy codes in some cases

Q.no 16. What is best case complexity of Insertion sort

A:n

B : n^2

C : nlogn

D:

Q.no 17. Alorithm should have finite number of steps

A : true

B : false

C:

D:
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 79/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 18. Which of the following algorithms has better time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 19. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 20. def f():

int a[n][n]
// Finding sum of elements of a matrix that are above or on the diagonal.
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
Time Complexity of this program:

A : O(n)

B : O(nlogn)

C : O(n^2)

D : O(n^3)

Q.no 21. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false

C:

D:

Q.no 22. Which data structure has a better amortized running time than others?

A : Queue

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 80/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Stack

C : Priority Queue

D : List

Q.no 23. Choose the correct steps required to prove that a problem is NP complete?

A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.

B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.

C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
question in polynomial time.

D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.

Q.no 24. The type of encoding where no character code is the prefix of another character code is
called?

A : optimal encoding

B : prefix encoding

C : Fequency encoding

D : Trie encoding

Q.no 25. loop termination condition along with what makes loop correct

A : loop condition

B : loop increment variable

C : loop invariant

D : none of these

Q.no 26. Which of the following branch and bound strategy leads to depth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 81/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 27. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 28. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 29. The first step of the genetic algorithm is

A : Applying Selection Of Letter

B : Applying Crossover Operator

C : Applying Nutrition Operator

D : Generated Initial Population

Q.no 30. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 31. Power saving is an important job in embedded systm and sensor network.

A : true

B : false

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 82/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 32. Which of the following are not in NP?

A : All problems in P

B : Boolean Satisfiability problems

C : Integer factorization problem

D : Halting problem

Q.no 33. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 34. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 35. Which of the following problems is similar to that of a Hamiltonian path problem?

A : knapsack problem

B : closest pair problem

C : travelling salesman problem

D : assignment problem

Q.no 36. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 83/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 37. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 38. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 39. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 40. Which one of the following is true about Binary search?

A : the best-case occurs when the target item is in the beginning of the search list

B : the best-case occurs when the target is at the end of the search list

C : the worst-case is when the target item is not in the search list

D : the worst-case is when the target is found in the middle of the search list

Q.no 41. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 84/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:m

D : m+1

Q.no 42. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 43. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 44. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 45. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 46. algorithms performance is characterized by

A : size of a computation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 85/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : computing resources required

C : actual time required

D : actual memory required

Q.no 47. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 48. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 49. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 50. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 51. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 86/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 52. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 53. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 54. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 55. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 87/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 56. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 57. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 58. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 59. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 60. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 88/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : built in function

D:

Q.no 1. O(n^3) means computing time is ____

A : Linear

B : polynomial

C : quadratic

D : exponential

Q.no 2. What is the type of the algorithm used in solving the 8 Queens problem?

A : Backtracking

B : Dynamic Programming

C : Branch And Bound

D : Divide And Conquer

Q.no 3. The best data structure to check whether an arithmetic expression has balanced
parentheses is a

A : queue

B : stack

C : tree

D : list

Q.no 4. Choose the correct option

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iterative function is always better and simpler to write than recursion

Q.no 5. Which of the following is incorrect? Algorithms can be represented:

A : Pseudocode

B : Programme

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 89/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Grammar

D : flowchart

Q.no 6. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 7. Which strategy is followed by QuickSort?

A : Greedy strategy

B : Brute Force technique

C : Dynamic programming

D : Divide and conquer

Q.no 8. The problem of finding a path in a graph that visits every vertex exactly once is called?

A : Hamiltonian cycle problem

B : Hamiltonian path problem

C : Subset sum problem

D : Turnpike reconstruction problem

Q.no 9. What is best case complexity of selection sort

A:n

B : n^2

C : nlogn

D:

Q.no 10. The choice of polynomial class has led to the development of an extensive theory called
………

A : time complexity

B : space complexity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 90/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : computational complexity

D : problem complexity

Q.no 11. What is tail recursion?

A : A recursive function that has two base cases

B : A function where the recursive functions leads to an infinite loop

C : A recursive function where the function doesn’t return anything and just prints the values

D : A function where the recursive call is the last thing executed by the function

Q.no 12. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 13. Which Data Structure is used to perform Recursion?

A : Array

B : queue

C : stack

D : linked list

Q.no 14. What is the best case time complexity of binary search?

A : O(n)

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 15. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 91/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 16. Which of the following problems is NOT NP complete?

A : Hamiltonian circuit

B : Bin packing

C : Partition problem

D : Halting problem

Q.no 17. _____is the maximum number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 18. Which of the following case does not exist in complexity theory?

A : Best case

B : Average case

C : Null case

D : Worst case

Q.no 19. What is flowchart ?

A : Representation of memory usage in algorithm

B : Representation of Time required to execute algorithm

C : visual representaion of algorithm

D:

Q.no 20. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

A : true

B : false

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 92/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 21. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 22. What is the basic principle in Rabin Karp algorithm?

A : Sorting

B : Hashing

C : Augmenting

D : Dynamic Programming

Q.no 23. What is the purpose of using randomized quick sort over standard quick sort?

A : To reduce worst case space complexity

B : To reduce worst case time complexity

C : To improve average case time complexity

D : To improve accuracy

Q.no 24. A strand of maximal length is called as ______________

A : Process

B : Work

C : Thread

D : Span

Q.no 25. What is worst case in Naive Pattern matching algorithm.

A : The first character of the pattern is not present in text at all.

B : When all characters of the text and pattern are same.

C : when only the last character is different.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 93/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Both B and C

Q.no 26. Consider the following function f:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
What is the asymptotic complexity in terms of n? (Pick the smallest correct answer)

A : O(nlog n)

B : O(n^2 )

C : O(n)

D : O(log n )

Q.no 27. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

Q.no 28. Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of

knapsack=20. Find the
maximum value output assuming items to be divisible.

A : 60

B : 80

C : 100

D : 40

Q.no 29. 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

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 94/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : It can be either cyclic or acyclic

Q.no 30. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 31. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

Q.no 32. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….

A : logarithmic and linear time constant respectively

B : constant and linear time respectively

C : constant and quadratic time respectively

D : constant and logarithmic time respectively

Q.no 33. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex
Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 34. In dynamic programming, the technique of storing the previously calculated values is
called ___________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 95/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Saving Value Property

B : Storing Value Property

C : Memoization

D : Mapping

Q.no 35. Which of these is false about recursion?

A : Recursive function can be replaced by a non-recursive function

B : Recursive functions usually take more memory space than non-recursive function

C : Recursive functions run faster than non-recursive function

D : Recursion makes programs easier to understand

Q.no 36. which of the following is not basic control structure

A : the process

B : the decision

C : the loop

D : the sequential

Q.no 37. Time taken in decreasing the node value in a binomial heap is

A : O(n)

B : O(1)

C : O(log n)

D : O(n log n)

Q.no 38. The time taken by nondeterministic sorting algorithm is ______

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 39. Loop invariant is inert assertion and not useful in analysis of program.

A : true
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 96/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 40. Which of the following problems can’t be solved using recursion?

A : Factorial of a number

B : Nth fibonacci number

C : Length of a string

D : Problems without base case

Q.no 41. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 42. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 43. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 97/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O( n)

D : O(log n)

Q.no 44. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 45. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 46. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 47. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 48. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 98/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 49. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 50. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 51. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 52. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 99/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 53. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 54. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 55. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 56. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 57. If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.

A : Overlapping Subproblems

B : Optimal Substructure

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 100/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Memoization

D : Greedy

Q.no 58. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 59. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 60. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 1. If a problem X is in NP and a polynomial time algorithm for X could also be used to solve
problem Y in polynomial time, then Y is also in NP

A : true

B : false

C:

D:

Q.no 2. Which of the following is not characteristic of Algorithm

A : Definiteness

B : finiteness

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 101/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : scalability

D : effectiveness

Q.no 3. Which is a condition about the relationship between the variables of our program which
is definitely true immediately before and immediately after each iteration of the loop?

A : For condition

B : Loop invariant condition

C : Both a and b

D : If condition

Q.no 4. In Huffman coding, data in a tree is always present at?

A : Roots

B : Leafs

C : Left Sub Trees

D : Right Sub Trees

Q.no 5. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’

A : NP problems

B : P problem

C : NP complete problem

D : NP hard problem

Q.no 6. Running time of algorithm varies with the size of the input called____

A : Growth of Function

B : Order of growth

C : Growth Rate

D : Growth of log function

Q.no 7. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.

A : A1

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 102/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : A2

C : A3

D : A4

Q.no 8. Which of the following problems should be solved using dynamic programming?

A : Mergesort

B : Binary search

C : Longest Common Subsequence

D : Quicksort

Q.no 9. Fill in the blank. The notion of correctness for approximation algorithms is
…………...straightforward
than it is for exact algorithms

A : More

B : Less

C:

D:

Q.no 10. What is a splay operation?

A : moving parent node to down of child

B : moving a node to root

C : ) moving root to leaf

D : removing leaf node

Q.no 11. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra's shortest path algorithm

B : Prim's algorithm

C : Kruskal algorithm

D : Bellmen Ford Shortest path algorithm

Q.no 12. What is the time complexity of Dijikstra’s algorithm?

A : O(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 103/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(n^3)

C : O(n^2)

D : O(log n)

Q.no 13. waiting for the hardware advancements are always fruitful than finding the better
algorithm

A : true

B : false

C:

D:

Q.no 14. What is the worst case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 15. if x and y are Irrational numbers then x**y is

A : Rational

B : Irrational

C:

D:

Q.no 16. What approach is being followed in Floyd Warshall Algorithm?

A : Greedy Technique

B : Dynamic Programming

C : Linear Programming

D : Backtracking

Q.no 17. Alorithm should have finite number of steps

A : true

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 104/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 18. In artificial Neural Network interconnected processing elements are called

A : Nodes Or Neurons

B : Weights

C : Axons

D : Soma

Q.no 19. What is the average case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 20. In a computational complexity theory, a problem with decision making is said to be NP-
complete when it is both in NP and NP-hard. What does NP mean?

A : Non Polynomial time

B : Non-deterministic Probabilistic

C : Non-deterministic Polynomial time

D : Non Probabilistic time

Q.no 21. Simulated annealing (SA) is

A : A Probabilistic Technique For Approximating The Global Optimum Of A Given Function

B : It Is A Exact Local Optimization In A Small Search Space For Problem

C : The Energy (Goal) Function Is Not Used

D : It Is Not Used When The Search Space Is Discrete

Q.no 22. The Worst case occur in linear search algorithm when

A : Item is somewhere in the middle of the array

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 105/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Item is not in the array at all

C : Item is the first element in the array

D : Item is the last element in the array or is not there at all

Q.no 23. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

D : O(n-1)

Q.no 24. A problem in NP is NP-complete if

A : It can be reduced to the 3-SAT problem in polynomial time

B : The 3-SAT problem can be reduced to it in polynomial time

C : It can be reduced to any other problem in NP in polynomial time

D : some problem in NP can be reduced to it in polynomial time

Q.no 25. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

Q.no 26. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

A : P is infinite set

B : P is finite set

C:

D:

Q.no 27. Which of the following statements about loop invariants is false?

A : Loop invariants are used to show that algorithms produce the correct results.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 106/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : A loop invariant is the opposite, that is the negation, of the condition of the loop.

C : To prove that a statement is a loop invariant, we use mathematical induction.

D : Loop invariants remain true each time a loop is executed.

Q.no 28. 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

Q.no 29. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using

A : Central tendency

B : Differential equation

C : Order of execution

D : Order of Storage

Q.no 30. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 31. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 32. Power saving is an important job in embedded systm and sensor network.

A : true

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 107/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 33. What is base case in the given code?

A : Fn(10)

B : return

C : if (n==0)

D : Fn(n-1)

Q.no 34. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem

A : only I

B : only II

C : both I and II

D : neither I nor II

Q.no 35. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 36. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 37. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.

A : greedy method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 108/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 38. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.

A : Minimum & Maximum problem

B : Knapsack problem

C : Selection problem

D : Merge sort

Q.no 39. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

Q.no 40. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : A, C, B

D : B,A, C

Q.no 41. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 42. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 109/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 43. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 44. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 45. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 46. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 110/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 47. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 48. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 49. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 50. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 51. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 111/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 52. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 53. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 54. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 55. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 56. What are the issues on which biological networks proves to be superior than AI
networks?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 112/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 57. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 58. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 59. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 60. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 113/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 1. Recursion is a method in which the solution of a problem depends on?

A : Larger instances of different problems

B : Larger instances of the same problem

C : Smaller instances of the same problem

D : Smaller instances of different problems

Q.no 2. Which Programming is based on stepwise refinement process.

A : Structural

B : C programming

C : Procedural

D : Fine

Q.no 3. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

Q.no 4. Example of O(n) algorithms is______________

A : Multiplying two numbers.

B : linear search

C : assigning a value to a variable

D : displaying some integer on console

Q.no 5. Master theorem applies to recurrences of the form (a=1 and b>1) are two constants.
Select one:

A : T(N)=A.T(N/B)+F(N)

B : T(n)=n.T(n/2)+b.f(n)

C : T(N)=A.T(N-1)+B

D : T(N)=N.T(N-3)+B

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 114/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 6. The best suited algorithm could be decided using proof technique

A : false

B : true

C:

D:

Q.no 7. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 8. Algorithm must have atleast one external input

A : true

B : false

C:

D:

Q.no 9. If f(n) = ______, then there exists positive constants c1, c2, n0 such that 0 ≤ c1.g(n) ≤ f(n)
≤ c2.g(n), for all n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

D : little Ω(g(n))

Q.no 10. Which of the following methods can be used to solve the Knapsack problem?

A : Brute force algorithm

B : Recursion

C : Dynamic programming

D : Brute force, Recursion and Dynamic Programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 115/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 11. Which is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.

A : Debugging

B : Profiling

C : Conquer

D : Combining

Q.no 12. The complexity of Binary search algorithm is___

A : O(n)

B : O(log n)

C : O( n^2)

D : O(n log n)

Q.no 13. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.

A : True

B : FALSE

C:

D:

Q.no 14. Binomial tree with zero order has only

A : 1 Node

B : 2 Nodes

C : 3 Nodes

D : 4 Nodes

Q.no 15. In recursion, the condition for which the function will stop calling itself is

A : Best case

B : Worst case

C : Base case

D : There is no such condition

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 116/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 16. Merge sort uses which of the following technique to implement sorting?

A : Backtracking

B : Greedy Algorithm

C : Divide And Conquer

D : Dynamic Programming

Q.no 17. Fractional knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 18. Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 19. Crossover, mutation, and selection are the

A : Operators Of Genetic

B : Functions of Genetic

C : Population Of Genetic

D : Member Function

Q.no 20. Express the formula (n-2)*(n-4) in terms of Theta Ɵ Notation

A : Ɵ(n^2)

B : Ɵ(8)

C : Ɵ(log n)

D : Ɵ(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 117/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 21. Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of

knapsack=20. Find the
maximum value output assuming items to be divisible.

A : 60

B : 80

C : 100

D : 40

Q.no 22. Multithreaded computation can be better understood with the help of a

A : Computation undirected acyclic graph

B : Computation directed cyclic graph

C : Computation directed acyclic graph

D : Computation undirected cyclic graph

Q.no 23. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 24. The speed up of a computation on P processors is defined as

A : T1 / T∞

B : T1 / Tp

C : Tp / T1

D : T∞/T1

Q.no 25. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

A : O(n)

B : O(nLogn)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 118/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O(n^2)

D : O(n^2Logn)

Q.no 26. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

Q.no 27. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 28. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?

A : 160

B : 200

C : 170

D : 90

Q.no 29. which of the following is not a characteristics of good algorithm

A : precise

B : Ambigous

C : finite number of steps

D : logical flow of control

Q.no 30. The number of trees in a binomial heap with n nodes is

A : log n

B:n

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 119/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : n log n

D : n/2

Q.no 31. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 32. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 33. subjective decision is important aspect of algorithm

A : true

B : false

C:

D:

Q.no 34. Choose the correct steps required to prove that a problem is NP complete?

A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.

B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.

C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
question in polynomial time.

D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 120/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 35. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 36. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

Q.no 37. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions

A : Dynamic Programming

B : Backtracking

C : Branch And Bound

D : Greedy Method

Q.no 38. What are desirable characteristics of Algorithm with efficiency 1)Generality 2)
Availability 3) Simplicity

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 39. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

B : Bottom Up Fashion

C : In Any Way

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 121/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Random

Q.no 40. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false

C:

D:

Q.no 41. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 42. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 43. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 44. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 122/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 45. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 46. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 47. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 48. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 49. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 123/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 50. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 51. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 52. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 53. 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

Q.no 54. Characteristics of EAs ( Evolutionary Algorithm)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 124/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 55. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 56. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 57. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 58. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 125/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 59. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 60. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 1. steps followed in mathematical induction are 1)basis 2)Induction step 3) Induction
hypothesis

A : steps 1and 2 only

B : steps 2 and 3 only

C : steps 1,2, 3

D : steps 1 and 3 only

Q.no 2. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}

A : O(N)

B : O(N*log(N))

C : O(N * Sqrt(N))

D : O(N*N)

Q.no 3. In a max-heap, element with the greatest key is always in the which node?

A : Leaf node

B : First node of left sub tree

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 126/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Root node

D : First node of right sub tree

Q.no 4. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 5. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 6. To solve one problem how many algorithms are possible?

A : one

B : two

C : several

D:

Q.no 7. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 8. q29.jpeg

A : 111

B : 101

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 127/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 110

D : 11

Q.no 9. Which is an essential tool for proving the statement that proves an algorithm's
correctness.

A : Mathematical induction

B : Flow chart

C : Pseudo code

D : Recursion

Q.no 10. What is a Rabin and Karp Algorithm?

A : String Matching Algorithm

B : Shortest Path Algorithm

C : Minimum spanning tree Algorithm

D : Approximation Algorithm

Q.no 11. Dijkstra’s Algorithm is used to solve ………. problems.

A : All pair shortest path

B : Single source shortest path

C : Network flow

D : Sorting

Q.no 12. What is the worst case time complexity of merge sort?

A : O(n log n)

B : O(n^2)

C : O(n^2 log n)

D : O(n log n^2)

Q.no 13. What is the objective of the knapsack problem?

A : To Get Maximum Total Value In The Knapsack

B : To Get Minimum Total Value In The Knapsack

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 128/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : To Get Maximum Weight In The Knapsack

D : To Get Minimum Weight In The Knapsack

Q.no 14. Which design strategy stops the execution when it finds the solution otherwise starts the
problem from top again?

A : Back Tracking

B : Branch and Bound

C : Divide And Conquer

D : Dynamic Programming

Q.no 15. Recursive function must have

A : switch -case

B : exit condition

C : loop

D:

Q.no 16. In the absence of a exit condition in a recursive function, the following error is given by?

A : Compile time error

B : Run time error

C : Logical error

D : No error

Q.no 17. Which of the following can traverse the state space tree only in DFS manner?

A : Branch And Bound

B : Dynamic Programming

C : Greedy Algorithm

D : Backtracking

Q.no 18. _____is the minimum number of steps that can be executed for given input

A : Average case

B : Best case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 129/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Worst case

D : Time complexity

Q.no 19. Which of the following algorithms is the best approach for solving Huffman codes?

A : Exhaustive Search

B : Greedy Algorithm

C : Brute Force Algorithm

D : Divide And Conquer Algorithm

Q.no 20. The Data structure used in standard implementation of Breadth First search
is___________

A : Stack

B : Queue

C : Linked List

D : Tree

Q.no 21. 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

Q.no 22. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection

D : Multiplication

Q.no 23. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?

A : Aggregate method

B : Accounting method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 130/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Potential method

D : Both aggregate and potential method

Q.no 24.

A : 10

B:1

C : 10 9 8 ……1 0

D : 10 9 8 ……1

Q.no 25. 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

Q.no 26. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 131/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 27. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem

A : only I

B : only II

C : both I and II

D : neither I nor II

Q.no 28. which is not the important aspect of Loop

A : Initial condition

B : nested loop

C : invariant relation

D : termination

Q.no 29. Running the program many times is sufficient to prove the correctness of program

A : true

B : false

C:

D:

Q.no 30. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 31. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 132/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 32. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex
Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 33. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 34. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

B : proof by deduction

C : proof by contradiction

D:

Q.no 35. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 36. Time complexity of fractional knapsack problem is

A : O(n log n)

B : O(n)

C : O(1)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 133/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : O(nW)

Q.no 37. When a thread u spawns a new thread v, then (u,v) is called a

A : Simple edge

B : Return edge

C : Continuation edge

D : spawn edge

Q.no 38. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 39. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 40. which of the following is not basic control structure

A : the process

B : the decision

C : the loop

D : the sequential

Q.no 41. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 134/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 42. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 43. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 44. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 45. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 46. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 135/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 47. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 48. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 49. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 50. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 51. The main time taking step in fractional knapsack problem is?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 136/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 52. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 53. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 54. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 55. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 137/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : R.J.Walker

D : S. Golomb

Q.no 56. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 57. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 58. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 59. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 60. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 138/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 1. If the children of the root,from left to right, are the roots of Bk−1, Bk−2, . . . , B1, B0,
then root has degree .........

A : K-1

B:K

C : K+1

D : K+2

Q.no 2. In a computational complexity theory, a problem with decision making is said to be NP-
complete when it is both in NP and NP-hard. What does NP mean?

A : Non Polynomial time

B : Non-deterministic Probabilistic

C : Non-deterministic Polynomial time

D : Non Probabilistic time

Q.no 3. Genetic algorithm uses

A : Natural Functions

B : Fitness Functions

C : Minimize Objective Functions

D : Member Function

Q.no 4. The best suited algorithm could be decided using proof technique

A : false

B : true

C:

D:

Q.no 5. Dijkstra’s Algorithm cannot be applied on ………….

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 139/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Directed and weighted graphs

B : Graphs having negative weight function

C : Unweighted graphs

D : Undirected and unweighted graphs

Q.no 6. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 7. Who created the Rabin Karp Algorithm?

A : Joseph Rabin and Michael Karp

B : Michael Rabin and Joseph Karp

C : Richard Karp and Michael Rabin

D : Michael Karp and Richard Rabin

Q.no 8. Express the formula (n-1)*(n-5) in terms of big Oh notation

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 9. Algorithm can be represented as

A : Pseudocode

B : Flowchart

C : None of the above

D : both 1and 2

Q.no 10. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ f(n) ≤ c.g(n), for
all n ≥ n0

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 140/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

D : Little o(g(n))

Q.no 11. In Algorithm Specification the blockes are indicated with matching

A : Braces

B : Parenthesis

C : Square Brackets

D : Slashes

Q.no 12. Which of the following statements is true?

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 13. Which of the following algorithm can be used to solve the Hamiltonian path problem
efficiently?

A : branch and bound

B : iterative improvement

C : divide and conquer

D : greedy algorithm

Q.no 14. What’s happen if base condition is not defined in recursion ?

A : stack underflow

B : stack overflow

C : both

D:

Q.no 15. Which of the following algorithms has better time complexity?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 141/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 16. When an algorithm is written in the form of a specific programming language, it
becomes a _________

A : Pseudocode

B : Programme

C:

D:

Q.no 17. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

A : true

B : false

C:

D:

Q.no 18. Choose the correct option

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iterative function is always better and simpler to write than recursion

Q.no 19. if x and y are Irrational numbers then x**y is

A : Rational

B : Irrational

C:

D:

Q.no 20. Algorithm must produce one output

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 142/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : true

B : false

C:

D:

Q.no 21. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 22. The type of encoding where no character code is the prefix of another character code is
called?

A : optimal encoding

B : prefix encoding

C : Fequency encoding

D : Trie encoding

Q.no 23. Dynamic programming is used to find:

A : All Optimal Solution Is Generated

B : One Solution Is Generated

C : No Optimal Solution Is Generated

D : Partial Solution Is Generated

Q.no 24. Which of the following is/are property/properties of a dynamic programming problem?

A : Evolutionary Approach

B : Require More Time

C : Greedy Approach

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 143/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Optimal Substructure And Overlapping Subproblems

Q.no 25. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : C, B ,A

D : B,A, C

Q.no 26. The number of trees in a binomial heap with n nodes is

A : log n

B:n

C : n log n

D : n/2

Q.no 27. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

D : O(n-1)

Q.no 28. What is work?

A : Execution time of single thread

B : Average of all threads

C : Sum of the times taken by each thread

D : Sum of the times taken by child threads only

Q.no 29. In dynamic programming, the technique of storing the previously calculated values is
called ___________

A : Saving Value Property

B : Storing Value Property

C : Memoization

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 144/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Mapping

Q.no 30. Proof by contradiction is also known as

A : inverse proof

B : indirect proof

C : reverse proof

D:

Q.no 31. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using

A : Central tendency

B : Differential equation

C : Order of execution

D : Order of Storage

Q.no 32. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1

B:2

C:3

D:4

Q.no 33. What is base case in the given code?

A : F1()

B : return

C : both

D : neither 1 nor 2

Q.no 34. If T= abcabaabc & P= abaa then what will be the value of s?

A:4

B:2

C:3

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 145/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:1

Q.no 35. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 36. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

D : 1,3,7,4,8,5,9,10

Q.no 37. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 38. Mathematical induction proves

A : Correctness of algorithm

B : Efficiency of algorithm

C : both

D:

Q.no 39. Which of the following problems is equivalent to the 0-1 Knapsack problem?

A : You are given a bag that can carry a maximum weight of W. You are given N items which have a
weight of {w1, w2, w3,…., wn} and a value of {v1, v2, v3,…., vn}. You can break the items into
smaller pieces. Choose the items in such a way that you get the maximum value

B : You are studying for an exam and you have to study N questions. The questions take {t1, t2, t3,….,
tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. You can study for a maximum of T hours.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 146/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

You can either study a question or leave it. Choose the questions in such a way that your score is
maximized

C : You are given infinite coins of denominations {v1, v2, v3,….., vn} and a sum S. You have to find
the minimum number of coins required to get the sum S

D : You are given a suitcase that can carry a maximum weight of 15kg. You are given 4 items which
have a weight of {10, 20, 15,40} and a value of {1, 2, 3,4}. You can break the items into smaller
pieces. Choose the items in such a way that you get the maximum value

Q.no 40. What will be the position of 6, when a max heap is constructed on the input elements 6,
71, 46, 8, 13, 16, 14, 66, 31, 27?

A : 6 will be at the root

B : 6 will be at the last level

C : 6 will be at the second level

D : 6 can be anywhere in the heap

Q.no 41. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 42. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 43. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 147/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 44. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 45. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 46. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 47. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 48. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 148/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 49. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 50. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 51. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 52. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 53. If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 149/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Overlapping Subproblems

B : Optimal Substructure

C : Memoization

D : Greedy

Q.no 54. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 55. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 56. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 57. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 150/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 58. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 59. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 60. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 1. What does the algorithmic analysis count?

A : The number of arithmetic and the operations that are required to run the program

B : The number of lines required by the program

C : The number of seconds required by the program to execute

D : The size of the input

Q.no 2. Which of the following algorithms has worst time complexity?

A : insertion sort

B : binary search

C : linear search

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 151/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : merge sort

Q.no 3. The goal of structured programming is to

A : have well indented programs

B : be able to infer the flow of control from the compiled code

C : be able to infer the flow of control from the program text

D : avoid the use of GOTO statements

Q.no 4. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 5. 0 1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 6. Matrix chain multiplication problem is solved by which approach?

A : Divide And Conquer

B : Dynamic Programming

C : Backtracking

D : Greedy Approach

Q.no 7. Which is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.

A : Debugging

B : Profiling

C : Conquer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 152/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Combining

Q.no 8. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.

A : true

B : false

C:

D:

Q.no 9. Two main measures for the efficiency of an algorithm are

A : Processor and memory

B : Complexity and capacity

C : Time and Space

D : Speed and Storage

Q.no 10. What is a Rabin and Karp Algorithm?

A : String Matching Algorithm

B : Shortest Path Algorithm

C : Minimum spanning tree Algorithm

D : Approximation Algorithm

Q.no 11. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.

A : True

B : FALSE

C:

D:

Q.no 12. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ c.g(n) ≤ f(n), for
all n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 153/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : little Ω(g(n))

Q.no 13. State whether True or False An algorithm is said to be correct if, for every input
instance, it halts with the correct output

A : true

B : false

C:

D:

Q.no 14. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra’s shortest path algorithm

B : Prim’s algorithm

C : Huffman Coding

D : Bellmen Ford Shortest path algorithm

Q.no 15. Which of the following case does not exist in complexity theory?

A : Best case

B : Average case

C : Null case

D : Worst case

Q.no 16. In a binomial heap the root value is greater than left child and less than right child.

A : true

B : false

C:

D:

Q.no 17. The problem of finding a path in a graph that visits every vertex exactly once is called?

A : Hamiltonian cycle problem

B : Hamiltonian path problem

C : Subset sum problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 154/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Turnpike reconstruction problem

Q.no 18. which of the following is not a proof technique

A : Contradiction

B : Approximation

C : Mathematical induction

D:

Q.no 19. Problems that cannot be solved by any algorithm are called?

A : tractable problems

B : intractable problems

C : undecidable problems

D : decidable problems

Q.no 20. 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

Q.no 21. 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

Q.no 22. Genetic algorithm is

A : A Intelligent Simple Specified Search Technique

B : Used To Solve Non Optimization Problem

C : Is A Part Of Evolutionary Computing

D : Simulated Annealing
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 155/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 23. which is not the important aspect of Loop

A : Initial condition

B : nested loop

C : invariant relation

D : termination

Q.no 24. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?

A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible

B : Both are the same

C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming

D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible

Q.no 25. Loop invariant is inert assertion and not useful in analysis of program.

A : true

B : false

C:

D:

Q.no 26. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 27. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?

A : 160

B : 200

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 156/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 170

D : 90

Q.no 28. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 29. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 30. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

Q.no 31. 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

Q.no 32. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.

A : Minimum & Maximum problem

B : Knapsack problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 157/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Selection problem

D : Merge sort

Q.no 33. Which of the following problems is similar to that of a Hamiltonian path problem?

A : knapsack problem

B : closest pair problem

C : travelling salesman problem

D : assignment problem

Q.no 34. A strand of maximal length is called as ______________

A : Process

B : Work

C : Thread

D : Span

Q.no 35. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 36. Power saving is an important job in embedded systm and sensor network.

A : true

B : false

C:

D:

Q.no 37. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 158/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Branch and bound

Q.no 38. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 39. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex
Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 40. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 41. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 42. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 159/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:m

D : m+1

Q.no 43. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 44. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 45. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 46. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 47. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 160/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Worst solution

D : All solutions

Q.no 48. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 49. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 50. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 51. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 161/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Π is neither NP-hard, nor in NP

Q.no 52. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 53. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 54. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 55. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 56. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 162/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 57. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 58. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 59. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 60. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 1. Which data structure is used for implementing a FIFO branch and bound strategy?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 163/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Stack

B : Queue

C : Array

D : Linked List

Q.no 2. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 3. What is best case complexity of selection sort

A:n

B : n^2

C : nlogn

D:

Q.no 4. Alorithm should have finite number of steps

A : true

B : false

C:

D:

Q.no 5. In Huffman coding, data in a tree is always present at?

A : Roots

B : Leafs

C : Left Sub Trees

D : Right Sub Trees

Q.no 6. What is adaline in neural networks?

A : Adaptive Linear Element

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 164/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Automatic Linear Element

C : Adaptive Line Element

D : Adaptive Nonlinear Element

Q.no 7. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?

A : NP

B:P

C : Hard

D : Complete

Q.no 8. Which Data Structure is used to perform Recursion?

A : Array

B : queue

C : stack

D : linked list

Q.no 9. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 10. What is the worst case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 11. steps followed in mathematical induction are 1)basis 2)Induction step 3) Induction
hypothesis

A : steps 1and 2 only

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 165/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : steps 2 and 3 only

C : steps 1,2, 3

D : steps 1 and 3 only

Q.no 12. Heap can be used as ……………….

A : Priority queue

B : Stack

C : A decreasing order array

D : Normal Array

Q.no 13. Recursion is a method in which the solution of a problem depends on?

A : Larger instances of different problems

B : Larger instances of the same problem

C : Smaller instances of the same problem

D : Smaller instances of different problems

Q.no 14. Keywords________indicates that iteration of the loop may run concurrently.

A : Parallel loop

B : Thread

C : Parallel for

D : Multithreading

Q.no 15. Which is a condition about the relationship between the variables of our program which
is definitely true immediately before and immediately after each iteration of the loop?

A : For condition

B : Loop invariant condition

C : Both a and b

D : If condition

Q.no 16. Halting problem is an example for?

A : decidable problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 166/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : undecidable problem

C : complete problem

D : trackable problem

Q.no 17. Tractable Problem is a problem that is not solvable by a polynomial-time algorithm

A : true

B : false

C:

D:

Q.no 18. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 19. In recursion, the condition for which the function will stop calling itself is?

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 20. What term is used to describe O(n) algorithm?

A : Constant

B : Non polynomial deterministic

C : logarithmic

D : linear

Q.no 21. loop termination condition along with what makes loop correct

A : loop condition

B : loop increment variable

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 167/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : loop invariant

D : none of these

Q.no 22. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 23. Which data structure is most suitable for implementing best first branch and bound
strategy?

A : Stack

B : Queue

C : Priority Queue

D : Linked List

Q.no 24. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection

D : Multiplication

Q.no 25. The first step of the genetic algorithm is

A : Applying Selection Of Letter

B : Applying Crossover Operator

C : Applying Nutrition Operator

D : Generated Initial Population

Q.no 26. When a thread u spawns a new thread v, then (u,v) is called a

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 168/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Simple edge

B : Return edge

C : Continuation edge

D : spawn edge

Q.no 27. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 28. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 29. Which of the following branch and bound strategy leads to depth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 30. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

B : Bottom Up Fashion

C : In Any Way

D : Random

Q.no 31. Time complexity of fractional knapsack problem is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 169/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : O(n log n)

B : O(n)

C : O(1)

D : O(nW)

Q.no 32. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 33. Simulated annealing (SA) is

A : A Probabilistic Technique For Approximating The Global Optimum Of A Given Function

B : It Is A Exact Local Optimization In A Small Search Space For Problem

C : The Energy (Goal) Function Is Not Used

D : It Is Not Used When The Search Space Is Discrete

Q.no 34. Which one of the following is true about Binary search?

A : the best-case occurs when the target item is in the beginning of the search list

B : the best-case occurs when the target is at the end of the search list

C : the worst-case is when the target item is not in the search list

D : the worst-case is when the target is found in the middle of the search list

Q.no 35. What is the purpose of using randomized quick sort over standard quick sort?

A : To reduce worst case space complexity

B : To reduce worst case time complexity

C : To improve average case time complexity

D : To improve accuracy

Q.no 36. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 170/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B:2

C:3

D:4

Q.no 37. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 38. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?

A : Aggregate method

B : Accounting method

C : Potential method

D : Both aggregate and potential method

Q.no 39. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 40. Which of the following problems can’t be solved using recursion?

A : Factorial of a number

B : Nth fibonacci number

C : Length of a string

D : Problems without base case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 171/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 41. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 42. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 43. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 44. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 45. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 172/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 46. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 47. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 48. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 49. 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

Q.no 50. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 173/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 51. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 52. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 53. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 54. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 55. algorithms performance is characterized by

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 174/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 56. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 57. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 58. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 59. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 60. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 175/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 1. What is the best case time complexity of binary search?

A : O(n)

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 2. What’s happen if base condition is not defined in recursion ?

A : stack underflow

B : stack overflow

C : both

D:

Q.no 3. What is tail recursion?

A : A recursive function that has two base cases

B : A function where the recursive functions leads to an infinite loop

C : A recursive function where the function doesn’t return anything and just prints the values

D : A function where the recursive call is the last thing executed by the function

Q.no 4. parallel algorithms that can run on a ____________ that permits multiple instructions to
execute concurrently

A : Uniprocessor

B : Serial Computer

C : Mainframe Computer

D : Multiprocessor computer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 176/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 5. In a computational complexity theory, a problem with decision making is said to be NP-
complete when it is both in NP and NP-hard. What does NP mean?

A : Non Polynomial time

B : Non-deterministic Probabilistic

C : Non-deterministic Polynomial time

D : Non Probabilistic time

Q.no 6. Fill in the blank. The notion of correctness for approximation algorithms is
…………...straightforward
than it is for exact algorithms

A : More

B : Less

C:

D:

Q.no 7. What is best case complexity of Insertion sort

A:n

B : n^2

C : nlogn

D:

Q.no 8. Two main measures for the efficiency of an algorithm are 1)time 2) space 3) lines of code

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 9. The fundamental unit of neural network is

A : Brain

B : Nucleus

C : Neuron

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 177/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Axon

Q.no 10. Master theorem applies to recurrences of the form (a=1 and b>1) are two constants.
Select one:

A : T(N)=A.T(N/B)+F(N)

B : T(n)=n.T(n/2)+b.f(n)

C : T(N)=A.T(N-1)+B

D : T(N)=N.T(N-3)+B

Q.no 11. The algorithm that do NOT have O(1) time complexity is____

A : Multiplying two numbers.

B : assigning some value to a variable

C : displaying some integer on console

D : Addition of n numbers

Q.no 12. Two main measures for the efficiency of an algorithm are

A : Processor and memory

B : Complexity and capacity

C : Time and Space

D : Speed and Storage

Q.no 13. Which of the following algorithms has worst time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 14. Which of the following algorithms is the best approach for solving Huffman codes?

A : Exhaustive Search

B : Greedy Algorithm

C : Brute Force Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 178/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Divide And Conquer Algorithm

Q.no 15. What approach is being followed in Floyd Warshall Algorithm?

A : Greedy Technique

B : Dynamic Programming

C : Linear Programming

D : Backtracking

Q.no 16. Problems that can be solved in polynomial time are known as?

A : intractable

B : tractable

C : decision

D : complete

Q.no 17. Algorithm can be represented as

A : Pseudocode

B : Flowchart

C : None of the above

D : both 1and 2

Q.no 18. Pseudocode is______________

A : Language dependent

B : Language independent

C:

D:

Q.no 19. Which of the following methods can be used to solve the Knapsack problem?

A : Brute force algorithm

B : Recursion

C : Dynamic programming

D : Brute force, Recursion and Dynamic Programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 179/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 20. Running time of algorithm varies with the size of the input called____

A : Growth of Function

B : Order of growth

C : Growth Rate

D : Growth of log function

Q.no 21. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

Q.no 22. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 23. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….

A : logarithmic and linear time constant respectively

B : constant and linear time respectively

C : constant and quadratic time respectively

D : constant and logarithmic time respectively

Q.no 24. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 180/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 25. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

D : 1,3,7,4,8,5,9,10

Q.no 26. Which of the following method is used for sorting in merge sort?

A : Merging

B : Partitioning

C : Selection

D : Exchanging

Q.no 27. 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

Q.no 28. Time taken in decreasing the node value in a binomial heap is

A : O(n)

B : O(1)

C : O(log n)

D : O(n log n)

Q.no 29. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 181/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 30. Let X be a problem that belongs to the class NP. Then which one of the following is
TRUE?

A : There is no polynomial time algorithm for X.

B : If X can be solved deterministically in polynomial time, then P = NP.

C : If X is NP-hard, then it is NP-complete.

D : X may be undecidable.

Q.no 31. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

A : P is infinite set

B : P is finite set

C:

D:

Q.no 32. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

B : proof by deduction

C : proof by contradiction

D:

Q.no 33. The term ________ refers to all state space search methods in which all children of the –
nodes are generated before any other live node can become the E-node.

A : Backtacking

B : Depth First Search

C : Branch And Bound

D : Breadth First Search

Q.no 34. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

A : O(n)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 182/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(nLogn)

C : O(n^2)

D : O(n^2Logn)

Q.no 35. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 36. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 37. Which of the following are not in NP?

A : All problems in P

B : Boolean Satisfiability problems

C : Integer factorization problem

D : Halting problem

Q.no 38. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 39. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 183/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible

B : Both are the same

C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming

D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible

Q.no 40. what are the basic rules of recursion

A : Each recursive call should be on a smaller instance of the same problem, that is, a smaller
subproblem

B : The recursive calls must eventually reach a base case, which is solved without further recursion.

C : both 1 and 2

D : Either 1 or 2

Q.no 41. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 42. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 43. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 184/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Brute Force, Recursion And Dynamic Programming

Q.no 44. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 45. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 46. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 47. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 185/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 48. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 49. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 50. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 51. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 52. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 186/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 53. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 54. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 55. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 56. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 57. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 187/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Sorting

D : Looping through sorted items

Q.no 58. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 59. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 60. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 1. One can have __________, where each processor can directly access any location of
memory

A : Shared Memory

B : Cache Memory

C : Distributed Memory

D : Private Memory

Q.no 2. To solve one problem how many algorithms are possible?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 188/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : one

B : two

C : several

D:

Q.no 3. What is the type of the algorithm used in solving the 8 Queens problem?

A : Backtracking

B : Dynamic Programming

C : Branch And Bound

D : Divide And Conquer

Q.no 4. Which of the following algorithm can be used to solve the Hamiltonian path problem
efficiently?

A : branch and bound

B : iterative improvement

C : divide and conquer

D : greedy algorithm

Q.no 5. Steps of Divide and Conquer approach are______

A : Divide, Conquer And Combine

B : Combine, Conquer and Divide

C : Combine, Divide And Conquer

D : Divide, Combine And Conquer

Q.no 6. If f(n) = ______, then there exists positive constants c1, c2, n0 such that 0 ≤ c1.g(n) ≤ f(n)
≤ c2.g(n), for all n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

D : little Ω(g(n))

Q.no 7. q29.jpeg

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 189/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 111

B : 101

C : 110

D : 11

Q.no 8. Uniprocessor executes____instruction at a time

A : Many

B : Two

C : One

D : Three

Q.no 9. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 10. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.

A : A1

B : A2

C : A3

D : A4

Q.no 11. The space factor when determining the efficiency of algorithm is measured by

A : Counting the maximum memory needed by the algorithm

B : Counting the minimum memory needed by the algorithm

C : Counting the average memory needed by the algorithm

D : Counting the maximum disk space needed by the algorithm

Q.no 12. For the improvement of efficiency of quick sort the pivot can be____

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 190/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : the first element

B : the middle element

C : the last element

D : any random element

Q.no 13. When an algorithm is written in the form of a specific programming language, it
becomes a _________

A : Pseudocode

B : Programme

C:

D:

Q.no 14. In a max-heap, element with the greatest key is always in the which node?

A : Leaf node

B : First node of left sub tree

C : Root node

D : First node of right sub tree

Q.no 15. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 16. What is the average case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 17. Which of the following methods can be used to solve the longest common subsequence
problem?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 191/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Not Recursion

B : Dynamic Programming

C : Branch And Bound

D : Greedy Algorithm

Q.no 18. Which of the following is not characteristic of Algorithm

A : Definiteness

B : finiteness

C : scalability

D : effectiveness

Q.no 19. Dijkstra’s Algorithm is used to solve ………. problems.

A : All pair shortest path

B : Single source shortest path

C : Network flow

D : Sorting

Q.no 20. The main distinguishable characteristic of a binomial heap from a binary heap is that

A : It allows union operations very efficiently.

B : It does not allow union operations that could easily be implemented in binary heap.

C : The heap structure is not similar to complete binary tree.

D : The location of child node is not fixed.

Q.no 21. Problems that can be solved in polynomial time are known as ……… problems.

A : Intractable

B : Tractable

C : Undecidable

D : Decidable

Q.no 22. subjective decision is important aspect of algorithm

A : true
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 192/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 23. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false

C:

D:

Q.no 24. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 25. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 26. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

B : Bottom Up Fashion

C : In Any Way

D : Random

Q.no 27. An algorithm that always runs in polynomial time but possibly returns erroneous
answers is called a …………

A : Las Vegas Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 193/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 28. Parallel loops are like an ordinary_______________except that the iterations of the loop
can execute concurrently.

A : While loop

B : For Loop

C : Do while loop

D : If statement

Q.no 29. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions

A : Dynamic Programming

B : Backtracking

C : Branch And Bound

D : Greedy Method

Q.no 30. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 31. which is not the important aspect of Loop

A : Initial condition

B : nested loop

C : invariant relation

D : termination

Q.no 32. Which of the following problems is NOT solved using dynamic programming?

A : 0/1 Knapsack Problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 194/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Matrix Chain Multiplication Problem

C : Edit Distance Problem

D : Fractional Knapsack Problem

Q.no 33. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 34. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 35. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

Q.no 36. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

Q.no 37. Running the program many times is sufficient to prove the correctness of program

A : true

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 195/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 38. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

Q.no 39. The Knapsack problem where the objective function is to minimize the profit is

A : Greedy

B : Dynamic 0 / 1

C : Back tracking

D : Branch & Bound 0/1

Q.no 40. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 41. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 196/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 42. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 43. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 44. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 45. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 46. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 197/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Inappropriate

D : Not In Iterative Nature

Q.no 47. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 48. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 49. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 50. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 51. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 198/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:m

D : m+1

Q.no 52. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 53. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 54. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 55. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 56. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 199/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O(log n)

D : O(n log n)

Q.no 57. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 58. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 59. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 60. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 1. What is the worst case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 200/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O(Log N)

D : O(Log Log N)

Q.no 2. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 3. Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 4. What is the time complexity of Dijikstra’s algorithm?

A : O(n)

B : O(n^3)

C : O(n^2)

D : O(log n)

Q.no 5. Two main measures for the efficiency of an algorithm are 1)time 2) space 3) lines of code

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 6. State whether True or False An algorithm is said to be correct if, for every input instance,
it halts with the correct output

A : true

B : false

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 201/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 7. Which of the following statements is true?

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 8. goto statement is?

A : Used to jump the control of program.

B : Used for iteration

C : same as switch statement

D : Not Used for iteration

Q.no 9. O(2^n) means computing time is ____

A : Linear

B : polynomial

C : quadratic

D : exponential

Q.no 10. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra’s shortest path algorithm

B : Prim’s algorithm

C : Huffman Coding

D : Bellmen Ford Shortest path algorithm

Q.no 11. Express the formula (n-2)*(n-4) in terms of Theta Ɵ Notation

A : Ɵ(n^2)

B : Ɵ(8)

C : Ɵ(log n)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 202/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Ɵ(n)

Q.no 12. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 13. If the children of the root,from left to right, are the roots of Bk−1, Bk−2, . . . , B1, B0,
then root has degree .........

A : K-1

B:K

C : K+1

D : K+2

Q.no 14. What is best case complexity of Insertion sort

A:n

B : n^2

C : nlogn

D:

Q.no 15. Which data structure is used for implementing a FIFO branch and bound strategy?

A : Stack

B : Queue

C : Array

D : Linked List

Q.no 16. In recursion, the condition for which the function will stop calling itself is

A : Best case

B : Worst case

C : Base case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 203/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : There is no such condition

Q.no 17. Which algorithm design strategy is followed by Dijkstra’s Algorithm?

A : Greedy strategy

B : Branch and bound

C : Backtracking

D : Dynamic programming

Q.no 18. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’

A : NP problems

B : P problem

C : NP complete problem

D : NP hard problem

Q.no 19. What is best case complexity of selection sort

A:n

B : n^2

C : nlogn

D:

Q.no 20. if x and y are Irrational numbers then x**y is

A : Rational

B : Irrational

C:

D:

Q.no 21. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 204/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Multiplication

Q.no 22. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 23. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 24. Power saving is an important job in embedded systm and sensor network.

A : true

B : false

C:

D:

Q.no 25. 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

Q.no 26. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

A : O(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 205/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(nLogn)

C : O(n^2)

D : O(n^2Logn)

Q.no 27. The type of encoding where no character code is the prefix of another character code is
called?

A : optimal encoding

B : prefix encoding

C : Fequency encoding

D : Trie encoding

Q.no 28. Genetic algorithm is

A : A Intelligent Simple Specified Search Technique

B : Used To Solve Non Optimization Problem

C : Is A Part Of Evolutionary Computing

D : Simulated Annealing

Q.no 29. Which of the following is/are property/properties of a dynamic programming problem?

A : Evolutionary Approach

B : Require More Time

C : Greedy Approach

D : Optimal Substructure And Overlapping Subproblems

Q.no 30. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 31. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 206/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : proof by deduction

C : proof by contradiction

D:

Q.no 32. Choose the correct steps to prove if the 3 SAT CNF problem is NP-Complete. I-- SAT
problem is in NP II--3 SAT CNF problem is in NP III--Prove that SAT ≤ 3 SAT CNF Problem in
polynomial time IV---Prove that 3 SAT CNF problem ≤ SAT Problem in polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 33. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

Q.no 34. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 35. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 207/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 36. What will be the position of 6, when a max heap is constructed on the input elements 6,
71, 46, 8, 13, 16, 14, 66, 31, 27?

A : 6 will be at the root

B : 6 will be at the last level

C : 6 will be at the second level

D : 6 can be anywhere in the heap

Q.no 37. A problem in NP is NP-complete if

A : It can be reduced to the 3-SAT problem in polynomial time

B : The 3-SAT problem can be reduced to it in polynomial time

C : It can be reduced to any other problem in NP in polynomial time

D : some problem in NP can be reduced to it in polynomial time

Q.no 38. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 39. Proof by contradiction is also known as

A : inverse proof

B : indirect proof

C : reverse proof

D:

Q.no 40. Which data structure is most suitable for implementing best first branch and bound
strategy?

A : Stack

B : Queue

C : Priority Queue

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 208/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Linked List

Q.no 41. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 42. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 43. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 44. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 209/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 45. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 46. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 47. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 48. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 49. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 210/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Brute Force, Recursion And Dynamic Programming

Q.no 50. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 51. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 52. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 53. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 54. How many times is the recursive function called, when the following code is executed?

A:7

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 211/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B:9

C : 11

D : 13

Q.no 55. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 56. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 57. 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

Q.no 58. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 212/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 59. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 60. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 1. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra's shortest path algorithm

B : Prim's algorithm

C : Kruskal algorithm

D : Bellmen Ford Shortest path algorithm

Q.no 2. Which of the following algorithms is the best approach for solving Huffman codes?

A : Exhaustive Search

B : Greedy Algorithm

C : Brute Force Algorithm

D : Divide And Conquer Algorithm

Q.no 3. The choice of polynomial class has led to the development of an extensive theory called
________

A : computational complexity

B : time complexity

C : problem complexity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 213/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : decision complexity

Q.no 4. Binomial tree with zero order has only

A : 1 Node

B : 2 Nodes

C : 3 Nodes

D : 4 Nodes

Q.no 5. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 6. Hamiltonian path problem is _________

A : NP problem

B : N class problem

C : P class problem

D : NP complete problem

Q.no 7. What is a splay operation?

A : moving parent node to down of child

B : moving a node to root

C : ) moving root to leaf

D : removing leaf node

Q.no 8. Which of the following can traverse the state space tree only in DFS manner?

A : Branch And Bound

B : Dynamic Programming

C : Greedy Algorithm

D : Backtracking
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 214/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 9. To solve one problem how many algorithms are possible?

A : one

B : two

C : several

D:

Q.no 10. Which of the following is true about Huffman Coding.

A : Huffman coding may become lossy in some cases

B : Huffman Codes may not be optimal lossless codes in some cases

C : In Huffman coding, no code is prefix of any other code.

D : Huffman Codes may not be optimal lossy codes in some cases

Q.no 11. Which strategy is followed by QuickSort?

A : Greedy strategy

B : Brute Force technique

C : Dynamic programming

D : Divide and conquer

Q.no 12. What is adaline in neural networks?

A : Adaptive Linear Element

B : Automatic Linear Element

C : Adaptive Line Element

D : Adaptive Nonlinear Element

Q.no 13. What does the algorithmic analysis count?

A : The number of arithmetic and the operations that are required to run the program

B : The number of lines required by the program

C : The number of seconds required by the program to execute

D : The size of the input

Q.no 14. Which Programming is based on stepwise refinement process.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 215/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Structural

B : C programming

C : Procedural

D : Fine

Q.no 15. Recursion is similar to which of the following?

A : Switch Case

B : Loop

C : If else

D : if elif else

Q.no 16. Genetic algorithms are

A : Adaptive Heuristic Search Algorithm

B : Binary search algorithm

C : Simulated Annealing

D : Adaptive Linear

Q.no 17. Two main measures for the efficiency of an algorithm are

A : Processor and memory

B : Complexity and capacity

C : Time and Space

D : Speed and Storage

Q.no 18. Halting problem is an example for?

A : decidable problem

B : undecidable problem

C : complete problem

D : trackable problem

Q.no 19. Tractable Problem is a problem that is not solvable by a polynomial-time algorithm

A : true
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 216/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : false

C:

D:

Q.no 20. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

A : true

B : false

C:

D:

Q.no 21. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : A, C, B

D : B,A, C

Q.no 22. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 23. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 24. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 217/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

for (j = 0; j < M; j++) {

b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 25. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

D : 1,3,7,4,8,5,9,10

Q.no 26. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 27. Mathematical induction proves

A : Correctness of algorithm

B : Efficiency of algorithm

C : both

D:

Q.no 28. What is base case in the given code?

A : Fn(10)

B : return

C : if (n==0)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 218/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Fn(n-1)

Q.no 29. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 30. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : C, B ,A

D : B,A, C

Q.no 31. Which data structure has a better amortized running time than others?

A : Queue

B : Stack

C : Priority Queue

D : List

Q.no 32. Which of the following problems can’t be solved using recursion?

A : Factorial of a number

B : Nth fibonacci number

C : Length of a string

D : Problems without base case

Q.no 33. Multithreaded computation can be better understood with the help of a

A : Computation undirected acyclic graph

B : Computation directed cyclic graph

C : Computation directed acyclic graph

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 219/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Computation undirected cyclic graph

Q.no 34. which of the following is not a characteristics of good algorithm

A : precise

B : Ambigous

C : finite number of steps

D : logical flow of control

Q.no 35. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 36. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 37. Which of the following branch and bound strategy leads to depth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 38. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 220/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Branch and Bound Method

Q.no 39. Time taken in decreasing the node value in a binomial heap is

A : O(n)

B : O(1)

C : O(log n)

D : O(n log n)

Q.no 40. What are desirable characteristics of Algorithm with efficiency 1)Generality 2)
Availability 3) Simplicity

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 41. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 42. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 43. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 221/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 290

D : 130

Q.no 44. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 45. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 46. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 47. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 48. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 222/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 49. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 50. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 51. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 52. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 53. The name backtrack was first coined by _________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 223/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 54. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 55. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 56. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 57. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 224/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 58. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 59. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 60. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 1. In recursion, the condition for which the function will stop calling itself is

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 2. When an algorithm is written in the form of a specific programming language, it becomes
a _________

A : Pseudocode

B : Programme

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 225/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 3. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 4. Which data structure is used for implementing a LIFO branch and bound strategy?

A : Stack

B : Queue

C : Array

D : Linked List

Q.no 5. What is the time complexity of following code: int a = 0, i = N;

while (i > 0) {
a += i;
i /= 2;
}

A : O(n)

B : O(Logn)

C : O(n^2)

D : O(n^2Logn)

Q.no 6. Which design strategy stops the execution when it finds the solution otherwise starts the
problem from top again?

A : Back Tracking

B : Branch and Bound

C : Divide And Conquer

D : Dynamic Programming

Q.no 7. The complexity of Binary search algorithm is___

A : O(n)

B : O(log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 226/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O( n^2)

D : O(n log n)

Q.no 8. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 9. Express the formula (n-1)*(n-5) in terms of big Oh notation

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 10. Which of the following is incorrect? Algorithms can be represented:

A : Pseudocode

B : Programme

C : Grammar

D : flowchart

Q.no 11. From the following which is not return optimal solution

A : Dynamic Programming

B : Branch And Bound

C : Backtracking

D : Greedy Method

Q.no 12. _____is the maximum number of steps that can be executed for given input

A : Average case

B : Best case

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 227/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Worst case

D : Time complexity

Q.no 13. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?

A : NP

B:P

C : Hard

D : Complete

Q.no 14. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.

A : true

B : false

C:

D:

Q.no 15. Problems that can be solved in polynomial time are known as?

A : intractable

B : tractable

C : decision

D : complete

Q.no 16. Keywords________indicates that iteration of the loop may run concurrently.

A : Parallel loop

B : Thread

C : Parallel for

D : Multithreading

Q.no 17. O(n^3) means computing time is ____

A : Linear

B : polynomial

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 228/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : quadratic

D : exponential

Q.no 18. The goal of structured programming is to

A : have well indented programs

B : be able to infer the flow of control from the compiled code

C : be able to infer the flow of control from the program text

D : avoid the use of GOTO statements

Q.no 19. For the improvement of efficiency of quick sort the pivot can be____

A : the first element

B : the middle element

C : the last element

D : any random element

Q.no 20. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.

A : A1

B : A2

C : A3

D : A4

Q.no 21. When a thread u spawns a new thread v, then (u,v) is called a

A : Simple edge

B : Return edge

C : Continuation edge

D : spawn edge

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 229/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 22.

A : 10

B:1

C : 10 9 8 ……1 0

D : 10 9 8 ……1

Q.no 23. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

Q.no 24. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 25. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 230/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : proof by deduction

C : proof by contradiction

D:

Q.no 26. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

A : P is infinite set

B : P is finite set

C:

D:

Q.no 27. The parallelism of a multithreaded computation is given by

A : T1 / Tp

B : T1 / T∞

C : T∞/T1

D : Tp / T1

Q.no 28. Which of these is false about recursion?

A : Recursive function can be replaced by a non-recursive function

B : Recursive functions usually take more memory space than non-recursive function

C : Recursive functions run faster than non-recursive function

D : Recursion makes programs easier to understand

Q.no 29. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 30. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 231/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Bottom Up Fashion

C : In Any Way

D : Random

Q.no 31. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 32. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

Q.no 33. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 34. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.

A : Minimum & Maximum problem

B : Knapsack problem

C : Selection problem

D : Merge sort

Q.no 35. What is the time complexity of Huffman Coding?

A : O(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 232/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(NlogN)

C:

D:

Q.no 36. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1

B:2

C:3

D:4

Q.no 37. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions

A : Dynamic Programming

B : Backtracking

C : Branch And Bound

D : Greedy Method

Q.no 38. The time taken by nondeterministic sorting algorithm is ______

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 39. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

Q.no 40. A problem in NP is NP-complete if

A : It can be reduced to the 3-SAT problem in polynomial time

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 233/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : The 3-SAT problem can be reduced to it in polynomial time

C : It can be reduced to any other problem in NP in polynomial time

D : some problem in NP can be reduced to it in polynomial time

Q.no 41. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 42. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 43. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 44. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 45. Genetic Algorithm is a part of

A : Not Evolutionary Computing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 234/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 46. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 47. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 48. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 49. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 235/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 50. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 51. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 52. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 53. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 54. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 236/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Π is neither NP-hard, nor in NP

Q.no 55. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 56. 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

Q.no 57. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 58. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 59. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 237/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : m^m

C:m

D : m+1

Q.no 60. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 1. state whether True or false. Algorithms are as impotant as advanced technologies

A : true

B : false

C:

D:

Q.no 2. What is the best case time complexity of binary search?

A : O(n)

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 3. The choice of polynomial class has led to the development of an extensive theory called
………

A : time complexity

B : space complexity

C : computational complexity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 238/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : problem complexity

Q.no 4. The best suited algorithm could be decided using proof technique

A : false

B : true

C:

D:

Q.no 5. waiting for the hardware advancements are always fruitful than finding the better
algorithm

A : true

B : false

C:

D:

Q.no 6. Which of the following case does not exist in complexity theory?

A : Best case

B : Average case

C : Null case

D : Worst case

Q.no 7. Running time of algorithm varies with the size of the input called____

A : Growth of Function

B : Order of growth

C : Growth Rate

D : Growth of log function

Q.no 8. Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 239/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Backtracking Algorithm

Q.no 9. In a binomial heap the root value is greater than left child and less than right child.

A : true

B : false

C:

D:

Q.no 10. In an amortized analysis, the time required to perform a sequence of data structure
operations is summed over all the operations performed. This statement is true or false.

A : true

B : false

C:

D:

Q.no 11. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 12. What is the worst case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 13. Fractional knapsack problem is also known as

A : 0/1 knapsack problem

B : Continuous knapsack problem

C : Divisible knapsack problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 240/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Non continuous knapsack problem

Q.no 14. which of the following is not a proof technique

A : Contradiction

B : Approximation

C : Mathematical induction

D:

Q.no 15. The best data structure to check whether an arithmetic expression has balanced
parentheses is a

A : queue

B : stack

C : tree

D : list

Q.no 16. Recursive function must have

A : switch -case

B : exit condition

C : loop

D:

Q.no 17. The time factor when determining the efficiency of algorithm is measured by

A : Counting microseconds

B : Counting the number of key operations

C : Counting the kilobytes of algorithm

D:

Q.no 18. Example of O(n) algorithms is______________

A : Multiplying two numbers.

B : linear search

C : assigning a value to a variable

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 241/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : displaying some integer on console

Q.no 19. What is flowchart ?

A : Representation of memory usage in algorithm

B : Representation of Time required to execute algorithm

C : visual representaion of algorithm

D:

Q.no 20. Operations in the neural networks can perform what kind of operations?

A : Not In Serial

B : Not In Parallel

C : Serial Or Parallel

D : Partial

Q.no 21. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 22. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 23. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 242/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : loop condition

Q.no 24. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 25. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….

A : logarithmic and linear time constant respectively

B : constant and linear time respectively

C : constant and quadratic time respectively

D : constant and logarithmic time respectively

Q.no 26. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 27. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 28. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 243/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : proof by contradiction

D : direct proof

Q.no 29. 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

Q.no 30. 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

Q.no 31. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

A : O(n)

B : O(nLogn)

C : O(n^2)

D : O(n^2Logn)

Q.no 32. which of the following is not basic control structure

A : the process

B : the decision

C : the loop

D : the sequential

Q.no 33. Simulated annealing (SA) is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 244/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : A Probabilistic Technique For Approximating The Global Optimum Of A Given Function

B : It Is A Exact Local Optimization In A Small Search Space For Problem

C : The Energy (Goal) Function Is Not Used

D : It Is Not Used When The Search Space Is Discrete

Q.no 34. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem

A : only I

B : only II

C : both I and II

D : neither I nor II

Q.no 35. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 36. Generally greedy algorithms are are in nature of

A : Iterative

B : Recursive

C : Both A and B

D : Neither A Nor B

Q.no 37. What is worst case in Naive Pattern matching algorithm.

A : The first character of the pattern is not present in text at all.

B : When all characters of the text and pattern are same.

C : when only the last character is different.

D : Both B and C

Q.no 38. Running the program many times is sufficient to prove the correctness of program

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 245/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : true

B : false

C:

D:

Q.no 39. Choose the correct steps required to prove that a problem is NP complete?

A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.

B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.

C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
question in polynomial time.

D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.

Q.no 40. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 41. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 42. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 246/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 43. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 44. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 45. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 46. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 47. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 247/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : 20*30

C : 10*30

D : 10*20*30

Q.no 48. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 49. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 50. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 51. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 52. A binomial heap with n = 13 nodes consists of ……….. Tree.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 248/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 53. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 54. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 55. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 56. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 249/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 57. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 58. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 59. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 60. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 1. Merge sort uses which of the following technique to implement sorting?

A : Backtracking

B : Greedy Algorithm
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 250/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Divide And Conquer

D : Dynamic Programming

Q.no 2. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 3. What is the worst case time complexity of merge sort?

A : O(n log n)

B : O(n^2)

C : O(n^2 log n)

D : O(n log n^2)

Q.no 4. What does the algorithmic analysis count?

A : The number of arithmetic and the operations that are required to run the program

B : The number of lines required by the program

C : The number of seconds required by the program to execute

D : The size of the input

Q.no 5. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}

A : O(N)

B : O(N*log(N))

C : O(N * Sqrt(N))

D : O(N*N)

Q.no 6. Alorithm should have finite number of steps

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 251/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : true

B : false

C:

D:

Q.no 7. Genetic algorithm uses

A : Natural Functions

B : Fitness Functions

C : Minimize Objective Functions

D : Member Function

Q.no 8. Which of the following methods can be used to solve the Knapsack problem?

A : Brute force algorithm

B : Recursion

C : Dynamic programming

D : Brute force, Recursion and Dynamic Programming

Q.no 9. The choice of polynomial class has led to the development of an extensive theory called
________

A : computational complexity

B : time complexity

C : problem complexity

D : decision complexity

Q.no 10. Matrix chain multiplication problem is solved by which approach?

A : Divide And Conquer

B : Dynamic Programming

C : Backtracking

D : Greedy Approach

Q.no 11. Which of the following statements is true?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 252/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 12. What’s happen if base condition is not defined in recursion ?

A : stack underflow

B : stack overflow

C : both

D:

Q.no 13. def f():

int a[n][n]
// Finding sum of elements of a matrix that are above or on the diagonal.
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
Time Complexity of this program:

A : O(n)

B : O(nlogn)

C : O(n^2)

D : O(n^3)

Q.no 14. When an algorithm is written in the form of a specific programming language, it
becomes a _________

A : Pseudocode

B : Programme

C:

D:

Q.no 15. Fill in the blank. The notion of correctness for approximation algorithms is
…………...straightforward
than it is for exact algorithms

A : More
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 253/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Less

C:

D:

Q.no 16. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

Q.no 17. What is adaline in neural networks?

A : Adaptive Linear Element

B : Automatic Linear Element

C : Adaptive Line Element

D : Adaptive Nonlinear Element

Q.no 18. Binomial tree with zero order has only

A : 1 Node

B : 2 Nodes

C : 3 Nodes

D : 4 Nodes

Q.no 19. What is the average case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 20. The algorithm that do NOT have O(1) time complexity is____

A : Multiplying two numbers.

B : assigning some value to a variable

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 254/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : displaying some integer on console

D : Addition of n numbers

Q.no 21. The term ________ refers to all state space search methods in which all children of the –
nodes are generated before any other live node can become the E-node.

A : Backtacking

B : Depth First Search

C : Branch And Bound

D : Breadth First Search

Q.no 22. What is the basic principle in Rabin Karp algorithm?

A : Sorting

B : Hashing

C : Augmenting

D : Dynamic Programming

Q.no 23. The type of encoding where no character code is the prefix of another character code is
called?

A : optimal encoding

B : prefix encoding

C : Fequency encoding

D : Trie encoding

Q.no 24. Power saving is an important job in embedded systm and sensor network.

A : true

B : false

C:

D:

Q.no 25. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 255/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 26. Consider the following three claims

1. (n + k)m = Θ(nm), where k and m are constants

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
Which of these claims are correct ?

A : 1 and 2

B : 1 and 3

C : 2 and 3

D : 1, 2, and 3

Q.no 27. Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of

knapsack=20. Find the
maximum value output assuming items to be divisible.

A : 60

B : 80

C : 100

D : 40

Q.no 28. Which of the following method is used for sorting in merge sort?

A : Merging

B : Partitioning

C : Selection

D : Exchanging

Q.no 29. A strand of maximal length is called as ______________

A : Process

B : Work

C : Thread

D : Span

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 256/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 30.

A : 10

B:1

C : 10 9 8 ……1 0

D : 10 9 8 ……1

Q.no 31. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 32. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 33. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 257/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 160

B : 200

C : 170

D : 90

Q.no 34. What is the purpose of using randomized quick sort over standard quick sort?

A : To reduce worst case space complexity

B : To reduce worst case time complexity

C : To improve average case time complexity

D : To improve accuracy

Q.no 35. If T= abcabaabc & P= abaa then what will be the value of s?

A:4

B:2

C:3

D:1

Q.no 36. Which of the following statements about loop invariants is false?

A : Loop invariants are used to show that algorithms produce the correct results.

B : A loop invariant is the opposite, that is the negation, of the condition of the loop.

C : To prove that a statement is a loop invariant, we use mathematical induction.

D : Loop invariants remain true each time a loop is executed.

Q.no 37. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

Q.no 38. The time taken by nondeterministic sorting algorithm is ______

A : O(1)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 258/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 39. The Worst case occur in linear search algorithm when

A : Item is somewhere in the middle of the array

B : Item is not in the array at all

C : Item is the first element in the array

D : Item is the last element in the array or is not there at all

Q.no 40. Problems that can be solved in polynomial time are known as ……… problems.

A : Intractable

B : Tractable

C : Undecidable

D : Decidable

Q.no 41. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 42. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 43. Tabu search is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 259/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 44. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 45. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 46. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 47. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 260/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 48. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 49. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 50. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 51. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 52. If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.

A : Overlapping Subproblems

B : Optimal Substructure
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 261/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Memoization

D : Greedy

Q.no 53. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 54. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 55. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 56. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 57. Assertion is

A : statement that is true all the time

B : statement about state of program

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 262/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : statement describing program statement

D:

Q.no 58. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 59. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 60. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 1. Recursive function must have

A : switch -case

B : exit condition

C : loop

D:

Q.no 2. For the improvement of efficiency of quick sort the pivot can be____

A : the first element

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 263/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : the middle element

C : the last element

D : any random element

Q.no 3. _____is the minimum number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 4. Which of the following problems should be solved using dynamic programming?

A : Mergesort

B : Binary search

C : Longest Common Subsequence

D : Quicksort

Q.no 5. Dijkstra’s Algorithm cannot be applied on ………….

A : Directed and weighted graphs

B : Graphs having negative weight function

C : Unweighted graphs

D : Undirected and unweighted graphs

Q.no 6. In Huffman coding, data in a tree is always present at?

A : Roots

B : Leafs

C : Left Sub Trees

D : Right Sub Trees

Q.no 7. parallel algorithms that can run on a ____________ that permits multiple instructions to
execute concurrently

A : Uniprocessor

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 264/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Serial Computer

C : Mainframe Computer

D : Multiprocessor computer

Q.no 8. In recursion, the condition for which the function will stop calling itself is?

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 9. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 10. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 11. What is the time complexity of Dijikstra’s algorithm?

A : O(n)

B : O(n^3)

C : O(n^2)

D : O(log n)

Q.no 12. Branch and bound is a __________

A : Problem Solving Technique

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 265/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Data Structure

C : Sorting Algorithm

D : Type Of Tree

Q.no 13. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 14. Choose the correct option

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iterative function is always better and simpler to write than recursion

Q.no 15. Pseudocode is______________

A : Language dependent

B : Language independent

C:

D:

Q.no 16. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra's shortest path algorithm

B : Prim's algorithm

C : Kruskal algorithm

D : Bellmen Ford Shortest path algorithm

Q.no 17. What is order of resultant heap after merging two trees of order k in binomial heap?

A : 2*k

B : k+1
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 266/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : k*k

D : k + log k

Q.no 18. The fundamental unit of neural network is

A : Brain

B : Nucleus

C : Neuron

D : Axon

Q.no 19. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 20. The problem of finding a path in a graph that visits every vertex exactly once is called?

A : Hamiltonian cycle problem

B : Hamiltonian path problem

C : Subset sum problem

D : Turnpike reconstruction problem

Q.no 21. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 22. An algorithm that always runs in polynomial time but possibly returns erroneous
answers is called a …………

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 267/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 23. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 24. 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

Q.no 25. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 26. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1

B:2

C:3

D:4

Q.no 27. what are the basic rules of recursion

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 268/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Each recursive call should be on a smaller instance of the same problem, that is, a smaller
subproblem

B : The recursive calls must eventually reach a base case, which is solved without further recursion.

C : both 1 and 2

D : Either 1 or 2

Q.no 28. Proof by contradiction is also known as

A : inverse proof

B : indirect proof

C : reverse proof

D:

Q.no 29. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 30. Simulated annealing (SA) is

A : A Probabilistic Technique For Approximating The Global Optimum Of A Given Function

B : It Is A Exact Local Optimization In A Small Search Space For Problem

C : The Energy (Goal) Function Is Not Used

D : It Is Not Used When The Search Space Is Discrete

Q.no 31. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : C, B ,A

D : B,A, C

Q.no 32. Which of these is false about recursion?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 269/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : Recursive function can be replaced by a non-recursive function

B : Recursive functions usually take more memory space than non-recursive function

C : Recursive functions run faster than non-recursive function

D : Recursion makes programs easier to understand

Q.no 33. In dynamic programming, the technique of storing the previously calculated values is
called ___________

A : Saving Value Property

B : Storing Value Property

C : Memoization

D : Mapping

Q.no 34. Which of the following is/are property/properties of a dynamic programming problem?

A : Evolutionary Approach

B : Require More Time

C : Greedy Approach

D : Optimal Substructure And Overlapping Subproblems

Q.no 35. which is not the important aspect of Loop

A : Initial condition

B : nested loop

C : invariant relation

D : termination

Q.no 36. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 37. The number of trees in a binomial heap with n nodes is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 270/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : log n

B:n

C : n log n

D : n/2

Q.no 38. What is work?

A : Execution time of single thread

B : Average of all threads

C : Sum of the times taken by each thread

D : Sum of the times taken by child threads only

Q.no 39. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 40. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection

D : Multiplication

Q.no 41. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 271/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 42. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 43. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 44. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 45. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 46. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 272/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 47. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 48. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 49. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 50. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 51. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 273/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 52. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 53. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 54. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 55. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 274/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 56. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 57. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 58. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 59. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 60. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 275/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 10*30

D : 10*20*30

Q.no 1. Which of the following problems is NOT NP complete?

A : Hamiltonian circuit

B : Bin packing

C : Partition problem

D : Halting problem

Q.no 2. If t1 (n) = O(f(n)), t2 (n)= O(g(n)). Then t1 (n).t2 (n)=_____

A : O(f(n))

B : O(g(n))

C : O(f(n)g(n))

D : O(f(n)+ g(n))

Q.no 3. If a problem X is in NP and a polynomial time algorithm for X could also be used to solve
problem Y in polynomial time, then Y is also in NP

A : true

B : false

C:

D:

Q.no 4. Dijkstra algorithm, which solves the single-source shortest--paths problem, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 5. What is the type of the algorithm used in solving the 8 Queens problem?

A : Backtracking

B : Dynamic Programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 276/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Branch And Bound

D : Divide And Conquer

Q.no 6. When an algorithm is written in the form of a specific programming language, it becomes
a _________

A : Pseudocode

B : Programme

C:

D:

Q.no 7. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 8. What is best case complexity of selection sort

A:n

B : n^2

C : nlogn

D:

Q.no 9. Which of the following standard algorithms is not a Greedy algorithm?

A : Dijkstra’s shortest path algorithm

B : Prim’s algorithm

C : Huffman Coding

D : Bellmen Ford Shortest path algorithm

Q.no 10. What is tail recursion?

A : A recursive function that has two base cases

B : A function where the recursive functions leads to an infinite loop

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 277/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : A recursive function where the function doesn’t return anything and just prints the values

D : A function where the recursive call is the last thing executed by the function

Q.no 11. Hamiltonian path problem is _________

A : NP problem

B : N class problem

C : P class problem

D : NP complete problem

Q.no 12. What is the objective of the knapsack problem?

A : To Get Maximum Total Value In The Knapsack

B : To Get Minimum Total Value In The Knapsack

C : To Get Maximum Weight In The Knapsack

D : To Get Minimum Weight In The Knapsack

Q.no 13. Which of the following methods can be used to solve the longest common subsequence
problem?

A : Not Recursion

B : Dynamic Programming

C : Branch And Bound

D : Greedy Algorithm

Q.no 14. What approach is being followed in Floyd Warshall Algorithm?

A : Greedy Technique

B : Dynamic Programming

C : Linear Programming

D : Backtracking

Q.no 15. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ f(n) ≤ c.g(n), for
all n ≥ n0

A : Θ(g(n))

B : O(g(n))

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 278/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Ω(g(n))

D : Little o(g(n))

Q.no 16. Which of the following can traverse the state space tree only in DFS manner?

A : Branch And Bound

B : Dynamic Programming

C : Greedy Algorithm

D : Backtracking

Q.no 17. Operations in the neural networks can perform what kind of operations?

A : Not In Serial

B : Not In Parallel

C : Serial Or Parallel

D : Partial

Q.no 18. Alorithm should have finite number of steps

A : true

B : false

C:

D:

Q.no 19. The best data structure to check whether an arithmetic expression has balanced
parentheses is a

A : queue

B : stack

C : tree

D : list

Q.no 20. Fractional knapsack problem is also known as

A : 0/1 knapsack problem

B : Continuous knapsack problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 279/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Divisible knapsack problem

D : Non continuous knapsack problem

Q.no 21. The first step of the genetic algorithm is

A : Applying Selection Of Letter

B : Applying Crossover Operator

C : Applying Nutrition Operator

D : Generated Initial Population

Q.no 22. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 23. Let X be a problem that belongs to the class NP. Then which one of the following is
TRUE?

A : There is no polynomial time algorithm for X.

B : If X can be solved deterministically in polynomial time, then P = NP.

C : If X is NP-hard, then it is NP-complete.

D : X may be undecidable.

Q.no 24. Which one of the following is true about Binary search?

A : the best-case occurs when the target item is in the beginning of the search list

B : the best-case occurs when the target is at the end of the search list

C : the worst-case is when the target item is not in the search list

D : the worst-case is when the target is found in the middle of the search list

Q.no 25. Mathematical induction proves

A : Correctness of algorithm

B : Efficiency of algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 280/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : both

D:

Q.no 26. What is base case in the given code?

A : Fn(10)

B : return

C : if (n==0)

D : Fn(n-1)

Q.no 27. Time complexity of fractional knapsack problem is

A : O(n log n)

B : O(n)

C : O(1)

D : O(nW)

Q.no 28. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

Q.no 29. From the following which is not return optimal solution

A : Dynamic programming

B : Backtracking

C : Branch and bound

D : Greedy method

Q.no 30. Which data structure is most suitable for implementing best first branch and bound
strategy?

A : Stack

B : Queue

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 281/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Priority Queue

D : Linked List

Q.no 31. Time taken in decreasing the node value in a binomial heap is

A : O(n)

B : O(1)

C : O(log n)

D : O(n log n)

Q.no 32. job sequencing with deadline is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 33. Generally greedy algorithms are are in nature of

A : Iterative

B : Recursive

C : Both A and B

D : Neither A Nor B

Q.no 34. The parallelism of a multithreaded computation is given by

A : T1 / Tp

B : T1 / T∞

C : T∞/T1

D : Tp / T1

Q.no 35. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using

A : Central tendency

B : Differential equation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 282/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Order of execution

D : Order of Storage

Q.no 36. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : A, C, B

D : B,A, C

Q.no 37. Multithreaded computation can be better understood with the help of a

A : Computation undirected acyclic graph

B : Computation directed cyclic graph

C : Computation directed acyclic graph

D : Computation undirected cyclic graph

Q.no 38. The Knapsack problem where the objective function is to minimize the profit is______

A : Greedy

B : Dynamic Programming

C : Back Tracking

D : Branch & Bound

Q.no 39. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 40. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 283/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : divide and conquer

Q.no 41. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 42. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 43. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 44. 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

Q.no 45. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 284/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 46. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 47. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 48. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 49. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 285/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 50. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 51. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 52. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 53. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 54. Assertion is

A : statement that is true all the time

B : statement about state of program

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 286/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : statement describing program statement

D:

Q.no 55. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 56. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 57. Time complexity of fractional knapsack problem is?

A : O(n log n)

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 58. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 59. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 287/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 60. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 1. Keywords________indicates that iteration of the loop may run concurrently.

A : Parallel loop

B : Thread

C : Parallel for

D : Multithreading

Q.no 2. Which of the following is not characteristic of Algorithm

A : Definiteness

B : finiteness

C : scalability

D : effectiveness

Q.no 3. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’

A : NP problems

B : P problem

C : NP complete problem

D : NP hard problem

Q.no 4. Which is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.

A : Debugging

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 288/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Profiling

C : Conquer

D : Combining

Q.no 5. Which of the following algorithm can be used to solve the Hamiltonian path problem
efficiently?

A : branch and bound

B : iterative improvement

C : divide and conquer

D : greedy algorithm

Q.no 6. Algorithm must produce one output

A : true

B : false

C:

D:

Q.no 7. In the absence of a exit condition in a recursive function, the following error is given by?

A : Compile time error

B : Run time error

C : Logical error

D : No error

Q.no 8. Steps of Divide and Conquer approach are______

A : Divide, Conquer And Combine

B : Combine, Conquer and Divide

C : Combine, Divide And Conquer

D : Divide, Combine And Conquer

Q.no 9. Genetic algorithm uses

A : Natural Functions

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 289/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Fitness Functions

C : Minimize Objective Functions

D : Member Function

Q.no 10. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 11. For the improvement of efficiency of quick sort the pivot can be____

A : the first element

B : the middle element

C : the last element

D : any random element

Q.no 12. Recursion is a method in which the solution of a problem depends on?

A : Larger instances of different problems

B : Larger instances of the same problem

C : Smaller instances of the same problem

D : Smaller instances of different problems

Q.no 13. What’s happen if base condition is not defined in recursion ?

A : stack underflow

B : stack overflow

C : both

D:

Q.no 14. Which data structure is used for implementing a LIFO branch and bound strategy?

A : Stack

B : Queue
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 290/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Array

D : Linked List

Q.no 15. Which strategy is followed by QuickSort?

A : Greedy strategy

B : Brute Force technique

C : Dynamic programming

D : Divide and conquer

Q.no 16. The best suited algorithm could be decided using proof technique

A : false

B : true

C:

D:

Q.no 17. In Huffman coding, data in a tree is always present at?

A : Roots

B : Leafs

C : Left Sub Trees

D : Right Sub Trees

Q.no 18. Which of the following algorithms has worst time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 19. The complexity of Binary search algorithm is___

A : O(n)

B : O(log n)

C : O( n^2)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 291/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : O(n log n)

Q.no 20. In artificial Neural Network interconnected processing elements are called

A : Nodes Or Neurons

B : Weights

C : Axons

D : Soma

Q.no 21. The speed up of a computation on P processors is defined as

A : T1 / T∞

B : T1 / Tp

C : Tp / T1

D : T∞/T1

Q.no 22. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?

A : P is infinite set

B : P is finite set

C:

D:

Q.no 23. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 24. what are the basic rules of recursion

A : Each recursive call should be on a smaller instance of the same problem, that is, a smaller
subproblem

B : The recursive calls must eventually reach a base case, which is solved without further recursion.

C : both 1 and 2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 292/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Either 1 or 2

Q.no 25. Loop invariant is inert assertion and not useful in analysis of program.

A : true

B : false

C:

D:

Q.no 26. Genetic algorithm is

A : A Intelligent Simple Specified Search Technique

B : Used To Solve Non Optimization Problem

C : Is A Part Of Evolutionary Computing

D : Simulated Annealing

Q.no 27. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 28. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 29. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.

A : greedy method

B : branch and bound

C : dynamic programming

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 293/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : divide and conquer

Q.no 30. Choose the correct steps required to prove that a problem is NP complete?

A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.

B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.

C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
question in polynomial time.

D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.

Q.no 31. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

D : O(n-1)

Q.no 32. Consider the following function f:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
What is the asymptotic complexity in terms of n? (Pick the smallest correct answer)

A : O(nlog n)

B : O(n^2 )

C : O(n)

D : O(log n )

Q.no 33. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex
Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 294/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 34. Parallel loops are like an ordinary_______________except that the iterations of the loop
can execute concurrently.

A : While loop

B : For Loop

C : Do while loop

D : If statement

Q.no 35. loop termination condition along with what makes loop correct

A : loop condition

B : loop increment variable

C : loop invariant

D : none of these

Q.no 36. Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of

knapsack=20. Find the
maximum value output assuming items to be divisible.

A : 60

B : 80

C : 100

D : 40

Q.no 37. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 295/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 38. Which of the following problems is similar to that of a Hamiltonian path problem?

A : knapsack problem

B : closest pair problem

C : travelling salesman problem

D : assignment problem

Q.no 39. which of the following is not a characteristics of good algorithm

A : precise

B : Ambigous

C : finite number of steps

D : logical flow of control

Q.no 40. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

Q.no 41. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 42. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 296/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 43. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 44. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 45. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 46. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 297/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 47. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 48. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 49. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 50. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 51. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 298/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : 13

Q.no 52. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 53. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 54. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 55. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 56. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 299/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 57. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 58. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 59. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 60. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 1. To solve one problem how many algorithms are possible?

A : one

B : two

C : several

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 300/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 2. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

A : true

B : false

C:

D:

Q.no 3. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}

A : O(N)

B : O(N*log(N))

C : O(N * Sqrt(N))

D : O(N*N)

Q.no 4. Example of O(n) algorithms is______________

A : Multiplying two numbers.

B : linear search

C : assigning a value to a variable

D : displaying some integer on console

Q.no 5. The algorithm that do NOT have O(1) time complexity is____

A : Multiplying two numbers.

B : assigning some value to a variable

C : displaying some integer on console

D : Addition of n numbers

Q.no 6. The choice of polynomial class has led to the development of an extensive theory called
………

A : time complexity
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 301/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : space complexity

C : computational complexity

D : problem complexity

Q.no 7. The problem of finding a path in a graph that visits every vertex exactly once is called?

A : Hamiltonian cycle problem

B : Hamiltonian path problem

C : Subset sum problem

D : Turnpike reconstruction problem

Q.no 8. Heap can be used as ……………….

A : Priority queue

B : Stack

C : A decreasing order array

D : Normal Array

Q.no 9. Which data structure is used for implementing a FIFO branch and bound strategy?

A : Stack

B : Queue

C : Array

D : Linked List

Q.no 10. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 11. What is the best case time complexity of binary search?

A : O(n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 302/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 12. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 13. Crossover, mutation, and selection are the

A : Operators Of Genetic

B : Functions of Genetic

C : Population Of Genetic

D : Member Function

Q.no 14. Two main measure of efficiency of an algorithm

A : processor and memory

B : time and space

C : date and space

D : date and capacity

Q.no 15. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 16. In Huffman coding, data in a tree always occur?

A : roots

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 303/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : leaves

C : left sub trees

D : right sub trees

Q.no 17. Recursion is similar to which of the following?

A : Switch Case

B : Loop

C : If else

D : if elif else

Q.no 18. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?

A : NP

B:P

C : Hard

D : Complete

Q.no 19. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

Q.no 20. Which Data Structure is used to perform Recursion?

A : Array

B : queue

C : stack

D : linked list

Q.no 21. Which of the following statements about loop invariants is false?

A : Loop invariants are used to show that algorithms produce the correct results.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 304/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : A loop invariant is the opposite, that is the negation, of the condition of the loop.

C : To prove that a statement is a loop invariant, we use mathematical induction.

D : Loop invariants remain true each time a loop is executed.

Q.no 22. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.

A : Minimum & Maximum problem

B : Knapsack problem

C : Selection problem

D : Merge sort

Q.no 23. The Worst case occur in linear search algorithm when

A : Item is somewhere in the middle of the array

B : Item is not in the array at all

C : Item is the first element in the array

D : Item is the last element in the array or is not there at all

Q.no 24. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?

A : 160

B : 200

C : 170

D : 90

Q.no 25. The number of trees in a binomial heap with n nodes is

A : log n

B:n

C : n log n

D : n/2

Q.no 26. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 305/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A:1

B:2

C:3

D:4

Q.no 27. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 28. Multithreaded computation can be better understood with the help of a

A : Computation undirected acyclic graph

B : Computation directed cyclic graph

C : Computation directed acyclic graph

D : Computation undirected cyclic graph

Q.no 29. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

Q.no 30. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 306/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 31. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 32. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 33. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

Q.no 34. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using

A : Central tendency

B : Differential equation

C : Order of execution

D : Order of Storage

Q.no 35. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 307/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : proof by deduction

C : proof by contradiction

D:

Q.no 36. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions

A : Dynamic Programming

B : Backtracking

C : Branch And Bound

D : Greedy Method

Q.no 37. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 38. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 39. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 40. Which of the following problems is equivalent to the 0-1 Knapsack problem?

A : You are given a bag that can carry a maximum weight of W. You are given N items which have a
weight of {w1, w2, w3,…., wn} and a value of {v1, v2, v3,…., vn}. You can break the items into

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 308/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

smaller pieces. Choose the items in such a way that you get the maximum value

B : You are studying for an exam and you have to study N questions. The questions take {t1, t2, t3,….,
tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. You can study for a maximum of T hours.
You can either study a question or leave it. Choose the questions in such a way that your score is
maximized

C : You are given infinite coins of denominations {v1, v2, v3,….., vn} and a sum S. You have to find
the minimum number of coins required to get the sum S

D : You are given a suitcase that can carry a maximum weight of 15kg. You are given 4 items which
have a weight of {10, 20, 15,40} and a value of {1, 2, 3,4}. You can break the items into smaller
pieces. Choose the items in such a way that you get the maximum value

Q.no 41. 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

Q.no 42. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 43. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 44. Time complexity of fractional knapsack problem is?

A : O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 309/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 45. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 46. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 47. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 48. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 49. Genetic Algorithm is a part of

A : Not Evolutionary Computing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 310/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 50. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 51. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 52. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 53. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 311/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 54. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 55. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 56. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 57. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 58. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 312/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : The code will show a compile time error

Q.no 59. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 60. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 1. Genetic algorithms are

A : Adaptive Heuristic Search Algorithm

B : Binary search algorithm

C : Simulated Annealing

D : Adaptive Linear

Q.no 2. if x and y are Irrational numbers then x**y is

A : Rational

B : Irrational

C:

D:

Q.no 3. Recursive function must have

A : switch -case

B : exit condition

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 313/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : loop

D:

Q.no 4. What is the average case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 5. Which of the following statements is true?

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 6. What approach is being followed in Floyd Warshall Algorithm?

A : Greedy Technique

B : Dynamic Programming

C : Linear Programming

D : Backtracking

Q.no 7. Dijkstra’s Algorithm cannot be applied on ………….

A : Directed and weighted graphs

B : Graphs having negative weight function

C : Unweighted graphs

D : Undirected and unweighted graphs

Q.no 8. Which of the following methods can be used to solve the Knapsack problem?

A : Brute force algorithm

B : Recursion

C : Dynamic programming
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 314/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Brute force, Recursion and Dynamic Programming

Q.no 9. What term is used to describe O(n) algorithm?

A : Constant

B : Non polynomial deterministic

C : logarithmic

D : linear

Q.no 10. In Algorithm Specification the blockes are indicated with matching

A : Braces

B : Parenthesis

C : Square Brackets

D : Slashes

Q.no 11. In a max-heap, element with the greatest key is always in the which node?

A : Leaf node

B : First node of left sub tree

C : Root node

D : First node of right sub tree

Q.no 12. steps followed in mathematical induction are 1)basis 2)Induction step 3) Induction
hypothesis

A : steps 1and 2 only

B : steps 2 and 3 only

C : steps 1,2, 3

D : steps 1 and 3 only

Q.no 13. Merge sort uses which of the following technique to implement sorting?

A : Backtracking

B : Greedy Algorithm

C : Divide And Conquer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 315/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Dynamic Programming

Q.no 14. The time factor when determining the efficiency of algorithm is measured by

A : Counting microseconds

B : Counting the number of key operations

C : Counting the kilobytes of algorithm

D:

Q.no 15. Fill in the blank. The notion of correctness for approximation algorithms is
…………...straightforward
than it is for exact algorithms

A : More

B : Less

C:

D:

Q.no 16. Algorithm can be represented as

A : Pseudocode

B : Flowchart

C : None of the above

D : both 1and 2

Q.no 17. Which of the following algorithms has better time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 18. Binomial tree with zero order has only

A : 1 Node

B : 2 Nodes

C : 3 Nodes

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 316/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : 4 Nodes

Q.no 19. In recursion, the condition for which the function will stop calling itself is?

A : Best case

B : Worst case

C : Base case

D : There is no such condition

Q.no 20. What is the worst case time complexity of merge sort?

A : O(n log n)

B : O(n^2)

C : O(n^2 log n)

D : O(n log n^2)

Q.no 21. In the principle of mathematical induction, which of the following steps is mandatory?

A : induction hypothesis

B : induction reference

C : induction set assumption

D:

Q.no 22. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 23. subjective decision is important aspect of algorithm

A : true

B : false

C:

D:
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 317/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 24. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 25. Choose the correct steps to prove if the 3 SAT CNF problem is NP-Complete. I-- SAT
problem is in NP II--3 SAT CNF problem is in NP III--Prove that SAT ≤ 3 SAT CNF Problem in
polynomial time IV---Prove that 3 SAT CNF problem ≤ SAT Problem in polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 26. The Knapsack problem where the objective function is to minimize the profit is

A : Greedy

B : Dynamic 0 / 1

C : Back tracking

D : Branch & Bound 0/1

Q.no 27. Which data structure has a better amortized running time than others?

A : Queue

B : Stack

C : Priority Queue

D : List

Q.no 28. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 318/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 29. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

D : 1,3,7,4,8,5,9,10

Q.no 30. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?

A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible

B : Both are the same

C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming

D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible

Q.no 31. The first step of the genetic algorithm is

A : Applying Selection Of Letter

B : Applying Crossover Operator

C : Applying Nutrition Operator

D : Generated Initial Population

Q.no 32. Which of the following branch and bound strategy leads to depth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 33. The term ________ refers to all state space search methods in which all children of the –
nodes are generated before any other live node can become the E-node.

A : Backtacking

B : Depth First Search

C : Branch And Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 319/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Breadth First Search

Q.no 34. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 35. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 36. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 37. Running the program many times is sufficient to prove the correctness of program

A : true

B : false

C:

D:

Q.no 38. In dynamic programming, the technique of storing the previously calculated values is
called ___________

A : Saving Value Property

B : Storing Value Property

C : Memoization

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 320/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Mapping

Q.no 39. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

Q.no 40. Time taken in decreasing the node value in a binomial heap is

A : O(n)

B : O(1)

C : O(log n)

D : O(n log n)

Q.no 41. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 42. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 43. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 321/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : 13

Q.no 44. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 45. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 46. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

B : 270

C : 290

D : 130

Q.no 47. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 48. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 322/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 49. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 50. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 51. algorithms performance is characterized by

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 52. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 323/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : O( n)

D : O(log n)

Q.no 53. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 54. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 55. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 56. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 57. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 324/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : R.J.Walker

D : S. Golomb

Q.no 58. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 59. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 60. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 1. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.

A : true

B : false

C:

D:

Q.no 2. Which of the following problems is NOT NP complete?

A : Hamiltonian circuit

B : Bin packing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 325/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Partition problem

D : Halting problem

Q.no 3. The space factor when determining the efficiency of algorithm is measured by

A : Counting the maximum memory needed by the algorithm

B : Counting the minimum memory needed by the algorithm

C : Counting the average memory needed by the algorithm

D : Counting the maximum disk space needed by the algorithm

Q.no 4. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices

A : true

B : false

C:

D:

Q.no 5. Fibonacci heap has better amortized running time compared to a binomial heap.

A : true

B : false

C:

D:

Q.no 6. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?

A : NP

B:P

C : Hard

D : Complete

Q.no 7. q29.jpeg

A : 111

B : 101

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 326/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : 110

D : 11

Q.no 8. Which of the following can traverse the state space tree only in DFS manner?

A : Branch And Bound

B : Dynamic Programming

C : Greedy Algorithm

D : Backtracking

Q.no 9. Dijkstra algorithm, which solves the single-source shortest--paths problem, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 10. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 11. To which of the following class does a CNF-satisfiability problem belong?

A : NP class

B : P class

C : NP Complete

D : NP Hard

Q.no 12. In a binomial heap the root value is greater than left child and less than right child.

A : true

B : false

C:
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 327/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 13. _____is the average number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 14. If t1 (n) = O(f(n)), t2 (n)= O(g(n)). Then t1 (n).t2 (n)=_____

A : O(f(n))

B : O(g(n))

C : O(f(n)g(n))

D : O(f(n)+ g(n))

Q.no 15. Problems that can be solved in polynomial time are known as?

A : intractable

B : tractable

C : decision

D : complete

Q.no 16. Operations in the neural networks can perform what kind of operations?

A : Not In Serial

B : Not In Parallel

C : Serial Or Parallel

D : Partial

Q.no 17. In Huffman coding, data in a tree is always present at?

A : Roots

B : Leafs

C : Left Sub Trees

D : Right Sub Trees

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 328/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 18. Crossover, mutation, and selection are the

A : Operators Of Genetic

B : Functions of Genetic

C : Population Of Genetic

D : Member Function

Q.no 19. All the iterations in the parallel loop should be __________

A : Independent

B : Dependent

C:

D:

Q.no 20. Master theorem applies to recurrences of the form (a=1 and b>1) are two constants.
Select one:

A : T(N)=A.T(N/B)+F(N)

B : T(n)=n.T(n/2)+b.f(n)

C : T(N)=A.T(N-1)+B

D : T(N)=N.T(N-3)+B

Q.no 21. Which of the following problems can’t be solved using recursion?

A : Factorial of a number

B : Nth fibonacci number

C : Length of a string

D : Problems without base case

Q.no 22. Time complexity of fractional knapsack problem is

A : O(n log n)

B : O(n)

C : O(1)

D : O(nW)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 329/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 23.

A : 10

B:1

C : 10 9 8 ……1 0

D : 10 9 8 ……1

Q.no 24. Choose the option with function having same complexity for a Fibonacci heap.

A : Insertion, Merge

B : Insertion, Deletion

C : ExtractMin, Insertion

D : Merge, Deletion

Q.no 25. Which one of the following is true about Binary search?

A : the best-case occurs when the target item is in the beginning of the search list

B : the best-case occurs when the target is at the end of the search list

C : the worst-case is when the target item is not in the search list

D : the worst-case is when the target is found in the middle of the search list

Q.no 26. Proof by contradiction is also known as

A : inverse proof

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 330/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : indirect proof

C : reverse proof

D:

Q.no 27. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 28. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.

A : proof by induction

B : proof by deduction

C : proof by contradiction

D:

Q.no 29. What are desirable characteristics of Algorithm with efficiency 1)Generality 2)
Availability 3) Simplicity

A : 1 and 2

B : 2 and 3

C : 1 and 3

D:

Q.no 30. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 331/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 31. Consider the following three claims

1. (n + k)m = Θ(nm), where k and m are constants

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
Which of these claims are correct ?

A : 1 and 2

B : 1 and 3

C : 2 and 3

D : 1, 2, and 3

Q.no 32. 0/1 knapsack is based on which method?

A : greedy method

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 33. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?

A:9

B : 13

C : 11

D : 10

Q.no 34. When a thread u spawns a new thread v, then (u,v) is called a

A : Simple edge

B : Return edge

C : Continuation edge

D : spawn edge

Q.no 35. Problems that can be solved in polynomial time are known as ……… problems.

A : Intractable

B : Tractable

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 332/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Undecidable

D : Decidable

Q.no 36. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : A, C, B

D : B,A, C

Q.no 37. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 38. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:

A : There is a checking algorithm for C.

B : Every instance of C maps to an instance of SAT.

C : Every instance of SAT maps to an instance of C.

D : C does not have an efficient algorithm.

Q.no 39. What is the pre-processing time of Rabin and Karp Algorithm?

A : Theta(m2)

B : Theta(mlogn)

C : Theta(m)

D : Big-Oh(n)

Q.no 40. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 333/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : O(n)

B : O(nLogn)

C : O(n^2)

D : O(n^2Logn)

Q.no 41. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 42. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 43. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 44. 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

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 334/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Greedy

Q.no 45. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 46. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 47. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 48. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 49. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 335/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : C) Non Associative

D : D) The Acceptance Probability Function Is Used

Q.no 50. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 51. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 52. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 53. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 54. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 336/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 55. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 56. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 57. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 58. What are the parameters of annealing?

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 59. Time complexity of fractional knapsack problem is?

A : O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 337/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 60. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

D:

Q.no 1. goto statement is?

A : Used to jump the control of program.

B : Used for iteration

C : same as switch statement

D : Not Used for iteration

Q.no 2. Who created the Rabin Karp Algorithm?

A : Joseph Rabin and Michael Karp

B : Michael Rabin and Joseph Karp

C : Richard Karp and Michael Rabin

D : Michael Karp and Richard Rabin

Q.no 3. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

A : true

B : false

C:

D:

Q.no 4. Fractional knapsack is based on which method?

A : greedy method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 338/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 5. Which of the following algorithms is the best approach for solving Huffman codes?

A : Exhaustive Search

B : Greedy Algorithm

C : Brute Force Algorithm

D : Divide And Conquer Algorithm

Q.no 6. The choice of polynomial class has led to the development of an extensive theory called
________

A : computational complexity

B : time complexity

C : problem complexity

D : decision complexity

Q.no 7. Recursion is similar to which of the following?

A : Switch Case

B : Loop

C : If else

D : if elif else

Q.no 8. Hamiltonian path problem is _________

A : NP problem

B : N class problem

C : P class problem

D : NP complete problem

Q.no 9. Fractional knapsack problem is also known as

A : 0/1 knapsack problem

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 339/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Continuous knapsack problem

C : Divisible knapsack problem

D : Non continuous knapsack problem

Q.no 10. waiting for the hardware advancements are always fruitful than finding the better
algorithm

A : true

B : false

C:

D:

Q.no 11. Which algorithm design strategy is followed by Dijkstra’s Algorithm?

A : Greedy strategy

B : Branch and bound

C : Backtracking

D : Dynamic programming

Q.no 12. Two main measures for the efficiency of an algorithm are

A : Processor and memory

B : Complexity and capacity

C : Time and Space

D : Speed and Storage

Q.no 13. Dijkstra’s Algorithm is used to solve ………. problems.

A : All pair shortest path

B : Single source shortest path

C : Network flow

D : Sorting

Q.no 14. What’s happen if base condition is not defined in recursion ?

A : stack underflow

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 340/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : stack overflow

C : both

D:

Q.no 15. The choice of polynomial class has led to the development of an extensive theory called
………

A : time complexity

B : space complexity

C : computational complexity

D : problem complexity

Q.no 16. The Data structure used in standard implementation of Breadth First search
is___________

A : Stack

B : Queue

C : Linked List

D : Tree

Q.no 17. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.

A : True

B : FALSE

C:

D:

Q.no 18. Which of the following algorithms has better time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 19. Which data structure is used for implementing a FIFO branch and bound strategy?

A : Stack

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 341/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Queue

C : Array

D : Linked List

Q.no 20. Algorithm must have atleast one external input

A : true

B : false

C:

D:

Q.no 21. What is base case in the given code?

A : F1()

B : return

C : both

D : neither 1 nor 2

Q.no 22. which of the following is not a characteristics of good algorithm

A : precise

B : Ambigous

C : finite number of steps

D : logical flow of control

Q.no 23. loop termination condition along with what makes loop correct

A : loop condition

B : loop increment variable

C : loop invariant

D : none of these

Q.no 24. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….

A : logarithmic and linear time constant respectively

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 342/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : constant and linear time respectively

C : constant and quadratic time respectively

D : constant and logarithmic time respectively

Q.no 25. What is the time complexity of Huffman Coding?

A : O(n)

B : O(NlogN)

C:

D:

Q.no 26. Which of the following is/are property/properties of a dynamic programming problem?

A : Evolutionary Approach

B : Require More Time

C : Greedy Approach

D : Optimal Substructure And Overlapping Subproblems

Q.no 27. What is the purpose of using randomized quick sort over standard quick sort?

A : To reduce worst case space complexity

B : To reduce worst case time complexity

C : To improve average case time complexity

D : To improve accuracy

Q.no 28. The parallelism of a multithreaded computation is given by

A : T1 / Tp

B : T1 / T∞

C : T∞/T1

D : Tp / T1

Q.no 29. we can refere to the common sense/ intution while specifing the algorithm

A : true

B : false
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 343/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 30. loop invariant property can be proved using

A : Mathematical Induction

B : Proof by cases

C : proof by contradiction

D : direct proof

Q.no 31. Dynamic Programming uses

A : Member Function

B : Principle Of Optimality

C : Fitness Function

D : Minimize Objective Function

Q.no 32. Which of these is false about recursion?

A : Recursive function can be replaced by a non-recursive function

B : Recursive functions usually take more memory space than non-recursive function

C : Recursive functions run faster than non-recursive function

D : Recursion makes programs easier to understand

Q.no 33. Which of the following are not in NP?

A : All problems in P

B : Boolean Satisfiability problems

C : Integer factorization problem

D : Halting problem

Q.no 34. Crossover operator of genetic algorithms is

A : Join Operator

B : Two Point Crossover

C : Selection
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 344/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Multiplication

Q.no 35. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

Q.no 36. Prims algorithm is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 37. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?

A:9

B:8

C:7

D:6

Q.no 38. Genetic algorithm uses

A : No Population

B : Chromosomes

C : Not Gene,

D : Not Allele

Q.no 39. Which of the following branch and bound strategy leads to breadth first search?

A : Lifo Branch And Bound

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 345/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Highest Cost Branch And Bound

Q.no 40. Why can’t we design a perfect neural network?

A : Full Operation Is Still Known Of Biological Neurons

B : Number Of Neuron Is Itself Not Precisely Known

C : Number Of Interconnection Is Very Less & Is Very Easy

D : Easy Network

Q.no 41. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 42. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 43. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 44. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 346/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 45. what are the ways to remove the redundant computation outside the loop

A : Code motion

B : frequency reduction

C : Strength reduction

D : All of these

Q.no 46. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 47. What are the issues on which biological networks proves to be superior than AI
networks?

A : Robustness & Fault Tolerance

B : Inflexibility

C : Single Computation

D : No Computation

Q.no 48. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 347/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 49. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________

A : m^2 + 3

B : m^m

C:m

D : m+1

Q.no 50. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 51. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 52. How many times is the recursive function called, when the following code is executed?

A:7

B:9

C : 11

D : 13

Q.no 53. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 348/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Inappropriate

D : Not In Iterative Nature

Q.no 54. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 55. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 56. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that

A : n=1

B : k=1

C : 1=1(1+1)/2

D : 1+2+3+…+k = k(k+1)/2

Q.no 57. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

knapsack=60. Find the
maximum profit using fractional knapsack.

A : 400

B : 420

C : 500

D : 440

Q.no 58. Assertion is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 349/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 59. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 60. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 1. If f(n) = ______, then there exists positive constants c1, c2, n0 such that 0 ≤ c1.g(n) ≤ f(n)
≤ c2.g(n), for all n ≥ n0

A : Θ(g(n))

B : O(g(n))

C : Ω(g(n))

D : little Ω(g(n))

Q.no 2. Heap can be used as ……………….

A : Priority queue

B : Stack

C : A decreasing order array

D : Normal Array

Q.no 3. The main distinguishable characteristic of a binomial heap from a binary heap is that

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 350/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : It allows union operations very efficiently.

B : It does not allow union operations that could easily be implemented in binary heap.

C : The heap structure is not similar to complete binary tree.

D : The location of child node is not fixed.

Q.no 4. Algorithm must produce one output

A : true

B : false

C:

D:

Q.no 5. Halting problem is an example for?

A : decidable problem

B : undecidable problem

C : complete problem

D : trackable problem

Q.no 6. What are dendrites?

A : Fibers Of Nerves

B : nuclear projections

C : Other Name For Nucleus

D : Twisted Network

Q.no 7. Which is a condition about the relationship between the variables of our program which
is definitely true immediately before and immediately after each iteration of the loop?

A : For condition

B : Loop invariant condition

C : Both a and b

D : If condition

Q.no 8. What is a Rabin and Karp Algorithm?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 351/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : String Matching Algorithm

B : Shortest Path Algorithm

C : Minimum spanning tree Algorithm

D : Approximation Algorithm

Q.no 9. What is the best case time complexity of binary search?

A : O(n)

B : O(1)

C : O(log n)

D : O(n^2)

Q.no 10. _____is the maximum number of steps that can be executed for given input

A : Average case

B : Best case

C : Worst case

D : Time complexity

Q.no 11. which of the following is not a proof technique

A : Contradiction

B : Approximation

C : Mathematical induction

D:

Q.no 12. What does the algorithmic analysis count?

A : The number of arithmetic and the operations that are required to run the program

B : The number of lines required by the program

C : The number of seconds required by the program to execute

D : The size of the input

Q.no 13. The fundamental unit of neural network is

A : Brain
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 352/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Nucleus

C : Neuron

D : Axon

Q.no 14. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?

A : BST

B : MST

C : Binary Tree

D : Weighted Graph

Q.no 15. The complexity of Binary search algorithm is___

A : O(n)

B : O(log n)

C : O( n^2)

D : O(n log n)

Q.no 16. Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 17. Express the formula (n-2)*(n-4) in terms of Theta Ɵ Notation

A : Ɵ(n^2)

B : Ɵ(8)

C : Ɵ(log n)

D : Ɵ(n)

Q.no 18. Which of the following is the most commonly used data structure for implementing
Dijkstra’s Algorithm?

A : Max priority queue

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 353/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Stack

C : Circular queue

D : Min priority queue

Q.no 19. Which of the following statements is true?

A : Recursion is always better than iteration

B : Recursion uses more memory compared to iteration

C : Recursion uses less memory compared to iteration

D : Iteration is always better and simpler than recursion

Q.no 20. Which of the following algorithm can be used to solve the Hamiltonian path problem
efficiently?

A : branch and bound

B : iterative improvement

C : divide and conquer

D : greedy algorithm

Q.no 21. job sequencing with deadline is based on which method?

A : Divide and conquer method

B : Dynamic programming

C : Greedy method

D : Branch and bound

Q.no 22. The main time taking step in fractional knapsack problem is

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

D : Looping through sorted items

Q.no 23. When a thread u spawns a new thread v, then (u,v) is called a

A : Simple edge

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 354/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Return edge

C : Continuation edge

D : spawn edge

Q.no 24. The type of encoding where no character code is the prefix of another character code is
called?

A : optimal encoding

B : prefix encoding

C : Fequency encoding

D : Trie encoding

Q.no 25. In the development of dynamic programming the value of an optimal solution is
computed in Select one:

A : Top Up Fashion

B : Bottom Up Fashion

C : In Any Way

D : Random

Q.no 26. Multithreaded computation can be better understood with the help of a

A : Computation undirected acyclic graph

B : Computation directed cyclic graph

C : Computation directed acyclic graph

D : Computation undirected cyclic graph

Q.no 27. What is worst case in Naive Pattern matching algorithm.

A : The first character of the pattern is not present in text at all.

B : When all characters of the text and pattern are same.

C : when only the last character is different.

D : Both B and C

Q.no 28. Genetic algorithm is

A : A Intelligent Simple Specified Search Technique

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 355/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Used To Solve Non Optimization Problem

C : Is A Part Of Evolutionary Computing

D : Simulated Annealing

Q.no 29. An algorithm that always runs in polynomial time but possibly returns erroneous
answers is called a …………

A : Las Vegas Algorithm

B : Monte Carlo Algorithm

C : Atlantic City Algorithm

D : Approximation algorithm

Q.no 30. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem

A : only I

B : only II

C : both I and II

D : neither I nor II

Q.no 31. A binomial heap with n nodes contains not more than ………. binomial trees.

A : O(n)

B : O(log n)

C : O(n+1)

D : O(n-1)

Q.no 32. One important class of concurrency platform is

A : Parallel Programming

B : Dynamic Programming

C : Serial Programming

D : Multiprogramming

Q.no 33. Which of the following is not a branch and bound strategy to generate branches?

A : Lifo Branch And Bound

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 356/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : Fifo Branch And Bound

C : Lowest Cost Branch And Bound

D : Highest Cost Branch And Bound

Q.no 34. For a good loop invariant, following property is not important

A : Initialization

B : Maintenance

C : Termination:

D : loop condition

Q.no 35. Which of the following methods can be used to solve the matrix chain multiplication
problem?

A : Divide And Conquer

B : Greedy

C : Backtracking

D : Dynamic Programming, Brute Force, Recursion

Q.no 36. Which of the following problems is similar to that of a Hamiltonian path problem?

A : knapsack problem

B : closest pair problem

C : travelling salesman problem

D : assignment problem

Q.no 37. What is the basic principle in Rabin Karp algorithm?

A : Sorting

B : Hashing

C : Augmenting

D : Dynamic Programming

Q.no 38. 0/1 knapsack is based on which method?

A : greedy method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 357/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : branch and bound

C : dynamic programming

D : divide and conquer

Q.no 39. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}

A : O(N * M) time, O(1) space

B : O(N + M) time, O(N + M) space

C : O(N + M) time, O(1) space

D : O(N * M) time, O(N + M) space

Q.no 40. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn

A : A,B, C

B : B, C, A

C : C, B ,A

D : B,A, C

Q.no 41. Genetic Algorithm is a part of

A : Not Evolutionary Computing

B : Inspired By Monte-Carlo'S Theory About Evolution

C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics

D : The Fitness Function Not Used

Q.no 42. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………

A : recursive functions.

B : iterative function

C : built in function

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 358/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D:

Q.no 43. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?

A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)

D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)

Q.no 44. Which of the following methods can be used to solve the Knapsack problem?

A : Divide And Conquer

B : Sorting Algorithm

C : Monte-Carlo Algorithm

D : Brute Force, Recursion And Dynamic Programming

Q.no 45. A binomial heap with n = 13 nodes consists of ……….. Tree.

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

Q.no 46. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of

knapsack=40. Find the
maximum value output assuming items to be divisible and nondivisible respectively.

A : 10080

B : 11070

C : 130110

D : 11080

Q.no 47. If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.

A : Overlapping Subproblems

B : Optimal Substructure

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 359/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C : Memoization

D : Greedy

Q.no 48. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
maximum profit using fractional knapsack.

A : 38

B : 40

C : 38.3

D : 45

Q.no 49. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 50. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.

A : O(Log N)

B : O (N*N)

C : O (N*N*N)

D : O (N Log N)

Q.no 51. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?

A : Dynamic programming

B : Greedy method

C : backtracking

D : Neither Dynamic Nor Greedy

Q.no 52. What are the parameters of annealing?

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 360/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : The Energy (Goal) Function Is Not Used

B : The Annealing Schedule Temperature()

C : The Un-Acceptance Probability Function P()

D : Not Flexible

Q.no 53. Core of soft Computing is

A : Fuzzy Computing, Neural Computing, Genetic Algorithms

B : Fuzzy Networks And Artificial Intelligence

C : Artificial Intelligence And Neural Science

D : Neural Science And Genetic Science

Q.no 54. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers cube" is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n^2(n+1)^2/4

D : n^2(n+1)^2/6

Q.no 55. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?

A : W divided by P

B : P divided by W

C : m divided by P

D : P divided by m

Q.no 56. The name backtrack was first coined by _________

A : D.H.Lehmer

B : L.Baumert

C : R.J.Walker

D : S. Golomb

Q.no 57. algorithms performance is characterized by

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 361/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : size of a computation

B : computing resources required

C : actual time required

D : actual memory required

Q.no 58. Consider the following code snippet. What will happen when the above snippet is
executed?

A : The code will be executed successfully and no output will be generated

B : The code will run for some time and stop when the stack overflows

C : The code will be executed successfully and random output will be generated

D : The code will show a compile time error

Q.no 59. Time complexity of LCS Select one:

A : O(M!)

B : O(Mn)

C : O(N!)

D : O(N)

Q.no 60. In greedy method which type of solution is generated

A : Optimal solution

B : Best solution

C : Worst solution

D : All solutions

Q.no 1. What is best case complexity of Insertion sort

A:n

B : n^2

C : nlogn

D:

Q.no 2. The best data structure to check whether an arithmetic expression has balanced
parentheses is a

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 362/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : queue

B : stack

C : tree

D : list

Q.no 3. Two main measure of efficiency of an algorithm

A : processor and memory

B : time and space

C : date and space

D : date and capacity

Q.no 4. Recursive function must have

A : switch -case

B : exit condition

C : loop

D:

Q.no 5. Dijkstra’s Algorithm is used to solve ………. problems.

A : All pair shortest path

B : Single source shortest path

C : Network flow

D : Sorting

Q.no 6. Express the formula (n-1)*(n-5) in terms of big Oh notation

A : O(1)

B : O(log n)

C : O(n)

D : O(n^2)

Q.no 7. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 363/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : true

B : false

C:

D:

Q.no 8. O(n^3) means computing time is ____

A : Linear

B : polynomial

C : quadratic

D : exponential

Q.no 9. What is the worst case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 10. For the improvement of efficiency of quick sort the pivot can be____

A : the first element

B : the middle element

C : the last element

D : any random element

Q.no 11. Which element of an input array is chosen as pivot in Randomized Quicksort?

A : First

B : Last

C : Median

D : Random number

Q.no 12. The best suited algorithm could be decided using proof technique

A : false
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 364/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : true

C:

D:

Q.no 13. If the children of the root,from left to right, are the roots of Bk−1, Bk−2, . . . , B1, B0,
then root has degree .........

A : K-1

B:K

C : K+1

D : K+2

Q.no 14. Which of the following algorithms has better time complexity?

A : insertion sort

B : binary search

C : linear search

D : merge sort

Q.no 15. Dijkstra algorithm, which solves the single-source shortest--paths problem, is a

A : Greedy Algorithm

B : Dynamic programming algorithm

C : Divide and Conquer Algorithm

D : Backtracking Algorithm

Q.no 16. What will be the best case time complexity of merge sort?

A : O(N Log N)

B : O(n*n)

C : O(Log N)

D : O(Log Log N)

Q.no 17. Example of O(n) algorithms is______________

A : Multiplying two numbers.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 365/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : linear search

C : assigning a value to a variable

D : displaying some integer on console

Q.no 18. q29.jpeg

A : 111

B : 101

C : 110

D : 11

Q.no 19. In Algorithm Specification the blockes are indicated with matching

A : Braces

B : Parenthesis

C : Square Brackets

D : Slashes

Q.no 20. The goal of structured programming is to

A : have well indented programs

B : be able to infer the flow of control from the compiled code

C : be able to infer the flow of control from the program text

D : avoid the use of GOTO statements

Q.no 21. Power saving is an important job in embedded systm and sensor network.

A : true

B : false

C:

D:

Q.no 22. Running the program many times is sufficient to prove the correctness of program

A : true

B : false
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 366/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

C:

D:

Q.no 23. Dynamic programming is used to find:

A : All Optimal Solution Is Generated

B : One Solution Is Generated

C : No Optimal Solution Is Generated

D : Partial Solution Is Generated

Q.no 24. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)

A : f3, f2, f4, f1

B : f3, f2, f1, f4

C : f2, f3, f1, f4

D : None of these

Q.no 25. Which of the following method is used for sorting in merge sort?

A : Merging

B : Partitioning

C : Selection

D : Exchanging

Q.no 26. Many multithreaded algorithms involving nested parallelism follow naturally from

A : Dynamic Programming

B : Divide and conquer

C : Greedy Method

D : Branch and Bound Method

Q.no 27. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 367/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time

A : I and III

B : I and IV

C : II and III

D : II and IV

Q.no 28. How many stages(steps) of procedure does a non-deterministic algorithm consist of?

A:1

B:2

C:3

D:4

Q.no 29. Choose the correct statement from the following.

A : Branch And Bound Isworst Method

B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable

C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems

D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems

Q.no 30. Which of the following statements about loop invariants is false?

A : Loop invariants are used to show that algorithms produce the correct results.

B : A loop invariant is the opposite, that is the negation, of the condition of the loop.

C : To prove that a statement is a loop invariant, we use mathematical induction.

D : Loop invariants remain true each time a loop is executed.

Q.no 31. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both

A : true

B : false

C:

D:

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 368/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

Q.no 32. A strand of maximal length is called as ______________

A : Process

B : Work

C : Thread

D : Span

Q.no 33. What is true about Dynamic Programming

A : It Didn’T Find All Possible Solution

B : It Is Not Suitable For Solving Optimization Problems

C : Avoid The Re-Computation Of Overlapping Sub-Problems

D : Reliability Design Problem Is Not Solved

Q.no 34. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?

A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible

B : Both Are The Same

C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming

D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible

Q.no 35. Which of the following are not in NP?

A : All problems in P

B : Boolean Satisfiability problems

C : Integer factorization problem

D : Halting problem

Q.no 36. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?

A : 1,3,4,5,7,8,9,10

B : 1,4,3,9,8,5,7,10

C : 1,3,4,5,8,7,9,10

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 369/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : 1,3,7,4,8,5,9,10

Q.no 37. Parallel loops are like an ordinary_______________except that the iterations of the loop
can execute concurrently.

A : While loop

B : For Loop

C : Do while loop

D : If statement

Q.no 38. A Fibonacci heap uses ………… memory than a binary heap.

A : less

B : equal

C : more

D : cannot say

Q.no 39. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.

A : 100, 80

B : 110, 70

C : 130, 110

D : 110, 80

Q.no 40. The speed up of a computation on P processors is defined as

A : T1 / T∞

B : T1 / Tp

C : Tp / T1

D : T∞/T1

Q.no 41. Tabu search is

A : A Binary Search Method

B : Mathematical Optimization Method

C : C) Non Associative

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 370/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : D) The Acceptance Probability Function Is Used

Q.no 42. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.

A : Problem 1 belongs NP Complete set and 2 belongs to P

B : Problem 1 belongs to P set and 2 belongs to NP Complete set

C : Both problems belong to P set

D : Both problems belong to NP complete set

Q.no 43. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________

A : Decreases Both, The Time Complexity And The Space Complexity

B : Decreases The Time Complexity And Increases The Space Complexity

C : Increases The Time Complexity And Decreases The Space Complexity

D : Increases Both, The Time Complexity And The Space Complexity

Q.no 44. Assertion is

A : statement that is true all the time

B : statement about state of program

C : statement describing program statement

D:

Q.no 45. Characteristics of EAs ( Evolutionary Algorithm)

A : Not Flexible

B : Robust

C : Inappropriate

D : Not In Iterative Nature

Q.no 46. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
maximum profit using fractional knapsack.

A : 250

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 371/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : 270

C : 290

D : 130

Q.no 47. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}

A : O(nlog n)

B : O(n^2 )

C : O( n)

D : O(log n)

Q.no 48. When recursive call is the last thing executed by the function is called?

A : Mutual Recursion

B : Tail Recursion

C : Exponential Recursion

D : Recursion

Q.no 49. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?

A : 10*20

B : 20*30

C : 10*30

D : 10*20*30

Q.no 50. The main time taking step in fractional knapsack problem is?

A : Breaking items into fraction

B : Adding items into knapsack

C : Sorting

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 372/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

D : Looping through sorted items

Q.no 51. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is

A : n(n+1)/2

B : n^2(n+1)^2/2

C : n(n-1)/2

D:

Q.no 52. What is worst case in Rabin-Karp string matching algorithm.

A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.

B : when all characters of pattern and text are different as the hash values of all the substrings of text]
match with hash value of pattren.

C : Both a and b

D : neither a nor b

Q.no 53. Identify incorrect statement

A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))

B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))

C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))

D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))

Q.no 54. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?

A : Π is NP-hard but not NP-complete

B : Π is in NP, but is not NP-complete

C : Π is NP-complete

D : Π is neither NP-hard, nor in NP

Q.no 55. Time complexity of fractional knapsack problem is?

A : O(n log n)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 373/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

B : O(n)

C : O(nlogn)

D : O(nW)

Q.no 56. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

A : for m=k, k+1!>2^k holds

B : for m=k, k!>2^k holds

C : for m=k, k!>2^(k+1) holds

D:

Q.no 57. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?

A : The Fitness Function Cannot Be Well–Defined.

B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.

C : The Member Function Can Be Well–Defined.

D : Minimize Functions

Q.no 58. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.

A : O(1)

B : O(n)

C : O(log n)

D : O(n log n)

Q.no 59. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?

A : Non Associative Nature Of Networks

B : Distributive Nature Of Networks

C : Non Distributive Nature Of Networks

D : Is A Meta Heuristic Search Method

Q.no 60. A binomial heap with n = 13 nodes consists of ……….. Tree.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 374/375
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30

A : B0, B2,B3

B : B2,B3,B4

C : B1,B2,B3,B4

D : B1,B2,B3

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5852&code=1052000&showTest=319&actForm=edit&set=30 375/375
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is d

Answer for Question No 2. is b

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is d

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is a

Answer for Question No 12. is b

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is c

Answer for Question No 16. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 17. is d

Answer for Question No 18. is c

Answer for Question No 19. is b

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is a

Answer for Question No 23. is b

Answer for Question No 24. is d

Answer for Question No 25. is c

Answer for Question No 26. is c

Answer for Question No 27. is d

Answer for Question No 28. is b

Answer for Question No 29. is c

Answer for Question No 30. is b

Answer for Question No 31. is b

Answer for Question No 32. is a

Answer for Question No 33. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 34. is d

Answer for Question No 35. is c

Answer for Question No 36. is b

Answer for Question No 37. is b

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is c

Answer for Question No 41. is a

Answer for Question No 42. is c

Answer for Question No 43. is b

Answer for Question No 44. is d

Answer for Question No 45. is c

Answer for Question No 46. is d

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is c

Answer for Question No 53. is b

Answer for Question No 54. is a

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is a

Answer for Question No 58. is a

Answer for Question No 59. is a

Answer for Question No 60. is d

Answer for Question No 1. is b

Answer for Question No 2. is b

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is a

Answer for Question No 6. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 7. is a

Answer for Question No 8. is b

Answer for Question No 9. is c

Answer for Question No 10. is c

Answer for Question No 11. is b

Answer for Question No 12. is b

Answer for Question No 13. is d

Answer for Question No 14. is c

Answer for Question No 15. is c

Answer for Question No 16. is d

Answer for Question No 17. is a

Answer for Question No 18. is c

Answer for Question No 19. is a

Answer for Question No 20. is a

Answer for Question No 21. is a

Answer for Question No 22. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 5/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 23. is c

Answer for Question No 24. is d

Answer for Question No 25. is d

Answer for Question No 26. is c

Answer for Question No 27. is c

Answer for Question No 28. is a

Answer for Question No 29. is b

Answer for Question No 30. is c

Answer for Question No 31. is c

Answer for Question No 32. is b

Answer for Question No 33. is c

Answer for Question No 34. is d

Answer for Question No 35. is b

Answer for Question No 36. is b

Answer for Question No 37. is d

Answer for Question No 38. is b

Answer for Question No 39. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 6/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 40. is c

Answer for Question No 41. is a

Answer for Question No 42. is b

Answer for Question No 43. is a

Answer for Question No 44. is b

Answer for Question No 45. is a

Answer for Question No 46. is c

Answer for Question No 47. is c

Answer for Question No 48. is a

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is b

Answer for Question No 52. is b

Answer for Question No 53. is d

Answer for Question No 54. is c

Answer for Question No 55. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 7/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 56. is b

Answer for Question No 57. is b

Answer for Question No 58. is c

Answer for Question No 59. is b

Answer for Question No 60. is c

Answer for Question No 1. is d

Answer for Question No 2. is a

Answer for Question No 3. is a

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is b

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is b

Answer for Question No 12. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 8/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 13. is b

Answer for Question No 14. is a

Answer for Question No 15. is d

Answer for Question No 16. is c

Answer for Question No 17. is c

Answer for Question No 18. is c

Answer for Question No 19. is b

Answer for Question No 20. is b

Answer for Question No 21. is b

Answer for Question No 22. is d

Answer for Question No 23. is a

Answer for Question No 24. is c

Answer for Question No 25. is a

Answer for Question No 26. is b

Answer for Question No 27. is c

Answer for Question No 28. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 9/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 29. is d

Answer for Question No 30. is a

Answer for Question No 31. is a

Answer for Question No 32. is b

Answer for Question No 33. is c

Answer for Question No 34. is a

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is d

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is b

Answer for Question No 43. is c

Answer for Question No 44. is b

Answer for Question No 45. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 10/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 46. is a

Answer for Question No 47. is d

Answer for Question No 48. is c

Answer for Question No 49. is a

Answer for Question No 50. is a

Answer for Question No 51. is c

Answer for Question No 52. is b

Answer for Question No 53. is a

Answer for Question No 54. is b

Answer for Question No 55. is d

Answer for Question No 56. is a

Answer for Question No 57. is c

Answer for Question No 58. is a

Answer for Question No 59. is b

Answer for Question No 60. is b

Answer for Question No 1. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 11/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 2. is a

Answer for Question No 3. is b

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is d

Answer for Question No 7. is a

Answer for Question No 8. is a

Answer for Question No 9. is c

Answer for Question No 10. is c

Answer for Question No 11. is b

Answer for Question No 12. is a

Answer for Question No 13. is d

Answer for Question No 14. is b

Answer for Question No 15. is d

Answer for Question No 16. is d

Answer for Question No 17. is c

Answer for Question No 18. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 12/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 19. is b

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is c

Answer for Question No 23. is b

Answer for Question No 24. is d

Answer for Question No 25. is d

Answer for Question No 26. is c

Answer for Question No 27. is b

Answer for Question No 28. is a

Answer for Question No 29. is b

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is b

Answer for Question No 33. is b

Answer for Question No 34. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 13/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is c

Answer for Question No 39. is a

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is d

Answer for Question No 45. is c

Answer for Question No 46. is c

Answer for Question No 47. is b

Answer for Question No 48. is d

Answer for Question No 49. is b

Answer for Question No 50. is c

Answer for Question No 51. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 14/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 52. is b

Answer for Question No 53. is c

Answer for Question No 54. is b

Answer for Question No 55. is d

Answer for Question No 56. is d

Answer for Question No 57. is b

Answer for Question No 58. is c

Answer for Question No 59. is b

Answer for Question No 60. is c

Answer for Question No 1. is b

Answer for Question No 2. is a

Answer for Question No 3. is a

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 15/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 8. is c

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is d

Answer for Question No 12. is c

Answer for Question No 13. is b

Answer for Question No 14. is b

Answer for Question No 15. is a

Answer for Question No 16. is a

Answer for Question No 17. is d

Answer for Question No 18. is a

Answer for Question No 19. is b

Answer for Question No 20. is c

Answer for Question No 21. is a

Answer for Question No 22. is d

Answer for Question No 23. is a

Answer for Question No 24. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 16/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 25. is d

Answer for Question No 26. is b

Answer for Question No 27. is d

Answer for Question No 28. is c

Answer for Question No 29. is b

Answer for Question No 30. is a

Answer for Question No 31. is c

Answer for Question No 32. is d

Answer for Question No 33. is b

Answer for Question No 34. is d

Answer for Question No 35. is a

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is b

Answer for Question No 39. is d

Answer for Question No 40. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 17/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 41. is a

Answer for Question No 42. is c

Answer for Question No 43. is a

Answer for Question No 44. is d

Answer for Question No 45. is a

Answer for Question No 46. is b

Answer for Question No 47. is b

Answer for Question No 48. is a

Answer for Question No 49. is a

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is c

Answer for Question No 53. is a

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is a

Answer for Question No 57. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 18/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 58. is a

Answer for Question No 59. is a

Answer for Question No 60. is d

Answer for Question No 1. is a

Answer for Question No 2. is a

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is c

Answer for Question No 12. is a

Answer for Question No 13. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 19/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 14. is a

Answer for Question No 15. is a

Answer for Question No 16. is b

Answer for Question No 17. is c

Answer for Question No 18. is c

Answer for Question No 19. is c

Answer for Question No 20. is c

Answer for Question No 21. is d

Answer for Question No 22. is c

Answer for Question No 23. is d

Answer for Question No 24. is b

Answer for Question No 25. is a

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is c

Answer for Question No 30. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 20/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 31. is c

Answer for Question No 32. is a

Answer for Question No 33. is b

Answer for Question No 34. is b

Answer for Question No 35. is d

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is b

Answer for Question No 43. is d

Answer for Question No 44. is d

Answer for Question No 45. is c

Answer for Question No 46. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 21/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is d

Answer for Question No 52. is b

Answer for Question No 53. is d

Answer for Question No 54. is b

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is a

Answer for Question No 59. is c

Answer for Question No 60. is a

Answer for Question No 1. is d

Answer for Question No 2. is b

Answer for Question No 3. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 22/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 4. is b

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is d

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is c

Answer for Question No 12. is b

Answer for Question No 13. is b

Answer for Question No 14. is c

Answer for Question No 15. is c

Answer for Question No 16. is a

Answer for Question No 17. is a

Answer for Question No 18. is b

Answer for Question No 19. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 23/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 20. is c

Answer for Question No 21. is b

Answer for Question No 22. is c

Answer for Question No 23. is c

Answer for Question No 24. is b

Answer for Question No 25. is c

Answer for Question No 26. is a

Answer for Question No 27. is a

Answer for Question No 28. is c

Answer for Question No 29. is d

Answer for Question No 30. is d

Answer for Question No 31. is a

Answer for Question No 32. is d

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 24/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 37. is b

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is c

Answer for Question No 41. is a

Answer for Question No 42. is c

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is a

Answer for Question No 46. is a

Answer for Question No 47. is d

Answer for Question No 48. is a

Answer for Question No 49. is c

Answer for Question No 50. is a

Answer for Question No 51. is b

Answer for Question No 52. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 25/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is c

Answer for Question No 54. is d

Answer for Question No 55. is b

Answer for Question No 56. is c

Answer for Question No 57. is a

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is a

Answer for Question No 1. is b

Answer for Question No 2. is a

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is c

Answer for Question No 6. is c

Answer for Question No 7. is d

Answer for Question No 8. is b

Answer for Question No 9. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 26/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 10. is c

Answer for Question No 11. is d

Answer for Question No 12. is c

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is a

Answer for Question No 16. is d

Answer for Question No 17. is c

Answer for Question No 18. is c

Answer for Question No 19. is c

Answer for Question No 20. is a

Answer for Question No 21. is d

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is c

Answer for Question No 25. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 27/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 26. is d

Answer for Question No 27. is b

Answer for Question No 28. is a

Answer for Question No 29. is d

Answer for Question No 30. is a

Answer for Question No 31. is a

Answer for Question No 32. is d

Answer for Question No 33. is a

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is d

Answer for Question No 41. is a

Answer for Question No 42. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 28/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 43. is c

Answer for Question No 44. is c

Answer for Question No 45. is b

Answer for Question No 46. is b

Answer for Question No 47. is b

Answer for Question No 48. is a

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is b

Answer for Question No 52. is d

Answer for Question No 53. is c

Answer for Question No 54. is c

Answer for Question No 55. is a

Answer for Question No 56. is c

Answer for Question No 57. is a

Answer for Question No 58. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 29/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 59. is b

Answer for Question No 60. is b

Answer for Question No 1. is b

Answer for Question No 2. is c

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is c

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is d

Answer for Question No 12. is c

Answer for Question No 13. is b

Answer for Question No 14. is a

Answer for Question No 15. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 30/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 16. is b

Answer for Question No 17. is a

Answer for Question No 18. is a

Answer for Question No 19. is a

Answer for Question No 20. is c

Answer for Question No 21. is a

Answer for Question No 22. is d

Answer for Question No 23. is b

Answer for Question No 24. is b

Answer for Question No 25. is a

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is b

Answer for Question No 29. is c

Answer for Question No 30. is d

Answer for Question No 31. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 31/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 32. is a

Answer for Question No 33. is c

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is b

Answer for Question No 37. is a

Answer for Question No 38. is b

Answer for Question No 39. is d

Answer for Question No 40. is c

Answer for Question No 41. is c

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is a

Answer for Question No 46. is c

Answer for Question No 47. is b

Answer for Question No 48. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 32/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 49. is a

Answer for Question No 50. is a

Answer for Question No 51. is b

Answer for Question No 52. is b

Answer for Question No 53. is a

Answer for Question No 54. is a

Answer for Question No 55. is d

Answer for Question No 56. is a

Answer for Question No 57. is a

Answer for Question No 58. is b

Answer for Question No 59. is c

Answer for Question No 60. is d

Answer for Question No 1. is c

Answer for Question No 2. is a

Answer for Question No 3. is d

Answer for Question No 4. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 33/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is a

Answer for Question No 8. is b

Answer for Question No 9. is a

Answer for Question No 10. is d

Answer for Question No 11. is b

Answer for Question No 12. is b

Answer for Question No 13. is b

Answer for Question No 14. is a

Answer for Question No 15. is c

Answer for Question No 16. is c

Answer for Question No 17. is a

Answer for Question No 18. is b

Answer for Question No 19. is a

Answer for Question No 20. is a

Answer for Question No 21. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 34/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 22. is c

Answer for Question No 23. is b

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is a

Answer for Question No 29. is b

Answer for Question No 30. is a

Answer for Question No 31. is a

Answer for Question No 32. is a

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is b

Answer for Question No 36. is a

Answer for Question No 37. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 35/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is b

Answer for Question No 45. is b

Answer for Question No 46. is d

Answer for Question No 47. is a

Answer for Question No 48. is b

Answer for Question No 49. is c

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is b

Answer for Question No 53. is a

Answer for Question No 54. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 36/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 55. is d

Answer for Question No 56. is c

Answer for Question No 57. is c

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is b

Answer for Question No 1. is c

Answer for Question No 2. is d

Answer for Question No 3. is c

Answer for Question No 4. is c

Answer for Question No 5. is a

Answer for Question No 6. is c

Answer for Question No 7. is a

Answer for Question No 8. is c

Answer for Question No 9. is a

Answer for Question No 10. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 37/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 11. is b

Answer for Question No 12. is a

Answer for Question No 13. is a

Answer for Question No 14. is a

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is d

Answer for Question No 18. is b

Answer for Question No 19. is b

Answer for Question No 20. is a

Answer for Question No 21. is d

Answer for Question No 22. is b

Answer for Question No 23. is c

Answer for Question No 24. is d

Answer for Question No 25. is d

Answer for Question No 26. is c

Answer for Question No 27. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 38/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 28. is b

Answer for Question No 29. is b

Answer for Question No 30. is c

Answer for Question No 31. is a

Answer for Question No 32. is a

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is d

Answer for Question No 38. is c

Answer for Question No 39. is d

Answer for Question No 40. is a

Answer for Question No 41. is b

Answer for Question No 42. is d

Answer for Question No 43. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 39/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 44. is a

Answer for Question No 45. is a

Answer for Question No 46. is d

Answer for Question No 47. is a

Answer for Question No 48. is a

Answer for Question No 49. is b

Answer for Question No 50. is a

Answer for Question No 51. is c

Answer for Question No 52. is b

Answer for Question No 53. is a

Answer for Question No 54. is c

Answer for Question No 55. is a

Answer for Question No 56. is d

Answer for Question No 57. is c

Answer for Question No 58. is b

Answer for Question No 59. is d

Answer for Question No 60. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 40/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is b

Answer for Question No 2. is c

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is d

Answer for Question No 9. is d

Answer for Question No 10. is b

Answer for Question No 11. is a

Answer for Question No 12. is b

Answer for Question No 13. is a

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 41/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 17. is a

Answer for Question No 18. is b

Answer for Question No 19. is a

Answer for Question No 20. is a

Answer for Question No 21. is a

Answer for Question No 22. is b

Answer for Question No 23. is a

Answer for Question No 24. is d

Answer for Question No 25. is b

Answer for Question No 26. is a

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is c

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is b

Answer for Question No 33. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 42/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 34. is c

Answer for Question No 35. is a

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is b

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is a

Answer for Question No 49. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 43/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 50. is d

Answer for Question No 51. is c

Answer for Question No 52. is c

Answer for Question No 53. is a

Answer for Question No 54. is b

Answer for Question No 55. is c

Answer for Question No 56. is a

Answer for Question No 57. is b

Answer for Question No 58. is a

Answer for Question No 59. is b

Answer for Question No 60. is b

Answer for Question No 1. is a

Answer for Question No 2. is a

Answer for Question No 3. is c

Answer for Question No 4. is a

Answer for Question No 5. is c

Answer for Question No 6. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 44/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is c

Answer for Question No 10. is a

Answer for Question No 11. is b

Answer for Question No 12. is c

Answer for Question No 13. is b

Answer for Question No 14. is d

Answer for Question No 15. is c

Answer for Question No 16. is b

Answer for Question No 17. is b

Answer for Question No 18. is b

Answer for Question No 19. is c

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 45/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 23. is b

Answer for Question No 24. is d

Answer for Question No 25. is b

Answer for Question No 26. is c

Answer for Question No 27. is a

Answer for Question No 28. is b

Answer for Question No 29. is d

Answer for Question No 30. is c

Answer for Question No 31. is d

Answer for Question No 32. is b

Answer for Question No 33. is c

Answer for Question No 34. is c

Answer for Question No 35. is a

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is b

Answer for Question No 39. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 46/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 40. is c

Answer for Question No 41. is d

Answer for Question No 42. is a

Answer for Question No 43. is d

Answer for Question No 44. is b

Answer for Question No 45. is c

Answer for Question No 46. is a

Answer for Question No 47. is a

Answer for Question No 48. is c

Answer for Question No 49. is b

Answer for Question No 50. is c

Answer for Question No 51. is c

Answer for Question No 52. is d

Answer for Question No 53. is d

Answer for Question No 54. is c

Answer for Question No 55. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 47/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 56. is b

Answer for Question No 57. is d

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is b

Answer for Question No 1. is b

Answer for Question No 2. is a

Answer for Question No 3. is b

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is a

Answer for Question No 8. is c

Answer for Question No 9. is a

Answer for Question No 10. is a

Answer for Question No 11. is c

Answer for Question No 12. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 48/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 13. is c

Answer for Question No 14. is c

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is b

Answer for Question No 18. is a

Answer for Question No 19. is c

Answer for Question No 20. is d

Answer for Question No 21. is c

Answer for Question No 22. is a

Answer for Question No 23. is c

Answer for Question No 24. is b

Answer for Question No 25. is d

Answer for Question No 26. is d

Answer for Question No 27. is c

Answer for Question No 28. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 49/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 29. is a

Answer for Question No 30. is b

Answer for Question No 31. is a

Answer for Question No 32. is b

Answer for Question No 33. is a

Answer for Question No 34. is c

Answer for Question No 35. is b

Answer for Question No 36. is b

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is c

Answer for Question No 40. is d

Answer for Question No 41. is a

Answer for Question No 42. is a

Answer for Question No 43. is a

Answer for Question No 44. is c

Answer for Question No 45. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 50/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is b

Answer for Question No 49. is a

Answer for Question No 50. is b

Answer for Question No 51. is c

Answer for Question No 52. is b

Answer for Question No 53. is b

Answer for Question No 54. is a

Answer for Question No 55. is a

Answer for Question No 56. is b

Answer for Question No 57. is b

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is d

Answer for Question No 1. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 51/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 2. is b

Answer for Question No 3. is d

Answer for Question No 4. is d

Answer for Question No 5. is c

Answer for Question No 6. is b

Answer for Question No 7. is a

Answer for Question No 8. is a

Answer for Question No 9. is c

Answer for Question No 10. is a

Answer for Question No 11. is d

Answer for Question No 12. is c

Answer for Question No 13. is a

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is d

Answer for Question No 18. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 52/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 19. is d

Answer for Question No 20. is b

Answer for Question No 21. is a

Answer for Question No 22. is a

Answer for Question No 23. is d

Answer for Question No 24. is b

Answer for Question No 25. is a

Answer for Question No 26. is a

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is c

Answer for Question No 30. is c

Answer for Question No 31. is b

Answer for Question No 32. is c

Answer for Question No 33. is c

Answer for Question No 34. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 53/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 35. is c

Answer for Question No 36. is d

Answer for Question No 37. is d

Answer for Question No 38. is c

Answer for Question No 39. is d

Answer for Question No 40. is c

Answer for Question No 41. is d

Answer for Question No 42. is a

Answer for Question No 43. is d

Answer for Question No 44. is c

Answer for Question No 45. is c

Answer for Question No 46. is c

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is d

Answer for Question No 50. is a

Answer for Question No 51. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 54/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 52. is c

Answer for Question No 53. is c

Answer for Question No 54. is d

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is c

Answer for Question No 1. is a

Answer for Question No 2. is c

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is a

Answer for Question No 6. is a

Answer for Question No 7. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 55/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 8. is c

Answer for Question No 9. is c

Answer for Question No 10. is c

Answer for Question No 11. is a

Answer for Question No 12. is b

Answer for Question No 13. is b

Answer for Question No 14. is c

Answer for Question No 15. is a

Answer for Question No 16. is a

Answer for Question No 17. is b

Answer for Question No 18. is c

Answer for Question No 19. is b

Answer for Question No 20. is a

Answer for Question No 21. is b

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 56/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 25. is b

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is b

Answer for Question No 29. is a

Answer for Question No 30. is d

Answer for Question No 31. is b

Answer for Question No 32. is d

Answer for Question No 33. is b

Answer for Question No 34. is b

Answer for Question No 35. is a

Answer for Question No 36. is a

Answer for Question No 37. is b

Answer for Question No 38. is b

Answer for Question No 39. is d

Answer for Question No 40. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 57/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 41. is d

Answer for Question No 42. is b

Answer for Question No 43. is a

Answer for Question No 44. is a

Answer for Question No 45. is b

Answer for Question No 46. is b

Answer for Question No 47. is b

Answer for Question No 48. is a

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is a

Answer for Question No 52. is b

Answer for Question No 53. is a

Answer for Question No 54. is a

Answer for Question No 55. is b

Answer for Question No 56. is c

Answer for Question No 57. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 58/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is d

Answer for Question No 1. is a

Answer for Question No 2. is a

Answer for Question No 3. is b

Answer for Question No 4. is c

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is d

Answer for Question No 10. is d

Answer for Question No 11. is a

Answer for Question No 12. is a

Answer for Question No 13. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 59/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 14. is a

Answer for Question No 15. is b

Answer for Question No 16. is c

Answer for Question No 17. is a

Answer for Question No 18. is a

Answer for Question No 19. is b

Answer for Question No 20. is a

Answer for Question No 21. is b

Answer for Question No 22. is a

Answer for Question No 23. is c

Answer for Question No 24. is a

Answer for Question No 25. is d

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is d

Answer for Question No 30. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 60/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 31. is c

Answer for Question No 32. is c

Answer for Question No 33. is d

Answer for Question No 34. is b

Answer for Question No 35. is a

Answer for Question No 36. is b

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is c

Answer for Question No 41. is a

Answer for Question No 42. is a

Answer for Question No 43. is c

Answer for Question No 44. is a

Answer for Question No 45. is b

Answer for Question No 46. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 61/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 47. is a

Answer for Question No 48. is d

Answer for Question No 49. is d

Answer for Question No 50. is c

Answer for Question No 51. is b

Answer for Question No 52. is d

Answer for Question No 53. is c

Answer for Question No 54. is c

Answer for Question No 55. is c

Answer for Question No 56. is b

Answer for Question No 57. is a

Answer for Question No 58. is c

Answer for Question No 59. is c

Answer for Question No 60. is c

Answer for Question No 1. is d

Answer for Question No 2. is b

Answer for Question No 3. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 62/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 4. is a

Answer for Question No 5. is a

Answer for Question No 6. is d

Answer for Question No 7. is b

Answer for Question No 8. is d

Answer for Question No 9. is c

Answer for Question No 10. is c

Answer for Question No 11. is d

Answer for Question No 12. is a

Answer for Question No 13. is a

Answer for Question No 14. is a

Answer for Question No 15. is b

Answer for Question No 16. is a

Answer for Question No 17. is c

Answer for Question No 18. is b

Answer for Question No 19. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 63/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 20. is a

Answer for Question No 21. is c

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is c

Answer for Question No 25. is a

Answer for Question No 26. is c

Answer for Question No 27. is c

Answer for Question No 28. is c

Answer for Question No 29. is d

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is d

Answer for Question No 33. is c

Answer for Question No 34. is b

Answer for Question No 35. is c

Answer for Question No 36. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 64/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 37. is a

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is c

Answer for Question No 41. is c

Answer for Question No 42. is b

Answer for Question No 43. is b

Answer for Question No 44. is b

Answer for Question No 45. is d

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is d

Answer for Question No 49. is b

Answer for Question No 50. is a

Answer for Question No 51. is d

Answer for Question No 52. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 65/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is a

Answer for Question No 54. is a

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is b

Answer for Question No 58. is b

Answer for Question No 59. is d

Answer for Question No 60. is b

Answer for Question No 1. is c

Answer for Question No 2. is b

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is c

Answer for Question No 9. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 66/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 10. is c

Answer for Question No 11. is c

Answer for Question No 12. is c

Answer for Question No 13. is a

Answer for Question No 14. is a

Answer for Question No 15. is b

Answer for Question No 16. is c

Answer for Question No 17. is b

Answer for Question No 18. is c

Answer for Question No 19. is b

Answer for Question No 20. is c

Answer for Question No 21. is d

Answer for Question No 22. is d

Answer for Question No 23. is b

Answer for Question No 24. is c

Answer for Question No 25. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 67/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 26. is b

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is a

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is a

Answer for Question No 33. is c

Answer for Question No 34. is b

Answer for Question No 35. is b

Answer for Question No 36. is b

Answer for Question No 37. is a

Answer for Question No 38. is c

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 68/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 43. is c

Answer for Question No 44. is d

Answer for Question No 45. is c

Answer for Question No 46. is b

Answer for Question No 47. is a

Answer for Question No 48. is d

Answer for Question No 49. is c

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is a

Answer for Question No 53. is d

Answer for Question No 54. is c

Answer for Question No 55. is a

Answer for Question No 56. is a

Answer for Question No 57. is b

Answer for Question No 58. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 69/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 59. is a

Answer for Question No 60. is c

Answer for Question No 1. is b

Answer for Question No 2. is b

Answer for Question No 3. is c

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is c

Answer for Question No 7. is b

Answer for Question No 8. is b

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is b

Answer for Question No 12. is a

Answer for Question No 13. is b

Answer for Question No 14. is b

Answer for Question No 15. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 70/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 16. is b

Answer for Question No 17. is b

Answer for Question No 18. is b

Answer for Question No 19. is c

Answer for Question No 20. is c

Answer for Question No 21. is c

Answer for Question No 22. is d

Answer for Question No 23. is d

Answer for Question No 24. is a

Answer for Question No 25. is d

Answer for Question No 26. is d

Answer for Question No 27. is d

Answer for Question No 28. is a

Answer for Question No 29. is d

Answer for Question No 30. is d

Answer for Question No 31. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 71/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 32. is a

Answer for Question No 33. is a

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is d

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is c

Answer for Question No 41. is c

Answer for Question No 42. is b

Answer for Question No 43. is b

Answer for Question No 44. is c

Answer for Question No 45. is b

Answer for Question No 46. is b

Answer for Question No 47. is d

Answer for Question No 48. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 72/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is a

Answer for Question No 52. is a

Answer for Question No 53. is b

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is a

Answer for Question No 58. is a

Answer for Question No 59. is b

Answer for Question No 60. is c

Answer for Question No 1. is c

Answer for Question No 2. is c

Answer for Question No 3. is a

Answer for Question No 4. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 73/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 5. is d

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is d

Answer for Question No 9. is a

Answer for Question No 10. is b

Answer for Question No 11. is b

Answer for Question No 12. is b

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is d

Answer for Question No 17. is a

Answer for Question No 18. is a

Answer for Question No 19. is a

Answer for Question No 20. is d

Answer for Question No 21. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 74/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is a

Answer for Question No 25. is b

Answer for Question No 26. is a

Answer for Question No 27. is a

Answer for Question No 28. is a

Answer for Question No 29. is c

Answer for Question No 30. is d

Answer for Question No 31. is b

Answer for Question No 32. is b

Answer for Question No 33. is a

Answer for Question No 34. is b

Answer for Question No 35. is c

Answer for Question No 36. is b

Answer for Question No 37. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 75/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 38. is c

Answer for Question No 39. is d

Answer for Question No 40. is b

Answer for Question No 41. is d

Answer for Question No 42. is c

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is a

Answer for Question No 46. is c

Answer for Question No 47. is a

Answer for Question No 48. is c

Answer for Question No 49. is d

Answer for Question No 50. is a

Answer for Question No 51. is b

Answer for Question No 52. is a

Answer for Question No 53. is a

Answer for Question No 54. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 76/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 55. is c

Answer for Question No 56. is a

Answer for Question No 57. is b

Answer for Question No 58. is b

Answer for Question No 59. is c

Answer for Question No 60. is a

Answer for Question No 1. is b

Answer for Question No 2. is b

Answer for Question No 3. is b

Answer for Question No 4. is c

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is d

Answer for Question No 8. is c

Answer for Question No 9. is a

Answer for Question No 10. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 77/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 11. is c

Answer for Question No 12. is a

Answer for Question No 13. is a

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is d

Answer for Question No 17. is b

Answer for Question No 18. is c

Answer for Question No 19. is a

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is b

Answer for Question No 23. is a

Answer for Question No 24. is b

Answer for Question No 25. is d

Answer for Question No 26. is b

Answer for Question No 27. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 78/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 28. is b

Answer for Question No 29. is b

Answer for Question No 30. is a

Answer for Question No 31. is b

Answer for Question No 32. is c

Answer for Question No 33. is c

Answer for Question No 34. is d

Answer for Question No 35. is b

Answer for Question No 36. is a

Answer for Question No 37. is a

Answer for Question No 38. is c

Answer for Question No 39. is a

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is c

Answer for Question No 43. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 79/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 44. is b

Answer for Question No 45. is c

Answer for Question No 46. is d

Answer for Question No 47. is a

Answer for Question No 48. is b

Answer for Question No 49. is a

Answer for Question No 50. is a

Answer for Question No 51. is c

Answer for Question No 52. is d

Answer for Question No 53. is b

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is d

Answer for Question No 57. is b

Answer for Question No 58. is c

Answer for Question No 59. is b

Answer for Question No 60. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 80/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is d

Answer for Question No 2. is c

Answer for Question No 3. is b

Answer for Question No 4. is a

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is b

Answer for Question No 9. is d

Answer for Question No 10. is d

Answer for Question No 11. is d

Answer for Question No 12. is a

Answer for Question No 13. is b

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 81/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 17. is c

Answer for Question No 18. is a

Answer for Question No 19. is b

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is c

Answer for Question No 23. is c

Answer for Question No 24. is c

Answer for Question No 25. is c

Answer for Question No 26. is c

Answer for Question No 27. is a

Answer for Question No 28. is b

Answer for Question No 29. is b

Answer for Question No 30. is c

Answer for Question No 31. is c

Answer for Question No 32. is a

Answer for Question No 33. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 82/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 34. is b

Answer for Question No 35. is c

Answer for Question No 36. is c

Answer for Question No 37. is c

Answer for Question No 38. is d

Answer for Question No 39. is b

Answer for Question No 40. is c

Answer for Question No 41. is c

Answer for Question No 42. is a

Answer for Question No 43. is a

Answer for Question No 44. is a

Answer for Question No 45. is c

Answer for Question No 46. is c

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 83/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 50. is b

Answer for Question No 51. is d

Answer for Question No 52. is a

Answer for Question No 53. is a

Answer for Question No 54. is b

Answer for Question No 55. is d

Answer for Question No 56. is a

Answer for Question No 57. is a

Answer for Question No 58. is d

Answer for Question No 59. is a

Answer for Question No 60. is c

Answer for Question No 1. is c

Answer for Question No 2. is c

Answer for Question No 3. is a

Answer for Question No 4. is b

Answer for Question No 5. is a

Answer for Question No 6. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 84/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is a

Answer for Question No 11. is b

Answer for Question No 12. is c

Answer for Question No 13. is b

Answer for Question No 14. is a

Answer for Question No 15. is d

Answer for Question No 16. is b

Answer for Question No 17. is b

Answer for Question No 18. is a

Answer for Question No 19. is b

Answer for Question No 20. is a

Answer for Question No 21. is b

Answer for Question No 22. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 85/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 23. is b

Answer for Question No 24. is c

Answer for Question No 25. is b

Answer for Question No 26. is c

Answer for Question No 27. is c

Answer for Question No 28. is d

Answer for Question No 29. is a

Answer for Question No 30. is c

Answer for Question No 31. is b

Answer for Question No 32. is d

Answer for Question No 33. is a

Answer for Question No 34. is b

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is c

Answer for Question No 39. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 86/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 40. is a

Answer for Question No 41. is b

Answer for Question No 42. is c

Answer for Question No 43. is a

Answer for Question No 44. is a

Answer for Question No 45. is d

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is b

Answer for Question No 49. is b

Answer for Question No 50. is b

Answer for Question No 51. is c

Answer for Question No 52. is d

Answer for Question No 53. is d

Answer for Question No 54. is b

Answer for Question No 55. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 87/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 56. is a

Answer for Question No 57. is b

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is d

Answer for Question No 1. is c

Answer for Question No 2. is a

Answer for Question No 3. is d

Answer for Question No 4. is b

Answer for Question No 5. is d

Answer for Question No 6. is c

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is b

Answer for Question No 12. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 88/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 13. is a

Answer for Question No 14. is b

Answer for Question No 15. is c

Answer for Question No 16. is b

Answer for Question No 17. is b

Answer for Question No 18. is a

Answer for Question No 19. is d

Answer for Question No 20. is c

Answer for Question No 21. is b

Answer for Question No 22. is b

Answer for Question No 23. is d

Answer for Question No 24. is a

Answer for Question No 25. is a

Answer for Question No 26. is b

Answer for Question No 27. is d

Answer for Question No 28. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 89/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 29. is a

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is b

Answer for Question No 33. is d

Answer for Question No 34. is c

Answer for Question No 35. is c

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is b

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 90/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is d

Answer for Question No 49. is c

Answer for Question No 50. is b

Answer for Question No 51. is c

Answer for Question No 52. is a

Answer for Question No 53. is c

Answer for Question No 54. is c

Answer for Question No 55. is c

Answer for Question No 56. is a

Answer for Question No 57. is b

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is d

Answer for Question No 1. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 91/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 2. is a

Answer for Question No 3. is b

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is b

Answer for Question No 8. is d

Answer for Question No 9. is d

Answer for Question No 10. is a

Answer for Question No 11. is c

Answer for Question No 12. is c

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is d

Answer for Question No 17. is b

Answer for Question No 18. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 92/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 19. is c

Answer for Question No 20. is a

Answer for Question No 21. is a

Answer for Question No 22. is c

Answer for Question No 23. is b

Answer for Question No 24. is c

Answer for Question No 25. is c

Answer for Question No 26. is d

Answer for Question No 27. is c

Answer for Question No 28. is b

Answer for Question No 29. is a

Answer for Question No 30. is d

Answer for Question No 31. is d

Answer for Question No 32. is a

Answer for Question No 33. is c

Answer for Question No 34. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 93/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 35. is d

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is a

Answer for Question No 40. is c

Answer for Question No 41. is b

Answer for Question No 42. is b

Answer for Question No 43. is c

Answer for Question No 44. is c

Answer for Question No 45. is a

Answer for Question No 46. is b

Answer for Question No 47. is a

Answer for Question No 48. is b

Answer for Question No 49. is b

Answer for Question No 50. is a

Answer for Question No 51. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 94/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 52. is c

Answer for Question No 53. is c

Answer for Question No 54. is d

Answer for Question No 55. is b

Answer for Question No 56. is d

Answer for Question No 57. is a

Answer for Question No 58. is a

Answer for Question No 59. is b

Answer for Question No 60. is d

Answer for Question No 1. is a

Answer for Question No 2. is d

Answer for Question No 3. is a

Answer for Question No 4. is b

Answer for Question No 5. is a

Answer for Question No 6. is a

Answer for Question No 7. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 95/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 8. is d

Answer for Question No 9. is a

Answer for Question No 10. is a

Answer for Question No 11. is c

Answer for Question No 12. is b

Answer for Question No 13. is a

Answer for Question No 14. is c

Answer for Question No 15. is b

Answer for Question No 16. is c

Answer for Question No 17. is b

Answer for Question No 18. is a

Answer for Question No 19. is a

Answer for Question No 20. is a

Answer for Question No 21. is d

Answer for Question No 22. is a

Answer for Question No 23. is d

Answer for Question No 24. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 96/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 25. is c

Answer for Question No 26. is b

Answer for Question No 27. is a

Answer for Question No 28. is c

Answer for Question No 29. is c

Answer for Question No 30. is a

Answer for Question No 31. is a

Answer for Question No 32. is c

Answer for Question No 33. is d

Answer for Question No 34. is d

Answer for Question No 35. is b

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is a

Answer for Question No 39. is c

Answer for Question No 40. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 97/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 41. is c

Answer for Question No 42. is b

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is c

Answer for Question No 46. is c

Answer for Question No 47. is b

Answer for Question No 48. is c

Answer for Question No 49. is b

Answer for Question No 50. is c

Answer for Question No 51. is d

Answer for Question No 52. is a

Answer for Question No 53. is a

Answer for Question No 54. is b

Answer for Question No 55. is a

Answer for Question No 56. is c

Answer for Question No 57. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 98/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is a

Answer for Question No 1. is a

Answer for Question No 2. is c

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is d

Answer for Question No 9. is b

Answer for Question No 10. is b

Answer for Question No 11. is a

Answer for Question No 12. is c

Answer for Question No 13. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 99/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 14. is b

Answer for Question No 15. is c

Answer for Question No 16. is a

Answer for Question No 17. is b

Answer for Question No 18. is b

Answer for Question No 19. is b

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is b

Answer for Question No 23. is c

Answer for Question No 24. is d

Answer for Question No 25. is b

Answer for Question No 26. is d

Answer for Question No 27. is b

Answer for Question No 28. is b

Answer for Question No 29. is b

Answer for Question No 30. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 100/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 31. is b

Answer for Question No 32. is c

Answer for Question No 33. is d

Answer for Question No 34. is b

Answer for Question No 35. is a

Answer for Question No 36. is c

Answer for Question No 37. is c

Answer for Question No 38. is b

Answer for Question No 39. is b

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is c

Answer for Question No 43. is b

Answer for Question No 44. is d

Answer for Question No 45. is d

Answer for Question No 46. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 101/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 47. is a

Answer for Question No 48. is b

Answer for Question No 49. is a

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is c

Answer for Question No 53. is b

Answer for Question No 54. is a

Answer for Question No 55. is c

Answer for Question No 56. is d

Answer for Question No 57. is d

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is c

Answer for Question No 1. is a

Answer for Question No 2. is a

Answer for Question No 3. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 102/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is b

Answer for Question No 12. is a

Answer for Question No 13. is c

Answer for Question No 14. is c

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is a

Answer for Question No 18. is d

Answer for Question No 19. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 103/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 20. is a

Answer for Question No 21. is c

Answer for Question No 22. is c

Answer for Question No 23. is d

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is c

Answer for Question No 27. is d

Answer for Question No 28. is c

Answer for Question No 29. is b

Answer for Question No 30. is c

Answer for Question No 31. is b

Answer for Question No 32. is b

Answer for Question No 33. is d

Answer for Question No 34. is d

Answer for Question No 35. is d

Answer for Question No 36. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 104/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is c

Answer for Question No 42. is a

Answer for Question No 43. is b

Answer for Question No 44. is d

Answer for Question No 45. is a

Answer for Question No 46. is d

Answer for Question No 47. is a

Answer for Question No 48. is c

Answer for Question No 49. is b

Answer for Question No 50. is c

Answer for Question No 51. is b

Answer for Question No 52. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 105/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is a

Answer for Question No 54. is c

Answer for Question No 55. is c

Answer for Question No 56. is a

Answer for Question No 57. is a

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is a

Answer for Question No 1. is a

Answer for Question No 2. is b

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is d

Answer for Question No 7. is a

Answer for Question No 8. is b

Answer for Question No 9. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 106/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 10. is b

Answer for Question No 11. is d

Answer for Question No 12. is b

Answer for Question No 13. is b

Answer for Question No 14. is b

Answer for Question No 15. is a

Answer for Question No 16. is a

Answer for Question No 17. is b

Answer for Question No 18. is c

Answer for Question No 19. is a

Answer for Question No 20. is c

Answer for Question No 21. is a

Answer for Question No 22. is b

Answer for Question No 23. is a

Answer for Question No 24. is a

Answer for Question No 25. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 107/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 26. is b

Answer for Question No 27. is a

Answer for Question No 28. is b

Answer for Question No 29. is c

Answer for Question No 30. is b

Answer for Question No 31. is a

Answer for Question No 32. is c

Answer for Question No 33. is c

Answer for Question No 34. is d

Answer for Question No 35. is d

Answer for Question No 36. is a

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is d

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 108/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 43. is b

Answer for Question No 44. is b

Answer for Question No 45. is b

Answer for Question No 46. is b

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is d

Answer for Question No 50. is c

Answer for Question No 51. is a

Answer for Question No 52. is a

Answer for Question No 53. is d

Answer for Question No 54. is c

Answer for Question No 55. is a

Answer for Question No 56. is b

Answer for Question No 57. is b

Answer for Question No 58. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 109/110
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 59. is b

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 110/110