Lecture Notes || SNS Courseware

Lecture Notes

UNIT 1:

Overview

How to create a Program

ordered lists

Analyze a program

Representation of arrays

UNIT 2:

Stacks and Queues: Fundamentals

Mazing Problems

Evaluation of Expressions

Multiple Stacks

Multiple Queue

UNIT 3:

Linked lists: Singly Linked Lists

Doubly Linked Lists

Garbage collection and compaction.

UNIT 4:

Binary Tree Traversals

: Trees: Basic Terminology

Binary Tree and Binary tree representation

Terminology and representation

UNIT 5:

Merge Sort

Quick Sort

Insertion Sort

Heap Sort