Introductory Data Structures>
**Major Requirement (for B.A. and B.S.)**
Most applications require you to store and organize its data somehow. The key to making the program east to write and efficient is finding effective ways to do that organization.
In this course, you will expand your knowledge past the world of arrays to such exciting data structures as lists, stacks, queues, hash tables, and trees. You will learn how to use Java's implementation of these structures and and to pick the most efficient structure and implementation for your application.
Offered each fall semester.
This course is taught by Dr. Dershem or Dr. McFall.
Comments from Previous Students:
- "Learning hash tables and vectors was very important (I found out later on, of course!) "
The most recent offering's web page can be found at: http://www.cs.hope.edu/csci231
An introduction to the fundamental data structures of Computer Science and their accompanying algorithms. Stacks, Queues, Binary Trees, and Priority Queues will be included. Classical sorting and searching algorithms will be learned and implemented.