CS 0449–Intro to Systems Software
Fall Term: 2141
|
Class |
Recitation |
Recitation |
Time: |
11:00am – 12:15pm |
2:00pm – 2:50pm |
4:00pm – 4:50pm |
Days: |
TH |
M |
M |
Room: |
G30 BENDM |
5505 SENSQ |
5505 SENSQ |
Webpage: |
Instructor: Jonathan Misurda |
|
TA: Brian Dicks |
|
Grading TA: Judicael Djoko |
|||
Office: |
6203 SENSQ |
|
Office: |
6501 SENSQ |
|
Office: |
6805 SENSQ |
Email: |
|
Email: |
|
Email: |
|||
Office Hours: |
Mon, Tue, Wed: 1:00–3:00 |
|
Office Hours: |
Mon, Wed: 9:00–11:00am |
|
Office Hours: |
Tue, Thur: 1:00–4:00 |
A Computer System is comprised of both hardware and software working in concert to accomplish useful work. In this course, we will explore the issues of programming a real computer system by examining the abstractions, interfaces, and design decisions that influence the way that software runs. This includes the role the Operating System has in communication and resource management.
The perspective we will take is one of the lifecycle of a program from implementation to execution. The simple act of compiling and running a program, a sequence of events we often take for granted, is a complex interaction of many different components that work together to manage the computer’s resources and perform the desired task. Together, these components form a working computer system.
Before enrolling in this course, you need to have completed CS 0441 – Discrete Structures for Computer Science, CS 0445 – Data Structures, and have completed or be currently enrolled in CS 0447 – Computer Organization and Assembly Language Programming.
If you have any questions about the prerequisite material for the course, please ask at the beginning of the term.
This course begins with the creation of executable programs in the C programming language. We will then explore the resultant program as it as stored on disk and as it is loaded for execution. Next, we will examine the interactions between our code and the code provided via libraries or the operating system to facilitate common, low-level tasks. Finally, we will look at the abstractions and resource management undertaken by the OS and its drivers to facilitate communication and hardware interaction.
The goals of the course are:
· Learning C programming. C is the most common language used for systems software.
· Exploring the layout of an executable program’s code and data both as stored on disk and loaded into memory.
· Interacting with the abstractions that libraries and the operating system provide.
· Implementing our own abstractions, and manage hardware resources through device drivers.
[Required Text]
Oualline, Steve. Practical C Programming. O’Reilly, Sebastopol, CA, 1997.
ISBN: 1-56592-306-5
You may substitute instead (but you’re responsible for the appropriate readings):
Kernighan, Brian W. and Ritchie, Dennis M. C Programming Language. 2nd Ed. Prentice Hall PTR, 1988.
ISBN: 0-13110-362-8
[Online Required Texts]
There are three additional textbooks that are available online in PDF form that we will refer to throughout the term. Links can be found on the course website.
Exams: There will be two midterms and a final. The exams will be closed book/notes. The final exam will be Saturday, December 14, 2013, from 8:00–9:50 AM in the normal classroom. Cheating on exams will not be tolerated. Anyone caught cheating will be given a zero for the test and reported to the department following University procedures.
Projects: There will be 5 out-of-class assignments given. These are to be completed in the given time (no extensions will be given without a valid excuse. LATE WORK IS NOT ACCEPTED. Contact me before the deadline for clarifications.) These are meant to be your own work; anyone found to be collaborating will be disciplined in accordance to University policy. Cheating means (but is not limited to): using code from previous terms, other universities, your friends, finding it on the Internet, getting help from unapproved forums, or outsourcing it.
We will be using Moss, a tool from Stanford for determining inappropriate collaboration.
Labs and Quizzes: Attending recitation is an important part of this course. In recitation you will be able to work in a structured setting while completing small tasks (Labs). Concepts from class will be expanded upon and tested with unannounced quizzes.
Participation: Attendance will not be taken, but in a small class, any absence will be noticed. Several unexcused missed classes will adversely affect your grade.
Your grade will be based upon 3 exams, 5 projects, labs and quizzes (the lowest one of which will be dropped), and participation:
First Midterm |
15% |
Second Midterm |
15% |
Final Exam |
15% |
5 Projects |
40% (8% each) |
Labs and Quizzes |
10% |
Participation |
5% |
Total |
100% |
The scale for the term will be:
Percentage |
100 |
95 |
90 |
89 |
85 |
80 |
79 |
75 |
70 |
69 |
65 |
60 |
< 60 |
Letter |
A+ |
A |
A- |
B+ |
B |
B- |
C+ |
C |
C- |
D+ |
D |
D- |
F |
If you have a disability for which you are requesting an accommodation, you are encouraged to contact both your instructor and Disability Resources and Services, 216 William Pitt Union, (412) 648-7890, as early as possible in the term. DRS will verify your disability and determine reasonable accommodations for this course.
Students are expected to comply with the University of Pittsburgh’s Policy on Academic Integrity. Any student suspected of violating this obligation for any reason during the semester will be required to participate in the procedural process as outlined in the University Guidelines on Academic Integrity. For further information see: http://www.pitt.edu/~provost/ai1.html
The daily topics are subject to change depending on our pace. They are there to assist you in the readings so you can focus on those concepts prior to class.
The textbooks are indicated as follows:
Week 1: 8/27/2013 - 8/29/2013 |
Readings: Practical C, Chapters 1-4, 6, 8, 11
Topics: · Intro to the Course · C Programming o Data Types and Representation o Operators & Bitwise Manipulation o Control Flow
|
Week 2: 9/3/2013 - 9/5/2013 |
Friday, September 6, 2013: Fall term add/drop period ends
Readings: Practical C, Chapters 5, 7, 9
Topics: · C Programming (continued) o Arrays o Strings o Functions
|
Week 3: 9/10/2013 - 9/12/2013 |
Readings: Practical C, Chapters 10, 12-14, 17; Misurda, Chapter 1
Topics: · C Programming (continued) o Scope vs. Lifetime o Pointers o I/O § Console § Files
|
Week 4: 9/17/2013 - 9/19/2013 |
Readings: Practical C, Chapters 15-23
Topics: · C Programming (continued) o Memory management § malloc/free o Structures, and Unions
|
Week 5: 9/24/2013 - 9/26/2013 |
Thursday, September 26, 2013: First Midterm Exam
Topics: · Review for first midterm exam
|
Week 6: 10/1/2013 - 10/3/2013 |
Readings: Misurda, Chapters 2 - 3
Topics: · Program Representation · Linking o Static o Dynamic · Libraries, archives, shared objects · Executable file formats
|
Week 7: 10/8/2013 - 10/10/2013 |
Readings: Misurda, Chapters 4 - 6
Topics: · Processes & Address Spaces · Data Representation o Globals, constants o Activation Records o Arrays and Structures |
Week 8: 10/15/2013 - 10/17/2013 |
Readings: Misurda, Chapter 7; ALP Chapters 3, 8
Tuesday, October 15, 2013: No class, follow your Monday schedule!
Topics:
|
Week 9: 10/22/2013 - 10/24/2013 |
Friday, October 25, 2013: Withdrawal Deadline (For “W” grade)
Readings: LDD3, Chapters 1-2
Topics: · Linux Device Drivers
|
Week 10: 10/29/2013 - 10/31/2013 |
Thursday, October 31, 2013: Second Midterm Exam
Topics: · Review for second midterm exam
|
Week 11: 11/5/2013 - 11/7/2013 |
Readings: Practical C, Chapters 7,10,18
Topics: · Multi-file Development o Providing an interface/API o Header files o Makefiles
|
Week 12: 11/12/2013 - 11/14/2013 |
Readings: Misurda, Chapter 8; ALP, Chapter 3
Topics: · Threading o User vs. Kernel Threading o Scheduling/yield/sleep o pthreads
|
Week 13: 11/19/2013 - 11/21/2013 |
Readings: Misurda, Chapter 9
Topics: · Deadlocks/Synchronization
|
Week 14: 11/26/2013 - 11/28/2013 |
Readings: Misurda, Chapter 10
Thursday, November 28, 2013: Thanksgiving Break, University Closed
Topics: · Communication and Networking o Berkley Sockets o Pipes o Shared Memory
|
Week 15: 12/3/2013 - 12/5/2013 |
Readings: Prepare for the final exam
Topics: · Finish up Networking · Review for the final exam
|
Finals Week |
Final Exam: Saturday, December 14, 2013, from 8:00–9:50 AM in the normal classroom |