A more formalized view of data structures. Stacks, trees, tables, lists, multilinked structures, strings and files are considered. These are viewed in terms of their general usefulness in the construction of algorithms and in their efficient implementation. Both theoretical results and programming techniques will be stressed.

Project 1. Topological Sort: Implement Topological Sort and output all possible sort.

Project 2 Maximum Subsequence sum/product: Implement an efficient recursive program to solve the maximum subsequence product problem and execute it on some sample inputs. Your program should print both the inputs and outputs.

Project 3. Garwick: Garwick's Algorithm sacrifice a little computing time to save space in stack operation.

Project 4. Traversals of Binary Trees: Implement Robson stackless traversal algorithm. Write and test a program "create", Its input will be 0 for a null tree and 1 followed by the preorder sequence of subtree information. After the tree is created, do a preorder traversal of the tree with Robson Traversal Algorithm

Project 5. Generation of Binary Trees: Write a program to generate all the binary trees with n nodes so that their representations would appear in lexicographic order.