CLICK HERE TO GET A COPY OF PRACTICE EXAM 3

Course Description

Introduction to the design, analysis and implementation of data structures and sorting algorithms, using object-oriented programming techniques. Study of computational complexity and Big-O notation. Design and implementation of abstract data types and containers classes: Vector, Bag, List, Set, Sequence, Map, Stack, Queue, Priority Queue, Tree, and Graph. The list of concrete structures to be studied includes: dynamic arrays, linked lists, Bit vectors, binary trees, binary search trees, B-trees, heaps, hash tables, adjacency matrices and adjacency lists. Recursion, pointers, templates and inheritance will be used extensively. This course is often called Computer Science II (CS2) in many prominent U.S. universities.

Instructor

Section 156:

Dr. Manuel Rodriguez-Martinez

Office: T-212

          Phone: (787)-832-4040, x-3023

          E-mail: manuelr@acm.org

          Office hours: TBA, or by appointment.  

Teaching Assistant

            TBA

            Office: TBA

            E-mail: TBA

            Office hours: TBA

Lecture Time

Section 156: Tu -Th 4:30pm - 5:50pm, S-230

Laboratory Time

Section 166: W - 12:30pm - 3:20 pm, S-121

Section 167: F - 12:30pm - 3:20 pm, S-121

 

© 2002 University of Puerto Rico-Mayaguez. All rights reserved.