Chapter 0 modules¶

0.1. Data Structures and Algorithms
- 0.1.1. Data Structures and Algorithms
- 0.1.2. Some Software Engineering Topics
0.2. Spotlight: Carl Friedrich Gauss
- 0.2.1. Spotlight: Carl Friedrich Gauss
0.3. Spotlight: Francis Bacon
- 0.3.1. Spotlight: Francis Bacon
0.4. Command Line Basics
- 0.4.1. What’s A CLI?
0.5. Parsing Command Line Parameters In Your Program
- 0.5.1. Parameters In Programming
0.6. Using Command Line Parameters in Eclipse
- 0.6.1. Using Command Line Parameters in Eclipse
0.7. Installing the Web-CAT Submission Plug-in for Eclipse
- 0.7.1. Introduction
- 0.7.2. Installing Java 11
- 0.7.3. Installing the Plug-in
  - 0.7.3.1. Installing the Plug-in
  - 0.7.3.2. Final Setup
- 0.7.4. Installing student.jar
- 0.7.5. Installing formatting support
  - 0.7.5.1. Eclipse Formatter
  - 0.7.5.2. Checkstyle Formatter
0.8. Common Debugging Methods
- 0.8.1. Common Debugging Methods
0.9. Debugging In Eclipse
- 0.9.1. Debugging In Eclipse
0.10. Using the Java Scanner Class
- 0.10.1. The Scanner Class
0.11. Random Access Files In Java
- 0.11.1. Understanding File I/O
  - 0.11.1.1. Using RandomAccessFile Class
0.12. JUnit Testing And You
- 0.12.1. Getting Started
0.13. Writing JUnit Tests
- 0.13.1. Writing JUnit Tests
0.14. Code Coverage In JUnit
- 0.14.1. Code Coverage In JUnit
  - 0.14.1.1. Using EclEmma
0.15. Using Mutation Coverage In Eclipse
- 0.15.1. Using Mutation Coverage In Eclipse
0.16. Mutation Testing Basics
- 0.16.1. Types of Mutants
0.17. Mutation Coverage Advanced Examples
- 0.17.1. Seeing the Effect: BST Range Query
- 0.17.2. Over-Constrained Code: Visiting Quadrants
- 0.17.3. Over-Constrained Code: Deleting from a BST Tree
- 0.17.4. Over-Constrained Code: BigNum Exponents
- 0.17.5. Bugs not caught by mutation testing: Hash Insert
0.18. Abstract Data Types
- 0.18.1. Abstract Data Types
- 0.18.2. Concept Map Exercise
- 0.18.3. Review Questions
0.19. Introduction to Object-Oriented Programming
- 0.19.1. Introduction to Object-Oriented Programming
0.20. The Unified Modeling Language
- 0.20.1. The Unified Modeling Language
  - 0.20.1.1. Static and Dynamic Diagrams
  - 0.20.1.2. Class Diagrams
0.21. Software Development Processes
- 0.21.1. Software Development Processes
0.22. Pointers Chapter Introduction
0.23. Basic References Part 1
- 0.23.1. Pointers and References
  - 0.23.1.1. What is a Pointer?
  - 0.23.1.2. What is a Reference?
- 0.23.2. Data Types in Java
- 0.23.3. Referencing and Dereferencing
- 0.23.4. changePointeeDataDirect
- 0.23.5. The Employee Class
- 0.23.6. Reference Assignments
- 0.23.7. circularList1
0.24. Basic References Part 2
- 0.24.1. Sharing
- 0.24.2. Shallow and Deep Copying
  - 0.24.2.1. What does it mean to copy?
- 0.24.3. Shallow and Deep Comparing
- 0.24.4. Bad References
  - 0.24.4.1. Why Are Bad Reference Bugs So Common?
0.25. Pointers Syntax
- 0.25.1. Syntax
- 0.25.2. changeHeadPointer1
  - 0.25.2.1. Reference Rules Summary
