Verified Documents at University of British Columbia
- Models of Computation
- University of British Columbia
- Verified Notes
Browse the full collection of course materials, past exams, study guides and class notes for CPSC 121 - Models of Computation at University of British Columbia verified by our …
PROFESSORS
All Professors
All semesters
TIEN, GEOFFREY
winter
8BELLEVILLE, PATRICE
winter
30Verified Documents for BELLEVILLE, PATRICE
Class Notes
Taken by our most diligent verified note takers in class covering the entire semester.
CPSC 121 Lecture Notes - Lecture 3: Xor Gate, Nor Gate, And Gate
Cpsc 121 lecture #3 propositional logic pt. Topics included: simplifying circuits, designing circuits, light switch problem (make a light with 3 switch
399
CPSC 121 Lecture Notes - Lecture 4: Circuit Design
250
CPSC 121 Lecture Notes - Lecture 10: Real Number, Ebcdic, Decimal Mark
Cpsc 121 lecture #3 representing values pt. Topics included: modular arithmetic (module 3. 2, characters (3. 3, thought experiment: is being 1/3 scotti
368
CPSC 121 Lecture Notes - Lecture 11: Machine Code, Thought Experiment
246
CPSC 121 Lecture Notes - Lecture 12: Logical Equivalence, Logical Biconditional, Modus Tollens
31088
CPSC 121 Lecture Notes - Lecture 13: Modus Ponens, Idempotence
Cpsc 121 lecture #13 propositional logic proofs, predicate logic. Topics included: solving propositional logic proofs, logical equivalences and rules o
2111
CPSC 121 Lecture 14: English and Predicate Logic - 2020.02.05 - 2019W2 - UBC
Topics included: predicates and propositions, translating between english and predicate logic, in-class examples. We can"t evaluate if a predicate is t
250
CPSC 121 Lecture Notes - Lecture 15: Fierce Creatures, Tennis Ball, Associative Property
Cpsc 121 lecture #15 predicate logic (continued) The following work that is in italicized text is from https://www. students. cs. ubc. ca/~cs- To add m
333
CPSC 121 Lecture 16: Special Quantifier Properties - 2020.02.10 - 2019W2 - UBC
233
CPSC 121 Lecture Notes - Lecture 17: Empty Set
233
CPSC 121 Lecture Notes - Lecture 18: First-Order Logic, Set Notation, Notation3
Cpsc 121 lecture #18 predicate logic x sets (continued) Topics included: set theory and predicate logic conversion tips, conversions between english, p
341
CPSC 121 Lecture 22: Algorithm Efficiency and Big O - 2020.02.24 - 2019W2 - UBC
2109
CPSC 121 Lecture Notes - Lecture 23: Binary Search Tree, Modus Ponens, Universal Instantiation
Cpsc 121 lecture #23 algorithm efficiency, more on predicates. Topics included: algorithm efficiency and run times, negation law, predicate negations,
338
CPSC 121 Lecture Notes - Lecture 24: First-Order Logic, Universal Quantification, Idempotence
Cpsc 121 lecture #24 transformations and the challenge method. Topics included: more on quantifiers and their transformations, proofs and rules useable
599
CPSC 121 Lecture Notes - Lecture 25: Prime Number
Cpsc 121 lecture #25 transformations and the challenge method. Topics included: direct proofs, with existential quantifiers + examples, with universal
436
CPSC 121 Lecture Notes - Lecture 26: First-Order Logic
375
CPSC 121 Lecture 27: Multiquantifier Proofs - 2020.03.06
231
CPSC 121 Lecture Notes - Lecture 28: Modus Tollens
Cpsc 121 lecture #28 more on proof techniques. Topics included: more direct proof practices, big o proofs, indirect proofs, proof by contrapositive, pr
360
CPSC 121 Lecture Notes - Lecture 29: Talking Lifestyle 1278, First-Order Logic, Irrational Number
251
CPSC 121 Lecture Notes - Lecture 30: Sequential Logic, Sequential Circuits, Infinite Loop
275
CPSC 121 Lecture Notes - Lecture 31: Modus Ponens, Mathematical Induction, Circular Reasoning
337
CPSC 121 Lecture Notes - Lecture 33: Mathematical Induction, Natural Number
Cpsc 121 lecture #32 mathematical induction practice. Induction intro (part 2: mathematical induction doesn"t come up with the formula; you have to fin
338
CPSC 121 Lecture Notes - Lecture 34: Mathematical Induction, Empty String
235
CPSC 121 Lecture Notes - Lecture 35: Mathematical Induction
Cpsc 121 lecture #34 more on induction. We can prove x z, q(x) q(x+1): for this version, the base case is q(1). Then we"d obtain q(1) q(2), therefore q
347
CPSC 121 Lecture Notes - Lecture 36: Mathematical Induction, Circular Reasoning, Quicksort
Cpsc 121 lecture #36 induction and randomized quicksort. Topics included: induction examples, find the ith smallest item. Theorem: every positive integ
345
CPSC 121 Lecture Notes - Lecture 37: Mathematical Induction
Cpsc 121 lecture #37 induction and models of computation. Topics included: a final proof involving mathematical induction, the beginnings of computatio
379
CPSC 121 Lecture Notes - Lecture 38: Konrad Zuse, Central Processing Unit, Eniac
Cpsc 121 lecture #38 computer history & a working computer. Topics included: intro to computer history, a working computer. The start of computing
337
CPSC 121 Lecture Notes - Lecture 39: Program Counter, Boolean Algebra
368
CPSC 121 Lecture Notes - Lecture 40: Regular Expression, Empty String, Scientific Notation
262
CPSC 121 Lecture Notes - Lecture 41: Dfa Records, Halting Problem, Sequential Logic
Cpsc 121 lecture #41 regex to dfas (pt. Topics included: dfas and nfas, limitations of computing. Recap: to turn a regex expression into a dfa : we tur
3124