This course gives a solid understanding of the principles and abstractions used in computer systems and machine programs using C. Towards this aim, it covers a broad range of topics, providing students with an in-depth perspective and programming experience regarding the basic topics of C language and how programs are formed and executed at the microprocessor-level.
Upon the completion of COMP201, student will be able to (1) demonstrate proficiency in writing C programs that require effective memory management, (2) gain a deep knowledge of the compilation flow and runtime behavior of C programs, (3) have a clear understanding of computer arithmetic in a modern computing system, (4) recognize the relationship between a C program and its assembly translation, and (5) gain a general sense of working in a Unix environment as a power user, getting familiar with shell tools, version control systems, compilers, debuggers, profilers.
The course is taught by Aykut Erdem, Mert Cokelek, Burak Can Biner, Osman Batur Ince, Irem Karaca, Eda Guven.
Lectures: Monday, Wednesday at 14:30-15:40 (SNA A21)
Labs: Friday at 08:00-09:40 (Lab A), 10:00-11:40 (Lab B (SNA B242=)
Office Hours Wednesday at 09:00-10:00 (Aykut)
Policies: All work on assignments must be done individually unless stated otherwise. You are encouraged to discuss with your classmates about the given assignments, but these discussions should be carried out in an abstract way. That is, discussions related to a particular solution to a specific problem (either in actual code or in the pseudocode) will not be tolerated.
In short, turning in someone else’s work, in whole or in part, as your own will be considered as a violation of academic integrity. Please note that the former condition also holds for the material found on the web as everything on the web has been written by someone else.
The course webpage will be updated regularly throughout the semester with lecture notes, presentations, assignments and important deadlines. All other course related communications will be carried out through Blackboard.
COMP201 is open to second-year undergraduate students. Non-COMP students should ask the course instructor for approval before the add/drop period. The prerequisites for this course is COMP 132 - Advanced Programming.
Grading will be based on
Date | Topic | Notes |
Oct 3 | Introduction. Course logistics, A tour of C programs (slides) (video spring'21) (code) | B&O 1 Additional Reading: The Strange Birth and Long Life of Unix, Warren Toomey, IEEE Spectrum, 28 Nov 2011 “A damn stupid thing to do”—the origins of C, Arstechnica |
Oct 5 | Bits and Bytes, Representing and Operating on Integers (slides) (code) Assg0 out: Getting Started with Unix and C |
B&O 2.2-2.3 Additional Readings:
|
Oct 7 | Bootcamp: Programming with C and Git basics (slides) (video) | |
Oct 10 | Bits and Bitwise Operators (slides) (video spring'21) (code) | B&O 2.1 |
Oct 12 | Floating point (slides) (video spring'21) (code) Assg0 in, Assg1 out: Manipulating Bits |
B&O 2.4 Additional Reading: What Every Computer Scientist Should Know About Floating-Point Arithmetic, David Goldberg, ACM Computing Surveys, 23(1), 1991 Demos: |
Oct 14 | Lab 1: The Linux Shell (slides) | MIT MS The Shell Stanford CS107 Unix videos 1-15, 24, 25 |
Oct 17 | Chars and Strings in C (slides) (video spring'21) (code) | K&R 1.9, 5.5, Appx B3 |
Oct 19 | More Strings, Pointers (slides) (video spring'21) (code) | K&R 1.6, 5.5, Essential C 3 (strings and string.h library functions, The mechanics of pointers and arrays) |
Oct 21 | Lab 2: Bits, Ints and Floats, Vim (slides) | MIT MS Editors (Vim) Stanford CS107 Unix videos 28 |
Oct 24 | Arrays and Pointers (slides) (video spring'21) (code) | K&R 5.2-5.5, Essential C 6 (Advanced pointers) |
Oct 26 | The Stack and The Heap (slides) (video spring'21) Assg1 in, Assg2 out: Strings in C |
K&R 5.6-5.9, Essential C 6 (The heap) |
Oct 28 | No lab this week - Republic day | |
Oct 31 | Realloc, Memory Bugs (slides) (code) | K&R 5.6-5.9, Essential C 6 (The Heap) |
Nov 2 | void *, Generics (slides) (video spring'21) (code) | K&R 5.6-5.9, Essential C 6 (The Heap) |
Nov 4 | Lab 3: C-Strings and Valgrind (slides) | Stanford CS107 Unix videos 26 |
Nov 7 | Function Pointers (slides) (video spring'21) (code) | K&R 5.11 |
Nov 9 | const, Structures (slides) (video spring'21) (code) Assg2 in |
K&R 6.1-6.7 |
Nov 11 | Lab 4: Arrays/Pointers and GDB (slides) | Stanford CS107 Unix videos 27 Harvard CS50 short on GDB |
Nov 14 | No class - Winter break | |
Nov 16 | No class - Winter break | |
Nov 18 | No lab this week - Winter break | |
Nov 21 | Compiling C programs (slides) (video spring'21) (code) | Stanford Unix Programming Tools 1 |
Nov 23 | Introduction to x86-64, Data Movement (slides) (video spring'21) (code) Assg3 out: Heap Management |
B&O 3.1-3.4 Additional reading:
|
Nov 25 | Lab 5: Structs, Working with multiple files, writing your own Makefiles (slides) | |
Nov 28 | Arithmetic and Logic Operations (slides) (video spring'21) | B&O 3.5-3.6 |
Nov 30 | x86-64 Control Flow (slides) (video spring'21) | B&O 3.6.1-3.6.2 |
Dec 2 | No lab this week | |
Nov 30 | Midterm Exam (Midterm Exam Guide) | |
Dec 5 | More Control Flow (slides) (video spring'21) | B&O 3.6.3-3.6.8 |
Dec 7 | x86-64 Procedures (slides) (video spring'21) (code) Assg3 in, Assg4 out: Defusing a Binary Bomb |
B&O 3.7 |
Dec 9 | Lab 6: Machine Programming with Assembly (slides) | |
Dec 12 | Data and Stack Frames (slides) (video spring'21) | B&O 3.8-3.9 |
Dec 14 | Security Vulnerabilities (slides) (video spring'21) (code) | B&O 3.10 Additional Reading: Smashing the Stack for Fun and Profit, Aleph One |
Dec 16 | Lab 7: Runtime Stack (slides) | |
Dec 19 | The Memory Hierarchy (slides) (video spring'21) | B&O 6.1-6.3 |
Dec 21 | Cache Memories (slides) (video spring'21) Assg4 in, Assg5 out: Buffer Overflow Attacks |
B&O 6.4-6.7 Demos: Cache Simulator |
Dec 23 | No labs this week | |
Dec 26 | More Cache Memories (slides) | B&O 6.4-6.7 |
Dec 28 | Optimization (slides) (code) | B&O 5 |
Dec 30 | Lab 8: Memory organization (slides) | |
Jan 2 | Linking (slides) (video spring'21) | B&O 7 |
Jan 4 | Managing The Heap (slides) (video spring'21) Assg5 in |
B&O 9.9 |
Jan 6 | Lab 9: Code Optimization | |
Jan 9 | More Heap Allocators (slides) | B&O 9.10 |
Jan 11 | Wrapping Up (slides) | |
Jan 13 | No labs this week | |
TBA | Final Exam (Final Exam Guide) |