CS1020 Data Structures and Algorithms I Lecture Note #0
Course Admin (AY2011/2 Semester 2)
‹#›
[CS1020 Lecture 0 AY2011/2 S2]
Welcome to CS1020 2 http://www.comp.nus.edu.sg/~cs1020
‹#›
[CS1020 Lecture 0 AY2011/2 S2]
Staff 3 Lecturers Prof Ling Tok Wang COM2-03-01 lingtw@comp.nus.edu.sg A/P Tan Sun Teck COM2-03-02 tanst@comp.nus.edu.sg Dr Aquinas A. Hobor COM2-03-12 hobor@comp.nus.edu.sg Mr. Aaron Tan Tuck Choy COM1-03-12 tantc@comp.nus.edu.sg
‹#›
Lecture Sectional Groups
Sectional Group 1 (SG1) Wednesday 10am – 12nn @ LT19 A/P Tan Sun Teck: Weeks 1 – 6 Prof Ling Tok Wang: Weeks 7 – 13 Sectional Group 2 (SG2) Wednesday 10am – 12nn @ PL2 (COM1-B-09) Mr Aaron Tan Sectional Group 3 (SG3) Tuesday 2 – 4pm @ PL2 (COM1-B-09) Dr Aquinas A. Hobor [CS1020 Lecture 0 AY2011/2 S2] 4
‹#›
Between the Sectional Groups
Differences: Delivery styles Similarities: Cover exactly the same topics Using the same lecture notes Shared assessments: Tutorials, labs, test and exam Graded together Don’t worry All assessments are jointly set to ensure fairness [CS1020 Lecture 0 AY2011/2 S2] 5 It’s the same, really!
‹#›
This module is: The second part of the 3-module introductory programming course CS1010 CS1020 CS2010 Emphasizes on algorithms and linear data structures Topics covered: Object Oriented Programming (OOP) Model Using Java programming language Classic data structures Lists, Stack and Queue Recursion Basic algorithmic analysis Sorting methods Hashing [CS1020 Lecture 0 AY2011/2 S2] 9
‹#›
2. Objectives
With this course, you should be able to: Use object oriented modeling to formulate solution Utilize appropriate simple data structures in problem solving Understand recursion and data abstraction Understand program efficiency through algorithm analysis [CS1020 Lecture 0 AY2011/2 S2] 10
‹#›
3. Resources: Module Website and IVLE
IVLE Forums: Use appropriate heading when you post Announcements: Check daily Anonymous feedback: Not to use this if you expect a reply [CS1020 Lecture 0 AY2011/2 S2] 11 http://www.comp.nus.edu.sg/~cs1020 Module website
‹#›
3. Resources: Textbook
Data Abstraction and Problem Solving with Java: Walls and Mirror [CS1020 Lecture 0 AY2011/2 S2] 12 International edition, 3rd edition Authors: Janet J. Prichard and Frank M. Carrano Publisher: Pearson ISBN: 9780273751205
‹#›
4. Assessment: Overview
CA 55% Labs 30% More on this later Midterm test (closed book) 20% 2nd March 2012, Friday, 6pm to 7.30pm MPSH5 1 piece of A4 HANDWRITTEN (no photocopy) reference sheet allowed Tutorial attendance/participation 5% Final Exam (closed book) 45% 1 piece of A4 HANDWRITTEN (no photocopy) reference sheet Friday, 27 April 2012, 9 – 11am [CS1020 Lecture 0 AY2011/2 S2] 13
‹#›
4.1 Tutorials
See module website for updates Weekly, start from week 3 You are expected to present solutions and participate in the discussion Suggested solutions will be released in the following week [CS1020 Lecture 0 AY2011/2 S2] 14
‹#›
4.2 Laboratory sessions
See module website for updates Actual lab session starts from week 3 A special lab 0 will be released for week 2 Familiarize yourself with the system Give away 1% for “free” if you complete and submit lab 0 before deadline Two types of lab sessions: Normal (take-home) labs 1% per session, total 5% Sit-in labs 8% per session, total 24% [CS1020 Lecture 0 AY2011/2 S2] 15
‹#›
4.2 Laboratory: Normal Lab
There are a total of 5 normal labs Question will be released before actual lab session You are encouraged to attempt before going for the lab During the lab session, lab TA will: Discuss possible approaches Cover additional syntax (if any) At the end of the session, you are expected to: Submit your work to serve as an attendance record Worth 1% per session [CS1020 Lecture 0 AY2011/2 S2] 16
‹#›
4.2 Laboratory: Sit-in Lab
There are a total of 4 sit-in labs A sit-in lab is like a mini practical exam to test your programming skills Test on topic(s) covered by the previous normal lab Each sit-in lab is: 1 hour 40 minutes in duration and worth 8% Open book, but limited to printed material only Your best 3 sit-in labs out of 4 will be chosen Total 24% You will get a makeup only if: You missed 2 or more sit-in labs with valid MC [CS1020 Lecture 0 AY2011/2 S2] 17
‹#›
[CS1020 Lecture 0 AY2011/2 S2]
4.2 Laboratory: Schedules (Tentative) Lab Date Type Topics 0 19th Jan (Week 2) Special 1 26th Jan (Week 3) Take-home #1 IO / OOP 2 2nd Feb (Week 4) Sit-in #1 IO / OOP 3 9th Feb (Week 5) Take-home #2 Advanced OO 4 16th Feb (Week 6) Sit-in #2 Advanced OO 5 1st Mar (Week 7) Take-home #3 LL/Stack/Queue 6 8th Mar (Week 8) Sit-in #3 LL/Stack/Queue 7 15th Mar (Week 9) Take-home #4 Recursion 8 22nd Mar (Week 10) Sit-in #4 Recursion 9 29th Mar (Week 11) Take-home #5 Sorting/Hashing 18
‹#›
[CS1020 Lecture 0 AY2011/2 S2]
4.2 Sit-in Labs: Marking Scheme Programming style: 30% Checked by Lab TAs Meaningful comments: 10% Purpose of methods and statements Pre- and post-conditions Modularity: 10% Meaningful identifiers: 5% Indentation: 5% Try to get the "free" 30% for every sit-in lab! 19
‹#›
[CS1020 Lecture 0 AY2011/2 S2]
4.2 Sit-in Labs: Marking Scheme (cont) Correctness and efficiency: 70% Lab TA manually inspects your program Partial credit will be awarded Penalties: Non-compilable: 50% off your final score (including both the style and correctness scores) Empty program: E.g. All codes are commented Generally, commented code are ignored. So this could result in 0% 20
‹#›
Comments