Download PDF:
ITEC240_241_242.pdf
Credit Hours: 3
Instructors:
Location:
Semester: Fall 2002
Course Description:
ITEC 240 Data Structures: Linear Data Structures
After completing this course, students will understand how to use and implement the fundamental linear data structures: arrays, stacks, queues and linked lists. They will also be introduced to O-notation, abstract data types (ADTs) and simple sorting methods such as selection sort and insertion sort.
ITEC 241 Tables, Trees and Recursion
After completing this course, students will understand recursion, advanced sorting, binary search trees, and hash tables. They will be able to implement basic operations on these containers, such as retrieving, inserting and deleting elements. Quicksort and Mergesort will be introduced, both as examples of recursion and efficient sorting techniques.
ITEC 242 Applied Algorithms and Data Structures
After completing this course, students will have experience applying their knowledge of data structures and algorithms to some important computational problems. Each unit discusses one particular problem where data structures and algorithms play a central role.
Course Objectives:
ITEC 240
- Implement basic linear data structures.
- Describe the concept of an ADT.
- Use O-notation to describe the running time of algorithms.
- Implement simple sorting algorithms, such as selection sort and insertion sort.
ITEC 241
- Implement recursive algorithms.
- Implement advanced sorting routines, such as quicksort and mergesort.
- Implement binary search trees, and describe their performance using O-notation.
- Implement hash tables, and describe their performance using O-notation.
ITEC 242
- Use algorithms and data structures to solve a variety of complex problems.
- Optimize a program for performance.
Delivery Method:
Presentational Cooperative (PC)
In this course delivery model students meet once per week to participate in cooperative learning activities facilitated by an instructor. Learning that would traditionally occur in a lecture is instead supported in a Web presentation that includes multimedia and interactive elements. The Presentational Cooperative Model reproduces most of the cost advantages of traditional lecture course while offering students more convenient access and more effective conditions for learning. Courses using this model will build the collaborative work skills that are a primary learning goal for SFU Students. Some courses, using this model, offer an optional Open Lab where students can receive additional learning support. Assessment may be based on individual and group assignments, quizzes, projects, and examinations.
Learning Activities + Evaluation:
*Please note these are the minimum expectations for each course on a weekly basis.
ALL:
Online/Text Reading: 2 hrs
Assignments: 2 hrs
F2F: 1 hr
Lab: 3 hrs
Methods of EvaluationITEC 240:
Assignments: 48%
Exam: 52%
ITEC 241:
Assignments and Peer Evaluation: 100%
OR
Peer Evaluation and Exam: 100%
ITEC 242:Quizzes: 40%
Assignment: 10%
Project: 50%
Texts, Resources + Materials:
Text: Data Structures and Algorithms in Java, Robert Lafore (includes CD-ROM with algorithm animation applets), 1st edition, Waite Group Press
Software: Code Warrior; Java 2 Platform
Platform Requirements: PC
Prerequisites:
ALL: TECH 161,162,163 OR TECH 164, 165, 166
ALL: TECH 157 and, TECH 151, 152, 153
ITEC 241: ITEC 240
ITEC 242: ITEC 240, 241
Last Updated: May 13, 2008
These course outlines are drafts and are subject to change.
