Topics Extends the programming skills of the Principles of - - PowerPoint PPT Presentation

SLIDE 1

COMPSCI 105S1

Principles of Computer Science 2013

Topics

COMPSCI105 2

 Extends the programming skills of the Principles of

Programming course

 Emphasising good software design through an appreciation of

data structures and code efficiency

 Contents:  Introduction to the multi-dimensional arrays, exception

handling and file input and output.

 The importance of abstraction and abstract data types, such

as stacks, queues, lists, trees, heaps and hash tables

 The performance characteristics of different

implementations of data structures, such as study of searching and sorting algorithm

Two Sections

COMPSCI105 3

 Section 1:  Arrays  Nested Statements  Objects & ArrayLists  Java Exception  Java Input & Output  Performance Analysis  Sorting (basic)  Recursion  Abstract Data Types  Lists / Linked Lists  Section 2:

 Stacks  Queues  Tree  Search Trees  Tables  Priority Queue  Hash Tables

Staff

COMPSCI105 4

 Lecturers

 Angela Chang (Course

Supervisor)

 angela@cs.auckland.ac.nz  Phone: 3737599 ext 86620  Room: 303S.585  Office hours:

 Tue, Thurs 11am-12noon  Or whenever the office door

is open  Dr Patrice Delmas

 p.delmas@auckland.ac.nz  Phone: 3737599 ext 83780  Room: 303S. 391

 Mon, Tues 1pm-2pm  Or whenever the office door

is open

 Tutors

 Roy Yang

 syan095@aucklanduni.ac.nz  Room: TBA  Office hours: TBA

 Muhammad Shaban

 mjok002@aucklanduni.ac.nz  Room: TBA  Office hours: TBA

SLIDE 2

Information

