Lecture Notes || SNS Courseware

Lecture Notes

UNIT 1:

Introduction: Overview

ordered lists

- Representation of arrays

UNIT 2:

Multiple Stacks and Queues

Mazing Problems

Evaluation of Expressions

Stacks and Queues: Fundamentals

UNIT 3:

Linked Stacks and Queues

Doubly Linked Lists and Dynamic Storage management

Garbage collection and compaction

Doubly Linked Lists and Dynamic Storage management

UNIT 4:

Binary Tree Traversals

Graphs: Terminology and representation

Depth first search and breadth first search

UNIT 5:

Searching: Liner and Binary search

, Sorting: Insertion Sort

Heap Sort