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 case of data structure operation takes maximum time?

Worst Case
Average Case
Best Case
None of the above

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

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

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

Bubble sort
Insertion sort
Quick sort
Selection sort

4. Data items that cannot be divided are called as?

Group Items
Attribute and Entity
Elementary Items
File items

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

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

6. In an array representation of binary tree the right child of root will be at location of?

2
3
4
6

7. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?

Completeness
Correctness
Time Complexity
Space Complexity

8. Which compression loses data?

Lossy compression
Lossless compression
Both A and B
None of the above

9. Which data structure allows deleting data elements from front and inserting at rear?

Stacks
Queues
Deques
Binary search tree

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

Backtracking
Dynamic
Branch and Bound
Both A and B

Results