- 0.25.3. Java References vs Pointers
- 0.25.4. How Are References Implemented In The Machine?
0.26. Local Memory
- 0.26.1. Local Memory
0.27. Heap Memory
- 0.27.1. Heap Memory
0.28. Link Nodes
- 0.28.1. Link Nodes
0.29. Link Nodes Practice Exercises
- 0.29.1. createList
- 0.29.2. iterateOverList
- 0.29.3. changePointeeNext1
- 0.29.4. addNodeAtHead
0.30. Additional Practice Exercises
- 0.30.1. changeHeadPointer2
- 0.30.2. changeQPointer
- 0.30.3. changeRPointer
- 0.30.4. changePointeeDataInDirect
- 0.30.5. circularList2
- 0.30.6. circularList3
- 0.30.7. changePointeeNext2
- 0.30.8. findValueInList
- 0.30.9. addNodeAtTail
- 0.30.10. changeNodesOrder1
- 0.30.11. changeNodesOrder2
0.31. Chapter Introduction
0.32. Sets and Relations
- 0.32.1. Set Notation
  - 0.32.1.1. Relations
- 0.32.2. Equivalence Relations
- 0.32.3. Partial Orders
0.33. Miscellaneous Math Notation
0.34. Logarithms
- 0.34.1. Logarithms
0.35. Summations Introduction
- 0.35.1. Summations
0.36. An Introduction to Recurrence Relations
- 0.36.1. Recurrence Relations
0.37. Mathematical Proof Techniques
- 0.37.1. Mathematical Proof Techniques
0.38. Introduction to Estimation
0.39. Chapter Summary Questions
- 0.39.1. Chapter Summary Questions
0.40. Searching in an Array
- 0.40.1. Searching in an Array
  - 0.40.1.1. Sequential Search
  - 0.40.1.2. Binary Search
0.41. Chapter Introduction
0.42. Problems, Algorithms, and Programs
- 0.42.1. Problems, Algorithms, and Programs
0.43. Comparing Algorithms
- 0.43.1. Comparing Algorithms
- 0.43.2. Growth Rates Ordering Exercise
0.44. Best, Worst, and Average Cases
- 0.44.1. Best, Worst, and Average Cases
0.45. Faster Computer, or Faster Algorithm?
- 0.45.1. Faster Computer, or Faster Algorithm?
0.46. Asymptotic Analysis and Upper Bounds
- 0.46.1. Asymptotic Analysis and Upper Bounds
0.47. Lower Bounds and \(\Theta\) Notation
- 0.47.1. Lower Bounds and Theta Notation
0.48. Calculating Program Running Time
- 0.48.1. Calculating Program Running Time
- 0.48.2. Summary Exercise
0.49. Analyzing Problems
- 0.49.1. Analyzing Problems
0.50. Common Misunderstandings
- 0.50.1. Common Misunderstandings
0.51. Multiple Parameters
0.52. Space Bounds
0.53. Code Tuning and Empirical Analysis
- 0.53.1. Code Tuning and Empirical Analysis
  - 0.53.1.1. Empirical Analysis
0.54. Algorithm Analysis Summary Exercises
- 0.54.1. Summary Exercise: CS2
0.55. Algorithm Analysis Summary Exercises
- 0.55.1. Summary Exercise: CS3
0.56. Chapter Introduction: Lists
0.57. A List ADT
- 0.57.1. A List ADT
  - 0.57.1.1. Defining the ADT
- 0.57.2. List ADT Programming Exercise
0.58. Array-Based List Implementation
- 0.58.1. Array-Based List Implementation
  - 0.58.1.1. Insert
  - 0.58.1.2. Insert Practice Exericse
- 0.58.2. Append and Remove
  - 0.58.2.1. Remove Practice Exericise
- 0.58.3. Array-based List Practice Questions
0.59. Linked Lists
- 0.59.1. Linked Lists
- 0.59.2. Linked List Remove
0.60. Comparison of List Implementations
- 0.60.1. Space Comparison
- 0.60.2. Time Comparison
  - 0.60.2.1. Practice Questions
