Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS1020 Data Structures and Algorithms I Lecture Note #0 Course Admin (AY2014/5 Semester 2)

Similar presentations


Presentation on theme: "CS1020 Data Structures and Algorithms I Lecture Note #0 Course Admin (AY2014/5 Semester 2)"— Presentation transcript:

1 CS1020 Data Structures and Algorithms I Lecture Note #0 Course Admin (AY2014/5 Semester 2)

2 [CS1020 Lecture 0: Course Admin] 2 Module OverviewObjectivesStaffResourcesSchedulesAssessments Outline

3 Module Overview Linear Data Structures OOP 3 Algorithms CS2010CS1020CS1010 Object Oriented Programming (OOP) model Using Java Classic data structures Lists, Stacks, Queues Basic analysis of algorithmRecursion More advanced than CS1010 Sorting algorithms More advanced than CS1010 Hashing [CS1020 Lecture 0: Course Admin]

4 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 data abstraction  Understand recursion  Understand program efficiency through analysis of algorithms 4 [CS1020 Lecture 0: Course Admin]

5 Lecturers 5  Mr. Aaron Tan Tuck Choy COM1-03-12 tantc@comp.nus.edu.sg tantc@comp.nus.edu.sg  Sectional Group 1 @ SR1  Dr Low Kok Lim AS6-04-09 lowkl@comp.nus.edu.sg lowkl@comp.nus.edu.sg  Sectional Group 2 @ LT15 [CS1020 Lecture 0: Course Admin]

6 Module website 6 http://www.comp.nus.edu.sg/~cs 1020 Resources [CS1020 Lecture 0: Course Admin]

7 IVLE  Announcements: Check daily  Forums: Use appropriate heading when you post 7 https://ivle.nus.edu.sg Resources [CS1020 Lecture 0: Course Admin]

8 CodeCrunch 8 http://codecrunch.comp.nus.edu.sg Resources [CS1020 Lecture 0: Course Admin]

9 Textbook Data Abstraction and Problem Solving with Java: Walls and Mirror 9  International edition, 3 rd ed  Authors: Janet J. Prichard and Frank M. Carrano  Publisher: Pearson  ISBN: 9780273751205  Available at NUS Co-op @ Forum Textbooks for loan  For needy students  Please refer to IVLE forum for details Resources [CS1020 Lecture 0: Course Admin]

10 Schedules 10 http://www.comp.nus.edu.sg/~cs1020/1_module_info /sched.html [CS1020 Lecture 0: Course Admin]

11 Assessments: Overview 11 [CS1020 Lecture 0: Course Admin] http://www.comp.nus.edu.sg/~cs1020/1_module_info /desc.html  Tutorials and labs start in week 3  Mid-term test and final exam are closed-book (2-page A4 size handwritten cheat sheet allowed)

12 Laboratory sessions See module website for updates Actual lab session starts from week 3  A special lab #0 (1%) will be released in week 1 Familiarize yourself with the UNIX system and vim Two types of lab session:  Take-home labs 5 sessions, 2% per session Total: 10% + 1% (lab #0) = 11%  Sit-in labs 4 sessions, 8% per session Total: 24% (Best 3 out of 4 sessions) 12 Assessments [CS1020 Lecture 0: Course Admin]

