How to register
Winter Session registration
(MaineStreet) and use the following criteria to browse Winter Session courses:
- Institution: ÐÓ°É´«Ã½
- Term: 2025 Spring
- Session: WinterSession
Courses
[UMS06]
COS 161 Algorithms in Programming
The development of algorithms and their implementations in a higher-level programming language, with emphasis on proper design principles and advanced programming concepts. Introduction to the performance analysis of algorithms. Course requirements include a substantial number of programming projects. Prerequisites: grade of C or better in COS 160 or permission of instructor. Offered fall and spring Cr 4.
Section(s):Class Number: 20385
Credits: 4
Class Component: Lecture
Section: 0001
Dates: 5/19/2025 - 7/3/2025
Status: Open
Instructor(s): Xin XZ Zhang
Enrollment: 11 of 30 seats
Location: Web/Online
Instruction Method: Online/Online
More Information
Prerequisites: Prerequisite: C or higher in COS 160
DAYS & TIMES | ROOM | DATES | INSTRUCTOR(S) |
---|---|---|---|
n/a | Online | 5/19/2025 - 7/3/2025 | Xin XZ Zhang |
[UMS06]
COS 470 Topics in Computer Science
Topics to be covered may include philosophy of computers, history of computers, computers and society, simulation, graphics, and other advanced topics. Prerequisite: grade of C or better in COS 285 or permission of the instructor. Cr 3-4.
Section(s):Algorithms for Analysis of Com
Class Number: 21961
Credits: 3
Class Component: Lecture
Section: 0001
Dates: 7/7/2025 - 8/22/2025
Status: Closed
Instructor(s): Craig Tennenhouse
Enrollment: 28 of 30 seats
Location: Web/Online
Instruction Method: Online/Online
More Information
Topic: Algorithms for Analysis of Combinatorial Games.
This course introduces students to combinatorial game theory and standard algorithms for analysis. Topics include backtracking to determine long paths, dynamic programming, Sprague-Grundy Theory, complexity classes, algorithmic complexity, and optimization methods, including genetic algorithms, hill climbing, and simulated annealing. Prerequisites: Prerequisite: C or higher in COS 285
This course introduces students to combinatorial game theory and standard algorithms for analysis. Topics include backtracking to determine long paths, dynamic programming, Sprague-Grundy Theory, complexity classes, algorithmic complexity, and optimization methods, including genetic algorithms, hill climbing, and simulated annealing. Prerequisites: Prerequisite: C or higher in COS 285
DAYS & TIMES | ROOM | DATES | INSTRUCTOR(S) |
---|---|---|---|
n/a | Online | 7/7/2025 - 8/22/2025 | Craig Tennenhouse |
[UMS06]
COS 570 Seminar:Advanced Topics in Computer Science
Topics vary from year to year and will include current research, emerging technologies, and case studies. Cr 3.
Section(s):Algorithms for Analysis of Com
Class Number: 21962
Credits: 3
Class Component: Seminar
Section: 0001
Dates: 7/7/2025 - 8/22/2025
Status: Closed
Instructor(s): Craig Tennenhouse
Enrollment: 2 of 30 seats
Location: Web/Online
Instruction Method: Online/Online
More Information
Topics: Algorithms for Analysis of Combinatorial Games. This course introduces students to combinatorial game theory and standard algorithms for analysis. Topics include backtracking to determine long paths, dynamic programming, Sprague-Grundy Theory, complexity classes, algorithmic complexity, and optimization methods, including genetic algorithms, hill climbing, and simulated annealing.
Prerequisites:
DAYS & TIMES | ROOM | DATES | INSTRUCTOR(S) |
---|---|---|---|
n/a | Online | 7/7/2025 - 8/22/2025 | Craig Tennenhouse |
- Page 1