1 / 7

CS 201 – Data Structures and Discrete Mathematics I

CS 201 – Data Structures and Discrete Mathematics I. Syllabus Fall 2004. General Information. Time: 11:00am - 12:15pm, Tue & Thu 12:00 noon - 12:50pm, Wed Location: C6 LC Instructor: Bing Liu Web: http://www.cs.uic.edu/~liub Email: liub@cs.uic.edu

masao
Download Presentation

CS 201 – Data Structures and Discrete Mathematics I

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 201 – Data Structures and Discrete Mathematics I Syllabus Fall 2004 CS 201

  2. General Information Time: 11:00am - 12:15pm, Tue & Thu 12:00 noon - 12:50pm, Wed Location: C6 LC Instructor: Bing Liu Web: http://www.cs.uic.edu/~liub Email: liub@cs.uic.edu Office: 931 SEO Office hours: 3:00-5:00pm Tue & Thu (or by appointment) TA: Hosung Leo Kim Email: hkim@cs.uic.edu Office: See course Web page Office hours: 12:20-1:50pm Mon and Wed (or by appointment) Course Webpage: http://www.cs.uic.edu/~liub/teach/cs201-fall-04/cs201.html Prerequisites: MATH 180, C or better in CS 102 or C or better in CS 107 Req. texts: Data Structures and Algorithms in Java, Third edition, by Michael T. Goodrich and Roberto Tamassia Discrete Mathematics with Applications, Second Edition, by Susanna S. Epp, CS 201

  3. Course description This course is a blend of theory and practice. You will study some of the fundamental theoretical topics in Computer Science. These include mathematical induction, set and function theory, run time analysis, and logic. You will also learn some basic data structures and algorithms, and do programming projects to strengthen your programming skills and to apply theory in practice. In addition, you will also study the basics of object-oriented programming using Java. CS 201

  4. Topics • Propositional logic • Predicate logic • Mathematical induction • Set theory • Relation and function theory • Recursion • Java programming topics • Run time analysis • Linked lists, stacks and queues • Introduction to trees and graphs CS 201

  5. Grading • Final Exam: 40% • Midterm (1): 20% • Quizes (2): 20% • Java programming assignments (2-3) 20% • You MUST pass the final to pass the course. CS 201

  6. Rules and Policies 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’ 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. CS 201

  7. Rules and Policies 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. CS 201

More Related