1 / 16

COMS W1004 Introduction to Computer Science

COMS W1004 Introduction to Computer Science. May 28, 2008. Teaching staff. Instructor: Chris Murphy cmurphy@cs.columbia.edu Office hours: Mon 3-5pm, 608 CEPSR TA: Aditi Rajoriya ar2630@columbia.edu Office hours: Tue/Thu 7:30-8:30pm, 122 Mudd Office hours start next week (June 2).

cardea
Download Presentation

COMS W1004 Introduction to Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. COMS W1004Introduction to Computer Science May 28, 2008

  2. Teaching staff • Instructor: Chris Murphy • cmurphy@cs.columbia.edu • Office hours: Mon 3-5pm, 608 CEPSR • TA: Aditi Rajoriya • ar2630@columbia.edu • Office hours: Tue/Thu 7:30-8:30pm, 122 Mudd • Office hours start next week (June 2)

  3. About the course • This course is an introduction to computer science for computer science and other science and engineering majors having little or no prior programming experience. • The goals of this course are to teach students: • fundamental Java programming skills • knowledge of the fundamental concepts in computer science • algorithmic program-solving capabilities

  4. Course homepage http://www.cs.columbia.edu/~cmurphy/1004 • Please check the course homepage frequently for important announcements and changes to the reading assignments

  5. CourseWorks http://courseworks.columbia.edu/ • Check the “Discussion” section for questions related to the homeworks • Check the “Gradebook” to make sure our records match your own

  6. Grading • Homeworks: 60% • Final exam: 40% • These are “guidelines” for the final grade

  7. Homeworks • There will be four homework assignments • Each homework has two parts: • Theory • Programming • Homeworks will be posted on the course homepage and in CourseWorks

  8. Exams • An in-class final exam will be held on the last day of class: Wednesday, July 2 • Exam covers material from readings and lectures (so come to class!)

  9. Textbooks • Schneider & Gersting Invitation to Computer Science, Java Version, Third Edition • Lewis & Loftus Java Software Solutions: Foundations of Program Design, Fifth Edition • Both available at CU Bookstore or online

  10. CUNIX • You will need a login account to access Columbia’s computing environment (CUNIX) • Columbia students: It is the same one you use to get your Columbia email, etc. • If you don’t have a UNI or don’t know what yours is, go to http://uni.columbia.edu

  11. Syllabus • The course covers approx. 50% Java programming basics and 50% computer science theory • Check the course homepage for assigned readings for each lecture

  12. Academic honesty • Please familiarize yourself with the Computer Science Department’s policy: http://www.cs.columbia.edu/education/honesty • It is YOUR responsibility to read and adhere to the policy

  13. Today • What is computer science? • What is an algorithm? • Examples of algorithms • Expressing algorithms • Reading: S&G 1-2 • Next lecture: THIS Friday!

  14. What is Computer Science? “The study of algorithms, including: • Their formal and mathematical properties • Their hardware realizations • Their linguistic realizations • Their applications” -Schneider & Gersting, p.4 Computer Science is NOT (just) programming!

  15. What is an Algorithm? “A procedure for solving a mathematical problem in a finite number of steps that frequently involves repetition of an operation; broadly: a step-by-step method for accomplishing some task.” -Schneider & Gersting, p. 5 “A well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time.” -Schneider & Gersting, p.10

  16. Theory Homework #1 • Do the following questions from S&G Third Edition: • Chapter 1: 7, 9 • Chapter 2: 1, 10, 11, 21, 23 • Homework is due at the beginning of class on June 4! • Just a paper copy, not electronic

More Related