COMS 3157 Advanced Programming

Spring 2024

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

• Three exams:

  • Exam 1 on Tuesday, Feb 27, 4:10pm
  • Exam 2 on Thursday, Mar 28, 4:10pm
  • Exam 3 (final exam) on Tuesday, May 7, 4:20pm

  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

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 1/16

• Course overview and logistics
  • Slides: OVERVIEW AND LOGISTICS

Lecture 2: R 1/18

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

Recitation 1: Sa 1/20

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

Lecture 3: T 1/23

• 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 1/25

• 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 1/30

• 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 2/1

• C language basics (continued)
  • Bitwise operators (continued)
    • int g(int x) { return x | (1 << 5); }
  • 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

Lecture 7: T 2/6

• Storage classes (continued)
  • Static variables (continued)
• Process memory address space
  • Stack variable allocation
  • Lecture notes 04: Storage classes
• Pointers
  • Pointers and addresses
  • Lecture notes 05: Pointers

Lecture 8: R 2/8

• Pointers (continued)
  • Pointer types
  • NULL pointers
  • Lecture notes 05: Pointers
• Arrays
  • Array basics
    • sizeof operator
  • Grand Unified Theory (GUT) of arrays and pointers
  • Lecture notes 06: Arrays
• Heap memory allocation
  • Lecture notes 07: Heap

Recitation 3: Sa 2/10

• Heap memory allocation (continued)
  • Stack allocation revisited – dangling pointers
  • Allocating arrays on the heap
  • Lecture notes 05: Pointers
  • Lecture notes 07: Heap
• Source code:
  • alloc_int.c

Lecture 9: T 2/13

• Heap memory allocation (review)
  • Lecture notes 07: Heap
• 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 2/15

• Review of argv array

• Function pointers

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

Lecture 11: T 2/20

• struct
  • Struct member layout
  • Struct size
  • Pointers to structs
  • Lecture notes 10: Structs
• Linked list
  • create2Nodes()
  • Lecture notes 10: Structs
• Source code:
  • two-nodes.c

Lecture 12: R 2/22

• Linked list (continued)
  • free_all_nodes()
  • struct List
  • void *data
  • Lecture notes 10: Structs

• Macros & include guards

• Libraries (reading assignment for lab3)
  • Lecture notes 11: Libraries
• Standard I/O
  • stdin, stdout, stderr
  • Lecture notes 12: Standard I/O

Exam 1: T, 2/27

• Coverage:
  • Labs 1 and 2
  • All lecture materials up to and including Linked list
  • Sample exams
  • All ANN emails

Lecture 13: R 2/29

• Standard I/O (continued)
  • Redirection & pipes
  • Pipeline demo
  • Lecture notes 12: Standard I/O
• File I/O
  • FILE pointers
  • fopen(), fclose(), fprintf(), fgets(), fputs()
  • Lecture notes 13: File I/O
• Source code:
  • ncat.c

Lecture 14: T 3/5

• File I/O (continued)
  • Buffering on standard I/O
    • Line buffering vs. block buffering
    • fflush()
  • Binary file I/O
    • ‘b’ mode in fopen()
    • fread(), fwrite(), fseek()
  • Lecture notes 13: File I/O
• Formatted I/O
  • sscanf() & sprintf()
  • snprintf() vs. strncpy()
  • Lecture notes 13: File I/O
• Source code:
  • fcrop.c
  • fmt-io.c
  • cut-str.c

Lecture 15: R 3/7

• Formatted I/O (continued)
  • snprintf() vs. strncpy()
  • Lecture notes 13: File I/O
• Source code:
  • cut-str.c
• Getting stated with lab 4
  • Copying and renaming reference executables
  • First step: reading & printing the 1st record

Spring Break (no lectures): T 3/12, R 3/14

Lecture 16: T 3/19

• Endianness
  • Inspecting binary files
  • Little-endian vs. big-endian
  • Network byte order
  • Lecture notes 14: Endianness
• Source code:
  • endian-demo.c
• Process management in UNIX
  • Spawning processes with fork()
  • Lecture notes 15: fork()
• Source code:
  • parent-child.c

Lecture 17: R 3/21

• Process management in UNIX (continued)
  • Review Spawning processes with fork()
  • Exit status codes and waitpid()
  • Executing programs with exec()
  • Lecture notes 15: fork()
• Source code:
  • parent-child.c
  • ap-shell.c
• Shell scripts
  • “shebang” interpreter directive
  • Lecture notes 16: UNIX
• Source code:
  • hi4.sh

Lecture 18: T 3/26

• 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
• Users and file permissions in UNIX
  • User and group IDs
  • Expressing perms in octal number
  • Search permission in directories
  • setuid permission in executables
  • Lecture notes 16: UNIX

Exam 2: R 3/28

• Coverage is technically cumulative, but will focus on post-Exam 1 materials:
  • Labs 3 and 4
  • Lectures up to and including Lecture 16 (T 3/19)
  • Sample exams
  • All ANN emails

Recitation 4: pre-recorded

• Getting started with Lab 5

Lecture 19: T 4/2

• How the Internet works
  • Five Internet protocol layers
  • Lecture notes 17: TCP/IP

Lecture 20: R 4/4

• Sockets API
  • UNIX I/O using file descriptors
  • Sockets API overview
  • Simple echo client & server example
  • Lecture notes 17: TCP/IP
  • Reference slides: Overview of Sockets API and HTTP 1.0
• Source code:
  • toupper.c
  • tcp-echo-client.c
  • tcp-echo-server.c

Lecture 21: T 4/9

• Sockets API
  • Simple echo client & server example (continued)
• HTTP 1.0
  • GET request & response
  • Demo using netcat
  • Lecture notes 18: HTTP
• Source code:
  • tcp-echo-client.c
  • tcp-echo-server.c

Recitation 5: pre-recorded

• Lab 6 overview

Lecture 22: R 4/11

• Putting it all together: Sockets API, Endianness, File I/O
  • File sender & receiver example
• Source code:
  • tcp-sender.c
  • tcp-recver.c

No class on T 4/16

• TA meet-up

Lecture 23: R 4/18

• Lab 7 demo
  • Web root
  • HTTP 1.0 vs HTTP 1.1
  • Dynamic web page
• 3-tier architecture

Guest Lecture on Tue 4/23

• How Python Actually Works

  Guest lecture by Jake Torres, Carl von Bonin, Yara Saabneh

  Why do we learn C when Python is so simple and has so much industry application? Follow us as we embark on a journey through Python’s source code to reveal it is more closely related to Advanced Programming than you would have thought!

Lecture 24: R 4/25

• From C to C++: Object-Oriented Programming Exposed

• Source code:
  • hello.cpp
• Course wrap-up

Assignments

• HW0 Part A due Tue 1/16
• HW0 Part B due Thu 1/18
• Lab1 due Sun 2/4
• Lab2 due Tue 2/20
• Exam 1 on Tuesday, 2/27, 4:10pm
• Lab3 due Wed 3/6
• Lab4 due Fri 3/22
• Exam 2 on Thursday, 3/28, 4:10pm
• Lab5 due Sun 4/7
• Lab6 due Wed 4/17 Fri 4/19
• Lab7 due Tue 4/30 Thu 5/2 Fri 5/3 Mon 5/6 (Hard Deadline)
• Exam 3 (final exam) on Tuesday, May 7, 4:20pm

---

Last updated: 2024-05-01