Description
Discrete structures as they apply to computer science, algorithm analysis and design. Predicate logic. Review of proof techniques;
application of induction to computing problems. Graph theory applications in information technology. Program correctness, preconditions, postconditions and invariants.
Analysis of recursive programs using recurrence relations. Properties of integers and basic cryptographical applications.
Posting limited to :
Professeur à temps-partiel régulier / Regular Part-Time Professor
Date Posted : May 07, 2024
May 07, 2024
Closing Date : June 10, 2024
June 10, 2024
Note : Applications will be accepted until 11 : 59 PM on the day prior to the Posting End Date above
Expected Enrolment : N / A
N / A
Approval date : May 07, 2024
May 07, 2024
Number of credits : Work Hours :
Work Hours : Course type :
Course type : Posting type :
Posting type : Régulier / Regular
Régulier / Regular
Language of instruction :
Anglais English
Competence in second language :
Passive
Course Schedule :
Lundi Monday 10 : 00-11 : 30 Mecredi Wednesday 8 : 30-10 : 00 -
Requirements :
Excellent knowledge of course subject matter, demonstrated by having taught similar or related courses, or demonstrated by relevant work experience.
Regular applicants must have a doctorate and it should be in a field related to the course (especially in the case where the course is more specialized), if not, they must have a relevant work experience in a field related to the course, after having obtained their Ph.D.
Please note that the teaching method for this course will be delivered : IN PERSON.
The contract for this course will include a payment for 52 hours (instead of 39 hours), as it is required that the part-time professor teaching this course attends tutorials at least one hour per week (on average).
Additional Information and / or Comments :
An acceptable level of education and / or experience could be viewed as being equivalent to the educational required and / or demonstrated experience.