Lists, stacks, queues, priority queues, trees, graphs, and their associated algorithms; file structures; sorting, searching, and hashing techniques; time and space complexity.

in each case with at least 65%, and 1.0 course with at least 60% in each from:

the former Applied Mathematics 1411A/B, the former Applied Mathematics 1412A/B, the former Applied Mathematics 1414A/B, the former Applied Mathematics 1413; or 2)

Survey of important computer algorithms and related data structures used in object-oriented software engineering. Design, performance analysis and implementation of such algorithms, stressing their practical use and performance certification of large software applications. Understand how to "seal" designs to guarantee performance goals and insure that all error conditions are caught.

The nature of Computer Science as a discipline; the design and analysis of algorithms and their implementation as modular, reliable, well-documented programs written in  a modern programming language. Intended for students with little or no background in programming.

Designing, implementing and testing computer programs using Java and MATLAB to fulfill given specifications for small problems using sound engineering principles and processes. Awareness of the engineering aspects of the process of constructing a computer program.

SE 2205A/B

ALGORITHMS & DATA STRUCTURE FOR OBJECT-ORIENTED DESIGN

Difficulty

Useful

Attendance

Written Reviews (0)

Prerequisites

Antirequisites

Extra Info

Locations