Notes for Third Semester Data Structure and Algorithm

Lecture Videos

Day 01 – Data Structure Introduction

Day 02 – Asymtotic Notation

Day 03 – Stack Operations

Day 04 – Application of stack

Day 05 – Infix to Postfix and Infix to Prefix

Day 06 – Algorithm to convert infix to prefix and postfix

Day 07- Queue and algorithm to push and pop in queue and Circular queue

Day 08 – Algorithm of circularqueue, Priority Queue, Application and Deque

Day 09 – Linked list and operations

Day 10 – Singly linked list

Day 11 – Project class

Day 12 – DSA doubly linked list

Day13 – Stack implementation using linked list