CS-1050-B: Understanding and Constructing Proofs (21959), Spring 2006
Tu-Th. from 9:35am to 10:55am in Instruction Center 117

Instructor: Jarek Rossignac, jarek@cc.gatech.edu Office in Tech Square: TSRB-320

Office hours: Tuesdays 11:10 to 11:50 in CCB 223

TA: Keshev Attrey, attrey@cc.gatech.edu

Office Hours: Mo-Tu-We-Th 6:10 pm to 7pm in CCB101 (call cell if not there)

Date Topic Slides for lecture (X..=previous year) Assigned Reading Projects due Resources, deadlines, events, solutions
01 Jan 10, Tu Boolean Logic, Processing L01a, L01b, X01a, X01b, X01c 1.1, 1.2
02 Jan 12, Th Quantifiers L02, X02, P0 1.3, 1.4 QL02
03 Jan 17, Tu Proofs L03, X03a, X03b, P1 1.5 P0 QL03
04 Jan 19, Th Sets, Functions L04, X04a, X04b, X04c, X04d, X04e 1.6, 1.7, 1.8   QL04
05 Jan 24, Tu Sorting L05, P2 2.1 P1 QL05
06 Jan 26, Th Complexity L06, X06 2.2, 2.3 QL06
07 Jan 31, Tu Number Theory L07 2.4, 2.5, 2.6 P2
08 Feb 2, Th REVIEW, Projects P3, XR1a, XR1b   QL08
09 Feb 7, Tu MIDTERM 1 M1
10 Feb 9, Th Matrices L08 2.7
11 Feb 14, Tu Proof strategies, Sequences L09a, L09b, X09a, X09b, P4 3.1, 3.2 P3 QL11
12 Feb 16, Th Induction L10, X10a, X10b, X10c, X10d 3.3, 3.4 grades due
13 Feb 21, Tu Recursion L11 3.5 P4 QL13
14 Feb 23, Th Counting L12, X12a, X12b 4.1, 4.2
15 Feb 28, Tu Permutations L13, X13, P6 4.3, 4.4, 4.5, 4.6 P5
16 Mar 2, Th Computational Geometry L14   QL16
17 Mar 7, Tu Computational Geoemtry L15, P7 P6  
18 Mar 9, Th Boolean Algebra L16 10
19 Mar 14, Tu Active Zones and Blist L17, P8   P7 Active Zone, QL19
20 Mar 16, Th CSG Rendering L18   Blister, CST
21 Mar 28, Tu REVIEW R2, XR2a , XR2b    
22 Mar 30, Th MIDTERM 2 M2  
23 Apr 4, Tu Graphs L19, X19, P9 8.1, 8.2, 8.3 P8
24 Apr 6, Th Connectivity L20 8.4, 8.5, 8.6
25 Apr 11, Tu Planar graphs L21 8.7, 8.8 P9  
26 Apr 13, Th Trees L22 9.1, 9.2, 9.3
27 Apr 18, Tu Spanning Trees L23 9.4, 9.5
28 Apr 20, Th Triangle Meshes L24   Chapter 54, TmeshBuilder,
29 Apr 25, Tu Edgebreaker Compression L25 Research,
30 Apr 27, Th REVIEW R3, XR3a, XR3a
  May 3, We FINAL


EXAMPLES of previous exams (with solutions):

Plagiarizing is “to steal and pass off (the ideas or words of another) as one's own : use (another's production) without crediting the source” [Webster]. If caught plagiarizing, you will be dealt with according to the GT Academic Honor Code. Unless specifically identified as group work; quizzes, tests, take-home-tests, homework, etc. are to be completed alone. If you find that the solution to a homework or to a problem that you must solve in a project is published in a book, article, webpage, etc., you may use it as an inspiration, provided that you clearly identify the source (providing a complete URL or bib reference) and that you rewritee it in your own words, providing detailed explanations showing that you understand the overall approach and the details of every step. In fact, you are encouraged to improve on that solution and to briefly document your improvement. When working on a software project, you ("you" standing for a single student for individual projects or for the team for team projects) may use utilities and libraries developed by others for all the non-essential parts of your program, provided that you clearly identify their source in the header of your program. Examples of such utilities include graphics libraries, matrix multiplication, and linear solvers. The essential parts of the program (which relate to the material taught in class) must be entirely coded by you and must include clear comments. If you find source code or high level algorithmic descriptions that implement the desired functions, you may use them as inspiration, provided that you clearly identify the source of inspiration both in your source file and on the project report and that you rewrite and comment the code in your own style, to clearly demonstrate that you understand its structure and details. Finally, I encourage you to discuss the projects with other students in the class and to freely share ideas and resources. You may also ask colleagues or the TA to help fix a bug in your code. But you may not use or copy their code.