COMP 1002 Syllabus 

Memorial University of Newfoundland, Department of Computer Science
Computer Science 1002: Introduction to Logic for Computer Scientists
Fall 2025

Instructor: Antonina Kolokolova
Office: ER-6033
Office Hours: Mon 1-2pm, Fri 1:30-2:30 (or by appointment)
Email: kol@mun.ca
Please direct all non-personal questions to the Brightspace discussion board; there is a private forum in discussions where your posts are only visible to the instructor/IAs/TAs, for questions about your answers in quizzes and such. 

For issues requiring email, such as a missed lab or test, make sure your message includes "COMP1002" in the subject line and is sent from a valid Memorial University email account. 

Please do not send attachments to kol@mun.ca.

Course Description: COMP 1002 Introduction to Logic for Computer Scientists introduces methods of reasoning and logic tools that underlie computer science. In particular, this course covers propositional and predicate logic, sets and other discrete structures, as well as modular arithmetic and basic counting, with emphasis on their applications in computer science.

Course Prerequisites: None.

Credit Restricted: The former COMP 2742, Electrical and Computer Engineering 4110, The former Engineering 4424, Mathematics 2320. Students cannot receive credit for COMP 1002 if they have previously successfully completed, or are currently registered for, Mathematics 2320.

Reference Materials (optional):

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 8th edition, McGraw-Hill Science, 2019.
Eric Lehman, F Tom Leighton and Albert R Meyer, Mathematics for Computer Scientists (available online).

Learning Goals:

Logic has been called the "calculus of computer science." Just as sciences such as physics that deal with continuous realm rely on calculus techniques, we rely on logic. Indeed, so many areas of our field are based on logic: From designing circuits to determining the complexity of problems, from verifying the correctness of hardware and software to querying databases to automated reasoning in artificial intelligence.  In this course, you will learn to 

Format: 3 lecture hours and 3 lab hours per week.

Lecture time: Monday, Wednesday, Friday 11:00 – 11:50am
Lecture location: ED-3034B
Lab times: Section 002 – Wednesday 2:00 – 4:50pm
Section 003 – Thursday 9:00 – 11:50am
Lab locations: CS-1019 and CS-1009

Evaluation: Your final grade in the course will be determined as follows.

Labs (best 7 of 8): 28% (1% prep quiz, 1% lab exercises and 2% lab quiz in each lab week)
Drills: 10%
Midterm test 1 15%
Midterm test 2 15%
Final exam: 32%
Bonus bug bounty: +2% maximum (note: you cannot receive more than 100% in this course)
IMPORTANT: You have to pass the exam to pass the course!
If you get below 35% on a midterm test, you have to arrange a meeting with the instructor within 48 hours of grades being posted. Failing to do so is an automatic drop.

Tentative Class Schedule:

Week Dates Topics Schedule
1 Sept 10 – 12 Course overview and introduction
2 Sept 15 – 19 Intro to the language of logic
3 Sept 22 – 26 Reasoning in propositional logic
4 Sept 29 – Oct 3 Predicate logic
5 Oct 6 - 10 Reasoning in predicate logic, proofs
6 Oct 13 – 17 Review and test 1 No Monday lecture, no labs, Test 1
7 Oct 20 – 25 Proofs, basic structures, relations
8 Oct 27 – 31 Induction
9 Nov 3 – 7 Recursive definitions Nov 4 is the drop date
10 Nov 10 – 14 Review and test 2 No Wednesday lecture, no labs, Test 2
11 Nov 17 – 21 Structural induction
12 Nov 24 – 28 Counting and combinatorics
13 Dec 1 - 5 Algorithm correctness and efficiency, Review No labs, Practice exam
- Dec 8 - 16 Final exam period. The actual Date/Time of the Final Exam is scheduled by the Registrar's Office later in the semester. Please check Memorial Self Service.

Tentative Lab Schedule:

