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 Parameters in Eclipse
- 0.6.1. Using Parameters in Eclipse
0.7. Installing the Web-CAT Submission Plug-in for Eclipse
- 0.7.1. Introduction
- 0.7.2. Installing the Plug-in
- 0.7.3. Installing student.jar
- 0.7.4. Installing formatting support
0.8. Common Debugging Methods
- 0.8.1. Common Debugging Methods
0.9. Debugging In Eclipse
- 0.9.1. Debugging In Eclipse
0.10. Reading Input (from Files or Otherwise)
- 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. Mutation Coverage In JUnit
- 0.15.1. Mutation Coverage In JUnit
0.16. Mutation Testing Examples
- 0.16.1. Types of Mutants
0.17. Mutation Coverage: FAQ
- 0.17.1. Frequently Asked Questions
0.18. Abstract Data Types
- 0.18.1. Abstract Data Types
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. Syntax of the Lambda Calculus
- 0.25.1. Lambda Calculus
- 0.25.2. Practice with Lambda Calculus Syntax
- 0.25.3. More Practice with Lambda Calculus Syntax
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 Notation
0.34. Logarithms
- 0.34.1. Logarithms
0.35. Summations
- 0.35.1. Summations
0.36. Recurrence Relations
- 0.36.1. Recurrence Relations
0.37. Mathematical Proof Techniques
- 0.37.1. Mathematical Proof Techniques
0.38. 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. The List ADT
- 0.57.1. The 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
- 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. Harder Code Completion Practice 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. 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. Summary Exercises
- 0.78.1. 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.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
- 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. 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
- 0.140.1. First Fit
0.141. Circular First Fit
- 0.141.1. Circular First Fit
0.142. Best Fit
- 0.142.1. Best Fit
0.143. Worst Fit
- 0.143.1. Worst Fit
0.144. Sequential Fit Peformance
- 0.144.1. Sequential Fit Peformance
0.145. 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.173. Introduction to Analyzing a Problem
- 0.173.1. Towers of Hanoi
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.185. Adversarial Lower Bounds Proofs
0.186. State Space Lower Bounds Proofs
0.187. Finding the \(i\) th Best Element
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
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.230. Unsolveable Problems
- 0.230.1. Unsolveable Problems
0.231. Turing Machines
- 0.231.1. Turing Machines
0.232. Derivations and Parse Trees
- 0.232.1. Parse Trees
  - 0.232.1.1. First Sample Grammar
- 0.232.2. Strings Generated by a Grammar
- 0.232.3. Characterizing a Language: Example 1
- 0.232.4. Characterizing a Language: Example 2
0.233. Ambiguous Grammars
- 0.233.1. Second Sample Grammar
- 0.233.2. Ambiguity in Grammars
- 0.233.3. Ambiguous Grammar - Part 1
- 0.233.4. Ambiguous Grammar - Part 2
- 0.233.5. Ambiguous Grammar - Part 3
- 0.233.6. Discovering Ambiguity
0.234. Enforcing Order of Operations
- 0.234.1. Evaluation of Expressions
  - 0.234.1.1. Third Sample Grammar
