Text only version INDEX :: Information Science & Technology :: ITEC

 

 
College of Information Science & Technology

ITEC 360
DATA STRUCTURES AND ANALYSIS OF ALGORITHMS

  1. Catalog Entry

ITEC 360. Data Structures and Analysis of Algorithms
Three hours lecture (3).

Prerequisite: ITEC 122, ITEC 224, ITEC 320 and either MATH 251 or 255.

Includes data structures, concepts and algorithms used in the solutions of nonnumeric problems; applications to data management systems, file organization, information retrieval, list processing and programming languages. Students who have received credit for CPSC 360 may not receive credit for ITEC 360.

  1. Detailed Description of Content of Course

The purpose of this course is to introduce concepts and properties of data structures and algorithms and to study the role of algorithms in the problem solving process.

Topics covered:

1. Mathematical preliminaries for analyzing algorithms
2. Data structures and their algorithms

a. Elementary data structures

(1) Arrays
(2) Stacks, queues, and lists
(3) Trees
(4) Sets

b. Binary search trees
c. Balanced trees

3. Advanced algorithm design methods

a. Greedy method
b. Divide-and-conquer
c. Dynamic programming
d. Branch-and-bound

4. Sorting

a. Simple sorts - Bubble sort, selection sort, insertion sort
b. Quick sort
c. Merge sort
d. Heap sort
e. Lower bounds on sorting
f. Radix sort

5. Searching

a. Sequential search
b. Binary search
c. Binary search trees
d. Hashing

6. Graph Algorithms
7. NP-Completeness and approximation algorithms

Topics listed above are recommended by the ACM Curriculum Committee and covered in many texts.

  1. Detailed Description of Conduct of Course

Programming projects are assigned to give students experience in implementing existing algorithms using an object oriented approach. Students are also given several problems for which they are required to design and implement efficient algorithms.

  1. Goals and Objectives of the Course

To improve the students' skills in designing, selecting and evaluating data structures and their algorithms for given problems.

  1. Assessment Measures

Students will be evaluated based on several programming assignments, and at least two examinations.

  1. Other Course Information

None

  1. Review and Approval

DATE ACTION APPROVAL
September 2001 Updated John P. Helm, Chair