TA duties may include marking, leading skills development tutorials, Q&A/Exam/Assignment/Test Review sessions, and laboratories where noted.
Demonstrated familiarity with standard algorithm design techniques (greedy strategies, dynamic programming, network flow and linear programming) and with the theory of NP-completeness. Experience marking proofs of correctness and complexity analysis of algorithms, as well as reductions for NP-completeness. Please indicate your experience with the autograding tools in your application.
- Department of Computer Science
- Course ID
- St George
- $46.24 per hour + 4% vacation pay
- Course Enrollment
- Dates of Appointment
- May 1-September 3, 2020
- Number of Positions
- Number of Hours
- Tutorial/Lab Schedule
- How to Apply
- Submit applications on-line to: https://taships.chass.utoronto.ca/csc…