Subject Details
Dept     : AIML
Sem      : 3
Regul    : 2019
Faculty : Ms.S.Rajasulochana
phone  : NIL
E-mail  : sulochana.s.cse@snsct.org
763
Page views
34
Files
1
Videos
1
R.Links

Icon
Lecture Notes

UNIT 1:
word
download   open file
INTRODUCTION
word
download   open file
LINKED LIST
word
download   open file
Stack ADT
word
download   open file
Queue ADT
word
download   open file
Binary Tree ADT
word
download   open file
Tree ADT
word
download   open file
Tree traversal
word
download   open file
Applications of stack and queue
word
download   open file
Expression trees
word
download   open file
Infix to postfix conversion
UNIT 2:
word
download   open file
binary heap
word
download   open file
AVL TREES
word
download   open file
AVL TREES
word
download   open file
binary search tree
word
download   open file
binary heap
word
download   open file
huffman tree
word
download   open file
B-Trees
UNIT 3:
word
download   open file
Shortest path algorithms
word
download   open file
Breadth-first traversal
word
download   open file
Depth first traversal
word
download   open file
Shortest path algorithms
word
download   open file
Applications of graphs: Travelling salesman Problem
word
download   open file
Topological sort
UNIT 4:
word
download   open file
Hashing
word
download   open file
Separate chaining
word
download   open file
Rehashing
word
download   open file
Extendible hashing
word
download   open file
Disjoint Set ADT
word
download   open file
Smart union algorithms
word
download   open file
Path compression
UNIT 5:
word
download   open file
Linear search
word
download   open file
binary search
word
download   open file
heap sort
word
download   open file
merge sort