Review of Java including Classes, Interfaces, Inheritance, Exception handling and Text I/O
Introduction to Data Structures and Algorithm using Java
Algorithm Analysis
Recursion and efficiency
Search and Sorting Algorithms
Generics, Abstract Data Type and Java Collection Framework
List and Linked List
Stacks and Queues
Trees, Binary Tree, Binary Search Tree and AVL trees
Priority Queues and Heap
Hashing and Dictionary
Graph Algorithms
Algorithm Design Techniques
Lecture, seminars and hands-on exercises in the lab (Group work may be involved)
|
|
|
|
Quizzes/Tests |
0% – 15% |
|
Project/Assignments (Group work may be involved) |
15% – 25% |
|
Midterm Exam |
30% – 35% |
|
Final Exam* |
30% – 40% |
|
Total |
100% |
*will contain min 50% practical hands-on computer programming exam
In order to pass the course, students must, in addition to receiving an overall course grade of 50%, also achieve a grade of at least 50% on the combined weighted examination components (including quizzes, tests, and exams).
At the end of this course, the successful student will be able to:
Prichard and Carrano, Data Abstraction and Problem Solving with Java: Walls and Mirrors, Latest edition,
Or any alternative textbook approved by the Department.
| Institution | Transfer Details | Effective Dates |
|---|---|---|
| Kwantlen Polytechnic University (KPU) | KPU INFO 2315 (3) | 2019/05/01 to - |
| Simon Fraser University (SFU) | SFU CMPT 225 (3), Q | 2014/09/01 to - |
| Thompson Rivers University (TRU) | TRU COMP 2230 (3) | 2014/09/01 to - |
| University of Northern BC (UNBC) | UNBC CPSC 281 (3) | 2014/09/01 to - |
| University of the Fraser Valley (UFV) | UFV COMP 251 (4) | 2019/01/01 to - |