Students are introduced to new types of data structures such as trees (including binary and
multiway trees), heaps, stacks, and queues. Students also design new algorithms for each data
structure studied, create and perform simple operations on graph data structures, describe and
implement common algorithms for working with advanced data structures, and recognize which data
structure is the most appropriate for solving a particular problem.
Upon successful completion of this course, students will be able to:
- Work with procedural and object-oriented aspects of the Java language.
- Develop sound techniques on designing, developing, and documenting well-structured programs
using proper software engineering principles.
- Continue to apply problem solving skills and provide a foundation for advanced programming
courses using an OOP (object-oriented programming) methodology.
- Describe and implement common data structures––lists, stacks, queues, graphs, and trees––for
solving complex programming problems.
- Use mathematical techniques to analyse the efficiency of the various algorithms presented, as
well as the common operations on the data structures discussed.
The chapter titles in the textbook are a good indicator of the topics covered in this
- Module 1: Analysis of Algorithms(Chapter 11) & Searching and Sorting (Chapter 18)
- Module 2: Stacks (Chapters 12& 13) & Queues (Chapter 14)
- Module 3: Lists (Chapter 15) & Iterators (Chapter 16)
- Module 4: Trees (Chapter 19) & Binary Search Trees (Chapter 20)
- Module 5: Heaps and Priority Queues (Chapter 21), Graphs (Chapter 24) & Hashing (Appendix
Required text and materials
COMP 2231 is a companion course to COMP 1131 and 1231 and the textbook listed below is provided
to students in COMP 1131.
If you did not take COMP 1131 and do not already own the required materials, you will need to
purchase them on your own.
- Chase, J., Lewis, J., and DePasquale, P. (2020). Java foundations: Introduction to program
design & data structures. (5th ed.) Toronto, ON, Pearson: Addison-Wesley.
Textbook: ISBN: 978-0-13-520597-6
Java Development Environment: Since this is a programming course, you will also require
a development environment to compile and run your programs. Module 1 contains instructions for
installing either JCreator LE or Eclipse for the Windows environment, or BlueJ for the Apple Mac
environment. All of these are suitable for a learning programmer. The environment you may have
used for COMP 1131 and 1231 is sufficient for this course as well. .
Please be aware that due to COVID-19 safety guidelines all in-person exams have been suspended. As such, all final exams are currently being delivered through ProctorU, which has an approximate fee of $35 involved. There will be more information in your course shell, on how to apply, if your course has a final exam.
To successfully complete this course, students must achieve a passing grade of 50% or higher on
the overall course, and 50% or higher on the final mandatory examination.
|Assignment 1: Analysis of Algorithms
|Quiz 1: Analysis of Algorithms & Searching and Sorting
|Assignment 2 : Stacks and Queues
|Quiz 2: Stacks & Queues
|Assignment 3: Lists and Iterators
|Quiz 3: Lists and Iterators
|Assignment 4: Trees and Binary Search Trees
|Quiz 4: Trees & Binary Search Trees
|Assignment 5: Heaps, Priority Queues, Graphs and Hashing
|Quiz 5: Heaps and Priority Queues, Graphs, & Hashing
|Final Examination (mandatory)
Open Learning Faculty Member
An Open Learning Faculty Member is available to assist students. Primary communication is
through Learning Environment’s “Mail” tool or by phone. Students will receive the necessary
contact information at the start of the course.