CIS 1130

Foundations of Computer Science

Syllabus

Fall 2009

Instructor: Dr. John Youssefi

Course hours: Tuesday 6:30-10:30 PM, SM 203

Point of contact: jyoussefi@.ndnu.edu, (650) 508-3450, SM 205

Office hours: Monday & Friday 5:30 - 6:30 PM and by appointment

Required text:Java How to Program by Deitel & Deitel, 2007 7th edition

Prerequisites:Math level IV competency or concurrent enrollment in MTH1320 or permission of instructor.

Course description: This is a first course for the computer science major. Number systems and data representation, boolean expressions and operators, an overview of computer organization, steps in building software applications such as flowcharts and pseudocode, conditional and repetitive structures, methods, recursion, arrays, applets, and modular approach to programming methodology are covered.

Course objective:

• Students should be able to understand the program development process, including problem specification, analysis, and design
• Students will be using algorithmic and object-oriented methods to solve the problems
• Students will be able to write, test, and debug computer programs written in Java using variables, branching, subprograms (methods), and arrays.
• Students will be able to understand and utilize GOOD PROGRAMMING practices.

Assessment Methods:

• Through homework and programming assignments
• Through quizzes and tests
• Through a comprehensive project

Procedure: Homework will be assigned for each class, and will be due in two weeks. I encourage you to work together on assignments, and discuss the problem but each student should fully understand all the material that he or she hands in. To make sure that you are prepared when you are coming to class there will be some quizzes between midterm and final.  Students are strongly encouraged to come during office hours with any problems regarding the course or assignment. Attendance is mandatory. No make-up quiz or test will be given. For an excused absence, other quizzes or tests will be weighted more heavily.

Grading: Homework:40%

Quizzes 10%

Midterm:25%

Final:        25%

93-100 A 90-93 A-

87-90 B+ 84-87 B 80-84 B-

77-80 C+ 74-77 C 70-74 C-

67-70 D+ 64-67 D 60-64 D-

0-60 F

Incomplete: See the University Catalog (p. 36). A grade of Incomplete requires that work due at or before the time of the request be at a C average, and that the reason for requesting the Incomplete is serious, beyond your control and documented.

Tentative Schedule:

Date: Topic:Chapter:

Week 1 Syllabus, Introduction to Computers 1

Week 2  Number System, Problem Solving

Week 3    Problem Solving, Java Application2

Week 4                                      Introduction to Classes and Object                                   3

Week 5  Control Structure  4

Week 6 Control Structure  5

Week 7 Quiz, Methods  6

Week 8Methods, Recursion, Review      6

Week 9Midterm

Week 10  Arrays  7

Week 11Arrays  7

Week 12Quiz, Problem solving using arrays and methods

Week 13String & Exception Handling  10

Week 14       Sequential I/0 and problem solving                            17

Week 15Final Exam

Final Exam:December 8, 2009 6:30-9:30 PM

Note: If you have a learning disability or other condition or circumstance that may affect your work in this class, please bring it to the instructor’s attention as soon as possible so that appropriate adjustments can be made. The Tutorial Center and the Writing Center (CC) are important resources for giving and receiving help.Please contact Dr. Peggy Koshland Crane at 650.508.3670 or mcrane@ndnu.edufor further information.