CSCI 1315
Discrete Math for CS
Lec 01 selected
This course is an introduction to formal reasoning and discrete mathematics with applications to computer science. Students will be introduced to formal notation and reasoning about problems and algorithms. Topics include: sets, sequences, and summations, simple proof techniques, elementary number theory, back-of-the-envelope approximations, combinatorial objects. Applications and relevance of these concepts in computer science will be emphasized.
Sections
Lecture
Lec 01
Tue, Thu, Fri 8:35-9:25
Syllabus
Have the syllabus for CSCI 1315? Share it and everyone gets the grading, textbooks and rules.