Discrete Structures
CSCI 1323
MWF 11:30am-12:20pm, Halsell 340
Brita Munsinger
email: bmunsing@cs.trinity.edu
phone: (210) 999-7399
office hours: M 2-5pm, F 2-4pm, and by appointment
Prerequisite: None. May be taken concurrently with CSCI
1320 or CSCI 1321.
Text: Judith Gersting, Mathematical Structures for Computer
Science, 5th ed., 2003.
This course is an introduction to discrete math used in computer
science, such as sets, graphs, and Boolean algebra.
Topics:
- Formal Logic
- Proofs, Recursion, and Analysis of Algorithms
- Sets, Combinatorics, and Probability
- Relations, Functions, and Matrices
- Graphs and Trees
- Graph Algorithms
- Boolean Algebra and Computer Logic
- Modeling Arithmetic, Computation, and Languages
Homeworks
homework 1 (due 1/28)
homework 2 (due 2/4)
homework 3 (due 2/11)
homework 4 (due 2/20)
homework 5 (due 2/25)
homework 6 (due 3/3)
homework 7 (due 3/10)
homework 8 (due 3/31)
homework 9 (due 4/7)
homework 10 (due 4/14)
homework 11 (due 4/21)
Grading
There will be 11 homework assignments. Late work will not be
accepted. Your lowest grade will be dropped; only your top 10
homework grades will count toward your final grade. No makeups for
pop quizzes.
The midterm will include material covered to that point. The
final exam will contain material from the entire semester. You may take
a make-up midterm if you miss the scheduled time, but the make-up test
will be more difficult.
10 pop quizzes
10%
10 Homework assignments
40%
Midterm exam (Monday, March 1)
20%
Final Exam (Wednesday, May 5, 6:30-9:30pm)
30%
(final
exam schedule from registrar)