CMSC216

Class

Syllabus

Introduction

The goal of the course is to convey the fundamental concepts that enable programs to execute on real hardware. Those concepts include how the operating system virtualizes the hardware to provide basic services and abstractions to enable a user program to effectively use the available hardware resources. The course also addresses how different programming constructs and idioms work.

The basic abstraction of a program running as one or more threads of control in a single flat address space (a Unix process) is the key to the course. Emphasizing that abstraction as the underlying model for understanding how a program works, from both the user program and hardware perspective (with the OS in between), run as a theme through all topics in the course. Examples include C pointers (to data and functions), function calls and runtime stack management, dynamic memory management in the heap, and the fork/exec system calls.

Prerequisites

PrerequisiteC or better in CMSC132 and MATH 141
CorequisiteCMSC 250 (or equivalent)
Credits4

Course Coordinator

Name Office
Nelson Padua-Perez AVW 1203

For office hours and other contact information, visit the staff link.

Textbooks

Title Authors ISBN Type
Computer Systems: A Programmer's Perspective, 2nd edition R.E. Bryant and D. R. O'Hallaron 0136108040 Recommended
C Programming Language (2nd Edition) Brian W. Kernighan and Dennis M. Ritchie 0131103628 Recommended

Course Topics (Subject to Change)

  • Unix Memory Model
  • Moving from Java to C
  • Pointers and dynamic data structures in C
  • I/O, standard libraries
  • Testing
  • Assembly Language
  • Process control
  • Systems programming
  • Program measurement and optimization
  • Multithreaded programming with pthreads
  • Libraries and linking
  • Dynamic memory management

Hours of Work

This class requires at least 12 hours of work outside of the classroom.

Grading

Final grades will be computed according the following weights:

25% Projects
10% Announced Quizzes
Pop Quizzes
4% Exercises
6% In lecture/lab work
30% Midterms (2)
25% Final Exam

Once we have graded any class material (e.g., exams, projects, etc.) we will post an announcement and a deadline by which you must submit any regrade request (if necessary). It is your responsibility to submit regrade requests by the specified deadline; no regrade requests will be processed afterwards.

Projects

  • Deadlines - All projects are due at 6pm on the specified day in the project description. You have until 6pm of the next day to submit your project with a 10% penalty. Notice that after the late period, you will not receive any points for your project, even though you still need to satisfy the good faith attempt (see information below). For example, if a project is due on Wednesday at 6pm, you have until Thursday at 6pm to submit a late project with a 10% penalty. Any submission after Thursday 6pm will receive 0 pts.
  • Submit Server - You need to use the submit server for project submissions. We will not accept projects submitted otherwise (e.g., e-mail, etc.). Notice that we use the submit server results to compute a significant portion of your project's grade. You need to make sure that your project works in the submit server, otherwise you will not get any credit.
  • Which Project Gets Graded - Your grade for an project will be based on the greater value of two scores: (1) The score on the very last compilable submission prior to the deadline; (2) The score minus 10% on the very last compilable submission prior to the late deadline.
  • Good Faith Attempt - You must satisfy a minimum set of requirements for each project (Good Faith Attempt) otherwise you will not pass the course (automatic grade of F). Each project defines its own good faith attempt criteria and a deadline to provide an implementation that satisfies it. If you start a project on time, and look for assistance (if required) you should have no problems satisfying the Good Faith Attempt. The Good Faith Attempt guarantees you have the skills necessary for upper-level courses. Notice that you will not receive extra points for completing the good faith attempt. The grade you obtain for a project will be based on your ontime/late submission.
  • Closed Projects - All programming assignments in this course are to be written individually (unless explicitly indicated otherwise). Cooperation between students is a violation of the Code of Academic Integrity.

TA Room/Office Hours

Office hours get extremely busy the day before a project deadline. Therefore do not wait to start your projects. Regarding office hours and the TA Room:

  • Once you have been helped by a TA, please leave the TA room. We have a large number of students in all of our classes, and the TA room is really crowded. Thank you for help on this matter.
  • If there is a line of students waiting, a TA should spent at most 5 minutes with a student. Please remind TAs about this rule.
  • We have reserved a corner of the TA room for this class. Put your name on the board list and a TA will help you. Once you have been helped, please cross out your name. A photo of the corner can be found at cmsc216 Corner.

Class Attendance

Keep in mind that in-lecture graded exercises (sometimes without advance notice) are an integral part of the work of the course.

