CS 401 - Algorithmic Problem Solving

Credits: 5
Variable Credit Course: No

Lecture Hours: 55
Lab Hours: 0
Worksite/Clinical Hours: 0
Other Hours (LIA/Internships): 0

Course Description: Prepares students for technical interviews by practicing algorithm development, including applying common algorithms as well as novel algorithms, to solve problems. Includes multiple programming strategies such as backtracking and dynamic programming.

Prerequisite: Upper division BSCS enrollment. Admission to BSCS program and Dept. Chair permission.
Meets FQE Requirement: No
Integrative Experience Requirement: No

Student Learning Outcomes

Given a problem in a mock interview, present a solution using an appropriate algorithm.
Given a solution to a programming problem in a mock interview, measure the efficiency of that solution.
Given an inefficient solution to a programming problem, refactor the solution to increase efficiency.

Course Contents

Solutions using an appropriate algorithm.
Efficiencies of solutions.
Solutions to increase efficiency.

Instructional Units: 5