COMS 3157 Advanced Programming

Fall 2026

• In-person lectures on Tue & Thu 4:10-5:25pm, 417 International Affairs Building

• Three exams:

  • Exam 1 on Thursday Oct 15, 4:10-5:25pm
  • Exam 2 on Tuesday Nov 17, 4:10-5:25pm
  • Exam 3 (final exam) on Tuesday Dec 22, 3:30-5:00pm (90 min)

  There are no make-up or alternate exams. If you cannot make any of those exams, please take the course next semester.

• Instructor: Jae Woo Lee

• Office hours:
  • Jae’s office hours
  • TA office hours
• Attendance form

Course essentials

• OVERVIEW AND LOGISTICS
• REQUIRED READING: ACADEMIC HONESTY POLICIES
• Course Syllabus
• Jae’s Git Tutorial
• Lab Workflow
• Helpful Guides

Past Lectures

Lecture 1: T 9/8

• Course overview and logistics
  • Slides: OVERVIEW AND LOGISTICS

Lecture 2: R 9/10

• Introduction to command line interface (CLI)
  • Getting Started in the UNIX Programming Environment
  • Lecture notes 01: CLI basics

Recitation 1: pre-recorded

• CLI, Vim, hello.c
  • CLI review
  • Some Vim tricks & .vimrc
  • hello.c

Lecture 3: T 9/15

• Compiling & linking
  • Separate compilation
  • Function declarations
  • Standard C Library
  • Using header file to prevent linking problem
  • Lecture notes 02: Separate Compilation and Make

Lecture 4: R 9/17

• Makefile
  • Lecture notes 02: Separate Compilation and Make
• Introduction to Git
  • Jae’s Git Tutorial
• Source code:
  • Makefile
  • myadd.c
  • myadd.h
  • mymod.c
  • myprogram.c

Recitation 2: pre-recorded

• Lab submission process
  • Quick review of Git basics
  • Lab workflow and submission using Git

Lecture 5: T 9/22

• C language basics
  • Integral data types
  • Binary numbers
  • Integer literals
  • Expression vs. statement
  • Bitwise operators
    • int f(int x) { return x & (1 << 5); }
  • Lecture notes 03: C language basics

Lecture 6: R 9/24

• C language basics (continued)
  • Bitwise operators (continued)
    • int g(int x) { return x | (1 << 5); }
    • sign extension
  • Logical operators & short-circuit evaluation
  • Assignment as expression
  • Evaluation of x++
  • Lecture notes 03: C language basics
• Storage classes
  • Automatic variables
  • Static variables
  • Lecture notes 04: Storage classes

Recitation 3: F 9/25

• Exercise on bitwise operations
  • bitwise1 program demo
  • Getting started with bitwise1
    • Directory setup, Git, Makefile
    • Generating random numbers

Lecture 7: T 9/29

• Process memory address space
  • Stack variable allocation
  • Lecture notes 04: Storage classes
• Pointers
  • Pointers and addresses
  • Pointer types
  • NULL pointers
  • Lecture notes 05: Pointers

Lecture 8: R 10/1

• Arrays
  • Array basics
    • sizeof operator
  • Pointer arithmetic
    • p++
  • Grand Unified Theory (GUT) of arrays and pointers
    • some differences: sizeof(a), a++
    • array parameters get converted to pointers
  • Lecture notes 06: Arrays
• Heap memory allocation
  • Dangling pointer
  • malloc() and free()
  • Lecture notes 07: Heap

Recitation 4: F 10/2

• Heap memory allocation
  • Dangling pointer (review)
  • malloc() and free() (review)
  • Checking memory leaks/errors using valgrind
  • Lecture notes 07: Heap

• Exercise on heap allocation and passing/returning pointers

• Source code:
  • alloc_int.c
  • main.c

Lecture 9: T 10/6

• Strings in C
  • Char arrays as strings
  • String literals
  • String functions in the Standard C Library
  • argv array
  • Lecture notes 08: Strings in C

Lecture 10: R 10/8

• Review of argv array

• Function pointers

  • const qualifier
  • qsort() library function
  • Complex declarations
  • Lecture notes 09: Function pointers

Recitation 5: F 10/9

• Review of complex declarations

• Exercise on argv array and strcpy()

  • argcat program demo
  • How to approach writing argcat

Lecture 11: T 10/13

• struct
  • Struct member layout
  • Struct size
  • Pointers to structs
  • Lecture notes 10: Structs
• Linked list
  • create2Nodes()
  • struct List
  • void *data
  • Lecture notes 10: Structs
• Source code:
  • two-nodes.c
