Search Header Logo

quiz_module 2

Authored by Navin Agrawal

Computers

Professional Development

Used 5+ times

quiz_module 2
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Time complexity of fractional knapsack problem is ____________

O(n log n)

o(n)

O(n2)

O(log n)

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

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.____________

60

80

100

40

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.

15

16

14

12

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

a) True

b) False

may be

do not say

6.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Kruskal’s algorithm is a ______

a) divide and conquer algorithm

b) dynamic programming algorithm

c) greedy algorithm

d) approximation algorithm

7.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

What is the time complexity of Kruskal’s algorithm?

a) O(log V)

b) O(E log V)

c) O(E2)

d) O(V log E)

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?