13 Take-home Labs 5 take-home labs (excluding lab #0) Released on CodeCrunch  Each lab consists of 3 exercises  You should attempt them before attending the lab  Only one of them will be graded During the lab session, your lab TA will:  Discuss possible approaches  Cover additional syntax (if any) or other related exercises/topics  Lab attendance: 3% Each take-home lab (except lab #0) is worth 2%  Must be submitted to CodeCrunch BEFORE deadline  Must be of decent effort (at least 60/100 marks) 13 Assessments [CS1020 Lecture 0: Course Admin]

14 Sit-in Labs There are 4 sit-in labs A sit-in lab is like a mini practical exam to test your programming skills Each sit-in lab is:  1 hour 40 minutes in duration and worth 8%  Open book, but limited to printed material only  API will be available on the computer Your best 3 sit-in labs out of 4 will be chosen  Total: 24% You will be allowed to take a makeup only if  You missed 2 or more sit-in labs with valid medical certificates or official excuses 14 Assessments [CS1020 Lecture 0: Course Admin]

15 Sit-in Labs: Marking Scheme (1/2) Correctness: 60 marks  Awarded by CodeCrunch  If there are x test cases, each test case is worth 60/x marks. Penalties:  If the program contains logic flaws not caught by CodeCrunch testing, marks will be deducted for correctness/design. In other words, CodeCrunch’s correctness mark is not final.  Commented codes are ignored in general.  Uncompilable codes will receive zero or very low mark for correctness. 15 Assessments [CS1020 Lecture 0: Course Admin]

16 Sit-in Labs: Marking Scheme (2/2) Programming style: 20%  Meaningful comments:  5% Particulars A description for each user-defined method Appropriate pre- and post-conditions  Follow Java naming convention:  5%  Meaningful/descriptive identifiers:  5%  Proper indentation:  5% Design: 20%  Modularity: 5-10%  Logic: 10-15% This is used when flaws in the code are not caught by CodeCrunch The above are just guideline. The detail marking scheme may vary from lab to lab. 16 Assessments [CS1020 Lecture 0: Course Admin]

17 WeekDateTypeTopics 115 th JanSpecialIntro Workshop 1--Take-home #0Basic Java 329 th JanTake-home #1OOP 45 th FebSit-in #1OOP 512 th FebTake-home #2Array and OOP 619 th FebChinese New Year (no lab) 75 th MarSit-in #2Array and OOP 812 th MarTake-home #3Linked List 919 th MarTake-home #4Stack/Queue 1026 th MarSit-in #3LL/Stack/Queue 112 nd AprTake-home #5Recursion 129 th AprSit-in #4Recursion 1316 TH AprRevision Lab Schedules (Tentative) 17 Plan is tentative. Refer to module website for the most up-to-date plan. Assessments [CS1020 Lecture 0: Course Admin]

18 Topics in C / Java / Python / Javascript  Operating system: UNIX  Editor: vim  Debugger: (eg: gdb) Programming environment/tools  Writing pseudocodes  Edit – compile – execute” cycle  Step-wise refinement  Hand-tracing codes  Incremental coding  Testing  Debugging Program development  Class exercises  Practice exercises  Lab assignments Problem solving Assumptions Or what we assume you should have learned in CS1010/CS1010J/CS1010S/CS1101S

19 Webcast? Are there webcasts? Yes, but they will only be released in week 6 and week 13 19 [CS1020 Lecture 0: Course Admin]

20 Summary and advice (1/2) The labs focus more on your programming skills:  Ability to translate idea into actual program Midterm and final exam focus more on your problem-solving skills:  Ability to understand and reason about the problem  Ability to apply your knowledge to formulate solution You need to spend time on:  Actually coding to improve your skill  Thinking deep and exploring as memorization does not help  Asking questions! (Use the IVLE forums.) 20 [CS1020 Lecture 0: Course Admin]

21 Summary and advice (2/2) We provide you  Practice exercises on CodeCrunch  Self-assessments (quizzes) on IVLE  Help sessions (on request) But, ultimately… 21 must be prepared and willing to put in a lot of efforts! [CS1020 Lecture 0: Course Admin]

22 Introductory Workshop 22 Those of you who have taken CS1010/CS1010J are familiar with UNIX system and vim. For those who did not take CS1010 and hence are unfamiliar with UNIX and vim, please attend an Intro Workshop on 15 th January, Thursday, at PL2 (COM1 basement)  Session 1: 10am – 11:40am  Session 2: 12nn – 1:40pm Please refer to IVLE forum “Intro Workshop” and sign up there [CS1020 Lecture 0: Course Admin]

23 End of file


Download ppt "CS1020 Data Structures and Algorithms I Lecture Note #0 Course Admin (AY2014/5 Semester 2)"

Similar presentations


Ads by Google