Skip To Content
    Dashboard
    • Login
    • Dashboard
    • Courses
    • Calendar
    • 0
      Inbox
    • Help
    Close
    • My Dashboard
    • SP2019.E81.CSE.131.01
    • Pages
    SP2019
    • Home
    • Help/Office Hours
    • Policies
    • Assignments
    • Gradescope
    • Pages
    • Syllabus
    • Quizzes
    • Piazza
    • Course Evals
    Insert Content into the Page
    • Links
    • Images
    Link to other content in the course.     Click any page to insert a link to that page.
     
    Pages
    • 0.0. Course Introduction
    • 0.1. Module Introduction
    • 0.2. A Generation of Computation
    • 0.3. Thirty Years of Progress
    • 0.4. What is Computer Science?
    • 0.5. How to succeed in this course
    • 1.0. Overview
    • 1.10. Introduction
    • 1.20. The int data type
    • 1.30. Operations on the int data type
    • 1.38. Prompting the user for input values
    • 1.40. Intro: Making change
    • 1.40. Solution: Making change
    • 1.60. Building bigger expressions
    • 1.70. The double data type
    • 1.80. Mixed-type expressions
    • 1.85. The String data type
    • 1.88. The boolean data type
    • 1.99. Conclusion
    • 2.0. Overview
    • 2.10. Introduction
    • 2.20. Conditional Execution
    • 2.25. Intro: Prompting the user for input (review)
    • 2.25. Solution: Computing the max of two inputs
    • 2.30. Composition and Nesting
    • 2.40. More Examples
    • 2.42. Intro: A bad swap
    • 2.42. Solution: A bad swap
    • 2.44. Intro: Heads or tails?
    • 2.44. Solution: Heads or tails?
    • 2.45. Intro: Inches to feet
    • 2.45. Solution: Inches to feet
    • 2.46. Intro: Divide two numbers carefully
    • 2.46. Solution: Divide two numbers carefully
    • 2.47. Intro: A random die
    • 2.47. Solution: A random die
    • 2.50. Iteration
    • 2.52. Intro: Average of random values
    • 2.52. Solution: Average of random values
    • 2.54. Intro: Write some loops
    • 2.54. Solution: Write some loops
    • 2.60. The for Loop
    • 2.65. Intro: 100 runs of the 10 heads problem
    • 2.65. Solution: 100 runs of the 10 heads problem
    • 2.66. Intro: N runs of the 10 heads problem
    • 2.66. Solution: N runs of the 10 heads problem
    • 2.67. Intro: Average flips to get 10 heads
    • 2.67. Solution: Average flips to get 10 heads
    • 2.99. Conclusion
    • 3.0. Overview
    • 3.10. Introduction
    • 3.20. Examples of arrays
    • 3.30. Array syntax
    • 3.32. Intro: Make a copy of an array
    • 3.32. Solution: Array copy and pig latin
    • 3.40. A perfect shuffle (or is it?)
    • 3.60. Permuting an array
    • 3.65. Intro: Permuting an array
    • 3.65. Solution: Permute an array
    • 3.70. Two-dimensional arrays
    • 3.75. Intro: Multiplication table
    • 3.75. Solution: Multiplication table
    • 3.99. Conclusion
    • 4.0. Overview
    • 4.10. Introduction
    • 4.20. A brief history of I/O
    • 4.25. Using Sedgewick's text API
    • 4.30. Intro: Statistics for a list of numbers
    • 4.30. Solution: Statistics for a list of numbers
    • 4.35. Using Sedgewick's graphics API
    • 4.40. Intro: Example using graphics
    • 4.40. Solution: Example using graphics
    • 4.50. Intro: Mouse and keyboard
    • 4.50. Solution: Mouse and keyboard
    • 4.55. Achieving animation
    • 4.60. Intro: Example of animation
    • 4.60. Solution: Example of animation
    • 4.62. Introduction to sound and music
    • 4.65. Sound (part 1)
    • 4.70. Intro: Frequency of a pitch
    • 4.70. Solution: Frequency of a pitch
    • 4.72. Intro: Ratio of multiple pitches
    • 4.72. Solution: Ratio of multiple pitches
    • 4.75. Sound (part 2)
    • 4.99. Conclusion
    • 5.0. Overview
    • 5.10. Introduction
    • 5.20. Function abstractions
    • 5.25. Intro: Cooking abstractions
    • 5.25. Solution: Cooking abstractions
    • 5.30. Method syntax
    • 5.40. Encapsulation via scopes
    • 5.45. Intro: Exercises
    • 5.45. Solution: Exercises
    • 5.50. Execution of methods
    • 5.99. Conclusion
    • 6.0. Overview
    • 6.10. Introduction
    • 6.20. Explicit recursion
    • 6.25. Demo: demofactorial,Demonstration of the debugger using factorial
    • 6.25. Intro: Recursive Factorial and sum
    • 6.25. Solution: Recursive factorial and sum
    • 6.27. Solution: Recursive addition
    • 6.30. Finding recursive substucture
    • 6.32. Intro: Recursion and base cases
    • 6.32. Solution: Factorial without a base case
    • 6.50. Example: generating graph paper
    • 6.55. Intro: Graph paper
    • 6.55. Solution: Recursive addition
    • 6.60. Substitution model
    • 6.99. Conclusion
    • 7.0. Overview
    • 7.10. Introduction
    • 7.20. Overview of an object
    • 7.25. Intro: Anatomy of an object
    • 7.25. Solution: Anatomy of an object
    • 7.30. How to make and use objects
    • 7.50. How are objects stored?
    • 7.70. Object design
    • 7.99. Conclusion
    • 8.0. Overview
    • 8.10. Introduction
    • 8.20. Introduction to lists
    • 8.25. Intro: Examples of a list
    • 8.25. Solution: Examples of a list
    • 8.30. What can we do with a list?
    • 8.33. Intro: Using List
    • 8.33. Solution: Using List
    • 8.35. Intro: Investigate the Set ADT
    • 8.35. Solution: Investigate the Set ADT
    • 8.50. Object equality
    • 8.60. Object hashCode()
    • 8.73. Intro: List and Set of Point
    • 8.73. Solution: List and Set of Point
    • 8.75. Intro: Design StockHolding from a user story
    • 8.75. Solution: Design StockHolding from a user story
    • 8.80. Interfaces for behavior abstraction
    • 8.85. Intro: Application of the interface
    • 8.85. personalproperty,moreusage,Further use of the Valuable interface
    • 8.85. Solution: Application of the interface
    • 8.99. Conclusion
    • 9.10 Hash Table Video from Hacker Rank
    • 9.20 Hashtable Video from CS50
    • 9.30 java.util.Map<K,V> Video
    • 9.40 (Optional) java.util.Map<K,V> entrySet Video
    • E9.0. Overview
    • E9.10. Introduction
    • E9.20. List nodes
    • E9.22. Setup for Node or Node reference
    • E9.27. Solution for Node or Node reference
    • E9.30. ListNode gymnastics
    • E9.32. Setup for interactive quiz on lists
    • E9.40. ListNode methods (part 1)
    • E9.42. ListNode methods (part 2)
    • E9.50. Intro: Static and iterative size method
    • E9.50. Solution: Static and iterative size method
    • E9.52. Intro: Static and recursive size method
    • E9.52. Solution: Static and recursive size method
    • E9.54. Intro: Static and recursive sum method
    • E9.54. Solution: Static and recursive sum method
    • E9.60. Singly linked list implementation of List
    • E9.62. Implementing addFirst
    • E9.64. Implementing addLast
    • E9.66. Implementing remove
    • E9.99. Conclusion
    • Help & Office Hours
    • Module 1: Questions and Answers
    • Module 2: Questions and Answers
    • Module 3: Questions and Answers
    • Policies
    Assignments
    • Assignments
    • 0.1015. Lab 0
    • 0.1020. Quiz 0
    • 1.1001 Exercises 1
    • 1.1005. Synthesis & Questions 1
    • 1.1010. Studio 1
    • 1.1015. Lab 1
    • 1.1020. Quiz 1
    • 2.1001 Exercises 2
    • 2.1005. Synthesis & Questions 2
    • 2.1010. Studio 2
    • 2.1015. Lab 2
    • 2.1020. Quiz 2
    • 3.1001 Exercises 3
    • 3.1005. Synthesis & Questions 3
    • 3.1010. Studio 3
    • 3.1015. Lab 3
    • 3.1020. Quiz 3
    • 4.1001 Exercises 4
    • 4.1005. Synthesis & Questions 4
    • 4.1010. Studio 4
    • 4.1015. Lab 4
    • 4.1020. Quiz 4
    • 5.1001 Exercises 5
    • 5.1005. Synthesis & Questions 5
    • 5.1010. Studio 5
    • 5.1015. Lab 5
    • 5.1020. Quiz 5
    • 5X.0001.Prep For Studio
    • 5X.1010. Studio 5X
    • 6.1001 Exercises 6
    • 6.1005. Synthesis & Questions 6
    • 6.1010. Studio 6
    • 6.1015. Lab 6
    • 6.1020. Quiz 6
    • 6-1-4-5: How To Be Famous Extension 7.9
    • 7.1001 Exercises 7
    • 7.1005. Synthesis & Questions 7
    • 7.1010. Studio 7
    • 7.1015. Lab 7
    • 7.1020. Quiz 7
    • 8.1001 Exercises 8
    • 8.1005. Synthesis & Questions 8
    • 8.1010. Studio 8
    • 8.1015. Lab 8
    • 8.1020. Quiz 8
    • 9.1001 Exercises 9
    • 9.1005. Synthesis & Questions 9
    • 9.1010. Studio 9
    • 9.1015. Lab 9
    • 9.1020. Quiz 9
    • 9.50 java.util.Map Unboxing NullPointerException Video
    • Apartment Hunting Extension 7.12
    • Bank Interest Calculator Extension 2.5
    • Baseball Statistics Calculator Extension 1.6
    • Birthday Problem Extension 3.2
    • Blackjack! Extension 3.6
    • Build Your Own Calculator! Extension 5.3
    • Chase, The Mouse Extension 5.2
    • Chord Organ Extension 7.8
    • Conways Game of Afterlife: Automatic generation Extension 7.2
    • Conways Game of Life Extension 7.1
    • Course Evaluation
    • Create an Instrument Extension 4.1
    • Data Sorting and Analysis Extension 3.5
    • Divine Lines Extension 6.1
    • Draw a Sound Wave Extension 4.2
    • Emersyn the Emote Extension 4.12
    • Exam 1
    • Exam 2
    • Exam 3
    • Expected Value Extension 1.4
    • Extension Batch 1
    • Extension Batch 1 Quota
    • Extension Batch 1 Surplus
    • Extension Batch 2
    • Extension Batch 2 Quota
    • Extension Batch 2 Surplus
    • Extension Batch 3
    • Extension Batch 3 Quota
    • Extension Batch 3 Surplus
    • Fibonacci Recursively and Iteratively Extension 6.4
    • Final Average
    • Final Exam
    • Final Letter Grade
    • Flower Power Extension 6.3
    • Gambler's Ruin with CSV File Extension 4.10
    • Gaussian Elimination Extension 7.4
    • GC Content Extension 3.3
    • Home Owning Extension 1.5
    • Image Processor (continued) Extension 1.3
    • Image Processor Extension 1.2
    • Image Processor With Iteration Extension 2.1
    • Jackpot Extension 5.6
    • k Nearest Neighbors Extension 7.11
    • Lab 10
    • Late Coupons Used
    • Linear Regression Extension 7.10
    • Loop Invariants Extension 2.2
    • Loud or Graphics-ful Bouncing Balls Extension 4.3
    • Magic 8 Ball Extension 4.4
    • Mario Extension 2.6
    • Memory Matching Extension 5.8
    • Methodize It Extension 5.1
    • Midterm Average
    • Minesweeper Extension 3.7
    • More ListItem Methods: the List Goes On Extension 9.1
    • Net Present Value Extension 5.9
    • Objects to Support Music Extension 7.7
    • One-Rep Max Weight Calculator Extension 2.3
    • Pascal's Triangle Extension 3.1
    • Persian Recursian Extension 6.2
    • Project: Matrix Extension 7.3
    • Reading Frame of a Sequence Extension 3.4
    • Reversing Lists Extension 9.2
    • Rock-Paper-Scissors Extension 2.4
    • Roving Eyes Extension 4.5
    • Roving Eyes; Slow Motion Edition Extension 4.6
    • Sad Cycles Extension 8.1
    • Speed Limit Fine Calculator Extension 1.1
    • Stock Scraper Extension 4.9
    • String theory Extension 4.7
    • Subset Sum Extension 5.10
    • Tic-Tac-Toe Extension 5.5
    • Watermelon Puzzle Extension 5.4
    • Web Scraper Extension 4.8
    Quizzes
    • Quizzes
    • 6.85. Tracing three recursive methods: response for part 2
    • 3.80. The birthday problem: response for part 5
    • 2.1020. Quiz 2
    • 2.23. Translating that flow diagram into code: response for part 8
    • E9.25. Node or Node reference?: response for part 2
    • 7.60. Object placement in memory: response for part 4
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 9
    • 6.1005. Synthesis & Questions 6
    • 3.80. The birthday problem: response for part 3
    • 6.40. Finding substructure: response for part 2
    • 3.80. The birthday problem: response for part 6
    • E9.70. The SinglyLinkedList implementation: response for part 7
    • 7.90. Scope and instance variables: response for part 2
    • 7.60. Object placement in memory: response for part 3
    • 2.23. Translating that flow diagram into code: response for part 6
    • 7.40. Instantiating objects: response for part 2
    • 3.1020. Quiz 3
    • 7.80. Designing a hockey stick: response for part 3
    • 4.1005. Synthesis & Questions 4
    • 1.35. Translating a story about carrots: response for part 6
    • E9.25. Node or Node reference?: response for part 3
    • 6.70. Substitution practice using factorial: response for part 3
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 2
    • 7.82. Designing a weight-lifting exercise: response for part 1
    • E9.70. The SinglyLinkedList implementation: response for part 4
    • 7.40. Instantiating objects: response for part 4
    • 2.23. Translating that flow diagram into code: response for part 4
    • 2.23. Translating that flow diagram into code: response for part 12
    • E9.70. The SinglyLinkedList implementation: response for part 6
    • 3.80. The birthday problem: response for part 2
    • 8.1020. Quiz 8
    • E9.45. Defining a size(: response for part 4
    • 1.1020. Quiz 1
    • 6.1020. Quiz 6
    • 0.1020. Quiz 0
    • 6.40. Finding substructure: response for part 5
    • 1.75. Randomness: response for part 1
    • 6.40. Finding substructure: response for part 1
    • 6.70. Substitution practice using factorial: response for part 1
    • 2.23. Translating that flow diagram into code: response for part 5
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 4
    • 6.40. Finding substructure: response for part 6
    • 6.80. Tracing recursion: response for part 2
    • 8.70. Common mistake with .equals: response for part 2
    • 5.65. More tracing using the debugger: response for part 1
    • E9.70. The SinglyLinkedList implementation: response for part 8
    • 8.40. List or Set?: response for part 3
    • 1.35. Translating a story about carrots: response for part 2
    • 9.1020. Quiz 9
    • 1.35. Translating a story about carrots: response for part 5
    • 8.1005. Synthesis & Questions 8
    • 8.40. List or Set?: response for part 2
    • 7.60. Object placement in memory: response for part 5
    • 7.60. Object placement in memory: response for part 1
    • 1.75. Randomness: response for part 2
    • 2.56. How many flips to get 10 heads?: response for part 1
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 6
    • 6.85. Tracing three recursive methods: response for part 3
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 7
    • 1.50. Math on computers: response for part 2
    • 8.40. List or Set?: response for part 1
    • 3.1005. Synthesis & Questions 3
    • 3.80. The birthday problem: response for part 1
    • E9.70. The SinglyLinkedList implementation: response for part 9
    • 2.23. Translating that flow diagram into code: response for part 2
    • 5.60. Method execution using the debugger: response for part 3
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 5
    • E9.70. The SinglyLinkedList implementation: response for part 3
    • 5.1005. Synthesis & Questions 5
    • E9.35. Interactive quiz on lists: response for part 4
    • 2.56. How many flips to get 10 heads?: response for part 2
    • 2.23. Translating that flow diagram into code: response for part 11
    • 5.60. Method execution using the debugger: response for part 4
    • 2.1005. Synthesis & Questions 2
    • 6.40. Finding substructure: response for part 4
    • E9.45. Defining a size(: response for part 1
    • 1.35. Translating a story about carrots: response for part 1
    • 2.23. Translating that flow diagram into code: response for part 7
    • 6.70. Substitution practice using factorial: response for part 2
    • E9.70. The SinglyLinkedList implementation: response for part 2
    • 1.35. Translating a story about carrots: response for part 4
    • 2.23. Translating that flow diagram into code: response for part 1
    • 9.1005. Synthesis & Questions 9
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 1
    • E9.35. Interactive quiz on lists: response for part 2
    • E9.25. Node or Node reference?: response for part 4
    • 7.80. Designing a hockey stick: response for part 2
    • 6.85. Tracing three recursive methods: response for part 1
    • 7.40. Instantiating objects: response for part 3
    • E9.35. Interactive quiz on lists: response for part 1
    • 5.1020. Quiz 5
    • 3.80. The birthday problem: response for part 4
    • E9.45. Defining a size(: response for part 5
    • 7.40. Instantiating objects: response for part 1
    • 5.60. Method execution using the debugger: response for part 1
    • 7.90. Scope and instance variables: response for part 1
    • E9.35. Interactive quiz on lists: response for part 5
    • 4.1020. Quiz 4
    • E9.45. Defining a size(: response for part 2
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 8
    • 3.55. What does it mean to be random?: response for part 1
    • 7.60. Object placement in memory: response for part 2
    • 7.1020. Quiz 7
    • 2.23. Translating that flow diagram into code: response for part 10
    • 5.60. Method execution using the debugger: response for part 2
    • 1.50. Math on computers: response for part 4
    • 6.80. Tracing recursion: response for part 1
    • 6.40. Finding substructure: response for part 3
    • E9.35. Interactive quiz on lists: response for part 3
    • 3.50. Perfect shuffle: response for part 1
    • 6.40. Finding substructure: response for part 7
    • 8.70. Common mistake with .equals: response for part 1
    • E9.45. Defining a size(: response for part 3
    • 2.23. Translating that flow diagram into code: response for part 9
    • 7.1005. Synthesis & Questions 7
    • 7.80. Designing a hockey stick: response for part 1
    • 6.80. Tracing recursion: response for part 3
    • 1.1005. Synthesis & Questions 1
    • E9.25. Node or Node reference?: response for part 1
    • 1.50. Math on computers: response for part 3
    • E9.70. The SinglyLinkedList implementation: response for part 1
    • 1.50. Math on computers: response for part 1
    • 2.56. How many flips to get 10 heads?: response for part 3
    • E9.80. Now do SinglyLinkedList with a sentinel: response for part 3
    • E9.70. The SinglyLinkedList implementation: response for part 5
    • 6.70. Substitution practice using factorial: response for part 4
    • 1.35. Translating a story about carrots: response for part 3
    • 5.65. More tracing using the debugger: response for part 2
    • 2.23. Translating that flow diagram into code: response for part 3
    • 3.50. Perfect shuffle: response for part 2
    • 1.75. Randomness: response for part 3
    Announcements
    • Announcements
    • Introduction meetings on Sunday, January 13!
    Discussions
    • Discussions
    Modules
    • Modules
    • Exam 1
    • Extension Fest 1
    • 3. Arrays
    • 2. Choice & Iteration
    • 1. Intro and Types & Names
    • 0. Welcome
    Course Navigation
    • Assignments
    • Pages
    • Discussions
    • Syllabus
    • Announcements
    • Files
    • Collaborations
    • Grades
    • People
    • Modules
    Click any image to embed the image in the page.
    Find images on flickr creative commons
    Uploading file...
    Loading...
    0 more to upload
    {{ display_name }}
    {{ display_name }}
    Drop Images Here to upload
        course_10842
    Select a destination folder for these   files: