Overview Operators Multiple Return Values Docstrings Doctests Default Arguments Operators Shorthand notation for calling builtin functions. from operator import add, mul (2+3*4+5...
CS61A: Miscellaneous Python Features
CS61A: Print and None type
Forethought Consider >>> -2 -2 >>> print(-2) -2 There is a difference in the two. The print function and the None value Python has rules for automatically displaying values o...
CS61A: Environmental Diagrams
Environment Diagrams Used to keep track what goes on in the python interpreter. Memory that keeps track of bindings between names and values. Expressed in the form of pictures Operates in ...
CS61A: Defining Functions
Defining Functions Assignment -> abstraction (names are associated to values.) Functions give more flexibility as the names are dynamic. They change as the expression re-evaluates....
CS61A: Functions
Elements of Programming A programming language provides many means for how to combine simple ideas to perform complex actions. There are three main considerations: Primitive expressio...
'CS61A: Lecture 1'
The Instructor Team John Denero (he/him) - denero@berkeley.edu CS 61A Instructor Researches language models and how people use them Office hours 1-3pm Tuesdays in Warren 1...
Introduction to Computer Architecture
Evolution of Automated Computing devices Charles Babbage’s Analytical Engine ENIAC (Electronic Numerical Integrator and Computer) IBM PC (8088) Charles Babbage’s Analytical Engine Charles...
Dijkstra's Algorithm
Dijkstra’s Algorithm In Computer Science, a common problem that we encounter are parthfinding problems. These problems are typically seen in GPS programs, maze-solvers, or robotics. We would typic...
Java DS 2 Queue
Queue Imagine a fair. When entering the fair grounds, you would typically wait in a line until you gain entry. The rule of the line is simple. Whoever arrives first, is also the first to get out of...
Java DS 1 Linked Lists
Linked Lists Linked lists are a very powerful and versatile sequential data structure. While traditional lists store their information in contiguous blocks of memory. Linked lists are more flexible...