CSCE 235H - Introduction to Discrete Structures (Honors)
Spring 2021
Resources & Announcements
- Detailed schedule
- Piazza is the
discussion board. All questions and comments to instructor, TAs
(private) and to class (broadcast) and all online discussions must
be done through Piazza. You
can state your name or write anonymously. No email messages sent
directly will be answered.
- Handin:
Homework must be submitted on handin
- Web Grader: Use the Web Grader to check your
submissions
- Canvas:
All grades will be posted on Canvas.
- Anonymous Suggestion Box
General Info
Time & Place
Lectures: MWF, 12:30 -- 1:20 pm, Avery Hall 119
Recitations: Mondays, 1:30 pm -- 2:20 pm, Avery Hall 119
Instructor & Office Hours
Dr. Berthe Y. Choueiry, AvH 259 and
Zoom meeting room
Office hours: Mondays and Fridays, 4:30 pm -- 5:30 pm or by appointment
UTA & Office Hours
Pre-requisites
CSCE 155 and Math 106. CSCE 156 recommended but not required.
Handouts & Files
Rules & Tools for Success
- Syllabus (PDF)
- Introduction (PPTX)
- Logical Equivalences Cheat Sheet (PDF).
- How to Prepare for an Exam (PPTX).
Slides
Homework
- All homework are due before class on the due date (by
12:30 P.M.).
- Checklist: Guidelines for Submitting Homework (.pdf)
- Homework 01 (.pdf) -
Due Friday, Feb 5, 2021
- Homework 02 (.pdf) - Due Wednesday, Feb 17, 2021
- Homework 03 (.pdf) - Due Monday, Feb 22, 2021
- Homework 04 (.pdf) - Due Monday, March 1 2021
- Homework 05 (.pdf) - Due
Monday, March 8, 2021
- Homework 06 (.pdf) - Due
Friday, Mar 12, 2021
- Homework 07 (.pdf) - Due
Friday, Mar 19, 2021
- Homework 08 (.pdf) - Due
Friday, Mar 26, 2021
- Homework 09 (.pdf) - Due
Friday, Apr 2, 2021
- Homework 10 (.pdf) - Due
Friday, Apr 9, 2021
- Homework 11 (.pdf) - Due
Friday, Apr 16, 2021
- Homework 12 (.pdf) - Due
Friday, 23, 2021
- Homework 13 (.pdf) - Due Friday, Apr 30, 2021
SAT Study
- Part 1: Introduction to Satisfiability
- Part 2:
- Modeling Sudoku as a CNF: Slides (PPT, PDF)
- Simple modeling: Homework (PDF) - Due Feb 22, 2021
- Part 3: MiniSAT
- Installing MiniSAT: Slides (PPT, PDF)
- Running MiniSAT: Homework (PDF) - Due Mar 8, 2021
- DIMACS cnf example file (test.cnf)
- Part 4:
- Part 5:
- Unit Propagation and Variable Ordering in MiniSAT: Slides (PPT) (PDF)
- Sudoku file MiniSAT (Part 2 of 3): Homework (PDF)- Due Mar 22, 2021
- Part 6:
- Part 7:
Recitations (informal notes)
- Working with Latex: Introduction To LaTeX, LaTexHowTo.doc, hw-example.tex, hw-example.pdf, BibliographyFile.bib.
Here are the figures (which can be generated with any drawing software): FIG, EPS, PDF. The example Hello World shown in recitation.
If tables become to large, you can place a table sideways. An example tex file is given with its pdf output.
- Propopositional Logic (PDF, TEX)
- Proofs in PL and FOL (PDF, TEX)
- Proofs and FOL (PDF, TEX)
- Proofs and Sets (PDF, TEX)
- Sets and Functions(PDF, TEX)
- Relations (PDF, TEX)
- Transitive Closure and Partial Orders
(PDF, TEX)
- Partial Orders (PDF, TEX)
- Induction (PDF, TEX)
- Asymptotics and Summations
(PDF, TEX)
- Solving Recurrence Relations
(PDF, TEX)
Videos
- Relations: Relations-P1 (Review),
Relations-P2 (Warshall Algorithm),
Relations-P3 (Equivalence Relations).
- Partial Orders POSET-P1 (Partial Orders),
POSET-P2 (Principle of
Well Ordered Induction),
POSET-P3 (Lexicographic order),
POSET-P4 (Hasse Diagrams),
POSET-P5 (Extremal Elements),
POSET-P6 (Lattices),
POSET-P7 (Topological Sorting).
- Induction:
Induction-P1
(Induction),
Induction-E1 (Example 1),
Induction-E2 (Example 2),
Induction-E3 (Example 3),
Induction-E4 (Example 4),
Induction-E5 (Example 5),
Induction-E6 (Example 6),Induction-P2 (Strong Induction),
Induction-E7 (Example 7),
Induction-E8 (Example 8).
- Algorithms:
Algorithms-P2,
Algorithms-P3.
- Algorithms Analysis:
Algorithms-P4
Algorithms-P5
- Asymptotics:
Asymptotics-P1
Asymptotics-P2
- Sequences and Summations:
Sequences-P1
Sequences-P2
- Recursion:
Recursion-P1,
Recursion-P2,
Recursion-P3,
Recursion-P4.
Recursion-P5.
Recursion-P6.
- Master Theorem:
Master Theorem.
- Combinatorics:
Combinatorics-1,
Combinatorics-2,
Combinatorics-3,
Combinatorics-4,
Combinatorics-5,
Combinatorics-6.
Useful Links