- 0.234.2. Expression Evaluation
- 0.234.3. Associativity
- 0.234.4. Precedence and Associativity
- 0.234.5. Characterizing a Language Given a BNF Grammar
- 0.234.6. Extended BNF
0.235. Parser Generators
- 0.235.1. Jison
- 0.235.2. More practice with Jison
0.236. Using Parser Generators to Interpret a Language
- 0.236.1. Annotating Jison Grammars
0.237. List Construction and Deconstruction
- 0.237.1. Constructing Lists with fp.cons
- 0.237.2. Deconstructing Lists with fp.hd and fp.tl
- 0.237.3. Practicing List Manipulations with the fp module
- 0.237.4. fp.isNull, fp.isEq, and fp.isZero
0.238. Developing Basic, Recursive List-processing Functions
- 0.238.1. Recursive List Processing Example: sum( list )
- 0.238.2. Recursive List Processing Example: isMember( num, list )
- 0.238.3. Recursive List Processing Example: subst( new, old, list )
0.239. Recurring On Lists That Aren’t Flat
- 0.239.1. Deep Recursion in FP
- 0.239.2. Deep Recursion on Binary Search Trees
- 0.239.3. Practice with Deep Recursion
- 0.239.4. More Practice with Deep Recursion
0.240. Using Helper Functions with Accumulators
- 0.240.1. Using Helpers to Write reverse and split Functions
- 0.240.2. Using the split Function to Develop a Sorting Function
- 0.240.3. Additional Practice with the Accumulator Pattern
0.241. Scope, Closures, Higher-order Functions, Static vs. Dynamic Binding
- 0.241.1. Scope, Closures, Higher-order Functions
- 0.241.2. Practice with Higher-order Functions and Anonymous Functions
- 0.241.3. More Practice with Higher-order Functions and Anonymous Functions
- 0.241.4. Practice with Static vs. Dynamic Binding Rules
0.242. Procedural Abstraction: Map, Curry, and Compose
- 0.242.1. The Mapping Pattern
- 0.242.2. Function Composition
- 0.242.3. Currying
- 0.242.4. More currying
0.243. Procedural Abstraction: The Filtering and Folding (or Reduce) Patterns
- 0.243.1. The Filtering Pattern
- 0.243.2. The Folding/Reduce Pattern
- 0.243.3. Practice with the Mapping and Reduce Patterns
- 0.243.4. More Practice with the Reduce Pattern
0.244. Combining Map and Reduce
- 0.244.1. The MapReduce Paradigm
0.245. Continuations and Continuation Passing
- 0.245.1. Tail recursive functions
- 0.245.2. Continuation-Passing Style
- 0.245.3. Continuation-Passing Style Practice Problem (Part 1)
- 0.245.4. Continuation-Passing Style Practice Problem (Part 2)
- 0.245.5. Continuation-Passing Style Practice Problem (Part 3)
- 0.245.6. More CPS Practice
0.25. Syntax of the Lambda Calculus
- 0.25.1. Lambda Calculus
- 0.25.2. Practice with Lambda Calculus Syntax
- 0.25.3. More Practice with Lambda Calculus Syntax
0.246. Semantics of the Lambda Calculus
- 0.246.1. Semantics of the Lambda Calculus
- 0.246.2. Practice with Lambda Calculus Semantics
0.247. Free and Bound Variables
- 0.247.1. Free and Bound Variables
- 0.247.2. Identifying Free Variables
- 0.247.3. Identifying Bound Variables
- 0.247.4. Formal Definition of Free Variables
0.248. Alpha-Conversion
- 0.248.1. Alpha-Conversion Rule
- 0.248.2. Practice with Alpha Conversion
0.249. The Substitution-Based Model of Evaluation
- 0.249.1. Substitution Algorithm
- 0.249.2. Identifying Substitution Subcases of Case 1
- 0.249.3. Identifying Substitution Subcases of Case 2
- 0.249.4. Identifying Substitution Case 3
- 0.249.5. Identifying Substitution Cases and Subcases
- 0.249.6. Performing the Substitution Algorithm
0.250. Beta-Reduction
- 0.250.1. Beta-Redexes
- 0.250.2. Identifying Beta-Redexes
- 0.250.3. Beta-Reduction is a Substitution
- 0.250.4. Some Beta-Reductions Require Alpha-Conversion
- 0.250.5. Performing Beta-Reductions
0.251. Reduction Strategies
- 0.251.1. Applicative Order
- 0.251.2. Normal Order
- 0.251.3. Beta-Reduction Order (1)
- 0.251.4. Beta-Reduction Order (2)
- 0.251.5. Applicative Order Proficiency Exercise
- 0.251.6. Normal Order Proficiency Exercise
0.252. Church Numerals and Booleans
- 0.252.1. Church Booleans
- 0.252.2. Encoding If-Then-Else
- 0.252.3. Encoding OR
- 0.252.4. Church Numerals
- 0.252.5. Church Numerals with Addition and Multiplication
0.253. Recursive Functions
- 0.253.1. Fixed-points of Functions
- 0.253.2. The Y Fixed-point Combinator
- 0.253.3. Using Y to Implement Factorial
- 0.253.4. Identifying Fixed Point Combinators
0.254. Defining SLang 1
- 0.254.1. Syntax of SLang 1
- 0.254.2. Concrete Syntax of SLang 1
- 0.254.3. More Practice with the Concrete Syntax of SLang 1
- 0.254.4. Abstract Syntax of SLang 1
- 0.254.5. Curry in SLang 1
- 0.254.6. Semantics of SLang 1
0.255. Environment-based Model of Evaluation
- 0.255.1. Environment Data Structure
- 0.255.2. Determining Values Bound to a Variable
- 0.255.3. Evaluation of Expression Within an Environment
- 0.255.4. Determining Denoted Values in SLang 1
0.256. Let Expressions
- 0.256.1. Let Blocks
- 0.256.2. Let Blocks As Syntactic Sugar
- 0.256.3. Nested Lets
- 0.256.4. Nested Lets with Closures
0.257. Defining SLang 2
- 0.257.1. SLang 2: An Imperative Language
- 0.257.2. Output of SLang 2 Program
0.258. Tying The Knot
- 0.258.1. Implementing Recursion Efficiently
- 0.258.2. Practice TTK
0.259. Parameter-Passing Mechanisms
- 0.259.1. Call By Value vs. Call By Reference
- 0.259.2. Copy-Restore
- 0.259.3. Macro Expansion
- 0.259.4. Call By Name
- 0.259.5. Comprehensive Review of the Five Methods Studied So Far
0.260. Lazy Lists
- 0.260.1. Infinite Sequences
- 0.260.2. Practice With Infinite Sequences
- 0.260.3. Practice With Infinite Sequences (2)
- 0.260.4. Practice With Infinite Sequences (3)
0.261. Types in Programming Languages
- 0.261.1. Motivating Examples
- 0.261.2. Type System: Definition
- 0.261.3. Type System: Static Versus Dynamic
- 0.261.4. Type System: Safe Versus Unsafe
- 0.261.5. Type System: Strong Versus Weak
- 0.261.6. Type System: Typed Variables or Values
- 0.261.7. Type System: Explicit Versus Implicit typing
- 0.261.8. The Many Uses of Type Systems
0.262. Type Inference
- 0.262.1. Type Environments
- 0.262.2. Typing Rules Expressed as Post Systems
- 0.262.3. Typing in a Scaled-down ML
- 0.262.4. Using Post System Rules to Describe Type Inferencing in ML
- 0.262.5. Parametric Polymorphism in ML
- 0.262.6. Type inferencing in ML
- 0.262.7. Type Inferencing Problem 1
- 0.262.8. Type Inferencing Problem 2
- 0.262.9. Type Inferencing Problem 3
- 0.262.10. Type Inferencing Problem 4
- 0.262.11. Type Inferencing Problem 5
- 0.262.12. Type Inferencing Problem 6
0.263. GLOSSARY
0.264. Formal Languages
- 0.264.1. Introduction
- 0.264.2. Prerequisites
- 0.264.3. What we will do
- 0.264.4. Process
0.265. Overview
- 0.265.1. Languages, Grammars, and Machines
- 0.265.2. Language Hierarchy
- 0.265.3. Power of Machines
- 0.265.4. Application: Compilers
  - 0.265.4.1. Stages of a Compiler
