0_intro
0_intro
1
About Me
I am a fourth-year (fifth-year next fall) Ph.D. student.
4
Collaboration and Communication
Public questions, concerns: encouraged to post on Piazza
at https://piazza.com/unc/summer2017/comp283/home
Private/confidential ones: to my email, [email protected]
Class participation bonus: up to half a letter grade
Class etiquette
Don’t agree with the grading or the standard solutions?
appeal – your right and responsibility
“Anything can be appealed.”
the instructor plays the judge
no cheating will be tolerated 5
About this course
Undergraduate Bulletin:
Introduces discrete structures (sets, tuples, relations, functions, graphs,
trees) and the formal mathematics (logic, proof, induction) used to establish
their properties and those of algorithms that work with them.
Develops problem-solving skills through puzzles and applications central to
computer science.
7
Logic
Undergraduate Bulletin:
Introduces discrete structures (sets, tuples, relations, functions, graphs,
trees) and the formal mathematics (logic, proof, induction) used to establish
their properties and those of algorithms that work with them.
Develops problem-solving skills through puzzles and applications central to
computer science.
8
Math: Numbers and Counting
Undergraduate Bulletin:
Introduces discrete structures (sets, tuples, relations, functions, graphs,
trees) and the formal mathematics (logic, proof, induction) used to establish
their properties and those of algorithms that work with them.
Develops problem-solving skills through puzzles and applications central to
computer science.
9
Textbook and Topics
Discrete Mathematics with Applications, 4th Edition
by Susanna S. Epp
basics of variables, sets,
Ch. 1. Speaking Mathematically functions and relations
Ch. 2. The Logic of Compound Statements Propositional Logic
Ch. 3. The Logic of Quantified Statements First-order Predicate Logic
Ch. 4. Elementary Number Theory and Methods of Proof
Ch. 5. Sequences, Mathematical Induction, and Recursion
Ch. 6. Set Theory
Ch. 7. Functions
Ch. 8. Relations
Ch. 9. Counting and Probability
Ch. 10. Graphs and Trees Covered in COMP 410
Ch. 11. Analysis of Algorithm Efficiency and COMP 550
Ch. 12. Regular Expressions and Finite-State Automata
Covered in COMP 455
10