CET 3350 - Applied Data Strucures

Last modified: 23 August 2010 by R.Levow: Original posting

Professor: Roy B. Levow

General class policies can be viewed here.

Textbook and Software:

  • ADTs, Data Structures, and Problem Solving with C++, 2ed., Nyhoff, Pearson, 2005, ISBN 9780131409095
    (List: $148.00, Amazon.com: from $99.76 + $3.99 S&H, CourseSmart.com 180 day rental $59.20)
  • MS Visual C++ (free through MSDAA)
  • Reference: Any C++ Text.


Prerequisites: COP 3014 or equivalent
Catalog Description: Study of the structure and application of standard data structures of computer science, including arrays, vectors, lists, stacks, queues, priority queues, binary trees, sets, multisets, and maps. Description of searching and sorting algorithms. Consideration of performance issues, with emphasis on selection of most appropriate program components. Implementation with STL. Open only to students in the B.I.E.T. program. Credit will not be given for both CET 3350 and COP 3530.

Prerequisites by Topic:

  • Basic object-oriented design principles including concepts of classes, objects, methods, and data members.
  • C++ programing including operators, control structures, functions, class declaration, object instantiation, constructors, destructors, and generics.

Course Objectives

Students will

  1. Understand the structure and application of data structures including arrays, vectors, lists, stacks, queues, priority queues, binary trees, sets, multisets, and maps.
  2. Students will be familiar with the properties of several sorting algorithms.
  3. Be able to use C++ Standard Template Library elements to implement programs using the above data structures.
  4. Understand and be able to apply basic principles of algorithm analysis for run time and space requirements.
  5. Be able to identify appropriate data structures to meet application requirements.

Syllabus

  1. Review of C++ prerequisites
  2. Arrays and vectors
  3. Basic issues in sort algorithms
  4. Lists, stacks, queues, and priority queues
  5. Binary trees
  6. Sets and multisets
  7. Maps

Grading

There will be three exams (20% each) and a number of assignments (to be posted in BlackBoard) (40%).

 
[Prof. Roy Levow] [COP 3813 - Intro to Internet Computing] [CET 3350 -  Applied Data Strucures] [ETI 4448 - Applied Project Management] [Previous Classes]