Lecture Notes || SNS Courseware

Subject Details

Dept : CST

Sem : 3

Regul : 2023

Faculty : Dr.P.Poonkodi

phone : 9999999999

E-mail : ah.cst@snsce.ac.in

557

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Introduction-Types

Circular queue implementation

Tree ADT â€“ Tree traversals

Expression trees

Binary Tree ADT

Applications of stack and queue

Linked Lists

Stack ADT

Queue ADT

UNIT 2:

Binary search tree ADT Operations

AVL trees

Binary heaps

B trees

B+ trees

Huffman Tree

UNIT 3:

Definitions

Breadth-first traversal

Depth first traversal

Shortest path algorithms

Minimum spanning tree

Applications of graphs:Travelling salesman Problem

biconnectivity â€“ Euler circuits

Topological sort

Lecture Notes