Backups

You need to keep backups of your projects as you develop them. No extensions will be granted because you accidentally erased your project. Feel free to use the submit server as a backup tool by submitting often. You can also use tools like git, etc. Do not post code in any online system that is accessible to others (e.g., github).

Academic Integrity

Note that academic dishonesty includes not only cheating, fabrication, and plagiarism, but also includes helping other students commit acts of academic dishonesty by allowing them to obtain copies of your work. In short, all submitted work must be your own. Cases of academic dishonesty will be pursued to the fullest extent possible as stipulated by the Office of Student Conduct.

It is very important for you to be aware of the consequences of cheating, fabrication, facilitation, and plagiarism. For more information on the Code of Academic Integrity or the Student Honor Council, please visit http://www.shc.umd.edu

Examples of Academic Integrity Violations

The following are examples of academic integrity violations:

  • Hardcoding of results in a project assignment. Hardcoding refers to attempting to make a program appear as if it works correctly (e.g., printing expected results for a test).
  • Using any code available on the internet/web or any other source. For example, using code from Sourceforge.
  • Hiring any online service to complete an assignment for you.
  • You may not post the implementation of your assignments, materials related to the class (e.g., project description), or any other material associated with this course. Even if the class is over and you have graduated, you may NOT post any material. If you do, you will be violating academic integrity rules and copyrights.
  • Discussing projects with your classmates.
  • Sharing your code or your student tests with any student.
  • Providing ideas/suggestions on how to solve/implement a programming assignment.
  • Looking at another student's code.
  • Using online forums to ask for help regarding our assignments.

Piazza

We will be using (Piazza) for class communication. Regarding Piazza:

  • We will use Piazza to communicate in lecture, and to provide class announcements.
  • Posting of code is not allowed is Piazza. Anyone posting any kind of code may receive an XF in the course.
  • The preferred mechanism to address course questions (projects, lecture material, etc.) is during office hours, in lab, and lecture.
  • Students' questions can only be answered by CS staff (TAs and instructors). Although we will try to check Piazza often, there is no guarantee we will respond to messages immediately.
  • You will not be able to register to Piazza yourself. Your instructor will register you using the e-mail you have in the school system.

Excused Absence and Academic Accommodations

Any student who needs to be excused for an absence from a single lecture, recitation, or lab due to a medically necessitated absence shall:

  1. Make a reasonable attempt to inform the instructor of his/her illness prior to the class.
  2. Upon returning to the class, present their instructor with a self-signed note attesting to the date of their illness. Each note must contain an acknowledgment by the student that the information provided is true and correct. Providing false information to University officials is prohibited under Part 9(i) of the Code of Student Conduct (V-1.00(B) University of Maryland Code of Student Conduct) and may result in disciplinary action.
  3. This self-documentation may not be used for the Major Scheduled Grading Events as defined below and it may only be used for only 1 class meeting during the semester.

Any student who needs to be excused for a prolonged absence (2 or more consecutive class meetings) or for a Major Scheduled Grading Event, must provide written documentation of the illness from the Health Center or from an outside health care provider. This documentation must verify dates of treatment and indicate the time frame that the student was unable to meet academic responsibilities. No diagnostic information shall be given. The Major Scheduled Grading Events for this course include midterm(s) and final exam.

It is also the student's responsibility to inform the instructor of any intended absences from exams for religious observances in advance. Notice should be provided as soon as possible, but no later than the Monday prior to the exam for both the midterm(s) and the final.

Any student eligible for and requesting reasonable academic accommodations due to a disability is requested to provide a letter of accommodation from the Office of Disability Support Services within the first two weeks of the semester.

Miscellaneous

  • If you are having questions about the material covered in lecture/lab, we encourage you to check the class textbooks before heading to office hours. The class textbooks are excellent sources of information.
  • Please bring your laptop to your discussion (lab) session and to lecture. If you don't have a laptop, we will pair you up with a classmate.
  • As you work on a project, submit your project often even if you have not finished. We monitor submit server submissions, and can provide assistance based on submit server results.
  • At the end of the course, visit (www.courseevalum.umd.edu) to complete your course evaluations.
  • If you are experiencing difficulties in keeping up with the academic demands of this course, you may contact the Learning Assistance Service located at 2202 Shoemaker Building.

Copyright

All course materials are copyright UMCP, Department of Computer Science © 2015. All rights reserved. Students are permitted to use course materials for their own personal use only. Course materials may not be distributed publicly or provided to others (excepting other students in the course), in any way or format.

