Visit the Registration Dates & Timelines website for registration date information.
Visit the Business Services website for information about tuition and fee rates. Your fee statement will be available in e-Services upon registration.
Visit the Business Services website for information about tuition and fee rates. Your fee statement will be available in e-Services upon registration.
| 5 courses found | ||||||||||||
| Computer Science | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ID | Dept. | Crs. | Sect. | Title | Cr. | Days | Time | Dates | Location | Instructor | Method | Size |
| 263888 | CS | 1310 | 01 | Computational Problem Solving & Society | 3 | T H | 2:00pm - 3:15pm | 8.25.25-12.17.25 | M 250 | Neville, Francois | 28/30 | |
| Introduction to general problem-solving techniques applicable to solving problems in computing, including elementary computational problems. Other techniques include using systematic lists, using diagrams, and looking for patterns. Includes fundamental computational concepts in information representation, computer organization, and social and ethical issues in computing. Occasional use of the computer lab allows the use of software to solve a variety of problems. The prospective student should have a general understanding of computers and their operation. Prerequisite(s): Successful completion of MATH 0800 with a grade of B or better, or three years of high school mathematics (including two years of algebra) and a score on the Mathematics Placement Test appropriate for placement into MATH 1170. [Core Curriculum Goal Area(s) 4 & 9] | ||||||||||||
| 263887 | CS | 2321 | 15 | Computer Science I | 4 | M W F | 9:00am - 9:50am | 8.25.25-12.17.25 | HSH 205 | Neville, Francois | HYFL | 18/24 |
| H | 12:00pm - 1:50pm | 8.25.25-12.17.25 | S 371 | HYFL | ||||||||
| Course instruction is delivered both in-person (section 15) and online asynchronous (section 85). Choose the section that is your primary participation method. As a multimodal offering, students have the option to participate in either section on any day. | ||||||||||||
| Introduction to the basic principles of software development using a modern high-level language, including using selection, looping, function calls, and recursion, along with simple data structures such as arrays and objects, to solve problems. Includes an introduction to software engineering techniques such as interactive debugging, software testing, and methods of software validation. Includes a two-hour lab. Prerequisite(s): MATH 1170 or higher. | ||||||||||||
| 264126 | CS | 2321 | 85 | Computer Science I | 4 | 8.25.25-12.17.25 | Neville, Francois | ONL | ||||
| 8.25.25-12.17.25 | Neville, Francois | HYFL | ||||||||||
| Course instruction is delivered both in-person (section 15) and online asynchronous (section 85). Choose the section that is your primary participation method. As a multimodal offering, students have the option to participate in either section on any day. | ||||||||||||
| Introduction to the basic principles of software development using a modern high-level language, including using selection, looping, function calls, and recursion, along with simple data structures such as arrays and objects, to solve problems. Includes an introduction to software engineering techniques such as interactive debugging, software testing, and methods of software validation. Includes a two-hour lab. Prerequisite(s): MATH 1170 or higher. | ||||||||||||
| 263886 | CS | 3507 | 01 | Introduction to Databases | 3 | M W F | 2:00pm - 2:50pm | 8.25.25-12.17.25 | HSH 205 | Neville, Francois | 17/35 | |
| Provides an introduction to the theory and use of modern database systems, with particular focus on SQL, the relational data model, and relational database design. Prerequisite: CS 2322. May not be offered every year. | ||||||||||||
| 263885 | CS | 3528 | 01 | Data Structures and Algorithms | 4 | MTW F | 11:00am - 11:50am | 8.25.25-12.17.25 | HSH 205 | Neville, Francois | 10/35 | |
| Study of advanced abstract information storage structures, including priority queues, binary trees, generalized trees, and graphs. Study of algorithm development techniques, including divide and conquer, greedy algorithms, and dynamic programming. Includes learning a programming language not used in CS 2321 and CS 2322. Prerequisites: CS 2322 and MATH 2210 or consent of the instructor. | ||||||||||||
Delivery Method Key
- No delivery method shown indicates course is delivered in-person on-campus.
- BLND Blended/hybrid: 25-75% of course is delivered online with regularly scheduled in-person meetings.
- HYFL Course instruction is delivered both in-person and online, you choose the method that is right for you.
- ONL Course is delivered completely online.
- ONLP Course is delivered completely online with proctored exams or up to two in-person meetings.
- ONLS Course is delivered completely online with all or some synchronous class meetings.
Course data last update: 2025-07-14 4:47:30pm
Next course data update: 2025-07-14 5:59:10pm
Next course data update: 2025-07-14 5:59:10pm