FA09_CS1050_Syllabus_1 (2)

FA09_CS1050_Syllabus_1 (2) - CS 1050 Algorithm Design &...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 1050 Introduction This course provides the student with experience in developing algorithms, designing, implementing and testing programs. It discusses the fundamental concepts behind object- oriented programming, and uses the Java language as an implementation vehicle. Prerequisites MATH 1100/1120 and CS1040 (C- or better) or passing Pretest screening quiz. Instructors Joe Guilliams: guilliamsd@missouri.edu Office Location: EBW 123 Office Hours: Monday and Wednesday 1:00pm – 2:00pm (may change) TAs Mian Pan : mpry6@mizzou.edu office hours Thursday 3:30-4:30 in room EBW239 Aleks Lobzhanidze agl7dd@mizzou.edu office hours Friday 1-2 in room EBW250 Alan Lafferty: awlxb6@mizzou.edu office hours Tuesday 11-12 in room EBW239 Sachin Meena: sm3z5@mizzou.edu office hours Monday 3-4 in room EBW239 Michael Eschbacher: mjevxd@mizzou.edu office hours Wednesday 3-4 in room EBW239 TUTORING SESSIONS: Weekly on Wednesdays from 6:30-8pm. Feel free to visit the office hours of any of the TAs for the class. Textbook Required: Deitel and Deitel, Java: How to Program , 8/E. Schedule Lecture Monday and Wednesday 11:00-11:50am, Neff Hall, Room 204 Labs (one of the following) Section A Monday 8:00am – 10:50am, EBW 144 Section B Wednesday 8:00am - 10:50am, EBW 145 Section C Tuesday 8:00am – 10:50am, EBW 144 Section D Monday 12:00pm – 2:50pm, EBW 144 Section E Tuesday 2:00pm – 4:50pm, EBW 145 Check with the Schedule of Courses published on myZou for room changes.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Course Web Page (Use your PawPrint ID) http://blackboard.missouri.edu Topics Primitive data types: int, double, String, etc Branching/ Conditional statements: if, if-else, switch, . .. Iteration/ Loops: while, for,. .. Classes, Methods and Objects Arrays Encapsulation Inheritance Polymorphism Exception Handling File I/O Recursion Grading The overall course grade will be calculated as a weighted average of assignments using the following values (1000 points possible):
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

FA09_CS1050_Syllabus_1 (2) - CS 1050 Algorithm Design &...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online