AI-260-paul.wilmoth-2026-08-20-01-11-07
Below is a syllabus template that includes WSU's required syllabus elements. Please complete all items highlighted in yellow.
Title of Course [Computer Systems for AI]
Prefix and Number [AI 260]
Semester and Year [tbd]
Number of Credit Hours [3]
Prerequisites [AI 101, AI 142]
Course Details
Day and Time: [tbd]
Meeting Location: [tbd]
Instructor Contact Information
Instructor Name: [tbd]
Instructor Contact Information: [office location, phone, email] [tbd]
Instructor Office Hours: [click here for best practices] [tbd]
TA Name: [tbd]
TA Contact Information: [office location, phone, email]: [tbd]
TA Office Hours: [click here for best practices] [tbd]
Course Description
Model and optimize computer systems; memory management; scheduling; I/O and networking; concurrency; Computer systems architecture; logic, data representation, assembly language, memory organization and trends.
Course Materials
Books: No textbook required
Other Materials:
- Computer Organization and Design (Fifth/Sixth Edition): The Hardware/Software Interface by David A. Patterson and John L. Hennessy.
- AI for Computer Architecture, Principles, Practice, and Prospects (Lizhong Chen, Drew Penney, Daniel Jiménez)
Fees: None
|
Course Learning Outcomes (students will be able to:) |
Activities Supporting the Learning Outcomes | Assessment of the Learning Outcomes |
|---|---|---|
| Analyze a complex systems problem; apply computing, and systems principles; and acquire needed knowledge to identify feasible solutions (1e, 7f). |
Lectures, readings, case studies, independent technical inquiry |
Homework assignments, in-class active learning activities, examination |
| Design, implement, and evaluate a computer system solution that meets stated functional and performance requirements (2a, 2e, 2g, 6a, 6b). | Programming assignments | Code review, assignment reports |
| Collect and interpret systems telemetry and document reproducible experimental evidence (6c). |
Programming assignments |
Assignment reports |
| Identify bottlenecks in computer systems and determine appropriate control knobs to improve metrics (1d, 1e, 6b, 6c, 7f). |
Programming assignments, hardware-based labs |
Assignment reports, working demonstrations on hardware |
| Assess performance of a pipelined architecture versus an architecture without pipelining (2e, 6b, 6c). |
Written and programming assignments |
Homework assignments, in-class active learning activities, examination |
| Understand and apply strategies to deal with hazards in an architecture with pipelining. Under and analyze benefits of cache hierarchy (1e, 6a, 7f). |
Written and programming assignments |
Homework assignments, in-class active learning activities, examination |
| Dates | Lesson Topic | Assignment | Assessment |
|---|---|---|---|
|
Week 1 |
Overview and Introduction | ||
| Week 2 [dates] |
Computer performance and numbering systems | Written homework 1 | Homework review, working design for processor |
| Week 3 [dates] |
Digital logic and processor design | Logic design for processor | |
| Week 4 [dates] |
Cache memory introduction | Quiz on computer performance and digital design | Quiz Review |
| Week 5 [dates] |
Cache performance and optimization | PA-1 (Cache Simulation) | Code and report review, working demonstration |
| Week 6 [dates] |
Pipelining introduction | Written assignment on pipeline and logic design | Homework review, design review and demonstration |
| Week 7 [dates] |
Pipelining hazards | Mid-term exam | Exam script review |
| Week 8 [dates] |
Assembly language programming | None | None |
| Week 9 [dates] |
Process scheduling | PA-2 (Scheduling) | Code and report review, working demonstration |
| Week 10 [dates] |
I/O and file systems | Assembly programming assignment | Code and report review, working demonstration |
| Week 11 [dates] |
Network programming | Quiz 2 | Quiz review |
| Week 12 [dates] |
Network programming (Contd.) | PA-3 (Network programming) | Code and report review, working demonstration |
| Week 13 [dates] |
Concurrency | None | None |
| Week 14 [dates] |
Distributed systems | PA-4 (Concurrency and parallelism) | Code and report review, working demonstration |
| Week 15 [dates] |
Exam review, recap, and closing | Exam 2 | Exam script review |
Expectations for Student Effort
[Describe how much time students should expect to invest in the course each week. Graduate courses should state: "For each hour of lecture equivalent, students should expect to have a minimum of two hours of work outside of class." Note that Global campus courses will automatically include credit hour equivalents in the syllabus.]
For each hour of lecture equivalent, students should expect to have a minimum of two hours of work outside class. Programming assignments and homework are designed to help student master the concepts as well as spend time studying the material of the course.
Grading [add more lines if necessary]
| Type of Assignment (tests, papers, etc) | Points | Percent of Overall Grade |
|---|---|---|
| Homework assignments | 200 | 20 |
| Programming assignments | 300 | 30 |
| Hardware labs | 200 | 20 |
| Two mid terms and final | 300 | 30 |
| Grade | Percent | Grade | Percent |
|---|---|---|---|
| A |
95-100 |
C | 73-76.9 |
| A- | 90-94.9 | C- | 70-72.9 |
| B+ | 87-89.9 | D+ |
65-69.9 |
| B | 83-86.9 | D | 60-64.9 |
| B- | 80-82.9 | F | 0-59.9 |
| C+ | 77.79.9 |
[Provide information about how grades will be rounded (eg, if 89% earns a B+ and 90% earns an A-, what grade is given to a student with an 89.5?]
Attendance and Make-Up Policy
[Provide details on how attendance affects final course grades. Indicate whether and how missed exams, laboratory sessions, etc. can be made up. Sample attendance statement: “Students should make all reasonable efforts to attend all class meetings. However, in the event a student is unable to attend a class, it is the responsibility of the student to inform the instructor as soon as possible, explain the reason for the absence (and provide documentation, if appropriate), and make up class work missed within a reasonable amount of time, if allowed. Missing class meetings may result in reducing the overall grade in the class.” ]
While attendance is not mandatory, it is recommended that students attend all the lectures due to complexity of the course material.
Academic Integrity Statement
You are responsible for reading WSU's Academic Integrity Policy, which is based on Washington State law. If you cheat in your work in this class you will:
- Be awarded a grade of zero for the respective course component
-Be reported to the Center for Community Standards
-Have the right to appeal my decision
-Not be able to drop the course of withdraw from the course until the appeals process is finished
If you have any questions about what you can and cannot do in this course, ask me.
If you want to ask for a change in my decision about academic integrity, use the form at the Center for Community Standards website. You must submit this request within 21 calendar days of the decision.