Lecture 1 |
Introduction |
hello.c |
Lecture 2 |
Algorithms and Programs |
max.c
|
Lecture 3 |
Types, operators, I/O |
Homework 0
Homework 0 due: 10 Oct., 23:59.
|
Lecture 4 |
Control Flow Instructions |
if.c
switch.c
cond.c
|
Introduction to the CSD infrastructure and UNIX |
Brief introduction to UNIX
Part 2
Git Tutorial
|
|
Lecture 5 |
Loop Instructions |
Homework 1
Homework 1 due: 30 Oct., 23:59.
global-local.c
while.c
whilescan.c
count-digits.c
|
Lecture 6 |
Functions |
|
Lecture 7 |
Functions and Variables |
callbyvalue.c
|
Lecture 8 |
Arrays |
array.c
|
Lecture 9 |
Strings |
histogram.c
|
Lecture 10 |
Multidimensional Arrays |
Homework 2
Homework 2 due: 21 Nov., 23:59.
students.c
array-traversal.c
|
Lecture 11 |
Pointers, part I |
constptr.c
|
Lecture 12 |
Pointers, part II |
cards.c
|
Revision |
|
|
Midterm16 November 14:00-17:00 |
|
|
Lecture 13 |
Dynamic Memory Management |
malloc.c
mymalloc.c
2dalloc.c
strarray.c
|
Lecture 14 |
File Management |
|
Lecture 15 |
Recursion |
fib.c
hanoi.c
mutual.c
power.c
|
Lecture 16-17 |
Sorting and Searching |
mergesort.c
qsort.c
|
Lecture 18-19 |
Structure Types |
|
Lecture 20 |
Recursive Structures |
|
Lecture 21 |
Simply Linked Lists |
|
Lecture 22 |
Doubly Linked Lists |
|
Lecture 23 |
Other properties of C |
|
Final Exam?? Jan. |
|
|
