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: 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: 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 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
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: 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
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 2 Grace Kendall grackend@umich.edu Important Dates Friday: Project 1 due 9/24: CodeLab due 10/1: Project 2 due Today Data Types Variables A variable is a slot in memory that stores a value that you can refer to by name. int x= 7 Char A char is
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 6 Grace Kendall grackend@umich.edu Due Soon: Project 4: Halloween Final Project Proposal: Nov 5 Codelab: Nov 7 Exam Pickup What did you learn? What was helpful on your notecard? What was the best resource you had for studying? Arrays When you d
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 4 Grace Kendall grackend@umich.edu Important Dates 10/1: Proj 2 due 10/3: Codelab due 10/10: Proj 3 due Today Functions If/Else, If/Else if/Else (Conditionals) Loops Project 2 Calling a function / This is the header for the function string getN
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 5 Grace Kendall grackend@umich.edu Important Dates 10/10: Project 3 due 10/17: Codelab due 10/20: Exam 1 Today BRIEF Project 3 For Loops Nested loops Pass by Reference Project 3: How it Works (PSA: Tutorial online :) ) You have: asciiart.h, arc
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: 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 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: 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
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: 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
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
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: 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: 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 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: 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
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
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
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
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
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
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: 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: 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
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
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 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: 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: 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: 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
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: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 2 Grace Kendall grackend@umich.edu Important Dates Friday: Project 1 due 9/24: CodeLab due 10/1: Project 2 due Today Data Types Variables A variable is a slot in memory that stores a value that you can refer to by name. int x= 7 Char A char is
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 6 Grace Kendall grackend@umich.edu Due Soon: Project 4: Halloween Final Project Proposal: Nov 5 Codelab: Nov 7 Exam Pickup What did you learn? What was helpful on your notecard? What was the best resource you had for studying? Arrays When you d
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 4 Grace Kendall grackend@umich.edu Important Dates 10/1: Proj 2 due 10/3: Codelab due 10/10: Proj 3 due Today Functions If/Else, If/Else if/Else (Conditionals) Loops Project 2 Calling a function / This is the header for the function string getN
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 5 Grace Kendall grackend@umich.edu Important Dates 10/10: Project 3 due 10/17: Codelab due 10/20: Exam 1 Today BRIEF Project 3 For Loops Nested loops Pass by Reference Project 3: How it Works (PSA: Tutorial online :) ) You have: asciiart.h, arc
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 3 Grace Kendall grackend@umich.edu Important Dates Wednesday, 9/24: Codelab Wednesday, 10/1: Project 2 Friday, 10/3: Codelab Today Functions Pass by Value If/Else and Logical Operators Debugging/Testing Functions int square(int x); int main()cf
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + Congratulations! + NOWSTART PROJECT3 k! ee ewDue:Friday,Oct10@ On 6:00pm 5% Extra Credit:Sept8 2.5% Extra Credit:Sept9 + Project3 You will be submitting n asciiart.cpp n test1.cpp We give you n asciiart.h n Yourfirstheaderfile!
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + PartnerTopics Name Hometown Why are you taking EECS 183? Something etc etc .etc awesome about your partner. + Project1 *IMPORTANT DATES* FinalSubmit:September 17th TurninbeforeSeptember 15th 5%extracredit(!) TurninonSept
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + Review! + Declarations Function Declaration Variable Declarations Declaration Tellsthecompilerthatan objectexistswiththisname, andthisdatatype + Declarations Function ReturnType VariableType DataType Tellsthecompilerwhatkindof d
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
We have the following function: double addTwo( double num ) cfw_ num += 2; cout < num < ; return num; And then in main: int x = 3; addTwo( x ); addTwo( x ); What Prints? A. 3 3 B. 5 7 C. 5 5 D. Does not compile We have the following function: double addT
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
STATS 500 - Lecture 17 STATS 500 - Lecture 17 p. 1/19 Grouped Data, Goodness-of-Fit, and Examination of Residuals STATS 500 - Lecture 17 p. 2/19 Coronary Heart Disease Data Revisit the coronary heart disease data The dataset contains 100 observations on 2
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: ELEMENTARY PROGRAMMING CONCEPTS
/ asm tefloigcd aleeue i odr / sue h olwn oe l xcts n re. itx=0 n ; ity=1 n ; itz=4 n ; i (x< 5& 1) f = & cu < "e"< ed; ot < ys < nl es le cu < "o < ed; ot < n" < nl / wa pit? ys / ht rns e i (x=0)cfw_ f cu < "< ed; ot < A < nl es i (y=0& x= y) le f & =
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: Machine Learn
Model Selection Sunday, October 5, 2014 7:46 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7 Lecture Notes Page 8 Lecture Notes Page 9 Lecture Notes Page
School: University Of Michigan
Course: Machine Learn
Support Vector Machines Monday, September 29, 2014 2:14 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7 Lecture Notes Page 8 Lecture Notes Page 9 Lecture
School: University Of Michigan
Course: Machine Learn
Constrained Optimization Sunday, September 28, 2014 8:56 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7 Lecture Notes Page 8
School: University Of Michigan
Course: Machine Learn
Kernels Thursday, September 18, 2014 2:44 PM Lecture Notes Page 1 Lecture Notes Page 2 11 10.8 10.6 10.4 10.2 10 9.8 9.6 9.4 9.2 9 Lecture Notes Page 3 true LS fit 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Lecture Notes Page 4 Lecture Notes Page 5 Lecture N
School: University Of Michigan
Course: Machine Learn
Linear Regression Friday, September 12, 2014 1:56 PM Lecture Notes Page 1 2.5 2 1.5 1 0.5 Lecture Notes Page 2 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7
School: University Of Michigan
Course: Machine Learn
Risks and Losses Thursday, September 18, 2014 11:32 AM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7 Lecture Notes Page 8 Lecture Notes Page 9 Lecture Not
School: University Of Michigan
Course: Machine Learn
Kernel Ridge Regression Sunday, September 28, 2014 5:19 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7
School: University Of Michigan
Course: Machine Learn
Separating Hyperplanes Thursday, September 11, 2014 12:07 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7 Lecture Notes Page 8 Lecture Notes Page 9 Lectu
School: University Of Michigan
Course: Machine Learn
Bayes Classifier Tuesday, September 2, 2014 4:39 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7
School: University Of Michigan
Course: Machine Learn
Logistic Regression Thursday, September 4, 2014 6:55 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4 Lecture Notes Page 5 Lecture Notes Page 6 Lecture Notes Page 7
School: University Of Michigan
Course: Machine Learn
Nave Bayes Tuesday, September 2, 2014 4:38 PM Lecture Notes Page 1 Lecture Notes Page 2 Lecture Notes Page 3 Lecture Notes Page 4
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
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 2 Grace Kendall grackend@umich.edu Important Dates Friday: Project 1 due 9/24: CodeLab due 10/1: Project 2 due Today Data Types Variables A variable is a slot in memory that stores a value that you can refer to by name. int x= 7 Char A char is
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 6 Grace Kendall grackend@umich.edu Due Soon: Project 4: Halloween Final Project Proposal: Nov 5 Codelab: Nov 7 Exam Pickup What did you learn? What was helpful on your notecard? What was the best resource you had for studying? Arrays When you d
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 4 Grace Kendall grackend@umich.edu Important Dates 10/1: Proj 2 due 10/3: Codelab due 10/10: Proj 3 due Today Functions If/Else, If/Else if/Else (Conditionals) Loops Project 2 Calling a function / This is the header for the function string getN
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 5 Grace Kendall grackend@umich.edu Important Dates 10/10: Project 3 due 10/17: Codelab due 10/20: Exam 1 Today BRIEF Project 3 For Loops Nested loops Pass by Reference Project 3: How it Works (PSA: Tutorial online :) ) You have: asciiart.h, arc
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Discussion 3 Grace Kendall grackend@umich.edu Important Dates Wednesday, 9/24: Codelab Wednesday, 10/1: Project 2 Friday, 10/3: Codelab Today Functions Pass by Value If/Else and Logical Operators Debugging/Testing Functions int square(int x); int main()cf
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + Congratulations! + NOWSTART PROJECT3 k! ee ewDue:Friday,Oct10@ On 6:00pm 5% Extra Credit:Sept8 2.5% Extra Credit:Sept9 + Project3 You will be submitting n asciiart.cpp n test1.cpp We give you n asciiart.h n Yourfirstheaderfile!
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + PartnerTopics Name Hometown Why are you taking EECS 183? Something etc etc .etc awesome about your partner. + Project1 *IMPORTANT DATES* FinalSubmit:September 17th TurninbeforeSeptember 15th 5%extracredit(!) TurninonSept
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + Review! + Declarations Function Declaration Variable Declarations Declaration Tellsthecompilerthatan objectexistswiththisname, andthisdatatype + Declarations Function ReturnType VariableType DataType Tellsthecompilerwhatkindof d
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
STATS 500 - Lecture 17 STATS 500 - Lecture 17 p. 1/19 Grouped Data, Goodness-of-Fit, and Examination of Residuals STATS 500 - Lecture 17 p. 2/19 Coronary Heart Disease Data Revisit the coronary heart disease data The dataset contains 100 observations on 2
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 + Congratulations! + NOWSTART PROJECT2 Due:Oct1@6:00pm 5% Extra Credit:Sept29 2.5% Extra Credit:Sept30 + Functions n are a group of statements that together perform a specific task. n allow us to reuse code instead of using copy-a
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
+ Discussion026 EECS 183 Project3 + To t! ig h n Due:Friday,Oct10@ 6:00pm + Exam1 Monday 10/20 6pm7:30pm + Exam1 Shootmeanemailifyou wantmetocover somethingspecificnext week! Topics: n Algorithms n If/Else n Variables n Logical n Data n For Types n Castin
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
STATS 500 - Lecture 16 STATS 500 - Lecture 16 p. 1/29 Hypothesis Testing and Condence Intervals for Generalized Linear Models STATS 500 - Lecture 16 p. 2/29 Hypothesis Testing STATS 500 - Lecture 16 p. 3/29 The Likelihood Ratio Test Recall the likelihood
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 9: Streams and Classes Ryan Cesiel (ryances@umich.edu) Some content from Grace Kendall (other 183 TA)! What are we doing today? Streams Classes Old Exam Questions Individual Questions EECS 183: Elementary Programming Concepts Discussio
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 8: Classes Ryan Cesiel (ryances@umich.edu) What are we doing today? Final Project Classes Old Exam Questions Individual Questions EECS 183: Elementary Programming Concepts Discussion 8: Classes Due Dates Saturday, November 1st : Projec
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 6: Midterm Review Ryan Cesiel (ryances@umich.edu) Important Dates Ofce hours today 11am - 4:30pm Today by midnight CodeLab Sunday at 6 pm Exam Review Monday at 6pm Exam EECS 183: Elementary Programming Concepts Discussion 6: Midterm Re
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 5: Arrays &Pass_by_Reference Ryan Cesiel (ryances@umich.edu) What are we doing today? Reminders on Project 3 Pass by Referencing vs. Pass by Value Arrays Exercises from Previous Exams Individual Questions EECS 183: Elementary Programmi
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 10: Exam 2 Review Ryan Cesiel (ryances@umich.edu) Some content from Reed and Maxim! What are we doing today? Exam 2 Information and Tips 2D Arrays Streams Classes Python Old Exam Questions Individual Questions EECS 183: Elementary Prog
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
The file debugging.cpp contains a simple c+ program that is supposed to print out a triangle of x's with a height of 25 lines. Below is a sample of the correct output for triangle with a height of 4 lines. x xx xxx xxxx However the program has several bug
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 7: Exam and Project 4 Ryan Cesiel (ryances@umich.edu) What are we doing today? Arrays, Loops and Project 4 (Problems from Previous Exams) Exams Individual Questions EECS 183: Elementary Programming Concepts Discussion 7: Exam and Proj
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 2: Functions Ryan Cesiel (ryances@umich.edu) What are we doing today? Functions Exercises from Past Exams Individual Questions or Help EECS 183: Elementary Programming Concepts Discussion 2: Functions Due Dates Wednesday Codelab Monday
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 4: Loops Ryan Cesiel (ryances@umich.edu) What are we doing today? [Review] Control Flow/Structures So Far More Control Flow: Loops! Exercises from Previous Exams Individual Questions EECS 183: Elementary Programming Concepts Discussion
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 Discussion 3: Debugging Ryan Cesiel (ryances@umich.edu) What are we doing today? [Review] Anatomy of a Function Exercises from Past Exams Individual Debugging Questions or Help EECS 183: Elementary Programming Concepts Discussion 3: Debugging Due
School: University Of Michigan
Course: Machine Learn
EECS 545: Machine Learning Instructor: Prof. Satinder Singh Lecture 1. Introduction (With some slides from Honglak Lee, Winter 2013) Satinder Singh CSE, Univ. of Michigan Course Information Lectures: Mon/Wed 10:30 to 12 noon in GGBL 1504 When slides wil
School: University Of Michigan
Course: Machine Learn
Naive Bayes classifier 20 Naive Bayes classifier Prior distribution p(Ck): Constant (e.g., Bernoulli) Likelihood P(x|Ck): factorized distribution (Each coordinate is conditionally independent of other coordinates given the class label .) Classificati
School: University Of Michigan
Course: Machine Learn
Outline Kernel methods: Motivation Kernel functions Kernel trick Dual representations Example: linear regression Constructing kernels Kernel regression 2 Linear regression Example: 1D regression one input x, one output y(x) Linear model = can only
School: University Of Michigan
Course: Machine Learn
EECS 545: Machine Learning Lecture 5. Linear models of classification & generative models Honglak Lee 1/28/2013 1 Outline Probabilistic generative models Gaussian Discriminant Analysis Naive Bayes Discriminant functions Fishers linear discriminant P
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: ELEMENTARY PROGRAMMING CONCEPTS
We have the following function: double addTwo( double num ) cfw_ num += 2; cout < num < ; return num; And then in main: int x = 3; addTwo( x ); addTwo( x ); What Prints? A. 3 3 B. 5 7 C. 5 5 D. Does not compile We have the following function: double addT
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
EECS 183 How to test your solutions. Using redirection to test solution input / output This supplemental document outlines how to run test cases against an executable version of your code. Using this method you will be able to test the inputs and outputs
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname:_ EECS280FinalExam Winter2014 Thisisaclosedbookexam.Youmayuseonecheatsheet,8.5x11,doubleside, handwritten,withyournameonit.Thisexamhas4problemson16pages. Youshouldreadtheentireexamthroughbeforeyoubeginworkingandthenworkonthose problemsyoufindeas
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname:_ EECS280FinalExam Spring2014 Thisisaclosedbookexam.Youmayuseonecheatsheet,8.5x11,doubleside, handwritten,withyournameonit.Thisexamhas5problemson22pageswhereseveralofthe pagesoftheexamhavebeenleftblankforyoutouseasscratchspace. Readtheentireexam
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname:_ EECS280MidtermExam Spring2014 Thisisaclosedbookexam.Youmayuseonecheatsheet,8.5x11,doubleside, handwritten,withyournameonit.Thisexamhas5problemson17pages. Readtheentireexamthroughbeforeyoubeginworking.Workonthoseproblemsyoufind easiestfirst.Rea
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname:_ EECS280MidtermExam Winter2014 Thisisaclosedbookexam.Youmayuseonecheatsheet,8.5x11,doubleside, handwritten,withyournameonit.Thisexamhas5problemson23pages. Readtheentireexamthroughbeforeyoubeginworking.Workonthoseproblemsyoufind easiestfirst.Rea
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Exam 1 SOLUTIONS EECS 203 Fall 2014 Problem I. (0 points) Many questions on this exam must be lled out using the scantron form you should have received. You will know that the question should be answered using the scantron form when you see the label <sca
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Practice (Final) Exam EECS 203 Fall 2014 Problem 1. Let S be the set of all bit strings and W be a proper nonempty subset of S. Zero or more of the following statements are true. Circle which statements are true. (a) R1 = cfw_(x, y) S S | x and y have at
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Exam 2 Solutions EECS 203 Fall 2014 Problem I. (10 points) Which of the following statements are true? i) There are 5! 6 5 ways to arrange ve people out of a group of six people, where order matters. Solution: True. 10! ii) There are dierent strings poss
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Practice (Final) Exam EECS 203 Fall 2014 Problem 1. Let S be the set of all bit strings and W be a proper nonempty subset of S. Zero or more of the following statements are true. Circle which statements are true. (a) R1 = cfw_(x, y) S S | x and y have at
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 2 PRACTICE EXAM B Problem 1. Let n (j2j ). f (n) = (1) j=0 Prove using induction that n 0, f (n) = 2 (n + 2)2n . Answer: Proof by Induction. Base Step: f (0) = 0 (j2j ) = 0 = 2 (0 + 2)20 j=0 Inductive Step: Inductive Hypothesis: As
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 2 PRACTICE EXAM B Problem 1. Let n (j2j ). f (n) = (1) j=0 Prove using induction that n 0, f (n) = 2 (n + 2)2n . 1 (2) Problem 2. (14 pts) Suppose that apples are sold only in bags of 6 and bags of 8. Let P (n) denote the following
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 1 PRACTICE EXAM A SOLUTIONS Problem 1. Which of the following are true? Circle the appropriate letters on page 3. Solution strategy: There are several ways to approach each problem, including Venn diagrams, set membership tables, r
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 2 PRACTICE EXAM A Problem 1. Zero or more of the following statements are true. Which ones are they? (a) The number of positive integers less than 1,000,000 that have the sum of their digits equal to 9 is 10 . 6 (b) The number of s
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 1 PRACTICE EXAM B SOLUTIONS Problem 1 (8 points) Which of the following claims about logical equivalence are true? (a b) (a b) TRUE FALSE (a b) (a b) TRUE FALSE a b a b TRUE FALSE a (b c) (a b) (a c) TRUE FALSE Problem 2 (8 points)
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 1 PRACTICE EXAM B Problem 1 (8 points) Which of the following claims about logical equivalence are true? (a b) (a b) TRUE FALSE (a b) (a b) TRUE FALSE a b a b TRUE FALSE a (b c) (a b) (a c) TRUE FALSE Problem 2 (8 points) Let A = c
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 2 PRACTICE EXAM A Problem 1. Zero or more of the following statements are true. Which ones are they? (a) The number of positive integers less than 1,000,000 that have the sum of their digits equal to 9 is 10 . 6 Answer: False. This
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203 Fall 2014 Exam 1 PRACTICE EXAM A Problem 1. Which of the following are true? Circle the appropriate letters on page 3. (a) A (A B) = A B (b) (A B) C = A (B C) (c) A (B C) = (A B) (A C) (d) A B = A B 1 Problem 2. Which of the following arguments a
School: University Of Michigan
Course: DISCRETE MATHEMATICS
iClicker Quiz Coin1 has probability 0.8 of producing a heads while Coin2 has probability 0.4 of producing a heads. Suppose I pick up one of the two coins (with equal probability for each) and toss it and get a
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname: _ EECS 280 Final Exam Fall 2013 This is a closed-book exam. There are 5 problems on 25 pages. Do not open this exam until instructed to do so. You should have one empty chair between you and the next person. Write your uniqname on the line pr
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname: _ EECS 280 Midterm Exam Fall 2013 This is a closed-book exam. There are 5 problems on 19 pages. Do not open this midterm until instructed to do so. You should have one empty chair between you and the next person. Write your uniqname on the li
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname: _ EECS 280 Midterm Exam Spring 2013 This is a closed-book exam. There are 5 problems on 15 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 th
School: University Of Michigan
Course: PROGRAMMING AND INTRODUCTORY DATA STRUCTURE
uniqname: _ EECS 280 Final Exam Spring 2013 This is a closed-book exam. There are 5 problems on 22 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 Programming and Introductory Data Structures Midterm Exam Review 1 Time and location Time: Friday 31 May 2013, 1:10pm - 2:30pm 80 minutes in length (this is always the case in EECS 280) Location by uniqname 2 1109 FXB 1012 FXB 1032 FXB 1024 FX
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Midterm Exam Wednesday, Nov. 3, 2010, 4:40-6:30 PM By LAST Name A to R in 1013 DOW S to Z in 1005 DOW HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neither given nor received a
School: University Of Michigan
Course: Linear Systems Theory
Solution Quiz #5 [Note: Q5 had a typo and has now been fixed as below.] 5. Consider the system = , + with initial condition at 0 = given by 0 = . If the step response of + + 1 , then the above system is given as = 0 0 1 1 1 (a) = , = 0 2 1 1 1 1 (b)
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Exam-II Wednesday, November 29, 2006, 4:40-6:30 PM A through O in room 1670 CSE P through Z in room 1006 DOW HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neither given nor rec
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Midterm Exam Wednesday, Nov. 4, 2009, 4:40-6:30 PM By LAST Name A to L in EECS 1500 M to R in EECS 1003 S to Z in EECS 1005 HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neithe
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Final Exam Tuesday, December 21, 2010, 4:10 PM to 6:00 PM A through Ho in Room 1010 DOW Hu through K in Room 1690 CSE L though Z in Room 1670 CSE HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is com
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Final Exam Friday, December 18, 2009, 4:10 PM to 6:00 PM A through H in Room 1005 DOW J through Z in Room 1670 CSE HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neither given n
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Final Exam Thursday, December 21, 2006, 1:40 PM to 3:30 PM A through Z in Room 1610 IOE HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neither given nor received aid on this exa
School: University Of Michigan
Course: Linear Systems Theory
PLACE NAME OR INITIALS HERE: 1 Exam Number: EECS 560 Exam-I Wednesday, October 25, 2006, 4:40-6:30 Room 1003 EECS HONOR PLEDGE: Copy (NOW) and SIGN (after the exam is completed): I have neither given nor received aid on this exam, nor have I observed a vi
School: University Of Michigan
University of Michigan WINTER 2011 EECS401: Practice Problems for Final-term Exam This is a collection of old exam problems, old homework problems, and other problems that I think will help you understand the material and prepare for the exam. I also stro
School: University Of Michigan
University of Michigan WINTER 2011 EECS 401: Solution to Final Term Examination 1. The CDf of Y can be obtained as y y FY (y) = 32 d = y 3 , fY ()d = 0 for 0 y 1, and FY (y) = 1 for y > 1, and FY (y) = 0 for y < 0. Hence we have for 0 y 1, y 3 = FY (y) =
School: University Of Michigan
University of Michigan WINTER 2011 EECS 401: Solution to Mid Term Examination 2 1. The PMF opf X is given by: pX (k) = 1 6 for k = 1, 2, 3, 4, 5 and 6 and pX (k) = 0 otherwise. Using the law of lazy statistician, we get 6 E|X 3| = |k 3| k=1 1 1 3 = [2 + 1
School: University Of Michigan
University of Michigan WINTER 2011 EECS401: Solutions to Practice Problems for Final-term Exam 1. Observe that tan function is monotone increasing in the interval (/2, /2). Now let us use the CDF method. Consider an arbitrary real number x. FX (x) = P [X
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
School: University Of Michigan
School: University Of Michigan
Final Examination Introduction to Optics & Photonics EECS 334 Instructor: Professor S.C. Rand Date: April 20, 2007 Time: 1:30-3:30 p.m. Duration: 2 hours PLEASE read over the entire examination before you start. DO ALL QUESTIONS and show all your work in
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2008 Quiz1 10/6/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 30 2 34 3 24 4 12 Po
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2008 FinalExam 12/12/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 25 2 30 3 15 4
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2009 Quiz2 11/18/2009 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 20 2 25 3 30 4 25 P
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2009 Quiz1 10/21/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 25 2 30 3 15 4 30 P
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2008 Quiz2 11/3/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 26 2 20 3 30 4 24 Po
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2008 Quiz1 10/6/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 30 2 34 3 24 4 12 Po
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2009 FinalExam 12/21/2009 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 21 2 16 3 32 4
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2008 FinalExam 12/12/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 25 2 30 3 15 4
School: University Of Michigan
UniversityofMichigan EECS311:ElectronicCircuits Fall2009 Quiz1 10/21/2008 NAME:_ HonorCode: Ihaveneithergivennorreceivedunauthorizedaidonthisexamination,norhaveIconcealed anyviolationsoftheHonorCode. Signature_ Problem Score Initials 1 25 2 30 3 15 4 30 P
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 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: 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
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: 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: ELEMENTARY PROGRAMMING CONCEPTS
/ asm tefloigcd aleeue i odr / sue h olwn oe l xcts n re. itx=0 n ; ity=1 n ; itz=4 n ; i (x< 5& 1) f = & cu < "e"< ed; ot < ys < nl es le cu < "o < ed; ot < n" < nl / wa pit? ys / ht rns e i (x=0)cfw_ f cu < "< ed; ot < A < nl es i (y=0& x= y) le f & =
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
/ asm tefloigcd aleeue i odr / sue h olwn oe l xcts n re. itx=0 n ; ity=1 n ; itz=4 n ; i (x< 5& 1) f = & cu < "e"< ed; ot < ys < nl es le cu < "o < ed; ot < n" < nl / wa pit? / ht rns i (x=0)cfw_ f cu < "< ed; ot < A < nl es i (y=0& x= y) le f & = cu <
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Writeacompleteprogram. Youneedtowritemain()andallneededpreprocessordirectives(#include). Inmain,asktheuserifheorshewouldliketogotobed.Ifyes,askhowmanysheepheorshewouldliketocount,then callfallAsleep.Ifno,donothing. YoualsoneedtowritethefunctioncalledfallA
School: University Of Michigan
Course: ELEMENTARY PROGRAMMING CONCEPTS
Completethefollowingprogrambyansweringthequestionsbelowtheprogram. Theprogramaskstwouserstheirfavoritecolors,thenstatesiftheyarethesameornot. /ThisisplaceA #include<iostream> #include<string> usingnamespacestd /ThisisplaceB intmain()cfw_ /ThisisplaceC /?
School: University Of Michigan
EECS 314 Spring 2013 HW problem 8 Students name _ (Last, First, write legibly, use ink) Instructor is not responsible for grading and entering scores for HW papers
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 11 Solutions EECS203 Sta November 16, 2014 1. Section 10.1 Exercise 2 Solution: a) A simple graph can be used here. Each node can represent a city and each edge can represent the highway between them. b) A
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 HW14 Solutions EECS203 Sta 1. Exercise 8.1.12 a) Let sn be the number of ways to climb n stairs. The last action could have been taking either one, two, or three stairs at once. The number of ways to climb one as t
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 13 Solutions EECS203 Sta November 30, 2014 1. Section 3.2 Exercise 22 Solution: (log n)3 , n log n, n99 + n98 , n100 , (1.5)n , 10n , (n!)2 2. Section 3.2 Exercise 32 Solution: f (x) = O(g(x) g(x) = (f (x
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 12 Solutions EECS203 Sta November 25, 2014 1. Section 10.5 Exercise 14 Solution: Notice that this problem essentially asks to determine whether the corresponding graph abstraction with is Eulerian. Because
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 8 Solutions EECS203 Sta October 29, 2014 1. Section 7.1 Exercise 26 Solution: a) C(34, 6) = 0.35 C(40, 6) b) C(42, 6) = 0.43 C(48, 6) c) C(50, 6) = 0.49 C(56, 6) d) C(58, 6) = 0.54 C(64, 6) 2. Section 7.1
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 9 Solutions EECS203 Sta November 6, 2014 1. Section 7.4 Exercise 12 Solution: a) Rolling n times means that for the rst (n - 1) tries, it must not be a six (with 5 1 probability ), and then the last try ha
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 HW7 Solutions EECS203 Sta 1. Exercise 6.4.10 Using the Binomial Theorem we have 1 x+ x 100 100 100 (x)100j j = j=0 100 1 x j 100 1002j x j = j=0 To nd the coecient of xk for k Z, rst note that for any xk that appea
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 HW10 Solutions EECS203 Sta 1. Exercise 9.3.8 (a,c) Reexive No Irreexive No Yes a) Symmetric Antisymmetric No Transitive No Needs (2,2) Has (1,1) Reexive No Irreexive Yes Yes c) Symmetric Antisymmetric No No Transit
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 Homework 4 Solutions EECS203 Sta October 4, 2014 1. Section 2.2 Exercise 20 Solution: a) A B = cfw_x|x A x B = cfw_x|x A x B A B = cfw_x|x A x B we can conclude cfw_x|x B = B b) A B = cfw_x|x A x B = cfw_x|x A x B
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 HW6 Solutions EECS203 Sta 1. Exercise 6.1.28 Domains: 26 English letters, 10 digits Two cases, 1. 3 letters followed by 3 digits, 2. 3 digits followed by 3 letters 1. 3 letters, 3 digits: 263 103 2. 3 digits, 3 let
School: University Of Michigan
Course: DISCRETE MATHEMATICS
EECS 203: Discrete Mathematics Fall 2014 HW5 Solutions EECS203 Sta 1. Exercise 5.1.22 Here our domain of n is non negative numbers. Dene predicate P (n) : n2 n!. We know that P (1) is true, but P (2), P (3) are not true. P (4), P (5) and P (6) are all tru
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Homework 3 Answers EECS 203 Fall 2014 Section 1.8, Problem 24 (a) (2,5) arithmetic mean = 3.5 quadratic mean = 3.807 (7,8) arithmetic mean = 7.5 quadratic mean = 7.5166 (4,5) arithmetic mean = 4.5 quadratic mean = 4.527 (b) To show that our hypothesis tha
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Homework 1 Answers EECS 203 Fall 2014 Section 1.1, Problem 14 (a) r q (b) p q r (c) r p. Be careful when you use the word necessary! This means implies. (d) p q r (e) (p q) r (f ) (p q) r Section 1.1., Problem 28 (a) If it snows tonight, then I will stay
School: University Of Michigan
Course: DISCRETE MATHEMATICS
Homework 2 Answers EECS 203 Fall 2014 Section 1.4, Problem 24 Let C(x) mean x is in your class (a) Let P (x) mean x has a cellular phone i xP (x) ii x(C(x) P (x) (b) Let M (x) mean x has seen a foreign movie i xM (x) ii x(C(x) M (x) (c) Let S(x) mean x ca
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #10 Assigned: December 2, 2014 Due: Wednesday December 10, 2014 (last day of class) 1. For the system : x= 0 1 0 x+ u 0 0 1 (1) (a) Determine anal
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #9 Assigned: Nov 17, 2014 Due: Wednesday November 26, 2014 1. Show that if A(t) is partitioned as A(t) = A11 (t) A12 (t) 0 A22 (t) where A11 (t) a
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #8 Assigned: Nov 4, 2014 Due: Monday November 10, 2014 1. Consider the system dened by: x(t) = tx(t) Prove or disprove: the zero solution of this
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #7 Assigned: October 27, 2014 Due: November 3, 2014 1. A simplied model of the lateral dynamics of an aircraft are shown to obey a four-dimensiona
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #6 Assigned: October 20, 2014 Due: October 27, 2014 Problem 1. Let p(t) be a polynomial, A : V V a linear map. Suppose is an eigenvalue of A with
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #5 Assigned: October 11, 2014 Due: Oct 20, 2014 1. Write some MATLAB code to visualize the action of a 2x2 matrix A and relate that action to the
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #4 Assigned: Oct 1, 2014 Due: Monday, Oct 6, 2014 1. Prove or disprove the following: (to disprove you must provide a counterexample). Let A : V !
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #3 Assigned: September 23, 2014 Due: Monday, September 29, 2014 Students may work together on the homework assignments, but individually prepared
School: University Of Michigan
Course: Linear Systems Theory
Linear System Theory ME 564, EE 560, Aero 550 Professor Gillespie, University of Michigan Fall 2014 Homework #2 Assigned: September 15, 2014 Due: September 22, 2014 Students may work together on the homework assignments, but individually prepared written
School: University Of Michigan
Course: Linear Systems Theory
ME564/EE560/Aero550 - HW #1 Prof. Gillespie Due September 15, 2014 At the beginning of class Remarks: Students may work together on the homework assignments, but individually prepared written solutions, without copying is required. Consulting old homework
School: University Of Michigan
Course: Math Meth Sig Proc
EECS 453/551: HW 10 SOLUTIONS Problem 1 (*) Dene the diagonal matrix n = diag(n1 , n2 , . . . , 1) so that we can denote We need to minimize: n1 n2 n = diag( , , . . . , 1). | n (yn xn h)|2 T where yn = y(n) y(n 1) . . . minimizing: T and xn = x(n) x(n
School: University Of Michigan
Course: Math Meth Sig Proc
EECS 453/551: HW 8 SOLUTIONS 1. Problem 1 Every point on the plane satises 3 1 :=A x 2 y = 0, z which implies that every point on the plane is in N (A). Furthermore, since the SVD of A (only specifying the vectors corresponding to the non-zero singula
School: University Of Michigan
Course: Math Meth Sig Proc
EECS 453/551: HW 6 SOLUTIONS Problem 1 (*) (A b)T (I A A)y =bT (A )T (I V U T U V T )y =bT U ( )T V T (V V T V V T )y =bT U ( )T ( )T )V T y If Rmn = diag(1 , 2 , . . . , r ), we can verify that ( )T = ( )T through direct multiplication, so that (A b)T (I
School: University Of Michigan
Course: Math Meth Sig Proc
EECS 453/551: HW 5 SOLUTIONS Problem 1 n T The idea is to view the image as a matrix A = i=1 i ui vi where in this case n = 480. We know that k T the optimal (with respect to any unitarily invariant norm) rank-k approximation to A is Ak = i=1 i ui vi . Th
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
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 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
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
EECS 215 Lab Supplementary Materials / Audio Lab Streamlined In-Lab Procedure All parts are required. In-Lab pages 1-5 6 7-9 10-15 Learning in the Lab Part 1 Lab experiments Part 1 Learning in the Lab Part 2 Lab experiments Part 2 See supplementary materi
School: University Of Michigan
EECS 215 Lab Supplementary Materials / Filter Lab Streamlined In-Lab Procedure All parts are required, other than those explicitly listed as optional. Printout #3 is not required. No extra credit is awarded for obtaining it. Solder your own circuit Lab Le
School: University Of Michigan
EECS 215 Lab Supplementary Materials / Transients Lab Cover page Transients 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) L
School: University Of Michigan
EECS 215 Lab Supplementary Materials / AC Lab Cover page AC 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 Section # _ C
School: University Of Michigan
EECS 215 Lab Supplementary Materials / DC Lab Cover page DC 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 Section # _ C
School: University Of Michigan
Course: Eecs 216
EECS 216 Fall 2010 Lab 4: Control Part II: In-lab & Post-lab Assignment 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-lab before you leave. 1 L
School: University Of Michigan
Course: SOLID STATE DEVICE LAB
University of Michigan EECS 423 Lab Report 1 1 Jordan Adams 10/7/2009 Lab #1 Cleanroom Orientation and Label Si Wafers 1. Provide the sheet resistance measurements in a table. Calculate the resistivity in -cm and doping concentration in cm-3. Analyze the
School: University Of Michigan
Course: SOLID STATE DEVICE LAB
The University of Michigan EECS 423 Lab Report 2 Jordan Adams November 18th 2009 Honor Code: I have neither given nor received unauthorized aid on this laboratory report, nor have I concealed any violations of the Honor Code Jordan Adams . Contents Lab #5
School: University Of Michigan
Course: SOLID STATE DEVICE LAB
University of Michigan EECS 423 Lab Report 1 1 Jordan Adams 10/7/2009 Honor Code: I have neither given nor received unauthorized aid on this laboratory report, nor have I concealed any violations of the Honor Code Jordan Adams . Lab #1 Cleanroom Orientati
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