Multi-linked lists, simulating recursion, queues, trees and graphs. Sorting and searching algorithms are also studied and analyzed. Some file structures such as B-trees and hash files are studied. As in CS 205, formal closed labs are used for experimentation, to present new algorithms and concepts, to analyze and compare algorithms, and to reinforce lecture material. Homework and labs also have students apply their knowledge to new problems and produce solutions.
Students work alone and within teams to develop, enhance, and analyze various algorithms.
Second semester., each year. This lecture and laboratory course provides an introduction to the internal operations of digitalcomputers. Weekly laboratories will extend concepts discussed in lectures. Working in teams, students will research a topic in computing and formally present their results. First semester, each year.