Lab Date – Section 002 Date – Section 003 Evaluation
0 Sept 10 Sept 11 Lab 0
Not for credit
1 Sept 17 Sept 18 Lab 1
2 Sept 24 Sept 25 Lab 2
3 Oct 1 Oct 2 Lab 3
4 Oct 8 Oct 9 Lab 4
- Oct 15 Oct 16 No lab
5 Oct 22 Oct 23 Lab 5
6 Oct 29 Oct 30 Lab 6
7 Nov 5 Nov 6 Lab 7
- Nov 12 Nov 13 No lab
8 Nov 19 Nov 20 Lab 8
- Nov 26 Nov 27 No lab
- Dec 3 Dec 4 No lab

While every attempt will be made to keep to the schedules listed above, circumstances may necessitate
modifications throughout the semester.

Special Dates:

Evaluation Notes:

Each week’s unit of material has a corresponding lab, and a set of exercises, posted (roughly) weekly, and intended to be completed during the week after the material for that unit is posted. Practice exercises are for practice, and do not have to be submitted, but you are encouraged to show your solutions to the instructor/IAs/TAs for optional feedback. A quarter of the weight of each lab is solving exercises during the lab period. Additionally, ability to solve lab and practice exercises will be tested in quizzes and tests.

Note that there will be no solutions provided to labs, practice exercises, quizzes, or tests. For many problems, especially proofs, there is no single right answer. You can ask questions about your lab work during labs, you are encouraged to discuss them all using discussion board, and you are always welcome to talk to me and instructional assistants in the office hours about your solutions. The evaluation is based on lab exercises, quizzes, drills, and tests. Quizzes and drills will be offered through Brightspace, using Brightspace’s quiz tool, and tests will be in person, pen-and-paper.

Lab and prep quizzes, tests, drills and the final exam are to be done individually and without the use of AI. If cheating is detected for a quiz, test or drill it will be given 0% on the whole quiz/test/drill. The department head will also be notified of any academic misconduct. If academic misconduct is detected for a final exam, the case will be reported to the department head, who will forward it to the Senate Committee on Undergraduate Studies for investigation and appropriate action.

Labs, Lab Quizzes and Prep quizzes

Midterm tests and Final Exams:

Drills:

Bonus bug bounty:

Course Policies:

Academic Misconduct:

Students are expected to adhere to those principles which constitute proper academic conduct. A student has the responsibility to know which actions, as described under Academic Offences in the University Regulations, could be construed as dishonest or improper. Students found guilty of an academic offence may be subject to a number of penalties commensurate with the offence including reprimand, reduction of grade, probation, suspension or expulsion from the University. For more information regarding this policy, students should refer to the University Regulations for Academic Misconduct (Section 6.12) in the University Calendar, revisit the INTG 1000 course in Brightspace, or see the undergraduate page about academic integrity.

Academic misconduct for this course includes (but is not limited to) the following:

Academic Accommodations:

Memorial University of Newfoundland is committed to fostering equitable and accessible learning environments for all students. Accommodations for students with disabilities are provided in accordance with the Accommodations for Students with Disabilities Policy (www.mun.ca/policy/site/policy.php?id=534) and its related procedures. Students who feel that they may require formal academic accommodations to address barriers or challenges they are experiencing related to their learning are encouraged to contact Accessibility Services (the Blundon Centre, www.mun.ca/blundon) at the earliest opportunity to ensure any required academic accommodations are provided in a timely manner. You can contact Accessibility Services (Blundon Centre) by emailing blundon@mun.ca. Students using Blundon services for tests and the final exam are strongly recommended to contact the Blundon Centre at least 3 weeks ahead of the test/exam date to allow for arrangements to be made. Students who are registered with the Blundon Centre are also encouraged to contact the course instructor to discuss accommodations.

Copyright:

All material (lectures, practice problems, labs, tests, exams) delivered or provided in COMP 1002 – Introduction to Programming by Dr. Antonina Kolokolova, including any visual or audio recording thereof, are subject to copyright. It is prohibited to record or copy by any means, in any format, openly or surreptitiously, in whole or in part, in the absence of express written permission from Dr. Antonina Kolokolova any of the lectures, materials provided or published in any form during or from the course. This includes posting any course content online.

Student support for the course:

Additional supports:

All students should be aware of the supports that Memorial University offers, which include: