Course | CISC 445 – Introduction to Algorithms |
Date/Time | Tuesday / Thursday 11:00 – 12:20 |
Location | Niswonger – 410 |
Instructor | Walter Wimberly |
Week | Class Activities | Assignments |
1 | Introduction to Class What is an Algorithm Review of Primitive Data Types Review of Complex Data Types | |
2 | Brute Force Search Binary Search Method Weighted Search Methods Indexing | Email your Instructor Visit your Instructor |
3 | Bubble Sort Quick Sort | |
4 | Merge Sort Merge Sorted Insertion Sort | Project 1 |
5 | Binary Tree n-ary Tree Project Work Time | |
6 | Review Breadth First Searching Depth First Searching A Known Search Path | Test |
7 | Extract, Transform, and Load Data Transformations – The unique case of converting to and from Roman Numerals | Project 2 |
8 | Spring Break | |
9 | Solving Graph Problems The Traveling Salesperson Problem Finding the Best Route | |
10 | Introduction to the Tower of Hanoi Solving the Tower of Hanoi Problem | |
11 | Review | Test |
12 | An Introduction to XML Benefits of XML Problems with XML C# example of XML | |
13 | An Introduction to JSON Benefits of JSON Problems with JSON Reading JSON Data Writing JSON Data | |
14 | Calculating Password Complexity | |
15 | Regular Expressions | |
16 | Review Project Work Time | Project 3 |
17 | Final |