CIS 1130

Foundations of Computer Science

Fall 2008

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: Tuesday & 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: One should be able to understand the program development process, including problem specification, analysis, and design using algorithmic and object-oriented methods as well as be able to write, test, and debug simple computer programs written in Java using variables, branching, subprograms (methods), and arrays. The student shall be able to understand and utilize GOOD PROGRAMMING practices.

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:

Sept.2 Syllabus, Introduction to Computers 1

Sept. 9 Number System, Problem Solving

Sept. 16Problem Solving, Java Application2

Sept. 23                                   Introduction to Classes and Object                                                 3

Sept.30Control Structure 4

Oct.. 7 Control Structure 5

Oct. 14Quiz, Methods 6

Oct. 21Methods, Recursion, Review    6

Oct. 28Midterm

Nov. 4    Arrays7

N0v. 11Arrays7

Nov. 18Quiz, Problem solving using arrays and methods

Nov. 25String & Exception Handling  10

Dec. 2         Sequential I/0 and problem solving                            17

Dec. 9 Final Exam

Final Exam:Tuesday December 9, 2008 6:00-9:00 PM