recursion and generating functions, applications to computer science, and graph theory. MATH 1290 Calculus IB, or MATH 1310 Calculus I, or MATH 1380 Calc. for the Life Sciences I. or Permission of ...

Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

A BS in Computer ... the Bachelor of Science (BS) offers students a more technical route than the Bachelor of Arts (BA), which requires 36 hours. Your coursework will include math and natural sciences ...

Learn the fundamentals of computer science, including programming techniques ... Advanced Programming Techniques in Java COSI 21a: Data Structures and the Fundamentals of Computing COSI 29a: Discrete ...

Undergraduate algorithms (CSCI 3104), data structures (CSCI 2270), discrete mathematics (CSCI 2824 ... knowledge of writing programs in Python3. Python3 functions, and control loops. Data structures: ...