Online study resources available anywhere, at any time
High-quality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
We are not endorsed by this school |
- Course Hero has verified this tag with the official school catalog
We are sorry, there are no listings for the current search parameters.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
School: Caltech
Course: Decidability And Tractability
Outline Challenges to the (extended) ChurchTuring Thesis CS21 Decidability and Tractability randomized computation quantum computation Lecture 26 March 11, 2013 March 11, 2013 CS21 Lecture 26 course summary 1 Extended Church-Turing Thesis the belief
School: Caltech
Course: CS 21
CS 21 Decidability and Tractability Winter 2012 Final Exam Solutions Posted: March 16 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) First, the problem is in PSPACE, for the usual reason for 2-player games. Giv
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Out: March 13 Due: March 20, noon This is a nal exam. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Introduction To Programming Methods
Dynamic Programming: The Edit Distance Problem CS 2: Introduction to Programming Methods 8 February 2006 Today A review of dynamic programming. The Edit Distance problem. CS 2: Introduction to Programming Methods http:/www.cs.caltech.edu/courses/cs2/ The
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Midterm Out: February 6 Due: February 13 This is a midterm. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2012 Midterm Solutions Out: February 13 1. (a) The language L1 is context free but not regular. To see it is context free, consider the NPDA that rst pushes as onto the stack until it sees the rst b, then pops as
School: Caltech
Course: Computer Language Shop
CS11 Advanced C+ FALL 2015-2016 LECTURE 1 Welcome! u Advanced C+ track is a deeper dive into C+ u More advanced language features u More use of the C+ standard library and the STL u Development tools for larger projects u Assumes general familiarity with
School: Caltech
Course: Logic Model Checking For Formal Software Verification
1 2 3 4 5 6 7 8 9 10 11 12 13
School: Caltech
Course: Quantum Computation
CS 294-2 Spring 2007 Abelian HSP + Discrete Log Lecture 9 2/14/07 Abelian Hidden Subgroup Problem + Discrete Log 1 Fourier transforms over nite abelian groups Let G be a nite abelian group. The characters of G are homomorphisms j : G C. There are exactly
School: Caltech
CS/Ec133 Notes - DRAFT John O. Ledyard October 13, 2013 BEWARE. These are notes intended to capture (and augment and correct) presentations from classes on these subjects. They are hastily written (I do not want to be a book author) and so are not serious
School: Caltech
Course: Complexity Theory
Complexity Theory Classify problems according to the computational resources required CS151 Complexity Theory Lecture 1 April 2, 2013 running time storage space parallelism randomness rounds of interaction, communication, others Attempt to answer: what is
School: Caltech
Course: Complexity Theory
Extended Church-Turing Thesis consequence of extended Church-Turing Thesis: all reasonable physically realizable models of computation can be efficiently simulated by a TM CS151 Complexity Theory Lecture 2 April 4, 2013 e.g. multi-tape vs. single tape T
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Recap: Internet overview Some basic mechanisms n Packet switching n Addressing n Routing o hierarchical (AS), forwarding, shortest path routing,
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 4 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to, not re
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacement
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 3 Ethernet Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacemen
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Steven Low CMS, EE, Caltech Fall 2012 Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacement for class attendance Internet applic
School: Caltech
Course: Introduction To Relational Databases
FINAL EXAM REVIEW CS121: Introduction to Relational Database Systems Fall 2014 Lecture 27 Final Exam Overview 2 ! 6 hours, multiple sittings Open ! book, notes, MySQL database, etc. (the usual) Primary topics: everything in the last half of the term DB
School: Caltech
Course: CS 21
CS 21 Decidability and Tractability Winter 2012 Final Exam Solutions Posted: March 16 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) First, the problem is in PSPACE, for the usual reason for 2-player games. Giv
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Out: March 13 Due: March 20, noon This is a nal exam. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Midterm Out: February 6 Due: February 13 This is a midterm. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Exam Solutions Posted: March 20 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) This problem is in PSPACE. We give a recursive algorithm. We are given a sequ
School: Caltech
Course: Introduction To Algorithms
CS38 Midterm Exam May 4, 2012 1. Due no later than Friday May 11, 2012 at 5:00pm in the computer lab. 2. This exam is not timed, plan your work as is convenient to you. 3. You may use the following resources during the exam: your own notes, homework probl
School: Caltech
Course: Computation, Computers, And Programs
Quiz3 1. (10) Prove that equality i = j of partial recursive functions is undecidable. 2. (10) Show that the time-bounded while-programs are primitive recursive. The time-bounded programs are defined as follows. For any while loop while x y do e done, the
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 First Assignment This assignment counts for 10% of the final grade. (late submissions lose 10 pts from the score, cumulatively each day at noon) Solutions are due: Noon, 22 January 2013 via email to gerard@spinroot.com (plain
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Second Assignment This assignment counts for 10% of the final grade. (late submissions lose 10 pts from the score, cumulatively each day at noon) Solutions are due: Noon, 29 January 2013 via email to gerard@spinroot.com (plain
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Third Assignment This assignment counts for 10% of the final grade. Solutions are due: Noon, 5 February 2013 (10 pts are deducted if submitted late, cumulatively each day at noon) via email to gerard@spinroot.com 1) (20 pts) C
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Fourth Assignment This assignment counts for 10% of the final grade. Solutions are due: Noon, Thursday 14 February 2013 Reminder: there is no lecture on Tuesday February 12. (10 pts deducted if submitted late, cumulatively eac
School: Caltech
October 14, 2013 Ec/CS 133 Problem Set #1 revised Answers due Monday October 21 , 5 PM in box outside of my oce Baxter 102. Question 1 A company has 2 plants with which it can produce units of output. The cost functions 2 2 of the plants are C 1 (y1 ) = 1
School: Caltech
November 3, 2013 Ec/CS 133 Problem Set #2 Problems due Nov 13, in class. Question 1 There is a 3 bus power system. On node 1 there is a generator B and a 400 MW load. On node 2 there is a generator A and an 80 MW load. On node 3 there are 2 generators, C
School: Caltech
Course: Computer Language Shop
C track: assignment 5 Goals In this assignment you will write a program to simulate a simple one-dimensional cellular automaton, which are related to (but are not the same as) two-dimensional cellular automata like Conway's game of Life. We will use this
School: Caltech
Course: Computer Language Shop
C track: assignment 8: Implementing a virtual machine Goals This lab is the last assignment in this track. By now you know almost all the important aspects of the C language, with the exception of a few features like function pointers which aren't really
School: Caltech
Course: Computer Language Shop
C track: assignment 7 Goals This week, we are going to move beyond a discussion of built-in features of the C language (we've covered most of them already) and continue discussing how to implement fundamental data structures in C. The data structure we wi
School: Caltech
Course: Computer Language Shop
C track: assignment 6 Goals In this assignment you will write a sorting program similar to the program from lab 3, except that it uses linked lists instead of arrays to hold the list of numbers read in off the command line. In the process, you will learn
School: Caltech
Course: Introduction To Relational Databases
Transaction Processing Transaction: application-level operation requiring multiple DB operations Data integrity is assured if transactions satisfy the following: Atomicity Either all operations of a tx appear in database or none do Consistency Execution
School: Caltech
Fall 2013 Syllabus CS/EC 133: Electricity Markets Meets Wednesday- Friday: 1- 230 pm in Baxter 25. Instructor: John Ledyard Office: Baxter 102, x8482, Email: jledyard@caltech.edu, Office Hours:
School: Caltech
Course: Decidability And Tractability
CS21: Decidability and Tractability course information and tentative schedule Catalog description: This course introduces the formal foundations of computer science, the fundamental limits of computation, and the limits of ecient computation. Topics will
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2011 Course Summary and Syllabus Lecturer: Chris Umans Date: March 29 Course summary: Complexity Theory attempts to answer the question: What is computationally feasible given limited computational resources? In this course
School: Caltech
Course: Introduction To Computer Science Research
CS 9 Introduction to Computer Science Research Fall 2011 Course Summary and Syllabus Date: October 5 This course will introduce the research areas of the computer science faculty, through weekly overview talks by the faculty aimed at rst-year undergraduat
School: Caltech
Course: Decidability And Tractability
Outline Challenges to the (extended) ChurchTuring Thesis CS21 Decidability and Tractability randomized computation quantum computation Lecture 26 March 11, 2013 March 11, 2013 CS21 Lecture 26 course summary 1 Extended Church-Turing Thesis the belief
School: Caltech
Course: CS 21
CS 21 Decidability and Tractability Winter 2012 Final Exam Solutions Posted: March 16 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) First, the problem is in PSPACE, for the usual reason for 2-player games. Giv
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Out: March 13 Due: March 20, noon This is a nal exam. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Introduction To Programming Methods
Dynamic Programming: The Edit Distance Problem CS 2: Introduction to Programming Methods 8 February 2006 Today A review of dynamic programming. The Edit Distance problem. CS 2: Introduction to Programming Methods http:/www.cs.caltech.edu/courses/cs2/ The
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Midterm Out: February 6 Due: February 13 This is a midterm. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2012 Midterm Solutions Out: February 13 1. (a) The language L1 is context free but not regular. To see it is context free, consider the NPDA that rst pushes as onto the stack until it sees the rst b, then pops as
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Exam Solutions Posted: March 20 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) This problem is in PSPACE. We give a recursive algorithm. We are given a sequ
School: Caltech
Course: CS 21
CS 21 Decidability and Tractability Winter 2012 Problem Set 1 Out: January 11 Due: January 18 Reminder: you are encouraged to work in groups of two or three; however you must turn in your own write-up and note with whom you worked. You may consult the cou
School: Caltech
Course: Introduction To Algorithms
CS38 Midterm Exam May 4, 2012 1. Due no later than Friday May 11, 2012 at 5:00pm in the computer lab. 2. This exam is not timed, plan your work as is convenient to you. 3. You may use the following resources during the exam: your own notes, homework probl
School: Caltech
Course: Python
Linus Torvalds CS 1 Linux Tutorial September 29, 2010 Linux mascot Linux: Introduction You've probably heard of the Windows and Mac OS X operating systems Linux is another popular one (its free too!) All the CS cluster machines run Linux CS cluster = co
School: Caltech
Course: Python
Lecture 16: November 22, 2010 Odds and Ends, part 2 Caltech CS 1: Fall 2010 Class inheritance Raising exceptions using raise Creating your own exception classes The pass keyword Caltech CS 1: Fall 2010 A variety of topics that don't fit neatly into any ca
School: Caltech
Course: Python
Lecture 18: November 24, 2010 Regular Expressions th.*g ^th.*g$ th?nksg.*g Caltech CS 1: Fall 2010 th[an]cfw_2.*g th[a-z]*g th[^ ]*g Odds and ends (no specific topic) Caltech CS 1: Fall 2010 Regular expressions (advanced string processing) Caltech CS 1:
School: Caltech
Course: Python
Lecture 19: November 29, 2010 Advanced topics, part 1 Caltech CS 1: Fall 2010 Regular expressions Caltech CS 1: Fall 2010 Advanced topics, lecture 1 recursion first-class functions lambda expressions higher-order functions map, filter, reduce Caltech C
School: Caltech
Course: Python
Lecture 20: December 1, 2010 Advanced topics, part 2 Caltech CS 1: Fall 2010 Advanced topics, lecture 1 recursion first-class functions lambda expressions higher-order functions map, filter, reduce Caltech CS 1: Fall 2010 Advanced topics, lecture 2 c
School: Caltech
Course: Python
Lecture 7: October 18, 2010 Odds and Ends Caltech CS 1: Fall 2010 while break Files loops opening, closing, reading from files Caltech CS 1: Fall 2010 A smorgasbord of topics: More on booleans More on loops looping over files with for The range func
School: Caltech
Course: Computer Language Shop
CS 11 C track: lecture 1 n Preliminaries n Need a CS (CMS) cluster account n http:/www.cs.caltech.edu/ cgi-bin/sysadmin/account_request.cgi ITS tutorial linked from track home page www.cs.caltech.edu/courses/cs11/material/c/mike n Need to know UNIX n n Tr
School: Caltech
Course: Computer Language Shop
CS 11 C track: lecture 5 n n Last week: pointers This week: n n n n Pointer arithmetic Arrays and pointers Dynamic memory allocation The stack and the heap Pointers (from last week) n n Address: location where data stored Pointer: variable that holds an a
School: Caltech
Course: Computer Language Shop
CS 11 C track: lecture 2 Last week: basics of C programming compilation data types (int, float, double, char, etc.) operators (+ - * / = = += etc.) functions conditionals loops preprocessor (#include) This week Preprocessor (#define) Operators and pre
School: Caltech
Course: Python
Lecture 16: November 17, 2010 Inheritance Caltech CS 1: Fall 2010 Exception handling catching exceptions outside of the function that raised the exception the runtime stack Caltech CS 1: Fall 2010 Class inheritance subclass, superclass polymorphism dem
School: Caltech
Course: Python
Lecture 15: November 15, 2010 Exception Handling, part 2 Caltech CS 1: Fall 2010 ! Exception handling ! How to recover from errors ! The try/except statement ! Exception objects ! Raising and catching exceptions ! Catch-all exception handlers Caltech CS 1
School: Caltech
Course: Python
Lecture 8: October 20, 2010 Dictionaries Caltech CS 1: Fall 2010 A bunch of mostly-unrelated topics: Booleans and boolean operators Using for loops with files The range function Tuples The enumerate function Sequence slices Caltech CS 1: Fall 2010 Bin
School: Caltech
Course: Python
Lecture 9: October 25, 2010 Testing and Graphics Caltech CS 1: Fall 2010 Binary and hexadecimal numbers Dictionaries Caltech CS 1: Fall 2010 Testing your code Introduction to computer graphics continued next class Keyword arguments Caltech CS 1: Fall
School: Caltech
Course: Python
Lecture 10: October 27, 2010 More Graphics and Event Handling Caltech CS 1: Fall 2010 Testing Graphics Introductory concepts GUIs, pixels, pixel coordinates Python graphics with Tkinter Caltech CS 1: Fall 2010 More graphics Additional graphics eleme
School: Caltech
Course: Python
Lecture 11: November 1, 2010 Graphics 3: More Event Handling Caltech CS 1: Fall 2010 Graphics lines, circles, ovals event handling mainloop() Caltech CS 1: Fall 2010 Event handling bind key presses, mouse clicks using events Graphical object "handles
School: Caltech
Course: Python
Lecture 6: October 13, 2010 Loops and Files Caltech CS 1: Fall 2010 Loops using the for statement Decision-making with if/elif/else Caltech CS 1: Fall 2010 loops The break statement Files while opening and closing the readlines() and readline() functio
School: Caltech
Course: Python
Lecture 12: November 3, 2010 Classes Caltech CS 1: Fall 2010 Event handling in graphical programs Key events Mouse button events Callback functions bind Global variables Caltech CS 1: Fall 2010 Finish off discussion of global variables Classes and obj
School: Caltech
Course: Python
Lecture 13: November 8, 2010 More classes Caltech CS 1: Fall 2010 Classes and object-oriented programming, part 1 The class statement creating your own objects Constructors Defining new methods Caltech CS 1: Fall 2010 We'll use classes to develop a reali
School: Caltech
Course: Python
Lecture 14: November 10, 2010 Exception Handling, part 1 Caltech CS 1: Fall 2010 Classes and graphical objects building a Square class methods for scaling, moving, deleting squares Caltech CS 1: Fall 2010 Exception handling How to recover from errors
School: Caltech
Course: Computer Language Shop
CS 11 C track: lecture 3 n This week: n Arrays n n one-dimensional multidimensional n n Command-line arguments Assertions Arrays n n What is an "array"? A way to collect together data of a single type in a single object A linear sequence of data objects e
School: Caltech
Course: Computer Language Shop
CS 11 C track: lecture 4 Last week: arrays This week: Recursion Introduction to pointers Lab 4 Harder than previous labs One non-obvious trick hints on web page email me if get stuck Support code supplied for you Read carefully! Recursion (1) Sh
School: Caltech
Course: Computer Language Shop
CS11 Advanced C+ FALL 2015-2016 LECTURE 1 Welcome! u Advanced C+ track is a deeper dive into C+ u More advanced language features u More use of the C+ standard library and the STL u Development tools for larger projects u Assumes general familiarity with
School: Caltech
Course: Logic Model Checking For Formal Software Verification
1 2 3 4 5 6 7 8 9 10 11 12 13
School: Caltech
Course: Quantum Computation
CS 294-2 Spring 2007 Abelian HSP + Discrete Log Lecture 9 2/14/07 Abelian Hidden Subgroup Problem + Discrete Log 1 Fourier transforms over nite abelian groups Let G be a nite abelian group. The characters of G are homomorphisms j : G C. There are exactly
School: Caltech
CS/Ec133 Notes - DRAFT John O. Ledyard October 13, 2013 BEWARE. These are notes intended to capture (and augment and correct) presentations from classes on these subjects. They are hastily written (I do not want to be a book author) and so are not serious
School: Caltech
Course: Complexity Theory
Complexity Theory Classify problems according to the computational resources required CS151 Complexity Theory Lecture 1 April 2, 2013 running time storage space parallelism randomness rounds of interaction, communication, others Attempt to answer: what is
School: Caltech
Course: Complexity Theory
Extended Church-Turing Thesis consequence of extended Church-Turing Thesis: all reasonable physically realizable models of computation can be efficiently simulated by a TM CS151 Complexity Theory Lecture 2 April 4, 2013 e.g. multi-tape vs. single tape T
School: Caltech
Course: Complexity Theory
Robust Time and Space Classes Robust time and space classes: CS151 Complexity Theory L = SPACE(log n) PSPACE = k SPACE(nk) Lecture 3 April 9, 2013 P = k TIME(nk) k EXP = k TIME(2n ) April 9, 2013 Relationships between classes A P-complete problem So far
School: Caltech
Course: Complexity Theory
Ladners Theorem Assuming P NP, what does the world (inside NP) look like? CS151 Complexity Theory NP: NPC NPC P Lecture 4 April 11, 2013 NP: P April 11, 2013 Ladners Theorem 2 Ladners Theorem Theorem (Ladner): If P NP, then there exists L NP that is neit
School: Caltech
Course: Probability And Algorithms
EE 150 Presentation Week 6 L. Xiao, M. Johansson, H. Hindi, S. Boyd, A. Goldsmith: "Joint Optimization of Communication Rates and Linear Systems" Ather Gattami, May 6, 2003 1 Problem Setup w LTI System z yr Network y w: exogenous signal, including noises
School: Caltech
Course: Introduction To Computer Science
CS1: Introduction to Computation Midterm Review Caltech CS 1 - Fall 2008 Midterm . on the web site Real Soon Now Find linked from CS 1 home page and in "schedule" section Due date: Tuesday, November 4, 5 PM Lab 5 also due Thurs night 2am (Nov. 6) yes,
School: Caltech
Course: Learning Complexity
Cant Decide? Undecide! Chaim Goodman-Strauss In my mathematical youth, when I rst learned of Gdels Theorem, and computational undecidability, o I was at once fascinated and strangely reassured of our limited place in the grand universe: incredibly mathema
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Recap: Internet overview Some basic mechanisms n Packet switching n Addressing n Routing o hierarchical (AS), forwarding, shortest path routing,
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 4 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to, not re
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacement
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Chapter 3 Ethernet Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacemen
School: Caltech
Course: Communication Networks
cs/ee 143 Communication Networks Steven Low CMS, EE, Caltech Fall 2012 Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacement for class attendance Internet applic
School: Caltech
Course: Introduction To Relational Databases
FINAL EXAM REVIEW CS121: Introduction to Relational Database Systems Fall 2014 Lecture 27 Final Exam Overview 2 ! 6 hours, multiple sittings Open ! book, notes, MySQL database, etc. (the usual) Primary topics: everything in the last half of the term DB
School: Caltech
Course: Introduction To Relational Databases
DATABASE TRANSACTIONS CS121: Introduction to Relational Database Systems Fall 2014 Lecture 26 Database Transactions 2 ! Many situations where a sequence of database operations must be treated as a single unit A combination of reads and writes that must b
School: Caltech
Course: Introduction To Relational Databases
PASSWORDS TREES AND HIERARCHIES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 25 Account Password Management 2 ! ! Mentioned a retailer with an online website Need a database to store user account details Username, ! ! password, ot
School: Caltech
Course: Introduction To Relational Databases
DATA WAREHOUSING II CS121: Introduction to Relational Database Systems Fall 2014 Lecture 24 Last Time: Data Warehousing 2 ! Last time introduced the topic of decision support systems (DSS) and data warehousing Very large DBs used to perform analytic oper
School: Caltech
Course: Introduction To Relational Databases
ALTERNATE SCHEMA DIAGRAMMING METHODS DECISION SUPPORT SYSTEMS CS121: Introduction to Relational Database Systems Fall 2014 Lecture 23 E-R Diagramming 2 ! E-R diagramming techniques used in book are similar to ones used in industry Still, ! plenty of vari
School: Caltech
Course: Introduction To Relational Databases
DATA STREAMS AND DATABASES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 22 Static and Dynamic Data Sets 2 ! So far, have discussed relatively static databases Data may change slowly over time Queries and updates operate against a
School: Caltech
Course: Introduction To Relational Databases
OBJECTS AND DATABASES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 21 Relational Model and 1NF 2 ! Relational model specifies that all attribute domains must be atomic A database schema is in 1NF if all attribute domains are atomi
School: Caltech
Course: Introduction To Relational Databases
FUNCTIONAL DEPENDENCY THEORY II CS121: Introduction to Relational Database Systems Fall 2014 Lecture 20 Last Time: Canonical Cover 2 Last time, introduced concept of canonical cover ! A canonical cover Fc for F is a set of functional dependencies such tha
School: Caltech
Course: Introduction To Relational Databases
FUNCTIONAL DEPENDENCY THEORY CS121: Introduction to Relational Database Systems Fall 2014 Lecture 19 Last Lecture 2 Normal forms specify good schema patterns ! First normal form (1NF): ! All attributes must be atomic Easy in relational model, harder/les
School: Caltech
Course: Introduction To Relational Databases
NORMAL FORMS CS121: Introduction to Relational Database Systems Fall 2014 Lecture 18 Equivalent Schemas 2 ! Many different schemas can represent a set of data Which one is best? What does best even mean? ! Main goals: Representation must be complete D
School: Caltech
Course: Introduction To Relational Databases
ADVANCED E-R FEATURES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 17 Extensions to E-R Model 2 ! ! Basic E-R model is good for many uses Several extensions to the E-R model for more advanced modeling Generalization and specializa
School: Caltech
Course: Introduction To Relational Databases
ENTITY-RELATIONSHIP MODEL III CS121: Introduction to Relational Database Systems Fall 2014 Lecture 16 N-ary Relationships 2 Can specify relationships of degree > 2 in E-R model ! Example: ! job title level employee employee_id employee_name Employees wor
School: Caltech
Course: Introduction To Relational Databases
ENTITY-RELATIONSHIP MODEL II CS121: Introduction to Relational Database Systems Fall 2014 Lecture 15 Last Lecture 2 ! Began to explore the Entity-Relationship Model A visual representation of database schemas Can represent entities and relationships Ca
School: Caltech
Course: Introduction To Relational Databases
DATABASE SCHEMA DESIGN ENTITY-RELATIONSHIP MODEL CS121: Introduction to Relational Database Systems Fall 2014 Lecture 14 Designing Database Applications 2 Database applications are large and complex ! A few of the many design areas: ! Database schema (ph
School: Caltech
Course: Introduction To Relational Databases
CS121 MIDTERM REVIEW CS121: Introduction to Relational Database Systems Fall 2014 Lecture 13 Before We Start 2 Midterm Overview 3 6 hours, multiple sittings ! Open book, open notes, open lecture slides ! No collaboration ! Possible Topics: ! Basically, e
School: Caltech
Course: Introduction To Relational Databases
SQL QUERY EVALUATION CS121: Introduction to Relational Database Systems Fall 2014 Lecture 12 Query Evaluation 2 ! Last time: Began looking at database implementation details How data is stored and accessed by the database Using indexes to dramatically
School: Caltech
Course: Introduction To Relational Databases
DATABASE PERFORMANCE AND INDEXES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 11 Database Performance 2 ! Many situations where query performance needs to be improved e.g. as data size grows, query performance degrades and tuning
School: Caltech
Course: Introduction To Relational Databases
SQL STORED ROUTINES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 9 SQL Functions 2 ! SQL queries can use sophisticated math operations and functions Can compute simple functions, aggregates Can compute and filter results ! Someti
School: Caltech
Course: Introduction To Relational Databases
ADVANCED SQL DDL CS121: Introduction to Relational Database Systems Fall 2014 Lecture 10 Advanced SQL DDL 2 ! Last time, covered stored procedures and user-defined functions (UDFs) Relatively simple but powerful mechanism for extending capabilities of a
School: Caltech
Course: Introduction To Relational Databases
SQL DDL II CS121: Introduction to Relational Database Systems Fall 2014 Lecture 8 Last Lecture 2 ! Covered SQL constraints NULL constraints CHECK constraints PRIMARY KEY constraints FOREIGN KEY constraints UNIQUE constraints NOT ! Impact of NULL valu
School: Caltech
Course: Introduction To Relational Databases
SQL DATA DEFINITION: KEY CONSTRAINTS CS121: Introduction to Relational Database Systems Fall 2014 Lecture 7 Data Definition 2 Covered most of SQL data manipulation operations ! Continue exploration of SQL data definition features ! Specifying tables and
School: Caltech
Course: Introduction To Relational Databases
SUBQUERIES AND VIEWS CS121: Introduction to Relational Database Systems Fall 2014 Lecture 6 String Comparisons and GROUP BY 2 Last time, introduced many advanced features of SQL, including GROUP BY ! Recall: string comparisons using = are case-insensitive
School: Caltech
Course: Introduction To Relational Databases
SQL QUERIES CS121: Introduction to Relational Database Systems Fall 2014 Lecture 5 SQL Queries 2 SQL queries use the SELECT statement ! General form is: ! SELECT A1, A2, . FROM r1, r2, . WHERE P; ri are the relations (tables) Ai are attributes (columns)
School: Caltech
Course: Introduction To Relational Databases
SQL OVERVIEW CS121: Introduction to Relational Database Systems Fall 2014 Lecture 4 SQL 2 SQL = Structured Query Language ! Original language was SEQUEL ! IBMs System R project (early 1970s) Structured English Query Language ! Caught on very rapidly Si
School: Caltech
Course: Introduction To Relational Databases
RELATIONAL ALGEBRA II CS121: Introduction to Relational Database Systems Fall 2014 Lecture 3 Last Lecture 2 Query languages provide support for retrieving information from a database ! Introduced the relational algebra ! A procedural query language Six
School: Caltech
Course: CS 21
CS 21 Decidability and Tractability Winter 2012 Final Exam Solutions Posted: March 16 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) First, the problem is in PSPACE, for the usual reason for 2-player games. Giv
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Out: March 13 Due: March 20, noon This is a nal exam. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Midterm Out: February 6 Due: February 13 This is a midterm. You may consult only the course notes and the text (Sipser). You may not collaborate. The full honor code guidelines can be found in the course syl
School: Caltech
Course: Decidability And Tractability
CS 21 Decidability and Tractability Winter 2013 Final Exam Solutions Posted: March 20 If you have not turned in the nal, obviously you should not consult these solutions. 1. (a) This problem is in PSPACE. We give a recursive algorithm. We are given a sequ
School: Caltech
Course: Introduction To Algorithms
CS38 Midterm Exam May 4, 2012 1. Due no later than Friday May 11, 2012 at 5:00pm in the computer lab. 2. This exam is not timed, plan your work as is convenient to you. 3. You may use the following resources during the exam: your own notes, homework probl
School: Caltech
Course: Computation, Computers, And Programs
Quiz3 1. (10) Prove that equality i = j of partial recursive functions is undecidable. 2. (10) Show that the time-bounded while-programs are primitive recursive. The time-bounded programs are defined as follows. For any while loop while x y do e done, the
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Final Solutions Posted: June 10 Chris Umans 1. (a) The procedure that traverses a fan-in 2 depth O(logi n) circuit and outputs a formula runs in Li this can be done by a recursive depth-rst traversal, which only requir
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Midterm Solutions Posted: May 9 Chris Umans 1. Consider a language L coNEXP. On an input of length n, the advice will be an exact count of the number of inputs of length n not in the language. This is a number between
School: Caltech
Course: Fundamentals Of Computer Programming
make-inventory: inv: Result: 15 param: nil body: (let ) total: 0 -> 10 -> 15 items: 'pencils 'stapler param: op . args body: (cond ) op: 'add-item! args: (list 'stapler 10) op: 'add-item! args: (list 'pencils 5) op: 'total-value args: (list) Result: 15
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2011 Final Out: May 26 Due: 1pm June 2 This is a nal exam. You may consult any of the course materials and the text (Papadimitriou), but not any other source or person. There are 4 problems on three pages. Please attempt al
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2011 Final Solutions Posted: June 3 Chris Umans 1. (a) The procedure that traverses a fan-in 2 depth O(logi n) circuit and outputs a formula runs in Li this can be done by a recursive depth-rst traversal, which only require
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 First Assignment This assignment counts for 10% of the final grade. (late submissions lose 10 pts from the score, cumulatively each day at noon) Solutions are due: Noon, 22 January 2013 via email to gerard@spinroot.com (plain
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Second Assignment This assignment counts for 10% of the final grade. (late submissions lose 10 pts from the score, cumulatively each day at noon) Solutions are due: Noon, 29 January 2013 via email to gerard@spinroot.com (plain
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Third Assignment This assignment counts for 10% of the final grade. Solutions are due: Noon, 5 February 2013 (10 pts are deducted if submitted late, cumulatively each day at noon) via email to gerard@spinroot.com 1) (20 pts) C
School: Caltech
Course: Logic Model Checking For Formal Software Verification
Logic Model Checking, CS 118 Fourth Assignment This assignment counts for 10% of the final grade. Solutions are due: Noon, Thursday 14 February 2013 Reminder: there is no lecture on Tuesday February 12. (10 pts deducted if submitted late, cumulatively eac
School: Caltech
October 14, 2013 Ec/CS 133 Problem Set #1 revised Answers due Monday October 21 , 5 PM in box outside of my oce Baxter 102. Question 1 A company has 2 plants with which it can produce units of output. The cost functions 2 2 of the plants are C 1 (y1 ) = 1
School: Caltech
November 3, 2013 Ec/CS 133 Problem Set #2 Problems due Nov 13, in class. Question 1 There is a 3 bus power system. On node 1 there is a generator B and a 400 MW load. On node 2 there is a generator A and an 80 MW load. On node 3 there are 2 generators, C
School: Caltech
November 21, 2013 Ec/CS 133 Problem Set #3 Due date: Dec 4 (in class) We plan to have it graded by Dec 6 in class. Question 1 (Forward and spot markets) The California ISO has a service called convergence bidding. You can nd a description at http:/www.cai
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 1 Posted: April 11 Chris Umans 1. Let A be a language that is downward self-reducible. Given an input x, we simulate the polynomial-time computation that (with queries) decides A, and recursively compute t
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 2 Posted: April 18 Chris Umans 1. Suppose L NP coNP. Then there exist languages R1 and R2 in P for which L = cfw_x : y, |y | |x|k1 , (x, y ) R1 L = cfw_x : z, |z | |x|k2 , (x, z ) R2 On input x, our stro
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 3 Posted: April 25 Chris Umans 1. (a) Note: it is most convenient to think of as the permutation k ( (k ) rather than the more conventional k ( (k ) the two notions are equivalent by taking inverses; howev
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 4 Posted: May 2 Chris Umans If you are turning in this problem set late, obviously you shouldnt consult these solutions. 1. Consider a language L ZPP decided by a machine M that runs in expected time nk fo
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 5 Posted: May 16 Chris Umans 1. We are given a Boolean circuit C on n variables x1 , x2 , . . . , xn with m , and gates. Our 3-CNF formula will have m auxiliary variables z1 , z2 , . . . , zm in addition t
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 6 Posted: May 23 Chris Umans 1. (a) We observe that the largest possible set shattered by a collection of 2m subsets is m, since a set of size m + 1 has more than 2m distinct subsets. The VC dimension of a
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2013 Solution Set 7 Posted: May 30 Chris Umans Obviously, if you have not yet turned in Problem Set 7, you shouldnt consult these solutions. 1. (a) Let pi = Pry [f (x + y ) f (y ) = i]. The probability two random voters dis
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2011 A Sample LTEX Template March 27, 2011 (Your Name) 1. Please remember that homework solutions should be: Clear Concise Precise Legible (if handwritten). 2. An example1 : (Yes) According to the fundamental theorem of
School: Caltech
CS/EE 147 Assigned: 05/25/10 HW 7: Scheduling Guru: Raga Due: 06/04/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list all the people
School: Caltech
CS/EE 147 Assigned: 05/13/10 HW 6: Transform world Guru: Lina Due: 05/26/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list all the pe
School: Caltech
CS/EE 147 Assigned: 05/06/10 HW 5: Queueing networks and PH distributions Guru: Raga Due: 05/14/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework
School: Caltech
CS/EE 147 Assigned: 04/27/10 HW 4: Queueing games Guru: Lina Due: 05/07/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list all the peo
School: Caltech
CS/EE 147 Assigned: 4/13/10 HW 3: Practice with CTMCs Guru: Raga Due: 4/28/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list all the
School: Caltech
HW 2: Practice with DTMCs CS/EE 147 Assigned: 04/06/10 Guru: Lina Due: 04/16/10, Ragas mailbox, 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list all th
School: Caltech
CS/EE 147 Assigned: 03/30/10 HW 1: Probability Refresher Guru: Raga Due: 04/09/10, Ragas mailbox1 , 1pm We encourage you to discuss these problems with others, but you need to write up the actual solutions alone. At the top of your homework sheet, list al
School: Caltech
Course: Computer Language Shop
C track: assignment 5 Goals In this assignment you will write a program to simulate a simple one-dimensional cellular automaton, which are related to (but are not the same as) two-dimensional cellular automata like Conway's game of Life. We will use this
School: Caltech
Course: Computer Language Shop
C track: assignment 8: Implementing a virtual machine Goals This lab is the last assignment in this track. By now you know almost all the important aspects of the C language, with the exception of a few features like function pointers which aren't really
School: Caltech
Course: Computer Language Shop
C track: assignment 7 Goals This week, we are going to move beyond a discussion of built-in features of the C language (we've covered most of them already) and continue discussing how to implement fundamental data structures in C. The data structure we wi
School: Caltech
Course: Computer Language Shop
C track: assignment 6 Goals In this assignment you will write a sorting program similar to the program from lab 3, except that it uses linked lists instead of arrays to hold the list of numbers read in off the command line. In the process, you will learn
School: Caltech
Course: Introduction To Relational Databases
Transaction Processing Transaction: application-level operation requiring multiple DB operations Data integrity is assured if transactions satisfy the following: Atomicity Either all operations of a tx appear in database or none do Consistency Execution
School: Caltech
Fall 2013 Syllabus CS/EC 133: Electricity Markets Meets Wednesday- Friday: 1- 230 pm in Baxter 25. Instructor: John Ledyard Office: Baxter 102, x8482, Email: jledyard@caltech.edu, Office Hours:
School: Caltech
Course: Decidability And Tractability
CS21: Decidability and Tractability course information and tentative schedule Catalog description: This course introduces the formal foundations of computer science, the fundamental limits of computation, and the limits of ecient computation. Topics will
School: Caltech
Course: Complexity Theory
CS 151 Complexity Theory Spring 2011 Course Summary and Syllabus Lecturer: Chris Umans Date: March 29 Course summary: Complexity Theory attempts to answer the question: What is computationally feasible given limited computational resources? In this course
School: Caltech
Course: Introduction To Computer Science Research
CS 9 Introduction to Computer Science Research Fall 2011 Course Summary and Syllabus Date: October 5 This course will introduce the research areas of the computer science faculty, through weekly overview talks by the faculty aimed at rst-year undergraduat