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 |
We are sorry, there are no listings for the current search parameters.
School: University Of Michigan
Course: Digital Integrated Technology
H N % -L qj _\ Q q - - 4-ED c ) c) - L \ Hj c N ( s .& I o >< <.-.-. - . . , - I c It N l cA -1 i 1 Q c 0 aI <1 1- + 1 ; - r 0 a LA I a o. _ -p -t 1 k >( 0 )S + I N - P. ft I - r4\ (r\ p co> IoI. [ *7 ts 7oxc ) O/Q 4 / s+ SvI/yjf tJ5ij fi /),o6/e4- 2 1OS
School: University Of Michigan
EECS 216 - Winter 2012 Pre Lab I Solutions (K. Winick, last revision Feb. 6, 2012) 1. (Problem 4.1) (a) ystep (t ) = (1 et /RC )u(t ) dystep (t ) dt RC 1 t /RC RC e = dystep (t ) dt 0 t >0 t <0 + ystep (t ) = 1 t >0 0 t <0 = u(t ) Also note that limt 0 y
School: University Of Michigan
Course: WEB DATA STRUCTURE
Web Essentials Lecture 1 Web Basics A brief history Transfer Content EECS 485 January 4, 2012 (some slides due to Dan Weld) Dewey Decimal system, library science 1960: Ted Nelson Xanadu Hypertext vision of WWW Focus on copyright, consistent (bidirectional
School: University Of Michigan
Course: Comp Architec
EECS 470 Fall 2014 HW1 solutions 1a) Loop: LD DADDI SD DADDI DSUB DADDI BNEZ R1, 0(R2) R1, R1, #1 0(R2), R1 R2, R2, #4 R4, R3, R2 R5, R5, #1 R4, Loop Instruction 1 2 3 4 5 LD IF ID EX MEM WB IF ID* ID* IF* IF* 8 ID EX MEM WB IF ID* ID* IF* 10 11 ID EX MEM
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab4 Pre-lab Mei Yang Q1. Answer: From the figure that has been generated, we can clearly see that the max gain is 60dB. Q2. Answer: From the matlab design, we can easily get that: a. 210 b. 35 Q3. Answer: For the passband, the difference is very
School: University Of Michigan
Course: WEB DATA STRUCTURE
Organization Lecture 15 Web Search Grab Bag! Today s class contains many search topics we have not yet explored 1 2 3 4 Crawler design Deduplication Inverted-index construction Distributed search architecture It s a bit of a grab-bag, but these are still-
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Spring 2014 Discussion 1 Notes May 15, 2014 1. Exercise 1.1.14 Let p, q, and r be the propositions p: You get an A on the nal exam. q: You do every exercise in this book. r: You get an A in this class. Write the following pr
School: University Of Michigan
Course: Database Mgt Syst
ReviewofQueryOptimization DiscussionSession11 Joins Simple Nested Loop |R| + |R| * |S| Page oriented nested loop |R| + |R| * |S| Block nested loop Index nested loop |R| + ( |R| * cost of finding matching S tuples) Sort merge Sort: Merge=(|R|+|S|) Gr
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Variables, typecasting, & operators variables are dynamically typed. they can change types during the programs run c+ is statically typed. the variables don't change type because they are dynamic in python, you must give a variable a value when declare
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
A variable is a name for something sets up location in memory stores a value give it a name that describes purpose/specify type of info it will hold type cant be changed once declared naming variables start with a letter or underscore_ after the f
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
22/17/2014 Floating Point NUmbers/ cout <showpoint - shows decimal when .0000 cout <fixed - not scientific notation cout < setprecision(2) - shows 2 decimal places of your variable *have to do showpoint & fixed first* *requires <iomanip> setw(x) indents x
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECSLecture 18:42 9/8/14 Whenusingcin>forstring,itstopsreadingwhenithitswhitespace Toreadthewholeline,youdogetline(cin,name) Example: Cin>name IfnameisinputtedasMaryLou,onlyMarywillberead Getline(cin,name) IfnameisinputtedasMaryLou,MaryLouwillberead 9/10/
School: University Of Michigan
Course: Power Electronics
E ECS 418: Power Electronics M id-term E xam O ctober 26, 2011 Name: _ _ _ Answer t he questions in the blue book provided. Be neat and concise in your answers. Circle your final answers. D on't forget to write your name in the blue-book. Q uestion 1 \ .)
School: University Of Michigan
IV. ESTIMATOR Objective: ML estimator Where P is positive since the elements of P (compartmental parameters, concentrations, myocardial thicknesses, and endocardial radii) are physically positive, and with assumption of Poisson measurement noise where k i
School: University Of Michigan
IEEE TRANSACTIONS ON MEDICAL IMAGING, V OL 13. NO. 2 , JUNE 1994 217 Model-Based Estimation for Dynamic Cardiac Studies Using ECT Ping-Chun Chiao, W . L eslie Rogers, Neal H. Clinthorne, Jeffrey A. Fessler, and Alfred 0. Hero Abstract-In this paper, we de
School: University Of Michigan
Course: WEB DATA STRUCTURE
Web Essentials Lecture 1 Web Basics A brief history Transfer Content EECS 485 January 4, 2012 (some slides due to Dan Weld) Dewey Decimal system, library science 1960: Ted Nelson Xanadu Hypertext vision of WWW Focus on copyright, consistent (bidirectional
School: University Of Michigan
Course: WEB DATA STRUCTURE
Organization Lecture 15 Web Search Grab Bag! Today s class contains many search topics we have not yet explored 1 2 3 4 Crawler design Deduplication Inverted-index construction Distributed search architecture It s a bit of a grab-bag, but these are still-
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Serial buses Some material from: Brehob, Le, Ramadas, Tikhonov & Mahal 1 Announcements HW 1 & 2 solutions posted HW 3/Practice exam coming this week Midterm exam will b
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 8: Clocks, Counters, Timers, Capture, and Compare Feb 3 & 5, 2015 Some slides by Mark Brehob and Thomas Schmid 1 iPhone Clock App World Clock display real time in
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 6: Interrupts January 27, 2015 Slides"developed"in"part"by"Mark"Brehob" 1" Announcements Additional GSI/IA office hours (OH) Pat Pannuto 10-11am MW in EECS Learn
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 7: Interrupts (2) January 29, 2015 Some slides prepared by Mark Brehob 1 High-level review of interrupts Why do we need them? Why are the alternatives unacceptabl
School: University Of Michigan
University of Michigan WINTER 2011 EECS 401: Solution to Mid Term Examination I 1. TRUE. Consider the following argument: P (A B) C) = P (A C) (B C) (1) = P (A C) + P (B C) P (A C) (B C) (2) = P (A C) + P (B C) P (A B C), (3) where the rst equation follo
School: University Of Michigan
Course: Circuits
Sample solutions EECS 314 Winter 2008 Final Exam Instructor: Alexander Ganago ganago@umich.edu Wednesday April 23, 2008, 10:30 AM 12:30 PM Exam rooms, according to the [first letter of] students' last names: A.K L.P R.Z 220 Chrysler Auditorium (our lectur
School: University Of Michigan
EECS 216 EXAM #2 - Winter 2008 x(t) cos(3t)dt=: 1. Fourier series of x(t) is cos(t)+ 1 cos(2t)+ 1 cos(3t)+. . . Then 2 3 1 (a) 0 (b) 3 (c) (d) (e) 2 6 3 3 2 2. Impulse response of an LTI system with frequency response (j)2 +4(j)+4 is: (a) Nonc
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
EECS 280: Midterm Fall 2006 This is a closed-book exam; no notes are allowed. There are 5 problems on 17 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note al
School: University Of Michigan
Course: Programming And Data Structures
EECS 280: Midterm Winter 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that is required o
School: University Of Michigan
Course: Programming And Data Structures
uniqname: EECS 280 Midterm Exam Spring 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that
School: University Of Michigan
Course: Digital Integrated Technology
H N % -L qj _\ Q q - - 4-ED c ) c) - L \ Hj c N ( s .& I o >< <.-.-. - . . , - I c It N l cA -1 i 1 Q c 0 aI <1 1- + 1 ; - r 0 a LA I a o. _ -p -t 1 k >( 0 )S + I N - P. ft I - r4\ (r\ p co> IoI. [ *7 ts 7oxc ) O/Q 4 / s+ SvI/yjf tJ5ij fi /),o6/e4- 2 1OS
School: University Of Michigan
Course: Comp Architec
EECS 470 Fall 2014 HW1 solutions 1a) Loop: LD DADDI SD DADDI DSUB DADDI BNEZ R1, 0(R2) R1, R1, #1 0(R2), R1 R2, R2, #4 R4, R3, R2 R5, R5, #1 R4, Loop Instruction 1 2 3 4 5 LD IF ID EX MEM WB IF ID* ID* IF* IF* 8 ID EX MEM WB IF ID* ID* IF* 10 11 ID EX MEM
School: University Of Michigan
Course: Digital Integrated Technology
) /-ik/f3 4- e Fa piu + e/A, sI p & II14 4/oi11 = I /-/Dq.2JAi 492q + i,t 1 A1 ,ww I (i&17q s)?Ivf I Q Z.4 ,c, C4c 3E) ,/ to -c )Y(.)L1)acO/ itl :d J(I UVfJ1141 1 . .4 I). ,OL4nDAC ,p,q do . 1 , af2L1P( [7 ,tQO U! :LA ft?1 c91 t) i 1 h e*Z 1 L, fa4L1qUI4
School: University Of Michigan
EECS 203: Homework 1 Solutions Section 1.1 1. (E) 8bef b) You do not miss the final exam if and only if you pass the course. e) If you have the flu then you do not pass the course, or if you miss the final examination then you do not pass the course. f) Y
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab4 Pre-lab Mei Yang Q1. Answer: From the figure that has been generated, we can clearly see that the max gain is 60dB. Q2. Answer: From the matlab design, we can easily get that: a. 210 b. 35 Q3. Answer: For the passband, the difference is very
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab questions: Q1. Consider the logic statement (A*B)+(C*A) a. Write the truth table for that logic statement b. Draw the gates that implement that logic statement (without simplification). A, B 00 01 10 11 C=0 0 0 0 1 C=1 1 1 0 1 Q2. Consider a 2-to-
School: University Of Michigan
EECS 215 Lab Supplementary Materials / Op Amp Lab Cover page Op Amp Lab Report Students Name _ Date of Lab Work _ I have neither given nor received aid on this report, nor have I concealed any violations of the Honor Code. _ (students signature) Lab Secti
School: University Of Michigan
EECS 373 Lab 3: Introduction to Memory Mapped I/O In this lab we will learn: To develop custom peripheral hardware in the SmartFusion FPGA using the Libero CAD tools. The fundamentals of memory-mapped I/O (MMIO). To interface the ARM peripheral bus (APB3)
School: University Of Michigan
EECS 373 Lab 2: Software Toolchain Copyright 2010-2011, Thomas Schmid, Matt Smith, Ye-Sheng Kuo, Lohit Yerva, and Prabal Dutta. 1/22/14 Schedule See posted lab schedule for due dates, in-lab, and post-lab due dates. Objectives The purpose of this lab is t
School: University Of Michigan
EECS 373 Lab 6: Serial Bus Interfacing Copyright 2013 Matt Smith, 10/9/2014 Schedule See posted lab schedule. This is a two week lab and consists of two parts. Part 1 is due within the first week and consists of the following. 1) Answers to questions and
School: University Of Michigan
Course: Embedded Control Systems
Matlab RC Filter Design % m-file generates an R-C circuit antialiasing filter num = 1; den = [RC 1]; omega = logspace(-1,3); [mag, phase] = bode(num, den, omega); subplot(2,1,1) % Magnitude and Phase on one page % plot magnitude in dB vs. frequency in Hz
School: University Of Michigan
Course: Embedded Control Systems
EECS 461: Final Project Work Breakdown (Sp14) Work may be completed in any order or at a pace faster than listed below. Below is a suggestion which will allow you to complete as much modeling as possible outside of lab. However, you are responsible for ha
School: University Of Michigan
Course: Embedded Control Systems
RAppID Reference EECS461 March 28, 2013 1 GPIO Peripheral Blocks The main functionality of the GPI block is to set the selected GPIO pin for general purpose input. All the available pins are connected to Dipswitches in the lab. The main functionality of t
School: University Of Michigan
Course: Intr Art Intell
EECS 492: Introduction to Artificial Intelligence Fall 2014 Instructor: Prof. Emily Mower Provost Office Hours: Wednesday 911 Office: 3620 CSE emilykmp@umich.edu GSIs: GSI office hours will take place in the EECS Learning Center (BBB 1637). Duc Le Office
School: University Of Michigan
Course: Computer Vision
EECS442ComputerVision CourseDescription Thecourseisanintroductionto2Dand3Dcomputervision.Topicsinclude:camerasmodels,the geometryofmultipleviews;shapereconstructionmethodsfromvisualcues:stereo,shading,shadows, contours;lowlevelimageprocessingmethodologies
School: University Of Michigan
Course: Linear Systems Theory
No textbook is required. The following book is RECOMMENDED (but once again, not required). It is on reserve in the library. 1) ISBN: 9780471735557 Linear State-Space Control Systems Robert L Williams, III, Douglas A Lawrence The following books are also o
School: University Of Michigan
Course: Linear Systems Theory
EECS 560: LINEAR SYSTEMS THEORY OR (LINEAR ALGEBRA FOR FUN AND PROFIT) Instructor: Prof. Jessy W. Grizzle, 4421 EECS Bldg., grizzle@umich.edu, 734-7633598 Class Periods: Lecture meets MWF, 1:30 to 2:30 PM in 1670 CSE Fldg. Recitation meets W 4:30 to 6:30
School: University Of Michigan
Course: Lin Feedback Control
EECS 565: Linear Feedback Control Systems, Winter 2011 TIME: 10:30-12:00 Tuesday and Thursday PLACE: 1303 EECS Bldg. INSTRUCTOR: J. S. Freudenberg OFFICE: 4425 EECS bldg PHONE: (734) 763-0586 EMAIL: jfr@eecs.umich.edu OFFICE HOURS: 2:00-3:00 Monday and 12
School: University Of Michigan
Course: Introduction To Cryptography
University of Michigan, Computer Science and Engineering EECS 475: Introduction to Cryptography Instructor: Prof. Kevin Fu Handout 1 January 8, 2014 Course Information Instructor: Prof. Kevin Fu Lecture: Mondays/Wednesdays 10:30-12:00 (1610 IOE) Oce Hours
School: University Of Michigan
Course: Digital Integrated Technology
H N % -L qj _\ Q q - - 4-ED c ) c) - L \ Hj c N ( s .& I o >< <.-.-. - . . , - I c It N l cA -1 i 1 Q c 0 aI <1 1- + 1 ; - r 0 a LA I a o. _ -p -t 1 k >( 0 )S + I N - P. ft I - r4\ (r\ p co> IoI. [ *7 ts 7oxc ) O/Q 4 / s+ SvI/yjf tJ5ij fi /),o6/e4- 2 1OS
School: University Of Michigan
EECS 216 - Winter 2012 Pre Lab I Solutions (K. Winick, last revision Feb. 6, 2012) 1. (Problem 4.1) (a) ystep (t ) = (1 et /RC )u(t ) dystep (t ) dt RC 1 t /RC RC e = dystep (t ) dt 0 t >0 t <0 + ystep (t ) = 1 t >0 0 t <0 = u(t ) Also note that limt 0 y
School: University Of Michigan
Course: WEB DATA STRUCTURE
Web Essentials Lecture 1 Web Basics A brief history Transfer Content EECS 485 January 4, 2012 (some slides due to Dan Weld) Dewey Decimal system, library science 1960: Ted Nelson Xanadu Hypertext vision of WWW Focus on copyright, consistent (bidirectional
School: University Of Michigan
Course: Comp Architec
EECS 470 Fall 2014 HW1 solutions 1a) Loop: LD DADDI SD DADDI DSUB DADDI BNEZ R1, 0(R2) R1, R1, #1 0(R2), R1 R2, R2, #4 R4, R3, R2 R5, R5, #1 R4, Loop Instruction 1 2 3 4 5 LD IF ID EX MEM WB IF ID* ID* IF* IF* 8 ID EX MEM WB IF ID* ID* IF* 10 11 ID EX MEM
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab4 Pre-lab Mei Yang Q1. Answer: From the figure that has been generated, we can clearly see that the max gain is 60dB. Q2. Answer: From the matlab design, we can easily get that: a. 210 b. 35 Q3. Answer: For the passband, the difference is very
School: University Of Michigan
Course: WEB DATA STRUCTURE
Organization Lecture 15 Web Search Grab Bag! Today s class contains many search topics we have not yet explored 1 2 3 4 Crawler design Deduplication Inverted-index construction Distributed search architecture It s a bit of a grab-bag, but these are still-
School: University Of Michigan
University of Michigan WINTER 2011 EECS 401: Solution to Mid Term Examination I 1. TRUE. Consider the following argument: P (A B) C) = P (A C) (B C) (1) = P (A C) + P (B C) P (A C) (B C) (2) = P (A C) + P (B C) P (A B C), (3) where the rst equation follo
School: University Of Michigan
Course: Circuits
Sample solutions EECS 314 Winter 2008 Final Exam Instructor: Alexander Ganago ganago@umich.edu Wednesday April 23, 2008, 10:30 AM 12:30 PM Exam rooms, according to the [first letter of] students' last names: A.K L.P R.Z 220 Chrysler Auditorium (our lectur
School: University Of Michigan
Course: Digital Integrated Technology
) /-ik/f3 4- e Fa piu + e/A, sI p & II14 4/oi11 = I /-/Dq.2JAi 492q + i,t 1 A1 ,ww I (i&17q s)?Ivf I Q Z.4 ,c, C4c 3E) ,/ to -c )Y(.)L1)acO/ itl :d J(I UVfJ1141 1 . .4 I). ,OL4nDAC ,p,q do . 1 , af2L1P( [7 ,tQO U! :LA ft?1 c91 t) i 1 h e*Z 1 L, fa4L1qUI4
School: University Of Michigan
EECS 203: Homework 1 Solutions Section 1.1 1. (E) 8bef b) You do not miss the final exam if and only if you pass the course. e) If you have the flu then you do not pass the course, or if you miss the final examination then you do not pass the course. f) Y
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Homework #3 Total: 180 Points Fall 2007 Handed Out: Due: Friday Sept. 21, 2007 Friday Sept. 28, 2007 1. This problem deals with etching of the silicon device shown below. The figure shows the cross section and the t
School: University Of Michigan
Course: Digital Integrated Technology
University of Michigan Department of Electrical Engineering and Computer Science EECS 523 HW#4 Fall 2012 Due (at the beginning of the class): October 30 1- A 0.5m thin poly has been implanted with both phosphorus and boron impurities with a dose of 6 x 10
School: University Of Michigan
EECS 314 Winter 2008 Homework set 8 Student's name _ Discussion section # _ (Last, First, write legibly, use ink) (use ink) Instructor is not responsible for grading and entering scores for HW papers lacking clear information in the required field
School: University Of Michigan
Course: Comp Architec
Wenisch 2007 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS470 Lecture9 MIPSR10000 Fall2007 Prof.ThomasWenisch MultiprocessorSGIOriginUsingMIPSR10K http:/www.eecs.umich.edu/courses/eecs470
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Fall 2007 Class Handouts and Notes, Bulk Micromachining, Surface Micromachining, and Wafer Bonding. Homework #5 Total: 240 Points Handed Out: Friday October 5, 2007 Due: Friday October 12, 2007 1.
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Homework #2 Total: 165 Points Fall 2007 Class Handouts and Notes, Introduction to Microfabrication Technologies Handed Out: Due: Thursday Sept. 13, 2007 Friday Sept. 21, 2007 1. Thermal and e-b
School: University Of Michigan
Sample Exam 3 EECS 203 Winter 2007 You have two hours to complete this exam. You may use any information you have written on three 8.5" 11" sheets of paper, but no other information. Leave at least one seat between yourself and other students. Prob
School: University Of Michigan
EECS 216 Winter 2012 Lab 1: LTI Systems Part II: In-lab & Post-lab Assignment Department of Electrical Engineering & Computer Science University of Michigan c Kim Winick 2008 1 Laboratory Task Description Unless otherwise specied, it will be assumed that
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab questions: Q1. Consider the logic statement (A*B)+(C*A) a. Write the truth table for that logic statement b. Draw the gates that implement that logic statement (without simplification). A, B 00 01 10 11 C=0 0 0 0 1 C=1 1 1 0 1 Q2. Consider a 2-to-
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Post-Lab #3 Team Member: Mei Yang (unique name: meiyang) Nicholas Liou (unique name: liounick) Q1. The output we get after reset and input 1010 is 1212. Q2. a. The frequency of the waveform is 46.848Hz. b. The waveforms step is obvious. Q3. a. Th
School: University Of Michigan
EECS 216 EXAM #2 - Winter 2008 x(t) cos(3t)dt=: 1. Fourier series of x(t) is cos(t)+ 1 cos(2t)+ 1 cos(3t)+. . . Then 2 3 1 (a) 0 (b) 3 (c) (d) (e) 2 6 3 3 2 2. Impulse response of an LTI system with frequency response (j)2 +4(j)+4 is: (a) Nonc
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
EECS 280: Midterm Fall 2006 This is a closed-book exam; no notes are allowed. There are 5 problems on 17 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note al
School: University Of Michigan
Course: Circuits
EECS314 Studentsname_ Discussionsection#_ (Last,First,writelegibly,useink) (useink) InstructorisnotresponsibleforgradingandenteringscoresforHWpaperslacking clearinformationintherequiredfieldsabove Winter2011 Homeworkset3 Problem1(20points)Resistanceandr
School: University Of Michigan
EECS 203 HW 1 10. Let p, q, and r be the propositions p: You get an A on the final exam. q: You do every exercise in this book. r: You get an A in this class. Write these propositions using p, q, and r and logical connectives. a) You get an A in this
School: University Of Michigan
EECS 215 Lab Supplementary Materials / Op Amp Lab Cover page Op Amp Lab Report Students Name _ Date of Lab Work _ I have neither given nor received aid on this report, nor have I concealed any violations of the Honor Code. _ (students signature) Lab Secti
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Post-Lab #5 Team Member: Mei Yang (unique name: meiyang) Nicholas Liou (unique name: liounick) Q1. When building the filter in Q1 of the pre-lab, biq_32 should be initialized to Int32 biq_32[NUM_SEC * BIQ_COEFF] = cfw_ 16521, -28615, 16521, 6363,
School: University Of Michigan
Course: Programming And Data Structures
EECS 280: Midterm Winter 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that is required o
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
#include <iostream> #include <string> #include <iomanip> using namespace std; /functions implemented for you /Requires: nothing /Modifies: nothing /Effects: prints out the initial header void printHeader(); /Requires: num is 1-4 inclusive /Modifies: nothi
School: University Of Michigan
Course: Programming And Data Structures
uniqname: EECS 280 Midterm Exam Spring 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that
School: University Of Michigan
EECS 216 - Winter 2012 Homework 1 Solutions 1. Find the fundamental period T of each of the following four signals: (a) cos(t ) (b) sin( t ) (c) cos( 52 t ) (d) cos( 35 t ) 3 Solution: (a) T = 2 = 2 (b) T = 2 /3 = 6 (c) T = 2 5/2 = 4/5 (d) T = 2 3/5 = 10/
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Homework #4 Total: 350 Points Fall 2007 Class Handouts and Notes: Silicon Wet Etching, Wafer Bonding, Bulk Si Micromachining, and Surface Micromachining. Handed Out: Due: Friday Sept. 28, 2007 F
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Homework 5. Fall 2012 Name: _ unique name: _ You are to turn in this sheet as a cover page for your assignment. The rest of the assignment should be stapled to this page. This is an individual assignment; all of the work should be your own unless
School: University Of Michigan
last modified Mar 30 EECS 281 Project 5: More clustering! Please note that you are responsible for any "sticky" phorum threads as they are an extension of this document and may contain corrections or clarifications. Due This project is due on April
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Homework#2 Mei Yang 1. Answer: a. 35(dec) = 4*8 + 3 = 43 (oct) b. 35(dec) = 2*16 + 3 = 23 (hex) c. 1111_1111(2s complement) = 1 (dec) d. 1000_1000(2s complement, Q4) = 8+0.5=7.5 e. 1111_1111(binary u
School: University Of Michigan
Course: INTRODUCTION TO CIRCUITS
Circuits by Fawwaz T. Ulaby and Michel M. Maharbiz Solutions to the Exercises Fawwaz T. Ulaby and Michel M. Maharbiz, Circuits c 2009 National Technology and Science Press ISBN-10: 1-934891-00-2 ISBN-13: 978-1-934891-00-1 Publisher: Tom Robbins General Ma
School: University Of Michigan
Course: Dsp Design Lab
452 Post lab #2 Team member: Mei Yang (unique name: meiyang) Nicholas Liou (unique name: liounick) Q1. The total capacitance we used was 532pF. Q2. Please see the following statics for details: Frequency In-lab value Pre-lab value 10kHz 0.955V 0.949V 30kH
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Homework 4. Fall 2012 Solutions Name: _ unique name: _ You are to turn in this sheet as a cover page for your assignment. The rest of the assignment should be stapled to this page. This is an individual assignment; all of the work should be your
School: University Of Michigan
Project 2: Recursive Data Structures EECS 280 Winter 2011 Due: Tuesday, February 8th, 11:59 PM Introduction This project will give you experience writing recursive functions that operate on recursively-defined data structures and mathematical abstra
School: University Of Michigan
Course: Signal Processing
S w w ~ f W @0l f c U A U QW 1Qu U c x w ux ~ U w `w @x VS u w u U Y w w u x w u %S 1u P w gS S W Q1w Y u dc x S vt 3 Y ux w y w w Y U S w w u t gS w W 1g S 1u ` g u vVS w PU QW ow Xq1vd w u S a y wu QW @x U QW ow w qS x vt X ~ lg VS w Y u A S U `@w `S w
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
EECS 280: Final Fall 2006 This is a closed-book exam; no notes are allowed. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Todays Todays Topics Welcome Course Overview Administration Terms & Concepts Programming Languages Algorithms EECS 183 University of Michigan Lecture 01 Mary Lou Dorf Welcome Welcome to EECS 183 ! Instructor Mary Lou Dorf mdorf@umich.edu Discussion In
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Supplemental Study Material for Section 5.5 5.5.12. How many different combinations of pennies, nickels, dimes, quarters, and half dollars can a piggy bank contain if it has 20 coins in it? Solution: There are 5 things to choose from, repetitions
School: University Of Michigan
Course: Signal Processing
Section 5.2 8 Suppose A = uv T is a column times a row (a rank-1 matrix). (a) By multiplying A times u, show that u is an eigenvector. What is ? Solution. Au = (uv T )u = u(v T u) = (v T u) u, so by denition, u is an eigenvector with the associated eigenv
School: University Of Michigan
Course: Database Mgt Syst
Discussion10 QueryEvaluationandHomework3solutions EECS 484 QueryEvaluation B+ tree can be used for range and equality selection Hash based indexing can be used for only equality selection Composite keys - combination of keys Hash: Requires all the key
School: University Of Michigan
Course: Database Mgt Syst
EECS 484: Final Exam, Winter 2013 Please print your name and uniqname below. Name: Uniqname: Instructions: 1. The total number of points on this exam is 105. 2. During the exam, you may use three sheets of notes (stapled and with your names on each sheet)
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Sample Exam 2 EECS 203 Spring 2014 You have two hours to complete this exam. You may use any information you have written on two 8.5 11 sheets of paper. Problem 1. Zero or more of the following statements are true. Which ones are they? (a) The number of p
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Sample Exam 1 Answers EECS 203 Spring 2014 Each part of Problem 1-9 is a true-false question. Here are the answers Problem 1 2 3 4 5 Part Answer a F b T c T d F a T b F c T d T a F b F c F d T a T b F c T d F e T a T b T c T d F Problem Part Answer 6 a T
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Spring 2014 Discussion 1 Notes May 15, 2014 1. Exercise 1.1.14 Let p, q, and r be the propositions p: You get an A on the nal exam. q: You do every exercise in this book. r: You get an A in this class. Write the following pr
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Dijkstas Algorithm Handout EECS 203 Spring 2014 Dijkstras Algorithm is an ecient algorithm to nd the shortest distance between two vertices in a graph. It is easy to modify the algorithm for directed graphs. The input to the algorithm is a graph G = (V, E
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Handout 1 Natural Deduction Rules EECS 203 Spring 2014 Handouts 1 through 4 supplement the material in section 1.6 of the textbook. This handout presents the Natural Deduction rules of inference for propositional logic. (-intro) p q pq (-elim) pq p pq q p
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Dijkstas Algorithm Handout Exercise Answers b 5 d 2 2 2 a 3 4 5 c z 1 e Graph G = (V, E) with edge weights (0) (2) (4) v L[v] P [v] a 0 b c d e z v L[v] P [v] a / / b 2 a c 3 a d 7 b e 4 b z v L[v] P [v] a / / b 2 a / c 3 a d 5 e e / 4 b z 8 e (1) (
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Exam 1 Answers EECS 203 Spring 2014 Section 1 - Multiple Choice For each of the problems 1 through 7 on the following pages indicate your answers by circling the appropriate letters below. For each problem the number of letters circle you may circle anywh
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Problem 1. Natural Deduction Using the Natural Deduction rules of inference show pq p r qr 1 pq premise 2 p r premise 3 p assumption 4 p -intro 3 5 r Disjunctive Syllogism 4, 2 6 qr -intro 5 7 q assumption 8 qr -intro 7 9 qr -elim 1, 3-6, 7-8 Notice that
School: University Of Michigan
Course: Database Mgt Syst
EECS484:FinalExam,Winter2013 Please printyournameanduniqnamebelow. Name: Uniqname: Instructions: 1. Thetotalnumberofpointsonthisexamis . 105 2. During the exam, you may use sheets of notes (stapled and with yournamesoneachsheet) a three and SATapproved o
School: University Of Michigan
Course: Database Mgt Syst
ReviewofQueryOptimization DiscussionSession11 Joins Simple Nested Loop |R| + |R| * |S| Page oriented nested loop |R| + |R| * |S| Block nested loop Index nested loop |R| + ( |R| * cost of finding matching S tuples) Sort merge Sort: Merge=(|R|+|S|) Gr
School: University Of Michigan
Course: Database Mgt Syst
Practice Midterm Solutions EECS 484 Question 1 Assume that Yummy484 is a top-level entity (meaning we dont need to make a separate box for it). Yummy484 consists of many franchisees located across the world. For each franchisee, track the franchisees a
School: University Of Michigan
Course: Database Mgt Syst
IntroductiontoProject1 DiscussionSession2 Outline ERDesignExercise CAENandOracleAccountSetup Project1Overview AccessFakebookData UsingSQL*Plus EECS484 2 ERDiagramExercise1 There are doctors, and each doctor has a name, a salary, and a unique ssn. There a
School: University Of Michigan
Course: Database Mgt Syst
EECS484 Homework5Solutions Winter2015 EECS 484 Part1:Serializability Question1: Considerthefollowing(incomplete)scheduleinvolving transactionsT1,T2,T3andT4.Istheschedule recoverable?Explain. T1 R(X) W(X) T2 T3 T4 R(Z) R(Y) W(Z) W(Y) R(Z) COM MIT EECS COM
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Spring 2014 Discussion 1 Notes May 15, 2014 1. Exercise 1.1.14 Let p, q, and r be the propositions p: You get an A on the nal exam. q: You do every exercise in this book. r: You get an A in this class. Write the following pr
School: University Of Michigan
Course: Database Mgt Syst
ReviewofQueryOptimization DiscussionSession11 Joins Simple Nested Loop |R| + |R| * |S| Page oriented nested loop |R| + |R| * |S| Block nested loop Index nested loop |R| + ( |R| * cost of finding matching S tuples) Sort merge Sort: Merge=(|R|+|S|) Gr
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Variables, typecasting, & operators variables are dynamically typed. they can change types during the programs run c+ is statically typed. the variables don't change type because they are dynamic in python, you must give a variable a value when declare
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
A variable is a name for something sets up location in memory stores a value give it a name that describes purpose/specify type of info it will hold type cant be changed once declared naming variables start with a letter or underscore_ after the f
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
22/17/2014 Floating Point NUmbers/ cout <showpoint - shows decimal when .0000 cout <fixed - not scientific notation cout < setprecision(2) - shows 2 decimal places of your variable *have to do showpoint & fixed first* *requires <iomanip> setw(x) indents x
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECSLecture 18:42 9/8/14 Whenusingcin>forstring,itstopsreadingwhenithitswhitespace Toreadthewholeline,youdogetline(cin,name) Example: Cin>name IfnameisinputtedasMaryLou,onlyMarywillberead Getline(cin,name) IfnameisinputtedasMaryLou,MaryLouwillberead 9/10/
School: University Of Michigan
Course: Building Applications For Information Environments
EECSNOTES Representingsequenceofitems Arrays o Afixednumberofslotsinwhichtostoreelementsofasequence.Itiseasy torepresentshortsequencesinalargearray.Butyoudoneedtoanticipate themaximumsizeofsequenceuwillneedandcreateanarrayofthatsize o Example:aplanehasaf
School: University Of Michigan
Course: Building Applications For Information Environments
EECS182MIDTERM SAMIHERMAN Variables&Types Expressions Increment, Decrement operators (+, -) a+ and +a are shorthand for a = a + 1 with a big warning sign: +a will increment a and then return the value (so it will return one greater than the original valu
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Winter 2009 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 5 Total Points / 24 / 22 / 21 / 12 / 21 /100 NOTES: Closed book/notes Cal
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
aaleung dangying danoh jometti jonjah mitchwal mitjambo samjfree samoz yanmark yanzha zzasuwa NS 2140 MLB AUD 4 AH AUD B DENN 170 DENN 182 DENN 260 More info at umich.edu/~eecs183/exams/exam2/exam2.html Scantron Bubble in 1) UMID 2) KEY # 3) Name Front Sh
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Operators Go through this example writing one line at a time and "playing dumb". Start with a description of the problem and put it into comment. Than draw out the logic for them very simplistically. I want to read from the keyboard so I need #include <io
School: University Of Michigan
Course: Database Mgt Syst
Transaction Management Chapters 16 (except 16.6), 17 (except 17.5 and beyond), and 18 (except 18.6 and 18.8) 11/19/14 EECS 484: Database Management Systems 1 Transactions n n Foundation for concurrent execution and recovery in DBMS Transaction is an atomi
School: University Of Michigan
Course: Database Mgt Syst
Security and Authorization Chapter 21 Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke 1 Introduction to DB Security ! Secrecy: Users should not be able to see things they are not supposed to. " E.g., A student can t see other students grad
School: University Of Michigan
Course: Database Mgt Syst
Recovery Protocol - ARIES Chapter 18 (except 18.6 and 18.8) 12/1/14 EECS 484: Database Management Systems 1 Motivation n Atomicity: n Transactions may abort (Rollback) n n n System can abort a transaction (and possibly restart it later) User/application c
School: University Of Michigan
Course: Database Mgt Syst
Advanced Join Strategies Chapter 12 and 14 11/5/14 EECS 484 1 Query Execution Life-Cycle 11/5/14 EECS 484 2 Join strategies seen so far Simple nested loops Page nested loops Block nested loops Today: Take advantage of hashing Take advantage of sorti
School: University Of Michigan
Course: Database Mgt Syst
Evaluation of Relational Operations Chapter 12 and 14 10/29/14 EECS 484 1 Query Execution Life-Cycle Query Result Query Database Server Parser Dispatch Query Plan Optimizer Select R.text from Report R, Weather W where W.image.rain() and W.city = R.city an
School: University Of Michigan
Course: Database Mgt Syst
Tree-Structured Indexes Chapter 10 10/22/14 EECS 484 1 Index Design Space Organization Structure for k* Hash-based + Equality search Tree-based + Range, equality search !B+Tree (dynamic) !ISAM (static) 10/22/14 Data Entry (k*) Contents 1. Actual Data re
School: University Of Michigan
Course: Database Mgt Syst
Hash-Based Indexes Chapter 11 10/27/14 Eeeeeks! 484 1 Index Design Space Organization Structure for k* Hash-based + Equality search Static hashing Extensible hashing Linear hashing Tree-based + Range, equality search 10/27/14 Data Entry (k*) Contents 1.
School: University Of Michigan
Course: Database Mgt Syst
Database Application Programming Chapter 6 (JDBC Section) 9/30/14 EECS 484: Database Management Systems 1 Databases In the Wild So far, we ve talked about the DBMS as a standalone system Access interactively by writing SQL queries (e.g., using SQL*Plus)
School: University Of Michigan
Course: Database Mgt Syst
Storage and Indexing Chapter 8 10/14/14 EECS 484 1 DBMS Organization SQL Query / Application Query Evaluation Engine Files & Access Methods Buffer Management cache Disk Space Management Disk 10/14/14 EECS 484 2 The Memory Hierarchy Performance of Micropro
School: University Of Michigan
Course: Database Mgt Syst
SQL Queries Chapter 5 Sample Database used in these notes: sailors.sql (Posted on Ctools) 9/28/14 EECS 484 1 SQL Query Language Implements relational algebra Select, Project, Join, Set operators (we will see these in the next lecture) And so much more
School: University Of Michigan
Course: Database Mgt Syst
Normalization Chapter 19 10/6/14 EECS 484: Database Management Systems 1 Database Design: The Story so Far ! Requirements Analysis ! ! Conceptual Database Design ! ! 10/6/14 Normalize relations, avoid redundancy, anomalies Physical Database Design ! ! Ch
School: University Of Michigan
Course: Database Mgt Syst
Relational Algebra Chapter 4 9/16/14 EECS 484 1 Formal Query Languages Foundation for commercial query languages like SQL Two types Declarative: Relational Calculus Describe what a user wants, rather than how to compute it. Procedural : Relational Al
School: University Of Michigan
Course: Database Mgt Syst
The$En'ty*Rela'onship$Model$ Chapter$2$ EECS 484: Database Management Systems 1 Databases' Database' A$database$is$a$system$intended$to$organize,$ store,$and$retrieve$large$amounts$ of$data$easily$ http:/en.wikipedia.org/wiki/Database Database'Models' D
School: University Of Michigan
Course: Database Mgt Syst
Relational Calculus Chapter 4 9/24/14 EECS 484 1 Relational Calculus Alternative to relational algebra Declarative (non-procedural) Describes answers without saying how to compute them Comes in two flavors (see textbook): TRC: Tuple relational calculu
School: University Of Michigan
Course: Database Mgt Syst
Logical Database Design: Mapping ER to Relational Chapter 3, Section 3.5 9/15/14 EECS 484: Database Management Systems 1 ER Model vs. Relational Model ER Model used for conceptual design Relational Model implemented by modern DBMS Important Step: Trans
School: University Of Michigan
Course: Database Mgt Syst
The$Rela(onal$Model$ $ Chapter$3$ 9/9/14 0 Rela(onal$Databases$ Most$common$data$model$in$modern$DBMS$ Many$commercial$systems$ Oracle,$MS$SQL$Server,$IBM$DB2,$more$ Also$open$source$ MySQL,$PostgreSQL,$SQLite,$ 9/9/14 1 Terminology$Parade$ Database
School: University Of Michigan
Course: Database Mgt Syst
DBMS Overview Chapter 1 What Is a DBMS? DBMS = Database Management System Database: Large, integrated collection of data. Models some real-world enterprise Entities (e.g., students, courses) Relationships (e.g., Lisa Simpson is taking EECS 484) DBMS
School: University Of Michigan
Course: Database Mgt Syst
EECS 484: Database Management Systems Instructor: Atul Prakash Email: aprakash at umich.edu Office Hours: W 2:00-4:00 and by appt, 4741 BBB. (No office hours first day) Course Web Page: On Ctools. Course Outline EECS 484 GOAL: B
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework 5 Solutions Fall 2014 Part 1: Serializability Question 1: Consider the following (incomplete) schedule involving transactions T1, T2, and T3. Is the schedule recoverable? Explain. T1 R(X) W(X) T2 T3 R(X) R(Y) W(X) W(Y) Commit EECS 484 S
School: University Of Michigan
School: University Of Michigan
School: University Of Michigan
3 0H mu; 4 M26300 EECS 314 Fall 2011 HW 6 Student's name Discussion section # _ (Last, First, write legibly, use ink) (use ink) Instructor is not responsible for grading and entering scores for HW papers lacking clear information in the required elds abov
School: University Of Michigan
EECS 314 Spring 2013HW problem #1 Solution Problem 1: Review of the basics: Voltage and current division; Power absorbed by resistors; Equivalent resistance (100 points) Before starting to solve this problem, mak
School: University Of Michigan
EECS 314 Spring 2013 HW problem 5 Students name _ (Last, First, write legibly, use ink) Instructor is not responsible for grading and entering scores for HW papers
School: University Of Michigan
2013 Sp 314 HW problem 3 Q&A.docx Question: Problem 3 Part 3: The first thing we are asked to do is find R. While doing this, are we supposed to assume the human is not in the circuit making it a series circuit
School: University Of Michigan
EECS 314 Spring 2013 HW problem 4 Students name _ (Last, First, write legibly, use ink) Instructor is not responsible for grading and entering scores for HW papers
School: University Of Michigan
EECS 314 Spring 2013 HW problem 3 Students name _ (Last, First, write legibly, use ink) Instructor is not responsible for grading and entering scores for HW papers
School: University Of Michigan
EECS 314 Spring 2013 HW problem 2 Students name _ (Last, First, write legibly, use ink) Instructor is not responsible for grading and entering scores for HW papers
School: University Of Michigan
School: University Of Michigan
School: University Of Michigan
eacs 3m- yedcure S (20!: SP) EECS 314 Winter 2010 Final Exam ProblemlO P ( "e "Good" control circuits with Wheatstone bridge Each of the circuits shown below includes a photoresistor whose resistance Rm is low when the light is bright and gets high when
School: University Of Michigan
HANDOUT EECS 314 9' P 2013M Lecture # 2 by A. Ganago Page of Some of the most important equations in this course: Voltage division: R R /I = VToml . l V2 = VTotal . 2 R1 + R2 R1 + R2 Current division, expressed in terms of resistances: _1_ 0
School: University Of Michigan
EECS 314 Spring 2013 HW #1 Students name _ (Last, First, write legibly, use ink)
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Andrew DeOrio EECS 280 Programming and Introductory Data Structures Final Exam Review Schedule No Lab next week (last week of class) But lab 12 will be available for practice 2 Exam time and location Time: Friday 12 December, 10:30am 12:30pm
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Andrew DeOrio EECS 280 Programming and Introductory Data Structures Final Exam Review: Memory and Deep Copies 1 Review: dynamic arrays Last time, we built an IntSet that the let the client specify the capacity int main() cfw_ IntSet is(3); /Int
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Andrew DeOrio EECS 280 Programming and Introductory Data Structures Midterm Exam Review 1 Time and location Wednesday 15 Oct, 7:00pm (Michigan time) - 8:30pm (80min) Where: (by uniqname) CHRYS220 DOW1013 DOW1006 DOW1010 DOW1014 DOW1017
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Andrew DeOrio And Georg Essl EECS 280 Programming and Introductory Data Structures Final Exam Review: Exceptions 1 Exercise 1 int main() cfw_ string f; /function double n; /number while (cin > f > n) cfw_ if (f = "factorial") cfw_ cout < factori
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Rada Mihalcea EECS 280 Programming and Introductory Data Structures Final Exam Review: Functors 2 Functors A functor is a class where the function-call operator is overloaded Can be used similar to the function pointers, with the added benefit
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Bryce Wiedenbeck EECS 280 Programming and Introductory Data Structures Final Exam Review: Interfaces and Invariants 2 Data Abstraction Principles Information hiding: only let users see what they need. Makes code easier to use. Prevents users
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Jeff Ringenberg and Brian Noble EECS 280 Programming and Introductory Data Structures C+ I/O Background Material C+ I/O - Background We assume most of you know how to do I/O in C+. These notes are for those who would like a refresher course. In
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Slides by Andrew DeOrio EECS 280 Programming and Introductory Data Structures Project 2 Intro: Lists 1 Project 2 This project will give you experience writing recursive functions that operate on recursively-defined data structures Lists and Trees New t
School: University Of Michigan
Course: DISCRETE MATHEMATICS
1. 10.6.2 Find the length of the shortest path from a to z using Dijkstras algorithm. Solution: The following table details running Dijkstras algorithm on the given graph. Refer to your lecture slides for denitions on the sets Q and S. Q S cfw_(a, 0), (b,
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 13 Notes EECS203 Sta December 1, 2014 1. 3.2.26 Give a big-O estimate for each of these functions. For the function g in your estimate f (x) is O(g(x), use a simple function g of smallest order. a) (n3 +
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 11 Notes EECS203 Sta November 10-17, 2014 1. Section 10.1 Exercise 6 Determine whether the graph shown has directed or undirected edges, whether it has multiple edges, and whether it has one or more loop
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 14 Notes EECS203 Sta December 4-8, 2014 1. 8.1.12 a) Find a recurrence relation for the number of ways to climb n stairs if the person climbing the stairs can take one, two, or three stairs at a time. b)
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 4 Notes EECS203 Sta September 25-29, 2014 1. Section 2.2 Exercise 4 Let A = cfw_a, b, c, d, e and B = cfw_a, b, c, d, e, f, g, h. Find a) A B b) A B c) A B d) B A 2. Section 2.2 Exercise 18 Let A, B, C b
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 7 Notes September 16-20, 2014 1. Section 6.4, Problem 11 Give a formula for the coecient of xk in the expansion of 1 (x2 x )100 , where k is an integer. 2. Section 6.4, Problem 19 Prove Pascals identity,
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 8 Notes EECS203 Sta October 23-29, 2014 1. Section 7.1 Exercise 22 What is the probability that a positive integer not exceeding 100 selected at random is divisible by 3? 2. Section 7.1 Exercise 24 Find
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Discussion 3 Notes September 18-22, 2014 1. Section 1.8 Example 14 Given two positive real numbers x and y, their arithmetic mean is (x + y)/2 and their geometric mean is xy. When we compare the arithmetic and geom
School: University Of Michigan
Course: Power Electronics
E ECS 418: Power Electronics M id-term E xam O ctober 26, 2011 Name: _ _ _ Answer t he questions in the blue book provided. Be neat and concise in your answers. Circle your final answers. D on't forget to write your name in the blue-book. Q uestion 1 \ .)
School: University Of Michigan
IV. ESTIMATOR Objective: ML estimator Where P is positive since the elements of P (compartmental parameters, concentrations, myocardial thicknesses, and endocardial radii) are physically positive, and with assumption of Poisson measurement noise where k i
School: University Of Michigan
IEEE TRANSACTIONS ON MEDICAL IMAGING, V OL 13. NO. 2 , JUNE 1994 217 Model-Based Estimation for Dynamic Cardiac Studies Using ECT Ping-Chun Chiao, W . L eslie Rogers, Neal H. Clinthorne, Jeffrey A. Fessler, and Alfred 0. Hero Abstract-In this paper, we de
School: University Of Michigan
Course: WEB DATA STRUCTURE
Web Essentials Lecture 1 Web Basics A brief history Transfer Content EECS 485 January 4, 2012 (some slides due to Dan Weld) Dewey Decimal system, library science 1960: Ted Nelson Xanadu Hypertext vision of WWW Focus on copyright, consistent (bidirectional
School: University Of Michigan
Course: WEB DATA STRUCTURE
Organization Lecture 15 Web Search Grab Bag! Today s class contains many search topics we have not yet explored 1 2 3 4 Crawler design Deduplication Inverted-index construction Distributed search architecture It s a bit of a grab-bag, but these are still-
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Serial buses Some material from: Brehob, Le, Ramadas, Tikhonov & Mahal 1 Announcements HW 1 & 2 solutions posted HW 3/Practice exam coming this week Midterm exam will b
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 8: Clocks, Counters, Timers, Capture, and Compare Feb 3 & 5, 2015 Some slides by Mark Brehob and Thomas Schmid 1 iPhone Clock App World Clock display real time in
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 6: Interrupts January 27, 2015 Slides"developed"in"part"by"Mark"Brehob" 1" Announcements Additional GSI/IA office hours (OH) Pat Pannuto 10-11am MW in EECS Learn
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 7: Interrupts (2) January 29, 2015 Some slides prepared by Mark Brehob 1 High-level review of interrupts Why do we need them? Why are the alternatives unacceptabl
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 2: Architecture, Assembly, and ABI January 13, 2015 Slides developed in part by Mark Brehob 1 Announcements Website up http:/www.eecs.umich.edu/~prabal/teaching/
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Branden Ghena University of Michigan Lecture 5: Memory and Peripheral Buses January 22, 2015 1 Announcements Im not Prabal You probably noticed Hes in Washington DC doing this and this He regrets that he
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 4: Memory-Mapped I/O, Bus Architectures January 20, 2015 Slides developed in part by Mark Brehob & Prabal Dutta 1 Today Memory-Mapped I/O Example Bus with Memory-M
School: University Of Michigan
EECS 373 Design of Microprocessor-Based Systems Prabal Dutta University of Michigan Lecture 3: Assembly, Tools, and ABI January 15, 2015 Slides developed in part by Mark Brehob & Prabal Dutta 1 Announcements Homework 2 was posted on 1/13 is due on 1/20
School: University Of Michigan
Lecture 12: Dictionaries, Symbol Tables, and Hashing EECS 281: Data Structures & Algorithms Outline Dictionary (symbol table) ADT Containers with look-up by keys Bucket-based data structures Hash Functions Hash Code Compression Map Collision Resolu
School: University Of Michigan
Lecture 11: Heaps, Priority Queues, and HeapSort EECS 281: Data Structures & Algorithms Wanted: a Container that Supports Creation [empty or from existing data] Insertion of element Deletion of element Retrieval/search of element Auxiliary/nice funct
School: University Of Michigan
Lecture 10: Elementary Sorting Methods EECS 281: Data Structures & Algorithms Monthly Salaries of Interns (2012) 25. Qualcomm: $4,604 24. Bank of America: $4,605 23. SAP: $4,615 22. BP: $4,631 21. BlackRock: $4,698 20. Intel: $4,836 19. Tagged: $4,909 18.
School: University Of Michigan
Lectures 8: Stacks and Queues EECS 281: Data Structures & Algorithms The Stack Container Supports insertion/removal in LIFO order Method Description push(object) Add object to top of the stack pop() Remove top element object& top() Return a reference to
School: University Of Michigan
Lecture 13: Hash Collision Resolution EECS 281: Data Structures & Algorithms Collision Resolution Definition: method to handle case when two keys hash to same address Methods of Collision Resolution Separate Chaining Linear Probing Quadratic Probing Doubl
School: University Of Michigan
Lecture 9: Ordered and Sorted Ranges Algorithms and D.S. to Represent Sets EECS 281: Data Structures & Algorithms Container Review Objects storing a variable number of data items Allow for control/protection of data Can copy/edit/sort/order many objects a
School: University Of Michigan
Lecture 2: Complexity Analysis EECS 281: Data Structures & Algorithms Assignments First reading assignment (now) CLRS chapter 1 (short) Link to textbook available on CTools What Affects Runtime? The algorithm Implementation details Skills of the pro
School: University Of Michigan
Lecture 4: Recursion EECS 281: Data Structures & Algorithms What Counts as One Step in a Program ? Primitive operations a) Variable assignment b) Arithmetic operation c) Comparison d) Array indexing or pointer reference In reality: is the same as e)
School: University Of Michigan
Lecture 3: Measuring Runtime, and Pseudocode EECS 281: Data Structures & Algorithms Complexity Recap Notation and terminology n = input Size f(n) = max number of steps when input has length n O(f(n) asymptotic upper bound 1 2 3 4 5 6 7 void f(int *out
School: University Of Michigan
Lecture 6: Linked Lists and Iterators EECS 281: Data Structures & Algorithms Linked List Each node is represented by one person Each node points to the next node Last nodes next pointer points to nullptr (nobody) Doubly-linked List Each node is repres
School: University Of Michigan
Lecture 5 Arrays & Container Classes EECS 281: Data Structures & Algorithms Job Interview Questions Assume that a given array has a majority (>50%) element find it in linear time using O(1) memory 11 13 99 12 99 10 99 99 99 Same for an array that has an
School: University Of Michigan
Lectures 7: The Standard Template Library EECS 281: Data Structures & Algorithms Q: Why C+? A: The STL Nothing has made life easier to programmers using C+ than the Standard Template Library. Though Java, C# and .NET have their own libraries which are as
School: University Of Michigan
Lecture 25: Shortest Path Algorithms Dijkstras Shortest Path Floyd-Warshall EECS 281: Data Structures & Algorithms Shortest path examples Highway system Distance Travel time Number of stoplights Krispy Kreme locations Network of airports Travel time F
School: University Of Michigan
Lecture 27: Mergesort EECS 281: Data Structures and Algorithms A Different Idea For Sorting Quicksort is akin to dividing file into two parts k smallest elements n - k largest elements Mergesort is akin to combining two ordered files to make one larger
School: University Of Michigan
Lecture 26: QuickSort EECS 281: Data Structures & Algorithms Two Problems with Simple Sorts They might compare every pair of elements Learn only one piece of information/comparison Contrast with binary search: learns N/2 pieces of information with firs
School: University Of Michigan
Lecture 24: Dynamic Programming / Memoization EECS 281: Data Structures & Algorithms Dynamic Programming Advantage of typical recursive algorithm is to divide domain into independent subproblems Some recursive problems do not divide into independent sub
School: University Of Michigan
EECS 281 Lecture 22: Branch & Bound, Traveling Salesperson Problem http:/xkcd.com/399/ Recall: Types of Problems Constraint Satisfaction problems Can we satisfy all given constraints? If yes, how do we satisfy them? (need a specific solution) May have
School: University Of Michigan
Lecture 23: Knapsack Solved All Ways Many http:/xkcd.com/287/ EECS 281: Data Structures & Algorithms Knapsack Problem A thief robbing a safe finds it filled with N items Items have various weights or sizes Items have various values The thief has a kna
School: University Of Michigan
Lecture 17: AVL Trees EECS 281: Data Structures & Algorithms 1 Search/Insert Retrieval of a particular piece of information from large volumes of previously stored data Purpose is typically to access information within the item (not just the key) Recal
School: University Of Michigan
Lecture 21: Backtracking Algorithms with Search Space Pruning EECS 281: Data Structures & Algorithms Outline Review Backtracking vs. Branch and Bound Backtracking General Form N-Queens Types of Algorithm Problems Constraint Satisfaction problems Can
School: University Of Michigan
Lecture 16: Binary Search Trees EECS 281: Data Structures & Algorithms 1 Search Retrieval of a particular piece of information from large volumes of previously stored data Purpose is typically to access information within the item (not just the key) Re
School: University Of Michigan
Lecture 18: Graphs and Graph Algorithms EECS 281: Data Structures & Algorithms 1 A Map and Some Crayons 2 A Board Game http:/boardgames.about.com/od/tickettoride/ig/Ticket-to-Ride/USA-Map.htm 3 Airline Routes 4 Formal Definition: Graph Definition: A graph
School: University Of Michigan
Lecture 15: Trees and Tree Algorithms EECS 281: Data Structures & Algorithms 1 Informal Definition: Tree Mathematical abstraction that plays a central role in the design and analysis of algorithms Build and use explicit data structures that are concrete
School: University Of Michigan
Lecture 19: Minimum Spanning Trees EECS 281: Data Structures & Algorithms The Minimum Spanning Tree Problem Given: edge-weighted, undirected graph G = (V,E) Find: subgraph T = (V, E), E E such that All vertices are pair-wise connected The sum of all edg
School: University Of Michigan
Lecture 20: Algorithm Families EECS 281: Data Structures & Algorithms Outline Brute-Force Greedy Divide and Conquer Dynamic Programming Backtracking Branch and Bound Brute-force Algorithms Definition: Solves a problem in the most simple, direct, or obviou
School: University Of Michigan
Course: Comp Architec
Last lecture Some misc. stuff An older real processor Class review/overview. Misc. Status issues HW5 Project presentation signup at http:/ tinyurl.com/470W14talks Answers posted Returned on Wednesday (next week) Locations are all over (see link) Need to b
School: University Of Michigan
Course: Comp Architec
1. `include "testbench/dataoutput.v" 2. f = $fopen("testdata"); 3. displayinclude; python guidebugger/gui.py python guidebugger/gui.py 1. 2. 3. 4. ScreenResolution=1024*600 ClockName=clock_count - - PCRegName=pipeline_0.if_stage_0.PC_reg InstrName=IF,IF/I
School: University Of Michigan
Course: Comp Architec
EECS 470: Computer Architecture Project 3 Guide Friday 31st January, 2013 Verisimple Pipeline Same basic pipeline as book/class If need more info: Appendix A of the book Need to add hazard logic to a simple five stage pipeline Given pipeline without hazar
School: University Of Michigan
Course: Comp Architec
Memory & Caches Disclaimer: These slides may not represent the best way to design your memory and caches, but they are strong recommendations from former 470 GSIs. Administrative Milestone 2 is today Please email Will and Jon a progress report by tonigh
School: University Of Michigan
Course: Comp Architec
EECS 470: Computer Architecture SystemVerilog, Generic Designs, and Miscellanea Discussion #6 Friday, October 24, 2014 Agenda Miscellaneous SystemVerilog Multidimensional arrays unique / priority case Assertions Generic designs generate blocks for loops S
School: University Of Michigan
Course: Comp Architec
EECS 470 Lab 5 Linux Shell Scripting Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Friday, 3rd October, 2014 (University of Michigan) Lab 5: Scripting Friday, 3rd October, 2014 1 / 40 Overview Admi
School: University Of Michigan
Course: Comp Architec
EECS 470 Lab 1 Verilog: Hardware Description Language Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Friday, 5th September, 2014 (University of Michigan) Lab 1: Verilog 05-09-2014 1 / 60 Overview EE
School: University Of Michigan
Course: Comp Architec
EECS 470 Lab 4 Version Control System Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Friday, 26th September, 2014 (University of Michigan) Lab 4: VCS Friday, 26th September, 2014 1/ 20 Overview Admi
School: University Of Michigan
Course: Comp Architec
EECS 470 Lab 3 SystemVerilog Style Guide Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Friday, 19th September 2014 (University of Michigan) Lab 3: Style Friday, 19th September 2014 1 / 36 Overview
School: University Of Michigan
Course: Comp Architec
EECS 470 Lab 2 Synopsys Build System Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Friday, 12th September 2014 (University of Michigan) Lab 2: Build System Friday, 12th September 2014 1 / 42 Overvi
School: University Of Michigan
Course: Comp Architec
Dreslinski 2010- Portions Falsafi, Hill, Hoe, Lipasti, Martin, Roth, Shen, Smith, Sohi, Vijaykumar, Wenisch EECS 470 Lecture 17 Mul1processors I Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ Class website h3p:/www.eecs.umich
School: University Of Michigan
Course: Comp Architec
EECS 470 Lecture 16 High B/W Caches Dreslinski 2010- Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Mudge, Shen, Smith, Sohi, Tyson, Vijaykumar, Wenisch Bank Data bus Fall 2014 Class website h3p:/www.eecs.umich.edu/courses/eecs4
School: University Of Michigan
Course: Comp Architec
Dreslinski 2010- Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Shen, Smith, Sohi, Tyson, Vijaykumar, Wenisch EECS 470 Lecture 19 Prefetching History Table Correlating Prediction Table Latest A0 A0,A1 A3 11 Fall 2014 A1 Trevor Mudge
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Review EECS 470 Slide 1 Announcements Exam is Thursday, 12/18 1:30-3:30 in 1303/1311 EECS EECS 470 I recommend bringing a scientific calculator Open note / open book Last name A-L 1311, M-Z 1303 Slide 2 Stuff from the first half Parallelism
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Mudge, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 15 Reducing Miss Rates DEC Alpha Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ BIU Class
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 12 Wide Instruc6on Fetch Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ Class website h3p:/www.eecs.u
School: University Of Michigan
Course: Comp Architec
Dreslinski 2010 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Mudge, Shen, Smith, Sohi, Tyson, Vijaykumar, Wenisch EECS 470 Lecture 15 Reducing Miss Rates DEC Alpha Fall 2014 Class website h3p:/www.eecs.umich.edu/courses/e
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Mudge, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 11 Instruc2on Flow T TT TT T Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ T N NT T
School: University Of Michigan
Course: Comp Architec
Dreslinski 2013 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Mudge, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar, Wenisch EECS 470 Lecture 2 Performance, Power & ISA Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Mudge, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 10 Memory Specula6on Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ Class website
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Mudge, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 13 Basic Caches Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ Class website h3p:/www.eecs.umic
School: University Of Michigan
Course: Comp Architec
Wenisch 2010 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 4 Pipelining & Hazards II GAS STATION Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ Class
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 9 MIPS R10000 Fall 2014 Trevor Mudge h3p:/web.eecs.umich.edu/~tnm/ MulCprocessor SGI Origin Us
School: University Of Michigan
Course: Comp Architec
Wenisch 2010 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Mudge, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 3 Pipelining & Hazards I GAS STATION Trevor Mudge h,p:/web.eecs.umich.edu/~tnm/ Class websit
School: University Of Michigan
Course: Comp Architec
Wenisch 2009 - Portions Austin, Brehob, Falsafi, Hill, Hoe, Lipasti, Martin, Mudge, Roth, Shen, Smith, Sohi, Tyson, Vijaykumar EECS 470 Lecture 8 P6 architecture Fall 2014 Trevor Mudge Core 2 Microarchitecture h3p:/web.eecs.umich.edu
School: University Of Michigan
University of Michigan WINTER 2011 EECS 401: Solution to Mid Term Examination I 1. TRUE. Consider the following argument: P (A B) C) = P (A C) (B C) (1) = P (A C) + P (B C) P (A C) (B C) (2) = P (A C) + P (B C) P (A B C), (3) where the rst equation follo
School: University Of Michigan
Course: Circuits
Sample solutions EECS 314 Winter 2008 Final Exam Instructor: Alexander Ganago ganago@umich.edu Wednesday April 23, 2008, 10:30 AM 12:30 PM Exam rooms, according to the [first letter of] students' last names: A.K L.P R.Z 220 Chrysler Auditorium (our lectur
School: University Of Michigan
EECS 216 EXAM #2 - Winter 2008 x(t) cos(3t)dt=: 1. Fourier series of x(t) is cos(t)+ 1 cos(2t)+ 1 cos(3t)+. . . Then 2 3 1 (a) 0 (b) 3 (c) (d) (e) 2 6 3 3 2 2. Impulse response of an LTI system with frequency response (j)2 +4(j)+4 is: (a) Nonc
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
EECS 280: Midterm Fall 2006 This is a closed-book exam; no notes are allowed. There are 5 problems on 17 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note al
School: University Of Michigan
Course: Programming And Data Structures
EECS 280: Midterm Winter 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that is required o
School: University Of Michigan
Course: Programming And Data Structures
uniqname: EECS 280 Midterm Exam Spring 2012 This is a closed-book exam. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all that
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
EECS 280: Final Fall 2006 This is a closed-book exam; no notes are allowed. There are 5 problems on 13 pages. Read the entire exam through before you begin working. Work on those problems you find easiest first. Read each question carefully, and note all
School: University Of Michigan
Course: Database Mgt Syst
EECS 484: Final Exam, Winter 2013 Please print your name and uniqname below. Name: Uniqname: Instructions: 1. The total number of points on this exam is 105. 2. During the exam, you may use three sheets of notes (stapled and with your names on each sheet)
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Sample Exam 2 EECS 203 Spring 2014 You have two hours to complete this exam. You may use any information you have written on two 8.5 11 sheets of paper. Problem 1. Zero or more of the following statements are true. Which ones are they? (a) The number of p
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Sample Exam 1 Answers EECS 203 Spring 2014 Each part of Problem 1-9 is a true-false question. Here are the answers Problem 1 2 3 4 5 Part Answer a F b T c T d F a T b F c T d T a F b F c F d T a T b F c T d F e T a T b T c T d F Problem Part Answer 6 a T
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Exam 1 Answers EECS 203 Spring 2014 Section 1 - Multiple Choice For each of the problems 1 through 7 on the following pages indicate your answers by circling the appropriate letters below. For each problem the number of letters circle you may circle anywh
School: University Of Michigan
Course: Database Mgt Syst
EECS484:FinalExam,Winter2013 Please printyournameanduniqnamebelow. Name: Uniqname: Instructions: 1. Thetotalnumberofpointsonthisexamis . 105 2. During the exam, you may use sheets of notes (stapled and with yournamesoneachsheet) a three and SATapproved o
School: University Of Michigan
Course: Database Mgt Syst
Practice Midterm Solutions EECS 484 Question 1 Assume that Yummy484 is a top-level entity (meaning we dont need to make a separate box for it). Yummy484 consists of many franchisees located across the world. For each franchisee, track the franchisees a
School: University Of Michigan
Course: Database Mgt Syst
Database Mid-term Practice Exam Please print your name and uniqname below. Name: Uniqname: Instructions: 1. This is a closed book exam. The use of electronic devices is not permitted on this exam. But you are allowed to bring hand-written notes on one dou
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2012 Exam 2 Part 1 17 questions @ 5 pts each max 80 points (so you get one question on us) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your C
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2012 Exam 1 Part 1 (80 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones Multiple Choice Questions Form 1 Instructions: Read Carefully! 1. This is a closed book exam. You may not refer to
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2012 Exam 1 Part 2 (90 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones Analyze / Write Small Programs Name: UM unique name: @umich.edu Discussion section: (circle) Eva(Tue 9-10) Alex(Tue
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2013 Exam 2 Free Response Part (80 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electron
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2013 Exam 2 Free Response Part (80 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electron
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2013 Exam 2 Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electronic devices that we see including
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2013 Exam 1 Part 2 (90 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electronic devices
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Winter 2013 Exam 1 Part 1 (80 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electronic devices that we see
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Fall 2013 Exam 1 Sample Questions Answers shown in Blue Scantron Portion 1 Consistent indenting in Python is used to: A) Group code logically B) Prevent errors from the interpreter C) Make the code easier to read D) All of the above E) None of th
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Fall 2013 Exam 1 Sample Questions Scantron Portion 1 Consistent indenting in Python is used to: A) Group code logically B) Prevent errors from the interpreter C) Make the code easier to read D) All of the above E) None of the above 2 Which of the
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Answers for Exam 2 MC - Key 1-Q1) D Q2) E Q3) E Q4) threw out - should be 'E' Q5) B Q6) E Q7) D Q8) E Q9) B Q10) B Q11) A Q12) C Q13) C Q14) D Q15) B Q16) E Q17) A Q18) A Q19) C Q20) E Q21) D Q22) D we also accepted 'E' because we didn't list the prototyp
School: University Of Michigan
Course: Building Applications For Information Environments
EECS182MIDTERM SamanthaHerman Variables&Types C+ Inc+avariableisaplacetostoreinformationsoyoucanreuseitlater Char,int,float,doublearethedifferenttypesused Definingvariableex:intmyAge; Specialcharacters:\n=newline,\t=tab,\b=backspace,\=doublequote,\=si
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Practice Problem 1) Mr. Pickle has a daycare set up full of rugrats (children). Each of these children has a name, possible sibling(s), and two parents. Each parent has a first name, last name, phone number, child at Mr. Pickles daycare and job. class Day
School: University Of Michigan
Course: Comp Architec
Name: _ Uname: _ You have 25 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture starts. There are 2 pages to this quiz. I have neither gi
School: University Of Michigan
Course: Comp Architec
Name: _ Uname: _ You have 25 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture starts. There are 2 pages to this quiz. I have neither gi
School: University Of Michigan
Course: Comp Architec
EECS 470 Quiz, Winter 2011. Closed book, closed notes Name: _ Uname: _ You have 15 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture sta
School: University Of Michigan
Course: Comp Architec
EECS 470 Quiz, Winter 2011. Closed book, closed notes Name: _ Uname: _ You have 15 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture sta
School: University Of Michigan
Course: Comp Architec
EECS 470 Quiz, Fall 2009. Closed bookfclosed notes! Name: KEY Uname: KEY You have 20 minutes for this quiz. The quiz is closed notesfclosed book. If you should nish early, you are welcome to turn in your quiz and step out of the room until the lecture sta
School: University Of Michigan
Course: Comp Architec
Name: _ Uname: _ You have 25 minutes for this quiz. The quiz is open notes/open book, but you likely wont have time to look anything up. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture starts. Th
School: University Of Michigan
Course: Comp Architec
Name: _ Uname: _ You have 25 minutes for this quiz. The quiz is open notes/open book, but you likely wont have time to look anything up. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture starts. Th
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Winter 2011 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 5 6 7 8 9 Total Points /18 /7 /8 /9 /7 /12 /14 /10 /15 /100 NOTES: Open b
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Winter 2011 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 4 5 6 7 8 9 10 Total Points /20 /9 /10 /7 /10 /12 /12 /4 /15 /100 NOTES: Open
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Answers Fall 2009 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 & 9 Points /18 /15 /8 /1
School: University Of Michigan
Course: Comp Architec
EECS 470 Quiz, Fall 2009. Closed book/closed notes! Name: _ Uname: _ You have 20 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture start
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2012 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page # 2 3 4 5 6 7 8&9 Total Points /20 /11 /13 /15 /10 /16 /15 /100 NOTES: Open
School: University Of Michigan
Course: Comp Architec
Name: _Key_ Uname: _ You have 25 minutes for this quiz. The quiz is closed notes/closed book. If you should finish early, you are welcome to turn in your quiz and step out of the room until the lecture starts. There are 2 pages to this quiz. I have neithe
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2009 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 & 9 Points /18 /15 /8 /15 /11 /1
School: University Of Michigan
Course: Comp Architec
2) In one or two sentences explain why we dont use the most significant bits of an address for the index bits of a cache. [6] Sfahn' IOCQIIFX +6) us th'f W6 (36 Light/x +0 55? races sses Thqf at"? new (few get/Mb S 5315? . ' cfw_7 / AS Hausa daj' geaah/ L
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2009 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2&3 4 5 6 7 8 9 10 Total Points /20 /10 /10 /7 /10 /12 /12 /4 /15 /100 NOTES: O
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam ANSWER KEY Winter 2011 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Page 2 /12 Page 3 /12 Page 4 /12 Page 5 /14 Page 6 /6 Page 7
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Winter 2008 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page # 2 3 4 5 6 7 8 9&10 Total Points /13 /15 /13 /8 /11 /12 /13 /15 /100 NOTES: O
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Fall 2006 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page # 2 3 4/5 6 7 8 9 Total Points /8 /12 /26 /12 /12 /10 /20 /100 NOTES: 1. 2. 3. 4
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2007 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # A.1 A.2-A.4 A.5 B.1 B.2 B.3 Total Points /18 /18 /9 /10 /25 /20 /100 NOTES: Ope
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Answers Fall 2006 Name: _KEY_ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Page 2 /18 Page 3 /13 Page 4 /15 Page 5 /10 Page 6 /12 Page 7
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2006 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Page 2 /18 Page 3 /13 Page 4 /15 Page 5 /10 Page 6 /12 Page 7 /10 Page 8-9
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2005 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Section 1 /40 Section 2 1 /18 2 /10 3 /8 Section 3 /24 Total /100 NOTES: O
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Winter 2012 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 Page 9 Page 10 Page 11 Total Poi
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Fall 2013 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page# 2 3 4 5 6 7 8 9 Total Points /21 /8 /12 /10 /12 /10 /12 /15 /100 NOTES: Open bo
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2014 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Page 2 /12 Page 3 /10 Page 4 /10 Page 5 /13 Page 6 /11 Page 7 /11 Page 8
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Fall 2011 - Solutions Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 Total Points / 24 / 27 / 27 / 22 / NOTES: Closed book. Calculat
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2014 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # Points Page 2 /12 Page 3 /10 Page 4 /10 Page 5 /13 Page 6 /11 Page 7 /11 Page 8
School: University Of Michigan
Course: Comp Architec
EECS 470 Final Exam Fall 2011 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 Total Points / 24 / 27 / 27 / 22 / NOTES: Closed book. Calculators are allo
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2013 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page # 2 3 4 5 6 7 8 9 Total Points /15 /12 /12 /12 /16 /7 /6 /20 /100 NOTES: Open
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Fall 2013 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: Page # 2 3 4 5 6 7 8 9 Total Points /15 /12 /12 /12 /16 /7 /6 /20 /100 NOTES: Open
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2010 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 5 Total Points / 12 / 18 / 22 / 28 / 20 / 100 NOTES: Closed book. One 8
School: University Of Michigan
Course: Comp Architec
EECS 470 Midterm Exam Winter 2010 Name: _ unique name: _ Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. _ Scores: # 1 2 3 4 5 Total Points / 12 / 18 / 22 / 28 / 20 / 100 NOTES: Closed book. One 8
School: University Of Michigan
Course: Digital Integrated Technology
H N % -L qj _\ Q q - - 4-ED c ) c) - L \ Hj c N ( s .& I o >< <.-.-. - . . , - I c It N l cA -1 i 1 Q c 0 aI <1 1- + 1 ; - r 0 a LA I a o. _ -p -t 1 k >( 0 )S + I N - P. ft I - r4\ (r\ p co> IoI. [ *7 ts 7oxc ) O/Q 4 / s+ SvI/yjf tJ5ij fi /),o6/e4- 2 1OS
School: University Of Michigan
Course: Comp Architec
EECS 470 Fall 2014 HW1 solutions 1a) Loop: LD DADDI SD DADDI DSUB DADDI BNEZ R1, 0(R2) R1, R1, #1 0(R2), R1 R2, R2, #4 R4, R3, R2 R5, R5, #1 R4, Loop Instruction 1 2 3 4 5 LD IF ID EX MEM WB IF ID* ID* IF* IF* 8 ID EX MEM WB IF ID* ID* IF* 10 11 ID EX MEM
School: University Of Michigan
Course: Digital Integrated Technology
) /-ik/f3 4- e Fa piu + e/A, sI p & II14 4/oi11 = I /-/Dq.2JAi 492q + i,t 1 A1 ,ww I (i&17q s)?Ivf I Q Z.4 ,c, C4c 3E) ,/ to -c )Y(.)L1)acO/ itl :d J(I UVfJ1141 1 . .4 I). ,OL4nDAC ,p,q do . 1 , af2L1P( [7 ,tQO U! :LA ft?1 c91 t) i 1 h e*Z 1 L, fa4L1qUI4
School: University Of Michigan
EECS 203: Homework 1 Solutions Section 1.1 1. (E) 8bef b) You do not miss the final exam if and only if you pass the course. e) If you have the flu then you do not pass the course, or if you miss the final examination then you do not pass the course. f) Y
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Database Mgt Syst
EECS 484 Homework #5 Question 1 Consider the following relational schema and SQL query: Students(sid, sname, gpa) Takes(sid, cid) Class(cid, cname, ctype) SELECT S.sname, C.cname FROM Students S, Takes T, Class C WHERE S.sid = T.sid AND T.cid = C.cid AND
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Homework #3 Total: 180 Points Fall 2007 Handed Out: Due: Friday Sept. 21, 2007 Friday Sept. 28, 2007 1. This problem deals with etching of the silicon device shown below. The figure shows the cross section and the t
School: University Of Michigan
Course: Digital Integrated Technology
University of Michigan Department of Electrical Engineering and Computer Science EECS 523 HW#4 Fall 2012 Due (at the beginning of the class): October 30 1- A 0.5m thin poly has been implanted with both phosphorus and boron impurities with a dose of 6 x 10
School: University Of Michigan
EECS 314 Winter 2008 Homework set 8 Student's name _ Discussion section # _ (Last, First, write legibly, use ink) (use ink) Instructor is not responsible for grading and entering scores for HW papers lacking clear information in the required field
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Fall 2007 Class Handouts and Notes, Bulk Micromachining, Surface Micromachining, and Wafer Bonding. Homework #5 Total: 240 Points Handed Out: Friday October 5, 2007 Due: Friday October 12, 2007 1.
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Homework #2 Total: 165 Points Fall 2007 Class Handouts and Notes, Introduction to Microfabrication Technologies Handed Out: Due: Thursday Sept. 13, 2007 Friday Sept. 21, 2007 1. Thermal and e-b
School: University Of Michigan
Course: Circuits
EECS314 Studentsname_ Discussionsection#_ (Last,First,writelegibly,useink) (useink) InstructorisnotresponsibleforgradingandenteringscoresforHWpaperslacking clearinformationintherequiredfieldsabove Winter2011 Homeworkset3 Problem1(20points)Resistanceandr
School: University Of Michigan
EECS 203 HW 1 10. Let p, q, and r be the propositions p: You get an A on the final exam. q: You do every exercise in this book. r: You get an A in this class. Write these propositions using p, q, and r and logical connectives. a) You get an A in this
School: University Of Michigan
EECS 216 - Winter 2012 Homework 1 Solutions 1. Find the fundamental period T of each of the following four signals: (a) cos(t ) (b) sin( t ) (c) cos( 52 t ) (d) cos( 35 t ) 3 Solution: (a) T = 2 = 2 (b) T = 2 /3 = 6 (c) T = 2 5/2 = 4/5 (d) T = 2 3/5 = 10/
School: University Of Michigan
Course: Introduction To MEMS
EECS 414 Introduction to MEMS Reading Assignments Homework #4 Total: 350 Points Fall 2007 Class Handouts and Notes: Silicon Wet Etching, Wafer Bonding, Bulk Si Micromachining, and Surface Micromachining. Handed Out: Due: Friday Sept. 28, 2007 F
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Homework 5. Fall 2012 Name: _ unique name: _ You are to turn in this sheet as a cover page for your assignment. The rest of the assignment should be stapled to this page. This is an individual assignment; all of the work should be your own unless
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Homework#2 Mei Yang 1. Answer: a. 35(dec) = 4*8 + 3 = 43 (oct) b. 35(dec) = 2*16 + 3 = 23 (hex) c. 1111_1111(2s complement) = 1 (dec) d. 1000_1000(2s complement, Q4) = 8+0.5=7.5 e. 1111_1111(binary u
School: University Of Michigan
Course: INTRODUCTION TO CIRCUITS
Circuits by Fawwaz T. Ulaby and Michel M. Maharbiz Solutions to the Exercises Fawwaz T. Ulaby and Michel M. Maharbiz, Circuits c 2009 National Technology and Science Press ISBN-10: 1-934891-00-2 ISBN-13: 978-1-934891-00-1 Publisher: Tom Robbins General Ma
School: University Of Michigan
Course: Dsp Design Lab
EECS 452 Homework 4. Fall 2012 Solutions Name: _ unique name: _ You are to turn in this sheet as a cover page for your assignment. The rest of the assignment should be stapled to this page. This is an individual assignment; all of the work should be your
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Supplemental Study Material for Section 5.5 5.5.12. How many different combinations of pennies, nickels, dimes, quarters, and half dollars can a piggy bank contain if it has 20 coins in it? Solution: There are 5 things to choose from, repetitions
School: University Of Michigan
Course: Signal Processing
Section 5.2 8 Suppose A = uv T is a column times a row (a rank-1 matrix). (a) By multiplying A times u, show that u is an eigenvector. What is ? Solution. Au = (uv T )u = u(v T u) = (v T u) u, so by denition, u is an eigenvector with the associated eigenv
School: University Of Michigan
Course: Database Mgt Syst
Discussion10 QueryEvaluationandHomework3solutions EECS 484 QueryEvaluation B+ tree can be used for range and equality selection Hash based indexing can be used for only equality selection Composite keys - combination of keys Hash: Requires all the key
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Dijkstas Algorithm Handout EECS 203 Spring 2014 Dijkstras Algorithm is an ecient algorithm to nd the shortest distance between two vertices in a graph. It is easy to modify the algorithm for directed graphs. The input to the algorithm is a graph G = (V, E
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Dijkstas Algorithm Handout Exercise Answers b 5 d 2 2 2 a 3 4 5 c z 1 e Graph G = (V, E) with edge weights (0) (2) (4) v L[v] P [v] a 0 b c d e z v L[v] P [v] a / / b 2 a c 3 a d 7 b e 4 b z v L[v] P [v] a / / b 2 a / c 3 a d 5 e e / 4 b z 8 e (1) (
School: University Of Michigan
Course: Comp Architec
Date: Friday, 5th September 2014 University of Michigan, Ann Arbor EECS 470 Lab 1 Assignment Note: The lab should be completed individually. The lab must be submitted by the end of the day Thursday, 11th September, 2014. 1 Linux Introduction and Setup T
School: University Of Michigan
Course: Comp Architec
Date: September 24th , 2014 University of Michigan, Ann Arbor EECS 470 Project #3 This is an individual assignment. You may discuss the specication and help one another with the (System)Verilog language. The modications you submit must be your own. This
School: University Of Michigan
Course: Comp Architec
Date: 3rd October, 2014 University of Michigan, Ann Arbor EECS 470 Lab 5 Assignment Note: The lab should be completed individually. The lab must be submitted by the 11:59PM tomorrow night, using the submission script. 1 Introduction You have just learne
School: University Of Michigan
Course: Comp Architec
Date: 26th September, 2014 University of Michigan, Ann Arbor EECS 470 Lab 4 Assignment Note: The lab should be completed individually. The lab must be submitted by the end of Thursday oce hours the following week and checked o by a GSI. 1 Introduction Y
School: University Of Michigan
Course: Comp Architec
Date: October 23rd , 2014 University of Michigan, Ann Arbor EECS 470 Lab 6 Assignment Note: The lab should be completed individually. The lab must be submitted by 11:59PM on October 25th. 1 Introduction In this lab you will be designing a simplied, gene
School: University Of Michigan
Course: Comp Architec
Date: September 19th , 2014 University of Michigan, Ann Arbor EECS 470 Lab 3 Assignment Note: The lab should be completed individually. The lab must be submitted using the submission script by 11:59PM Saturday, 20th September 2014. 1 Introduction This l
School: University Of Michigan
Course: Comp Architec
Date: Friday, 12th September 2014 University of Michigan, Ann Arbor EECS 470 Lab 2 Assignment Note: The lab should be completed individually. The lab must be submitted using the submission script by Saturday 13th September, 2014 at 11:59PM. 1 Assignment
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 12 Issued: 11/21/14 Due: THURSDAY, 12/4/14, 5:00 PM in the designated drop box in 2420 EECS. Ensure that your name/discussion section# are on the paper (-0.5 point if missing). U&M refers t
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 11 Issued: 11/14/14 Due: 11/21/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name/discussion section# are on the paper (-0.5 point if missing). U&M refers
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 13 Issued: 12/7/14 This assignment will not be collected or graded. Solutions will be provided prior to the final exam. U&M refers to a problem from Ulaby and Maharbiz 2nd Edition. Problems
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
% 5 (b) t = 0:1e-5:1e-2; % time interval Vin = 1.0*sin(2*pi*440*t); % input signal Vout = 5.26*Vin; % output signal plot(t,Vin,'b','LineWidth',2); % plot input hold on % use same figure plot(t,Vout,'g','LineWidth',2); % overplot output xlabel('time (s)');
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 10 Issued: 11/6/14 Due: 11/13/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name/discussion section# are on the paper (-0.5 point if missing). U&M refers
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 9 Issued: 10/30/14 Due: 11/6/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name and discussion section number are on the paper (-1/2 point if missing). U&
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 8 Issued: 10/23/14 Due: 10/30/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). U&M refers to a problem from Ulaby and Maharbiz 2nd Edition. Warning: 0.5 points will be detrac
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 7 Issued: 10/16/14 Due: 10/23/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). U&M refers to a problem from Ulaby and Maharbiz 2nd Edition. Warning: 0.5 points will be detrac
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Generated by CamScanner from intsig.com Generated by CamScanner from intsig.com Generated by CamScanner from intsig.com Generated by CamScanner from intsig.com Generated by CamScanner from intsig.com Generated by CamScanner from intsig.com Generated by Ca
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 6 Issued: 10/9/14 Due: 10/16/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name and discussion section number are on the paper. U&M refers to a problem fr
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 6 Issued: 10/9/14 Due: 10/16/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name and discussion section number are on the paper. U&M refers to a problem fr
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 5 Issued: 10/2/14 Due: 10/9/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Ensure that your name and discussion section number are on the paper. U&M refers to a problem fro
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 4 Issued: 9/25/14 Due: 10/2/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). U&M refers to a problem from Ulaby and Maharbiz 2nd Edition. Warning: 0.5 points will be detracte
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 3 Issued: 9/18/14 Due: 9/25/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Warning: 0.5 points will be detracted unless both your discussion section number and name are cle
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 4 Issued: 9/25/14 Due: 10/2/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). U&M refers to a problem from Ulaby and Maharbiz 2nd Edition. Warning: 0.5 points will be detracte
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215 - Fall 2014 - Problem Set 1 Solutions 1. U&M 1.11 - 1 point: half point for the correct diagram, half point for identifying series and parallel elements. (a, b) Ordinary and extraordinary nodes: (c, d) In series: 4 and 6 resistors (combination 1)
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 1 Issued: 9/4/14 Due: 9/11/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Please attach the problem set cover page from the Ctools site and be sure to put your name and dis
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 215: Introduction to Electronic Circuits FA 2014 Problem Set 2 Issued: 9/11/14 Due: 9/18/14, 5:00 PM in the designated drop box in 2420 EECS (GSI Room). Please attach the problem set cover page from the CTools site and be sure to put your name and di
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
*temperature.handtemperature.cppHAVEMISTAKES.Canyoufind7differentconceptstoadd/fix? temperature.h #fdfTMEAUEH ine EPRTR_ #eieTMEAUEH dfn EPRTR_ #nld <tig icue srn> casTmeauecfw_ ls eprtr pbi: ulc vi Tmeaue dul iDges srn iSae) od eprtr( obe nere, tig ncl ;
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
*temperature.handtemperature.cppHAVEMISTAKES.Canyoufind7differentconceptstoadd/fix? temperature.h #nld <tig icue srn> casTmeauecfw_ ls eprtr pbi: ulc vi Tmeaue dul iDges srn iSae) od eprtr( obe nere, tig ncl ; vi pitep) od rnTm(; piae rvt: dul dges obe er
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Data Types Python: C+: How it is identified in code: example: integer integer int 4 float double double -3.14 boolean boolean bool true string string string ( must #include <string> ) word character char B Syntax Differences Python: C+: Each line is a sta
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Writeacompleteprogramwhichpromptstheuserforhisorhersoupchoiceandthenprintsoffa response. Prompt: Pickyourchoiceofsoup (tfortomato,cforchickennoodle,vforvegetable): Responses: Youchosetomatosoup. or Youchosechickennoodlesoup. or Youchosevegetablesoup. or N
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
RegradePolicy: AppealsforaregrademustbesubmittednolaterthanONEWEEKaftertheexamsare handedout.Soforthosehererightnow,youhaveuntildiscussion nextweek(Tuesday,10/28,2pm).Youmayhandthembacktoanystaffmember. Youmustattachapapertothefrontofyourexam,outliningwhi
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
itfoitx cfw_ n o(n ) cu < xot < -; rtr x eun ; itbrity cfw_ n a(n ) cu < y ot < ; rtr y2 eun +; 1.Whatprints? ita=2 n ; cu < a ot < ; foa; o() cu < a ot < ; 2.Whatprints? itb=3 n ; cu < b ot < ; b=brb; a() cu < b ot < ; 3.Whatprints? itc=4 n ; cu < c ot
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
itfoitx cfw_ n o(n ) cu < xot < -; rtr x eun ; itbrity cfw_ n a(n ) cu < y ot < ; rtr y2 eun +; itbzit&)cfw_ n a(n z z+ +; cu < z ot < ; rtr z eun ; z+ 2 = ; 1.Whatprints? ita=2 n ; cu < a ot < ; foa; o() cu < a ot < ; 2.Whatprints? itb=3 n ; cu < b ot
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab4 Pre-lab Mei Yang Q1. Answer: From the figure that has been generated, we can clearly see that the max gain is 60dB. Q2. Answer: From the matlab design, we can easily get that: a. 210 b. 35 Q3. Answer: For the passband, the difference is very
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab questions: Q1. Consider the logic statement (A*B)+(C*A) a. Write the truth table for that logic statement b. Draw the gates that implement that logic statement (without simplification). A, B 00 01 10 11 C=0 0 0 0 1 C=1 1 1 0 1 Q2. Consider a 2-to-
School: University Of Michigan
EECS 215 Lab Supplementary Materials / Op Amp Lab Cover page Op Amp Lab Report Students Name _ Date of Lab Work _ I have neither given nor received aid on this report, nor have I concealed any violations of the Honor Code. _ (students signature) Lab Secti
School: University Of Michigan
EECS 373 Lab 3: Introduction to Memory Mapped I/O In this lab we will learn: To develop custom peripheral hardware in the SmartFusion FPGA using the Libero CAD tools. The fundamentals of memory-mapped I/O (MMIO). To interface the ARM peripheral bus (APB3)
School: University Of Michigan
EECS 373 Lab 2: Software Toolchain Copyright 2010-2011, Thomas Schmid, Matt Smith, Ye-Sheng Kuo, Lohit Yerva, and Prabal Dutta. 1/22/14 Schedule See posted lab schedule for due dates, in-lab, and post-lab due dates. Objectives The purpose of this lab is t
School: University Of Michigan
EECS 373 Lab 6: Serial Bus Interfacing Copyright 2013 Matt Smith, 10/9/2014 Schedule See posted lab schedule. This is a two week lab and consists of two parts. Part 1 is due within the first week and consists of the following. 1) Answers to questions and
School: University Of Michigan
EECS 373 Lab 5: Clocks, Timers, and Counters Copyright 2010-2011, Thomas Schmid, Matt Smith, Ye-Sheng Kuo, Lohit Yerva, and Prabal Dutta. rev 2/11/14 Schedule See Posted Schedule Pre-Lab Assignment 1. Read through this C Language tutorial. 2. Read through
School: University Of Michigan
EECS 373 Lab 1: Introduction to the Hardware Development Tools 9/4/13 Schedule See posted lab schedule for due dates, in-lab, and post-lab due dates. Objectives In this lab you will learn to: 1. Use Microsemi's integrated design environment (Libero SoC) t
School: University Of Michigan
EECS 373 Lab 4: Interrupts Copyright 2010-2011, Thomas Schmid, Ye-Sheng Kuo, Matt Smith, Lohit Yerva, and Prabal Dutta. Revised 2/11/14 Schedule See posted lab schedule for due dates, in-lab, and post-lab due dates. Objectives The purpose of this lab is t
School: University Of Michigan
Post Lab 7 Answer Sheet Yuening Zhang, Wenqi Dong Sampling Questions 1) At what frequency did you notice the aliasing frequency was nearly zero? How does it compare to the sampling frequency? 8kHz. It is the same as the sampling frequency. 2) At what fre
School: University Of Michigan
Course: Comp Architec
Date: September 14th , 2014 University of Michigan, Ann Arbor EECS 470 Project #2 This is an individual assignment. You may discuss the specication and help one another with the (System)Verilog language. Your solution, particularly the designs you submit
School: University Of Michigan
Course: Comp Architec
Date: September 3rd , 2014 University of Michigan, Ann Arbor EECS 470 Project #1 This is an individual assignment. You may discuss the specication and help one another with the (System)Verilog language. Your solution, particularly the designs you submit,
School: University Of Michigan
Course: Embedded Control Systems
Roadway Geometry and Coordinate Transform Simulink Blocks Paul Griffiths, 11-17-2004 For the final project, you use the bicycle model, which describes the motion of a simulated vehicle in X, Y coordinates. Your simulated vehicle rolls around on a twodimen
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 8: Introduction to Autocode Generation 1 Overview The purpose of this exercise is to create programs for the MPC5553 by generating code from a Simulink model. This method of creating programs from high-level modeling languages, su
School: University Of Michigan
Course: Embedded Control Systems
Lab 8 (UM) & Lab 7 (ETH): Autocode Genera:on Lab #8: Automatic Code Generation from SimulinK Models Adding program from LAB #1 Implement as Simulink model and code generate Virtual wall using Stateflow Double spring-mass-damper Fast and sl
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 7: Controller Area Network 1 Overview The design of a complex control system often requires coordinated activity of many sensors, actuators and other devices that are separated by some signicant distance. As a result, the design m
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 7 (UM) and Lab 8 (ETH): Control Area Network 2 Lab 7: Controller Area Network For a general description of CAN, see the document posted on the course website Lab 7 has two parts: Part 1: you will write a program that communicates with a neighbori
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 6: Virtual Worlds with Dynamics 1 Overview In this lab, we will design and implement a number of simple virtual worlds. These worlds are various connections of static positions (walls), dampers (dashpots), and springs. Our interfa
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 6: Virtual Worlds with Dynamics 2 Lab 6: Virtual Worlds We now have everything we need to build virtual systems: Input (quadrature decode using the eTPU) Output (PWM motor control using the eMIOS) Time (interrupt processing) Virtual Wall with D
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 5: Interrupts, Timing, and Frequency Analysis of PWM Signals 1 Overview In the rst four labs, you have not dealt with time in the design of your code. For many applications (in fact, for almost all embedded control applications),
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 5: Interrupts, Timing, and Frequency Analysis of PWM Signals 2 Lab 5: Interrupts and Timing Thus far, we have not worried about time in our real-time code Almost all real-time code involves sampling (recall our discussion about sampling and aliasi
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 4: Pulse Width Modulation and Simple Virtual Worlds 1 Overview The purpose of this lab is to use the Pulse Width Modulation functions of the (enhanced) Modular Input/Output Subsystem (eMIOS). The PWM Submodule will be used to cont
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 4: Pulse Width Modulation and Lab 4: Pulse Width Modulation and Introduction to Simple Virtual Worlds Introduction to Simple Virtual Worlds (PWM) (PWM) 2 Virtual Spring and Virtual Wall Virtual Spring Puck attached to a reference point by a virtua
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 3: Queued Analog-To-Digital Conversion 1 Overview In this lab you will learn how to use the analog to digital converters on the MPC5553 microcontroller. You will then sample a sine wave produced by the signal generator and display
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 3: Queued A-D Conversion (eQADC) 2 Queued Analog-to-Digital Conversion Acquire analog inputs from the potentiometer and observe the result using the debugger Using an oscilloscope, measure the time required to complete one conversion by toggling G
School: University Of Michigan
Course: Embedded Control Systems
1 Lab 2: Quadrature Decoding using the eTPU 2 Lab 2: Quadrature Decode Use slow mode quadrature decode Read the optical encoder and update a 16-bit position count register to track wheel position in counts and as angular position Use the debugger to
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 2: Quadrature Decoding using the eTPU 1 Overview The purpose of this lab is to learn about quadrature decoding and apply knowledge of sampling. To do so, we will use the Quadrature Decoding function of the MPC5553 enhanced Time Pr
School: University Of Michigan
Course: Embedded Control Systems
EECS 461 Spring 2014 Lab 1: Familiarization and Digital I/O 1 Overview The purpose of this lab is to familiarize you with the hardware and software used in EECS 461. For this class we will be using a 32-bit oating-point Freescale MPC5553 microcontroller r
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Blackjack! EECS 280 Winter 2013 Due: Tuesday, April 2nd, 11:59pm Introduction This project will give you experience implementing abstract data types, using interfaces (abstract base classes), and using interface/implementation inheritance. Blackjack (Simp
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Stacks, Queues and Lists EECS 280 Winter 2013 Due: April 23rd, 11:59pm Introduction This project will give you experience implementing a templated container class (the double-ended, doubly-linked list) and using it to implement two simple applications. Ad
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Composable Data Structures EECS 280 Winter 2013 Due: Friday, March 15th, 11:59 PM Introduction Sorry! is a Parker Brothers board game of the "move from start to home" genre, incorporating both random chance and strategy. Players draw cards which specify p
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Project 2: Recursive Data Structures EECS 280 Winter 2013 Due: Friday, February 8th, 11:59 PM Introduction This project will give you experience writing recursive functions that operate on recursively-defined data structures and mathematical abstractions.
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
Project 1: How much car can you afford? EECS 280 Winter 2013 Due: Tuesday, January 22nd, 11:59 PM Introduction This project will give you experience writing, compiling, and debugging a simple C+ program. You will gain experience with header files and mult
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab2 Prelab Mei Yang Q1: Answer: Please see the code below: /* * Filter Coefficients (C Source) generated by the Filter Design and Analysis Tool * Generated by MATLAB(R) 8.1 and the Signal Processing Toolbox 6.19. * Generated on: 16-Sep-2013 15:51
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab5 Prelab Mei Yang Q1. Answer: a. 8 b. 4 c. i. No ii. 1.5ms iii. 2.2ms iv. 83.3us v. Nonlinear. As it is an IIR filter, its group delay is not a constant, therefore its phase is nonlinear. Q2. Answer: a. 1.8147 b. From the zero/pole plot, we can
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab1 Pre-lab Mei Yang Q1. Which GPIO pin is connected to each of the four LEDs? (Red, Blue, Yellow and Green). Use the schematic not the table as there appears to be a typo in the table. In general, it is a good policy to trust the schematic above
School: University Of Michigan
Course: Dsp Design Lab
EECS452 Lab1 In-lab & Post-lab Mei Yang Q4. The C5515 has a built-in LCD controller. The folks who designed the C5515 eZDSP Stick chose not to use that built-in controller and instead used an external I2C controller. d. In the prelab you were asked to dra
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab questions: Q1. In dB, what should be the maximum gain in the stopband? 60 dB Q2. Answer the following questions about your filter that Matlab designed for you. a. What is the order of the filter Matlab designed? 210 b. If you were to make it a But
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab Questions Q1. Answer the following questions about the filter a. What is the order of your filter? 8 b. How many biquad sections are in your filter? 4 c. Look at the group delay. i. Is it constant? No ii. In terms of time what is the largest the g
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab questions Write a short C program that prints the word hi every time the I2S2 transmit interrupt occurs. Dont worry about what that interrupt is, but do be sure to enable it and otherwise set up all the parts needed to get it to work. Model your a
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab Questions Q1. Print the file you generated (and modified) as described above. /* * Filter Coefficients (C Source) generated by the Filter Design and Analysis Tool * * Generated by MATLAB(R) 7.12 and the Signal Processing Toolbox 6.15. * * Generate
School: University Of Michigan
Course: Dsp Design Lab
Pre-lab Questions Q1. Which GPIO pin is connected to each of the four LEDs? (Red, Blue, Yellow and Green). Use the schematic not the table as there appears to be a typo in the table Color Pin Number Green 17 Red 16 Yellow 15 Blue 14 Q2. What are the names
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 4 = Transients Lab Students Name: Students Uniqname: Date of Lab Work: Lab Partners Name: Lab Instructors Name: Points Lab Section # Instructors comments Instructors initials Pre-Lab (25%) In-Lab (25%) Pos
School: University Of Michigan
2013 Fall New EECS 314 Lab: Guitar string vibrations The Guitar Lab (Optional) Experiment 5- 4 of the Spectra Lab, for extra credit Overview We expect that the students will spend ~20 minutes in the lab doi
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 2 = Sensor/Switch Lab Students Name: Students Uniqname: Date of Lab Work: Lab Partners Name: Lab Instructors Name: Points Lab Section # Instructors comments Instructors initials Pre-Lab (25%) In-Lab (25%)
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 5 = Spectra Lab Students Name: Students Uniqname: Date of Lab Work: Lab Partners Name: Lab Instructors Name: Points Lab Section # Instructors comments Instructors initials Pre-Lab (25%) In-Lab (25%) Post-l
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 6 = Filters Lab Students Name: _ Date of Lab Work: _ Students Uniqname: _ Lab Partners Name: _ Lab Instructors Name: _ Lab Section # _ Points Pre-Lab (25%) Instructors comments Instructors initials In-Lab
School: University Of Michigan
InlabdataforExpt63: Lab6page43: 1 2 3 Frequency VIN,ppk Vout,ppk 50Hz 1.05V 40mV Vout, ppk 20log Vin, ppk 0.3809 28.38 200Hz 1.05V 145 mV 0.138 17.19 500Hz 1.05V 334 mV 0.318 9.949 1KHz 1.03V 575 mV 0.5582 5.063 2KHz 1.03V 840
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 3 = Waveforms Students Name: Students Uniqname: Date of Lab Work: Lab Partners Name: Lab Instructors Name: Points Lab Section # Instructors comments Instructors initials Pre-Lab (25%) In-Lab (25%) Post-lab
School: University Of Michigan
Making Sense of Electrical Engineering in the Lab / Fourth edition, Revised Lab 1 = Tutorial Contents Lab 1 Tutorial Start using the Lab resources for learning Table of contents Experiment 1- 1
School: University Of Michigan
EECS 314 Fall 2013 Cover Page for Lab Reports Lab 1 = Tutorial Lab Students Name: Students Uniqname: Date of Lab Work: Lab Partners Name: Lab Instructors Name: Points Lab Section # Instructors comments Instructors initials Pre-Lab (25%) In-Lab (25%) Post-
School: University Of Michigan
The frequencies in Hz of musical pitches Here is a table giving the frequencies in Hz of musical pitches, covering the full range of all normal musical instruments I know of and then some. It uses an even tempered scale with A = 440 Hz. C C# D Eb E F F#
School: University Of Michigan
Making Sense of Electrical Engineering in the Lab / Fourth edition, Revised Lab 2 = Sensor and Switch Contents Lab 2 Sensor and Switch Build your own control circuit Table of contents Page Expe
School: University Of Michigan
Course: Digital Integrated Circuits
Lab 4: Combinational Logic EECS 312 Winter 20 11 Due: Tuesday, Nov 15th 2011, beg inning of lecture Introduction In this lab you will simulate static CMOS implementations of the NAND gate, an NMOS pass gate, transmission gate delay and a NAND gate impleme
School: University Of Michigan
Course: Digital Integrated Circuits
Lab 5: Parasitic capacitances and S equential Circuits EECS 312 Fall 201 1 Due: Wed Nov 23th by 5PM. (Drop it off by Frans desk in EECS 2417) Introduction In this lab, you will be simulating the effect of width and thick ness on the capacitances. Then you
School: University Of Michigan
Course: Digital Integrated Circuits
Lab 3: Inverters EECS 312 Due: Tuesday, Nov 1st 2011, Beg inning of lecture Introduction In this lab, you will be studying three different families of M OS inverters: resistive load NMOS, pseudoNMOS, and CMOS. You will plot the VTCs to find VOH, V OL, VIH
School: University Of Michigan
Course: Digital Integrated Circuits
Lab 2: Measuring Electrical and Physical Parameters of MOS Devices EECS 312 Fall 2011 Due: October 4th, 2011 Beginning of lecture Introduction In this lab, you will be studying in detail the I-V characteristics of MOS devices. In the first part, you will
School: University Of Michigan
Course: Digital Integrated Circuits
Lab 1: Introduction to Cadence EECS 312 Fall 2011 Due: Friday September 23, 2011 1. Introduction This tutorial has been devised to walk you through all the steps involved in the design and simulation of a simple digital circuit using Cadence. Before invok
School: University Of Michigan
EECS 216 Winter 2012 Lab 4: Control Part II: In-lab & Post-lab Assignment (Modied 30 March 2012) The lab has been designed so that you can complete both in-lab and post-lab portions during the three-hour lab. Please plan on handing in your completed post-
School: University Of Michigan
EECS 216 WN12 Laboratory Coversheet Attached to Pre-Lab & Post-Lab assignments. Lab #: 1 2 Circle (one of these): 3 Pre-Lab 4 (circle one of these) Post-Lab Date: _ _ , _ Last Name (please print) First Name (please print) Honor Pledge: I have neither give
School: University Of Michigan
Course: Embedded Control Systems
Matlab RC Filter Design % m-file generates an R-C circuit antialiasing filter num = 1; den = [RC 1]; omega = logspace(-1,3); [mag, phase] = bode(num, den, omega); subplot(2,1,1) % Magnitude and Phase on one page % plot magnitude in dB vs. frequency in Hz
School: University Of Michigan
Course: Embedded Control Systems
EECS 461: Final Project Work Breakdown (Sp14) Work may be completed in any order or at a pace faster than listed below. Below is a suggestion which will allow you to complete as much modeling as possible outside of lab. However, you are responsible for ha
School: University Of Michigan
Course: Embedded Control Systems
RAppID Reference EECS461 March 28, 2013 1 GPIO Peripheral Blocks The main functionality of the GPI block is to set the selected GPIO pin for general purpose input. All the available pins are connected to Dipswitches in the lab. The main functionality of t
School: University Of Michigan
Course: Intr Art Intell
EECS 492: Introduction to Artificial Intelligence Fall 2014 Instructor: Prof. Emily Mower Provost Office Hours: Wednesday 911 Office: 3620 CSE emilykmp@umich.edu GSIs: GSI office hours will take place in the EECS Learning Center (BBB 1637). Duc Le Office
School: University Of Michigan
Course: Computer Vision
EECS442ComputerVision CourseDescription Thecourseisanintroductionto2Dand3Dcomputervision.Topicsinclude:camerasmodels,the geometryofmultipleviews;shapereconstructionmethodsfromvisualcues:stereo,shading,shadows, contours;lowlevelimageprocessingmethodologies
School: University Of Michigan
Course: Linear Systems Theory
No textbook is required. The following book is RECOMMENDED (but once again, not required). It is on reserve in the library. 1) ISBN: 9780471735557 Linear State-Space Control Systems Robert L Williams, III, Douglas A Lawrence The following books are also o
School: University Of Michigan
Course: Linear Systems Theory
EECS 560: LINEAR SYSTEMS THEORY OR (LINEAR ALGEBRA FOR FUN AND PROFIT) Instructor: Prof. Jessy W. Grizzle, 4421 EECS Bldg., grizzle@umich.edu, 734-7633598 Class Periods: Lecture meets MWF, 1:30 to 2:30 PM in 1670 CSE Fldg. Recitation meets W 4:30 to 6:30
School: University Of Michigan
Course: Lin Feedback Control
EECS 565: Linear Feedback Control Systems, Winter 2011 TIME: 10:30-12:00 Tuesday and Thursday PLACE: 1303 EECS Bldg. INSTRUCTOR: J. S. Freudenberg OFFICE: 4425 EECS bldg PHONE: (734) 763-0586 EMAIL: jfr@eecs.umich.edu OFFICE HOURS: 2:00-3:00 Monday and 12
School: University Of Michigan
Course: Introduction To Cryptography
University of Michigan, Computer Science and Engineering EECS 475: Introduction to Cryptography Instructor: Prof. Kevin Fu Handout 1 January 8, 2014 Course Information Instructor: Prof. Kevin Fu Lecture: Mondays/Wednesdays 10:30-12:00 (1610 IOE) Oce Hours
School: University Of Michigan
Course: Introduction To Machine Learning
ECE-340 Spring 2008 Probabilistic Methods in Engineering (3 credits) M, W 3:00-4:15 PM Room: Dane Smith Hall 325 Syllabus Course Goals: To introduce the student to basic theoretical concepts and computational tools in probability and statistics with empha
School: University Of Michigan
Course: Introduction To Probability
ECE-340 Spring 2008 Probabilistic Methods in Engineering (3 credits) M, W 3:00-4:15 PM Room: Dane Smith Hall 325 Syllabus Course Goals: To introduce the student to basic theoretical concepts and computational tools in probability and statistics with empha
School: University Of Michigan
Stats 412: Introduction to Probability and Statistics Winter 2013 Instructor: Dr. Shyamala Nagaraj 270 West Hall, 734-764-5493, shyamnk@umich.edu Section 1: T Th Lecture hours: 10 - 11.30 a.m., 296 Dennison GSI: Zahra Razaee, razaee@umich.edu Exam 1: Thur
School: University Of Michigan
EECS 482: Introduction to Operating Systems Winter 2013 1 Basic information Lecture time & place: TTh 4:30-6pm, 1013 Dow Instructor: Jason Flinn, jflinn@umich.edu, office hours M 2:30-4:30pm, 4641 BBB Course staff: Nathaniel Daly, Brett Higgins, Justin Pa
School: University Of Michigan
Rev 1/26/2013 Page 1 of 3 Syllabus CSE 496 Winter 2013 Instructor, Elliot Soloway, Instructor, soloway@umich.edu GSI, Prateek Tandon, prateekt@umich.edu YOU MUST JOIN THIS EMAIL LIST: 1. Go to: directory.um
School: University Of Michigan
Course: Linear Systems Theory
Syllabus ME 564/EECS 560/Aero 550 Prof. Tilbury, UMich, Fall 2012 Lectures: MWF 1:302:30pm, 1670 Beyster Instructor: Prof. Dawn Tilbury, 3124 GG Brown, 936-2129, tilbury@umich.edu. Ofce Hours: MWF 2:30-3:30pm or by appointment GSIs: Hamid Ossareh, hamido@
School: University Of Michigan
Course: Power Electronics
Syllabus for EECS 418 Power Electronics Fall 2012 Pre-requisites: EECS 215 and EECS 216, and preceded or accompanied by EECS 320, or graduate standing. Course: Lecture: Lab, Section 1: Lab, Section 2: Lab, Section 3: MW 3:00 p.m.4:30 p.m., Th 3:00 p.m.6:0
School: University Of Michigan
Course: PROBABILITY
EECS 501 Probability and Random Processes Fall 2009 Lectures: TTh 10:30 am 12 noon, 1500 EECS Bldg. Recitation: Tue 3:30 pm 5 pm 1010 DOW Bldg. (section 11) or M 4:30 pm -6 pm, 2233 GGBL Bldg. (section 12) Instr uctor: Professor K. A. Winick 4423 EECS Bld
School: University Of Michigan
EECS 215: Introduction to Electronic Circuits Winter Semester 2010 Instructors: Section 1: 9:30-10:30 AM, MWF and 1:30-2:30 PM, F, Prof. Fred Terry 2417F EECS Bldg. fredty@umich.edu (Please include EECS215 in the subject line) 763-9764 Section 2: 1:30-2:3
School: University Of Michigan
Course: Embedded Control
EECS 461: Embedded Control Systems, Winter 2009 CLASS TIME: 1:303:00 Monday and Wednesday LAB TIMES: Monday, 3:306:30; Tuesday, 1:304:30; Wednesday, 10:001:00; Thursday, 9:3012:30; Thursday, 1:304:30 PLACE: 1311 EECS (lecture), 4342 EECS Building (l
School: University Of Michigan
EECS 523 DIGITIAL INTEGRATED CIRCUIT TECHNOLOGY COURSE SYLLABUS WINTER 2007 The following comprises a tentative syllabus describing the material to be covered in the course EECS 523, Digital Integrated Circuit Technology, for Winter 2007. Material
School: University Of Michigan
Course: Intro Oper System
EECS 482: Introduction to Operating Systems Winter 2006 1 Basic Information Prof. Atul Prakash, 4741 CSE, aprakash@eecs.umich.edu Graduate Student Instructors Mark Hodges (Monday discussions) Paul Darga (Friday discussions). Web page: http:/www.ee
School: University Of Michigan
Course: Intro Oper System
EECS 482: Introduction to Operating Systems Winter 2003 1 Basic Information Prof. Brian Noble, 2245 EECS, bnoble@umich.edu Graduate Student Instructors (GSI office hours will be held in the 3rd floor Media Union computer lab): George Dunlap, Kim Kue
School: University Of Michigan
Course: User Interface Dev
Honors 493 [EECS 594; Psych 808-005, Psych 447-001] Time and place: Tues and Thurs 9-11am, G421 Mason Hall. Texts: Hidden Order (paperback) Emergence (paperback) Both published by Perseus Press and authored by J.H. Holland Prerequisites: Either famil