S8 cOMPREHENSIVE VIVA ALGORITHM ANALYSIS AND DESIGN

S8 cOMPREHENSIVE VIVA ALGORITHM ANALYSIS AND DESIGN

Professional Development

25 Qs

quiz-placeholder

Similar activities

Data Structures and Algorithm

Data Structures and Algorithm

11th Grade - Professional Development

30 Qs

Algorithms Data

Algorithms Data

11th Grade - Professional Development

30 Qs

Enderman Language

Enderman Language

KG - Professional Development

28 Qs

CO5 DAA

CO5 DAA

Professional Development

30 Qs

first round quiz

first round quiz

Professional Development

20 Qs

Data Structure

Data Structure

Professional Development

20 Qs

C Code Master

C Code Master

Professional Development

20 Qs

Typing words and symbols on keyboard (1)

Typing words and symbols on keyboard (1)

KG - Professional Development

30 Qs

S8 cOMPREHENSIVE VIVA ALGORITHM ANALYSIS AND DESIGN

S8 cOMPREHENSIVE VIVA ALGORITHM ANALYSIS AND DESIGN

Assessment

Quiz

Computers

Professional Development

Hard

Created by

Arya S R

Used 1+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not O(n2)?

(1510) * n + 12099

n1.98

n3/(sqrt(n))

(220) * n

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not a backtracking algorithm?

Knight tour problem

N queen problem

Tower of hanoi

M coloring problem

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is false.

T(n) = O(n^2)

T(n) = (nLogn)

T(n) = (n^2)

T(n) = O(nLogn)

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?

O(n2log(n))

Theta(n2log(n))

Theta(n4)

Theta(n3)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Four matrices M1, M2, M3 and M4 of dimensions pxq, qxr, rxs and sxt respectively can be multiplied is several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 X M2) X (M3 X M4)), the total number of multiplications is pqr + rst + prt. When multiplied as (((M1 X M2) X M3) X M4), the total number of scalar multiplications is pqr + prs + pst. If p = 10, q = 100, r = 20, s = 5 and t = 80, then the number of scalar multiplications needed is

248000

44000

19000

25000

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and positive integer W, is there a subset of S whose elements sum to W? A dynamic program for solving this problem uses a 2-dimensional Boolean array X, with n rows and W+1 columns. X[i, j],1 <= i <= n, 0 <= j <= W, is TRUE if and only if there is a subset of {a1 ,a2 ,...,ai} whose elements sum to j. Which of the following is valid for 2 <= i <= n and ai <= j <= W?

X[i, j] = X[i - 1, j] ∨ X[i, j -ai]

X[i, j] = X[i - 1, j] ∨ X[i - 1, j - ai]

X[i, j] = X[i - 1, j] ∧ X[i, j - ai]

X[i, j] = X[i - 1, j] ∧ X[i, j - ai

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is 

θ(n) 

θ(logn) 

θ(log*n) 

θ(1) 

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?