CS-3151 Data Structures and Discrete Mathematics I
School of Computing, Analytics, and Modeling
Dr. Perry College of Mathematics, Computing, and Sciences
Description
An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.
Lecture Hours: 3.00 Lab Hours: 2.00Total Hours: 4.00
Semesters
| Course Title | Instructor | Campus | Section | Syllabus | Learning Management System |
|---|---|---|---|---|---|
| Data Struct & Discrete Math I | Anja Remshagen, Ph.D. | Carrollton | 01 | external Syllabus via Concourse External Resource | Course Section External Resource |