- 0.265.5. Some Mindbending Ideas
0.266. Major Concepts
- 0.266.1. Introduction
- 0.266.2. Languages
- 0.266.3. Grammars
- 0.266.4. Automata
0.267. Deterministic Finite Acceptors
- 0.267.1. DFA: Deterministic Finite Acceptor
0.268. Non-Deterministic Finite Automata
- 0.268.1. NFA: Non-Deterministic Finite Automata
- 0.268.2. NFA vs. DFA: Which is more powerful?
0.269. Minimizing the Number of States in a DFA
- 0.269.1. Minimizing the Number of States in a DFA
0.270. Regular Expressions
- 0.270.1. Regular Expressions
  - 0.270.1.1. Precedence Rules
  - 0.270.1.2. Examples of Regular Expressions
- 0.270.2. Regular Expressions vs. Regular Languages
- 0.270.3. Converting Regular Languages to Regular Expressions
0.271. Regular Grammars
- 0.271.1. Regular Grammars
0.272. Closure Properties of Regular Grammars
- 0.272.1. Closure Properties of Regular Grammars
0.273. Identifying Non-regular Languages
- 0.273.1. Identifying Non-regular Languages
0.274. Properties
- 0.274.1. Introduction
- 0.274.2. Properties and Proving: Problem 1
- 0.274.3. Properties and Proving - Problem 2
0.275. Context-Free Languages
- 0.275.1. Context-Free Languages
- 0.275.2. Ambiguity
- 0.275.3. Eliminating Grammar Ambiguity
- 0.275.4. Extended BNF
0.276. Transforming Grammars
- 0.276.1. Transforming Grammars
0.277. Pushdown Automata
- 0.277.1. Pushdown Automata
  - 0.277.1.1. Example of transitions
  - 0.277.1.2. Equivalence of Acceptance Definitions
