1 / 11

CS1010: Programming Methodology http://www.comp.nus.edu.sg/~cs1010/

CS1010: Programming Methodology http://www.comp.nus.edu.sg/~cs1010/. Special DL Awards. The Geekiest DL Winner: Sean Pea Runner-up: Antonius Christian The Funniest DL Winner: Sean Pea Runner-up: Antonius Christian The Most Adorable DL Winner: Sean Pea Runner-up: Antonius Christian

mayes
Télécharger la présentation

CS1010: Programming Methodology http://www.comp.nus.edu.sg/~cs1010/

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. CS1010: Programming Methodologyhttp://www.comp.nus.edu.sg/~cs1010/

  2. Special DL Awards • The Geekiest DL • Winner: Sean Pea • Runner-up: Antonius Christian • The Funniest DL • Winner: Sean Pea • Runner-up: Antonius Christian • The Most Adorable DL • Winner: Sean Pea • Runner-up: Antonius Christian • The Most Serious DL • Winner: Sean Pea • Runner-up: Wong Hong Wei CS1010 (AY2012/3 Semester 1) Week13 - 2

  3. Winners of Challenger Exercise • First 3 successful submissions • Nguyen Tan Sy Nguyen (SG1, DG2) • Bui Trong Nhan (SG5, DG13) • Zhao Pengran (SG2, DG6) • Encouragement prize • Hoang Quang Minh (SG6, DG18) CS1010 (AY2012/3 Semester 1) Week13 - 3

  4. CS1010 Final Examination (1/2) • CS1010 Exam • 27 November 2012, Tuesday, 9 – 11am • Venue: To be announced by Registrar’s Office • Format • MCQ section: 6 questions • 3 short questions (comprising tracing questions and programming questions; each consisting of parts) • 1 long programming question comprising many parts • Grading of CS1010 is not based on bell curve CS1010 (AY2012/3 Semester 1) Week13 - 4

  5. CS1010 Final Examination (2/2) • Instructions • Open book • No calculators, electronic dictionaries and devices • May use 2B pencil to write codes • Advice • Read instructions carefully and follow them! • Manage your time well! • A question may consist of several parts; the parts may be independent. If you are stuck on one part, move on to the next. CS1010 (AY2012/3 Semester 1) Week13 - 5

  6. How to Prepare for Exams? • Preparing for Exams: A Guide for NUS Students • http://www.cdtl.nus.edu.sg/examprep/ CS1010 (AY2012/3 Semester 1) Week13 - 6

  7. Post-CS1010 (1/3) • For CS/CM/CB students: CS1010  CS1020  CS2010 or CS1010  CS2020 (accelerated) * • For IS and EC students: CS1010  CS1020 • CS1020 Data Structures and Algorithms I • Emphasis on algorithms and data structures • Using an object-oriented programming language Java • Textbook: Data Abstraction & Problem Solving with Java: Walls and Mirrors by Janet J. Prichard and Frank M. Carrano, 3rd edition (based on last year’s information, subject to change) CS1010 (AY2012/3 Semester 1) Week13 - 7

  8. Post-CS1010 (2/3) • Topics covered (based on last year; subject to change) • Topics may not be covered in this sequence CS1010 (AY2012/3 Semester 1) Week13 - 8

  9. Post-CS1010 (3/3) • CS1020 has sit-in labs (like mini-PEs) every other week • Strengthen your programming skills to prepare for CS1020 CS1010 (AY2012/3 Semester 1) Week13 - 9

  10. CS1010 (AY2012/3 Semester 1) Week13 - 10

  11. End of File

More Related