CS502-Fundamentals of Algorithms Mid-Term Grand Quiz Fall 2021

 MID-TERM GRAND QUIZ
 FALL 2020

Question No 1:

We do not need to prove comparison-based sorting algorithm by (Raise For Success) mathematically. It always takes _____ time.

• Big Oh nlog(n)
• Omega nlog(n) Correct
• Omega n(n^2)
• Theta nlog(n)

Question No 2:

In 3-Dimension space, (Raise For Success) a point P has _______ coordinates(s).

• (X,Y)
• (X,0)
• (0,Y)
• (X,Y,Z) Correct

Question No 3:

The following sequence (Raise For Success) is called ___________.

1,1,1,2,3,5,8,13,21,34,55,……..

• Optimize sequence.
• Fibonacci sequence. Correct
• Optimal sequence.
• Overlapping sequence.

Question No 4:

Which one sorting algorithm (Raise For Success) is best suited to sort an array of 2 million elements?

• Bubble sort.
• Insert sort.
• Merge sort.
• Quick sort. Correct

Question No 5:

To find the maximal points in brute force algorithm, each point (Raise For Success) of the space is compared against _________ of that space.

• One other point.
• All other point. Correct
• Few other points.
• Most of the other points.

Question No 6:

Following is (Raise For Success) not the application of edit distance problem.

• Speech recognition. Correct
• Spelling Correction.
• Ascending Sort.
• Computational Molecular Biology.

Question No 7:

In chain matrix multiplication, if there are n items, there are _________ ways (Raise For Success) in which order most pair of parentheses can placed.

• n^2
• 2n
• n+1
• n-1 Correct

Question No 8:

In Dynamic Programming based solution of Knapsack Problem, (Raise For Success) if we decide to take an object ‘I’, then we gain.

• W (Total weight of Knapsack)
• V (Total value of Knapsack)
• Vi (Value of object i) Correct
• None of the given option.

Question No 9:

What is the best-case (Raise For Success) time complexity of merge sort?

• O((n^2logn)
• O((nlogn*2)
• O((nlogn) Correct
• O((n^2)

Question No 10:

Asymptotic (Raise For Success) growth of 8n*2+2n-3 is:

• Ӫ(n*2+n)
• Ӫ(n*2) Correct
• Ӫ(8n*2)
• Ӫ(8n*2+2n)

Question No 11:

In asymptotical analysis of n*(5+2)-3, as n becomes large the (Raise For Success) dominant (fastest growing) term is same constant times ________.

• n_1
• n
• n+1
• n*n Correct

Question No 12:

In the statement:

“If (P[i]x < P[j]x & P[i]y < P[j]y”

The number (Raise For Success) of times elements of p are accessed is _________.

• 1
• 2
• 3
• 4 Correct

Question No 13:

How many steps (Raise For Success) are involved to design the dynamic programming strategy?

• 2 Correct
• 3
• 1
• 4

Question No 14:

Sorting can (Raise For Success) be in ________.

• Increasing order only.
• Decreasing order only.
• Both increasing and decreasing order. Correct
• Random order.

Question No 15:

An algorithm is (Raise For Success) said to be correct if for every _________ instance, it halts with the correct.

• Input, Output Correct
• Design, Analysis
• Design, Analysis
• Key, Analysis

Question No 16:

The Knapsack problem (Raise For Success) belongs to the domain of ________ problems.

• Optimization Correct
• Sorting
• Linear solution
• Searching

Question No 17:

In Heap sort algorithm, (Raise For Success) Heapify procedure is _________ in nature.

• Recursive Correct
• Non-Recursive
• Fast
• Slow

Question No 18:

In 2-D maxima problem, (Raise For Success) A point p is said to be dominated by point q if ________.

• px = qx and py = qy
• px ≠ qx and py ≠ qy
• px ≥ qx and py ≥ qy
• px ≤ qx and py ≤ qy Correct

Question No 19:

In quick sort (Raise For Success) algorithm, _______ decides nature of Binary Search Tree formed by pivots.

• Middle element from input
• Smallest element from input
• Rank of the pivot Correct
• Largest element from input

Question No 20:

In addition to passing (Raise For Success) in the array itself to merge sort algorithm, we will pass in ________ other arguments which are indicates.

• 2 Correct
• 3
• 4
• 5

Question No 21:

An in-place sorting (Raise For Success) algorithm is one that ______ use additional array for storage.

• Always
• Permanently
• Does Not Correct
• Sometimes

Question No 22:

Quick sort (Raise For Success) is a/an ______ and _______ sorting algorithm.

• Not implace , Not stable one
• Implace , Not stable one Correct
• Implace , Stable one
• Not implace , Stable one

Question No 23:

In Heapsort Algorithm, (Raise For Success) total time by heapify procedure is:

• O(log n) Correct
• O(log2 n)
• O(n log n)
• O(n2 log n)

Question No 24:

Which of the following (Raise For Success) is calculated with Big 0 notation?

• Medium bounds
• Upper bounds
• Lower bounds
• Both upper and lower bounds Correct

Question No 25:

While solving (Raise For Success) Selection problem in Steve technique we partition input date __________.

• In increasing order
• In decreasing order
• According to Pivot Correct
• Randomly

Question No 26:

Find the maximum value of the items which can carry using Knapsack, (Raise For Success) Knapsack weight capacity = 50

Items    Weight Value

1        10      70

2        20      20

3        30      80

4        70      200

• 280 Correct
• 180
• 90
• 200

Question No 27:

While solving Selection problem in Steve technique we partition (Raise For Success) input date __________.

• In increasing order
• In decreasing order
• According to Pivot Correct
• Randomly

Question No 28:

If matrix A of dimension 2 x 4 is multiplied with matrix B of (Raise For Success) dimension 4 x 3 then the dimension of resultant matrix will be ____________.

• 2 x 4
• 4 x 3
• 3 x 4
• 2 x 3 Correct

Question No 29:

________ is the process of avoiding unnecessary repetitions by (Raise For Success) writing down the results of recursive calls and looking them up again if we need them later.

• Loop
• Memorization Correct
• Recursion
• Function

Question No 30:

In average-cases (Raise For Success) time the probability of seeing input is denoted by __________.

• p{I}
• p[I]
• p<I>
• p(I) Correct