CSCI 161 (4) Computer Science II A continuation of CSCI 160. (4:0:1) Topics include dynamic data structures (linked lists and trees), abstract data types (stacks, queues, lists) and an introduction to numerical methods. Prerequisite: Min. "C-" in CSCI 160.

Course Motivation and Overview
This course picks up where CSCI 160 left off in the study of basic programming tools and techniques.

It is assumed the student has a basic mastery of the C++ programming language, and the course uses that as a starting point for a more serious study of approaches to solve practical programming problems.

The course will focus heavily on the concepts of abstract data types (ADTs) and basic object oriented (OO) programming, and the support for these techniques offered through C++ classes. In particular, we will consider the linked list and tree ADTs, and circumstances under which they are used.

The course heavily emphasizes the use of standards, solid design, programming, testing and debugging principles and this will be reflected in both the material and the grading of course assignments.

Contact information, materials

• Lecturer: Dave Wessels, 753-3245 ext 2436, David.Wessels@viu.ca
• Office hours (all in Bldg 315, Rm 222): Mon/Wed 1:00-2:00, Fri 10:30-11:30
  If you need to see me outside office hours please send me an email (David.Wessels@viu.ca) to arrange a suitable time.
  
• Textbook: there is no required text, but there are some decent open-source C++ Wikibooks available, e.g.: en.wikibooks.org/wiki/C++_Programming/TOC1 (basically starting where 160 left off in chapter 3)
• Web material: supplementary lecture notes, assignments, tutorials, sample programs, practice problems, etc, are accessible through http://csci.viu.ca/~wesselsd/courses/csci160/

Timetable and assessment

• Lectures: (held in Bldg 315, Rm 216)
  - Fri: 9:30-10:30
  - Mon/Wed: 11:30-1:00
• Tutorials: (held in Bldg 315, Rm 102)

   Section S13N01  Mon 10:30-11:30
   Section S13N02  Mon 4:00-5:00
   Section S13N03  Wed 10:30-11:30
   Section S13N04  Wed 4:30-5:30  

• Assessment:
  • 30% Lab exercises (6 assignments: worth 5% each)
  • 30% Two in-class midterms (tentatively planned for Feb. 13th and Mar. 20th)
  • 40% Final exam

Labs/Tutorials
You must be enrolled in and attend your section of the weekly labs for CSCI 161.

During these labs we will focus on the application of the concepts and techniques discussed in lectures.

There are six lab exercises, each with components to be submitted electronically (specific submission details are discussed in the labs themselves). Each exercise will be worked on during one or more of the weekly lab sessions.

Code and documentation quality
A significant practical component of this course is learning to adhere to good principles and practices in the development of software and its accompanying documentation.

As such, students will be expected to strictly adhere to the code and documentation standards that will be discussed for each assignment and lab exercise. Work that fails to follow the designated standards may not be accepted for grading, and/or may be significantly penalized.

Computer accounts
The computer science accounts you had for CSCI 160 will still be active, with the same user id and passwords.

Topics
This topics list is approximate, and will likely change as the semester progresses.

Weeks 1-2
• Course introduction, overview, and administrivia
• Review: pointers, structs, linked lists
• Basic file I/O, command line arguments
  Weeks 3-6
• Abstract data types (ADTs)
• Classes part I:
  - fields, methods, scope
  - constructors, destructors
  - dynamic allocation, new, delete
  - a linked list class
  - sorting linked lists (merge, mergesort)
• Classes part II:
  - inheritance, protected fields
  - derived stack and queue classes
• Midterm 1 (Feb. 13)
  Weeks 6-10
• Classes part III:
  - function/method overloading
  - default parameter values
  - dynamic binding
• Trees
  - basic structure and uses
  - parent, child, and root nodes
  - binary trees, binary search trees
  - insert, search, print, remove operations
  - recursive vs non-recursive algorithms
  - a binary search tree class
• Midterm 2 (Mar. 20)
  Weeks 11-13
• Sorting and recursion
  - binary searches, bubblesort, mergesort, quicksort
• Classes part IV:
  - operator overloading
  - data structures and the STL
  - templated classes
• Techniques and methods:
  - successive approximation
  - numeric methods (gcd, factoring, primality testing)
  - testing and debugging techniques
• Exception handling
  - try, throw, catch
  - exception class heirarchies
• Course review/wrap up

Appeals of Grades: Any exercise or examination grade may be appealed. However, the appeal must be made to the instructor, in writing and attached to the work in question, and within 7 days of the grade being made available to the class. The instructor reserves the right to re-grade the entire piece of work submitted on appeal, not necessarily just the component that the student believes is in error.

Grade Conversion: The following scale will be used but the instructor reserves the right to lower the numerical score required for a particular letter grade if that seems appropriate, but the same conversion will be applied to all persons in the class. Under no circumstances will the numerical score required for a particular letter grade be raised.

90-100	85-<90	80-<85	76-<80	72-<76	68-<72	64-<68	60-<64	55-<60	50-<55	<50
A+	A	A-	B+	B	B-	C+	C	C-	D	F

VIU Policies
The official policies of Vancouver Island University can be viewed at www.viu.ca/policies

Lab and Computer Usage Rules:
See http://www.viu.ca/computerscience/resources.asp#Lab_and_Computer_Usage_Rules

Guidelines Concerning Fraud
These guidelines concern the type of fraud where a student presents another's work as his or her own, or allows another to do so.

• As fraud invalidates the evaluation of a student's progress, it is the duty of instructors, teaching assistants, and laboratory assistants to take measures to prevent fraud and to be vigilant towards symptoms of fraud.
• Students are encouraged to study together. But, unless the contrary is indicated, submitted work is to be done by students individually. Students are to collaborate on submitted work only when this is explicitly permitted by the instructor. In such a case, the names of all students who have collaborated on a piece of submitted work should be indicated on all submitted material. The collaboration is to involve reasonable effort on the part of all students involved. In a situation where this is clearly not the case, appropriate action will be taken with regard to those students who have not fully contributed to the collaborative effort.
• As in all academic endeavour, due credit must be given to all reference material. Students should consult the course instructor if they are not certain which outside material is appropriate for use in a course.
• In cases where fraud is detected, credit is withheld from the work affected. The students involved are reported to the department chair who may take additional disciplinary action commensurate with the severity of the fraud and the past records of the students.