Information about Assignments

Information about Assignments

Rules About Assignments — and Other Relevant Information

• Assignments: What To Do and What To Avoid
• Academic Honesty: From “Continuing Education,” a readable discussion of academic dishonesty — with links to other useful resources about this

Of course, I hope that you will not need the information in the next section, below! With that noted, here is the information found in the 2017–18 Calendar about Academic Misconduction and (more specifically) Plagiarism.

• 2017–18 Calendar: Student Misconduct (Introduction)
• 2017–18 Calendar: Statement of Intellectual Honesty
• 2017–18 Calendar: Plagiarism/Cheating/Other Academic Miscontuct
  • Definitions
  • Notations and Penalties
  • Procedures
  • Academic Miscontuct — Criminal Offence
  • Disciplinary Appeals

Assignment #1: Analysis of Simple Algorithms

• Problems To Be Solved
• LaTeX Source for This Assignment

Assignment #2: Divide and Conquer

• Problems To Be Solved
• LaTeX Source for This Assignment

Assignment #3: Dynamic Programming and Memoization

• Problems To Be Solved

Assignment #4: Greedy Algorithms

• Problems To Be Solved

Assignment #5: NP-Completeness

• Problems To Be Solved
• A List of NP-Complete Decision Problems

cpsc 413 computer science faculty of science u of c

CPSC 413 introduction and math review analysis of algorithms divide and conquer dynamic programming greedy algorithms complexity theory assignments tests