Douglas College wordmark
Facebook logo Twitter logo Instagram logo Snapchat logo YouTube logo Wordpress logo

Registration for the Fall 2019 semester begins June 25.  Watch your email for more details.

back to search

Data & Control Structures

Course Code: CSIS 2475
Faculty: Commerce & Business Administration
Credits: 3.0
Semester: 15 Weeks X 4 Hours per Week = 60 Hours
Learning Format: Lecture, Lab, Seminar
Typically Offered: TBD. Contact Department Chair for more info.
course overview

This course focuses on dynamically allocated structures such as lists, hash tables, stacks, queues, trees, and graphs. The time and space complexity of algorithms is considered throughout. Programs are written in C++.

Course Content

  1. Review classes, information hiding, composition, inheritance, polymorphism
  2. Analysis of algorithms (best case, worst case, average case)
    • Search algorithms – hashing, sequential and binary search
    • Sort algorithms – bubble, selection, linear insertion, binary insertion, mergesort, quicksort
  3. Dynamic data structures
    • Linear structures – lists, stacks, queues
    • Trees
      • Binary trees
        • Recursive algorithms for tree traversals
        • Iterative algorithms for searching a tree (depth-first using a stack, breadth-first using a queue, and heuristic using a priority queue)
        • Binary search treesExpression trees
        • Tree sort
    • Heaps
      • Heap sort
      • Priority queue
    • Tree
      • Huffman codes
    • Graphs

Methods of Instruction

Lecture, seminar, laboratory assignments, reading, and research

Means of Assessment

Attendance and Participation      0% - 5%
Assignments (Minimum: 4)   40% - 50%
Tests (Minimum: 1)   15% - 50%
Final Examination 25% - 40%
Total         100%

Learning Outcomes

The student will be able to:

  1. explain the concepts of dynamic versus static data structures;
  2. explain the concepts of asymptotic behaviour of algorithms.

The student should be able to:

  1. analyze the time and space complexity of iterative and recursive algorithms;
  2. choose the most appropriate abstract data structure and be able to implement it efficiently.

course prerequisites

CSIS2375 or CISY1275 or CMPT1110

Note: MATH1130 is recommended as a prerequisite or corequisite

curriculum guidelines

Course Guidelines for previous years are viewable by selecting the version desired. If you took this course and do not see a listing for the starting semester/year of the course, consider the previous version as the applicable version.

course schedule and availability
course transferability

Below shows how this course and its credits transfer within the BC transfer system. 

A course is considered university-transferable (UT) if it transfers to at least one of the five research universities in British Columbia: University of British Columbia; University of British Columbia-Okanagan; Simon Fraser University; University of Victoria; and the University of Northern British Columbia.

For more information on transfer visit the BC Transfer Guide and BCCAT websites.

assessments

If your course prerequisites indicate that you need an assessment, please see our Assessment page for more information.