Computer ScienceComputer Science
CS 3151 02 - Data Struct & Discrete Math I
Credits:
4.00
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:
3.00
Lab:
2.00
College:
Coll of Arts/Cult.& Sci Inq.
Department:
Computing and Mathematics
| Campus |
Carrollton Campus |
| Start Date |
JAN 09, 2023 |
End Date |
MAY 09, 2023 |
| Days Taught |
TBA |
Time of Day |
TBA |
Location |
TBA |
TBA |
| Instructor(s):Michael Orsega |
Open Seats:0 of 0 as of 11/29/2023 08:29:14 |
| Pre-requisites:
CS 1302
Minimum Grade:
B
and
MATH 1634
Minimum Grade:
C
|
| Additional Information: |
Instructional Method: Not Technology Enhanced (N) |
|
|