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

2. Which of the following is not a audio compression algorithms?

ALAC
DST
JSAC
OSQ

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

Minimum & Maximum problem
Knapsack problem
Selection problem
Merge sort

4. How many cases are there, which are used to compare various data structure's execution time in a relative manner?

2
3
4
5

5. Lossy image compression is used in digital cameras, to increase storage capacities

Yes
No
Can be yes or no
Can not say

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

Yes
No
Can be yes or no
Can not say

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

8. In Average case, if operation takes ƒ(n) time in execution, then m operations will take?

ƒ(n)
f(m)
mf(n)
nf(m)

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

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

10. O(1) means computing time is __________________

Constant
Quadratic
Linear
Cubic

Results