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.
Requisites
Prerequisites: CS 1302 Minimum Grade: B and (MATH 1634 Minimum Grade: C or MATH 1501 Minimum Grade: C)
Course Hours
Lecture Hours: 3.00 Lab Hours: 2.00Total Hours: 4.00
Semesters
| Course Title | Instructor | Campus | Section | Syllabus |
|---|---|---|---|---|
| Data Struct & Discrete Math I | Anja Remshagen, Ph.D. | Carrollton | 01 | external Syllabus via Concourse External Resource |
| Course Title | Instructor | Campus | Section | Syllabus |
|---|---|---|---|---|
| Data Struct & Discrete Math I | Anja Remshagen, Ph.D. | Carrollton | 01 | external Syllabus via Concourse External Resource |