šŸ·ļø LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION ā†’
Log in
HomeClass Notes1,200,000CA670,000

ECE242 Lecture Notes - Lecture 1: Virginia State Route 10, Horse Length

59 views7 pages
ochreox820
8 May 2016
School
University of Waterloo
Department
Electrical and Computer Engineering
Course
ECE242
Professor
David Nairn

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Ic = 0. 5 ma, ro = 100 k . Ic = 0. 25 ma, ro = 200 k . Ic = 1. 0 ma, ro = 50 k . Ic = 2. 0 ma, ro = 25 k vi. Determine amplifier biasing (cid:149) assume input signal = 0 (cid:149) if unknown, assume vo = 0. +10 v gm = ic/vt = 10 ma/v ro = va/ic = 200 k r = vt/ib = 10 k vi. 4. 6 k gm = ic/vt = 40 ma/v. Rout >> 50 k r = vt/ib = 2. 5 k vo2. Q4 gm = 80 ma/v ro = 25 k r = 1. 25 k re = 12. 5 vo. 4. 6k re = 25 gm3v 3 gm3 = 40 ma/v gm1 = gm2 = 10 ma/v gm1v s1 ro1 gm2v 2 ro2 v 2 vi. 488 vo vo2 ro4//25k //rl re4+ ro4//25k //rl vo vi vo1. Note the effect of a finite rl on the gain of stage 2.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

ECE242 Lecture Notes - Lecture 8: Low Frequency, Parasitic Capacitance
ochreox820
ECE242 Lecture Notes - Lecture 10: Low Frequency
ochreox820
ECE242 Lecture Notes - Lecture 3: Active Load, Virtual Ground, International Data Group
ochreox820

Related Questions

COMP 2021Winter 2010 - Final Examination Pape 11 110 6 . The two classes low compile without me. What is displayed when the main() method of class Nightmareix is executed? Clearly indicate the program output in the appropriate space ca pe You may use the other lank space as a scratch pad to track the state of memesy as the program escoles, but the contents of this other space will not he graded The definition of the Pair claw public cla Pair private int left: private int right publie Pairintit T left- right - public void nix (Pair pl loft - P.left public string toitring) return "IL... lort R right "1" The definition of the NightmareMix class public class Nightmareix public static void mix Inta (int il, int 12) public static void mixArraywithint fint 11 a, int i, int v) 11 - V public static void mixArrayaor Int(int il al, intl a2) public static void mixMatrixWithint fint 11111121 - m int 11, int 12, int v public static void mixMatrix WithArray (int 11 11- , int i, intila) public static void mixlar Addresses Pair pl, Pair 2) pl - p2 public static void mixArrayWithPairState (Pair) a, int i, Pair pl public static void mixArrayWithPairAddress (Pairla, int i, Pair p) ali - P; public static void mixArrayaoraira (Pairil al, Pairil a2) public static void main(Stringil arga) int myV1 - 1; int myV2 - 2; int my = (3, 4) int my2 = 5, 6) into myM1 , 8 9, 10}} Pair myP1 = new Pair (11, 12) Pair myP2 = new Pair (13, 14) Pair myPA (neu Pair (15, 16), new pair(17, 18) Pair myPA2 = (neu Pair (19, 20), new pair (21, 22) mixInita (myvi, myV2); mixArrayWith Int (myal, 0, myv2); mixArraysOfIntinyal, myA2); MixMatrixWithint (myM, 0, 0, myV2); mixArrayaofTnt (HyMIO, myM[1); mixMatrixWithArray (wy, , WyA2); mixArraywithint nyA2, 0, myV2); mixPair Addresses (wypi, myP2); RixPairAddren (HyPALIO), WPAI[1]); mixArraywithPairstate (myPA2, 0, 1); mixArraywithPairAddresa (myPA2, 1, WP2); mixArray Paira (wyPal, myPAZ) System.out.println("1.. myvi) System.out.println("2: ( +WA110 A11] + " ") System.out.println("3: ( + myA2[0] + + m 2 (1) + " ); System.out.println("4: ( myM[0][0] + "," myM[0][1] + " myM[1][0] + " " + myM[1][1] + "} ") System.out.println('5: ( + myPA10) + myPA [1] + " "); System.out.println("6: ( myPA2[0 PA21] + " ); 1"

Submit the vector [33 44 55 77 95 99 22 25 41 66 88 89] to the Quicksort Partition algorithm. What is the final state of the vector? 
What index does the algorithm return?
 
Partition (A, p, r)   ā–· p ≤ r
1  x := A[r]   ā–· pivot
2  i := pā€Š−ā€Š1
3  for j := p to rā€Š−ā€Š1
4          if  A[ā€Šj] ≤ x
5                 i := iā€Š+ā€Š1
6                change A[i] with A[ā€Šj]
7  changeA[i+1] with A[r]
8  return i + 1

I. [10 marks For each row in the table below, determine what would happen if you opened DrScheme and tried to evaluate the given code. If there is an error, brielly explain what is wrong (be more specific than saying "invalid Scheme expression"). If there is no error, give the value produced by DrScheme. The first two rows have been completed for you as examples. Answer Scheme Code (+ 12) (+ 1 2)) (7 + 12) Error. There is an extra) (+ 4 (* 1 (+ 4 2))) ( 1 ((reraircer 27 9) (sqr 5))) (/ 10 (-3 (-14))) (= 'apple 'banana) (and (< 3 4) 19 10)) (- 12 (string-length. "iya")) (reso rest (rest (rest (cors'a (cons 3 (cons 5 empty))))))) (cond [(> 3 8) "happy! [(-34) 'sad) [(even? 9) 'oops] ) (posn-X (first (rest (coris (make-posn 3 4) (cons (make-posr. 56) empty)))))