1. CSE 115 / 503 Introduction to Computer Science For Majors I Carl Alphonce alphonce@cse.buffalo.edu 219 Bell Hall

2. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I2 Today’s lecture Syllabus Announcements Schedule of topics Advice Questions Homework

3. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I3 Syllabus who: instructors, UTAs, grading TAs, mentors what: topic list on next slide when: lecture, lab (recitation), outside class where: lecture room, Baldy 21, up to you why: –learn what computer science is –learn how to solve problems using computers how: lecture, labs, writing assignments, & your questions READ SYLLABUS BRING ANY QUESTIONS TO NEXT CLASS SIGN AND TURN IN SIGNATURE FORM

4. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I4 Lab announcement Labs for all sections begin next week. Make sure you do your preparatory work BEFORE coming to lab. Don’t have a copy of lab 1 preparatory work? Put your hand up!

5. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I5 Name sign announcement Make a sign with your first name on it –Use one letter-size piece of paper –Creativity counts –Best sign will win a prize Bring your sign with you to each class

6. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I6 Office hours announcement Regular office hours begin next week. If you need to see me this week, we can set up an appointment.

7. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I7 Topic list (not complete) Conceptual models Executable models Object-oriented (OO) problem solving (analysis, modeling, decomposition) OO programs as systems of interacting objects Objects (as having properties & behaviors, as service providers) Classes (as defining types, as defining objects – objects are class instances) UML class and object diagrams Types, variables, operators, expressions Methods, parameters & arguments Relationships: –has-a (aka composition or aggregation) –knows-a (aka association) –is-a (aka inheritance or generalization) –implements-a (aka implementation or realization) –uses-a (aka dependency) Interfaces & Abstract classes Polymorphism Arithmetic, Boolean algebra Selection and repetition (looping) Collections and Generics Design patterns (e.g. Iterator, State, Singleton, Strategy, Composite, Decorator, Null Object)

8. Fall 2007CSE 115/503 Introduction to Computer Science For Majors I8 HOMEWORK 1.Lab 1 prep 2.Read syllabus/return signature sheet 3.Make a name sign 4.Get books and notes