CMPS 347 - DATA STRUCTURES

Data Structures-  CMPS 347

Class Meeting: Friday 08:00 - 10:00

Catalog Description


Fundamental concepts of data structures. Performance measurement of algorithms. Specification, representation and implementation of linear and non-linear data structures: arrays, lists, stacks, queues, priority queues, trees, heaps, hash tables and graphs.

Text

Data Structures & Algorithms in Java, Robert Lafore ISBN: 1571690956, Sams,  1998, 617 pagesAndrew C. Staugaard, Prentice Hall; 3 edition (April 12, 2001)

Course Outcomes

    1. Students will be able to understand the performance measurement of algorithms.

    2. Student will be able to understand and implement list using arrays and linked.

    3. Student will be able to understand and implement stacks, queues, and priority base queues.

    4. Student will be able to understand and implement trees.

    5. Student will be able to apply mathematical foundations and data structures  algorithms in the modeling and design of computer-based systems.

    6. Student will be able to understand and implement various data structures algorithms in the construction of software system

Student Outcomes

    Outcome (c): An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs

    Outcome (j): An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.

    Outcome (k): An ability to apply design and development principles in the construction of software systems of varying complexity.

Download course syllabus as PDF