USC CSD Home
 

Lectures - CSCI 271, Fall 2011

 
Lecture topics
The following are brief descriptions of topics covered in lectures.
  • 8/23/11 - Introduction: administrative information, motivating examples
  • 8/25/11 - Introduction to propositional logic
  • 8/30/11 - Propositional logic (cont.), introduction to predicates and quantifiers
  • 9/01/11 - Predicates and quantifiers (cont.), nested quantifiers, order of quantifiers, translation from/to english/logic expressions, negation of quantifiers
  • 9/06/11 - Rules of inference and introduction to proofs
  • 9/08/11 - Proof methods
  • 9/13/11 - Algorithms and growth of functions.
  • 9/15/11 - Complexity of algorithms.
 
Discussion topics
The following are brief descriptions of topics covered in the discussion sections (courtesy of the TAs).
  • Discussion on Monday (8/22/2011) by Yu Cheng: review of sets/functions/sequences/summations/cardinality/etc (TXT) and a preview of next week's discussion (TXT)
  • Discussion on Thursday (9/8/2011) by Yu Cheng: homework discussion (TXT)
  • Discussion on Thursday (9/15/2011) by Yuan Yao: review of big-O notation; discussion of problems in section 3.2: 5, 20, 21, 41.
  • Discussion on Monday (9/19/2011) by Yu Cheng: similar to 9/15/2011 discussion.
 

[Last updated Sat Sep 19 2020]    [Please see copyright regarding copying.]