0.278. PDAs and Context Free Languages
- 0.278.1. PDAs and Context Free Languages
0.279. Deterministic Pushdown Automata
- 0.279.1. Deterministic Pushdown Automata
- 0.279.2. Grammars for Deterministic Context-free Languages
0.280. Properties of Context-Free Languages
- 0.280.1. Properties of Context-Free Languages
  - 0.280.1.1. (Chap 8.2) Closure Properties of CFLs
0.281. Models of Computation
- 0.281.1. Models of Computation
0.231. Turing Machines
- 0.231.1. Turing Machines
0.282. Parsing Introduction
- 0.282.1. Introduction
0.283. LL Parsing
- 0.283.1. LL Parsing
0.284. LR Parsing
- 0.284.1. LR Parsing
0.285. CYK Parsing
- 0.285.1. CYK Parsing
  - 0.285.1.1. CYK Parsing Algorithm
  - 0.285.1.2. Algorithm
0.286. Structure of a Compiler
- 0.286.1. What is a compiler?
  - 0.286.1.1. Translator
- 0.286.2. Language Processing System
  - 0.286.2.1. Compiler
- 0.286.3. Overview of General Compiler
- 0.286.4. Phases of Compilation
0.287. Recursively Enumerable Languages
- 0.287.1. Recursively Enumerable Languages
  - 0.287.1.1. Enumeration procedure for recursive languages
  - 0.287.1.2. Enumeration procedure for recursively enumerable languages
