CS G100 -- Data Structures -- Fall 2004
College of Computer & Information Science
Northeastern University -- Therapon Skotiniotis
Updated 2 September 2004
URL of this page:
Official course description
Rapidly introduces programming techniques, algorithms, data structures, abstraction and modularization using a high level language, such as Java. Studies data structures such as records, arrays, linked lists, stacks, queues, trees, heaps and graphs. Introduces iteration and recursion as techniques for problem solving. Examines algorithms for binary search, heap sort, quick sort, depth-first and breadth-first tree and graph traversal, shortest path and minimal spanning tree. Additional topics include: set operations and hashing.
News and Notes
September 8 2004: Professor Futrelle is the faculty advisor for the course and will present the first lecture on September 9th. The course content will be tailored to Bioinformatics MS students, who make up the majority of the enrolled students. It will not be as ambitious as the official description above would suggest.