Spring 2016 - CMPT 225 D100

Data Structures and Programming (3)

Class Number: 8242

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 9:30–10:20 a.m.
    Burnaby

  • Exam Times + Location:

    Apr 19, 2016
    Tue, 8:30–11:30 a.m.
    Burnaby

  • Instructor:

    Geoffrey Tien
  • Prerequisites:

    (MACM 101 and either (CMPT 125 and 127) or CMPT 135) or (ENSC 251 and ENSC 252).

Description

CALENDAR DESCRIPTION:

Introduction to a variety of practical and important data structures and methods for implementation and for experimental and analytical evaluation. Topics include: stacks, queues and lists; search trees; hash tables and algorithms; efficient sorting; object-oriented programming; time and space efficiency analysis; and experimental evaluation. Quantitative.

COURSE DETAILS:

The goal of this course is to introduce many of the fundamental algorithms and data structures of Computer Science in the context of abstract data types (ADTs). We'll use C++ to implement them, and O-notation to study their performance.

Topics

  • Recursion
  • Abstract data types (ADTs)
  • Linked lists
  • Stacks and queues
  • O-notation for algorithm efficiency analysis
  • Sorting algorithms
  • Trees
  • Hashing
  • Optional (depending upon time): graphs, external sorting


Grading

NOTES:

Marks will be based on: 4 or 5 programming assignments; completion of lab activities; in-class written midterm exam; written final exam. The exact details of the marking scheme will be given in the first week of the course.

Students must attain an overall passing grade on the weighted average of exams in the course in order to obtain a clear pass (C- or better).

Materials

MATERIALS + SUPPLIES:

Reference Books

  • Programming, Principles and Practice Using C++ (2nd ed), Bjarne Stroustrup, Addison Wesley, 2014, 9780321992789, Any good C++ reference is okay.

REQUIRED READING:

Data Abstractions & Problem Solving with C++, Walls and Mirrors (6th edition), Frank M. Carrano and Timothy Henry, Pearson, 2012
ISBN: 9780132923729

Registrar Notes:

SFU’s Academic Integrity web site http://students.sfu.ca/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS