
- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup
- Algorithm
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- DSA - Greedy Algorithms
- DSA - Divide and Conquer
- DSA - Dynamic Programming
- Data Structures
- DSA - Data Structure Basics
- DSA - Array Data Structure
- Stack & Queue
- DSA - Stack
- DSA - Expression Parsing
- DSA - Queue
- Searching Techniques
- DSA - Linear Search
- DSA - Binary Search
- DSA - Interpolation Search
- DSA - Hash Table
- Sorting Techniques
- DSA - Sorting Algorithms
- DSA - Bubble Sort
- DSA - Insertion Sort
- DSA - Selection Sort
- DSA - Merge Sort
- DSA - Shell Sort
- DSA - Quick Sort
- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal
- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Spanning Tree
- DSA - Heap
- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Data Structures Algorithms Online Quiz
Following quiz provides Multiple Choice Questions (MCQs) related to Data Structures Algorithms. You will have to read all the given answers and click over the correct answer. If you are not sure about the answer then you can check the answer using Show Answer button. You can use Next Quiz button to check new set of questions in the quiz.

Q 1 - Prefix notation is alsow known as
Answer : D
Explanation
Polish Notation
Q 2 - What data structure can be used to check if a syntax has balanced paranthesis ?
Answer : D
Explanation
Stack uses LIFO method which is good for checking matching paranthesis.
Answer : D
Explanation
Minimum number of queues required for priority queue implementation is two. One for storing actual data and one for storing priorities.
Q 4 - Maximum degree of any vertex in a simple graph of vertices n is
Answer : D
Explanation
In a simple graph, a vertex can have edge to maximum n - 1 vertices.
Q 5 - Time complexity of Depth First Traversal of is
Answer : A
Explanation
Using Depth First Search, we traverse the whole graph i.e. visiting all Vertices and Edges.
Q 6 - Match the following −
(1) Bubble Sort | (A) Ο(n) |
(2) Shell Sort | (B) Ο(n2) |
(3) Selection Sort | (C) Ο(n log n) |
Answer : B
Explanation
Q 7 - In doubly linked lists
A - a pointer is maintained to store both next and previous nodes.
B - two pointers are maintained to store next and previous nodes.
Answer : B
Explanation
One pointer variable can not store more than one address values.
Q 8 - Heap is an example of
Answer : A
Explanation
Heap maintains itself to meet all the requirements of complete binary tree.
Q 9 - If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then
A - we'll get a different spanning tree.
B - we'll get the same spanning tree.
Answer : B
Explanation
Regardless of which algorithm is used, in a graph with unique weight, resulting spanning tree will be same.
Q 10 - An adaptive sorting algorithm −
B - takes advantage of already sorted elements.
Answer : B
Explanation
A sorting algorithm is said to be adaptive, if it takes advantage of already 'sorted' elements in the list that is to be sorted.