COMP 322: Fundamentals of Parallel Programming (Spring
...
2023)
Instructor: | Mackale Joyner, DH 2071 | Head TA: | Abbey Baker | Co-Instructor: | Zoran Budimlić, DH 3081 | Graduate 2063 | TAs: | Jonathan Sharman, Srdjan Milakovic | Admin Assistant: | Annepha Hurlock, annepha@rice.edu, DH 3122, 713-348-5186 | Undergraduate TAs: | Ashok Sankaran, Austin Bae, Avery Whitaker, Aydin Zanager, Eduard Danalache, Frank Chen, Hamza Nauman, Harrison Brown, Jahid Adam, Jeemin Sim, Kitty Cai, Madison Lewis, Ryan Han, Teju Manchenella, Victor Gonzalez, Victoria NazariMohamed Abead, Chase Hartsell, Taha Hasan, Harrison Huang, Jerry Jiang, Jasmine Lee, Michelle Lee, Hung Nguyen, Quang Nguyen, Ryan Ramos, Oscar Reynozo, Delaney Schultz, Tina Wen, Raiyan Zannat, Kailin Zhang |
---|---|---|---|---|---|---|---|---|---|---|---|---|
Piazza site: | https://piazza.com/rice/classspring2022/j3w0pi8pl9s8scomp322 (Piazza is the preferred medium for all course communications, but you can also send email to comp322-staff at rice dot edu if needed) | Cross-listing) | Cross-listing: | ELEC 323 | ||||||||
Lecture location: | Sewall Hall 301TBD | Lecture times: | MWF 1:00pm - 1:50pm | |||||||||
Lab locations: | Sewall Hall 301TBD | Lab times: | Mon 3:00pm - 3: | Thursday, 450pm () Tue 4:00pm - 4:50pm () |
Course Syllabus
A summary PDF file containing the course syllabus for the course can be found here. Much of the syllabus information is also included below in this course web site, along with some additional details that are not included in the syllabus.
...
The desired learning outcomes fall into three major areas (course modules):
1) Parallelism: functional programming, Java streams, creation and coordination of parallelism (async, finish), abstract performance metrics (work, critical paths), Amdahl's Law, weak vs. strong scaling, data races and determinism, data race avoidance (immutability, futures, accumulators, dataflow), deadlock avoidance, abstract vs. real performance (granularity, scalability), collective & point-to-point synchronization (phasers, barriers), parallel algorithms, systolic algorithms.
...
3) Locality & Distribution: memory hierarchies, locality, cache affinity, data movement, message-passing (MPI), communication overheads (bandwidth, latency), MapReduce, accelerators, GPGPUs, CUDA, OpenCL.To achieve , MapReduce
To achieve these learning outcomes, each class period will include time for both instructor lectures and in-class exercises based on assigned reading and videos. The lab exercises will be used to help students gain hands-on programming experience with the concepts introduced in the lectures.
To ensure that students gain a strong knowledge of parallel programming foundations, the classes and homeworks homework will place equal emphasis on both theory and practice. The programming component of the course will mostly use the Habanero-Java Library (HJ-lib) pedagogic extension to the Java language developed in the Habanero Extreme Scale Software Research project at Rice University. The course will also introduce you to real-world parallel programming models including Java Concurrency, MapReduce, MPI, OpenCL and CUDA. An important goal is that, at the end of COMP 322, you should feel comfortable programming in any parallel language for which you are familiar with the underlying sequential language (Java or C). Any parallel programming primitives that you encounter in the future should be easily recognizable based on the fundamentals studied in COMP 322.
...
- Module 1 handout (Parallelism)
- Module 2 handout (Concurrency)There is no lecture handout for Module 3 (Distribution and Locality). The instructors will refer you to optional resources to supplement the lecture slides and videos.
There are also a few optional textbooks that we will draw from during the course. You are encouraged to get copies of any or all of these books. They will serve as useful references both during and after this course:
- Fork-Join Parallelism with a Data-Structures Focus (FJP) by Dan Grossman (Chapter 7 in Topics in Parallel and Distributed Computing)
- Java Concurrency in Practice by Brian Goetz with Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes and Doug Lea
- Principles of Parallel Programming by Calvin Lin and Lawrence Snyder
- The Art of Multiprocessor Programming by Maurice Herlihy and Nir Shavit
Lecture Schedule
Finally, here are some additional resources that may be helpful for you:
- Slides titled "MPI-based Approaches for Java" by Bryan Carpenter
Lecture Schedule
WeekWeek | Day | Date (20182022) | Lecture | Assigned Reading | Assigned Videos (see Canvas site for video links) | In-class Worksheets | Slides | Work Assigned | Work Due | Worksheet Solutions | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 0809 | Lecture 1: Task Creation and Termination (Async, Finish) | Module 1: Section 1.1 | Topic 1.1 Lecture, Topic 1.1 Demonstrationworksheet1 | lec1-slidesIntroduction |
| worksheet1 | lec1-slides |
|
| WS1-solution | |||||||||||
| Wed | Jan 1011 | Lecture 2: Computation Graphs, Ideal Parallelism | Module 1: Sections 1.2, 1.3 | Topic 1.2 Lecture, Topic 1.2 Demonstration, Topic 1.3 Lecture, Topic 1.3 Demonstration | worksheet2 | lec2-slides | Homework 1Functional Programming | GList.java | worksheet2 | lec02-slides |
|
| WS2-solution | |||||||||
Fri | Jan 1213 | Lecture 3: Abstract Performance Metrics, Multiprocessor Scheduling | Module 1: Section 1.4 | Topic 1.4 Lecture, Topic 1.4 Demonstration | worksheet3 | lec3-slides | Higher order functions | worksheet3 | lec3-slides |
| WS3-solution | ||||||||||||
2 | Mon | Jan 15No lecture, School Holiday (Martin Luther King, Jr. Day)16 | No class: MLK | ||||||||||||||||||||
| Wed | Jan 1718 | Lecture 4: Parallel Speedup and Amdahl's Law | Module 1: Section 1.5 | Topic 1.5 Lecture, Topic 1.5 DemonstrationLazy Computation | LazyList.java Lazy.java | worksheet4 | lec4-slides | Quiz for Unit 1WS4-solution | ||||||||||||||
| Fri | Jan | 1920 | Module 1: Section 2.1 | Topic 2.1 Lecture, Topic 2.1 Demonstration | Lecture 5: | Future Tasks, Functional Parallelism ("Back to the Future")Java Streams | worksheet5 | lec5-slides | Homework 1 | WS5-solution | ||||||||||||
3 | Mon | Jan 2223 | Lecture 6: Memoization Map Reduce with Java Streams | Module 1: Section 2.24 | Topic 2.2 4 Lecture, Topic 2.2 4 Demonstration | worksheet6 | lec6-slides |
| WS6-solution | ||||||||||||||
| Wed | Jan | 2425 | Lecture 7: | Finish AccumulatorsFutures | Module 1: Section 2.31 | Topic 2. | 31 Lecture , Topic 2. | 31 Demonstration | worksheet7 | lec7-slides | Homework 2 | Homework 1
| WS7-solution | |||||||||
| Fri | Jan 2627 | Lecture 8: Map Reduce Computation Graphs, Ideal Parallelism | Module 1: Section Sections 1.2, 1.4 | Topic 2.43 | Topic 1.2 Lecture, Topic 1.2 Demonstration, Topic 1.3 Lecture, Topic 21.4 3 Demonstration | worksheet8 | lec8-slides | Quiz for Unit 1 | WS8-solution | |||||||||||||
4 | Mon
| Jan 2930 | Lecture 9: Data Races, Functional & Structural DeterminismAsync, Finish, Data-Driven Tasks | Module 1: Sections 2Section 1. 51, 24. 65
| Topic 21. 51 Lecture, Topic 21. 51 Demonstration, Topic 24. 65 Lecture, Topic 24. 65 Demonstration | worksheet9 | lec9-slidesslides | WS9-solution | |||||||||||||||
Wed | Jan 31Feb 01 | Lecture 10: | Java’s Fork/Join LibraryModule 1: Sections 2.7, 2.8 | Topic 2.7 Lecture, Topic 2.8 Lecture, Event-based programming model
| worksheet10 | lec10-slides | Homework 1 | WS10-solution | |||||||||||||||
Fri | Feb | 0203 | Lecture 11: | Loop-Level Parallelism, Parallel Matrix Multiplication, Iteration Grouping (Chunking)Module 1: Sections 3.1, 3.2, 3.3 | Topic 3.1 Lecture , Topic 3.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration, Topic 3.3 Lecture , Topic 3.3 Demonstration GUI programming as an example of event-based, futures/callbacks in GUI programming | worksheet11 | lec11-slides | Homework 2 | WS11-solution | ||||||||||||||
5 | Mon | Feb | 0506 | Lecture 12: | Barrier Synchronization Scheduling/executing computation graphs Abstract performance metrics | Module 1: Section 31.4 | Topic | 31.4 Lecture , Topic | 31.4 Demonstration | worksheet12 | lec12-slides | WS12-solution | |||||||||||
| Wed | Feb | 0708 | Lecture 13: | Parallelism in Java Streams, Parallel Prefix SumsParallel Speedup, Critical Path, Amdahl's Law | Module 1: Section 1.5 | Topic 1.5 Lecture , Topic 1.5 Demonstration | worksheet13 | lec13-slides | Homework 3 (includes two intermediate checkpoints) | Homework 2 | -WS13-solution | |||||||||||
| Fri | Feb 0910 | No class: Spring Recess
| Quiz for Unit 2 | |||||||||||||||||||
6 | Mon | Feb | 1213 | Lecture 14: | Iterative Averaging Revisited, SPMD pattern Accumulation and reduction. Finish accumulators | Module 1: Sections 3Section 2.5, 3.6 | Topic | 3.5 Lecture , Topic 3.5 Demonstration , Topic 3.6 Lecture, Topic 3.6 Demonstration2.3 Lecture Topic 2.3 Demonstration | worksheet14 | lec14-slides | WS14-solution | ||||||||||||
| Wed | Feb 1415 | Lecture 15: Data-Driven Tasks, Point-to-Point Synchronization with Phasers Recursive Task Parallelism | worksheet15 | lec15-slides |
| WS15-solution | ||||||||||||||||
Fri | Feb 17 | Lecture 16: Data Races, Functional & Structural Determinism | Module 1: Sections 42.5, 4.2, 4.32.6 | Topic | 42.5 Lecture , Topic | 42.5 Demonstration, Topic | 42. | 26 Lecture, Topic | 4.2 | Demonstration, Topic 4.3 Lecture, Topic 4.3.6 Demonstration | worksheet15 worksheet16 | lec15lec16-slides | Homework 3 | Homework 2 | WS16-solution | ||||||||
7 | FriMon | Feb 1620 | Lecture 1617: Phasers Midterm Review | Module 1: Sections 4.2 | Topic 4.2 Lecture , Topic 4.2 Demonstration | worksheet16 | lec16-slides | Quiz for Unit 3 | 7 | Mon | Feb 19 | Lecture 17: Midterm Summary | lec17-slides | ||||||||||
| Wed | Feb 22 | Lecture 18: Limitations of Functional parallelism. | worksheet18 | lec17lec18-slides | WS18-solution | |||||||||||||||||
| WedFri | Feb 21 | Midterm Review (interactive Q&A) | Exam 1 held during lab time (7:00pm - 10:00pm), scope of exam limited to lectures 1-16 | |||||||||||||||||||
| Fri | Feb 23 | Lecture 18: Abstract vs. Real Performance | worksheet18 | lec18-slides | Homework 3, Checkpoint-1 | |||||||||||||||||
8 | Mon | Feb 26 | Lecture 19: Pipeline Parallelism, Signal Statement, Fuzzy Barriers | Module 1: Sections 4.4, 4.1 | Topic 4.4 Lecture , Topic 4.4 Demonstration, Topic 4.1 Lecture, Topic 4.1 Demonstration, | worksheet19 | lec19-slides | 24 | Lecture 19: Fork/Join programming model. OS Threads. Scheduler Pattern | Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstration, | worksheet19 | lec19-slides | WS19-solution | ||||||||||
8 | Mon | Feb 27 | Lecture 20: Confinement & Monitor Pattern. Critical sections | Module 2: Sections 5.1, 5.2, 5.6 | Topic 5.1 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstration | worksheet20 | lec20-slides | WS20-solution | |||||||||||||||
| WedFeb | 28Mar 01 | Lecture 20: Critical sections, Isolated construct, Parallel Spanning Tree algorithm, Atomic variables (start of Module 2)21: Atomic variables, Synchronized statements | Module 2: Sections 5. 14, 57.2 , 5.3, 5.4, 5.6 | Topic 5.1 4 Lecture, Topic 5.1 4 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.3 Lecture, Topic 5.3 Demonstration, Topic 5.4 Lecture, Topic 5.4 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstration | worksheet20 | lec20-slides | 7.2 Lecture | worksheet21 | lec21-slides | WS21-solution | ||||||||||||
| Fri | Mar 0203 | Lecture 21: Read-Write Isolation, Review of Phasers | Module 2: Section 5.5 | Topic 5.5 Lecture, Topic 5.5 Demonstration | worksheet21 | lec21-slides | Quiz for Unit 422: Parallel Spanning Tree, other graph algorithms | worksheet22 | lec22-slides | Homework 4 | Homework 3 | WS22-solution | ||||||||||
9 | Mon | Mar 0506 | Lecture 22: Actors23: Java Threads and Locks | Module 2: 6Sections 7.1, 67.23 | Topic 67.1 Lecture, Topic 6.1 Demonstration , Topic 6.2 Lecture, Topic 6.2 Demonstration | worksheet22 | lec227.3 Lecture | worksheet23 | lec23-slides |
| WS23-solution | ||||||||||||
| Wed | Mar 0708 | Lecture 23: Actors (contd)24: Java Locks - Soundness and progress guarantees | Module 2: 6.3, 6.4, 6.5, 6.6 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture , Topic 6.4 Demonstration, Topic 6.5 Lecture, Topic 6.5 Demonstration, Topic 6.6 Lecture, Topic 6.6 Demonstration | worksheet23 | lec23-slides |
| Homework 3, Checkpoint-2 | 7.5 | Topic 7.5 Lecture | worksheet24 | lec24-slides |
| WS24-solution | ||||||||
| Fri | Mar 0910Lecture 24: Java Threads, Java synchronized statement | Lecture 25: Dining Philosophers Problem | Module 2: 7.1, 7.26 | Topic 7.1 Lecture, Topic 7.2 Lecture | worksheet24 | lec246 Lecture | worksheet25 | lec25-slides | Quiz for Unit 5
| WS25- | M-F | Mar 12 - Mar 16 | Spring Breaksolution | |||||||||
Mon | Mar 13 | No class: Spring Break |
| 10 | |||||||||||||||||||
Mon | Wed | Mar | 1915 | Lecture 25: Java synchronized statement (contd), wait/notify | Module 2: 7.2 | Topic 7.2 Lecture | worksheet25 | lec25-slides No class: Spring Break |
| ||||||||||||||
| Fri | Mar 17 | No class: Spring Break |
| |||||||||||||||||||
10 | WedMon | Mar | 2120 | Lecture 26: | Java Locks, Linearizability of Concurrent ObjectsN-Body problem, applications and implementations | worksheet26 | lec26-slides | WS26-solution | |||||||||||||||
| Wed | Mar 22 | Lecture 27: Read-Write Locks, Linearizability of Concurrent Objects | Module 2: 7.3, 7.4 | Topic 7.3 Lecture, Topic 7.4 Lecture | worksheet26 worksheet27 | lec26lec27-slides |
| WS27-solution | ||||||||||||||
| Fri | Mar | 2324 | Lecture | 27: Safety and Liveness Properties, Java Synchronizers, Dining Philosophers Problem28: Message-Passing programming model with Actors | Module 2: 76.51, 76.62 | Topic | 76. | 51 Lecture, Topic | 76.1 Demonstration, Topic 6.2 Lecture | worksheet27 | lec27, Topic 6.2 Demonstration | worksheet28 | lec28-slides |
| Quiz for Unit 6
| WS28-solution | ||||||
11 | Mon | Mar 2627 | Lecture 28: Message Passing Interface (MPI), (start of Module 3) | Topic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture, | worksheet28 | lec28-slides | 29: Active Object Pattern. Combining Actors with task parallelism | Module 2: 6.3, 6.4 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture, Topic 6.4 Demonstration | worksheet29 | lec29-slides |
|
| WS29-solution | |||||||||
| Wed | Mar 2829 | Lecture 29: Message Passing Interface (MPI, contd) | Topic 8.4 Lecture, Topic 8.5 Lecture, Topic 8 Demonstration Video | worksheet29 | lec2930: Task Affinity and locality. Memory hierarchy | worksheet30 | lec30-slides |
| WS30-solution | |||||||||||||
| Fri | Mar | 3031 | Lecture | 3031: | Distributed Map-Reduce using Hadoop and Spark frameworksTopic 9.1 Lecture (optional, overlaps with video 2.4), Topic 9.2 Lecture, Topic 9.3 Lecture | worksheet30 | lec30-slides | Quiz for Unit 7 | Data-Parallel Programming model. Loop-Level Parallelism, Loop Chunking | Module 1: Sections 3.1, 3.2, 3.3 | Topic 3.1 Lecture, Topic 3.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration, Topic 3.3 Lecture, Topic 3.3 Demonstration | worksheet31 | lec31-slides | Homework 5 | Homework 4 | WS31-solution | ||||||
12 | Mon | Apr 0203 | Lecture 31: TF-IDF and PageRank Algorithms with Map-Reduce | Topic 932: Barrier Synchronization with Phasers | Module 1: Section 3.4 | Topic 3.4 Lecture, Topic 9.5 Lecture, Unit 9 Topic 3.4 Demonstration | worksheet31 worksheet32 | lec31lec32-slides |
|
| WS32-solution | ||||||||||||
| Wed | Apr 0405 | Lecture 32: Partitioned Global Address Space (PGAS) programming models | worksheet32 | lec32-slides |
| Homework 4 Checkpoint-133: Stencil computation. Point-to-point Synchronization with Phasers | Module 1: Section 4.2, 4.3 | Topic 4.2 Lecture, Topic 4.2 Demonstration, Topic 4.3 Lecture, Topic 4.3 Demonstration | worksheet33 | lec33-slides |
| WS33-solution | ||||||||||
| Fri | Apr 0607 | Lecture 33: Combining Distribution and Multithreading | Lectures 10.1 - 10.5, Unit 10 Demonstration (all videos optional – unit 10 has no quiz) | worksheet33 | lec33-slides |
| Quiz for Unit 834: Fuzzy Barriers with Phasers | Module 1: Section 4.1 | Topic 4.1 Lecture, Topic 4.1 Demonstration | worksheet34 | lec34-slides |
| WS34-solution | |||||||||
13 | Mon | Apr 0910 | Lecture 34: Task Affinity with Places35: Eureka-style Speculative Task Parallelism |
| worksheet34 worksheet35 | lec34lec35-slides |
|
| WS35-solution | ||||||||||||||
Wed | Apr | 1112 | Lecture | 35: Eureka-style Speculative Task Parallelism36: Scan Pattern. Parallel Prefix Sum |
| worksheet35worksheet36 | lec35lec36-slides | Homework 5 | Homework 4 (all)WS36-solution | ||||||||||||||
Fri | Apr | 1314 | Lecture | 3637: | Algorithms based onParallel Prefix | (Scan) operationsSum applications | worksheet36worksheet37 | lec36lec37-slides | Quiz for Unit 9 | 14 | Mon | Apr 16 | Lecture 37: Algorithms based on Parallel Prefix (Scan) operations, contd. | worksheet37 | lec37-slides | ||||||||
14 | WedMon | Apr | 1817 | Lecture 38: | GPU ComputingOverview of other models and frameworks | worksheet38 | lec38-slides | ||||||||||||||||
Fri | Wed | Apr | 2019 | Lecture 39: Course Review (Lectures | 1819-38) | lec39-slides | Homework 5 | - | |||||||||||||||
Fri | Apr 21 | Lecture 40: Course Review (Lectures 19-38) | lec40-slides | Homework 5 |
Lab Schedule
Lab # | Date (20172022) | Topic | Handouts | Code Examples | 0||
---|---|---|---|---|---|---|
1 | Jan 10 | Infrastructure | Setupsetup | lab0-handout lab1-handout | 1||
2 | Jan | 11Async-Finish Parallel Programming with abstract metrics | lab1-handout, lab1-slides | lab_1.zip | ||
2 | Jan 18 | Futures and HJ-Viz | lab2-handout, lab2-slides | lab_2.zip | ||
3 | Jan 25 | Cutoff Strategy and Real World Performance | lab3-handout, lab3-slides | lab_3.zip | ||
4 | Feb 01 | Java's ForkJoin Framework | lab4-handout, lab4-slides | lab_4.zip | ||
5 | Feb 08 | Loop-level Parallelism | lab5-handout, lab5-slides | lab_5.zip | ||
6 | Feb 15 | Phasers | lab6-handout | lab_6.zip | ||
- | Feb 22 | No lab this week — Exam 1 | - | - | ||
7 | Mar 01 | Isolated Statement and Atomic Variables | lab7-handout, lab7-slides17 | Functional Programming | lab2-handout | |
3 | Jan 24 | Java Streams | lab3-handout | |||
4 | Jan 31 | Futures | lab4-handout | |||
5 | Feb 07 | Data-Driven Tasks | lab5-handout | |||
6 | Feb 14 | Async / Finish | lab6-handout | |||
- | Feb 21 | No lab this week (Midterm) | ||||
7 | Feb 28 | Recursive Task Cutoff Strategy | lab7-handout | |||
8 | Mar | 0807 | ActorsJava Threads | lab8-handout | ||
- | Mar 1514 | No lab this week — (Spring Break) | ||||
9 | Mar 22Java Threads, Java Locks21 | Concurrent Lists | lab9-handout | |||
10 | Mar | 29No lab this week — Willy Week! | 28 | Actors | lab10-handout | 10 |
11 | Apr | 05Message Passing Interface (MPI) | lab1004 | Loop Parallelism | lab11-handout | |
11- | Apr 12 | Apache Spark | lab11-handout 11 | No lab this week | 12 | |
- | Apr | 19Eureka-style Speculative Task Parallelism | lab12-handout 18 | No lab this week |
Grading, Honor Code Policy, Processes and Procedures
Grading will be based on your performance on five homeworks four homework assignments (weighted 40% in all), two exams (weighted 40% in all), weekly lab exercises (weighted 10% in all), online quizzes (weighted 5% in all), and in-class worksheets (weighted 5% in all).
The purpose of the homeworks homework is to give you practice in solving problems that deepen your understanding of concepts introduced in class. Homeworks are Homework is due on the dates and times specified in the course schedule. No late submissions (other than those using slip days mentioned below) will be accepted.
The slip day policy for COMP 322 is similar to that of COMP 321. All students will be given 3 slip days to use throughout the semester. When you use a slip day, you will receive up to 24 additional hours to complete the assignment. You may use these slip days in any way you see fit (3 days on one assignment, 1 day each on 3 assignments, etc.). Slip days will be automatically tracked through the Autograder, more details are available later in this document and in the Autograder user guideusing the README.md file. Other than slip days, no extensions will be given unless there are exceptional circumstances (such as severe sickness, not because you have too much other work). Such extensions must be requested and approved by the instructor (via e-mail, phone, or in person) before the due date for the assignment. Last minute requests are likely to be denied.
Labs must be submitted by the following Wednesday at 4:30pm. Labs must be checked off by a TA prior to the start of the lab the following week.
Worksheets should be completed in class for full credit. For partial credit, a worksheet can be turned in before the start of the class following the one in which the worksheet for distributed, by the deadline listed in Canvas so that solutions to the worksheets can be discussed in the next class.
You will be expected to follow the Honor Code in all homeworks and homework and exams. The following policies will apply to different work products in the course:
- In-class worksheets: You are free to discuss all aspects of in-class worksheets with your other classmates, the teaching assistants and the professor during the class. You can work in a group and write down the solution that you obtained as a group. If you work on the worksheet outside of class (e.g., due to an absence), then it must be entirely your individual effort, without discussion with any other students. If you use any material from external sources, you must provide proper attribution.
- Weekly lab assignments: You are free to discuss all aspects of lab assignments with your other classmates, the teaching assistants and the professor during the lab. However, all code and reports that you submit are expected to be the result of your individual effort. If you work on the lab outside of class (e.g., due to an absence), then it must be entirely your individual effort, without discussion with any other students. If you use any material from external sources, you must provide proper attribution (as shown here).
- HomeworksHomework: All submitted homeworks are homework is expected to be the result of your individual effort. You are free to discuss course material and approaches to problems with your other classmates, the teaching assistants and the professor, but you should never misrepresent someone else’s work as your own. If you use any material from external sources, you must provide proper attribution.
- Quizzes: Each online quiz will be an open-notes individual test. The student may consult their course materials and notes when taking the quizzes, but may not consult any other external sources.
- Exams: Each exam will be a closedopen-book, closedopen-notes, and closedopen-computer individual written test, which must be completed within a specified time limit. No class notes or external materials may be consulted when taking the exams.
Graded homeworks will be returned to you via email, and exams as marked-up hardcopies. If you believe we have made an error in grading your homework or exam, please bring the matter to our
attention within 7 daysFor grade disputes, please send an email to the course instructors within 7 days of receiving your grade. The email subject should include COMP 322 and the assignment. Please provide enough information in the email so that the instructor does not need to perform a checkout of your code.
Accommodations for Students with Special Needs
...