- Home
- All Courses
- Web Development
- Data Structures and Algorithms (DSA) Tutorial
Curriculum
- 82 Sections
- 446 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Data Structures & Algorithms - Overview5
- Randomized Algorithms4
- Frequently Asked Questions about DSAThere are many Frequently Asked Questions (FAQs) on Data Structures and Algorithms due to the complex nature of this concept. In this section, we will try to answer some of them briefly.9
- 3.1What Are Data Structures and Algorithms?
- 3.2What is the best programming language for data structures and algorithms?
- 3.3Which is the best place to learn Data Structures?
- 3.4Is array a Data Type or Data Structure?
- 3.5What Should I Learn First: Data Structures or Algorithms?
- 3.6What Should I Learn First: Data Structures or Algorithms?
- 3.7Data Structures and Algorithms in Real Life!
- 3.8Need of Data Structures and Algorithms for Deep Learning and Machine Learning
- 3.9What is The Difference Between Data Type and Data Structure?
- Data Structure BasicsThis tutorial explains the basic terms related to data structure.4
- Queue - The peek() Operation9
- Insertion Sort Algorithm3
- DSA Home9
- 7.1overview
- 7.2Why to Learn Data Structures & Algorithms (DSA)?
- 7.3How to start learning Data Structures & Algorithms (DSA)?
- 7.4Applications of Data Structures & Algorithms (DSA)
- 7.5Who Should Learn DSA
- 7.6DSA Online Editor & Compiler
- 7.7Prerequisites to Learn DSA
- 7.8DSA Online Quiz
- 7.9DSA Jobs and Opportunities
- Data Structures & Algorithms - Environment Setup5
- Data Structures - Algorithms Basics7
- Data Structures - Asymptotic Analysis9
- Data Structures and Types3
- Array Data Structure11
- 12.1What is an Array?
- 12.2Need for Arrays
- 12.3Array Representation
- 12.4Basic Operations in Arrays
- 12.5Array – Insertion Operation
- 12.6Array – Deletion Operation
- 12.7Array – Deletion Operation
- 12.8Array – Search Operation
- 12.9Array – Traversal Operation
- 12.10Array – Update Operation
- 12.11Array – Display Operation
- Linked List Data Structure10
- 13.1What is Linked List?
- 13.2Linked Lists vs Arrays
- 13.3Types of Linked List
- 13.4Basic Operations in Linked List
- 13.5Linked List – Insertion Operation
- 13.6Linked List – Deletion Operation
- 13.7Linked List – Reversal Operation
- 13.8Linked List – Search Operation
- 13.9Linked List – Traversal Operation
- 13.10Linked List – Complete implementation
- Doubly Linked List Data Structure7
- 14.1What is Doubly Linked List?
- 14.2Doubly Linked List Representation
- 14.3Basic Operations in Doubly Linked List
- 14.4Doubly Linked List – Insertion at the Beginning
- 14.5Doubly Linked List – Insertion at the End
- 14.6Doubly Linked List – Deletion at the Beginning
- 14.7Doubly Linked List – Complete Implementation
- Circular Linked List Data Structure6
- Stack Data Structure8
- Expression Parsing in Data Structure9
- Queue Data Structure9
- Data Structures - Searching Algorithms3
- Linear Search Algorithm3
- Binary Search Algorithm3
- Interpolation Search Algorithm5
- Jump Search Algorithm3
- Exponential Search Algorithm3
- Fibonacci Search Algorithm3
- Sublist Search Algorithm3
- Hash Table Data structure8
- Data Structures - Sorting Techniques5
- Bubble Sort Algorithm2
- Selection Sort Algorithm3
- Merge Sort Algorithm3
- Shell Sort Algorithm3
- Heap Sort Algorithm3
- Bucket Sort Algorithm3
- Counting Sort Algorithm3
- Radix Sort Algorithm3
- Quick Sort Algorithm7
- Graph Data Structure9
- Depth First Search (DFS) Algorithm2
- Breadth First Search (BFS) Algorithm2
- Spanning Tree6
- Tree Data Structure6
- Tree Traversal5
- Binary Search Tree10
- AVL Trees4
- Red Black Trees6
- B Trees4
- B+ Trees3
- Splay Trees5
- Tries Data Structure5
- Heap Data Structure3
- Recursion Algorithms7
- Tower of Hanoi Using Recursion3
- Fibonacci Series Using Recursion4
- Divide & Conquer Algorithm5
- Max-Min ProblemLet us consider a simple problem that can be solved by divide and conquer technique.3
- Strassen’s Matrix Multiplication3
- Karatsuba Algorithm4
- Greedy Algorithms6
- Travelling Salesman Problem (Greedy Approach)3
- Prim’s Minimal Spanning Tree3
- Kruskal’s Minimal Spanning Tree Algorithm toggle4
- Dijkstra’s Shortest Path Algorithm3
- Map Colouring Algorithm3
- Fractional Knapsack Problem4
- Job Sequencing with Deadline3
- Optimal Merge Pattern Algorithm3
- Dynamic Programming4
- Matrix Chain Multiplication Algorithm3
- Floyd Warshall Algorithm4
- 0-1 Knapsack Problem4
- Longest Common Subsequence Algorithm4
- Travelling Salesman Problem (Dynamic Approach)3
- Approximation Algorithms3
- Vertex Cover Algorithm3
- Set Cover Problem3
- Travelling Salesman using Approximation Algorithm3
- Randomized Quick Sort Algorithm3
- Karger’s Minimum Cut Algorithm3
- Fisher-Yates Shuffle Algorithm3
- DSA Questions & AnswersData Structures Algorithms Questions and Answers has been designed with a special intention of helping students and professionals preparing for various Certification Exams and Job Interviews. This section provides a useful collection of sample Interview Questions and Multiple Choice Questions (MCQs) and their answers with appropriate explanations.49
- 81.1What is data-structure?
- 81.2What are various data-structures available?
- 81.3What is algorithm?
- 81.4Why we need to do algorithm analysis?
- 81.5What are the criteria of algorithm analysis?
- 81.6What is asymptotic analysis of an algorithm?
- 81.7What are asymptotic notations?
- 81.8What is linear data structure?
- 81.9What are common operations that can be performed on a data-structure?
- 81.10Briefly explain the approaches to develop algorithms.
- 81.11Give some examples greedy algorithms.
- 81.12What are some examples of divide and conquer algorithms?
- 81.13What are some examples of dynamic programming algorithms?
- 81.14What is a linked-list?
- 81.15What is stack?
- 81.16Why do we use stacks?
- 81.17What operations can be performed on stacks?
- 81.18What is a queue in data-structure?
- 81.19Why do we use queues?
- 81.20What operations can be performed on Queues?
- 81.21What is linear searching?
- 81.22What is binary search?
- 81.23What is bubble sort and how bubble sort works?
- 81.24Tell me something about ‘insertion sort’?
- 81.25What is selection sort?
- 81.26How insertion sort and selection sorts are different?
- 81.27What is merge sort and how it works?
- 81.28What is shell sort?
- 81.29How quick sort works?
- 81.30What is a graph?
- 81.31How depth first traversal works?
- 81.32How breadth first traversal works?
- 81.33What is a tree?
- 81.34What is a binary tree?
- 81.35What is a binary search tree?
- 81.36What is tree traversal?
- 81.37What is an AVL Tree?
- 81.38What is a spanning tree?
- 81.39How many spanning trees can a graph has?
- 81.40How Kruskal’s algorithm works?
- 81.41How Prim’s algorithm finds spanning tree?
- 81.42What is a minimum spanning tree (MST)?
- 81.43What is a heap in data structure?
- 81.44What is a recursive function?
- 81.45What is tower of hanoi?
- 81.46What is fibonacci series?
- 81.47What is hashing?
- 81.48What is interpolation search technique?
- 81.49What is the prefix and post fix notation of (a + b) * (c + d) ?
- Data Structures & Algorithms - Quick Guide27
- 82.1Overview
- 82.2Environment Setup
- 82.3Data Structure Basics
- 82.4Data Structures and Types
- 82.5Array Data Structure
- 82.6Linked List Data Structure
- 82.7Doubly Linked List Data Structure
- 82.8Circular Linked List Data Structure
- 82.9Stack Data Structure
- 82.10Expression Parsing
- 82.11Queue Data Structure
- 82.12Graph Data Structure
- 82.13Depth First Traversal
- 82.14Breadth First Traversal
- 82.15Spanning Tree
- 82.16Tree Data Structure
- 82.17Tree Traversal
- 82.18Binary Search Tree
- 82.19AVL Trees
- 82.20Red Black Trees
- 82.21B Trees
- 82.22B+ Trees
- 82.23Splay Trees
- 82.24Tries Data Structure
- 82.25Heap Data Structure
- 82.26Tower of Hanoi Using Recursion
- 82.27Fibonacci Series Using Recursion
