Fundamentals of Computer Science II
CSSE 152 – Winter 2008
Instructor: Dr. R. Roshandel
Office: Engr 507
Office Phone: 206-296-5512
Email: roshanak@seattleu.edu
Class time: 9:00 – 9:50am MTTHF, Engr 304
Lab time: 9:00 – 9:50am W, Piggot 207
Office Hours: 10:00-11:00am MWTH,
11:00-12:00am T F, or by appointment
Continuation of the introduction to the fundamentals of computer science, including recursion, linked lists, abstract data types (ADTs) (such as stacks, queues, linked lists and binary trees) and function overloading.
Pre-requisite: CSSE 151 (grade of C or higher)
Starting Out with C++, Tony Gaddis (5th edition), Addison Wesley ISBN 0-321 40939-6
At the end of this course, the student should be able to:
· Write 10-15 pages of code using top-down design, employing multiple functions, classes, pointers, and dynamic memory.
· Distinguish the difference between the implementation and interface of an abstract data type.
· Write code to manipulate (construct, insert, delete, and search) a linked list.
· Define and use stacks, queues, and binary trees appropriately.
· Identify when to use recursion and implement it correctly.
Class Website
The class website can be found on Angel at http://angel.seattleu.edu. If you have any questions about accessing Angel let me know.
· Labs/in-class activities 5 %
· Programming Assignments 20 %
· Exam 1 25 %
· Exam 2 25 %
· Exam 3 25 % (must get 70% or higher)
The instructor has the right to include additional graded activities as necessary. These will be part of the Labs/in-class activities.
All exams will be closed book and closed notes. Failure to appear for an exam will result in a score of zero for that test. Makeup tests will be given only in extraordinary circumstances, at the discretion of the instructor. Makeup tests may be oral. The final exam is cumulative and a score of 70% or higher is required on the final exam to be granted a grade of C or better for this class.
The grading scale varies based for different exams and assignments but it will conform to the following:
· 90% or more: A- or better
· 80% or more: B- or better
· 72% or more: C or better
Attendance in lab is required. Most labs will consist of a small programming exercise related to the topic of the week. All lab assignments are due at 8:45 am the next day. Each student must complete the lab assignment individually but may work with other students during the lab session.
Each lab must be submitted electronically. Instructions will be given along with your lab assignment.
There will be 5 programming assignments and they are due by 8:45 am on the due date. No late submission will be accepted. Grading criteria for the programming assignment will be distributed with the first assignment. Programming assignments are individual assignments and no collaboration is allowed. If you have questions or doubts about the assignment, ask the instructor. Please refer to the university academic honesty policy.
Programs will be submitted electronically. Refer to a separate handout detailing this process detailing this process.
Labs and programming assignments must be submitted electronically. You may submit an assignment multiple times but only the last submission will be graded as previous submissions are overwritten. An assignment will only be graded once.
No late lab and programming assignment will be accepted. It is crucial that you start working on your assignment early.
Students are responsible for all material presented in class. Pop quizzes will be given periodically. Therefore, attendance is recommended.
All exams will be closed book and closed notes. Use of calculators, PDAs, cell phones, laptops, and other electronic devices is not permitted during the exam. Failure to appear for Exams 1 and 2 will result in a zero for that exam. Failure to appear at the final will result in a failing grade for the entire course. The final exam is cumulative and you need to receive a grade C or better in the final exam, in order to pass the course.
Makeup exams will only be given in extraordinary circumstances and may be given in oral form at the discretion of the instructor.
Plagiarism is the unacknowledged use of the work or intellectual property of other persons, published or unpublished, presented as one’s own work. All students are expected to work on all individual assignments independently. Collaboration on individual assignments is considered cheating and will be penalized accordingly. Other examples of behavior that is not tolerated in this class include copying all or part of someone else’s work and submitting it as your own, sharing your assignment solution with other students in the class, consulting with another student during an exam, and copying text from published literature (e.g., books other than the textbook) without proper attribution. Use of external sources such as open source material or the Internet must be approved by the instructor and must be cited before submitting the assignment.
You may use class material without citation. Class material include information (examples, code) presented in class, discussed during the office hours, textbook material, lecture notes, or other information provided by the instructor.
If you have questions about what is allowed, please discuss it with the instructor. All students are responsible for reading and following the Seattle University Academic Honesty Policy. Students who violate University standards of academic honesty are subject to disciplinary sanctions, including failure in the course and suspension from the University.
If you have, or think you may have, a disability (including an ‘invisible disability’ such as a learning disability, a chronic health problem, or a mental health condition) that interferes with your performance as a student in this class, you are encouraged to arrange support services and/or accommodations through Disabilities Services staff in the Learning Center, Loyola 100, (206) 296-5740. Disability-based adjustments to course expectations can be arranged only through this process.
Classes 13, 14
Pointers 9, 11.9-11.10
Linked Lists 17
Stacks & Queues 18
Recursion 19
Binary Trees 20
|
January 7 (Mon) |
Classes Begin |
|
January 13 (Sun) |
Last Day to Register, Add/Drop or Change Grading Options |
|
January 21 (Mon) |
No classes – Martin Luther King's Birthday |
February 15 (Fri) |
Last Day to Withdraw |
|
February 18 (Mon) |
No classes – President’s Day |
|
March 14 (Fri) |
Last Day of Class |
Tentative Assignment and Exam Schedule (Subject to Change – refer to class website for updates)
|
Exam 1 |
January 28, 2008 |
|
Exam 2 |
February 22, 2008 |
|
Exam 3 |
March 19, 2008 12-1:50 PM |
|
PA 1 |
January 18, 2008 |
|
PA 2 |
February 1, 2008 |
|
PA 3 |
February 15, 2008 |
|
PA 4 |
February 29, 2008 |
|
PA 5 |
March 14, 2008 |