Professional Documents
Culture Documents
Welcome
Ang Chuan Heng COM1 #03 14 6516 4188 angch@comp.nus.edu.sg
Lecture schedules
Outline
Module Overview
This module is on algorithms and data structures Topics covered: abstraction and encapsulation classic data structures (lists, stacks, queues) recursion basic algorithmic analysis various searching and sorting methods hashing
Objectives
learn about some data structures, the related algorithms and when to use them To learn about recursion To understand algorithmic complexity To be proficiency in the design and coding of programs
To
Resources: IVLE
Announcement:
Read daily Lesson plan: Important dates are noted. Forum: For discussion about the teaching material on: Lectures: lecture notes Tutorials: tutorial questions and solutions Labs: lab questions and solutions General forum: topics not grouped in the above forums (mid term, quiz, final exam, admin, ) Lab Workbin: One for each lab group for lab submission Tut Workbin: One for each tut group for tut submission
Reference Book
Data Abstraction & Problem Solving with C++: Walls and Mirrors International Edition, 6/e
Author
: Carrano Henry
Assessment
CA Labs
60%
10%
5%
Tutorial
10%
5%
Midterm Test (Closed book) 20% Final test (Closed book) 10% Gradebook will be used to release grades of your CA performance Final Exam (Closed book) 40%
10
Tutorial
Starting from week 3, weekly Students will be assessed based on the solution submitted, attendance and presentation. The questions of the next tutorial will be released after the current tutorial is over. The deadline will be the midnight before the next tut. Late submission will not be accepted. Solutions should be submitted into the respective tutorial folder of the workbin of the tutorial group. Students are to zip the solution files and name it Tut99g<TutGroupNo><MatricNo>.zip when Tut 99s solution is to be submitted. Tut99 is a folder in the workbin of each Tut group The best solution submitted will be published with due recognition.
11
Only those who have submitted will have a chance to present Members are encouraged to comment and record in the file the valid comments marked with the id of the commentator. Best solutions will be released with due recognition. Students will be given a piece of paper as the TWT report to mark their attendance and record their contribution (solutions presented, valid comments recorded, ).
12
Lab Exercises
Starting from week 3, weekly The question will be uploaded into the lab forum once the previous lab is over. The deadline will be the midnight before the next lab. Late submission will not be accepted. Exact output format is not expected Students are to zip the solution files, input test data files, output files, and the file testHarness.txt and name it Lab99g<LabGroupNo><MatricNo>.zip when lab99s solution is to be submitted. Lab99 is a folder in the workbin of each lab group The best solution submitted will be published with due recognition.
13
Lab Marking
Total mark given: 10 Does not meet program requirements -9 Marks given for Test Result: 5 Failed to compile: -5 Failed k test cases, k<5 -k Failed all test cases, or k>=5 -5 No test plan, test data files -2 Inadequate test plan -1 Marks given for program coding: 5 Each mistake made in presentation -1 Missing id line: -1 // matriculation-number (including the check character) name NUSNET-user-id Submit to wrong folder -1 Improper indentation -1 Insufficient comments -1 Modularity -1 Each deficiency /inefficiency: -1 Violating naming convention, Using redundant code/variables/data structures, Each deduction will be explained in a // comment by the marker
14
Students with codes submitted will be asked to present Members are encouraged to comment and record in the file the valid comments marked with the id of the commentator. Students will be given a piece of paper as their CWT report to mark their attendance and record their contributions (solutions presented, comments recorded).
15
Program Development
Assuming that a program for lab01 is to be developed. Suggest to create in your pc a folder named lab01, download into this folder the zip file of the first lab from the IVLE lab forum. Unzip the file and a folder named problem will be created in lab01. Create in lab01 3 more folders: solution, input, and output. Copy the skeleton program given in the folder skeleton found in the problem folder to the folder named solution and develop your solution there.
Test Harness
All the test data used should be organized in the folder named input, and the corresponding output should be organized in the folder named output. The input files should be named as in1.txt, in2.txt, and the output files as out1.txt, out2.txt, . Create the text file testHarness.txt in the input folder to describe what are the input files used for. For example, in1: Test for handling of an empty input file in2: Test for the boundary case You should test your program thoroughly by using sufficient set of test data.
Program Submission
To submit the program developed in lab01, zip the 3 folders: solution, input and output into a file named Lab01g<LabGroupNo><MatricNo>.zip and upload it into the folder Lab01 of the workbin of your lab group. This workbin is clearly labeled with your lab groups info and your TAs name. You can submit many times before the deadline but only the last one will be marked.
Midterm Test
Date and time: 5 OCT,10 am. Sat. week 7 Those who miss it with valid reasons will attend a makeup test on the following Sat, 10 am in the LT
Wider scope (include new topics just cover) Different format Different difficulty level.
19
Final Test
In week 13, after the last lecture, if there is time left. In LT MCQs If there is no final test, its weight will be assigned to the midterm test.
20