![]() The function of the programs are specified, but design details of possible solutions are not specified. ![]() Programming assignments involve design of the proper data-structure, design of the associated program, coding, and testing of open-ended problems requiring independent solution by the students. Fundamentals of Data Structures in C++, Second Edition, Silicon Press, 2006 ![]() Weiss, Data Structures and Algorithms in C++, 3rd edition,Addison Wesley, 2006 ![]() be able to (a) find appropriate abstractions to solve a complex problem, (b) choose appropriate data structures and algorithms, (c) analyze simple algorithms and discuss tradeoffs among data structures, (d) get it all working.learn to think clearly about and solve complex and poorly-defined programming tasks.If time permits, any of the following topics: tries, Huffman codes, branch-and-bound, digital search trees, Fibonacci heaps, network flow, and critical path analysis. Analysis of algorithms, including sorting, graph algorithms, topological sort, depth-first search, shortest path, minimum spanning tree. A systematic study of data structures, including stacks, queues, lists, skip lists, trees, binary search trees, AVL trees, splay trees, B-trees, priority queues, hash tables, and the union/find data structure.
0 Comments
Leave a Reply. |