0.61. Doubly Linked Lists
- 0.61.1. Doubly Linked Lists
0.62. List Element Implementations
- 0.62.1. List Element Implementations
0.63. Stacks
- 0.63.1. Stack Terminology and Implementation
  - 0.63.1.1. Array-Based Stacks
- 0.63.2. Pop
0.64. Linked Stacks
- 0.64.1. Linked Stack Implementation
  - 0.64.1.1. Linked Stack Push
- 0.64.2. Linked Stack Pop
  - 0.64.2.1. Comparison of Array-Based and Linked Stacks
0.65. Freelists
- 0.65.1. Freelists
0.66. Implementing Recursion
0.67. Queues
- 0.67.1. Queue Terminology and Implementation
- 0.67.2. Array-based Dequeue Practice
0.68. Linked Queues
- 0.68.1. Linked Queues
- 0.68.2. Linked Dequeue
- 0.68.3. Comparison of Array-Based and Linked Queues
  - 0.68.3.1. Stack and Queue Summary Questions
0.69. Linear Structure Summary Exercises
- 0.69.1. Practice Questions
- 0.69.2. Chapter Review Questions
0.70. Introduction to Recursion
- 0.70.1. Introduction
0.71. Writing a recursive function
- 0.71.1. Writing a recursive function
0.72. Code Completion Practice Exercises
- 0.72.1. Introduction
- 0.72.2. Recursion Programming Exercise: Largest
- 0.72.3. Recursion Programming Exercise: Multiply
- 0.72.4. Recursion Programming Exercise: GCD
- 0.72.5. Recursion Programming Exercise: log
- 0.72.6. Recursion Programming Exercise: Cummulative Sum
- 0.72.7. Recursion Programming Exercise: Add odd values
- 0.72.8. Recursion Programming Exercise: Sum Of the Digits
- 0.72.9. Recursion Programming Exercise: Count Characters
0.73. Writing More Sophisticated Recursive Functions
0.74. Intermediate Recursion Code Completion Exercises
- 0.74.1. Recursion Programming Exercise: Minimum of array
- 0.74.2. Recursion Programming Exercise: Is Reverse
- 0.74.3. Recursion Programming Exercise: Decimal to Binary
0.75. Writing Practice Exercises
- 0.75.1. Recursion Programming Exercise: Cannonballs
- 0.75.2. Recursion Programming Exercise: Check Palindrome
- 0.75.3. Recursion Programming Exercise: Subset Sum
- 0.75.4. Recursion Programming Exercise: Pascal Triangle
0.76. Tracing Recursive Code
- 0.76.1. Tracing Recursive Code
  - 0.76.1.1. A Domino Analogy
  - 0.76.1.2. Towers of Hanoi
0.77. Recursion Code Tracing Practice Exercises
- 0.77.1. Forward Flow Tracing Exercises
- 0.77.2. Backward Flow Tracing Exercises
- 0.77.3. Find Error Tracing Exercises
- 0.77.4. Two Recursive Calls Tracing Exercises
- 0.77.5. How Many Times Tracing Exercises
- 0.77.6. Harder Tracing Exercises
0.78. Recursion Summary Questions
- 0.78.1. Recursion Summary Questions
0.79. Design Patterns
- 0.79.1. Design Patterns
0.80. Alternative List ADT Designs
0.81. Comparing Records
- 0.81.1. Comparing Records
0.82. The Dictionary ADT
- 0.82.1. The Dictionary ADT
0.83. Binary Trees Chapter Introduction
0.84. Binary Trees
- 0.84.1. Definitions and Properties
- 0.84.2. Practice Questions
0.85. Binary Tree as a Recursive Data Structure
- 0.85.1. Binary Tree as a Recursive Data Structure
0.86. The Full Binary Tree Theorem
0.87. Binary Tree Traversals
- 0.87.1. Binary Tree Traversals
- 0.87.2. Postorder Traversal Practice
- 0.87.3. Inorder Traversal Practice
- 0.87.4. Summary Questions
0.88. Implementing Tree Traversals
- 0.88.1. Implementing Tree Traversals
  - 0.88.1.1. Base Case
  - 0.88.1.2. The Recursive Call
