LECT: topic: S98 dates: 1 2 conditionals 3 loops and graphics 4 loops and graphics 5 debugging song, while, guess the # 6 arrays HW 1 DUE Feb 11, 12 (sect 2,1) 7 more arrays: insertion sort 8 functions, bubble sort, oracle problem 9 modular decomposition, oracle solutions (see course web page) 10 stable marriage, intro recursion stepwise refinement HW 2 DUE Feb 25, 26 11 modular decomposition song 12 more recursion randomized algorithm for Syrpinsky's triangle 13 more modular examples -- sphere guess the animal more recursion -- hanoi HW 3 DUE March 9 (both sections) 14 mergesort more recursion -- trace hanoi midterm review MIDTERM EXAM March 11, 12 (lect 15 is before midterm for section1) 15 more mergesort -- actual implementation talk about HW4 random sirpinsky bouncing ball 16 midterm solutions histogram of midterm grades 17 Today we're doing choose_demo.c and math behind it triangle2.c and algorithm behind it intro HW5 (Kill the Wumpus) structures HW 4 DUE March 30, 31 18 array of structures more on Wumpus 19 2D arrays, tictactoe (tictac.c) 2D array versus array of structures 20 pointers modular interface (explemplified with Pig Latin) 21 memory allocation HW 5 DUE (Dead Wumpus) April 15, 16 22 handout HW6 array of pointers binary search 23 more HW6 details pointers song 24 linked lists complexity 25 more linked lists and complexity more complexity 26 more complexity data/flow charts overview of CS as a field HW 6 DUE May 4, 5 27 summary /conclusions course themes C without the Roberts library cellular automata FINAL EXAM: COMS W1007 001 INTRO TO COMPUTER SCIENCE May 14 THURS HAV209 110PM 400PM COMS W1007 002 INTRO TO COMPUTER SCIENCE May 11 MON SCH614 110PM 400PM

**email:** *evs at cs dot columbia dot edu*