Data Structures And Algorithms Quiz


Play this quiz that will help you to excel in Data Structures And Algorithms certification exams, placements etc. This Data Structures And Algorithms quiz consist of 10 questions that you need to solve in 10 minutes. We’ve specially designed this quiz so that you can quickly acquaint to the pattern of questions you can be asked in placement drives, certification exams etc. This DSA test enables you to assess your knowledge of Data Structures And Algorithms.

Algorithms + Data Structures

Bestseller by udemy

Ace your next Javascript coding interview by mastering data structures and algorithms.

13 Hours
Paid

Take the Free Practice Test



Data Structures And Algorithms MCQs

Practice Data Structures & Algorithms MCQ Questions, which will help you to sharpen your DSA skills and also helps you to prepare for placements, interviews, technical rounds, competitive programming etc.

Data Structures And Algorithms Quiz

Try Free Data Structures And Algorithms Quiz, to start a quiz you need to login first, after login you will get start quiz button and then by clicking on that you can start quiz. You will get 10 Minutes to answer all questions.

Data Structures And Algorithms Quiz

1. Which of the following algorithms has very high compression ratio, used by 7zip and xz?

LZSS
LZO
LZMA
LZW

2. Asymptotic analysis is _______ bound.

output
input
outer
inner

3. Which of the following belongs to the algorithm paradigm?

Minimum & Maximum problem
Knapsack problem
Selection problem
Merge sort

4. Ο(log n) is?

constant asymptotic notations
logarithmic asymptotic notations
polynomial asymptotic notations
quadratic asymptotic notations

5. The Omega notation is the formal way to express the __________ of an algorithms running time.

upper bound
medium bound
lower bound
both the lower bound and the upper bound

6. The time factor when determining the efficiency of algorithm is measured by?

Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm

7. Which of the following sorting algorithm is of divide-and-conquer type?

Bubble sort
Insertion sort
Quick sort
Selection sort

8. What is the type of the algorithm used in solving the 8 Queens problem?

Backtracking
Dynamic
Branch and Bound
Both A and B

9. An algorithm should have _________ well-defined outputs

0
1
0 or more
1 or more

10. Which of the following is true about Lempel–Ziv–Welch (LZW) algorithm?

Optimized for compressing plain text
Used by GIF images and Unix's compress utility
Used by WinRAR in tandem with Huffman coding
used by ZIP, gzip, and PNG images

Results