Simon Fraser University
Engaging the World

Course Outlines

Summer 2018 - CMPT 225 D100

Data Structures and Programming (3)

Class Number: 6161

Delivery Method: In Person

Overview

  • Course Times + Location:

    May 7 – Aug 3, 2018: Mon, Wed, Fri, 12:30–1:20 p.m.
    Burnaby

  • Exam Times + Location:

    Aug 8, 2018
    Wed, 8:30–11:30 a.m.
    Burnaby

  • Prerequisites:

    (MACM 101 and ((CMPT 125 and 127), CMPT 129 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:

This course will explore ideas of data and program organization that can help in developing elegant and efficient solutions to complex tasks. The primary topics are abstract data types (ADTs) to help manage the complexity of programs, and data structures to support efficient algorithms. We will study the specification, analysis, implementation (in C++), experimental evaluation, and application of fundamental ADTs and data structures. We will also study fundamental searching and sorting algorithms.

Topics

  • Abstract data types (abstraction, encapsulation, information hiding).
  • Data structures: arrays, lists, stacks, queues, trees, heaps, sets, hash tables, graphs.
  • Algorithms: searching and sorting; correctness and efficiency.
  • Programming: object-oriented programming for ADT re-use; efficient implementation.

Grading

NOTES:

Assignment and lab activities (20%); midterm tests (40%); final exam (40%). Details will be provided in a course outline distributed in the first week of classes, which may supersede this grading scheme. Students must attain an overall passing grade on the programming portions of assignments in order to obtain a clear pass (C- or better).

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

REQUIRED READING:

Data Structures & Algorithms in C++,
2nd Ed.,
Goodrich, Tamassia and Mount,
Wiley, 2011
ISBN: 9780470383278

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