- 0.88.2. Binary Tree Increment By One Exercise
0.89. Information Flow in Recursive Functions
- 0.89.1. Information Flow in Recursive Functions
  - 0.89.1.1. Local
  - 0.89.1.2. Passing Down Information
- 0.89.2. Binary Tree Set Depth Exercise
- 0.89.3. Collect-and-return
- 0.89.4. Binary Tree Check Sum Exercise
- 0.89.5. Binary Tree Leaf Nodes Count Exercise
- 0.89.6. Binary Tree Sum Nodes Exercise
- 0.89.7. Combining Information Flows
- 0.89.8. Binary Tree Check Value Exercise
- 0.89.9. Combination Problems
- 0.89.10. Binary Tree Height Exercise
- 0.89.11. Binary Tree Get Difference Exercise
- 0.89.12. Binary Tree Has Path Sum Exercise
0.90. Binary Tree Node Implementations
- 0.90.1. Binary Tree Node Implementations
0.91. Composite-based Expression Tree
- 0.91.1. Composite-based Expression Tree
0.92. Binary Tree Space Requirements
- 0.92.1. Binary Tree Space Requirements
0.93. Binary Search Trees
- 0.93.1. Binary Search Tree Definition
  - 0.93.1.1. BST Search
- 0.93.2. BST Insert
- 0.93.3. BST Remove
- 0.93.4. BST Analysis
0.94. Dictionary Implementation Using a BST
0.95. Binary Tree Guided Information Flow
- 0.95.1. Binary Tree Guided Information Flow
- 0.95.2. Binary Search Tree Small Count Exercise
0.96. Multiple Binary Trees
- 0.96.1. Mirror Image Binary Trees Exercise
- 0.96.2. Same Binary Tree Exercise
- 0.96.3. Structurally Identical Binary Trees Exercise
0.97. A Hard Information Flow Problem
0.98. Array Implementation for Complete Binary Trees
- 0.98.1. Array Implementation for Complete Binary Trees
0.99. Heaps and Priority Queues
- 0.99.1. Heaps and Priority Queues
- 0.99.2. Building a Heap
- 0.99.3. Removing from the heap or updating an object’s priority
- 0.99.4. Priority Queues
0.100. Huffman Coding Trees
- 0.100.1. Huffman Coding Trees
0.101. Trees versus Tries
- 0.101.1. Trees versus Tries
0.102. Proof of Optimality for Huffman Coding
- 0.102.1. Proof of Optimality for Huffman Coding
0.103. Binary Tree Chapter Summary
- 0.103.1. Summary Questions
0.104. Chapter Introduction: Sorting
0.105. Sorting Terminology and Notation
- 0.105.1. Sorting Terminology and Notation
0.106. Insertion Sort
- 0.106.1. Insertion Sort
- 0.106.2. Insertion Sort Analysis
0.107. Bubble Sort
- 0.107.1. Bubble Sort
- 0.107.2. Bubble Sort Analysis
0.108. Selection Sort
- 0.108.1. Selection Sort
- 0.108.2. Selection Sort Analysis
- 0.108.3. Pointer Swapping
0.109. The Cost of Exchange Sorting
- 0.109.1. The Cost of Exchange Sorting
- 0.109.2. Analysis
0.110. Optimizing Sort Algorithms with Code Tuning
- 0.110.1. Code Tuning for Simple Sorting Algorithms
0.111. Shellsort
- 0.111.1. Shellsort
- 0.111.2. Putting It Together
- 0.111.3. Shellsort Practice Exercise
- 0.111.4. Optimizing Shellsort
- 0.111.5. Shellsort Summary Questions
0.112. Mergesort Concepts
- 0.112.1. Mergesort Concepts
- 0.112.2. Mergesort Practice Exercise
0.113. Implementing Mergesort
- 0.113.1. Implementing Mergesort
0.114. Quicksort
- 0.114.1. Introduction
- 0.114.2. Partition
- 0.114.3. Putting It Together
- 0.114.4. Quicksort Analysis
0.115. Heapsort
- 0.115.1. Heapsort
- 0.115.2. Heapsort Proficiency Practice
- 0.115.3. Heapsort Analysis
0.116. Binsort
- 0.116.1. Binsort
0.117. Radix Sort
- 0.117.1. Radix Sort
- 0.117.2. Array-based Radix Sort
  - 0.117.2.1. Radix Sort Analysis
