Analysis and design of computer algorithms and the underlying data structures using an object-oriented approach. Analysis of algorithm timing and efficiency. Study of lists, stacks, queues, trees, searching, sorting, and recursion. Introduction to Unified Modeling Language (UML), heaps, graphs, tables, hashing, and direct access files. Further study of abstract data types.

There are 2 sections of this class, online and M/W 10:10-12:00a

The online section of this class entirely online, but it is not self paced. The final is online.

• Wait-list - Students on the wait-list will be added to the class roster as space becomes available.

• Adds - A student may add the course up to one (1) week into the semester.

• No-Shows - Module material is available on Saturday and the course orientation quiz will be due the following Wednesday. Students who do not complete the quiz will be dropped.

• No-Continues - Students that do not submit any work for one complete module will be dropped after the module due date has passed, unless prior arrangements have been made with professor.

What are the real challenges encountered by both new and experienced online students, and how can you be successful? Tune into this short tutorial video to help debunk common myths about online learning.

What Makes a Successful Online Learner? Valuable tips for success and what to expect.