Schedule

Course Schedule

This schedule is tentative and subject to change. Keep in mind that the slides may not include all the material discussed in lecture. You are responsible for any material we present in lecture, even if it does not appear in the posted slides. Notice that code examples can be found in the grace cluster (public directory).

Week Topics Slides Work
CMSC216 Schedule
Week #1
(Jan 26)
Course Introduction, C Data Types, Operators, Input/Output, Control Statements, Active Learning Course-Intro-C-Intro-I.pdf
C-Intro-II.pdf
ActiveLearningWorkshop.pdf
E1 Out (Thu)
Week #2
(Feb 2)
Functions, scope, C Storage Types, Linkage, sizeof, GDB, Debugging (lecture), Input/Output Redirection (lab) C-Intro-III.pdf
Debugging.pdf
Q1 (Mon)
E1 Due (Wed)
E2 Out (Fri)
Week #3
(Feb 9)
Pointers, Arrays,
Math Library(lab)
Pointers.pdf
Pointers-Arrays.pdf
Q2 (Mon)
E2 Due (Wed)
P1 Out (Thu)
Week #4
(Feb 16)
Debugging, Pointer Arithmetic, 2-Dim Arrays, Strings PtrArithmeticArrays.pdf
Strings.pdf
Q3 (Mon)
P1a Due (Wed)
E3 Out (Fri)
Week #5
(Feb 23)
Structures, I/O (line-oriented-formatted) Structures.pdf
IO.pdf
Q4 (Mon)
E3 Due (Wed)
P1 Due (Wed)
P2 Out (Wed)
Week #6
(Mar 2)
I/O (Cont.), Function Pointers, Preprocessor I, Make, Bitwise Operators FunctionPtrs.pdf
PreprocessorI.pdf
Make.pdf
BitwiseOperators.pdf
P3 Out (Wed)
P2 Due (Thu/Due to snow Fri)
Week #7
(Mar 9)
Dynamic Memory Allocation, Dynamic Structures DynamicMemAlloc.pdf
E4 Out (Tue)
P3 Due (Thu)
Spring Break 2015 (Mar 15-Mar 22)
Week #8
(Mar 23)
Midterm I (Lecture), Assembly AssemblyI.pdf
AssemblyII-If-Loops.pdf
P4 Out (Mon)
E4 Due (Tue)
Midterm I (Thu)
Week #9
(Mar 30)
Assembly AssemblyIII-CallStack.pdf
AssemblyIV-ParamLocal.pdf
P4a Due (Mon)
Q5 (Mon)
P4 Due (Thu)
P5 Out (Thu)
Week #10
(Apr 6)
Process Control ProcessControlI.pdf
ProcessControlII.pdf
E5 Out (Thu)
P5a Due (Fri)
Week #11
(Apr 13)
Process Control, System I/O (read, write, dup2) ProcessControlIII.pdf
System-IO-I.pdf
System-IO-II.pdf
P5 Due (Wed)
E5 Due (Thu)
P6 Out (Thu)
Week #12
(Apr 20)
System I/O (pipes),
Midterm II (Lecture)
Midterm II (Thu)
Week #13
(Apr 27)
Time, Optimization Time.pdf
Optimization.pdf
Q6 (Mon)
P6 Due (Wed)
P7 Out (Sat)
Week #14
(May 4)
Course Evaluations, Concurrency, Preprocessor, Data Representation, Libraries Concurrency.pdf
PreprocessorII.pdf
Data-Rep.pdf
Libraries.pdf
Q7 (Mon)
P7a Due (Fri)

Week #15
(May 11)
Review Review.pdf
P7 Due (Mon)

Last Day of Classes
(Tue/May 12)

Final Exam
(Thu/May 14 4pm-6pm)

Staff

Coordinators

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Tue and Thu: 2pm-3pm, Wed: 1:30-2:30pm
E-Mail nelson [AT] cs [DOT] umd [DOT] edu

Office Hours Information

Please see Office Hours Guidelines

Teaching Assistants

All TA office hours take place in AVW 1112.


