CourseCISC 445 – Analysis of Algorithms
Date/TimeTuesday / Thursday 11:00 – 12:20
LocationMeen 101
InstructorWalter Wimberly

Course Description

This course provides an introduction to mathematical modeling of computational problems. It also introduces the analysis of algorithms using big O notation. Topics include date structures, files, trees, sorting, searching, encryption and NP completeness. Algorithms will be expressed and evaluated by creating programs.

Pre-Req: Data Structures

Class ActivitiesAssignments
Introduction to Class
Introduction to C#
Review of Primitive Data Types
Review of Complex Data Types
What is an Algorithm?
Types of Algorithms
What is Big O Notation?
Constant Time – O(1) Algorithms
Logarithmic Time – O(log n) Algorithms
Linear Time – O(n) Algorithms
O(n log n) Algorithms
O(n^2) Quadratic and O(n^3) Cubic Algorithms
O(2^n) Exponential Algorithms
O(n!) Factorial Algorithms
Brute Force Search
Binary Search Method
Weighted Search Methods
Indexing
Bubble Sort
Quick Sort
Merge Sort
Merge Sorted
Insertion Sort 		Project 1
Binary Tree
n-ary Tree
Breadth First Searching
Depth First Searching
A Known Search Path		 Test

Extract, Transform, and Load
Data Transformations – The unique case of converting to and from Roman Numerals		 Project 2
Solving Graph Problems
The Traveling Salesperson Problem
Finding the Best Route
Introduction to the Tower of Hanoi
Solving the Tower of Hanoi Problem
Calculating Password Complexity
Regular Expressions
Other Sample ProblemsProject 3