Week 3 resources
https://docs.google.com/document/d/1S9rWGByjaN5VGRwW-UlFsJFSG5o7ZkCVony3mm4Tek0/edit
Data Abstraction
Data Abstraction Objectives: Understand the motivation for abstracting away functions and other information, apply the concept of data abstraction towards the solving of large problems, design modular programs. We will approach data abstraction from two di
docs.google.com
https://docs.google.com/document/d/1IP9hjEhYGQN7A6luoMWSzG1N8pJrCTAFOut7cPG5k4A/edit
List Methods Confusion
List Methods Confusion Below are some notes about the difference between .append, .extend, direct assignment, and += when it comes to lists. (1) Using .append will mutate the list. lst1 = [1, 2] lst2 = lst1 lst1.append(3) Note that lst1 and lst2 still poin
docs.google.com
Yichen & Allen's Lists & Sequences Review
Warm Up - Conceptual Questions What does it mean for an object to be mutable? What is a pointer and how can we manipulate pointers to point to different objects? What is the difference between a deep copy and a shallow copy? What are the default mutation f
docs.google.com
http://albertwu.org/cs61a/review/lists/basic.html
Lists: basic
If you need help reviewing Lists, take a look at these resources: Each question has a "Toggle Solution" button -- click it to reveal that question's solution. You need to enable JavaScript to view the solutions. What would Python print? Question 1 >>> L =
albertwu.org
https://docs.google.com/presentation/d/1LRoggFAyjiwARHFdG1gLn-MkL_RWFYeuDTkblN-t8vk/edit#slide=id.p
Karina & Dennis's Tree Recursion Review
Trees + Recursion Review Session CS61A • Spring 2018 • Karina & Dennis Recursion, trees, tree recusion
docs.google.com
http://albertwu.org/cs61a/review/trees/exam.html
Tree ADT: exam
If you need help reviewing Tree ADT, take a look at these resources: Each question has a "Toggle Solution" button -- click it to reveal that question's solution. You need to enable JavaScript to view the solutions. Tree ADT Recall that we learned two diffe
albertwu.org
http://albertwu.org/cs61a/review/mutable-trees/exam.html
Mutable Trees: exam
If you need help reviewing Mutable Trees, take a look at these resources: We will be using the OOP implementation of Trees from lecture, found here Each question has a "Toggle Solution" button -- click it to reveal that question's solution. You need to ena
albertwu.org
'University of California, Berkeley > ElectricalEngineering & ComputerSciences' μΉ΄ν κ³ λ¦¬μ λ€λ₯Έ κΈ
| LAB_day 4 (0) | 2019.07.09 |
|---|---|
| Sequence & Data Abstraction (0) | 2019.07.09 |
| LAB_day 3 (0) | 2019.07.04 |
| Recursion Examples (0) | 2019.07.04 |
| textbook _ final (0) | 2019.07.03 |