Name E-mail Pic
Hyunjong Cho (Grader) cho [AT] cs [DOT] umd [DOT] edu TAImage
Xiyang Dai (Grader) xiyang.dai [AT] gmail [DOT] com TAImage
Jonathan Gluck jonathangluck08854 [AT] gmail [DOT] com TAImage
Benjamin Gmurczyk bengmur [AT] terpmail [DOT] umd [DOT] edu TAImage
Baris Gokpinar webbaris [AT] hotmail [DOT] com TAImage
Eric Jeney jeney [AT] terpmail [DOT] umd [DOT] edu TAImage
Seokbin Kang (Grader) sean.kang84 [AT] gmail [DOT] com TAImage
Saurabh Kumar (Grader) saurabh.umdcs [AT] gmail [DOT] com TAImage
Andrew Liu liu.andrew.x [AT] gmail [DOT] com TAImage
Charles Parker charles.w.parker95 [AT] gmail [DOT] com TAImage
Ian Sweet isweet [AT] terpmail [DOT] umd [DOT] edu TAImage
Halley Weitzman halley.weitzman [AT] gmail [DOT] com TAImage
Lee Williams drummerx04 [AT] gmail [DOT] com TAImage

Office Hours

Coordinators

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Tue and Thu: 2pm-3pm, Wed: 1:30-2:30pm
E-Mail nelson [AT] cs [DOT] umd [DOT] edu

Office Hours Information

Please see Office Hours Guidelines

Teaching Assistants

All TA office hours take place in AVW 1112.


Name E-mail Pic
Hyunjong Cho (Grader) cho [AT] cs [DOT] umd [DOT] edu TAImage
Xiyang Dai (Grader) xiyang.dai [AT] gmail [DOT] com TAImage
Jonathan Gluck jonathangluck08854 [AT] gmail [DOT] com TAImage
Benjamin Gmurczyk bengmur [AT] terpmail [DOT] umd [DOT] edu TAImage
Baris Gokpinar webbaris [AT] hotmail [DOT] com TAImage
Eric Jeney jeney [AT] terpmail [DOT] umd [DOT] edu TAImage
Seokbin Kang (Grader) sean.kang84 [AT] gmail [DOT] com TAImage
Saurabh Kumar (Grader) saurabh.umdcs [AT] gmail [DOT] com TAImage
Andrew Liu liu.andrew.x [AT] gmail [DOT] com TAImage
Charles Parker charles.w.parker95 [AT] gmail [DOT] com TAImage
Ian Sweet isweet [AT] terpmail [DOT] umd [DOT] edu TAImage
Halley Weitzman halley.weitzman [AT] gmail [DOT] com TAImage
Lee Williams drummerx04 [AT] gmail [DOT] com TAImage

Lectures

Course Schedule

This schedule is tentative and subject to change. Keep in mind that the slides may not include all the material discussed in lecture. You are responsible for any material we present in lecture, even if it does not appear in the posted slides. Notice that code examples can be found in the grace cluster (public directory).

Week Topics Slides Work
CMSC216 Schedule
Week #1
(Jan 26)
Course Introduction, C Data Types, Operators, Input/Output, Control Statements, Active Learning Course-Intro-C-Intro-I.pdf
C-Intro-II.pdf
ActiveLearningWorkshop.pdf
E1 Out (Thu)
Week #2
(Feb 2)
Functions, scope, C Storage Types, Linkage, sizeof, GDB, Debugging (lecture), Input/Output Redirection (lab) C-Intro-III.pdf
Debugging.pdf
Q1 (Mon)
E1 Due (Wed)
E2 Out (Fri)
Week #3
(Feb 9)
Pointers, Arrays,
Math Library(lab)
Pointers.pdf
Pointers-Arrays.pdf
Q2 (Mon)
E2 Due (Wed)
P1 Out (Thu)
Week #4
(Feb 16)
Debugging, Pointer Arithmetic, 2-Dim Arrays, Strings PtrArithmeticArrays.pdf
Strings.pdf
Q3 (Mon)
P1a Due (Wed)
E3 Out (Fri)
Week #5
(Feb 23)
Structures, I/O (line-oriented-formatted) Structures.pdf
IO.pdf
Q4 (Mon)
E3 Due (Wed)
P1 Due (Wed)
P2 Out (Wed)
Week #6
(Mar 2)
I/O (Cont.), Function Pointers, Preprocessor I, Make, Bitwise Operators FunctionPtrs.pdf
PreprocessorI.pdf
Make.pdf
BitwiseOperators.pdf
P3 Out (Wed)
P2 Due (Thu/Due to snow Fri)
Week #7
(Mar 9)
Dynamic Memory Allocation, Dynamic Structures DynamicMemAlloc.pdf
E4 Out (Tue)
P3 Due (Thu)
Spring Break 2015 (Mar 15-Mar 22)
Week #8
(Mar 23)
Midterm I (Lecture), Assembly AssemblyI.pdf
AssemblyII-If-Loops.pdf
P4 Out (Mon)
E4 Due (Tue)
Midterm I (Thu)
Week #9
(Mar 30)
Assembly AssemblyIII-CallStack.pdf
AssemblyIV-ParamLocal.pdf
P4a Due (Mon)
Q5 (Mon)
P4 Due (Thu)
P5 Out (Thu)
Week #10
(Apr 6)
Process Control ProcessControlI.pdf
ProcessControlII.pdf
E5 Out (Thu)
P5a Due (Fri)
Week #11
(Apr 13)
Process Control, System I/O (read, write, dup2) ProcessControlIII.pdf
System-IO-I.pdf
System-IO-II.pdf
P5 Due (Wed)
E5 Due (Thu)
P6 Out (Thu)
Week #12
(Apr 20)
System I/O (pipes),
Midterm II (Lecture)
Midterm II (Thu)
Week #13
(Apr 27)
Time, Optimization Time.pdf
Optimization.pdf
Q6 (Mon)
P6 Due (Wed)
P7 Out (Sat)
Week #14
(May 4)
Course Evaluations, Concurrency, Preprocessor, Data Representation, Libraries Concurrency.pdf
PreprocessorII.pdf
Data-Rep.pdf
Libraries.pdf
Q7 (Mon)
P7a Due (Fri)