0.288. Intro Exercises
- 0.288.1. Exercise 1
- 0.288.2. Exercise 2
- 0.288.3. Exercise 3
- 0.288.4. Exercise 4
- 0.288.5. Exercise 5
- 0.288.6. Exercise 6
- 0.288.7. Exercise 7
0.289. FA Exercises
- 0.289.1. Exercise 1
- 0.289.2. Exercise 2
- 0.289.3. Exercise 3
- 0.289.4. Exercise 4
0.290. Regular Language Exercises
- 0.290.1. Exercise 1
- 0.290.2. Exercise 2
- 0.290.3. Exercise 3
- 0.290.4. Exercise 4
- 0.290.5. Exercise 5
- 0.290.6. Exercise 6
0.291. Sheet 5
- 0.291.1. Exercise 1
- 0.291.2. Exercise 2
0.292. Sheet 6
- 0.292.1. Exercise 1
- 0.292.2. Exercise 2
- 0.292.3. Exercise 3
- 0.292.4. Exercise 4
0.293. Sheet 7
- 0.293.1. Exercise 1
- 0.293.2. Exercise 2
- 0.293.3. Exercise 3
- 0.293.4. Exercise 4
0.294. Intro Exercise Practice
- 0.294.1. Exercise 1
- 0.294.2. Exercise 2
- 0.294.3. Exercise 3
- 0.294.4. Exercise 4
- 0.294.5. Exercise 5
- 0.294.6. Exercise 6
- 0.294.7. Exercise 7
0.295. FA Exercise Practice
- 0.295.1. Exercise 1
- 0.295.2. Exercise 2
- 0.295.3. Exercise 3
- 0.295.4. Exercise 4
- 0.295.5. NFA to DFA 1
- 0.295.6. NFA to DFA 2
- 0.295.7. Create NFA
0.296. Regular Language Exercise Practice
- 0.296.1. Exercise 1
- 0.296.2. Exercise 2
- 0.296.3. Exercise 3
- 0.296.4. Exercise 2
- 0.296.5. Exercise 3
- 0.296.6. Exercise 4
0.297. Sheet 5 Practice
- 0.297.1. Exercise 1
- 0.297.2. Exercise 2
0.298. List Iteration
- 0.298.1. List Iteration
0.299. List Iteration Visualizations
- 0.299.1. List Iteration Visualizations
0.300. Classwork 8
- 0.300.1. List Exercise 1
0.301. Homework 8
- 0.301.1. List Exercise 2
0.302. Understanding this Course
- 0.302.1. Read the Course Syllabus
- 0.302.2. Who Is This Class For?
- 0.302.3. Students of Many Experience Levels
- 0.302.4. Online and Face-to-face Sections
- 0.302.5. Weekly Schedule
- 0.302.6. Reading Activities
- 0.302.7. Labs
- 0.302.8. Programming Assignments
- 0.302.9. Programming Language and Environment
- 0.302.10. Cheating and The Honor Code
- 0.302.11. Self-Check: Confirm Your Understanding
0.303. Getting Started
- 0.303.1. Installing BlueJ
- 0.303.2. Introducing LightBot
- 0.303.3. From LightBot to Micro Worlds
- 0.303.4. Self Check: Micro-Worlds
- 0.303.5. A Bit More LightBot
- 0.303.6. Textually Representing Programs
- 0.303.7. Self-Check: Turning Micro-Worlds into Code
- 0.303.8. What Does LightBot Say About Programming?
- 0.303.9. A Programmable LightBot in Java
- 0.303.10. Syntax Practice 1a
- 0.303.11. Creating New Objects
- 0.303.12. Calling Methods on an Object
- 0.303.13. Putting it All Together
- 0.303.14. A Word on Making Code Easy to Read
- 0.303.15. Syntax Practice 1b
- 0.303.16. Programming Practice 1
- 0.303.17. Check Your Understanding
0.304. Inheritance and Polymorphism: Subclasses and Methods
- 0.304.1. The Jeroos of Santong Island
- 0.304.2. Your Opinions on Course Grading Policies
- 0.304.3. Class Hierarchy and Inheritance
- 0.304.4. Summarizing: What is Inheritance?
- 0.304.5. Syntax Practice 2a: Jeroo Methods
- 0.304.6. Problem Solving and Algorithms
- 0.304.7. Creating and Using Jeroo Methods
- 0.304.8. What is Polymorphism?
- 0.304.9. Syntax Practice 2b: Subclass Constructors
- 0.304.10. Syntax Practice 2c: More Subclass Constructors
- 0.304.11. Programming Practice 2
- 0.304.12. Check Your Understanding
0.305. Conditional and Repeating Actions
- 0.305.1. Selection
- 0.305.2. Conditions Using Sensor Methods
- 0.305.3. An Overview of Conditional Statements
- 0.305.4. Java’s Syntax for the If-Then-Else Structure
  - 0.305.4.1. Example (if-then-else structure)
  - 0.305.4.2. Self-Check
