Lecture Outline
FCM 818
Spring 2011
Lecture Outline
Limits
Lecture
Date
1
29-Jan
2
5-Feb
3
19-Feb
4
5-Mar
5
12-Mar
6
19-Mar
7
26-Mar
8
2-Apr
Series
Simple Programs
Big-O Analysis
Control Structures
Array
Functions
Dynamic Variables
User-defined Data
Types
Matrix
Linear Data
Structures
Recursive Function
9
9-Apr
10
16-Apr
11
30-Apr
12
7-May
13
14-May
Binary Trees
Graphs
Hash Table
Modular Arithmetic
Groups
Time Complexity
Topics
Limits - Definition
Rules in Finding the Limits
Geometric Series and Arithmetic Series
Logarithm
Storage, Input, Process, Output
Simple Data Types: int, char, float
Boolean Conditions
Order of Functions: log n, n , n log n, n2, 2n
Growth Rate of Functions
Big-O Analysis
if-else statements
Algebraic Expressions
For-loops & while loops
Getting Input - keyboard, file, random number generator
Problems using loops
Array of Integers
Strings: Array of Characters
Two dimensional Array
Pointers
Syntax of a Function
Three Components: Definition, Prototype and Call of a Function
Given one component, to write the other two
Three ways to Pass a Parameter: By Value, By Name, By Reference
Manual Trace of a Function Call
Problems using Functions
Dynamic Variables
Data Types using struct
Dynamic Arrays
Use class to define an Object
Three Environments: Definition, Implementation and User
Declare an Object: Matrix
Process an Object using Member Functions
Define Member Functions
Implement Member Functions
Overloading operators: "<<" and ">>"
Matrix Operatiions
Linked List
Stack
EXAMINATION: From 9:30am to 10:30am
Queue
Recursion
Binary Tree - Definition
Complete Binary Tree
Height of a CBT
Implementation of a CBT
Heap and Priority Queue
Traversing a BT: Inorder, Preorder, Postorder
Depth First Search and Breadth First Search
Binary Search Tree
Insert, Search, Delete
Definition
Adjacency Matrix & Adjacency List
Connected - Minimum Edges Required
Breadth First Search
Depth First Search
Minimum Spanning Tree
Perfect Hashing
Resolving Collisions
Modular Addition
Modular Multiplication
Modular Equation
Axioms
Examples with Modular Arithmetic
Solving Modular Equations
Recurrence Relations
Linear vs Binary Search
Insertion sort vs Quuick sort
Insert & Remove from a Stack/Queue/Heap
Insert & Search in a Binary Search Tree
Insert/Search in a Hash Table
Searching (Linear and Binary)
Sorting (Selection, Insertion, Quick)
Breadth/Depth First Search Algorithms
Take Home Examination - Assigned: May 21 - Due: May 24
5/9/2011
Mantharam