Financial Computing I
Professor: John K. Ostlund
Course Number: 46901
Description: In Financial Computing I -- Data Structures and Algorithms, we investigate a number of data structures and algorithms important in all programming work: singly and doubly linked lists, stacks, queues, heaps/priority queues, binary search trees, self-balancing trees, hash tables, sorting algorithms, breadth-first and depth-first graph search, and others. Students will necessarily master the C++ mechanisms that support such programming: pointers, dynamic memory allocation, recursion, struct and simple class definitions, separation of headers and code files, and so forth. Examples and homework exercises will be drawn from finance-related sources.
Prerequisites: Some experience in programming in a procedural or object-oriented language, or the Programming