Information about Assignments
Overview
General information about assignments, and descriptions of the assignments, are provided below.
General Information
Information about Academic Integrity
- Assigment Do’s and Don’ts
- Academic Integrity: Student Handbook
- Student Success Centre’s Page for Academic Integrity
- Information from the University of Calgary Calendar
Information about Effective Teamwork
-
Working in Groups in This Course
- An “ITP Metrics” Presentation about Team Contracts: [ Powerpoint ] [ PDF ]
- An “ITP Metrics” Sample Group Contract: [ Word ] [ PDF ]
- The “ITP Metrics” Web Site
Quality of Work
- Expectations about Quality of Submissions for Assignments
- A Guide to Writing Mathematics, by Dr. Kevin P. Lee
- Student Success Centre’s Page for Writing Support
Typesetting Technical and Mathematical Material
The use of LaTeX and BibTeX is not required. However, these tools provide much better support for text that includes mathematics than alternatives — and some students might find this to be of interest.
Assignment #1: Deterministic Finite Automata and Regular Languages
For assignment #1, groups of students will (ideally) follow a design process, described in lectures, to design a deterministic finite automaton for a given languages. They will also provide part of a proof of their deterministic finite automaton’s correctness. The assignment is based on material introduced during the second week of lectures — on September 9 and September 11 — and in tutorials during the third week of classes — on September 15–18.
Students will complete the assignment if groups of either three or four students. The assignment is in two parts, with the first part due at 11:59 pm on Wednesday, September 24, and with the second part due at 11:59 pm on Friday, October 10.