5  Cecil (https://www.cecil.auckland.ac.nz/)



To sit the Online multiple choice quizzes / programming quizzes



To check your marks



To download all lecture recordings



To download lecture notes, examples and exercises  Forum (http://forums.cs.auckland.ac.nz)



For Announcement and FAQ



Select COMPSCI105 C S1 2013

 CS course page (http://www.cs.auckland.ac.nz/compsci105s1c)



To get information about our course  Reference:



T extbook



Data Abstraction and Problem Solving with Java (3rd Edition) – Walls & Mirrors Frank M Carrano & Janet J Pritchard Addison Wesley,



Recommended Reading:



Java 2: The complete reference. (4th Edition) - Herbert Schildt, ISBN 0-07-213084-



Java API Specification (JavaTM 2 Platform Standard Edition 5.0) COMPSCI105

Assessments

 Note: Students must obtain a pass in both the practical

(assignments) and non-practical work (test + exam) in order to pass as a whole

 Practical: (25%)

 Assignments (10%)

 A1 (4%) : due on Monday, Apr 29, 11:30pm  A2 (6%) : due on Friday, Jun 7, 11:30pm (no lecture on 4th June 2013)

 MC/Programming Quizzes (1.5% each)

 MC Quizzes x 7  Programming Quizzes x 2

 Tutorial Attendance (1.5%)

 Theory: (75%)

 T

est: 10%,

 Monday, 6-May, 12:00noon-1:00pm

 Exam: 65%

 TBA  (I will do one extra exam preparation session after the end of lectures

if students are interested. It will be non compulsory and will not disclose any information on the exam content.)

COMPSCI105 6

Cecil Dropbox

 Instructions:

 Click on the Activities & Marks for the course.  Click on the activity that you want to submit the assignment for.  Click on the Browse... button under Submit a File to Dropbox

• area. A file browsing dialogue box pops up.

 Select the file you want to submit and click the Open button.  Click on Upload this file button to make the submission. The

screen will refresh to show the name of the file that you've submitted.

 Please check the submission page has shown the name of the

file that you've submitted.

 If you had already submitted a file and are allowed to re-

submit, any re-submission will overwrite the existing file.

COMPSCI230 7

Cecil Dropbox

 File Submitted!!!

COMPSCI230 8

SLIDE 3

Policy on Cheating and Plagiarism

 We uses many ways to check that the work students submit for marking

is their own and was not produced by, or copied from, someone else.

 A comparison program to automatically compare all submissions from

students.

 Note:

 All assignments deemed to be too similar are automatically allocated a zero

mark.

 All students who submitted these assignments are entered in the duplicate

assignment register (a list of students whose work is known to have been copied). This list is maintained over many years.

 Students who have been caught cheating will be notified by email.  Offenders may be referred to the University Disciplinary Committee

 Both the person who copied the work and the person whose work was

copied are allocated a zero mark.

 It is important that you do not lend your assignments to others. Never give

anyone a copy of your assignment. It is the responsibility of each student to ensure that others do not copy their work.

 Read: http://www.auckland.ac.nz/uoa/home/about/teaching-learning/honesty

9 COMPSCI230

Assessments (con’t)

 Missed work

 If you miss the deadline for an assignment and have a valid reason,

you should see the course coordinator

 If you miss the test/exam for any valid reason, or you sit the

test/exam but believe that your performance was impaired for some reason, then you may be able to apply for an aegrotat, compassionate or special pass consideration.

 Refer to the online information on Missed Exams, Aegrotats and

Compassionate Consideration: http://calendar.auckland.ac.nz/regulations/academic/examination.html

10 COMPSCI230

Cecil MC Quizzes

COMPSCI105 11

 Quizzes are run online through Cecil.  Each of the Cecil quizzes will be open from 9am on the quiz date

(Friday) to the midnight of the following Monday

 You MUST sit each quiz during the time period and you MAY use

any computer in any lab or at home as long as there is a network connection (no slower than 64K) to the Cecil website.

 Multiple-Choice Quizzes

 Each quiz has 15 randomly selected questions and contributes 1.5% to the

final.

 You have 30 minutes to complete each quiz, and may make up to THREE

attempts at each quiz, with your best mark being counted.

 Programming Quiz

 1 programming question  Submit the java file to the Cecil dropbox within TWO hours

Instructions (MC Quizzes)

COMPSCI105 12

 T

• login to Cecil 7.0 :

 Open http://cecil.auckland.ac.nz from Internet Explorer  Click on the LOGIN icon and enter in your NetID and

NetPassword.

 T

• start your Cecil Multiple-choice test:

 Click on the Current courses from the navigation pane on the left

• f the screen.

 Click on the course from the navigation pane.  Click on the Activities & Marks function for the course.

You will see the list of all the activity type for the course and the respective weightings.

 Double-click on the Assessment from the Activity Type.  Double-click on the current multiple-choice to open it.  Click on the Start Assessment button to start.

SLIDE 4

Instructions (Programming Quizzes)

 To start your Cecil Programming Quiz:

 Click on the Current courses, -> Activities & Marks  Double-click on the Assessments -> Quiz3Code  Click on the Start Assessment button to start.  Write your program …  Click on the Browse... button under Submit a File to

Dropbox area.

 Select the file you want to submit and click the Open

button.

 Click on Upload this file button to make the submission.

Note:



Any resubmission will overwrite the existing file.



Submit your file within the time limit

Course Info COMPSCI105 13

Tutorials

COMPSCI105 14

 Tutorial Attendance

 1.5% of the final mark for our course is for attending eight or more

• f our 11 tutorials.

 Starts in WEEK 1  Venue: G75/B75  Streams

 Monday 2:00pm-3:00pm, 303S-B75  Monday 5:00pm-6:00pm, 303S-B75  Friday 10:00am-11:00am, 303S-B75  Friday 11:00am-12:00noon, 303S-G75  Friday 5:00pm-6:00pm, 303S-G75

Calendar

Wk Monday Tuesday Wednesday Tut Assessments 1 4-Mar Nested Statements & Arrays Arrays (cont.) ArrayLists

1 Quiz 1 (MC)

2 11-Mar Exceptions 1 File IO 1 File IO 2

2 Quiz 2 (MC)

3 18-Mar Complexity Sorting Recursion 1

3 Quiz 3 (Code)

4 25-Mar Recursion 2 Recursion 3 ADT 1

4

4 Easter Holiday Easter Holiday 3-Apr ADT 2

4 Quiz 4 (MC)

5 8-Apr ADT 3 Linked Lists 1 Linked Lists 2

5 Quiz 5 (MC)

6 15-Apr ADT Stacks Stacks Arithmetic Stacks

6 Quiz 6 (Code)

Holiday 7 29-Apr No Lecture No Lecture No Lecture

7 A1 due 29-Apr (4%)

8 6-May T erm T est Queues Queues

8 T erm T est 6-May (10%)

9 13-May Queues Trees Trees

9 Quiz 7 (MC

10 20-May Trees Tables / PQ Tables PQ

10 Quiz 8 (MC)

11 27-May BST/Hashing 1 BST/Hashing 2 BST/Hashing 3

11 Quiz 9 (MC)

12 3-Jun Holiday No Lecture Revision

12 A2 due @ 7-Jun (6%)

Course Info 15

My personal take on Learning

• 1. Read the lecture notes after each lecture
• a. Make a summary of what has been seen for each lecture
• b. Redo examples already solved (during the lectures) or/and do the unsolved examples
• c. Do examples with no notes from the lectures
• 2. Read the materials provided online
• a. To learn more
• b. To complement lectures
• 3. If you have questions or do not understand something
• a. Do 1
• b. Do 2
• c. Attend the tutorials
• d. Check the forum
• e. Ask other 105 students
• f. Ask a tutor during tutorials ot office hours
• g. Email me (only if point a to f are completed and did not bring relevant information)
• 4. How to prepare for test/exams
• a. Do previous years’ test/exams
• b. Do exercises of the course/tutorials/exercise provided with lecture notes
• c. Do 1 and 2