EE122 - Instruments, Components, Simulation, and the Design Process
Prof. Greg Kovacs Department of Electrical Engineering Stanford University
Photo from the Archives
EE122, Stanford University, Prof. Greg Kovacs
2
Basic Tools
Multimeter. Power supply. S
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262Discrete Stochastic Processes Problem Set #12 Issued: May 12, 2002 Not due
Problem 1 Exercise 7.28 of the class notes. Problem 2
a Let X, Y, Z be random v
We denote a transition in which the Poisson clock for vertex #i has an arrival and immediately vertex #i takes the opinion of one of its neighbors, vertex #j, by i j . Suppose for example the first 4 transitions are, in sequence: 2 3, 1 2, 3 4, 1 2 . The
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes
Problem Set # 11
Issued: May 3, 2010 Due: May 7, 2010 Extensions until May 12 readily granted.
1) The Voter Problem (Part I
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 10 Solutions due: Friday, April 30, 2010
Problem 2 (Voter Problem, Part I)
a) For a three-state model, there are three independent Poisson processes each with rate 1. The corresponding merged pr
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes
Problem Set # 10
Issued: April 23, 2010 Due: April 30, 2010
1) Please go over your midterm quiz and re-work every part on w
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 9 Solutions due: Friday, April 23, 2010
Problem 1 (Exercise 5.10)
a) M/M/1: From (5.40), we have i = i (1 ) for i 0 where = / and < 1 (positive recurrent). M/M/m: First note that in the Markov c
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes
Problem Set # 9
Issued: April 16, 2010 Due: April 23, 2010
Reading: Sections 6.1 6.3 1) Exercise 5.10 (Use figure 5.5 rathe
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 8 Solutions due: Friday, April 14, 2010
Problem 1 (Exercise 5.1)
Let cfw_Pij | i, j N be the set of transition probabilities for a countable state Markov chain. For each i, j , let Fij (n) be th
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Problem Set #8 Issued: April 10, 2010 Due: April 16, 2010
Reading : For this problem set, please study all of Sections 5.1
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 7 Solutions due: Friday, April 2, 2010
Problem 1 (Exercise 3.8)
a) Additionally conditioning on N (t) = n greatly simplies the problem, so let us rst consider the quantity P (Y (t) > x|Z (t) = s
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Problem Set #7 Issued: March 19, 2010 Due: April 2, 2010
Reading : For this week, study Section 3.7 carefully and skim Sect
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 6 Solutions due: Friday, March 19, 2010
Problem 1 (Exercise 3.6)
Let Y (t) denote the residual life at time t, that is Y (t) = SN (t)+1 t, and let the inter-renewal times be distributed as fX (x
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Problem Set #6 Issued: March 12, 2010 Due: March 19, 2010
Reading: Finish sections 3.5 and 3.6. Next week: Study Section 3.
6.262 Discrete Stochastic Processes, Spring 2010 Problem Set 5 Solutions due: Friday, March 12, 2010
Problem 1 (Exercise 3.4)
To show equality between events, we proceed as follows. Given events A and B , A = B if and only if for any given A we can show t
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Problem Set #5 Issued: March 5, 2010 Due: March 12, 2010
Reading: For this week, read sections 3.1 3.4 of Chapter 3 in the
61/562 Discrete Stochastic Processes, Spring 2010 Problem Set 4 Solutions due: Friday, March 5, 2010
Problem 1 (Exercise 2.22)
a Each of the 1000 voters vote independently for A with probability 1/2 each, so P (n votes for A|1000 voters) = for n = 0, 1, .
Operational Amplifiers: Basic Concepts
Prof. Greg Kovacs Department of Electrical Engineering Stanford University
Design Note: The Design Process
Definition of function - what you want. Block diagram - translate into circuit functions. First Design Revie
Frequency Dependent and Nonlinear Circuits
Prof. Greg Kovacs Department of Electrical Engineering Stanford University
OH GREAT! MORE OP-AMP CIRCUITS!
OBJECTIVES (Why am I sitting in this classroom?) To gain insight into op-amp application circuits beyond
Interface Circuits: Hooking Up To The Outside World
Prof. Greg Kovacs Department of Electrical Engineering Stanford University
Design Note: The Design Process
Definition of function - what you want. Block diagram - translate into circuit functions. First
Homework 5 Solutions
EE5531 Fall 2015
Chapter 10 Problems:
EE 5531 Probability and Stochastic Processes
Fall Semester 2015
Monday November 2, 2015
Homework 5 Solution to the First Exercise
1) Let X and Y be
EE 5531 Probability and Stochastic Processes
Fall Semester 2015
Monday November 9, 2015
Homework 7 Due Monday November 16, 2015 at 12:05pm
Exercises:
1) Let U be an m 1 zero-mean random vector with covariance matrix CU , and let V be an
n 1 zero-mean rand