Computer Science 511 — Information about Assignments

CPSC 511/611 — Information about Assignments

General information about assignments, and the assignments themselves, are provided below.

General Information

• Rules about What is Allowed
  
  
  • Assignment Do’s and Don’ts
  • Academic Integrity: Student Handbook
  • Student Success Centre’s Page for Academic Integrity
  • Information from the University of Calgary Calendar
    
    
• Quality of Work
  
  
  • Expectations about the Quality of Students’ Work on Assignments
  • Writing Support at the University of Calgary
  • Information about Typesetting Assignments: The Not So Short Introduction to LaTeX 2_ε

Assignment #1: Deterministic Computation and Reducibilities

Problems To Be Solved

Assignment #2: NP-Completeness

• Problems To Be Solved

Assignment #3: Space-Bounded Computation

• Problems To Be Solved

Assignment #4: Randomized Complexity Classes

• Problems To Be Solved

cpsc 511/611 computer science faculty of science u of c

cpsc 511 introduction deterministic time nondeterministic time space-bounded computation circuit complexity randomized computation other directions recommended references course administration assignments tests