Data Structures and Algorithms

Stack

1. Array Implementation

2. List Implementation

3. Applications

Queue

1. Array Implementation

2. List Implementation

3. Applications

Lists

1. Singly Linked List

2. Doubly Linked List

3. Circular List

4. Applications

Strings

Tables

Trees

1. Tree Terminology

2. Binary Tree

3. Threaded Tree

4. AVL

5. Applications

Heap

Graphs

1. Graph Terminology

2. Matrix Implementation 

3. List Implementation

4. Graph Traversal

   1. Breadth First Traversal

   2. Depth First Traversal

5. Applications

Sequential

Binary

Hash

Insertion Sort

Selection Sort

Heap Sort

Merge Sort

Bubble Sort

Quick Sort

Sorting with Permutation Array

Comparison of various techniques

Analysing Algorithm

Designing Algorithm

Computational Tractractability

Asymptotic Growth Order

Running Times

1. Linear Time

2. nlog(n) Time

3. Logarithmic Time

4. Quadratic Time

5. Cubic Time

Algorithmic Correctness

Searches and Traversals

Exhaustive Search

Divide and Conquer

Greedy Algoritm

Dynamic Programming

Nondestructive Algorithms

Online Algorithms

After the fact Improvements

Order of Magnitude Improvements

BigO Notation

Average Case Complexity 

Upper and Lower Bounds

Reasonable vs Unreasonable Time

NP-Completness 

Provably Intractable Problems

Undecidability

Fundamental Levels of Algorithmic Behaviour 

Types of Problems 

1. Tractable Problems

2. Intractable Problems

3. Undecidable Problems

4. Highly Undecidable Problems

Finite State Machines

Push Down Automata

Turing Machine

Lambda Calculus

Parallel Algorithms

Concurrent Algorithms

Probabilistic Algorithms 

Quantum Algorithms 

Molecular Algorithms

Reactive Systems

Introduction to AI

Introduction to Knowledge Based Systems