BscCSSemester3 Data structures

Lecture 1 – – INTRODUCTION OF DATA STRUCTURE

Lecture 2 – APPLICATIONS OF DATA STRUCTURE

Lecture 3 -ARRAYS

Lecture 4-ARRAYS 2

Lecture 5-LINEAR SEARCH

Lecture 6-BINARY SEARCH

Lecture 7-OPERATION ON ARRAY 1 

Lecture 8-OPERATION ON ARRAY 2

Lecture 9-MULTIDIMENSIONAL ARRAYS,PARALLEL ARRAYS,SPARSE  MATRIX

Lecture 10-STRINGS

Lecture 11-STRING HANDLING FUNCTIONS

Lecture 12-PATTERN MATCHING ALGORITHM

Lecture 13-INTRODUCTION TO STACK

Lecture 14-STACK IMPLEMENTATION USING ARRAYS,PUSH OPERATION

Lecture 15-STACK IMPLEMENTATION USING ARRAYS,POP  OPERATION

Lecture 16- APPLICATIONS OF STACK ,INFIX  POSTFIX,PREFIX EXPRESSION INFIX TO POSTFIX CONVERSION

Lecture 17- INFIX TO POSTFIX CONVERSION EXAMPLE

Lecture 18-EVALUATION OF POSTFIX EXPRESSION

Lecture 19-BALANCING OF SYMBOLS

Lecture 20-INTRODUCTION TO QUEUE

Lecture 21 Queue implementation using array

Lecture 22 Introduction to Linked list

Lecture23  Types of Linked list 

Lecture 24 Linked list creation, Sparse Matrix using linked list

Lecture 25 Stack using linked list

Lecture 26 Queue using linked list

Lecture 27 Linked list – Insertion of a node

Lecture 28 Linked List – Deletion of a node  

Lecture 29 Trees

Lecture 30 Binary Tree

Lecture 31 Binary Tree Representation  

Lecture 32 Binary tree traversal

Lecture 33 Expression tree

Lecture 34 Construction of BInary tree with inorder and preorder traversal

Lecture 35 Binary Search Tree

Lecture 36 Insertion in BST

Lecture 37 Deletion from BST 

Lecture 38 Lecture name: Finding minimum and maximum Element from BST

Lecture 39: Graph introduction, Terminology, Types, Representation

Lecture 40 Graph Traversal:DFS and BFS

Lecture 41 Hashing