CR: COMP 2402 Learning Objectives

From Soma-notes

Calendar Description

Assumed Background

Learning objectives completed before this course. COMP 1805 COMP 1405 & COMP 1406.

Learning Objectives

[Based on Pat Morin's offering of COMP 2402 in Fall 2010] This is an introductory course on data structures, using Java as an implementation language. The main topics covered in this course will be

  • The Java Collections Framework
  • Complexity analysis - Big Oh notation.
  • Basic data types: sets, lists, stacks, queues, deques
  • Array-based implementations of basic data types
  • Linked-list based implementations of basic data types
  • Ordered sets - balanced binary search trees, skiplists
  • Basic Lower Bounds: Searching and Sorting
  • Dictionaries - hash tables
  • Priority queues - heaps

Along the way, we will consider performance issues, both theoretical and practical. After taking this course, students should have a good understanding of how to implement a variety of data structures, and be in a position to choose the right data type and implementation for problems they encounter.

Topics

Topic 1

Learning objectives for topic 1

Topic 2

Learning objectives for topic 2

Retrieved from "https://homeostasis.scs.carleton.ca/wiki/index.php?title=CR:_COMP_2402_Learning_Objectives&oldid=8356"