Fall 2022 - CMPT 225 D200

Data Structures and Programming (3)

Class Number: 5488

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 7 – Dec 6, 2022: Tue, 2:30–4:20 p.m.
    Surrey

    Sep 7 – Dec 6, 2022: Fri, 2:30–3:20 p.m.
    Surrey

  • Exam Times + Location:

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

  • 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:

This course explores fundamental algorithms and data structures that can help in developing elegant and efficient solutions to complex problems. We will study their specification, analysis, implementation (in C++), experimental evaluation, and applications. Platform: Linux (Ubuntu) Language: C++

Topics

  • Object-oriented programming
  • Abstract data types (ADTs)
  • Data structures: lists, stacks, queues, trees, heaps, hash tables, disk-bound data
  • Algorithms: searching and sorting as well as time and space efficiency analysis of algorithms

Grading

NOTES:

Grades for this course may be based on: classroom participation and weekly exercises, programming assignments; lab activities and quizzes; in-class written midterm exam; written final exam. The exact details of the marking scheme will be discussed during the first week of the semester.

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

  • Data Abstractions & Problem Solving with C++, Walls and Mirrors, Frank M. Carrano and Timothy Henry, Pearson, 2012, 9780134463971, 7th or 6th edition (6th edition available online.)
  • Data Structures and Algorithms in C++, Michael T. Goodrich, Roberto Tamassia and David Mount, Wiley, 2011, 9780470383278, Available online.
  • Programming, Principles and Practice Using C++ (2nd ed), Bjarne Stroustrup, Addison Wesley, 2014, 9780321992789, Available online. Also, any good C++ reference is okay.

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