- 0.305.5. Syntax Practice 3a: If-Then-Else
- 0.305.6. Creating Optional Statements With If-then
- 0.305.7. Java’s Syntax for the If-then Structure
  - 0.305.7.1. Example (if-then structure)
  - 0.305.7.2. Self-Check
- 0.305.8. Syntax Practice 3b: If-Then
- 0.305.9. Java’s Syntax for the Multi-way Selection Structure (a cascaded if)
  - 0.305.9.1. Example (multi-way selection structure)
  - 0.305.9.2. Self-Check
- 0.305.10. Syntax Practice 3c: Multi-way If
- 0.305.11. Compound Conditions
  - 0.305.11.1. Examples (compound conditions)
  - 0.305.11.2. Self-Check
- 0.305.12. Syntax Practice 3d: Compound Conditions
- 0.305.13. Repeating Actions
- 0.305.14. Generic Repetition Structures
- 0.305.15. Java’s Syntax for the While Loop
  - 0.305.15.1. Example (pretest while structure)
  - 0.305.15.2. Self-Check
- 0.305.16. Syntax Practice 3e: While Loops
- 0.305.17. Programming Practice 3
- 0.305.18. Check Your Understanding
0.306. Software Testing
- 0.306.1. What Is Software Testing?
- 0.306.2. Writing Your First Software Test
- 0.306.3. Check Your Understanding: Software Testing Concepts
- 0.306.4. More About Methods
- 0.306.5. Check Your Understanding: Method Signatures
  - 0.306.5.1. Passing Information using Parameters
  - 0.306.5.2. Using Multiple Parameters
- 0.306.6. Check Your Understanding: Methods with Parameters
- 0.306.7. Good Habits for Conditionals
- 0.306.8. A Different Type of Complex If-Statement
- 0.306.9. Short Circuit Evaluation
- 0.306.10. Check Your Understanding: Logical Equivalence
  - 0.306.10.1. Relational Operators with Primitive Data Types
- 0.306.11. Syntax Practice 4a: Compound Conditionals
- 0.306.12. Syntax Practice 4b: Conditionals and Relational Operators
- 0.306.13. Programming Practice 4
- 0.306.14. Module Review
0.307. Variables, Fields, and Parameters
- 0.307.1. Variables
- 0.307.2. Check Your Understanding: Variables
- 0.307.3. Fields Versus Local Variables
- 0.307.4. Changing Private Variables: Mutator Methods
  - 0.307.4.1. A Note on Scope
- 0.307.5. Check your Understanding: Scope
- 0.307.6. Accessor Methods
- 0.307.7. Check Your Understanding: Fields, Getters and Setters
- 0.307.8. Syntax Practice 5a: Fields and Accessors
- 0.307.9. The Return Keyword
- 0.307.10. Check your Understanding: Typed Methods and Return Statements
- 0.307.11. Syntax Practice 5b: Mutators and Return Statements
- 0.307.12. Using Fields in Testing
- 0.307.13. Programming Practice 5a
- 0.307.14. Programming Practice 5b
0.308. Pictures and For-each Loops
- 0.308.1. First, the Basics
- 0.308.2. For Each Loops
  - 0.308.2.1. The For-Each Loop Syntax
  - 0.308.2.2. Using Outside Variables in Loops
- 0.308.3. Check Your Understanding: For-Each Loops
  - 0.308.3.1. Methods on Pictures
- 0.308.4. Check Your Understanding
- 0.308.5. Syntax Practice 6a: Pixel Loops
- 0.308.6. Syntax Practice 6b: More For-Each Loops
- 0.308.7. Programming Practice 6a
- 0.308.8. Programming Practice 6b
0.309. Aggregation, Strings and More Loops
- 0.309.1. Object-Oriented Design: Aggregation, Composition, and Delegation
- 0.309.2. Strings and Characters
- 0.309.3. Check Your Understanding: Strings
- 0.309.4. Counter-controlled Loops
  - 0.309.4.1. Traversing Strings
