CS 201 - Spring 2005 (Under Construction)

Data Structures and Discrete Mathematics

Course description

If you have problems with any topic, exercise question or assignment, DO ASK me or TA for help, we are here to make the course undersdood. DO NOT delay your questions. There is no such thing as a stupid question. The only obstacle to learning is laziness.

General Information

• Instructor: Bing Liu
  • Email: me
  • Tel: (312) 355 1318
  • Office: SEO 931
• Course Call Number: 17418
• Lecture times:
  • 2:00pm - 3:15pm, Tuesday & Thursday
  • 2:00pm - 2:50pm, Monday
• Location: 304 BH
• Office hours: 10:30am-12:00noon, Monday and Tuesday (or by appointment)
• Teaching Assistant: Jianhong Zhou
  • Emails: jzhou13@uic.edu
  • Tel: 312 996 6007
  • Office: SEO 1006
  • Office Hours: 11am-12:30pm Wednesday and Friday (or by appointment)

Midterm

• March 8, 2005: Propositional logic, Predicate logic, Mathematical induction, Recursion, Run time analysis. Questions and answers

Final Exam

• Time and date: May 3rd, Tuesday, 3:30 - 5:30 304 BH

Grading

• Final Exam: 40%
• Projects and assignments: 20%
• Midterm: 20%
• Quizzes: 20%
• In addition, you MUST pass the final to pass the course.

Prerequisites

• MATH 180
• C or better in CS 102 or C or better in CS 107
• Credit is not given for CS 201 if the student has credit in MCS 261

Teaching materials

• Required texts
  • Discrete Mathematics with Applications, Third Edition, by Susanna S. Epp, Brooks/Cole Publishing Company, 1995, ISBN 0-534-94446-9
  • Data Structures and Algorithms in Java, Third edition, by Michael T. Goodrich and Roberto Tamassia, John Wiley and Sons, 2004, ISBN 0-471-46983-1

• Java Documents
  • API documentation
  • Java Language Specification
• Set up Environment
  • Unix

  J2SDK and JRE have been installed in cs server "bert". You can log on to "bert.cs.uic.edu", directly use command "javac" to compile and "java" to run the program. (As to command format, refer to "man javac" and "man java".) There are several available editors for you to write code, such as "pico", "emacs" and vi.

  You also can download Java Development Environment and Running Environment to your home PC.

  • Windows
      

  NOTE: (IMPORTANT!!!)

  In order to program and debug easily, you may use some Integrated Development Environment (IDE) tools, such as Jbuilder, Blue Jay. For the programming assignments, you must make sure that your code can be compiled and run in bert without any additional packages.

  Also you can develop and debug your code in Windows, but before you submit, you should make sure that your code can run in "bert" because all assignments will be graded on "bert".

• Start-up Tutorial
  • First Cup of Java and More ...
  • Some Examples
  • There are many good Java books. I use: Introduction to Java Programming, by Y. Daniel Liang, Prentice Hall, ISBN 0-13-100225-2.

Topics (subject to change)

• Course information notes
• Propositional logic notes
• Predicate logic notes
• Mathematical induction notes
• Recursion notes
• Run time analysis notes
• Java programming topics notes
• Linked lists, stacks and queues notes
• Set theory notes
• Relation and function theory notes
• Trees and graphs notes

Weekly Exercises (not graded)

• Exercise 1: Exercise Set 1.1: 1, 3, 6, 18, 23, 25, 42. Exercise Set 1.2: 1, 3, 7, 9, Exercise Set 1.3: 1, 8, 26.
• Exercise 2: Exercise Set 2.1: 2,13,14. Exercise Set 2.2: 1,33,40. Exercise Set 2.3: 14,21,30,32,33,38. Exercise Set 2.4: 5,9,10,16.
• Exercise 3: Exercise Set 4.2: 6, 8,10,13. Exercise Set 4.3: 8, 16.
• Exercise 4: Exercise Set 8.1: 3,5. Exercise Set 8.4: 1(a), 2(a), Exercise Set 9.5: 8,9,20,22.
• Exercise 5: Exercise Set 9.2:4,5,6,18,34. Exercise Set 9.3:2,4,6,9,11,38. Exercise Set 9.4: 30,32.
• Exercise 6: Exercise Set 5.1: 1, 8. Exercise Set 5.2: 1, 6(1), 21(a) Exercise Set 5.3: 1,5,6,25,26, Exercise Set 7.3: 1, 3, 7, 17.
• Exercise 7: Exercise Set 5.1: 22(a)(d),23,30(a). Exercise Set 7.1: 1,3(a)(b), 4(a)(c). Exercise Set 7.2: 2,5,7(a). Exercise Set 10.1: 1,11(a),13. Exercise Set 10.2: 1,3,9,14,26. Exercise Set 10.3: 3,5. Exercise Set 10.5: 8,16(a),22,31.
• Exercise 8: click here

Assignments and Projects (graded)

• Assignment 1: download here (Due: 11:59pm, Mar 7, 2005)
• Assignment 2: download here (Due: 11:59pm, Mar 28, 2005)
• Assignment 3: download here (Due: 11:59pm, April 25, 2005)

Rules and Policies

• Incompletes: The UIC Undergraduate catalog states that in addition to needing excellent justification for an incomplete, a student must also have been "making satisfactory progress in the course." Therefore, no matter how good your excuse, I will not grant you an incomplete if you have less than a C average at the time you ask for an incomplete.
• Statute of limitations: No grading questions or complaints, no matter how justified, will be listened to one week after the item in question has been returned.
• Cheating: Cheating will not be tolerated. All work you submitted must be entirely your own. Any suspicious similarities between students's work (this includes homework, exams and program) will be recorded and brought to the attention of the Dean. The MINIMUM penalty for any student found cheating will be to receive a 0 for the item in question, and dropping your final course grade one letter. The MAXIMUM penalty will be expulsion from the University.
• MOSS: Sharing code with your classmates is not acceptable!!! All programs will be screened using the Moss (Measure of Software Similarity.) system.
• Late assignments: Late assignments will not, in general, be accepted. They will never be accepted if the student has not made special arrangements with me at least one day before the assignment is due. If a late assignment is accepted it is subject to a reduction in score as a late penalty.
• Classroom Conduct: Classroom discussions and questions are a valuable part of the learning process and are encouraged. However, students who repeatedly talk among themselves disrupting the class lecture will be asked to leave.