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.

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 is not a Characteristics of a Data Structure?

Time Complexity
Space Complexity

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

3. Worst Case indicates maximum time required for program execution.

Can be yes or no
Can not say

4. Which of the following analysis known as empirical analysis of an algorithm?

A Posterior Analysis
A Priori Analysis
A Feasibility Analysis
A Independent Analysis

5. Which case indicate the minimum time required for program execution?

best case
average case
worst case
None of the above

6. _________ is measured by counting the number of key operations such as comparisons in the sorting algorithm.

None of the above

7. ________ of an algorithm refers to defining the mathematical boundation/framing of its run-time performance.

Symptotic analysis
Asymptotic analysis
Posterior Analysis
Priori Analysis

8. O(1) means computing time is __________________


9. Ο(log n) is?

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

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

Branch and Bound
Both A and B