i206: Distributed Computing Applications

1
i206 Distributed Computing Applications
Infrastructurehttp//courses.ischool.berkeley.ed
u/i206/s12/ Spring 2012
2
Welcome to i206!

• The Teaching Team
• Marti Hearst lthearst_at_ischoolgt
• Alex Chung ltachung_at_ischoolgt
• Monica Rosenberg ltmonica_at_ischoolgt
• To reach all three of us
• Lets try using Piazza
• http//piazza.com/classspring2012/info206/

3
Course Objectives

• Learn key computer science concepts.
• CSs greatest hits
• Jargon changes, first principles dont
• Be able to communicate with engineers.
• Peer inside the black box.
• Catch up on missing math background.
• Prepare you for other technical courses.

4
206Concept Map
Distributed Systems
Security
Cryptography
Network
Standards Protocols
Inter-process Communication
Methodologies/ Tools
Principles
OperatingSystem
Application
Design
Formal models
Process
I/O
Program
Algorithms
Analysis
Memory hierarchy
Memory
Compiler/ Interpreter
Assembly Instructions
Data Structures
Machine Instructions
CPU
Data storage
Circuits
Gates
Data compression
Number Systems
Data
Boolean Logic
Data Representation
Binary Numbers
Bits Bytes
5
Typical CS Topics Not Covered in 206

• Database, data management, info retrieval,
• Artificial intelligence data mining, NLP,
  robotics, computer vision,
• Computer graphics
• HCI
• Languages and Compilers
• Theory

6
i206 Course History

• One of the 3 original MIMS core courses
• 202, 204 (now 203 and 205), 206
• Assumed deep knowledge of CS
• Focused on security and networking
• Programming in java
• In 2001, i255 (Foundations of Software Design)
  introduced to help less technical students
• Did not cover networking, security
• In 2005, i255 merged with i206
• This explains why the course title doesnt really
  fit
• The slides and assignments will be a blend of
  mine from i255 and John Chuangs from i206.

7
Learning Opportunities

• Lectures
• Do readings in advance
• Discussion encouraged in lecture
• Readings
• Brookshear, Computer Science An Overview, 10th
  Edition
• Wikipedia and other readings as needed
• Labs
• Lead by the TAs
• Practice concepts from lecture or programming
  exercises
• Get your questions answered
• Homework
• Deepen your understanding of the ideas covered in
  class.

8
Learning Opportunities

• We will all learn from one another!
• There are no stupid questions in this course
• Lets try the Piazza tool for asking and
  answering questions online.
• http//piazza.com/classspring2012/info206/

9
Administrivia

• Grading Criteria
• Assignments 60 (7 assignments)
• Must be turned in on time (or points reduced)
• Tests 30 (three in-class tests)
• Class participation 10
• Refer to website for important policies
• Academic integrity
• Grading policy (including early/late submissions)
• Instructors availability
• Classroom technology etiquette

10
Life after 206MIMS Technology Requirement
206 (4 units)
2nd Course
electives

• 290TA. Information Organization Lab
• 219. Privacy, Security, and Cryptography
• 240. Principles of Information Retrieval
• 242. XML Foundations
• 250. Computer-Based Communications Systems and
  Networks
• 256. Applied Natural Language Processing
• 257. Database Management
• 290. Web Architecture
• 290. Mixing and Remixing Information
• 290. Social Computing
• 290A. XML and Databases
• Selected EECS courses
• Additional courses (of at least 2 units), on
  approval by the faculty

• Computer architecture
• Software
• Software design
• Algorithms
• Data structures
• Communications
• Distributed systems
• Networking
• Security

See Masters Student Manual for updates
11
Life after MIMS
Source John Sargent, US Department of Commerce
12
CS Career Advice

• Join the ACM (Association of Computing Machinery)
• and one or more SIGs (e.g., SIGCHI, SIGCOMM,
  SIGecom)
• Read the monthly CACM
• Attend ACM conferences

13
An i206 Tradition

• xkcd.com/rss.xml

14
Upcoming Reading Assignments

• For hyperlinked readings, see course website
• http//courses.ischool.berkeley.edu/i206/s12/
• For Lab tomorrow
• Python exercise
• For Thursday
• Brookshear 0.1, 0.3, 0.4, 1.4, 1.5, 1.8, 1.9
• For next week
• Brookshear 1.1, 2.1 2.4

15
Next time How Do Computers Work?
16
Lets get to know one another