0.118. An Empirical Comparison of Sorting Algorithms
- 0.118.1. An Empirical Comparison of Sorting Algorithms
0.119. Lower Bounds for Sorting
- 0.119.1. Lower Bounds for Sorting
0.120. Sorting Summary Exercises
- 0.120.1. Sorting Summary Exercises
0.121. Chapter Introduction: File Processing
0.122. Primary versus Secondary Storage
0.123. Disk Drives
- 0.123.1. Disk Drives
0.124. Buffer Pools
- 0.124.1. Buffer Pools
0.125. The Programmer’s View of Files
0.126. External Sorting
- 0.126.1. External Sorting
- 0.126.2. Multiway Merging
  - 0.126.2.1. Empirical Results
  - 0.126.2.2. Summary
0.127. Introduction to Hashing
- 0.127.1. Introduction
0.128. Hash Function Principles
- 0.128.1. Hash Function Principles
0.129. Sample Hash Functions
- 0.129.1. Sample Hash Functions
- 0.129.2. A Simple Hash Function for Strings
- 0.129.3. String Folding
- 0.129.4. Hash Function Practice
- 0.129.5. Hash Function Review Questions
0.130. Open Hashing
- 0.130.1. Open Hashing
0.131. Bucket Hashing
- 0.131.1. Bucket Hashing
- 0.131.2. An Alternate Approach
0.132. Collision Resolution
- 0.132.1. Collision Resolution
  - 0.132.1.1. The Problem with Linear Probing
0.133. Improved Collision Resolution
- 0.133.1. Linear Probing by Steps
- 0.133.2. Pseudo-Random Probing
- 0.133.3. Quadratic Probing
- 0.133.4. Double Hashing
0.134. Analysis of Closed Hashing
- 0.134.1. Analysis of Closed Hashing
0.135. Hahing Deletion
- 0.135.1. Deletion
- 0.135.2. Hashing Deletion Summary Questions
0.136. Hashing Chapter Summary Exercises
- 0.136.1. Hashing Review
0.137. Chapter Introduction: Memory Management
0.138. Dynamic Storage Allocation
- 0.138.1. Dynamic Storage Allocation
0.139. Sequential-Fit Methods
- 0.139.1. Sequential-Fit Methods
0.140. First Fit Memory Allocation
- 0.140.1. First Fit
0.141. Circular First Fit
- 0.141.1. Circular First Fit
0.142. Best Fit Memory Manager
- 0.142.1. Best Fit
0.143. Worst Fit Memory Manager
- 0.143.1. Worst Fit
0.144. Sequential Fit Peformance
- 0.144.1. Sequential Fit Peformance
0.145. Buddy Method and Other Memory Allocation Methods
- 0.145.1. Other Memory Allocation Methods
  - 0.145.1.1. Buddy Methods
  - 0.145.1.2. Other Methods
0.146. Failure Policies and Garbage Collection
0.147. Indexing Chapter Introduction
0.148. Linear Indexing
- 0.148.1. Linear Indexing
0.149. ISAM
0.150. Tree-based Indexing
- 0.150.1. Tree-based Indexing
0.151. 2-3 Trees
- 0.151.1. 2-3 Trees
0.152. B-Trees
- 0.152.1. B-Trees
  - 0.152.1.1. B+ Trees
  - 0.152.1.2. B-Tree Analysis