- 0.309.5. Check Your Understanding: Counter Controlled Loops
- 0.309.6. Tips on Random Numbers
  - 0.309.6.1. Generating Random Numbers
  - 0.309.6.2. Testing Random Behaviors
- 0.309.7. Check Your Understanding: Random Numbers
- 0.309.8. Method Overriding
  - 0.309.8.1. Overriding the toString() Method
- 0.309.9. Check Your Understanding: Method Overriding
- 0.309.10. Syntax Practice 7a: For Loops and OO Design
- 0.309.11. Syntax Practice 7b: toString and Returning Values
- 0.309.12. Programming Practice 7a
- 0.309.13. Programming Practice 7b
0.310. Grouping Objects Using Lists and Nested For Loops
- 0.310.1. Collections of Objects
- 0.310.2. Interfaces
- 0.310.3. Check Your Understanding: Interfaces
- 0.310.4. Syntax Practice 8a: Strings
- 0.310.5. The List Interface
- 0.310.6. Generics
- 0.310.7. ArrayList
  - 0.310.7.1. Programming with ArrayLists
- 0.310.8. Check Your Understanding: ArrayLists
- 0.310.9. Syntax Practice 8b: Lists
- 0.310.10. Nested For Loops
- 0.310.11. Check Your Understanding: Nested For Loops
- 0.310.12. Syntax Practice 8c: Nested Loops
- 0.310.13. Check Your Understanding
- 0.310.14. Programming Practice 8a
- 0.310.15. Programming Practice 8b
0.311. Lists, Loop Idioms, Generics, and the Null Keyword
- 0.311.1. Modelling the Contents of a Library
- 0.311.2. Looping Idioms
- 0.311.3. Check Your Understanding: Loop Idioms
- 0.311.4. Syntax Practice 9a: Loop Idioms
- 0.311.5. Generics Revisited
- 0.311.6. Check Your Understanding: Generics
- 0.311.7. Syntax Practice 9b: Generics
- 0.311.8. The Null Keyword
- 0.311.9. Diagnosing a Null Pointer Exception
- 0.311.10. Check Your Understanding: Null
- 0.311.11. Using BlueJ’s Debugger
- 0.311.12. Using BlueJ’s Code Pad
- 0.311.13. Programming Practice 9a: Loop Idioms
- 0.311.14. Programming Practice 9b: Loops and Generics
0.312. Arrays
- 0.312.1. Creating An Array
- 0.312.2. Accessing Items in Arrays
- 0.312.3. Setting Items in an Array
- 0.312.4. Arrays Compared to Lists (or ArrayList)
- 0.312.5. Putting It All Together
- 0.312.6. Check Your Understanding: Arrays
- 0.312.7. Syntax Practice 10a
- 0.312.8. Iterating Over Arrays
  - 0.312.8.1. Counter-Controlled Loops Over Arrays
  - 0.312.8.2. For-Each Loops Over Arrays
- 0.312.9. Check Your Understanding: Iterating with Arrays
- 0.312.10. Syntax Practice 10b
- 0.312.11. Initializing Array Contents
- 0.312.12. Printing Arrays
- 0.312.13. Copying Array Variables
- 0.312.14. Naming Array Variables
- 0.312.15. Writing Test Assertions Involving Arrays
- 0.312.16. Applying Arrays in a Problem
- 0.312.17. Syntax Practice 10c
- 0.312.18. Check Your Understanding
- 0.312.19. Programming Practice 10a
- 0.312.20. Programming Practice 10b
0.313. Multi-dimensional Arrays
- 0.313.1. Dimensions in an Array
- 0.313.2. Check Your Understanding: 2D Arrays
- 0.313.3. Syntax Practice: 2D Array Basics
- 0.313.4. Iterating through a 2D Array
- 0.313.5. Check Your Understanding: Iterating with 2D Arrays
- 0.313.6. Syntax Practice: Looping Over 2D Arrays
- 0.313.7. Multi-Dimensional Arrays
  - 0.313.7.1. Initializing a Multi-Dimensional Array
  - 0.313.7.2. Jagged (or Ragged) Arrays