• Libraries (reading assignment for lab3)
  • Lecture notes 11: Libraries

Exam 1: R 10/15

• Coverage:
  • Labs 1 and 2
  • All lecture materials up to and including Lecture 10
  • All recitation materials up to and including Recitation 5
  • Sample exams
  • All ANN emails

Recitation 6: F 10/16

• Exam 1 Review

Lecture 12: T 10/20

• Linked list (continued)
  • struct List and void *data (review)
  • free_all_nodes()
  • Tail recursion (optional topic)
  • Lecture notes 10: Structs
• Source code (for the optional topic):
  • free-nodes.c

• Macros & include guards

• Standard I/O
  • stdin, stdout, stderr
  • Redirection
  • Lecture notes 12: Standard I/O

Lecture 13: R 10/22

• Standard I/O (continued)
  • Pipes
  • Pipeline demo
  • Lecture notes 12: Standard I/O
• File I/O
  • Text file I/O
    • What fopen() does
    • Opening files in various modes
    • FILE* is an opaque handle
    • stdin/stdout/stderr are FILE* variables
    • fgets()
  • Lecture notes 13: File I/O
• Source code:
  • ncat.c

Recitation 7: F 10/23

• Lab 3 test driver walk-through

Lecture 14: T 10/27

• File I/O (continued)
  • Buffering on standard I/O
    • Line buffering vs. block buffering
    • fflush()
  • Binary file I/O
    • ‘b’ mode in fopen()
    • fseek()
    • fread() & fwrite()
  • Lecture notes 13: File I/O

• Lab 4 demo

• Formatted I/O
  • sscanf() & sprintf()
  • Lecture notes 13: File I/O
• Source code:
  • fcrop.c
  • fmt-io.c

Recitation 8: pre-recorded

• Getting stated with lab 4
  • Copying and renaming reference executables
  • First step: reading & printing the 1st record
  • Reading all mdb records in a loop

Lecture 15: R 10/29

• Formatted I/O (continued)
  • snprintf() vs. strncpy()
  • Lecture notes 13: File I/O
• Endianness
  • Inspecting binary files
  • Little-endian vs. big-endian
  • Network byte order
  • Lecture notes 14: Endianness
• Source code:
  • cut-str.c
  • endian-demo.c

Election Day (no class): T 11/3

Lecture 16: R 11/5

• Endianness (continued)
  • Little-endian, big-endian, network byte order (review)
  • Accessing logical bytes vs. physical bytes
  • Lecture notes 14: Endianness
• Process management in UNIX
  • Spawning processes with fork()
  • Exit status codes and waitpid()
  • Executing programs with exec()
  • Lecture notes 15: fork()
• Source code:
  • endian-demo.c
  • parent-child.c
  • ap-shell.c

Upcoming Lectures & Exams

Recitation 9: F 11/6

• Exercise on file I/O and endianness: saveints.c

Lecture 17: T 11/10

• Shell scripts
  • “shebang” interpreter directive
  • Lecture notes 16: UNIX
• Source code:
  • hi4.sh
• netcat: TCP/IP swiss army knife
  • Demo of chat session using netcat
• Remote mdb-lookup using netcat
  • ./mdb-lookup-cs3157 < mypipe | nc -l 10000 > mypipe

Lecture 18: R 11/12

• Users and file permissions in UNIX
  • User and group IDs
  • Expressing perms in octal number
  • setuid permission in executables
  • Search permission in directories
  • Lecture notes 16: UNIX
• How the Internet works
  • Five Internet protocol layers
  • Lecture notes 17: TCP/IP

Exam 2: T 11/17

• Coverage is technically cumulative, but will focus on post-Exam 1 materials:
  • Main focus: linked list (lab 3), file I/O (lab 4), endianness
  • Lectures up to and including Lecture 18
    • light coverage (if at all) of materials after endianness – True/False questions on main concepts, for example
  • Sample exams
  • All ANN emails

Assignments

• HW0 Part A due Tue 9/8
• HW0 Part B due Thu 9/10
• Lab1 due Sun 9/27
• Lab2 due Sat 10/10
• Exam 1 on Thursday Oct 15, 4:10-5:25pm
• Lab3 due Sun 10/25
• Lab4 due Sun 11/8
• Exam 2 on Tuesday Nov 17, 4:10-5:25pm
• Lab5 tentatively due Sun 11/22
• Lab6 tentatively due Mon 12/7
• Lab7 tentatively due Tue 12/15
• Exam 3 (final exam) on Tuesday Dec 22, 3:30-5:00pm (90 min)

---

Last updated: 2026-11-08