0.153. Indexing Summary Exercises
- 0.153.1. Indexing Summary
0.154. General Trees
- 0.154.1. General Trees
0.155. Union/Find and the Parent Pointer Implementation
- 0.155.1. The Union/Find Problem
0.156. Sequential Tree Representations
- 0.156.1. Sequential Tree Representations
- 0.156.2. Alternative Sequential Representation
- 0.156.3. Bit Vector Representation
- 0.156.4. General Tree Sequential Representation
0.157. Graphs Chapter Introduction
- 0.157.1. Graph Terminology and Implementation
  - 0.157.1.1. Graph Representations
- 0.157.2. Graph Terminology Questions
0.158. Graph Implementations
0.159. Graph Traversals
- 0.159.1. Graph Traversals
  - 0.159.1.1. Depth-First Search
- 0.159.2. Breadth-First Search
0.160. Topological Sort
- 0.160.1. Topological Sort
  - 0.160.1.1. Depth-first solution
  - 0.160.1.2. Queue-based Solution
0.161. Shortest-Paths Problems
- 0.161.1. Shortest-Paths Problems
  - 0.161.1.1. Single-Source Shortest Paths
0.162. Minimal Cost Spanning Trees
- 0.162.1. Minimal Cost Spanning Trees
  - 0.162.1.1. Prim’s Algorithm
  - 0.162.1.2. Prim’s Algorithm Alternative Implementation
0.163. Kruskal’s Algorithm
- 0.163.1. Kruskal’s Algorithm
0.164. All-Pairs Shortest Paths
0.165. Spatial Data Structures
- 0.165.1. Spatial Data Structures
  - 0.165.1.1. Multdimensional Keys
0.166. The PR Quadtree
- 0.166.1. The PR Quadtree
0.167. KD Trees
- 0.167.1. KD Trees
0.168. The Bintree
- 0.168.1. The Bintree
  - 0.168.1.1. Implementation Concerns
0.169. Other Spatial Data Structures
0.170. Data and Algorithm Analysis
- 0.170.1. Introduction
0.171. An Introduction to Problem Solving
- 0.171.1. An Introduction to Problem Solving
0.172. Semester Overview
- 0.172.1. Semester Overview
  - 0.172.1.1. Modeling Algorithm Cost
  - 0.172.1.2. Big Issues
- 0.172.2. Acknowledgement
0.173. Introduction to Analyzing a Problem
- 0.173.1. Introduction
- 0.173.2. Towers of Hanoi
- 0.173.3. Acknowledgement
0.174. Bounds Review
- 0.174.1. Bounds Review
  - 0.174.1.1. Analyzing Problems
  - 0.174.1.2. Modeling the Inputs
0.175. Growth Rates Review
- 0.175.1. Growth Rates Review
  - 0.175.1.1. Asymptotic Notation
0.176. Summation Techniques
0.177. Solving Recurrence Relations
- 0.177.1. Solving Recurrence Relations
0.178. Chapter Introduction: Search
0.179. Analyzing Search in Unsorted Lists
- 0.179.1. Analyzing Search in Unsorted Lists
  - 0.179.1.1. Lower Bounds Proofs
0.180. Search in Sorted Arrays
- 0.180.1. Analysis
0.181. Self-Organizing Lists
- 0.181.1. Introduction
  - 0.181.1.1. Frequency Count
- 0.181.2. Move to Front
- 0.181.3. Transpose
  - 0.181.3.1. An Example
