Simon Fraser University
Engaging the World

Course Outlines

Fall 2022 - CMPT 225 D100

Data Structures and Programming (3)

Class Number: 5210

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 7 – Dec 6, 2022: Mon, Wed, Fri, 1:30–2:20 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 19, 2022
    Mon, 3:30–6:30 p.m.
    Burnaby

  • Prerequisites:

    (MACM 101 and (CMPT 125, CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252), all with a minimum grade of C-.

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:

We will explore methods of data and program organization that can help in developing elegant and efficient programmings. 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, search trees, hash tables.
  • Algorithms: searching and sorting; correctness and efficiency.
  • Programming: object-oriented programming for ADT re-use; efficient implementation.

Grading

NOTES:

Grading will be based on assignments, term tests, and a final exam. Details will be provided in the first week of classes. 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 & Algorithm Analysis in C++, 4th Edition
Mark A. Weiss
Pearson
2014
Also available in various forms online. The EPub (ISBN 9780133859638) and Kindle versions are cheaper than the hard cover.
ISBN: 9780132847377

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website http://www.sfu.ca/students/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