Simon Fraser University
Engaging the World

Course Outlines

Fall 2025 - CMPT 307 D100

Data Structures and Algorithms (3)

Class Number: 5483

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 3 – Dec 2, 2025: Mon, 12:30–2:20 p.m.
    Burnaby

    Sep 3 – Dec 2, 2025: Wed, 12:30–1:20 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 5, 2025
    Fri, 12:00–3:00 p.m.
    Burnaby

  • Prerequisites:

    CMPT 225, (MACM 201 or CMPT 210), (MATH 150 or MATH 151), and (MATH 232 or MATH 240), all with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 150 or MATH 151.

Description

CALENDAR DESCRIPTION:

Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms (greedy, divide & conquer, dynamic programming, network flows). Introduction to NP-completeness.

COURSE DETAILS:

The objective of this course is to introduce concepts and problem-solving techniques that are used in the design and analysis of efficient algorithms. This is done by studying various algorithms, algorithmic techniques, data structures, and application

Topics

  • Algorithms with Numbers: Asymptotics, Arithmetic, Cryptography, Hashing, Randomization
  • Divide-and-Conquer: Recurrences, Sorting, Selection, Lower bounds, Fast Fourier Transform
  • Graphs: Graph Searches and Applications, Trees, Shortest paths, Priority queues and heaps
  • Greedy Algorithms: Spanning trees, Disjoint sets, Amortized analysis, Huffman encoding
  • Dynamic Programming: Shortest paths, Longest subsequences, Edit distance, Sequence alignment
  • Introduction to NP-Completeness: Reductions, Approximation algorithms
  • Linear Programming

Grading

NOTES:

The course grade will be based on a midterm exam and final examination. There will be some graded assignments as well. The exact grade distribution will be announced during the first week of classes in a detailed course outline.

Students must pass the final exam in order to pass the course.

Materials

MATERIALS + SUPPLIES:

See Required and Recommended Reading Section

REQUIRED READING:

  • Algorithms
  • S. Dasgupta, C. Papadimitriou, U. Vazirani,
  • McGraw-Hill Higher Education,
  • 2008

An e-text version is available: ISBN 9780077244330
ISBN: 9780073523408

RECOMMENDED READING:

  • Algorithm Design, J. Kleinberg, E. Tardos, Addison Wesley, 2006, 9780321295354

  • Introduction to Algorithms (3rd Edition), T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2009, SFU Library access available

ISBN: 9780262033848

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.

Department Undergraduate Notes:

The following are default policies in the School of Computing Science. Please check your course syllabus whether the instructor has chosen a different policy for your class, otherwise the following policies apply.
 
  • Students must attain an overall passing grade on the weighted average of exams in the course in order to get a C- or higher.
  • All student requests for accommodations for their religious practices must be made in writing by the end of the first week of classes, or no later than one week after a student adds a course. After considering a request, an instructor may provide a concession or may decline to do so. Students requiring accommodations as a result of a disability can contact the Centre for Accessible Learning (caladmin@sfu.ca).

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.

To learn more about the academic disciplinary process and relevant academic supports, visit: 


RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.