CSIS 430 - Analysis of Algorithms

Course Description

An introduction to the formal design and analysis of algorithms in terms of both time and space complexity. Paradigms covered include divide-and-conquer, greedy, dynamic programming, and heuristic techniques.


Dr. David M. Hansen
Current Weekly Schedule


  • Mark Allen Weis Data Structures and Algorithm Analysis in Java 3rd Ed. (texbook is shared with CSIS310)
Recommended (not available from bookstore - but available online)


This course moves beyond the study of data structures to study and analyze efficient algorithms and paradigms for their design.
  • Students will acquire the basic mathematical skills for analyzing algorithms.
  • Students will be able to design efficient algorithms using appropriate paradigms to solve specific problems.
  • Students will experiment with the implementation of various algorithms using varying techniques and will compare experimental results with predicted theoretical results.

Course Organization

This course will emphasize both theory and practice. Algorithms studied through lecture and reading will be implemented in a high-level language. Experimental results will be compared with predicted theoretical results.

Programming assignments will be carried out in a prescribed high-level language. Minimal instruction in the use of this language will be provided, you will be expected to achieve sufficient competence on your own.

The course will include regular homework and programming assignments (please see my comments on collaboration and programming). Assignments are due BEFORE the beginning of class on the due date; there will be NO CREDIT given for late assignments (without an excused absence) - turn in as much as you can.

Reading assignments should be completed before the lecture covering the material. Not all reading material will be covered in the lectures, but you will be responsible for the material on homework and exams. Quizzes over the assigned reading may be given at any time.

The Vision Statement of the Computer Science and Information Systems majors states that our students are distinctive by: "Bringing a Christ-centered worldview to our increasingly technological world." As one step towards the fulfillment of this objective, each semester, we will identify an influential Christian writing to be read and reflected upon by students in our classes throughout the term. This will be treated as an official component of every course and will be uniquely integrated and assessed at our discretion, generally as a component of the quiz grade. See the semester's reading schedule. In addition, regular meetings will be scheduled throughout the semester that can be attended for Chapel credit.

It is my hope that students will not view this as one more task to complete, but as a catalyst for continued discussion ultimately leading to a deeper walk with Christ.

The chief end of man is to glorify God, and enjoy Him forever.
(Westminster Confession)

If you have specific physical, psychiatric, or learning disabilities and require accommodations, please contact the Disability Services Office as early as possible so that your learning needs may be appropriately met. You will need to provide current documentation of your disability to the Disability Services Office. For more information, go to ds.georgefox.edu or contact Rick Muthiah, Dean of the Center for Teaching and Learning (ext. 2314)


Grading Scale

The final grade will be based on:

Tentative Schedule

Week DateTopicReading
1 1/10 Introduction  
1/12 Review 1.2-1.3, 2.1-2.3, 3
2 1/17 Running Time FoCS 3.1-3.8; 2.4
1/19 Graph Representations 9.1-9.2, FoCS 9.1-9.3
3 1/24 Shortest Paths 9.3, FoCS 9.8-9.9
1/26 Network Flow 9.4
4 1/31 Minimum Spanning Tree 9.5, FoCS 9.5
2/2 Brute-Force Search 9.6, FoCS 9.6
5 2/7 Introduction to NP 9.7; Genetic TSP
2/9 Greedy Algorithms 10.1
6 2/14 Divide & Conquer; Recurrence Equations and the Master Theorem 10.2; FoCS 3.9-3.12
2/16 Dynamic Programming 10.3
7 2/21 Edit Distance PDF, 1-3; 5-5.1; skim rest
2/23 Randomized Algorithms 10.4
8 2/28 Encryption PDF
3/2 Backtracking Algorithms 10.5; PDF
9 3/7 Sorting Review & Recursion 7.6-7.7
3/9 Midterm Exam
10 3/14 Sorting Bounds 7.8-7.10
3/16 Radix and External Sorting 7.11-7.12
11 3/21 Disjoint Set 8.1-8.3
3/23 Union-Find Algorithm 8.4
12 Spring Break
13 4/4 Union-Find Analysis 8.5-8.7
4/6 Algorithms  
14 4/11 AVL & Splay Trees 4.3-4.6
4/13 B-Trees and Treaps 4.7, 12.2-12.3
15 4/18 Bloom Filters PDF
4/20 Algorithms & Review  
This page was last updated .
For questions or comments about this page, please email the webmaster.