Computer Science 3
|
Dr. Jody Paul – Education – MSCD Courses Computer Science 3 |
| jody@acm.org | ||
 |
|
|
|
|
|
|
|
 |
 |
 |
 |
 |
 |
 |
|
 |
|||||||
| Title: | Computer Science 3 |
| Institution: | Metropolitan State College of Denver |
| Course ID: | CSI 3050, Section 1 |
| Semester [CRN]: | Fall 2005 [53231] |
| Meeting Times: | Mondays and Wednesdays, 11:00 AM - 12:50 PM |
| Location: | CN 233 |
| Credit Hours: | 4 |
| Official Info: | This course is a continuation of the Computer Science core sequence, emphasizing the concepts of object-oriented software development, data representation and algorithmics. Students are required to meet with a mathematics or computer science faculty advisor prior to registration for this course. Advisor schedules are available in the Department office, SI 141. This semester, this course will use both Java and C++ to illustrate the Computer Science concepts. |
| Course Website: | http://www.jodypaul.com/cs/cs3 |
| Instructor: | Dr. Jody Paul (schedule & office hours) |
| E-mail: | jody@cse.mscd.edu |
| Office: | Science 133C (x68435) |
| Campus Mail: | Campus Box 38 |
Date: Wednesday December 14, 2005 Balanced Binary Search Tree Java implementation using treeToVine and vineToTree, due September 12
BalancedBST & BTNode: API Javadoc
JUnit Tests: BalancedBSTTest.java, BTNodeTest.java (Updated September 7)
Java implementation of TreeCollection using AVL for balancing: API Javadoc
JUnit test class TreeCollectionTest.java, due September 21 (Sample Solution)
TreeCollection.java implementation, due September 26 (Assessment Rubric)
A nice AVL tree applet is available at http://www.site.uottawa.ca/~stan/csi2514/applets/avl/BT.html
Graph ADT (Graph, Vertex, Edge) Participation in online discussion of Graph ADT API, due September 28
Java implementation of Interfaces Graph, Vertex, Edge due October 3 (Assessment Rubric) (ADT Javadoc)
JUnit tests classes: GraphTest.java, EdgeTest.java, VertexTest.java, due October 7 (Assessment Rubric)
Java implementation of classes CS3Graph, CS3Vertex, CS3Edge due October 24
Exam Reference: ExNode Balanced Binary Search Tree in C++: Reference Video Poker Strategy Analysis:.class files) Huffman Code Generation: API Reference Tentative Schedule for Fall 2005:
• Week 1
Review of CS-2 Material
Overview of CS-3 Objectives & Course Logistics
• Weeks 3–7
Graphs, Search Trees, B-Trees, Hashes
Applied software research & development
Introduction to multi-platform development & fielding
• Week 8
Midterm Exam
• Weeks 9–15
Extensive software research & development exercises
| This course, a continuation of CSI 2050, extends students' knowledge and experience with Object-Oriented Software Engineering, Data Representation and Algorithmics. Additional data structures covered include graphs, search trees, B-trees, and hashes. Students will specify, design and implement numerous software applications, of moderate complexity, addressing a wide range of programming . This semester, both Java and C++ programming languages will be used in this course. |
| You are expected to participate in class discussions and in-class exercises. There are no "make-ups" for missed in-class activities and exercises. Note that significant information will be disseminated during class sessions or on course web pages that you will be responsible for knowing whether or not you attended the sessions or accessed the website. That is, not all information necessary to successfully complete the assignments or examinations is covered in the textbook. Your final course grade is determined by first associating a Pass/Fail assessment based on the completion of all required assignments, then combining your scores on exercises, assignments and exams. In order to receive a passing grade (A B C or D), you must successfully complete all required assignments and receive a passing grade on the Final Exam. Your actual letter grade is guaranteed to be no lower than that computed by the following distribution of total points and weighted average conversion to letter grade:
Any assignment that is not turned in on time will receive a maximum of 50% of the total possible points. Missing the final exam will result in a course grade of F. Missing the midterm exam will result in a midterm exam grade of 0 and a maximum possible course grade of C. Late homework and make-up exams will not be accommodated without prior arrangement and written agreement. Unforeseeable crises and emergency situations will be dealt with on a case-by-case basis in accordance with MSCD, College, and Departmental policies. The work you turn in must be your own, created by you individually. Collaboration and discussion with fellow students concerning course information, materials, and studying for exams is encouraged. However, to provide fair assessment for grading and maximized benefit from the learning experience, work you turn in must reflect your individual effort. Turning in work that is the result of unauthorized collaboration or copying will be treated as academic dishonesty and an attempt at fraud. All incidents of suspected dishonesty will be reported to the department and the Dean of the College. Consequences may include a grade of 0 on the assignment or exam, a grade of "F" for the course, academic probation, or dismissal from the institution. This is a very serious matter and should not be taken lightly. If you have any uncertainty or concerns, please discuss them with your instructor or advisor. |
Observance of religious holidays follows College policy, which is posted on the web at http://handbook.mscd.edu in the section "Academics – Everything to Know About Grades". Each student is responsible for understanding and abiding by the policy.
Students desiring a reasonable accommodation under the ADA must contact
the instructor immediately to discuss their needs. You will need to supply a disability verification letter from the Disability Services office (Auraria Library, Room 115) before the instructor can make appropriate accommodations. Failure to notify the
instructor in a timely manner of the need for a reasonable
accommodation may hinder the college's ability to assist students in
successfully completing the course.
©2003,2004,2005 Dr. Jody Paul
