추가 적립 안내

1. OBJECT-ORIENTED PROGRAMMING USING JAVA. Rudimentary Java. Object-Oriented Programming in Java. Input and Output. Java and Pointers. Vectors in java.util. Data Structures and Object-Oriented Programming. Case Study: Random Access File. Exercises. Programming Assignments. 2. COMPLEXITY ANALYSIS. Computational and Asymptotic Complexity. Big-O Notation. Properties of Big-O Notation. w and q Notations. Possible Problems. Examples of Complexities. Finding Asymptotic Complexity: Examples. The Best, Average, and Worst Cases. Amortized Complexity. Exercises. 3. LINKED LISTS. Singly Linked Lists. Doubly Linked Lists. Circular Lists. Skip Lists. Self-Organizing Lists. Sparse Tables. Linked Lists in java.util. Concluding Remarks. Case Study: A Library. Exercises. Programming Assignments. 4. STACKS AND QUEUES. Stacks. Stacks in java.util. Queues. Priority Queues. Case Study: Exiting a Maze. Exercises. Programming Assignments. 5. RECURSION. Recursive Definitions. Method Calls and Recursion Implementation. Anatomy of a Recursive Call. Tail Recursion. Nontail Recursion. Indirect Recursion. Nested Recursion. Excessive Recursion. Backtracking. Concluding Remarks. Case Study: A Recursive Descent Interpreter. Exercises. Programming Assignments. BINARY TREES. Trees, Binary Trees, and Binary Search Trees. Implementing Binary Trees. Searching a Binary Search Tree. Tree Traversal. Insertion. Deletion. Balancing a Tree. Self-Adjusting Trees. Heaps. Polish Notation and Expression Trees. Case Studies: Computing Word Frequencies. Exercises. Programming Assignments. 6. MULTIWAY TREES. The Family of B-Trees. Tries. Concluding Remarks. Case Study: Spell Checker. Exercises. Programming Assignments. 7. GRAPHS. Graph Representation. Graph Traversals. Shortest Paths. Cycle Detection. Spanning Trees. Connectivity. Topological Sort. Matching. Euclidian and Hamiltonian Graphs. Case Study: Distinct Representatives. Exercises. Programming Assignments. 8. SORTING. Elementary Sorting Algorithms. Decision Trees. Efficient Sorting Algorithms. Sorting in java.util. Concluding Remarks. Case Study: Adding Polynomials. Exercises. Programming Assignments. 9. HASHING. Hash Functions. Collision Resolution. Deletion. Perfect Hash Functions. Hash Functions for Extendible Files. Hashing in java.util. Case Study: Hashing wit h Buckets. Exercises. Programming Assignments. 10. DATA COMPRESSION. Conditions for Data Compression. Huffman Coding. Shannon-Fano Code. Run-Length Encoding. Ziv-Lempel Code. Case Study: Huffman Method with Run-Length Encoding Exercises. Programming Assignments. 11. MEMORY MANAGEMENT. The Sequential-Fit Methods. The Nonsequential-Fit Methods. Garbage Collection. Concluding Remarks. Case Study: An In-Place Garbage Collector. Exercises. Programming Assignments. 12. PATTERN MATCHING ALGORITHMS. Exact String Matching. Straightforward Algorithms. The Knuth-Morrit-Pratt Algorithm. The Boyer-Moore Algorithm. Multiple Searches. Bit-Oriented Approach. Matching Sets of Words. Regular Expression Matching. Suffix Tries and Trees. Suffix Arrays. Approximate String Matching. String Similarity. String Matching with k Errors. Case Study: Longest Common Substring. Exercises. Programming Assignments. APPENDIX A: COMPUTING BIG-O. APPENDIX B: NP-COMPLETENESS.