Data & Control Structures

Curriculum Guideline

Effective Date:
Return to Course
Print Guideline
Course
CSIS 2475
Discontinued
Yes
Course Code
CSIS 2475
Descriptive
Data & Control Structures
Department
Computing Studies & Information Systems
Faculty
Commerce & Business Administration
Credits
3.00
Start Date
End Term
202010
PLAR
Yes
Semester Length
15 Weeks X 4 Hours per Week = 60 Hours
Max Class Size
35
Contact Hours
Lecture: 2 Hours per week Seminar/Lab: 2 Hours per week Total: 4 Hours per week
Method(s) Of Instruction
Lecture
Lab
Seminar
Learning Activities

Lecture, seminar, laboratory assignments, reading, and research

Course Description
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
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.
Means of Assessment
Attendance and Participation      0% - 5%
Assignments (Minimum: 4)   40% - 50%
Tests (Minimum: 1)   15% - 50%
Final Examination 25% - 40%
Total         100%
Textbook Materials

Textbooks and Materials to be Purchased by Students

Malik, D.S. C++ Programming; Program Design including Data Structures. Latest edition. Course Technology.

Prerequisites

CSIS2375 or CISY1275 or CMPT1110

Note: MATH1130 is recommended as a prerequisite or corequisite