⚠️ WARNING: This page is a work in progress.
Some details may be incomplete or subject to change!
Detail Information
Duration 120 minutes Format Closed book (no materials) Questions 6–8 problems Total Points 16
Type Points Each Typical Count Description
Definitions 2–3 2 State precisely with example Theorems 3–4 1–2 State and prove or sketch proof Computations 2–3 2–3 Calculate, simplify, construct Proofs 4–5 1–2 Rigorous argument from scratch
Topic Weight What to Expect
Boolean Algebra ~40% Minimization, gates, completeness Formal Logic ~40% Natural deduction, quantifiers, soundness/completeness Set Theory ~10% Operations, power sets, cardinality Relations ~10% Properties, equivalence, functions
Topic Weight What to Expect
Automata Theory ~40% DFA/NFA, regex, pumping lemma Combinatorics ~40% Counting, recurrences, generating functions Graph Theory ~10% Properties, algorithms, theorems Flow Networks ~10% Max-flow, min-cut, algorithms
Criterion Weight What It Means
Correctness ~50% Right answer with valid reasoning Completeness ~25% All necessary steps shown Clarity ~15% Easy to follow, well-organized Rigor ~10% Proper justification, no gaps
💡 Partial Credit : Awarded for correct approach even if final answer is wrong. Show your work!
Detail Information
Duration 15–20 minutes per student Format One-on-one with instructor Preparation 2–3 min after drawing topic Total Points 8
Step Duration What Happens
1. Draw Topic – Receive random topic card from covered material 2. Prep Time 2–3 min Organize thoughts, prepare explanation 3. Explanation ~5 min Present concept clearly to instructor 4. Questions ~10 min Answer follow-up questions, discuss details 5. Grading ~2 min Feedback discussion, grade assigned
Equivalence relations and partitions theorem
Cantor’s diagonalization argument
Functional completeness proofs
Soundness vs completeness distinction
Boolean duality principle
Natural deduction rule systems
Cardinality comparison methods
Pumping lemma for regular languages
Myhill-Nerode theorem
Inclusion-exclusion principle
Max-flow min-cut theorem
Generating functions techniques
NFA to DFA conversion
Recurrence solving methods
Criterion Weight Assessment Questions
Knowledge ~40% Do you know the definition/theorem/concept? Understanding ~30% Can you explain clearly in your own words? Depth ~20% Do you understand beyond surface level? Connections ~10% Can you relate to other topics?
✅ Do This:
Start with precise definition
Give concrete example
Explain significance/applications
Connect to related concepts
Be honest if you don’t know something
❌ Don’t Do This:
Memorize without understanding
Rush through explanation
Ignore the question asked
Make up false information
Panic if you don’t know everything
Type Example
Boolean Minimization Implement Quine-McCluskey algorithm Truth Table Solver Build SAT solver or tautology checker Logic Circuit Design Create circuit optimizer Set Operations Implement power set or partition generator Cardinality Proofs Construct bijections programmatically
Type Example
Automata Simulation Build DFA/NFA simulator Regular Expression Implement regex to NFA converter Graph Algorithms Dijkstra, Bellman-Ford, or flow algorithm Combinatorial Counting Implement counting formula or recurrence solver Generating Functions Build coefficient extractor or series manipulator
Requirement Details
Working Solution Code runs without errors, produces correct output Documentation Clear README explaining approach and usage Code Quality Well-commented, readable, organized Test Cases Include examples demonstrating correctness Explanation Written description of algorithm/approach Analysis Time/space complexity if applicable
|———–|––––|—————–|
| Correctness | ~50% | Does it solve the problem correctly? |
| Efficiency | ~20% | Is the approach reasonable? (Not necessarily optimal) |
| Documentation | ~20% | Is explanation clear and complete? |
| Completeness | ~10% | Are all parts addressed, edge cases handled? |
Before submitting, verify:
⚠️ Avoid These Mistakes
Starting too late – budget 10–15 hours total workNo documentation – code without explanation loses pointsNo test cases – how do we know it works?Overcomplicated – simple correct solution beats complex buggy oneNot asking questions – clarify requirements early!
Week 14 : Start reviewing for written examEnd of semester : Begin practical component immediately when releasedBefore written part : Intensive review, finish practicalAfter written part : Prepare for verbal part, submit practicalVerbal exam day : Light review, stay calm
Don’t neglect practical to study for writtenDo budget time for all three componentsDon’t assume verbal part will be easyDo practice explaining concepts aloudDon’t overcomplicate the practical solutionDo test thoroughly and document well
Good luck with your exams! 🎓