Question 1

Selection sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 2

Insertion sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 3

Insertion sort's worstcase time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 4

Bubble sort's worst case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 5

Quick sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: B

Question 6

Merge sort's average case Space complexity is

O
O(n)
O(logn)
None of these

Answer

Correct Option: B

Question 7

Merge sort's worst case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: B

Question 8

Quick sort's worstcase Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: B

Question 9

Insertion sort's worstcase Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 10

Quick sort's worstcase time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 11

Selection sort's worst case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Question 12

Bubble sort 's average case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 13

Selection sort's worst case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 14

Bubble sort's worst case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 15

Insertion sort's average case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 16

Quick sort's average case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: B

Question 17

Merge sort's worst case Space complexity is

0
O(n)
O(logn)
None of these

Answer

Correct Option: B

Question 18

Which of the following algorithms solves the Quick Sort Problem?

Greedy
Depth-first search
Dyanamic programming
Divide and conquer

Answer

Correct Option: D

Question 19

The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list should be used?

Singly linked list
Doubly linked list
Circular doubly linked list
Array implementation

Answer

Correct Option: C

Question 20

Which of the following algorithms solves the all pairs shortest path problem?

Greedy
Depth-first search
Dyanamic programming
Divide and conquer

Answer

Correct Option: C

Question 21

Which of the following algorithms solves the Connected components problem?

Greedy
Depth-first search
Dynamic programming
Divide and conquer

Answer

Correct Option: B

Question 22

Which of the following algorithms solves the Minimum weight spanning tree problem?

Greedy
Depth-first search
Dynamic programming
Divide and conquer

Answer

Correct Option: A

Question 23

Selection sort's average case Space complexity is

O
O(n)
O(logn)
None of these

Answer

Correct Option: A

Question 24

Merge sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: B

Question 25

Bubble sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Answer

Correct Option: A

Description: Complete study material for DBMS, RDBMS, Data Base Management System, Relational Data Base Management System, Primary Key, Foreign Key, Data, Information to prepare for B.Sc-IT, M.Sc-IT, BCA, MCA, MCa Entrance
Number of Questions: 25
Created by: Amit Pandey
Tags: DBMS Data Base RDBMS Relational Data Base Primary Key B.Sc-IT M.Sc-IT MCA BCA MCA Entrance Basic Computer C C++ ASP PHP HTML database management system notes advantages of database management system Data Base Management System Relational Data Base Management System Data Structures

DBMS

Find more quizzes from top tags