COMP 322: Fundamentals of Parallel Programming (Spring
...
2022)
InstructorInstructors: | Mackale Joyner, DH 2063 Zoran Budimlić, DH 3003 | Head TAs: | Adrienne Li, Austin Hushower, Claire Xu, Diep Hoang, Hunena Badat, Maki Yu, Mantej Singh, Rose Zhang, Victor Song, Yidi Wang | ||
---|---|---|---|---|---|
Admin Assistant: | Annepha Hurlock, annepha@rice.edu , DH 3122, 713-348-5186 | Undergraduate TAs: |
| ||
Piazza site: | Piazza site: | https://piazza.com/class/khclqrtu2133zo (Piazza is the preferred medium for all course communications) | Cross-listing: | ELEC 323 | |
Lecture location: | Fully OnlineHerzstein Amphitheater (online 1st 2 weeks) | Lecture times: | MWF 1:30pm 00pm - 21:25pm50pm | ||
Lab locations: | Fully OnlineKeck 100 (online 1st 2 weeks) | Lab times: | Tu 1Mon 3:30pm 00pm - 23:25pm, Th 50pm (Austin, Claire) Wed 4:50pm 30pm - 5:45pm20pm (Hunena, Mantej, Yidi, Victor, Rose, Adrienne, Diep, Maki) |
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 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
Week | Day | Date (2022 |
---|
Lecture Schedule
Week | Day | Date (2021) | Lecture | Assigned Reading | Assigned Videos (see Canvas site for video links) | In-class Worksheets | Slides | Work Assigned | Work Due | Worksheet Solutions | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 2510 | Lecture 1: Task Creation and Termination (Async, Finish) | Module 1: Section 1.1 | Topic 1.1 Lecture, Topic 1.1 DemonstrationIntroduction |
| worksheet1 | lec1-slides | worksheet1 | lec1-slides |
|
| WS1-solution | |||||||||||||||||
| Wed | Jan 2712 | 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 1 |
| Functional Programming | GList.java | worksheet2 | lec02-slides |
|
| WS2-solution | ||||||||||||||
Fri | Jan 2914 | Lecture 3: Abstract Performance Metrics, Multiprocessor Scheduling | Module 1: Section 1.4 | Topic 1.4 Lecture, Topic 1.4 Demonstration | worksheet3 | Higher order functions | worksheet3 | lec3-slides lec3-slides |
| WS3-solution | ||||||||||||||||||||
2 | Mon | Jan 17 | No class: MLK | |||||||||||||||||||||||||||
| Wed | Jan 19 | Lecture 4: Lazy Computation | LazyList.java Lazy.java | Feb 01 | Lecture 4: Parallel Speedup and Amdahl's Law | Module 1: Section 1.5 | Topic 1.5 Lecture, Topic 1.5 Demonstration | worksheet4 | lec4-slides | Quiz for Unit 1 | WS4-solution | ||||||||||||||||||
| WedFri | Feb 03Jan 21 | Lecture 5: | Future Tasks, Functional Parallelism ("Back to the Future")Java Streams | Module 1: Section 2.1 | Topic 2.1 Lecture, Topic 2.1 Demonstrationworksheet5 | lec5-slides | Homework 1 | WS5-solution | |||||||||||||||||||||
3 | FriMon | Feb 05Jan 24 | Lecture 6: Finish Accumulators Map Reduce with Java Streams | Module 1: Section 2.34 | Topic 2.3 4 Lecture, Topic 2.3 4 Demonstration | worksheet6 | lec6-slides |
| WS6-solution | |||||||||||||||||||||
| 3Wed | MonJan 26 | Feb 08 | Lecture 7: | Map ReduceFutures | Module 1: Section 2.41 | Topic 2. | 41 Lecture , Topic 2. | 41 Demonstration | worksheet7 | lec7-slidesHomework 2 |
| Homework 1 | WS7-solution | ||||||||||||||||
| WedFri | Feb 10Jan 28 | Lecture 8: Data Races, Functional & Structural Determinism Computation Graphs, Ideal Parallelism | Module 1: Section Sections 1.2.5, 21.63 | Topic 1.2 .5 Lecture, Topic 1.2 .5 Demonstration, Topic 21.6 3 Lecture, Topic 21.6 3 Demonstration | worksheet8 | lec8-slides | Quiz for Unit 1 | WS8-solution | |||||||||||||||||||||
4 | Mon
| Fri | Feb 12 | Jan 31 | Lecture 9: Java’s Fork/Join LibraryAsync, Finish, Data-Driven Tasks | Module 1: Sections 2Section 1. 71, 24. 85
| Topic 21. 7 Lecture1 Lecture, Topic 1.1 Demonstration, Topic 24. 8 Lecture5 Lecture, Topic 4.5 Demonstration | worksheet9 | lec9-slidesslides | Quiz for Unit 2 | WS9-solution | |||||||||||||||||||
4 | MonWed | Feb | 1502 | Lecture 10: | Loop-Level Parallelism, Parallel Matrix Multiplication Event-based programming model
| Module 1: Sections 3.1, 3.2 | Topic 3.1 Lecture , Topic 3.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration | worksheet10 | lec10-slides | WS10-solution | ||||||||||||||||||||
WedFri | Feb 17Spring "Sprinkle" Day (no class)04 | Lecture 11: GUI programming as an example of event-based, futures/callbacks in GUI programming | worksheet11 | lec11-slides | Homework 2 | Homework 1 | WS11-solution | |||||||||||||||||||||||
5 | FriMon | Feb | 1907 | Lecture | 11: Iteration Grouping (Chunking), Barrier Synchronization12: Scheduling/executing computation graphs Abstract performance metrics | Module 1: Sections 3.3, 3Section 1.4 | Topic | 3.3 Lecture , Topic 3.3 Demonstration, Topic 3.1.4 Lecture | , | Topic | 31.4 Demonstration | worksheet11worksheet12 | lec11lec12-slides | WS12-solution | ||||||||||||||||
| 5 | MonWed | Feb 2209 | Lecture 12: Parallelism in Java Streams, Parallel Prefix Sums 13: Parallel Speedup, Critical Path, Amdahl's Law | Module 1: Section 31.75 | Topic Topic 3.7 Java Streams1.5 Lecture , Topic 31. 7 Java Streams5 Demonstration | worksheet12worksheet13 | lec12lec13-slides | Quiz for Unit 2 | WS13-solution | ||||||||||||||||||||
| WedFri | Feb | 2411 | Lecture 13: Iterative Averaging Revisited, SPMD pattern | Module 1: Sections 3.5, 3.6 | Topic 3.5 Lecture , Topic 3.5 Demonstration , Topic 3.6 Lecture, Topic 3.6 Demonstration | worksheet13 | lec13-slides | Homework 3 (includes 2 intermediate checkpoints) Quiz for Unit 3 | Homework 2 | No class: Spring Recess
| |||||||||||||||||||
6 | Mon | Feb 14 | Lecture 14: Accumulation and reduction. Finish accumulators | Module 1: Section 2.3 | Topic 2.3 Lecture Topic 2.3 Demonstration | worksheet14 | lec14-slides | WS14-solution | ||||||||||||||||||||||
| Wed | Feb 16 | Lecture 15: Recursive Task Parallelism | worksheet15 | lec15-slides | - | Fri | Feb 14 | Spring Recess |
| WS15-solution | |||||||||||||||||||
6 | MonFri | Feb | 1718 | Lecture | 1416: Data | -Driven Tasks Races, Functional & Structural Determinism | Module 1: Sections 42.5, 2.6 | Topic | 42.5 Lecture , Topic | 42.5 Demonstration | , Topic 2.6 Lecture, Topic 2.6 Demonstration | worksheet16 | lec16-slides | Homework 3 | Homework 2 | WS16-solution | ||||||||||||||
7 | Mon | Feb 21 | Lecture 17: Midterm Review | lec17 | worksheet14 | lec14-slides | ||||||||||||||||||||||||
| Wed | Feb 1923 | Lecture 15: 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 | worksheet15 | 18: Limitations of Functional parallelism. | worksheet18 | lec18lec15-slides | WS18-solution | ||||||||||||||||||||
| Fri | Feb 2125 | Lecture 16: 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 | worksheet16 | lec16-slides | Quiz for Unit 4 | Quiz for Unit 3 | |||||||||||||||||||||
7 | Mon | Feb 24 | Lecture 17: Midterm Review | lec17-slides | ||||||||||||||||||||||||||
| Wed | Feb 26 | Lecture 18: Abstract vs. Real Performance | worksheet18 | lec18-slides | |||||||||||||||||||||||||
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 28 | Lecture 20: Confinement & Monitor Pattern. Critical sections | Module 2: Sections 5.1, 5.2, 5.6 | Topic 5.1 |
| Fri | Feb 28 | Lecture 19: Critical Sections, Isolated construct (start of Module 2) | 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 | worksheet19worksheet20 | lec19lec20-slides | Homework 3, Checkpoint-1WS20-solution | ||||||||||||||||
| 8 | MonWed | Mar 02 | Lecture 20: Parallel Spanning Tree algorithm, 21: Atomic variables, Synchronized statements | Module 2: Sections 5.3,5.4, 57. 52 | Topic 5.3 Demonstration, Topic 5.4 Lecture, Topic 5.4 Demonstration, Topic 57.5 Lecture, Topic 5.5 Demonstration | worksheet20 | 2 Lecture | worksheet21 | lec21lec20-slides | WS21-solution | |||||||||||||||||||
| WedFri | Mar 04 | Lecture 21: Actors | Module 2: 6.1, 6.2 | Topic 6.1 Lecture , Topic 6.1 Demonstration , Topic 6.2 Lecture, Topic 6.2 Demonstration | worksheet21 | lec21-slides |
| ||||||||||||||||||||||
| Fri | Mar 06 | Lecture 22: Actors (contd) | Module 2: 6.3, 6.4, 6.5 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture , Topic 6.4 Demonstration, Topic 6.5 Lecture, Topic 6.5 Demonstration | worksheet22 | lec22-slides | Quiz for Unit 4 | ||||||||||||||||||||||
9 | Mon | Mar 09 | No class | Quiz for Unit 5 |
| |||||||||||||||||||||||||
| Wed | Mar 11 | No class |
|
| |||||||||||||||||||||||||
22: Parallel Spanning Tree, other graph algorithms | worksheet22 | lec22-slides | Homework 4 | Homework 3 | WS22-solution | |||||||||||||||||||||||||
9 | Mon | Mar 07 | Lecture 23: Java Threads and Locks | Module 2: Sections 7.1, 7.3 | Topic 7.1 Lecture, Topic 7.3 Lecture | worksheet23 | lec23-slides |
| WS23-solution | |||||||||||||||||||||
| Wed | Mar 09 | Lecture 24: Java Locks - Soundness and progress guarantees | Module 2: 7.5 | Topic 7.5 Lecture | worksheet24 | lec24-slides |
| WS24-solution | |||||||||||||||||||||
| Fri | Mar 11 | Lecture 25: Dining Philosophers Problem | Module 2: 7.6 | Topic 7.6 Lecture | worksheet25 | lec25-slides |
| WS25-solution | |||||||||||||||||||||
Mon | Mar 14 | No class: Spring Break |
| Fri | Mar 13 | No class
| ||||||||||||||||||||||||
- M-F | Wed | Mar 16 - Mar 20 | No class: Spring Break |
| ||||||||||||||||||||||||||
10 | MonFri | Mar 2318 | Lecture 23: Actors (contd) | Module 2: 6.6 | Topic 6.6 Lecture, Topic 6.6 Demonstration | No class: Spring Break | lec23-slides |
| ||||||||||||||||||||||
10 | WedMon | Mar | 2521 | Lecture | 24: Java Threads, Java synchronized statement26: N-Body problem, applications and implementations | worksheet26 | lec26 | Module 2: 7.1, 7.2 | Topic 7.1 Lecture, Topic 7.2 Lecture | lec24-slides | WS26-solution | |||||||||||||||||||
| Wed | Fri | Mar 2723 | Lecture 25: Java Threads, Java synchronized statement (contd), wait/notify27: Read-Write Locks, Linearizability of Concurrent Objects | Module 2: 7.13, 7.24 | Topic 7.1 3 Lecture, Topic 7.2 4 Lecture | worksheet27 | lec25lec27-slides |
| Homework 3, Checkpoint-2WS27-solution | ||||||||||||||||||||
| 11 | MonFri | Mar | 3025 | Lecture | 26: Java Threads (exercise)28: Message-Passing programming model with Actors | Module 2: 6.1, 6.2 | Topic 6.1 Lecture, Topic 6.1 Demonstration, Topic 6.2 Lecture, Topic 6.2 Demonstration | worksheet28 | lec28 | lec26-handout | Quiz for Unit 6 | Quiz for Unit 5 |
| Wed | Apr 01 | Lecture 27: Java Locks | Module 2: 7.3 | Topic 7.3 Lecture | lec27-slides |
|
| WS28-solution | Fri | ||||||
11 | Apr 03Mon | Mar 28 | Lecture | 28: Linearizability of Concurrent Objects29: Active Object Pattern. Combining Actors with task parallelism | Module 2: 76.3, 6.4Topic 7 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture | , Topic 6.4 Demonstration | worksheet29 | lec29lec28-slides |
| Homework 3 (all)
| |||||||||||||||||||
12 | Mon | Apr 06 | Lecture 29: Java Locks (exercise) | lec29-handout | Quiz for Unit 6 | |||||||||||||||||||||||||
| Wed | Apr 08 | Lecture 30: Safety and Liveness Properties, Java Synchronizers, Dining Philosophers Problem | Module 2: 7.5, 7.6 | Topic 7.5 Lecture, Topic 7.6 Lecture | lec30-slides | Quiz for Unit 7 |
| ||||||||||||||||||||||
| Fri | Apr 10 | Lecture 31: Message Passing Interface (MPI), (start of Module 3) | Topic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture | lec31-slides |
| ||||||||||||||||||||||||
13 | Mon | Apr 13 | Lecture 32: Message Passing Interface (MPI, contd) | Topic 8.4 Lecture | lec32-slides | Homework 4 Checkpoint-1 | ||||||||||||||||||||||||
| Wed | Apr 15 | Lecture 33: Message Passing Interface (MPI, contd) | Topic 8.5 Lecture, Topic 8 Demonstration Video | lec33-slides |
|
| |||||||||||||||||||||||
| Fri | Apr 17 | Lecture 34: Task Affinity with Places | lec34-slides | Quiz for Unit 8 | Quiz for Unit 7 | ||||||||||||||||||||||||
| WS29-solution | |||||||||||||||||||||||||||||
| Wed | Mar 30 | Lecture 30: Task Affinity and locality. Memory hierarchy | worksheet30 | lec30-slides |
| WS30-solution | |||||||||||||||||||||||
| Fri | Apr 01 | Lecture 31: 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 04 | Lecture 32: Barrier Synchronization with Phasers | Module 1: Section 3.4 | Topic 3.4 Lecture, Topic 3.4 Demonstration | worksheet32 | lec32-slides |
|
| WS32-solution | ||||||||||||||||||||
| Wed | Apr 06 | Lecture 33: 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 08 | Lecture 34: 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 11 | Lecture 35: Eureka-style Speculative Task Parallelism |
| worksheet35 | lec35-slides |
|
| WS35-solution | |||||||||||||||||||||
Wed | Apr 13 | Lecture 36: Scan Pattern. Parallel Prefix Sum |
| worksheet36 | lec36-slides | WS36-solution | ||||||||||||||||||||||||
Fri | Apr 15 | Lecture 37: Parallel Prefix Sum applications | worksheet37 | lec37 | 14 | Mon | Apr 20 | Lecture 35: Eureka-style Speculative Task Parallelism | lec35-slides | |||||||||||||||||||||
14 | WedMon | Apr | 2218 | Lecture | 36: Algorithms based on Parallel Prefix (Scan) operations38: Overview of other models and frameworks | lec36lec38-slides | Homework 4 (all) | |||||||||||||||||||||||
Fri | Wed | Apr | 2420 | Lecture | 3739: Course Review (Lectures 19 | -34)lec37-slides | Quiz for Unit 8 | - | -38) | lec39-slides | ||||||||||||||||||||
Fri | Apr 22 | Lecture 40: Course Review (Lectures 19-38) | lec40-slides | Homework 5 |
Lab Schedule
Lab # | Date (20202022) | Topic | Handouts | Examples | 0|||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Jan 10 | Infrastructure | Setupsetup | lab0-handout | |||||||||
1 | Jan 16 | Async-Finish Parallel Programming with abstract metrics | lab1-handout | ||||||||||
- | No lab this week | ||||||||||||
lab1-handout | |||||||||||||
2 | Jan | 3017 | FuturesFunctional Programming | lab2-handout | |||||||||
3 | Feb 06 | Jan 24 | Java Streams Cutoff Strategy and Real World Performance | lab3-handout | - | No lab this week - Spring Recess | |||||||
4 | Feb 20 | DDFs | lab4-handout | - | Feb 27 | No lab this week (midterm exam)
| Jan 31 | Futures | lab4-handout | ||||
5 | Mar 05Feb 07Loop | Data- Driven Tasks | lab5-handout handoutlab5-intro | ||||||||||
-6 |
|
| Feb 14 | Async / Finish | lab6-handout | ||||||||
- |
| Feb 21 | No lab this week (Midterm)Isolated Statement and Atomic Variables | ||||||||||
-7 | Actors | Feb 28 | Recursive Task Cutoff Strategy | lab7-handout | |||||||||
8 | Mar 07 | Java Threads, Java Locks | lab8-handout | ||||||||||
- |
| Message Passing Interface (MPIMar 14 | No lab this week (Spring Break) | ||||||||||
9 | Mar 21 | Concurrent Lists | lab9-handout | ||||||||||
10 | Mar 28 | Actors | lab10-handout | Apache Spark||||||||||
11 | Apr 04 | Loop Parallelism | lab11-handout | -||||||||||
- | Apr 11 | No lab this weekEureka-style Speculative Task Parallelism | |||||||||||
- | Java's ForkJoin Framework | Apr 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.be denied.
Labs must be submitted by the following Wednesday at 4:30pm. Labs Labs must be checked off by a TA by the following Monday at 11:59pm.
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.
...