Advanced Data Structures
A successful student will be able to:
Describe and implement a variety of advanced data structures (hash tables, priority queues,
balanced search trees, graphs).
Analyze the space and time complexity of the algorithms studied in the course.
SLO 5, SLO 8
Identify different solutions for a
and disadvantages to
Demonstrate an understanding of e
xternal memory and external search and sorting
Demonstrate an understanding of simple Entity
Relationship models for databases.
Demonstrate an understanding of basic principles of software design and development and be
apply these principles in course programming projects.
Construct programs of significant length that require modularization in order to be
SLO 4, SLO 8, SLO 10, SLO 11
object oriented programming concepts
., classes, inheritance,
handling and JAVA
SL0 3, SLO 4, SLO 9
source code that is
easy to read, well organized, well commented.
SLO 10, SLO 11
Employ debugging techniques to assist
SLO 8, SLO 10, SLO 11