Programming Foundations

Summer 2025: June 2-August 19

Description

An accelerated object-oriented programming course that prepares students without sufficient undergraduate preparation for the graduate program in computer science. Coverage includes software specification, design, implementation, debugging techniques, dynamic memory, I/O, linked lists, stacks, queues, recursion, trees, search structures, hashing, heaps, sorting algorithms, graph algorithms, and an introduction to the complexity of algorithms. Foundational data structures and algorithms are studied and analyzed using both mathematical and empirical measurements. The course includes a number of large programming assignments focusing on object-oriented software engineering and algorithm development.
Prerequisite: Graduate Standing.

Class Notes

This course is only available to students who have applied to the Online Masters in Computer Science Degree Program.

Class Details

Instructor
Instructor Name (static text): 
Tillquist, Richard C
Location

WWW ONLINE

Class Registration Information

Class #
1310
Course
CSCI 310 -
SECT 601
Units
6
Fees
Amount per Unit
  • $600 / unit
Capacity
2/25
Class Meeting Dates

06/16/2025 - 08/19/2025

Days

TBA

Times

Registration

Class Fee: $3,600.00
CSCI 310 - SECT 601

Programming Foundations

Class: 1310 Units: 6 Fees: $3,600.00

M-F 06/16/2025 - 08/19/2025 TBA

An accelerated object-oriented programming course that prepares students without sufficient undergraduate preparation for the graduate program in computer science. Coverage includes software specification, design, implementation, debugging techniques, dynamic memory, I/O, linked lists, stacks, queues, recursion, trees, search structures, hashing, heaps, sorting algorithms, graph algorithms, and an introduction to the complexity of algorithms. Foundational data structures and algorithms are studied and analyzed using both mathematical and empirical measurements. The course includes a number of large programming assignments focusing on object-oriented software engineering and algorithm development.
Prerequisite: Graduate Standing.

Class Notes

An accelerated object-oriented programming course that prepares students without sufficient undergraduate preparation for the graduate program in computer science. Coverage includes software specification, design, implementation, debugging techniques, dynamic memory, I/O, linked lists, stacks, queues, recursion, trees, search structures, hashing, heaps, sorting algorithms, graph algorithms, and an introduction to the complexity of algorithms. Foundational data structures and algorithms are studied and analyzed using both mathematical and empirical measurements. The course includes a number of large programming assignments focusing on object-oriented software engineering and algorithm development.

Instructor
Instructor Name (static text): 
Tillquist, Richard C
Location
WWW ONLINE