Are you over 18 and want to see adult content?
More Annotations
A complete backup of https://isetl.org
Are you over 18 and want to see adult content?
A complete backup of https://lipodoc.com
Are you over 18 and want to see adult content?
A complete backup of https://transinformation.net
Are you over 18 and want to see adult content?
A complete backup of https://dneprcity.net
Are you over 18 and want to see adult content?
A complete backup of https://eurolove.space
Are you over 18 and want to see adult content?
A complete backup of https://electrifiedmj.com
Are you over 18 and want to see adult content?
A complete backup of https://endocrinologyadvisor.com
Are you over 18 and want to see adult content?
A complete backup of https://adobeexchange.com
Are you over 18 and want to see adult content?
A complete backup of https://axa-betreuer.de
Are you over 18 and want to see adult content?
A complete backup of https://gorodvitebsk.by
Are you over 18 and want to see adult content?
A complete backup of https://jrcigars.com
Are you over 18 and want to see adult content?
A complete backup of https://vivaenergy.com.au
Are you over 18 and want to see adult content?
Favourite Annotations
A complete backup of kuran-ikerim.org
Are you over 18 and want to see adult content?
A complete backup of css-templates.org
Are you over 18 and want to see adult content?
A complete backup of puhelinliittymat.fi
Are you over 18 and want to see adult content?
A complete backup of cyberphysics.co.uk
Are you over 18 and want to see adult content?
A complete backup of takeoutontherun.com
Are you over 18 and want to see adult content?
A complete backup of henriksen-brensel.no
Are you over 18 and want to see adult content?
A complete backup of fashionfortravel.com
Are you over 18 and want to see adult content?
Text
CS 61A SPRING 2021
Guides. (Spring 2021) Scheme Built-In Procedure Reference. (Spring 2021) CS 61A Scheme Specification. (Spring 2021) Study Guide: Scheme. (Fall 2020) Playlist: DeNero on Scheme. (Fall 2020) Playlist: DeNero on Macros. (Fall 2019) Shayna's Scheme Guide. (Fall 2017) Minilecture: Scheme Intro. (Spring 2015) Max's Scheme Lists Video.STUDY GUIDE: TREES
A tree is an abstract model of a hierarchical structure. It consists of nodes with a parent-child relationship. Its name comes from the fact that when drawn, it resembles an upside-down tree: the root of the tree is at the top and the leaves are at the bottom. A tree is a recursive data structure; each node of the tree contains a label value TUTORS | CS 61A SPRING 2021 Marie Chorpita (she/her/hers) chorpita@berkeley.edu. Hi everyone! My name is Marie (she/her), and I'm a second year intended CS major from Los Angeles, California. I like cooking, baking, video games, and sewing. This is my second semester as a CS 61A tutor, and I'm looking forward to meeting you!OFFICE HOURS
Office Hours. Weekly support schedule. For weekly fixed office hours, join the online queue at oh.cs61a.org and make a ticket during the scheduled office hours times below. Office hours are a great place to get individualized help from staff for any general or assignment-specific questions. STUDY GUIDE: RECURSIONEXAM PREP 8
Exam Prep 8: Scheme. examprep08.pdf. Students from past semesters wanted more content and structured time to prepare for exams. Exam Prep sections are a way to solidify your understanding of the week's materials. The problems are typically designed to be a bridge between discussion/lab/homework difficulty and exam difficulty.CS 61A TUTORIALS
CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. STUDY GUIDE: MUTABLE TREES For example, we can define a function square_tree which takes in a mutable Tree and squares each value in the tree. def square_tree(t): t.label = t.label ** 2 for b in t.branches: square_tree (b) But tree mutation problems can come in many different shapes and forms and require us to pay special attention to fundamentals like domain andrange.
EXAM SERVER
Exam Server
CS 61A SPRING 2021CODELAB 2HW 03HOGEXAM SERVER Monday, January 18. Welcome to CS 61A! Join Piazza for announcements and answers to your questions. The first lecture will be 2:10pm-3pm Wednesday 1/20 on Zoom (@berkeley.edu login required). Please attend, but it will be recorded and posted to this site if you miss it.CS 61A SPRING 2021
Guides. (Spring 2021) Scheme Built-In Procedure Reference. (Spring 2021) CS 61A Scheme Specification. (Spring 2021) Study Guide: Scheme. (Fall 2020) Playlist: DeNero on Scheme. (Fall 2020) Playlist: DeNero on Macros. (Fall 2019) Shayna's Scheme Guide. (Fall 2017) Minilecture: Scheme Intro. (Spring 2015) Max's Scheme Lists Video.STUDY GUIDE: TREES
A tree is an abstract model of a hierarchical structure. It consists of nodes with a parent-child relationship. Its name comes from the fact that when drawn, it resembles an upside-down tree: the root of the tree is at the top and the leaves are at the bottom. A tree is a recursive data structure; each node of the tree contains a label value TUTORS | CS 61A SPRING 2021 Marie Chorpita (she/her/hers) chorpita@berkeley.edu. Hi everyone! My name is Marie (she/her), and I'm a second year intended CS major from Los Angeles, California. I like cooking, baking, video games, and sewing. This is my second semester as a CS 61A tutor, and I'm looking forward to meeting you!OFFICE HOURS
Office Hours. Weekly support schedule. For weekly fixed office hours, join the online queue at oh.cs61a.org and make a ticket during the scheduled office hours times below. Office hours are a great place to get individualized help from staff for any general or assignment-specific questions. STUDY GUIDE: RECURSIONEXAM PREP 8
Exam Prep 8: Scheme. examprep08.pdf. Students from past semesters wanted more content and structured time to prepare for exams. Exam Prep sections are a way to solidify your understanding of the week's materials. The problems are typically designed to be a bridge between discussion/lab/homework difficulty and exam difficulty.CS 61A TUTORIALS
CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. STUDY GUIDE: MUTABLE TREES For example, we can define a function square_tree which takes in a mutable Tree and squares each value in the tree. def square_tree(t): t.label = t.label ** 2 for b in t.branches: square_tree (b) But tree mutation problems can come in many different shapes and forms and require us to pay special attention to fundamentals like domain andrange.
EXAM SERVER
Exam Server
CS 61A SPRING 2021
Guides. (Spring 2021) Scheme Built-In Procedure Reference. (Spring 2021) CS 61A Scheme Specification. (Spring 2021) Study Guide: Scheme. (Fall 2020) Playlist: DeNero on Scheme. (Fall 2020) Playlist: DeNero on Macros. (Fall 2019) Shayna's Scheme Guide. (Fall 2017) Minilecture: Scheme Intro. (Spring 2015) Max's Scheme Lists Video.WEEKLY SCHEDULE
Weekly Schedule. Sun 1/17. Mon 1/18. Tue 1/19. Wed 1/20. Thu 1/21. Fri1/22. Sat 1/23.
SYLLABUS & COURSE POLICIES CS 10: The Beauty and Joy of Computing is an introductory computer science course which is similar to CS 61A but moves at a friendlier pace. CS 10 covers variables, functions, recursion, algorithmic complexity, object-oriented programming, and many other relevant CS 61A topics, with the overall content overlap being about 50%. TAS | CS 61A SPRING 2021 Rachel De Jaen (she/her/hers) Head TA. rdejaen@berkeley.edu. Hi! I’m Rachel, I’m a fourth-year cs + spanish linguistics major from seattle. I like cats, watching jeopardy, alternative indie/rock music, and eggs. Really excited to teach 61A this semester, email me if youwant to chat!
CS 61A SCHEME SPECIFICATION CS 61A Scheme Specification. Last Updated: Spring 2019. About This Specification. The version of Scheme used in this course is not perfectly true to any official specification of the language, though it is perhaps closest to R5RS, with some features and terminology from other versions, both older and newer.We deviate from the official specifications for several reasons, including ease of SCHEME BUILT-IN PROCEDURE REFERENCE Scheme Built-In Procedure Reference. Last Updated: Spring 2020. This document serves as a reference for the built-in procedures in the Scheme project and staff Scheme interpreter.The web interpreter includes several additional built-in procedures.. In all of the syntax definitions below, refers to a required element x that can vary, while refers to an optional element x. STUDY GUIDE: REGULAR EXPRESSIONS Regular Expressions in Python. In Python, we use the re module (see the Python documentation for more information) to write regular expressions. The following are some useful function in the re module:. re.search(pattern, string) - returns a match object representing the first occurrence of pattern within string re.sub(pattern, repl, string) - substitutes all matches of pattern within string STUDY GUIDE: INTERPRETERS The interpreters we study in this course are designed around a Read-Eval-Print-Loop. The interpreter waits for our input, looping until we type in a string of characters, (+ 1 2). In the Read stage, we take the string of characters and convert those characters into data structures that can be understood by the interpreter.DISCUSSION 10
Discussion 10 Vitamin. To encourage everyone to watch or attend discussion orientation, we have created small discussion vitamins. If you complete 5 of the 6 vitamins, you can earn one point of extra credit added to your final grade in the course. Please answerEXAM SERVER
Exam Server
CS 61A SPRING 2021CODELAB 2HW 03HOGEXAM SERVER Monday, January 18. Welcome to CS 61A! Join Piazza for announcements and answers to your questions. The first lecture will be 2:10pm-3pm Wednesday 1/20 on Zoom (@berkeley.edu login required). Please attend, but it will be recorded and posted to this site if you miss it.CS 61A SPRING 2021
Guides. (Spring 2021) Scheme Built-In Procedure Reference. (Spring 2021) CS 61A Scheme Specification. (Spring 2021) Study Guide: Scheme. (Fall 2020) Playlist: DeNero on Scheme. (Fall 2020) Playlist: DeNero on Macros. (Fall 2019) Shayna's Scheme Guide. (Fall 2017) Minilecture: Scheme Intro. (Spring 2015) Max's Scheme Lists Video.STUDY GUIDE: TREES
A tree is an abstract model of a hierarchical structure. It consists of nodes with a parent-child relationship. Its name comes from the fact that when drawn, it resembles an upside-down tree: the root of the tree is at the top and the leaves are at the bottom. A tree is a recursive data structure; each node of the tree contains a label valueCS 61A TUTORIALS
CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. TUTORS | CS 61A SPRING 2021 Marie Chorpita (she/her/hers) chorpita@berkeley.edu. Hi everyone! My name is Marie (she/her), and I'm a second year intended CS major from Los Angeles, California. I like cooking, baking, video games, and sewing. This is my second semester as a CS 61A tutor, and I'm looking forward to meeting you!EXAM PREP 8
Exam Prep 8: Scheme. examprep08.pdf. Students from past semesters wanted more content and structured time to prepare for exams. Exam Prep sections are a way to solidify your understanding of the week's materials. The problems are typically designed to be a bridge between discussion/lab/homework difficulty and exam difficulty. STUDY GUIDE: ENVIRONMENTS AND HOF Environment Diagrams. Albert Wu's Environment Diagrams Guide provides an alternative view of the rules and additional practice. Environment diagrams help us visualize Python's process. For each line of code we should first identify what kind of statement or expression it is and then execute the line according to the rules. A couple tips: STUDY GUIDE: MUTABLE TREES For example, we can define a function square_tree which takes in a mutable Tree and squares each value in the tree. def square_tree(t): t.label = t.label ** 2 for b in t.branches: square_tree (b) But tree mutation problems can come in many different shapes and forms and require us to pay special attention to fundamentals like domain andrange.
CS 61A STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMS CS 61A Structure and Interpretation of Computer Programs Fall 2019 FinalSolutions INSTRUCTIONS • Youhave2hoursand50minutestocompletetheexam. • TheexamisclosedbookEXAM SERVER
Exam Server
CS 61A SPRING 2021CODELAB 2HW 03HOGEXAM SERVER Monday, January 18. Welcome to CS 61A! Join Piazza for announcements and answers to your questions. The first lecture will be 2:10pm-3pm Wednesday 1/20 on Zoom (@berkeley.edu login required). Please attend, but it will be recorded and posted to this site if you miss it.CS 61A SPRING 2021
Guides. (Spring 2021) Scheme Built-In Procedure Reference. (Spring 2021) CS 61A Scheme Specification. (Spring 2021) Study Guide: Scheme. (Fall 2020) Playlist: DeNero on Scheme. (Fall 2020) Playlist: DeNero on Macros. (Fall 2019) Shayna's Scheme Guide. (Fall 2017) Minilecture: Scheme Intro. (Spring 2015) Max's Scheme Lists Video.STUDY GUIDE: TREES
A tree is an abstract model of a hierarchical structure. It consists of nodes with a parent-child relationship. Its name comes from the fact that when drawn, it resembles an upside-down tree: the root of the tree is at the top and the leaves are at the bottom. A tree is a recursive data structure; each node of the tree contains a label valueCS 61A TUTORIALS
CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. TUTORS | CS 61A SPRING 2021 Marie Chorpita (she/her/hers) chorpita@berkeley.edu. Hi everyone! My name is Marie (she/her), and I'm a second year intended CS major from Los Angeles, California. I like cooking, baking, video games, and sewing. This is my second semester as a CS 61A tutor, and I'm looking forward to meeting you!EXAM PREP 8
Exam Prep 8: Scheme. examprep08.pdf. Students from past semesters wanted more content and structured time to prepare for exams. Exam Prep sections are a way to solidify your understanding of the week's materials. The problems are typically designed to be a bridge between discussion/lab/homework difficulty and exam difficulty. STUDY GUIDE: ENVIRONMENTS AND HOF Environment Diagrams. Albert Wu's Environment Diagrams Guide provides an alternative view of the rules and additional practice. Environment diagrams help us visualize Python's process. For each line of code we should first identify what kind of statement or expression it is and then execute the line according to the rules. A couple tips: STUDY GUIDE: MUTABLE TREES For example, we can define a function square_tree which takes in a mutable Tree and squares each value in the tree. def square_tree(t): t.label = t.label ** 2 for b in t.branches: square_tree (b) But tree mutation problems can come in many different shapes and forms and require us to pay special attention to fundamentals like domain andrange.
CS 61A STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMS CS 61A Structure and Interpretation of Computer Programs Fall 2019 FinalSolutions INSTRUCTIONS • Youhave2hoursand50minutestocompletetheexam. • TheexamisclosedbookEXAM SERVER
Exam Server
WEEKLY SCHEDULE
Weekly Schedule. Sun 1/17. Mon 1/18. Tue 1/19. Wed 1/20. Thu 1/21. Fri1/22. Sat 1/23.
OFFICE HOURS
Office Hours. Weekly support schedule. For weekly fixed office hours, join the online queue at oh.cs61a.org and make a ticket during the scheduled office hours times below. Office hours are a great place to get individualized help from staff for any general or assignment-specific questions. STUDY GUIDE: ENVIRONMENTS AND HOF Environment Diagrams. Albert Wu's Environment Diagrams Guide provides an alternative view of the rules and additional practice. Environment diagrams help us visualize Python's process. For each line of code we should first identify what kind of statement or expression it is and then execute the line according to the rules. A couple tips: 61A CODE DOCUMENTATION 61A Code Documentation. code.cs61a.org is an online interpreter for all three of the languages (Python 3.9, 61A Scheme, and the SQLite variant of SQL) taught in this course. Using this interpreter, you can edit, run, debug, visualize, and share programs with staff. GettingStarted
STUDY GUIDE: ITERATORS Medium Q2: Generators generator. Write the generator function make_generators_generator, which takes a zero-argument generator function g and returns a generator that yields generators. For each element e yielded by the generator object returned by calling g, a new generator object is yielded that will generate entries 1 through e yielded by the generator returned by g. STUDY GUIDE: INTERPRETERS The interpreters we study in this course are designed around a Read-Eval-Print-Loop. The interpreter waits for our input, looping until we type in a string of characters, (+ 1 2). In the Read stage, we take the string of characters and convert those characters into data structures that can be understood by the interpreter.ACADEMIC INTERNS
Anish Ranga Sai Gollakota (he/him/his) agollakota@berkeley.edu. Hi! I'm Anish, a second year Computer Science student from San Jose, CA. This will be my second semester as an Academic Intern (61B last semester). My hobbies include playing/watching basketball and football, as well as playing video games. Feel free to reach out! STUDY GUIDE: RECURSION Q2: Sine. Now we're going to approximate the sine trigonemetric function using 2 useful facts. One is that sin(x) is approximately equal to x as x gets small (for this question, below 0.0001). The other fact is the trigonometric identity sin(x) = 3sin(x/3) - 4sin³(x/3) Using these two facts, write a function sine that returns the sine of a value in radians.DISCUSSION 2
A higher order function (HOF) is a function that manipulates other functions by taking in functions as arguments, returning a function, or both. For example, the function compose1 below takes in two functions as arguments and returns a function that is the composition of the two arguments. def compose1(f, g): def h(x): return f (g (x))return h.
EXAM SERVER
Exam Server
CS 61A SPRING 2021CODELAB 2HW 03HOGEXAM SERVER Tomorrow is the final exam! Please read the exam logistics post.; Hopefully you have all been studying by reading the study guides, taking the practice final exam, going through past exams, or attending review sessions.We also encourage you to get a good night's sleep before the exam, so that you brain has time to process all that recursion and parentheses.WEEKLY SCHEDULE
Weekly Schedule. Weekly Q&A, lab, discussion, and online exam prep schedule. See Staff for who teaches what section.. Note that all events below are listed in Pacific Time.STUDY GUIDE: TREES
CS 61A: Structure and Interpretation of Computer Programs. Instructions. This is a study guide with links to past lectures, assignments, and handouts, as well as additional practice problems to assist you in learning the concepts. CS 61A TUTORIALSCS 61A FALL 2011CS 61A FALL 2012CS 61A SPRING 2018CS 61A SPRING 2019CS 61A SPRING 2020UCB CS 61A CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. TUTORS | CS 61A SPRING 2021 Meet the tutors. We are very excited to teach you this spring! Please email course staff if you have any logistical questions or concerns. Otherwise feel free to email any of the staff members below. Tutors Course tutors host tutorials and office hours and help with other aspects of the course such as assignment parties, Piazza support andgrading.
EXAM PREP 8
CS 61A: Structure and Interpretation of Computer Programs. Q2: Group by Non-Decreasing. Difficulty: ⭐⭐⭐ Define a function nondecreaselist, which takes in a scheme list of numbers and outputs a list of lists, which overall has the same numbers in the same order, but grouped into lists that are non-decreasing.. For example, if the input is a stream containing elements STUDY GUIDE: MUTABLE TREES CS 61A: Structure and Interpretation of Computer Programs. Instructions. This is a study guide with links to past lectures, assignments, and handouts, as well as additional practice problems to assist you in learning the concepts.EXAM SERVER
Exam Server - CS 61AEXAM SERVER
Exam Server
THE GAME OF HOG
Web site created using create-react-app. It is Player ZERO‘s turn..Roll Dice. Roll!
CS 61A SPRING 2021CODELAB 2HW 03HOGEXAM SERVER Tomorrow is the final exam! Please read the exam logistics post.; Hopefully you have all been studying by reading the study guides, taking the practice final exam, going through past exams, or attending review sessions.We also encourage you to get a good night's sleep before the exam, so that you brain has time to process all that recursion and parentheses.WEEKLY SCHEDULE
Weekly Schedule. Weekly Q&A, lab, discussion, and online exam prep schedule. See Staff for who teaches what section.. Note that all events below are listed in Pacific Time.STUDY GUIDE: TREES
CS 61A: Structure and Interpretation of Computer Programs. Instructions. This is a study guide with links to past lectures, assignments, and handouts, as well as additional practice problems to assist you in learning the concepts. CS 61A TUTORIALSCS 61A FALL 2011CS 61A FALL 2012CS 61A SPRING 2018CS 61A SPRING 2019CS 61A SPRING 2020UCB CS 61A CS 61A Tutorials. Please remember to attend or watch a discussion orientation and submit the vitamin before attending a tutorial section.. You can find the Zoom links and recordings for orientations in the Piazza index thread. TUTORS | CS 61A SPRING 2021 Meet the tutors. We are very excited to teach you this spring! Please email course staff if you have any logistical questions or concerns. Otherwise feel free to email any of the staff members below. Tutors Course tutors host tutorials and office hours and help with other aspects of the course such as assignment parties, Piazza support andgrading.
EXAM PREP 8
CS 61A: Structure and Interpretation of Computer Programs. Q2: Group by Non-Decreasing. Difficulty: ⭐⭐⭐ Define a function nondecreaselist, which takes in a scheme list of numbers and outputs a list of lists, which overall has the same numbers in the same order, but grouped into lists that are non-decreasing.. For example, if the input is a stream containing elements STUDY GUIDE: MUTABLE TREES CS 61A: Structure and Interpretation of Computer Programs. Instructions. This is a study guide with links to past lectures, assignments, and handouts, as well as additional practice problems to assist you in learning the concepts.EXAM SERVER
Exam Server - CS 61AEXAM SERVER
Exam Server
THE GAME OF HOG
Web site created using create-react-app. It is Player ZERO‘s turn..Roll Dice. Roll!
WEEKLY SCHEDULE
Weekly Schedule. Weekly Q&A, lab, discussion, and online exam prep schedule. See Staff for who teaches what section.. Note that all events below are listed in Pacific Time.OFFICE HOURS
Office Hours. Weekly support schedule. For weekly fixed office hours, join the online queue at oh.cs61a.org and make a ticket during the scheduled office hours times below. Office hours are a great place to get individualized help from staff for any general or assignment-specific questions. 61A CODE DOCUMENTATION 61A Code Documentation. code.cs61a.org is an online interpreter for all three of the languages (Python 3.9, 61A Scheme, and the SQLite variant of SQL) taught in this course. Using this interpreter, you can edit, run, debug, visualize, and share programs with staff. GettingStarted
HOMEWORK 1 | CS 61A SPRING 2021 Homework 1: Variables & Functions, Control hw01.zip; Due by 11:59pm on Thursday, January 28. Instructions. Download hw01.zip.. Submission: When you are done, submit with python3 ok --submit.You may submit more than once before the deadline; only the final submission will bescored.
ACADEMIC INTERNS
Ishaan Mauli Mishra (he/him/his) ishaan.mishra@berkeley.edu; Hey! I am a sophomore CS major from Mumbai, India. Besides CS, my interests include music - I play the guitar, I'm mostly into rock, blues, and jazz, and I'm really into John Mayer - and squash. HOMEWORK 2 | CS 61A SPRING 2021 Homework 2: Higher Order Functions hw02.zip; Due by 11:59pm on Thursday, February 4. Instructions. Download hw02.zip.Inside the archive, you will find a file called hw02.py, along with a copy of the ok autograder. Submission: When you are done, submit with python3 ok --submit.You may submit more than once before the deadline; only the final submission will be scored. MIDTERM 2 WALKTHROUGH CS 61A: Structure and Interpretation of Computer Programs. Midterm 2 Walkthrough Tuple Trouble Question. Consider this partially implemented two-line program: CS 61A STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMS CS 61A Structure and Interpretation of Computer Programs Fall 2019 FinalSolutions INSTRUCTIONS • Youhave2hoursand50minutestocompletetheexam. • TheexamisclosedbookTHE GAME OF HOG
Web site created using create-react-app. It is Player ZERO‘s turn..Roll Dice. Roll!
EXAM SERVER
Exam Server
* Weekly Schedule
* Office Hours
* Staff
* Instructors
* TAs
* Tutors
* Academic Interns
* Resources
* Syllabus
* Piazza
* Extra
* Code
* Tutor
CS 61A: STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMSFall 2019
Instructor: John DeNero MW 2:10-3:00 in 1 Pimentel; F 2:10-3 in 105 StanleyFriday, November 1
* Homework 6 extended to Monday 11/4. * Lab 9 extended to Monday 11/4. * Homework 7 is due Thursday 11/7. * Guerrilla section on Scheme this Saturday 11/2, 12pm-2pm in Soda271, 273, 275.
* Please submit Midterm 2 regrade requests by Monday 11/4 (examand solutions
).
Week 10 Class Material*
Lecture 25: Scheme
* Video
* full
* 1pp
* 8pp
* 25.scm
*
Lecture 26: Exceptions* Video
* full
* 1pp
* 8pp
* 26.py
* 26.scm
*
Lecture 27: Calculator* Video
* full
* 1pp
* 8pp
* 27.scm
* 27.zip
* CS 61A Textbook:
* Ch. 3.2
* Ch. 3.1
* Ch. 3.4
* Ch. 3.3
* Disc 09: Scheme
* Solutions
* Guerrilla 03: Scheme* Solutions
Week 10 Resources * Scheme Built-In Procedure Reference (Fall 2019) * CS 61A Scheme Specification (Fall 2019) * (Fall 2016) Kavi's Scheme Slides* Solutions
__ __
Wednesday, October 30 * Homework 6 extended to Friday 11/1. * Please submit Midterm 2 regrade requests by Monday 11/4 (examand solutions
).
* Guerrilla section on Scheme this Saturday 11/2, 12pm-2pm in Soda271, 273, 275.
Week 10 Class Material*
Lecture 25: Scheme
* Video
* full
* 1pp
* 8pp
* 25.scm
*
Lecture 26: Exceptions* Video
* full
* 1pp
* 8pp
* 26.py
* 26.scm
*
Lecture 27: Calculator* Video
* full
* 1pp
* 8pp
* 27.scm
* 27.zip
* CS 61A Textbook:
* Ch. 3.2
* Ch. 3.1
* Ch. 3.4
* Ch. 3.3
* Disc 09: Scheme
* Solutions
* Guerrilla 03: Scheme* Solutions
Week 10 Resources * Scheme Built-In Procedure Reference (Fall 2019) * CS 61A Scheme Specification (Fall 2019) * (Fall 2016) Kavi's Scheme Slides* Solutions
__ __
Monday, October 28
* Video-only lecture Monday 10/28. * Homework 6 extended to Friday 11/1. * Students who missed lab on Monday are welcome to attend any lab on Tuesday or Wednesday .*
Midterm 2 exam and solutionsare posted.
* If you took the exam, you should have received an email from Gradescope with your graded exam. * Please submit regrade requests by Monday 11/4. Week 10 Class Material*
Lecture 25: Scheme
* Video
* full
* 1pp
* 8pp
* 25.scm
*
Lecture 26: Exceptions* Video
* full
* 1pp
* 8pp
* 26.py
* 26.scm
*
Lecture 27: Calculator* Video
* full
* 1pp
* 8pp
* 27.scm
* 27.zip
* CS 61A Textbook:
* Ch. 3.2
* Ch. 3.1
* Ch. 3.4
* Ch. 3.3
* Disc 09: Scheme
* Solutions
* Guerrilla 03: Scheme* Solutions
Week 10 Resources * Scheme Built-In Procedure Reference (Fall 2019) * CS 61A Scheme Specification (Fall 2019) * (Fall 2016) Kavi's Scheme Slides* Solutions
__ __
Friday, October 25
* Video-only lecture Friday 10/25. Week 9 Class Material*
Lecture 23: Data Examples* Video
* full
* 1pp
* 8pp
* 23.py
*
Lecture 24: Users
* Video
* CS 61A Textbook:
Week 9 Resources __ __Monday, October 21
*
Homework 5 is due Tuesday 10/22. * Homework party Monday 10/21 6:30pm-8pm in 241 Cory.*
Midterm 2 is 8pm-10pm Thursday 10/24. * Covers lecture content through Wednesday 10/16. * You can bring two 2-sided sheets of handwritten notes.*
We will provide:
* Midterm 1 Study Guide * Midterm 2 Study Guide* Scratch paper
* Seats assigned Wednesday 10/23. * No lecture next Wednesday 10/23. * No discussion section Wed 10/23 through Fri 10/25. * Video-only lecture Friday 10/25. Week 9 Class Material*
Lecture 23: Data Examples* Video
* full
* 1pp
* 8pp
* 23.py
*
Lecture 24: Users
* Video
* CS 61A Textbook:
Week 9 Resources __ __Friday, October 18
*
The Ants Project deadline is extended to Friday 10/18. * Extra office hours Friday 10/18 4pm-8pm in 430 Soda (WozniakLounge).
*
Guerrilla Section 12-2pm Saturday 10/19 in Soda 271, 273, 275. * Topics covered: lists, mutation, trees, non-local assignment, linked lists, iterators, and generators. * Homework 5 is due Tuesday 10/22.*
Midterm 2 is 8pm-10pm Thursday 10/24. * Covers lecture content through Wednesday 10/16. * You can bring two 2-sided sheets of handwritten notes. * Different treatment of orders of growth this semester. * No BTree class covered in lecture this semester. * Seats assigned Wednesday 10/23. * No lecture next Wednesday 10/23. * No discussion section Wed 10/23 through Fri 10/25. Week 8 Class Material*
Lecture 20: Composition* Video
* full
* 1pp
* 8pp
* 20.py
*
Lecture 21: Efficiency* Video
* full
* 1pp
* 8pp
* 21.py
* 21.ipynb
*
Lecture 22: Decomposition* Video
* full
* 1pp
* 8pp
* 22.py
* 22.zip
* CS 61A Textbook:
* Ch. 2.9
* Ch. 2.8
* Disc 07: Linked Lists, Trees, Iterators & Generators* Solutions
* Guerrilla 02: Python Lists, Data Abstraction, Trees, Nonlocal, Iterators & Generators, Object-Oriented Programming, Mutable Trees* Solutions
Week 8 Resources
* (Summer 2015) Albert's Orders of Growth Problems * Samantha's Linked Lists Slides (Summer 2017) * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
* (Summer 2015) Albert's Mutable Linked List Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems__ __
Wednesday, October 16*
Guest additional topics lecture 5-6pm Wed 10/16 in 3106 Etcheverry. * Rahul Arya describes how to build the GUI from the Cats project.*
The Ants Project deadline is extended to Friday 10/18. * Early submission bonus point deadline is extended to Thursday10/17.
*
Guerrilla Section 12-2pm Saturday 10/19 in Soda 271, 273, 275. * Topics covered: lists, mutation, trees, non-local assignment, linked lists, iterators, and generators. * Homework 5 is due Tuesday 10/22.*
Midterm 2 is 8pm-10pm Thursday 10/24. * Covers lecture content through Wednesday 10/16. * You can bring two 2-sided sheets of handwritten notes. * Different treatment of orders of growth this semester. * No BTree class covered in lecture this semester. * Seats assigned Wednesday 10/23. * No lecture next Wednesday 10/23. * No discussion section Wed 10/23 through Fri 10/25. Week 8 Class Material*
Lecture 20: Composition* Video
* full
* 1pp
* 8pp
* 20.py
*
Lecture 21: Efficiency* Video
* full
* 1pp
* 8pp
* 21.py
* 21.ipynb
*
Lecture 22: Decomposition* Video
* full
* 1pp
* 8pp
* 22.py
* 22.zip
* CS 61A Textbook:
* Ch. 2.9
* Ch. 2.8
* Disc 07: Linked Lists, Trees, Iterators & Generators* Solutions
* Guerrilla 02: Python Lists, Data Abstraction, Trees, Nonlocal, Iterators & Generators, Object-Oriented Programming, Mutable Trees* Solutions
Week 8 Resources
* (Summer 2015) Albert's Orders of Growth Problems * Samantha's Linked Lists Slides (Summer 2017) * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
* (Summer 2015) Albert's Mutable Linked List Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems__ __
Monday, October 14
* Extra office hours Monday 10/14 3:30-6:30 in Soda 275.*
Homework/Project party Monday 10/14 6:30-8pm in Cory 241. * We will be prioritizing questions for Homework 4 and Phase 1&2 ofAnts
* Homework 4 deadline is extended to Monday 10/14 @ 11:59pm due to class cancellations. * Hog Composition Revisiondeadline is
extended to Monday 10/14. * Lab 6 deadline is extended to Monday 10/14.*
The Ants Project deadline is extended to Friday 10/18. * Checkpoint deadline is extended to Tuesday 10/15. * Early submission bonus point deadline is extended to Thursday10/17.
* Homework 5 is due Tuesday 10/22. * Midterm 2 is 8pm-10pm Thursday 10/24. Week 8 Class Material*
Lecture 20: Composition* Video
* full
* 1pp
* 8pp
* 20.py
*
Lecture 21: Efficiency* Video
* full
* 1pp
* 8pp
* 21.py
* 21.ipynb
*
Lecture 22: Decomposition* Video
* full
* 1pp
* 8pp
* 22.py
* 22.zip
* CS 61A Textbook:
* Ch. 2.9
* Ch. 2.8
* Disc 07: Linked Lists, Trees, Iterators & Generators* Solutions
* Guerrilla 02: Python Lists, Data Abstraction, Trees, Nonlocal, Iterators & Generators, Object-Oriented Programming, Mutable Trees* Solutions
Week 8 Resources
* (Summer 2015) Albert's Orders of Growth Problems * Samantha's Linked Lists Slides (Summer 2017) * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
* (Summer 2015) Albert's Mutable Linked List Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems__ __
Friday, October 11
* Lecture 19 (Friday 10/11) is an online-only lecture. * Online office hours Friday 10/111pm-3pm.
* Extra office hours Monday 10/14 3:30-6:30 in Soda 275. * Homework/Project party Monday 10/14 6:30-8pm in Cory 241. * Extra office hours Friday 10/18, time and location TBD. * Homework 4 deadline is extended to Monday 10/14 @ 11:59pm due to class cancellations. * Hog Composition Revisiondeadline is
extended to Monday 10/14. * Lab 6 deadline is extended to Monday 10/14. * All students will receive discussion attendance credit this week.*
The Ants Project deadline is extended to Friday 10/18. * Checkpoint deadline is extended to Tuesday 10/15. * Early submission bonus point deadline is extended to Thursday10/17.
* Online discussion section Friday 10/11 5pm-6:30pm. Week 7 Class Material*
Lecture 17: Objects
* Video
* full
* 1pp
* 8pp
* 17.py
*
Lecture 18: Inheritance* Video
* full
* 1pp
* 8pp
* 18.py
*
Lecture 19: Representation* Video
* full
* 1pp
* 8pp
* 19.py
* CS 61A Textbook:
* Ch. 2.5
* Ch. 2.7
* Disc 06: Mutability, Object-Oriented Programming* Solutions
Week 7 Resources * Tammy's OOP Guide (Spring 2018) * (Summer 2015) Albert's OOP Problems__ __
Wednesday, October 9 * Lecture 18 (Wednesday 10/09) is an online-only lecture. * Homework 4 deadline is extended to Monday 10/14 @ 11:59pm due to class cancellations. * Hog Composition Revisiondeadline is
extended to Monday 10/14. * Lab 6 deadline is extended to Monday 10/14. * All students will receive discussion attendance credit this week.*
The Ants Project deadline is extended to Friday 10/18. * Checkpoint deadline is extended to Tuesday 10/15. * Early submission bonus point deadline is extended to Thursday10/17.
Week 7 Class Material*
Lecture 17: Objects
* Video
* full
* 1pp
* 8pp
* 17.py
*
Lecture 18: Inheritance* Video
* full
* 1pp
* 8pp
* 18.py
*
Lecture 19: Representation* Video
* full
* 1pp
* 8pp
* 19.py
* CS 61A Textbook:
* Ch. 2.5
* Ch. 2.7
* Disc 06: Mutability, Object-Oriented Programming* Solutions
Week 7 Resources * Tammy's OOP Guide (Spring 2018) * (Summer 2015) Albert's OOP Problems__ __
Monday, October 7
* Guest lectures next Monday 10/7 (Catherine Cang) and Wednesday10/9 (Kavi Gupta).
* Additional topics guest lecture next Wednesday 10/9 @ 5pm (RahulArya).
* Homework 4, due Thursday 10/10, is long and worth 4 points. * Hog Composition Revisionsare due Thursday
10/10.
*
The Ants Project is due Thursday 10/17. * Checkpoint due Monday 10/14. * Early submission bonus point for submitting by Wednesday 10/16. Week 7 Class Material*
Lecture 17: Objects
* Video
* full
* 1pp
* 8pp
* 17.py
*
Lecture 18: Inheritance* Video
* full
* 1pp
* 8pp
* 18.py
*
Lecture 19: Representation* Video
* full
* 1pp
* 8pp
* 19.py
* CS 61A Textbook:
* Ch. 2.5
* Ch. 2.7
* Disc 06: Mutability, Object-Oriented Programming* Solutions
Week 7 Resources * Tammy's OOP Guide (Spring 2018) * (Summer 2015) Albert's OOP Problems__ __
Friday, October 4
* Guest lectures next Monday 10/7 (Catherine Cang) and Wednesday10/9 (Kavi Gupta).
* Additional topics guest lecture next Wednesday 10/9 @ 5pm (RahulArya).
* Homework 4, due Thursday 10/10 (not this week), is long and worth4 points.
* Hog Composition Revisionsare due Thursday
10/10.
Week 6 Class Material*
Lecture 14: Mutable Values* Video
* edX
* full
* 1pp
* 8pp
* 14.py
*
Lecture 15: Mutable Functions* Video
* edX
* full
* 1pp
* 8pp
* 15.py
*
Lecture 16: Iterators* Video
* edX
* full
* 1pp
* 8pp
* 16.py
* CS 61A Textbook:
* Ch. 2.4
* Ch. 4.2
* Disc 05: Trees, Mutability, Nonlocal* Solutions
Week 6 Resources * Tammy's Nonlocal and MutabilityGuide (Spring 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* (Summer 2015) Albert's Nonlocal Problems * Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* Peter's Iterators/Generators Slides (Fall 2016)__ __
Wednesday, October 2*
The Cats project is due Thursday 10/3 @ 11:59pm. * Early submission bonus point for submitting by Wednesday 10/2. * Some tips for implementing each function are posted to Piazza.
* Homework 4, due Thursday 10/10 (not this week), is long and worth4 points.
* Hog Composition Revisionsare due Thursday
10/10.
Week 6 Class Material*
Lecture 14: Mutable Values* Video
* edX
* full
* 1pp
* 8pp
* 14.py
*
Lecture 15: Mutable Functions* Video
* edX
* full
* 1pp
* 8pp
* 15.py
*
Lecture 16: Iterators* Video
* edX
* full
* 1pp
* 8pp
* 16.py
* CS 61A Textbook:
* Ch. 2.4
* Ch. 4.2
* Disc 05: Trees, Mutability, Nonlocal* Solutions
Week 6 Resources * Tammy's Nonlocal and MutabilityGuide (Spring 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* (Summer 2015) Albert's Nonlocal Problems * Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* Peter's Iterators/Generators Slides (Fall 2016)__ __
Monday, September 30*
The Cats project is due Thursday 10/3 @ 11:59pm. * Project party on Monday 9/30 @ 6:30-8:00pm in Cory 241 * Phase 1 checkpoint due Monday 9/30. * Early submission bonus point for submitting by Wednesday 10/2. * Some tips for implementing each function are posted to Piazza.
* Homework 4, due Thursday 10/10 (not this week), is long and worth4 points.
* Hog Composition Revisions due Thursday 10/10; see details onPiazza
Week 6 Class Material*
Lecture 14: Mutable Values* Video
* edX
* full
* 1pp
* 8pp
* 14.py
*
Lecture 15: Mutable Functions* Video
* edX
* full
* 1pp
* 8pp
* 15.py
*
Lecture 16: Iterators* Video
* edX
* full
* 1pp
* 8pp
* 16.py
* CS 61A Textbook:
* Ch. 2.4
* Ch. 4.2
* Disc 05: Trees, Mutability, Nonlocal* Solutions
Week 6 Resources * Tammy's Nonlocal and MutabilityGuide (Spring 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* (Summer 2015) Albert's Nonlocal Problems * Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* Peter's Iterators/Generators Slides (Fall 2016)__ __
Friday, September 27*
The Cats project is due Thursday 10/3 @ 11:59pm. * Early submission bonus point for submitting by Wednesday 10/2. * Phase 1 checkpoint due Monday 9/30. * You may work with a partner on the whole project. * Some tips for implementing each function are posted to Piazza.*
Guerrilla Section on Saturday 9/28 12-2pm in Soda 271, 273, 275 * Topics: Recursion, Tree Recursion * Homework 4, due Thursday 10/10 (not next week), is worth 4 points. Week 5 Class Material*
Lecture 11: Containers* Video
* edX
* full
* 1pp
* 8pp
* 11.py
*
Lecture 12: Data Abstraction* Video
* edX
* full
* 1pp
* 12.py
*
Lecture 13: Trees
* Video
* edX
* full
* 1pp
* 8pp
* 13.py
* CS 61A Textbook:
* Ch. 2.1
* Ch. 2.3
* Ch. 2.2
* Disc 04: Tree Recursion* Solutions
* Guerrilla 01: Recursion, Tree Recursion* Solutions
Week 5 Resources * Rachel's Data Abstraction Guide(Summer 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Mitas' List Method Confusion (Summer 2018) * Yichen & Allen's Lists & Sequences Slides (Spring 2018) * (Summer 2015) Albert's Python Lists Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
__ __
Wednesday, September 25 * Homework 3 is due Thursday 9/26 @ 11:59pm. * Overflow lecture 13 on Thursday 9/26 @ 8:10pm in 306 Soda. * Hog Contest awards will be presented Friday 9/28 in lecture.*
The Cats project is due Thursday 10/3 @ 11:59pm. * Phase 1 checkpoint due Monday 9/30. * Early submission bonus point for submitting by Wednesday 10/2. * You may work with a partner on the whole project. * No additional topics lecture today.*
Guerrilla Section on Saturday 9/28 12-2pm in Soda 271, 273, 275 * Topics: Recursion, Tree Recursion Week 5 Class Material*
Lecture 11: Containers* Video
* edX
* full
* 1pp
* 8pp
* 11.py
*
Lecture 12: Data Abstraction* Video
* edX
* full
* 1pp
* 12.py
*
Lecture 13: Trees
* Video
* edX
* full
* 1pp
* 8pp
* 13.py
* CS 61A Textbook:
* Ch. 2.1
* Ch. 2.3
* Ch. 2.2
* Disc 04: Tree Recursion* Solutions
* Guerrilla 01: Recursion, Tree Recursion* Solutions
Week 5 Resources * Rachel's Data Abstraction Guide(Summer 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Mitas' List Method Confusion (Summer 2018) * Yichen & Allen's Lists & Sequences Slides (Spring 2018) * (Summer 2015) Albert's Python Lists Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
__ __
Monday, September 23 * Midterm 1 regrade requests are due Monday 9/23 @ 11:59pm.*
The completely optional Hog Strategy Contest ends 11:59pm on Monday 9/23. * (nearly) live results are posted to hog-contest.cs61a.org.
*
The Cats project is due Thursday 10/3 @ 11:59pm. * Phase 1 checkpoint due Monday 9/30. * Early submission bonus point for submitting by Wednesday 10/2. * You may work with a partner on the whole project. Week 5 Class Material*
Lecture 11: Containers* Video
* edX
* full
* 1pp
* 8pp
* 11.py
*
Lecture 12: Data Abstraction* Video
* edX
* full
* 1pp
* 12.py
*
Lecture 13: Trees
* Video
* edX
* full
* 1pp
* 8pp
* 13.py
* CS 61A Textbook:
* Ch. 2.1
* Ch. 2.3
* Ch. 2.2
* Disc 04: Tree Recursion* Solutions
* Guerrilla 01: Recursion, Tree Recursion* Solutions
Week 5 Resources * Rachel's Data Abstraction Guide(Summer 2018)
* Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Mitas' List Method Confusion (Summer 2018) * Yichen & Allen's Lists & Sequences Slides (Spring 2018) * (Summer 2015) Albert's Python Lists Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * (Summer 2015) Albert's ADT Tree Problems * (Summer 2015) Albert's Mutable Tree Problems * (Spring 2017) Katya's Tree + Linked List Worksheet* Solutions
__ __
Friday, September 20 * Midterm 1 regrade requests are due Monday 9/23 @ 11:59pm.*
The completely optional Hog Strategy Contest ends 11:59pm on Monday 9/23. * (nearly) live results are posted to hog-contest.cs61a.org.
* Homework 3 is due Thursday 9/26 @ 11:59pm. Week 4 Class Material*
Lecture 9: Recursion* Video
* edX
* full
* 1pp
* 8pp
* 09.py
*
Lecture 10: Tree Recursion* Video
* edX
* full
* 1pp
* 8pp
* 10.py
* CS 61A Textbook:
* Ch. 1.7
* Disc 03: Recursion* Solutions
Week 4 Resources * HKN Spring 2018 Slides:Recursion
* Aaron's Beginner-Friendly Guide to Recursion (Summer 2018) * (Summer 2015) Albert's Recursion Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * Rachel's Recursion Guide (Summer 2018)__ __
Wednesday, September 18*
The Midterm 1 exam and solutionare posted.
* You should have received an email from Gradescope with your scored exam. * Regrade requests are due Monday 9/23 @ 11:59pm.*
The completely optional Hog Strategy Contest ends 11:59pm on Monday 9/23. * (nearly) live results are posted to hog-contest.cs61a.org.
* Additional Topics Lecture 3 is 5-6pm Wednesday 9/18 in 3106Etcheverry.
* Discussion sections do meet this week. Week 4 Class Material*
Lecture 9: Recursion* Video
* edX
* full
* 1pp
* 8pp
* 09.py
*
Lecture 10: Tree Recursion* Video
* edX
* full
* 1pp
* 8pp
* 10.py
* CS 61A Textbook:
* Ch. 1.7
* Disc 03: Recursion* Solutions
Week 4 Resources * HKN Spring 2018 Slides:Recursion
* Aaron's Beginner-Friendly Guide to Recursion (Summer 2018) * (Summer 2015) Albert's Recursion Problems * Karina & Dennis' Trees + Recursion Slides (Spring 2018) * Rachel's Recursion Guide (Summer 2018)__ __
Friday, September 13*
Guerrilla Section on Saturday 9/14 12-2pm in Soda 271, 273, 275 * Topics: Control, Environment Diagrams, Higher-Order Functions* See Piazza Post
for more details.
* CS Mentors sign-ups open 12:30pmFriday 9/13.
*
Midterm 1 is 7pm-9pm Monday 9/16. (No lecture that day.) * Seat assignments will be sent Sunday 9/15. * If you are left handed or need a special seat, let us know your seating preference by Sat 9/14. * Let us know by Sat 9/14 if you have a time conflict using this form (even if you emailed usalready).
* You may bring 1 sheet of notes. We will provide scratch paper and the Midterm 1 Study Guide . * See Piazza for more Midterm 1 information.
* The completely optional Hog Strategy Contest ends 11:59pm onMonday 9/23.
Week 3 Class Material*
Lecture 6: Iteration* Video
* edX
* full
* 1pp
* 8pp
* 06.py
*
Lecture 7: Design
* Video
* edX
* full
* 1pp
* 8pp
* 07.py
*
Lecture 8: Function Examples* Video
* edX
* full
* 1pp
* 8pp
* 08.py
* CS 61A Textbook:
* Disc 02: Higher-Order Functions* Solutions
* Guerrilla 00: Higher-Order Functions, Environment Diagrams, Control* Solutions
Week 3 Resources __ __ Wednesday, September 11*
The Hog project is due Thursday 9/12 @ 11:59pm. * Complete the whole project by Wednesday 9/11 to earn an early submission bonus point! * Homework 2 is due Thursday 9/12 @ 11:59pm. * Additional Topics Lecture 2 is 5-6pm Wednesday 9/11 in 3106Etcheverry.
*
Guerrilla Section on Saturday 9/14 12-2pm in Soda 271, 273, 275 * Topics: Control, Environment Diagrams, Higher-Order Functions* See Piazza Post
for more details.
*
Midterm 1 is 7pm-9pm Monday 9/16. (No lecture that day.) * Seat assignments will be sent Sunday 9/15. * If you are left handed or need a special seat, let us know your seating preference by Sat 9/14. * Let us know by Sat 9/14 if you have a time conflict using this form (even if you emailed usalready).
* You may bring 1 sheet of notes. We will provide scratch paper and the Midterm 1 Study Guide . * See Piazza for more Midterm 1 information.
*
Alternate times for this week's lectures: * Lecture 6 @ 8pm Monday 9/9 in 150 Wheeler * Lecture 7 @ 8pm Wednesday 9/11 in 150 Wheeler * Lecture 8 @ 8pm Thursday 9/12 in 150 Wheeler Week 3 Class Material*
Lecture 6: Iteration* Video
* edX
* full
* 1pp
* 8pp
* 06.py
*
Lecture 7: Design
* Video
* edX
* full
* 1pp
* 8pp
* 07.py
*
Lecture 8: Function Examples* Video
* edX
* full
* 1pp
* 8pp
* 08.py
* CS 61A Textbook:
* Disc 02: Higher-Order Functions* Solutions
* Guerrilla 00: Higher-Order Functions, Environment Diagrams, Control* Solutions
Week 3 Resources __ __Monday, September 9
*
The Hog project is due Thursday 9/12 @ 11:59pm. * Complete the whole project by Wednesday 9/11 to earn an early submission bonus point! * Checkpoint 1 (Phase 1 out of 3) is due Monday 9/9 @ 11:59pm. Solve this part by yourself and then python3 ok --submit. * You can work with a partner on Phases 2 & 3 once you have submitted Phase 1 on your own. * Homework 2 is due Thursday 9/12 @ 11:59pm.*
Guerrilla Section on Saturday 9/14 12-2pm in Soda 271, 273, 275 * Topics: Control, Environment Diagrams, Higher-Order Functions* See Piazza Post
for more details.
* Midterm 1 is 7pm-9pm Monday 9/16. (No lecture that day.) * Additional Topics Lecture 2 is 5-6pm Wednesday 9/11 in 3106Etcheverry.
*
Alternate times for this week's lectures: * Lecture 6 @ 8pm Monday 9/9 in 150 Wheeler * Lecture 7 @ 8pm Wednesday 9/11 in 150 Wheeler * Lecture 8 @ 8pm Thursday 9/12 in 150 Wheeler Week 3 Class Material*
Lecture 6: Iteration* Video
* edX
* full
* 1pp
* 8pp
* 06.py
*
Lecture 7: Design
* Video
* edX
* full
* 1pp
* 8pp
* 07.py
*
Lecture 8: Function Examples* Video
* edX
* full
* 1pp
* 8pp
* 08.py
* CS 61A Textbook:
* Disc 02: Higher-Order Functions* Solutions
* Guerrilla 00: Higher-Order Functions, Environment Diagrams, Control* Solutions
Week 3 Resources __ __Friday, September 6
*
The Hog project is due Thursday 9/12 @ 11:59pm. * Complete the whole project by Wednesday 9/11 to earn an early submission bonus point! * Checkpoint 1 (Phase 1 out of 3) is due Monday 9/9 @ 11:59pm. Solve this part by yourself and then python3 ok --submit. * You can work with a partner on Phases 2 & 3 once you have submitted Phase 1 on your own. * Homework 2 is due Thursday 9/12 @ 11:59pm. * Midterm 1 is 7pm-9pm Monday 9/16. (No lecture that day.) Week 2 Class Material*
Lecture 3: Control
* Video
* edX
* full
* 1pp
* 8pp
* 03.py
*
Lecture 4: Higher-Order Functions* Video
* edX
* full
* 1pp
* 8pp
* 04.py
*
Lecture 5: Environments* Video
* edX
* full
* 1pp
* 8pp
* 05.py
* CS 61A Textbook:
* Ch. 1.3
* Ch. 1.6
* Ch. 1.4
* Ch. 1.5
* Disc 01: Environment Diagrams, Control* Solutions
Week 2 Resources
* (Summer 2015) Albert's Control Structure Problems * Python Tutor (Fall 2019) * (Summer 2015) Albert's Environment Diagram Problems * Tammy's Environment Diagram Guide (Spring 2018) * Rachel's Environment Diagram Guide (Summer 2018) * Jennifer's Environment Diagram Cheat Sheet (Spring 2019) * (Spring 2014) Mark's Environment Diagram Notes and Problems * Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* (Summer 2015) Albert's Lambas Problems * (Summer 2015) Albert's HOF Env Diagram Problems__ __
Wednesday, September 4 * Homework 1 is due Thursday 9/5 @ 11:59pm.*
The Hog project is due Thursday 9/12 @ 11:59pm. * Complete the whole project by Wednesday 9/11 to earn an early submission bonus point! * Checkpoint 1 (Phase 1 out of 3) is due Monday 9/9 @ 11:59pm. Solve this part by yourself and then python3 ok --submit. * You can work with a partner on Phases 2 & 3 once you have submitted Phase 1 on your own. * The first Additional Topics lecture will be held 5-6 Wednesday 9/4in 3106 Etcheverry.
* Find a partner and meet advisors at the CS 61A student mixers: Wed 9/4 1:30-3 and Thurs 9/5 3:30-5 in Wozniak Lounge (Soda 430). * Come to office hours for help. No appointmentnecessary.
Week 2 Class Material*
Lecture 3: Control
* Video
* edX
* full
* 1pp
* 8pp
* 03.py
*
Lecture 4: Higher-Order Functions* Video
* edX
* full
* 1pp
* 8pp
* 04.py
*
Lecture 5: Environments* Video
* edX
* full
* 1pp
* 8pp
* 05.py
* CS 61A Textbook:
* Ch. 1.3
* Ch. 1.6
* Ch. 1.4
* Ch. 1.5
* Disc 01: Environment Diagrams, Control* Solutions
Week 2 Resources
* (Summer 2015) Albert's Control Structure Problems * Python Tutor (Fall 2019) * (Summer 2015) Albert's Environment Diagram Problems * Tammy's Environment Diagram Guide (Spring 2018) * Rachel's Environment Diagram Guide (Summer 2018) * Jennifer's Environment Diagram Cheat Sheet (Spring 2019) * (Spring 2014) Mark's Environment Diagram Notes and Problems * Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* (Summer 2015) Albert's Lambas Problems * (Summer 2015) Albert's HOF Env Diagram Problems__ __
Monday, September 2
* Homework 1 is due Thursday 9/5 @ 11:59pm.*
The Hog project is due Thursday 9/12 @ 11:59pm. * Checkpoint 1 (Phase 1 out of 3) is due Monday 9/9 @ 11:59pm. Solve this part by yourself. * You can work with a partner on Phases 2 & 3 once you have submitted Phase 1 on your own. * Complete the whole project by Wednesday 9/11 to earn an early submission bonus point.*
Lab 1 will be held on Tuesday 9/3 and Wednesday 9/4. * Students who would normally have lab on Monday 9/2 should instead attend a bring-your-own-computer lab on Tuesday 9/3, either 11-12:30, 12:30-2, or 3:30-5 in Wozniak Lounge (Soda 430). If you can't do that, try to attend any other lab on Tuesday or Wednesday. * Please fill out this info request form about CS 47A by 11:59pm Monday 9/2 if you think you should pass out of CS 61A because you know the contentalready.
* John DeNero has extended office hours this week in 781 Soda: 1-2 Tuesday, 11-1 Wednesday, and 11-1 Thursday. * The first Additional Topics lecture will be held 5-6 Wednesday 9/4in 3106 Etcheverry.
* Find a partner and meet advisors at the CS 61A student mixers: Wed 9/4 1:30-3 and Thurs 9/5 3:30-5 in Wozniak Lounge (Soda 430). * More lab and discussion section signup slots are now available. Week 2 Class Material*
Lecture 3: Control
* Video
* edX
* full
* 1pp
* 8pp
* 03.py
*
Lecture 4: Higher-Order Functions* Video
* edX
* full
* 1pp
* 8pp
* 04.py
*
Lecture 5: Environments* Video
* edX
* full
* 1pp
* 8pp
* 05.py
* CS 61A Textbook:
* Ch. 1.3
* Ch. 1.6
* Ch. 1.4
* Ch. 1.5
* Disc 01: Environment Diagrams, Control* Solutions
Week 2 Resources
* (Summer 2015) Albert's Control Structure Problems * Python Tutor (Fall 2019) * (Summer 2015) Albert's Environment Diagram Problems * Tammy's Environment Diagram Guide (Spring 2018) * Rachel's Environment Diagram Guide (Summer 2018) * Jennifer's Environment Diagram Cheat Sheet (Spring 2019) * (Spring 2014) Mark's Environment Diagram Notes and Problems * Samantha's Environment Diagram with Lists and Nonlocal Slides(Fall 2016)
* Kevin's Environment Diagram Doc on Lambdas, HOFs, and Nonlocal(Fall 2015)
* (Summer 2015) Albert's Lambas Problems * (Summer 2015) Albert's HOF Env Diagram Problems__ __
Friday, August 30
* Homework 1 is due Thursday 9/5 @ 11:59pm. It is based on lectures1, 2, and 3.
*
Lab 0 is a take-home tutorial on how to set up yourcomputer.
* Try to finish before lab next week, but if you don't, come to labfor help.
*
Lab 1 will be held on Tuesday 9/3 and Wednesday 9/4. * Students who would normally have lab on Monday 9/2 should instead attend a bring-your-own-computer lab on Tuesday 9/3, either 11-12:30 or 12:30-2 in Wozniak Lounge (Soda 430). If you can't do that, try to attend any other lab on Tuesday or Wednesday. * Lecture 2 (Fri 8/30) will be held 2:10pm-3pm in Zellerbach Hall.*
Lecture 3 (Mon 9/2) is online only: just a set of videos posted to cs61a.org with no live lecture (because of the holiday). * Videos will be released Friday 8/30 so that you can get started onHomework 1.
* Lecture 4 (Wed 9/4) will be held twice: 2pm in 1 Pimentel and 8pm in 150 Wheeler. Every enrolled student will get an email early next week with instructions on where to go. If you're not enrolled but want to come, you must come to the 8pm lecture (or watch videos). * More lab and discussion section signup slots will open up over the weekend. If you're not signed up yet, we will email you when slotsopen up.
* Please fill out this info request form about CS 47A by 11:59pm Monday 9/2 if you think you should pass out of CS 61A because you know the contentalready.
*
Office Hours:
* Drop-in office hours to help with lab 0 are 3:10-4 Friday 8/30 inSoda 373.
* John DeNero's office hours start next Tuesday, 9/3. His weekly office hours are 1-2 Tuesdays and 11-12 Wednesday. * Next week only, John DeNero will hold extra office hours 12-1 Wednesday and 11-1 Thursday. * Individual appointments with John DeNero are available on denero.org/meet.html . * Course staff office hours will begin next Tuesday 9/3. The schedule will be posted soon. Week 1 Class Material*
Lecture 1: Functions* Video
* edX
* full
* 1pp
* 8pp
* 01.py
*
Lecture 2: Names
* Video
* edX
* full
* 1pp
* 8pp
* 02.py
* CS 61A Textbook:
* Ch. 1.1
* Ch. 1.2
* Disc 00: Getting Started* Solutions
Week 1 Resources * Sequoia's Book: Techniques in Computer Science (Summer 2018) * Mark's Notes: Getting Started With Python (Spring 2014)__ __
Wednesday, August 28 * Welcome to CS 61A!* Join Piazza for
announcements and answers to your questions. * The first (Wed 8/28) and second (Fri 8/30) lectures will be held 2:10pm-3pm in Zellerbach Hall. * Sign up for lab and discussion sections starting 2pm Monday 8/26. * Lab 0 is a take-home tutorial on how to set up yourcomputer.
*
Office Hours:
* The staff will hold drop-in office hours to help with lab 0 from 3:10-4 Friday 8/30 in Soda 373. * John DeNero's office hours start next Tuesday, 9/3. His weekly office hours are 1-2 Tuesdays and 11-12 Wednesday. * Next week only, John DeNero will hold extra office hours 12-1 Wednesday and 11-1 Thursday. * Individual appointments with John DeNero are available on denero.org/meet.html . * Course staff office hours will begin next Tuesday 9/3. The schedule will be posted soon. * Lecture on Monday 9/2 is online only, just a set of videos posted to cs61a.org with no live lecture (because of the holiday).*
Students who would normally have lab on Monday 9/2 should insteadeither attend:
* One of the two special bring-your-own-computer lab sessions at 11-12:30 or 12:30-2 in Wozniak Lounge (Soda 430) on Tuesday 9/3. * Any lab on Tuesday or Wednesday if you want to use our computers or can't attend either of the special labs above. Week 1 Class Material*
Lecture 1: Functions* Video
* edX
* full
* 1pp
* 8pp
* 01.py
*
Lecture 2: Names
* Video
* edX
* full
* 1pp
* 8pp
* 02.py
* CS 61A Textbook:
* Ch. 1.1
* Ch. 1.2
* Disc 00: Getting Started* Solutions
Week 1 Resources * Sequoia's Book: Techniques in Computer Science (Summer 2018) * Mark's Notes: Getting Started With Python (Spring 2014)__ __
Saturday, August 24
* Welcome to CS 61A!* Join Piazza for
announcements and answers to your questions. * The first (Wed 8/28) and second (Fri 8/30) lectures will be held 2:10pm-3pm in Zellerbach Hall. * Sign up for lab and discussion sections starting 2pm Monday 8/26. * The Summer 2019 website has moved to su19.cs61a.org.
Week 1 Class Material*
Lecture 1: Functions* Video
* edX
* full
* 1pp
* 8pp
* 01.py
*
Lecture 2: Names
* Video
* edX
* full
* 1pp
* 8pp
* 02.py
* CS 61A Textbook:
* Ch. 1.1
* Ch. 1.2
* Disc 00: Getting Started* Solutions
Week 1 Resources * Sequoia's Book: Techniques in Computer Science (Summer 2018) * Mark's Notes: Getting Started With Python (Spring 2014) __ __ HW 06 11/4/19 HW 07 11/7/19WEEK
DATE
LECTURE
TEXTBOOK
LAB AND DISCUSSION LINKSHOMEWORK & PROJECT
1
Mon
8/26
Lab 00: Getting Started__ Fri 9/6
Wed
8/28
Functions
* Video
* edX
* full
* 1pp
* 8pp
* 01.py
Disc 00: Getting Started* Solutions
Fri
8/30
Names
* Video
* edX
* full
* 1pp
* 8pp
* 02.py
* Ch. 1.1
* Ch. 1.2
HW 01
__ Thu 9/5
* Solutions
2
Mon
9/2
Control
* Video
* edX
* full
* 1pp
* 8pp
* 03.py
* Ch. 1.3
* Ch. 1.4
* Ch. 1.5
Lab 01: Variables & Functions, Control__ Fri 9/6 Hog
__ Thu 9/12
Wed
9/4
Higher-Order Functions* Video
* edX
* full
* 1pp
* 8pp
* 04.py
* Ch. 1.6
Disc 01: Environment Diagrams, Control* Solutions
Fri
9/6
Environments
* Video
* edX
* full
* 1pp
* 8pp
* 05.py
* Ch. 1.6
HW 02
__ Thu 9/12
* Solutions
3
Mon
9/9
Iteration
* Video
* edX
* full
* 1pp
* 8pp
* 06.py
Lab 02: Higher-Order Functions__ Fri 9/13
Wed
9/11
Design
* Video
* edX
* full
* 1pp
* 8pp
* 07.py
Disc 02: Higher-Order Functions* Solutions
Hog Contest
__ Mon 9/23
Fri
9/13
Function Examples
* Video
* edX
* full
* 1pp
* 8pp
* 08.py
Guerrilla 00: Higher-Order Functions, Environment Diagrams, Control* Solutions
4
Mon
9/16
Midterm 1 (7-9 PM)
Wed
9/18
Recursion
* Video
* edX
* full
* 1pp
* 8pp
* 09.py
* Ch. 1.7
Disc 03: Recursion
* Solutions
HW 03
__ Thu 9/26
* Solutions
Fri
9/20
Tree Recursion
* Video
* edX
* full
* 1pp
* 8pp
* 10.py
* Ch. 1.7
5
Mon
9/23
Containers
* Video
* edX
* full
* 1pp
* 8pp
* 11.py
* Ch. 2.1
* Ch. 2.3
Lab 04: Recursion, Python Lists__ Fri 9/27 Cats
__ Thu 10/3
Wed
9/25
Data Abstraction
* Video
* edX
* full
* 1pp
* 12.py
* Ch. 2.2
Disc 04: Tree Recursion* Solutions
Fri
9/27
Trees
* Video
* edX
* full
* 1pp
* 8pp
* 13.py
* Ch. 2.3
Guerrilla 01: Recursion, Tree Recursion* Solutions
HW 04
__ Mon 10/14
* Solutions
6
Mon
9/30
Mutable Values
* Video
* edX
* full
* 1pp
* 8pp
* 14.py
* Ch. 2.4
Lab 05: Data Abstraction, Trees__ Fri 10/4
Wed
10/2
Mutable Functions
* Video
* edX
* full
* 1pp
* 8pp
* 15.py
* Ch. 2.4
Disc 05: Trees, Mutability, Nonlocal* Solutions
Fri
10/4
Iterators
* Video
* edX
* full
* 1pp
* 8pp
* 16.py
* Ch. 4.2
7
Mon
10/7
Objects
* Video
* full
* 1pp
* 8pp
* 17.py
* Ch. 2.5
Lab 06: Nonlocal, Object-Oriented Programming__ Mon 10/14 Ants
__ Fri 10/18
Wed
10/9
Inheritance
* Video
* full
* 1pp
* 8pp
* 18.py
* Ch. 2.5
Disc 06: Mutability, Object-Oriented Programming* Solutions
Fri
10/11
Representation
* Video
* full
* 1pp
* 8pp
* 19.py
* Ch. 2.7
HW 05
__ Tue 10/22
* Solutions
8
Mon
10/14
Composition
* Video
* full
* 1pp
* 8pp
* 20.py
* Ch. 2.9
Lab 07: Iterators & Generators, Linked Lists, Mutable Trees__ Fri 10/18
Wed
10/16
Efficiency
* Video
* full
* 1pp
* 8pp
* 21.py
* 21.ipynb
* Ch. 2.8
Disc 07: Linked Lists, Trees, Iterators & Generators* Solutions
Fri
10/18
Decomposition
* Video
* full
* 1pp
* 8pp
* 22.py
* 22.zip
Guerrilla 02: Python Lists, Data Abstraction, Trees, Nonlocal, Iterators & Generators, Object-Oriented Programming, Mutable Trees* Solutions
9
Mon
10/21
Data Examples
* Video
* full
* 1pp
* 8pp
* 23.py
Lab 08: Midterm Review__ Fri 10/25
Wed
10/23
No Lecture: MT2 on ThursdayThu
10/24
Midterm 2 (8-10 PM)
Fri
10/25
Users
* Video
HW 06
__ Mon 11/4
10
Mon
10/28
Scheme
* Video
* full
* 1pp
* 8pp
* 25.scm
* Ch. 3.1
* Ch. 3.2
Lab 09: Scheme
__ Fri 11/1
Wed
10/30
Exceptions
* Video
* full
* 1pp
* 8pp
* 26.py
* 26.scm
* Ch. 3.3
Disc 09: Scheme
* Solutions
Fri
11/1
Calculator
* Video
* full
* 1pp
* 8pp
* 27.scm
* 27.zip
* Ch. 3.4
Guerrilla 03: Scheme* Solutions
HW 07
__ Thu 11/7
11
Mon
11/4
Interpreters
* Ch. 3.5
Lab 10: Interpreters__ Fri 11/8 Scheme
__ Wed 11/20
Wed
11/6
Tail Calls
* Ch. 3.5
Disc 10: Tail RecursionFri
11/8
Macros
HW 08
__ Thu 11/14
12
Mon
11/11
No Lecture: Veterans' DayLab 11: Macros
__ Fri 11/15
Wed
11/13
Streams
Disc 11: Streams, MacrosScheme Contest
__ Mon 12/2
Fri
11/15
Declarative Programming* Ch. 4.3
HW 09
__ Thu 11/21
13
Mon
11/18
Tables
* Ch. 4.3
Lab 12: SQL
__ Fri 11/22
Wed
11/20
Aggregation
* Ch. 4.3
Disc 12: SQL
Fri
11/22
Databases
* Ch. 4.3
HW 10
__ Thu 12/5
14
Mon
11/25
Distributed Data
* Ch. 4.3
Lab 13: More SQL (optional)__ Fri 11/29
Wed
11/27
No Lecture: ThanksgivingFri
11/29
No Lecture: Thanksgiving15
Mon
12/2
Society
Lab 14: Final Review__ Fri 12/6
Wed
12/4
Natural Language
Disc 14: Final ReviewFri
12/6
Conclusion
HW 11
__ Fri 12/13
CS 61A
* Weekly Schedule
* Office Hours
* Staff
RESOURCES
* Studying Guide
* Debugging Guide
* Composition Guide
POLICIES
* Assignments
* Exams
* Grading
Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0