Week #15
(May 11)
Review Review.pdf
P7 Due (Mon)

Last Day of Classes
(Tue/May 12)

Final Exam
(Thu/May 14 4pm-6pm)
Grades Server Submit Server

Good Faith Attempt

Good Faith Attempt Deadlines

You must satisfy a minimum set of requirements for each project (Good Faith Attempt) otherwise you will not pass the course (automatic grade of F). Each project defines its own good faith attempt criteria. Notice that you will not receive extra points for completing the good faith attempt. The grade you obtain in the project will be based on your ontime/late submission.

ProjectGood Faith AttemptDeadline
Project #1 Public Tests Wed March 25
Project #2 Public Tests Wed March 25
Project #3 Public Tests Wed March 25
Project #4 Public Tests Wed April 8
Project #5 Public Tests #1, #2, #3, #4Fri May 1
Project #6 8 out of 11 public Tests Wed May 6
Project #7 Public Tests Tue May 12

Regrades

Regrades Deadlines

After any class material is graded, you have a period to address any grading concerns. Unfortunately we will not be able to address any grading concerns after the specified deadline.

Class MaterialGrading Concerns Deadline
Quiz #1Mon Feb 16
Exercise #1 (CreditCard)Mon Feb 16
Quiz #2Mon Mar 2
Project #1 (Part a)Fri Feb 27
Quiz #3Mon Mar 2
Quiz #4Mon Mar 9
Exercise #2 and #3Mon Mar 9
Pointer/Arrays WorksheetMon Mar 9
Strings WorksheetMon Mar 9
Project #1Wed Mar 25
Structures WorksheetWed Mar 25
Exercise #4Mon Mar 30
Project #2Mon Apr 6
Bitwise WorksheetWed Apr 8
Project #4 (Part a)Wed Apr 8
Project #3 Fri Apr 10
Midterm #1Mon Apr 13
Quiz #5Wed Apr 15
Project #5 (Part a)Wed Apr 15
Project #4 Fri May 1
Exercise #5Wed Apr 29
Midterm #2Wed May 6
Project #5Mon May 11
Quiz #6Fri May 8
DynmemSizeQsortWorksheets WorksheetMon May 11
Project #6Mon May 11
Project #7 (Part a)Mon May 11

Assignments

Projects

Projects

The planned dates when projects will be handed out and due is given in the course schedule. Beware that the exact dates are subject to change, but we will try to give you fair notice of any changes.

Frequent Problems Seen During Submission

Information can be found at Frequent Submission Problems

Project Descriptions

Project descriptions can be found in the grace cluster (along with the project files). You can download the project description to your computer using the link:

https://dav.terpconnect.umd.edu/

Quizzes

Quizzes

A few days prior to each quiz (except pop quizzes) we plan to post a worksheet on this page. The dates for the quizzes are given in the course schedule. Beware that the exact dates are subject to change, but we will try to give you fair notice of any changes.