0.182. Bit Vectors for Representing Sets
0.183. Perfect Hashing
- 0.183.1. Perfect Hashing
0.184. Finding the Maximum Value
- 0.184.1. Finding the Maximum Value
- 0.184.2. Acknowledgement
0.185. Adversarial Lower Bounds Proofs
- 0.185.1. Acknowledgement
0.186. State Space Lower Bounds Proofs
- 0.186.1. Acknowledgement
0.187. Finding the \(i\) th Best Element
- 0.187.1. Acknowledgement
0.188. Optimal Sorting
0.189. Number Problems
- 0.189.1. Number Problems
0.190. The Transformation Concept
- 0.190.1. The Transformation Concept: Integer Multiplication
- 0.190.2. Polynomial Multiplication
0.191. The Fast Fourier Transform
- 0.191.1. The Fast Fourier Transform
0.192. Introduction to Probabilistic Algorithms
- 0.192.1. Probabilistic Algorithms
0.193. Finding Prime Numbers
0.194. Random Numbers
- 0.194.1. Random Numbers
0.195. Skip Lists
- 0.195.1. Skip Lists
0.196. Balanced Trees
0.197. The AVL Tree
0.198. The Splay Tree
0.199. The Red-Black Tree
- 0.199.1. Exercise 1
- 0.199.2. Exercise 2
0.200. The Sparse Matrix
0.201. Dynamic Programming
- 0.201.1. Dynamic Programming
- 0.201.2. Computing Fibonacci Numbers
- 0.201.3. The Knapsack Problem
- 0.201.4. Chained Matrix Multiplication
0.202. Amortized Analysis
0.203. 0/1 Knapsack Problem
- 0.203.1. 0/1 Knapsack Problem
  - 0.203.1.1. Exercise 1
- 0.203.2. Exercise 2
- 0.203.3. Exercise 3
- 0.203.4. Exercise 4
0.204. Edit Distance
- 0.204.1. Edit Distance
- 0.204.2. Exercise 1
- 0.204.3. Exercise 2
0.205. KMP String Search Algorithm
- 0.205.1. KMP String Search Algorithm
0.206. Boyer-Moore String Search Algorithm
- 0.206.1. Boyer-Moore String Search Algorithm
0.207. Rabin-Karp String Search Algorithm [Draft]
- 0.207.1. Rabin-Karp String Search Algorithm [Draft]
0.208. General Tree Implementations
- 0.208.1. General Tree Implementations
0.209. K-ary Tree Implementations
- 0.209.1. K-ary Tree Implementations
0.210. Limits to Computing
- 0.210.1. Limits to Computing
0.211. Reductions
- 0.211.1. Reductions
0.212. NP-Completeness
- 0.212.1. NP-Completeness
  - 0.212.1.1. Hard Problems
  - 0.212.1.2. The Theory of NP-Completeness
0.213. Circuit Satisfiability
- 0.213.1. Circuit Satisfiability
0.214. Formula Satisfiability
- 0.214.1. Formula Satisfiability
0.215. 3-CNF Satisfiability
- 0.215.1. 3-CNF Satisfiability (3-SAT)
0.216. The Clique Problem
- 0.216.1. The Clique Problem
0.217. The Independent Set Problem
- 0.217.1. Independent Set
0.218. The Vertex Cover Problem
- 0.218.1. Vertex Cover
0.219. The Hamiltonian Cycle Problem
- 0.219.1. Hamiltonian Cycle
0.220. The Traveling Salesman Problem
- 0.220.1. Traveling Salesman
0.221. NP-Completeness Proofs
- 0.221.1. NP-Completeness Proofs
0.222. Reduction of Circuit SAT to SAT
- 0.222.1. Reduction of Circuit SAT to SAT
0.223. Reduction of SAT to 3-SAT
- 0.223.1. Reduction of SAT to 3-SAT
0.224. Reduction of 3-SAT to Clique
- 0.224.1. Reduction of 3-SAT to Clique
0.225. Reduction of Clique to Independent Set
- 0.225.1. Clique to Independent Set
0.226. Reduction of Independent Set to Vertex Cover
- 0.226.1. Independent Set to Vertex Cover
0.227. Reduction of 3-SAT to Hamiltonian Cycle
- 0.227.1. 3-SAT to Hamiltonian Cycle
0.228. Reduction of Hamiltonian Cycle to Traveling Salesman
- 0.228.1. Hamiltonian Cycle to Traveling Salesman
0.229. Coping with NP-Complete Problems
- 0.229.1. Acknowledgement
0.230. Unsolvable Problems
- 0.230.1. Unsolvable Problems
0.231. Turing Machines
- 0.231.1. Turing Machines

TODO List

Index
Search Page

OpenDSA Stand-alone Modules

Table Of Contents

Chapter 0 modules¶