Array and Array Operations
6
Stack Operations
9
Queue Operations
16
Singly Linked List Operations
18
Singly Linked List
26
Doubly Linked List
35
Circular Linked List
42
Stack using Array
48
Stack using Linked List
52
Queue using Array
58
Queue using Linked List
64
Priority Queue
67
Double Ended Queue (Dequeue)
72
Stack using Queues
78
Decimal to Binary using Stacks
85
Towers of Hanoi
92
Bit Array
97
Dynamic Array
99
Parallel Array
101
Sparse Array
104
Matrix
112
Skip List
116
Xor Linked List
119
Xor Linked List-II
122
Binary Trees using Array
125
Binary Trees using Linked Lists
129
Preorder Traversal
132
Inorder Traversal
138
Binary Tree Properties
142
Binary Search Tree
145
AVL Tree
151
Cartesian Tree
155
Weight Balanced Tree
158
Red Black Tree
162
Splay Tree
166
Splay Tree
169
Heap
171
Binary Heap
173
Weak Heap
176
Binomial and Fibonacci Heap
178
Hash Tables
182
Direct Addressing Tables
185
Graph
187
Adjacency Matrix
191
Incidence Matrix and Graph Structured Stack
195
Adjacency List
198
Undirected Graph
201
Directed Graph
204
Directed Acyclic Graph
208
Propositional and Directed Acyclic Word Graph
212
Multigraph and Hypergraph
215
Binary Decision Diagrams & And Inverter Graph
218
Linear Search Iterative
221
Binary Search Iterative
229
Uniform Binary Search
233
Fibonacci Search
235
Selection Sort
237
Bubble Sort
240
Merge Sort
243
Pancake Sort
246
Depth First Search
250
Breadth First Search
253
Recursion
256
Factorial using Recursion
262
Fibonacci using Recursion
267
Sum of n Natural Numbers using Recursion
273
String Reversal using Recursion
279
Decimal to Binary Conversion using Recursion
285
Length of a Linked List using Recursion
292
Length of a String using Recursion
297
Largest and Smallest Number in an Array using Recursion
302
Largest and Smallest Number in a Linked List using Recursion
307
Search an Element in an Array using Recursion
313
Search an Element in a Linked List using Recursion
323
Dynamic Programming
331
Fibonacci using Dynamic Programming
334
Coin Change Problem
341
Maximum Sum of Continuous Subarray
346
Kadane’s Algorithm
352
Longest Increasing Subsequence
357
Rod Cutting
362
Minimum Number of Jumps
369
0/1 Knapsack Problem
375
Matrix-chain Multiplication
379
Longest Common Subsequence
387
Longest Palindromic Subsequence
393
Edit Distance Problem
400
Wagner-Fischer Algorithm
407
Catalan Number using Dynamic Programming
413
Assembly Line Scheduling
418
Minimum Insertions to form a Palindrome
425
Maximum Sum Rectangle in a 2D Matrix
432
Balanced Partition
437
Dice Throw Problem
444
Counting Boolean Parenthesizations
452
Topological Sort
455
TEST YOURSELF
458
Our 1500+ Data Structure And Algorithm Questions and Answers focuses on all areas of Data Structure And Algorithm subject covering 100+ topics in Data Structure And Algorithm. These topics are chosen from a collection of most authoritative and best reference books on Data Structure And Algorithm. One should spend 1 hour daily for 15 days to learn and assimilate Data Structure And Algorithm comprehensively. This way of systematic learning will prepare anyone easily towards Data Structure And Algorithm interviews, online tests, Examinations and Certifications.
Highlights-
1500+ Basic and Hard Core High level Multiple Choice Questions & Answers in Data Structure And Algorithm with Explanations.
Prepare anyone easily towards Data Structure And Algorithm interviews, online tests, Government Examinations and certifications.
Every MCQ set focuses on a specific topic in Data Structure And Algorithm.
Specially designed for IBPS IT, SBI IT, RRB IT, GATE CSE, UGC NET CS, PROGRAMMER and other IT & Computer Science related Exams.
Who should Practice these Data Structure And Algorithm Questions?
Anyone wishing to sharpen their skills on Data Structure And Algorithm.
Anyone preparing for aptitude test in Data Structure And Algorithm.
Anyone preparing for interviews (campus/off-campus interviews, walk-in interviews)
Anyone preparing for entrance examinations and other competitive examinations.
All – Experienced, Freshers and Students.