Worksheets are not turned in and they are not graded. The problems on the worksheet are for your own benefit and are designed to prepare you for the quiz. We will not be giving answers to the worksheet problems, but if you have a question you can talk to the course TA(s).

WorksheetQuiz Date
Worksheet #1Mon Feb 2
Worksheet #2Mon Feb 9
Worksheet #3Mon Feb 16
Worksheet #4Mon Feb 23
Worksheet #5Mon Mar 30
Worksheet #6Mon Apr 27
Debugging Quiz/ExerciseWed May 6
Worksheet #7Mon May 4

Exercises

Exercises

The planned dates when exercises will be handed out and due is given in the course schedule. Beware that the exact dates are subject to change, but we will try to give you fair notice of any changes.

Exercise Descriptions

Descriptions can be found in the grace cluster (along with the exercise files). You can download the project description to your computer using the link:

https://dav.terpconnect.umd.edu/

Exams

Exams

This page provides information regarding course exams.

ExamDate
Midterm IThu Mar 26
Midterm IIThu Apr 23
FinalThu May 14

Resources

Links

Links

Piazza

Piazza

We will be using (Piazza) for class communication. Regarding Piazza:

  • We will use Piazza to communicate in lecture, and to provide class announcements.
  • Posting of code is not allowed is Piazza. Anyone posting any kind of code may receive an XF in the course.
  • In Piazza you can see the class announcements by selecting "Resources", "Course Information".
  • When we post an announcement, we will select the Piazza option that allows you to receive an immediate e-mail. The e-mail will have a subject line that starts with "[Instr Note]." If you are filtering piazza messages, make sure that those messages are not placed in the junk folder.
  • You are responsible for checking class announcements.
  • The prefered mechanism to address course questions (projects, lecture material, etc.) is during office hours, in lab, and lecture.
  • Students' questions can only be answered by CS staff (TAs and instructors). Although we will try to check Piazza often, there is no guarantee we will respond to messages immediately.
  • You will not be able to register to Piazza yourself. Your instructor will register you using the e-mail you have in the school system.
  • Piazza sents posts via e-mail. If you just want to receive messages posted by instructors, place a filter in your mail client than searches for [Instr Note] in the subject.

Lecture Videos

Lecture Videos

Note: If you get a "Generating Preview" message, download the video to your system for viewing
LectureDate
LinkDate
C-Intro Jan 29
C-Intro-III Feb 3
Debugging Feb 5
Pointers-Arrays Feb 12
Pointer Arithmetic, Command Line Arguments Feb 17
Strings Feb 17
Structures Feb 23
I/O Feb 26
Function PtrsMar 3
C Preprocessor I Mar 3
Bitwise OperationsMar 5
MakeMar 5
Dynamic Memory Allocation IMar 10/12
Dynamic Memory Allocation IIMar 10/12
Assembly IMar 23
Assembly IbMar 24
Assembly IcMar 26
Assembly IIMar 26
Assembly IIIAMar 31
Assembly IIIBMar 31
Assembly IIICMar 31
Assembly IIIDMar 31
Assembly IVAApr 2
Assembly IVBApr 2
Assembly IVCApr 2
Process Control IApr 7
Process Control IIApr 9
System Level I/O I VideoApr 16
Dynamic Memory Allocation in the C Standard Library
(by Dr. Neil Spring)
Apr 20
Sizes in C
(by Dr. Neil Spring)
Apr 20
Writing Code to Use qsort()
(by Dr. Neil Spring)
Apr 20
Process Control IVApr 20
System-Level IO IIAApr 20
Project InfoApr 16
System-Level IO IIBApr 16
System-Level IO IICApr 21

Introduction

The goal of the course is to convey the fundamental concepts that enable programs to execute on real hardware. Those concepts include how the operating system virtualizes the hardware to provide basic services and abstractions to enable a user program to effectively use the available hardware resources. The course also addresses how different programming constructs and idioms work.

The basic abstraction of a program running as one or more threads of control in a single flat address space (a Unix process) is the key to the course. Emphasizing that abstraction as the underlying model for understanding how a program works, from both the user program and hardware perspective (with the OS in between), run as a theme through all topics in the course. Examples include C pointers (to data and functions), function calls and runtime stack management, dynamic memory management in the heap, and the fork/exec system calls.

Coordinator

Nelson Padua-Perez

© 2015 University of Maryland College Park, MD 20742

Web Accessibility