- 0.313.8. Syntax Practice: 3D Arrays
- 0.313.9. But Can You Have Multi-dimensional Lists?
- 0.313.10. Integer Division and Modulus
- 0.313.11. Check Your Understanding: Modulus
- 0.313.12. Syntax Practice: Modulus
- 0.313.13. Programming Practice: Multi-dimensional Arrays
- 0.313.14. Programming Practice: Mod
0.314. Variable Scoping, Input, and Output
- 0.314.1. Variable Scoping
- 0.314.2. Summarizing Scope Concepts
- 0.314.3. Check Your Understanding: Scope
- 0.314.4. Syntax Practice: Scoping
- 0.314.5. Java Input and Output
  - 0.314.5.1. Basic Input and Output Concepts
- 0.314.6. Output Using PrintWriters
- 0.314.7. Check Your Understanding: Output
- 0.314.8. Input Using Scanners
  - 0.314.8.1. Opening a Stream for Input
  - 0.314.8.2. Reading from an Input Stream
- 0.314.9. A Complete Input Example
- 0.314.10. Check Your Understanding: Input
- 0.314.11. A Complete Input/Output Example
- 0.314.12. Testing I/O-based Operations
- 0.314.13. Check Your Understanding: Testing
0.315. Maps and Sets
- 0.315.1. The Map and Set Interfaces
- 0.315.2. The Map Interface
  - 0.315.2.1. Classes that Implement Map
  - 0.315.2.2. Using a Map
- 0.315.3. Syntax Practice: Making Maps
- 0.315.4. Adding and Accessing Pairs in a Map
- 0.315.5. Syntax Practice: Adding to Maps
- 0.315.6. Checking for and Removing Pairs in a Map
- 0.315.7. A Visual Summary of Using Map and HashMap
- 0.315.8. Syntax Practice: Map Contains and Remove
- 0.315.9. Looping Over Map Contents
- 0.315.10. Check Your Understanding: Maps
- 0.315.11. The Set Interface
  - 0.315.11.1. Classes that Implement Set
  - 0.315.11.2. Using a Set
- 0.315.12. Syntax Practice: Making A Set
- 0.315.13. Adding Values to a Set
- 0.315.14. Syntax Practice: Adding to a Set
- 0.315.15. Checking Values in a Set
- 0.315.16. Syntax Practice: Set Contains
- 0.315.17. Removing Values from a Set
- 0.315.18. Syntax Practice: Set Remove
- 0.315.19. Looping Over Sets
- 0.315.20. Check Your Understanding: Sets
- 0.315.21. Programming Practice: Maps
0.316. Static, Main, and Exceptions
- 0.316.1. The Main Method
- 0.316.2. Check Your Understanding: Main Methods
- 0.316.3. The Static Keyword
  - 0.316.3.1. A Common Pitfall
- 0.316.4. Check Your Understanding: The Static Keyword
- 0.316.5. Your Opinions on Course Grading Policies
- 0.316.6. Errors
  - 0.316.6.1. Compile-Time errors
  - 0.316.6.2. Run-Time Errors
- 0.316.7. Throwing Exceptions
- 0.316.8. Check Your Understanding: Throwing Exceptions
- 0.316.9. Syntax Practice: Throwing Exceptions
- 0.316.10. Try/Catch Blocks
  - 0.316.10.1. Try/Catch/Finally Syntax
- 0.316.11. Check Your Understanding: Try/Catch Blocks
- 0.316.12. Syntax Practice: Try-Catch Blocks

TODO List

Index
Search Page

OpenDSA Stand-alone Modules

Table Of Contents

Search the book

Chapter 0 modules¶