Quiz2

Quiz2

University

10 Qs

quiz-placeholder

Similar activities

DAA_C_MCQ - 1

DAA_C_MCQ - 1

University

12 Qs

Problem Solving Phase

Problem Solving Phase

University

11 Qs

Data Structure Quiz 2

Data Structure Quiz 2

University

9 Qs

Quick Sort - Data Structures

Quick Sort - Data Structures

University

15 Qs

CSCI 2380-03P Exam 3 Review

CSCI 2380-03P Exam 3 Review

University

8 Qs

Software Engineering Quiz 3

Software Engineering Quiz 3

University

10 Qs

quis algoritma

quis algoritma

University

10 Qs

Quiz3_DivideConquer_GreedyApproach

Quiz3_DivideConquer_GreedyApproach

University

10 Qs

Quiz2

Quiz2

Assessment

Quiz

Computers

University

Hard

Created by

Prasenjit Das

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the appropriate data structure for Prim's minimum spanning tree?

Stack

Linear Queue

Tree

Priority Queue

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is represented by asymptotic notation O(1)

Constant time

linear time

time less

exponential time

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

what is the appropriate data structure for DFS algorithm?

queue

stack

array

tree

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

time complexity for recurrence relation T(n)=2T(n/2)+n

O(log n)

O(n log n)

O(n^2)

O(2 log n)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Fractional Knapsack is efficiently solved by

Dynamic programming

Greedy algorithm

Divide conquer

none of these

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

0/1 knapsack can be solved by greedy algorithm?

True

False

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

which algorithm is used to solve single source shortest path problem in a graph with negative edge?

dijkstra

bellman ford

floyd warshal

none of these

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?