Data Structures and Algorithms in C for Beginners

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: Types of Data Structures

Chapter 2: Analysis of Algorithms

Lecture 1: Analysis of Algorithms I

Lecture 2: Introduction to Asymptotic Notations and Big O

Lecture 3: How to find time complexity ?

Lecture 4: Problems on Time Complexities – Very Important

Chapter 3: Array

Lecture 1: Introduction to Arrays

Lecture 2: Giving array as user input

Lecture 3: Storing and retrieving in an array

Lecture 4: Inserting an element to the array

Lecture 5: Insertion in an array – Coding!

Chapter 4: Stacks

Lecture 1: Introduction to Stacks

Lecture 2: Top of the stack

Lecture 3: Last in First Out

Lecture 4: Stack overflow and Stack underflow

Lecture 5: Push and Pop code in c

Lecture 6: Reversing a string using stack – Algorithm

Lecture 7: Reversing a string using stack – C Code

Lecture 8: Balanced Paranthesis Algorithm

Lecture 9: Balanced Paranthesis Algorithm II

Lecture 10: Balanced Paranthesis Algorithm III

Lecture 11: Balanced Paranthesis checking using stack in c

Lecture 12: Manual Conversion from Infix to Postfix

Lecture 13: Algorithm for Infix to Postfix

Lecture 14: Tracing Infix to Postfix Algorithm

Lecture 15: Coding the algorithm for Infix to Postfix

Chapter 5: Linked Lists

Lecture 1: Introduction to Linkedlists

Lecture 2: Self referential structures

Lecture 3: Review on Pointers

Lecture 4: Structure of a Node

Lecture 5: Linking the nodes in c

Lecture 6: Creating a linked list with n nodes

Lecture 7: Inserting at the beginning – Algorithm

Lecture 8: Insertion at the beginning – C code

Lecture 9: Insertion at End – Algorithm

Lecture 10: Insertion at end – C code

Lecture 11: Insertion after a specific node – Algorithm

Lecture 12: Inserting a new node after a specific node – C Code

Lecture 13: Deletion at the beginning – Algorithm

Lecture 14: Deletion at beginning – C code

Lecture 15: Deletion at end – Algorithm

Lecture 16: Deleting a specific node – C code

Lecture 17: Circular Singly Linked Lists

Chapter 6: Queue

Lecture 1: Introduction to Queue

Lecture 2: Disadvantage of Linear Queue

Lecture 3: Basic Queue Operations

Chapter 7: Non linear Data Structures – Trees and Graphs

Lecture 1: Introduction to Non Linear Data Structures

Lecture 2: Tree Terminologies

Lecture 3: Introduction to Binary Trees

Lecture 4: Pre Order Traversal of BT

Lecture 5: Post Order Traversal

Lecture 6: Inorder Traversal

Lecture 7: Binary Search Trees

Lecture 8: Graph Terminologies

Lecture 9: Representation of a Graph

Chapter 8: Update – Implementation of Trees in C

Lecture 1: Implementation of Binary Trees in C/C++

Lecture 2: Implementation of Binary Trees in C,C++ – II

Lecture 3: Program for Binary Trees – III

Chapter 9: Searching and Sorting Algorithms

Lecture 1: Introduction to Searching and Sorting Algorithms

Lecture 2: Linear Search – Explanation

Lecture 3: Linear Search – Code

Lecture 4: Binary Search – Explanation

Lecture 5: Implementing Binary Search

Lecture 6: Bubble Sort

Lecture 7: Implementation of Bubble Sort

Lecture 8: Insertion Sort

Lecture 9: QuickSort – Easy Explanation

Chapter 10: Final Quiz

Chapter 11: Update – Djikstra's Algorithm

Lecture 1: Djikstra's algorithm – shortest path in a graph

Chapter 12: Update – Notes for Queues and Stacks

Lecture 1: Update – Notes for Queues and Stacks