This document outlines the syllabus for a CS 332 algorithms course. It discusses the following key points: - The course will introduce rigorous design and analysis of algorithms through lectures, homework, exams, and a textbook. - Grading will be based on homework, exams, final exam, and participation. The instructor is David Luebke and TA is Pavel Sorokin. - Core topics will include proof by induction, asymptotic notation, and analyzing algorithms' time and space complexity as input size increases. Analysis will focus on worst-case performance.