Online study resources available anywhere, at any time
Highquality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
ECE

We are sorry, there are no listings for the current search parameters.
School: University Of Toronto
Course: Computer Security
ECE 568 Computer Security Winter 2012 Course Syllabus General Information Welcome to ECE 568! This course covers principles of computer systems security. It starts by examining how to identfy security vulnerabilites, how they can be exploited, and then di
School: University Of Toronto
1. The vector area A and the electric field E are shown on the diagram below. The angle between them is 180 35 = 145, so the electric flux through the area is = E A = EA cos = (1800 N C ) 3.2 103 m cos145 = 1.5 102 N m 2 C. 2 ( ) 2. We u
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte). (a) Explain the difference between the advertised window and th
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 5 Problem 1. Policy Based Routing in BGP The figure shows a network with six autonomous systems. AS4 owns the prefix 10.0.1.0/24 and sends an advertisement to AS1 with the following pre
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions: Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figure 1. No machine is
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 2 Problem 1. Describe how class A, B, and C IP addresses are recognized in a binary representation of IP addresses ? Class A  8 bit prefix  0. Class B  16 bit prefix  10. Class C  24 bit prefix  110. Problem 2.
School: University Of Toronto
Course: Internetworking
Review of Important Networking Concepts Introductory material. This module uses the example from the previous module to review important networking concepts: protocol architecture, protocol layers, encapsulation, demultiplexing, network abstractions. 1 Se
School: University Of Toronto
ECE1762 LEC17 Page 1 of 8 ECE1762 LEC17 Page 2 of 8 ECE1762 LEC17 Page 3 of 8 ECE1762 LEC17 Page 4 of 8 ECE1762 LEC17 Page 5 of 8 ECE1762 LEC17 Page 6 of 8 ECE1762 LEC17 Page 7 of 8 ECE1762 LEC17 Page 8 of 8 ECE1762 LEC18 Page 1 of 7 ECE1762 LEC18 Page 2
School: University Of Toronto
V. Adamchik 1 Recursions Victor Adamchik Fall of 2005 Plan 1. Solving Linear Recurrences with Constant Coefficients 1.1 Iterations 1.2 Characteristic equation 1.3 General solution 1.4 Higher order equations 1.5 Multiple roots Solving Second Order Recurren
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Game Theory and Evolutionary Games Lacra Pavel Systems Control Group Dept. of Electrical and Computer Engineering University of Toronto 2014 2 Contents 1 The Name of the Game 5 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 7 Replicator Dynamics Chapter Summary This chapter introduces dynamic concepts in EGT using the continuoustime Replicator Dynamics (RD) that models selection of the ttest strategies in the population. We discuss stability properties of RD equilib
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 4 ContinuousKernel Games Chapter Summary This chapter focuses on noncooperative (Nash) games with continuouskernel i.e., with continuous action spaces and cost functions. Basic concepts and results are reviewed, mostly adapted from [18]. 4.1 Int
School: University Of Toronto
Course: Internetworking
IP Multicasting 1 J. Liebeherr, All rights reserved Applications with multiple receivers Many applications transmit the same data at one time to multiple receivers Broadcasts of Radio or Video Videoconferencing Shared Applications A network must hav
School: University Of Toronto
Course: Internetworking
DNS Domain Name System Domain names and IP addresses People prefer to use easytoremember names instead of IP addresses Domain names are alphanumeric names for IP addresses e.g., neon.ece.utoronto.ca, www.google.com, ietf.org The domain name system (D
School: University Of Toronto
Course: Internetworking
Understanding IP Addressing: Everything You Ever Wanted To Know Prefix  Length sC s g fu lass C h CI g ed nd te tin t N s ge atc M er b stNum Ho n Lo rk wo et ix ef Pr Chuck Semeria NSD Marketing 3Com Corporation April 26, 1996 tin l k et SM et as Ex r
School: University Of Toronto
Course: Internetworking
Dynamic Host Configuration Protocol (DHCP) Relates to Lab 7. Module about dynamic assignment of IP addresses with DHCP. 1 Dynamic Assignment of IP addresses Dynamic assignment of IP addresses is desirable for several reasons: IP addresses are assigned o
School: University Of Toronto
Course: Internetworking
LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging) and routing. Then discusses LAN switching, including learning bridge algorithm, transparent bridging, and
School: University Of Toronto
Course: Internetworking
Network Address Translation (NAT) Relates to Lab 7. Module about private networks and NAT. 1 Private Network A Private IP network is an IP network that is not directly connected to the Internet IP addresses in a private network can be assigned arbitrari
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2010 Quiz 1  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only aid permitted are the t
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2013 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Solutions Quiz 1 Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only other aid permitted are t
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2013 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You can bring two handwritten aid sheets (standard form, only one side of each sheet can be written) or one sheet (writ
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2012 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your textbook, l
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte). (a) Explain the difference between the advertised window and th
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 5 Problem 1. Policy Based Routing in BGP The figure shows a network with six autonomous systems. AS4 owns the prefix 10.0.1.0/24 and sends an advertisement to AS1 with the following pre
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions: Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figure 1. No machine is
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 2 Problem 1. Describe how class A, B, and C IP addresses are recognized in a binary representation of IP addresses ? Class A  8 bit prefix  0. Class B  16 bit prefix  10. Class C  24 bit prefix  110. Problem 2.
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 4 Problem 1. Consider the following set of prefixes a) 0001* b) 00010* c) 00011* d) 001* e) 0101* f) 011* g) 100* h) 1010* i) 1100* j) 11110000* Construct the following tries and trees 1) a binary trie for the set of
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Set 3 Solutions Problem 1. Consider the network shown in Figure 1 with three hosts (HostA, HostB, HostC), one router (Router1), and two Ethernet segments. The figure includes the network configuration, the IP addresses, the
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #6 with MATLAB Applications RICHARD J. TERVO Sampling and Reconstruction A discrete signal s(nT) can be created from a continuous signal s(t) by multiplying s(t) by an impulse train with period T as: s(nT ) = + (t nT ) s(t)
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #7 with MATLAB Applications Laplace Transform RICHARD J. TERVO The Laplace transform X(s) of a time domain signal x(t) is generally defined as: X(s) = + x(t) e st dt The onesided form of the Laplace transform is commonly see
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #8 with MATLAB Applications RICHARD J. TERVO The zTransform The ztransform X(z) of a sampled time domain signal x(nT) or x[n] is generally defined as: X(z) = + x[n] z n n= where z is a complex term. The onesided form of th
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #4 with MATLAB Applications RICHARD J. TERVO The Fourier Transform The Fourier transform S(f) of a time domain signal s(t) is given by: + S( f ) = s(t) e j 2 ft dt and the inverse Fourier transform is: s(t) = + S( f ) e+ j 2
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory with MATLAB Applications RICHARD J. TERVO Lab #5 System Modelling When a time domain signal s(t) enters a system with response function h(t), the output g(t) is described by the convolution: + g(t) = s(t) h(t) = s(x) h(t x) dx The
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory with MATLAB Applications RICHARD J. TERVO Lab #3 Complex Fourier Series The complex Fourier series representation of a periodic signal s(t) with period T=1/f0 is: s(t) = Ce + j 2 nf0t n n= where each of the components Cn at freque
School: University Of Toronto
Course: Circuit Analysis
Chapter 19 1. a. PT = 60 W + 45 W + 25 W = 130 W b. QT = 0 VARS, ST = PT = 130 VA c. 130 VA S = 0.542 A ST = EIs, Is = T = E 240 V d. 60 W = 204.2 (0.542 A ) 2 V = IsR = (0.542 A)(204.2 ) = 110.68 V V1 = V2 = E V = 240 V 110.68 V = 129.32 V 2 2 (129.32 V
School: University Of Toronto
Course: Circuit Analysis
Chapter 24 1. a. positivegoing d. f. g. 2. Vb = 2 V tp = 0.2 ms V1 V 2 100% V 8V + 7.5 V V= = 7.75 V 2 8 V 7.5 V % tilt = 100% = 6.5% 7.75 V 1 1 1 prf = = = 625 kHz T (2.0 ms 0.4 ms) 1.6 ms % tilt = tp T 100% 0.2 ms 100% = 12.5% 1.6 ms a. negativeg
School: University Of Toronto
Course: Circuit Analysis
Chapter 2 1. 2. a. F= k Q1Q2 (9 109 )(1 C)(2 C) = 18 109 N r2 (1 m) 2 b. F=k Q1Q2 (9 109 )(1 C)2 C = = 2 109 N r2 (3 m) 2 c. F= k Q1Q2 (9 109 )(1 C)(2 C) = 0.18 109 N 2 2 r (10 m) d. Exponentially, a. r = 1 mi: 3. r3 10 m F 18 109 N = 10 while 1 = 100 r
School: University Of Toronto
Course: Circuit Analysis
Chapter 4 1. V = IR = (5.6 mA)(220 ) = 1.23 V 2. I= V 24 V = 3.53 A R 6.8 3. R= V 24 V = 16 k = I 1.5 mA 4. I= V 12 V = 300 A R 40 103 5. V = IR = (3.6 A)(0.02 M) = 0.072 V = 72 mV 6. I= V 120 V = 2.4 mA R 50 k 7. R= V 120 V = 54.55 = I 2.2 A 8. I= V 1
School: University Of Toronto
Course: Circuit Analysis
Chapter 1 1. 2. 3. 4. = 5. 6. d 20,000 ft 1 mi 60 s 60 min = = 1363.64 mph t 10 s 5,280 ft 1 min 1 h 1h 4 min = 0.067 h 60 min d 31 mi = = 29.05 mph t 1.067 h 3 ft 100 yds 1 yd 1 mi 5,280 ft = 0.0568 mi 60 mi 1 h 1 min = 0.0167 mi/s h 60
School: University Of Toronto
Course: Circuit Analysis
Chapter 12 : CGS: 5 104 Maxwells, English: 5 104 lines B: CGS: 8 Gauss, English: 51.62 lines/in.2 1. 2. : SI 6 104 Wb, English 60,000 lines B: SI 0.465 T, CGS 4.65 103 Gauss, English 30,000 lines/in.2 3. a. B= 4 104 Wb = = 0.04 T A 0.01 m 2 4. a. R= 0.06
School: University Of Toronto
Course: Computer Security
ECE 568 Computer Security Winter 2012 Course Syllabus General Information Welcome to ECE 568! This course covers principles of computer systems security. It starts by examining how to identfy security vulnerabilites, how they can be exploited, and then di
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Instructor: Prof. Jrg Liebeherr University of Toronto Websites The course website is http:/www.comm.utoronto.ca/~jorg/teaching/ece461 Lecture slides, lab information, problem sets for tutorials Blackboard: Used for announcements
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2014 1 Course Information Course Information ECE 345 Algorithms and Data Structures University of Toronto Dept. of Electrical and Computer Engineering Fall Semester, 2014 Welcome to ECE345! Algorithms today play an important role i
School: University Of Toronto
Course: Intro To Electronics
ECE335F Electronic Devices Fall 2013 ECE335F Introduction to Electronic Devices LEC 01 ECE335H1F Prof. Wai Tung Ng PT484A, ngwt@vrg.utoronto.ca LEC 01 Tue 10:00 11:00 GB303 ECE335H1F Wed 10:00 11:00 GB303 ECE335H1F Thu 10:00 11:00 GB303 ECE335H1F TUT 01 W
School: University Of Toronto
Lecture Week ECE231&Course&Syllabus&and&Detailed&Course&Schedule& Jan& 1 8~11 1 2 3 Jan& 4 14~18 5 6 Jan& 7 21~25 8 9 Jan28&O& 10 Feb1 Section Description Course&outline Learning2objectives:2From2this2section,2students2will2be2able2to2 Reading Homework Pr
School: University Of Toronto
# UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING Department of Electrical and Computer Engineering ECE 231S Introductory Electronics Course Outline This course is an introduction to electronic circuits using operational amplifiers, diode
School: University Of Toronto
Course: Computer Security
ECE 568 Computer Security Winter 2012 Course Syllabus General Information Welcome to ECE 568! This course covers principles of computer systems security. It starts by examining how to identfy security vulnerabilites, how they can be exploited, and then di
School: University Of Toronto
1. The vector area A and the electric field E are shown on the diagram below. The angle between them is 180 35 = 145, so the electric flux through the area is = E A = EA cos = (1800 N C ) 3.2 103 m cos145 = 1.5 102 N m 2 C. 2 ( ) 2. We u
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte). (a) Explain the difference between the advertised window and th
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 5 Problem 1. Policy Based Routing in BGP The figure shows a network with six autonomous systems. AS4 owns the prefix 10.0.1.0/24 and sends an advertisement to AS1 with the following pre
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions: Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figure 1. No machine is
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 2 Problem 1. Describe how class A, B, and C IP addresses are recognized in a binary representation of IP addresses ? Class A  8 bit prefix  0. Class B  16 bit prefix  10. Class C  24 bit prefix  110. Problem 2.
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 4 Problem 1. Consider the following set of prefixes a) 0001* b) 00010* c) 00011* d) 001* e) 0101* f) 011* g) 100* h) 1010* i) 1100* j) 11110000* Construct the following tries and trees 1) a binary trie for the set of
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Set 3 Solutions Problem 1. Consider the network shown in Figure 1 with three hosts (HostA, HostB, HostC), one router (Router1), and two Ethernet segments. The figure includes the network configuration, the IP addresses, the
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Set 3 Problem 1. Consider the network shown in Figure 1 with three hosts (HostA, HostB, HostC), one router (Router1), and two Ethernet segments. The figure includes the network configuration, the IP addresses, the netmasks,
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions (read carefully): Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figu
School: University Of Toronto
Course: Internetworking
IP Multicasting 1 J. Liebeherr, All rights reserved Applications with multiple receivers Many applications transmit the same data at one time to multiple receivers Broadcasts of Radio or Video Videoconferencing Shared Applications A network must hav
School: University Of Toronto
Course: Internetworking
DNS Domain Name System Domain names and IP addresses People prefer to use easytoremember names instead of IP addresses Domain names are alphanumeric names for IP addresses e.g., neon.ece.utoronto.ca, www.google.com, ietf.org The domain name system (D
School: University Of Toronto
Course: Internetworking
Understanding IP Addressing: Everything You Ever Wanted To Know Prefix  Length sC s g fu lass C h CI g ed nd te tin t N s ge atc M er b stNum Ho n Lo rk wo et ix ef Pr Chuck Semeria NSD Marketing 3Com Corporation April 26, 1996 tin l k et SM et as Ex r
School: University Of Toronto
Course: Internetworking
Dynamic Host Configuration Protocol (DHCP) Relates to Lab 7. Module about dynamic assignment of IP addresses with DHCP. 1 Dynamic Assignment of IP addresses Dynamic assignment of IP addresses is desirable for several reasons: IP addresses are assigned o
School: University Of Toronto
Course: Internetworking
LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging) and routing. Then discusses LAN switching, including learning bridge algorithm, transparent bridging, and
School: University Of Toronto
Course: Internetworking
Network Address Translation (NAT) Relates to Lab 7. Module about private networks and NAT. 1 Private Network A Private IP network is an IP network that is not directly connected to the Internet IP addresses in a private network can be assigned arbitrari
School: University Of Toronto
Course: Internetworking
TCP  Part II 1 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information Error Control: Algorithms to recover or conceal the effects from packet losses Congestion Control: Algori
School: University Of Toronto
Course: Internetworking
Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research. J. Liebeherr, All rights reserved 1 Internet Infrastructure Regional Network (Tier 2) IXP Backbone Network (Tier 1) local ISP (Tier 3) Regional Netw
School: University Of Toronto
Course: Internetworking
VLANs Relates to Lab 6. Short module on basics of VLAN switching 1 Large LANs Broadcast traffic in LANs is sent to all devices on LAN becomes a problem in large LANs Switch Large LAN Switch Separate broadcast domains by subnetting Broadcast traffic in LA
School: University Of Toronto
Course: Internetworking
Dynamic Routing Protocols II OSPF Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. 1 Distance Vector vs. Link State Routing With distance vector routing, each node has information only abou
School: University Of Toronto
Course: Internetworking
TCP  Part I Relates to Lab 5. First module on TCP which covers packet format, data transfer, and connection management. 1 Overview Byte Stream Byte Stream TCP = Transmission Control Protocol TCP is a connectionoriented protocol that provides a reliable
School: University Of Toronto
Course: Internetworking
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP. 1 Orientation We move one layer up and look at the transport layer. User Process User Process User Process Applica
School: University Of Toronto
Course: Internetworking
Dynamic Routing Protocols I RIP Relates to Lab 4. The first module on dynamic routing protocols. This module provides an overview of routing, introduces terminology (interdomain, intradomain, autonomous system), 1 Routing Recall: There are two parts to r
School: University Of Toronto
Course: Internetworking
IP Forwarding Relates to Lab 3. Covers the principles of endtoend datagram delivery in IP networks. 1 Delivery of an IP datagram View at the data link layer layer: Internetwork is a collection of LANs or pointtopoint links or switched networks that
School: University Of Toronto
Course: Internetworking
Router Architectures An overview of router architectures. Introduction What is a Packet Switch? Basic Architectural Components Some Example Packet Switches The Evolution of IP Routers 2 Router Components Hardware components of a router: Network interf
School: University Of Toronto
Course: Internetworking
IPv4 Addresses Internet Protocol: Which version? There are currently two versions of the Internet Protocol in use for the Internet IPv4 (IP Version 4) Specified in 1980/81 (RFC 760, 791) Four byte addresses Universally deployed Problem: Address space alm
School: University Of Toronto
Course: Internetworking
IPv4  The Internet Protocol Version 4 1 Orientation IP (Internet Protocol) is a Network Layer Protocol. There are currently two version in use: IPv4 (version 4) and IPv6 (Version 6) Here we discuss IPv4 2 IP: The waist of the hourglass IP is the wais
School: University Of Toronto
Course: Internetworking
Internet Control Message Protocol (ICMP) 1 Overview The IP (Internet Protocol) relies on several other protocols to perform necessary control and routing functions: Control functions (ICMP) Multicast signaling (IGMP) Setting up routing tables (RIP, OS
School: University Of Toronto
Course: Internetworking
Address Resolution Protocol (ARP) 1 Overview Interface to Ethernet 2 Need for Address Translation Note: The Internet is based on IP addresses Local area networks use MAC addresses The ARP and RARP protocols perform the translation between IP and MAC l
School: University Of Toronto
Course: Internetworking
Data Link Protocols Relates to Lab 2. This module covers data link layer issues, such as local area networks (LANs) and pointtopoint links, Ethernet, and the PointtoPoint Protocol (PPP). 1 TCP/IP Suite and OSI Reference Model The TCP/IP architecture
School: University Of Toronto
Course: Internetworking
Introduction to IPv6 J. Liebeherr, 2012, All rights reserved Internet Protocol: Which version? There are currently two versions of the Internet Protocol in use for the Internet IPv4 (IP Version 4) Specified in 1980/81 (RFC 760, 791) Four byte addresses
School: University Of Toronto
Course: Internetworking
Subnetting and Supernetting Network Prefix and Host number IP address consists of a network prefix and a host number Prefix notation: 128.100.11.60/16 Notation with netmask: 128.100.11.60 255.255.0.0 Subnetting Scenario: Organization has a large netwo
School: University Of Toronto
Course: Internetworking
Review of Important Networking Concepts Introductory material. This module uses the example from the previous module to review important networking concepts: protocol architecture, protocol layers, encapsulation, demultiplexing, network abstractions. 1 Se
School: University Of Toronto
Course: Internetworking
TCP/IP Networking An Example Introductory material. This module illustrates the interactions of the protocols of the TCP/IP protocol suite with the help of an example. The example intents to motivate the study of the TCP/IP protocols. 1 A simple TCP/IP Ex
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Instructor: Prof. Jrg Liebeherr University of Toronto Websites The course website is http:/www.comm.utoronto.ca/~jorg/teaching/ece461 Lecture slides, lab information, problem sets for tutorials Blackboard: Used for announcements
School: University Of Toronto
Course: Internetworking
Address Lookup in IP Routers Routing Table Lookup Routing Table Output Scheduling Switch Fabric Routing Decision Routing Table Forwarding Decision Routing Table Forwarding Decision 2 IPv4 Routing Table Size Source: Geoff Huston, APNIC 3 Routing table look
School: University Of Toronto
Course: Internetworking
Intro to IPv6 Addresses IPv6 Header 32 bits version (4 bits) Traffic Class (8 bits) Payload Length (16 bits) Flow Label (24 bits) Next Header (8 bits) Hop Limits (8 bits) Source IP address (128 bits) Destination IP address (128 bits) IPv6 addresses have
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2010 Quiz 1  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only aid permitted are the t
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2013 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Solutions Quiz 1 Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only other aid permitted are t
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2013 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You can bring two handwritten aid sheets (standard form, only one side of each sheet can be written) or one sheet (writ
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2012 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your textbook, l
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2011 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your textbook, l
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2007 Quiz 2 Solution Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your te
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2013 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one singlesided handwritten aid sheet prepared by you and a calculator. You may not use your
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2012 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one singlesided handwritten aid sheet prepared by you and a calculator. You may not use your
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2008 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one handwritten aid sheet prepared by you and a calculator. You may not use your textbook, le
School: University Of Toronto
Course: Computer Networks 2
University of Toronto Faculty of Applied Science and Engineering Final Exam, May 2008 ECE 466: Computer Networks II Examiner: J. Liebeherr Exam Type: D Permitted aids: Two handwritten aid sheets (standard form, only one side of each sheet can be written
School: University Of Toronto
ECE1762 LEC17 Page 1 of 8 ECE1762 LEC17 Page 2 of 8 ECE1762 LEC17 Page 3 of 8 ECE1762 LEC17 Page 4 of 8 ECE1762 LEC17 Page 5 of 8 ECE1762 LEC17 Page 6 of 8 ECE1762 LEC17 Page 7 of 8 ECE1762 LEC17 Page 8 of 8 ECE1762 LEC18 Page 1 of 7 ECE1762 LEC18 Page 2
School: University Of Toronto
UofTorontoECE 345Winter, 2015 1 Homework 2 Homework 2 ECE 345 Algorithms and Data Structures Winter Semester, 2015 Due: Feb 10 at 12noon in ECE345 dropbox All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein. For each algori
School: University Of Toronto
UofTorontoECE 345Winter, 2015 1 Homework 1 Homework 1 ECE 345 Algorithms and Data Structures Winter Semester, 2015 Due: 1PM, Jan 27, in ECE345 dropbox (next to SFB560) This homework is designed so you practice your background in introductory discrete math
School: University Of Toronto
V. Adamchik 1 Recursions Victor Adamchik Fall of 2005 Plan 1. Solving Linear Recurrences with Constant Coefficients 1.1 Iterations 1.2 Characteristic equation 1.3 General solution 1.4 Higher order equations 1.5 Multiple roots Solving Second Order Recurren
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 20142015 Problem Set #4  Due November 16, 2014 1. Consider the twoplayer zerosum continuouskernel game where each of the two playe
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 20142015 Problem Set #5  Due November 26, 2014 1. Exercise 6.1. 2. Exercise 7.1. 3. Exercise 7.2. 4. Consider the replicator dynamics
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #3  Due October 26, 2014 1. Consider the twoplayer bimatrix game with the following cost matrices A= 2 1 B= 1 2
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #2  Due Oct 19, 2014 1. Consider the twoplayer zerosum matrix game with the following cost matrix 1 3 3 2 A= Find t
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #1  Due October 5 1. Consider the twoplayer zerosum matrix 1 5 A= 2 game with the following cost matrix 4 2 3 2 1
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Game Theory and Evolutionary Games Lacra Pavel Systems Control Group Dept. of Electrical and Computer Engineering University of Toronto 2014 2 Contents 1 The Name of the Game 5 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
School: University Of Toronto
Course: Game Theory And Evolutionary Games
DescriptionofprojecttopicCooperativeGames WenyangLiu Topic: Cooperative Games A cooperative game is defined as a game where groups of players may enhance cooperative behaviors compete with each other, rather than individual competition. One significant fo
School: University Of Toronto
Course: Internetworking
Review of Important Networking Concepts Introductory material. This module uses the example from the previous module to review important networking concepts: protocol architecture, protocol layers, encapsulation, demultiplexing, network abstractions. 1 Se
School: University Of Toronto
ECE1762 LEC17 Page 1 of 8 ECE1762 LEC17 Page 2 of 8 ECE1762 LEC17 Page 3 of 8 ECE1762 LEC17 Page 4 of 8 ECE1762 LEC17 Page 5 of 8 ECE1762 LEC17 Page 6 of 8 ECE1762 LEC17 Page 7 of 8 ECE1762 LEC17 Page 8 of 8 ECE1762 LEC18 Page 1 of 7 ECE1762 LEC18 Page 2
School: University Of Toronto
V. Adamchik 1 Recursions Victor Adamchik Fall of 2005 Plan 1. Solving Linear Recurrences with Constant Coefficients 1.1 Iterations 1.2 Characteristic equation 1.3 General solution 1.4 Higher order equations 1.5 Multiple roots Solving Second Order Recurren
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Game Theory and Evolutionary Games Lacra Pavel Systems Control Group Dept. of Electrical and Computer Engineering University of Toronto 2014 2 Contents 1 The Name of the Game 5 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 7 Replicator Dynamics Chapter Summary This chapter introduces dynamic concepts in EGT using the continuoustime Replicator Dynamics (RD) that models selection of the ttest strategies in the population. We discuss stability properties of RD equilib
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 4 ContinuousKernel Games Chapter Summary This chapter focuses on noncooperative (Nash) games with continuouskernel i.e., with continuous action spaces and cost functions. Basic concepts and results are reviewed, mostly adapted from [18]. 4.1 Int
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 3 Matrix Games: Nplayer Nonzero Sum Chapter Summary This chapter considers normalform games with nite action sets, hence matrix games, in the general nonzero sum case. Twoplayer or bimatrix games are treated rst followed by Nplayer matrix game
School: University Of Toronto
Course: Game Theory And Evolutionary Games
Chapter 6 Evolutionary Games and Evolutionary Stability Chapter Summary This chapter introduces evolutionary games and the concept of evolutionary stability in a large population of agents. We start by introducing the concept of evolutionary stable strate
School: University Of Toronto
Course: Operating Systems
Operating Systems ECE344 Ding Yuan Review Disk April 7, 2013 2 ECE344  Lecture 13  SSD Fundamental Limitation with HD Mechanical Cannot be made too fast Latency in milliseconds April 7, 2013 3 ECE344  Lecture 13  SSD SolidState Drive (SSD) Nonvo
School: University Of Toronto
Course: Operating Systems
Operating Systems ECE344 Ding Yuan Deadlock Synchronization is a live gun we can easily shoot ourselves in the foot Incorrect use of synchronization can block all processes We have talked about this problem already More generally, processes that alloc
School: University Of Toronto
Course: Operating Systems
1/13/13 Operating Systems ECE344 Ding Yuan Announcements & reminders Lab schedule is out Form your group of 2 by this Friday (18th), 5PM Grading policy: Final exam: 50% Midterm exam: 25% Lab assignment: 25% Piazza Q/A Please prefix your post with:
School: University Of Toronto
Course: Operating Systems
2/11/13 Operating Systems ECE344 Ding Yuan Announcement & Reminder Lab 0 mark posted on Piazza Great job! One problem: compilation error I fixed some for you this time, but wont do it next time Make sure you run os161tester m: what you get will be y
School: University Of Toronto
Course: Operating Systems
2/10/13 Operating Systems ECE344 Midterm review Ding Yuan Overview The midterm Architectural support for Oses Processes Threads Synchronization 2/10/13 2 Ding Yuan, ECE344 Operating Systems 1 2/10/13 Midterm Date: Feb 25th Location: GB405 and GB412
School: University Of Toronto
Course: Operating Systems
1/21/13 Operating Systems ECE344 Ding Yuan Processes This lecture starts a class segment that covers processes, threads, and synchronization These topics are perhaps the most important in this class You can rest assured that they will be covered in the
School: University Of Toronto
Course: Operating Systems
2/4/13 Operating Systems ECE344 Ding Yuan Synchronization: why? A running computer has multiple processes and each process may have multiple threads User space Threads Process Kernel space Need proper sequencing Analogy: two people talking at the same
School: University Of Toronto
Course: Operating Systems
1/31/13 Operating Systems ECE344 Ding Yuan Announcements and reminders Lab 0 due this Friday 5PM Submission procedural simplified: Only tag the repository as asst0end No need to use submitece344s Make sure you try the os161tester m No lecture on F
School: University Of Toronto
Course: Operating Systems
1/17/13 Operating Systems ECE344 Ding Yuan Announcements & reminders Lab 0 is released Due: Feb 1, 5PM (hard deadline) Form your group of 2 by this Friday (18th), 5PM Please send the UTORid of you and your teammate to me vie email You should receive
School: University Of Toronto
Course: Algorithms And Data Structures
Outline NPCompleteness Proofs Matt Williamson1 1 Lane Department of Computer Science and Electrical Engineering West Virginia University Graph Theory, Packing, and Covering Williamson NPCompleteness Proofs Outline Outline 1 NPComplete Problems in Graph
School: University Of Toronto
Course: Communication Systems
Sampling and Pulse Code Modulation Sampling Theorem Assume that g ( t ) is a baseband signal with bandwidth B . Define T ( t ) = s ( t nTs )  a delta train n Then g ( t ) = g ( t ) T ( t ) = s g ( nTs ) ( t nTs ) is the sampled signal. n What is the sp
School: University Of Toronto
Course: Communication Systems
Angle Modulation (Frequency or Phase) Generalized sinusoid: ( t ) = A cos ( ( t ) ) ( t ) is the generalized phase function, or instantaneous phase. If ( t ) is a linear function, i.e. ( t ) = 2f c t + 0 then we have a pure sinusoid, i.e. a sinusoid with
School: University Of Toronto
Course: SIGNALS AND SYSTEMS
2SXIW SR (MWGVIXI 8MQI *SYVMIV 8VERWJSVQ 7YTTSWI \?RA MW E WIUYIRGI WEXMWJ]MRK 8LIR MW [IPP HIJMRIH JSV EPP ERH MW TIVMSHMG [MXL TIVMSH MW GEPPIH XLI HMWGVIXI XMQI *SYVMIV XVERWJSVQ SJ XLI WIUYIRGI \?RA RZIVWMSR 8LI (8*8 GER FI MRZIVXIH XS KIX FEGO XLI X
School: University Of Toronto
Course: Communication Systems
Modulation Modulation is a process that causes the spectrum of a signal to be transformed into a different band Typical information bearing signals have spectral content in the low frequency range. Such signals are referred to as a baseband signals. The m
School: University Of Toronto
Course: Internetworking
Review of Important Networking Concepts Introductory material. This module uses the example from the previous module to review important networking concepts: protocol architecture, protocol layers, encapsulation, demultiplexing, network abstractions. 1 Se
School: University Of Toronto
Course: Random Pro
ECE 537H1S  Random Processes, Fall 2014 Synopsis: Introduction to the principles and properties of random processes, with applications to communications, control systems, and computer science. Prerequisites: Introductory probability (ECE 302), linear sys
School: University Of Toronto
Course: Internetworking
2.71 2.7 The Gaussian Probability Density Function Samples taken from a Gaussian process have a jointly Gaussian pdf (the definition of Gaussian process). Correlator outputs are Gaussian random variables if the input is a Gaussian process. A pdf of enorm
School: University Of Toronto
Course: Computer Networks
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Probability And Applications
School: University Of Toronto
Course: Electromagnetic Theory
Nt o te71oapdsg:Yuwl ntne t rmme te oe n h 4 pm ein o il o ed o eebr h priuaso ti crutfrayea. Hwvr teidvda atclr f hs ici o n xm oee, h niiul sbiciscnanawat o eape adqiktikn eecss ucrut oti elh f xmls n uchnig xrie ta wl srl adi udrtnigaao eetois ht il u
School: University Of Toronto
Course: Electromagnetic Theory
School: University Of Toronto
Course: Internetworking
2.21 2.2 Lowpass and Bandpass Energy Relationships SNR is a critical parameter in performance analysis, so we must get it right in bandpass systems. The classical complex envelope makes these calculations messy and errorprone, which motivates our use of
School: University Of Toronto
Course: Internetworking
2.61 2.6 Filtering and Correlating Noise [P2.2.3] Filters and correlators perform the inner products that are at the core of most modems. We need to know their effect on the statistics of a noisy signal. This section should be familiar to you, except th
School: University Of Toronto
Course: Internetworking
2.51 2.5 Generation of Orthonormal Bases We have seen that orthonormal bases simplify the calculation of coefficients xn and the calculation of distances and energies from the coefficients. This section outlines two classical ways to generate an orthono
School: University Of Toronto
Course: Internetworking
2.31 2.3 Bandpass Random Processes [P4.1.4] What if the bandpass and complex baseband signals are random processes? How are their statistics (autocorrelation, power density) related? 2.3.1 Complex Random Processes Consider the process v(t ) = x(t ) + j
School: University Of Toronto
Course: Internetworking
2.41 2.4 Signal Space [P2.4] You are used to the association between ntuples of numbers and points in space, and you even call them both "vectors." It's a powerful link, because you can visualize many operations on ntuples as corresponding operations
School: University Of Toronto
Course: Internetworking
2.10 2. SIGNAL REPRESENTATION Before we can think clearly about detecting signals, we must be able to describe them. This section is partly review, partly extension of what you have learned in your undergrad course on digital communications. Topics: o co
School: University Of Toronto
Course: Computer Networks
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Algorithms And Data Structures
School: University Of Toronto
Course: Internetworking
IP Multicasting 1 J. Liebeherr, All rights reserved Applications with multiple receivers Many applications transmit the same data at one time to multiple receivers Broadcasts of Radio or Video Videoconferencing Shared Applications A network must hav
School: University Of Toronto
Course: Internetworking
DNS Domain Name System Domain names and IP addresses People prefer to use easytoremember names instead of IP addresses Domain names are alphanumeric names for IP addresses e.g., neon.ece.utoronto.ca, www.google.com, ietf.org The domain name system (D
School: University Of Toronto
Course: Internetworking
Understanding IP Addressing: Everything You Ever Wanted To Know Prefix  Length sC s g fu lass C h CI g ed nd te tin t N s ge atc M er b stNum Ho n Lo rk wo et ix ef Pr Chuck Semeria NSD Marketing 3Com Corporation April 26, 1996 tin l k et SM et as Ex r
School: University Of Toronto
Course: Internetworking
Dynamic Host Configuration Protocol (DHCP) Relates to Lab 7. Module about dynamic assignment of IP addresses with DHCP. 1 Dynamic Assignment of IP addresses Dynamic assignment of IP addresses is desirable for several reasons: IP addresses are assigned o
School: University Of Toronto
Course: Internetworking
LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging) and routing. Then discusses LAN switching, including learning bridge algorithm, transparent bridging, and
School: University Of Toronto
Course: Internetworking
Network Address Translation (NAT) Relates to Lab 7. Module about private networks and NAT. 1 Private Network A Private IP network is an IP network that is not directly connected to the Internet IP addresses in a private network can be assigned arbitrari
School: University Of Toronto
Course: Internetworking
TCP  Part II 1 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information Error Control: Algorithms to recover or conceal the effects from packet losses Congestion Control: Algori
School: University Of Toronto
Course: Internetworking
Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research. J. Liebeherr, All rights reserved 1 Internet Infrastructure Regional Network (Tier 2) IXP Backbone Network (Tier 1) local ISP (Tier 3) Regional Netw
School: University Of Toronto
Course: Internetworking
VLANs Relates to Lab 6. Short module on basics of VLAN switching 1 Large LANs Broadcast traffic in LANs is sent to all devices on LAN becomes a problem in large LANs Switch Large LAN Switch Separate broadcast domains by subnetting Broadcast traffic in LA
School: University Of Toronto
Course: Internetworking
Dynamic Routing Protocols II OSPF Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. 1 Distance Vector vs. Link State Routing With distance vector routing, each node has information only abou
School: University Of Toronto
Course: Internetworking
TCP  Part I Relates to Lab 5. First module on TCP which covers packet format, data transfer, and connection management. 1 Overview Byte Stream Byte Stream TCP = Transmission Control Protocol TCP is a connectionoriented protocol that provides a reliable
School: University Of Toronto
Course: Internetworking
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP. 1 Orientation We move one layer up and look at the transport layer. User Process User Process User Process Applica
School: University Of Toronto
Course: Internetworking
Dynamic Routing Protocols I RIP Relates to Lab 4. The first module on dynamic routing protocols. This module provides an overview of routing, introduces terminology (interdomain, intradomain, autonomous system), 1 Routing Recall: There are two parts to r
School: University Of Toronto
Course: Internetworking
IP Forwarding Relates to Lab 3. Covers the principles of endtoend datagram delivery in IP networks. 1 Delivery of an IP datagram View at the data link layer layer: Internetwork is a collection of LANs or pointtopoint links or switched networks that
School: University Of Toronto
Course: Internetworking
Router Architectures An overview of router architectures. Introduction What is a Packet Switch? Basic Architectural Components Some Example Packet Switches The Evolution of IP Routers 2 Router Components Hardware components of a router: Network interf
School: University Of Toronto
Course: Internetworking
IPv4 Addresses Internet Protocol: Which version? There are currently two versions of the Internet Protocol in use for the Internet IPv4 (IP Version 4) Specified in 1980/81 (RFC 760, 791) Four byte addresses Universally deployed Problem: Address space alm
School: University Of Toronto
Course: Internetworking
IPv4  The Internet Protocol Version 4 1 Orientation IP (Internet Protocol) is a Network Layer Protocol. There are currently two version in use: IPv4 (version 4) and IPv6 (Version 6) Here we discuss IPv4 2 IP: The waist of the hourglass IP is the wais
School: University Of Toronto
Course: Internetworking
Internet Control Message Protocol (ICMP) 1 Overview The IP (Internet Protocol) relies on several other protocols to perform necessary control and routing functions: Control functions (ICMP) Multicast signaling (IGMP) Setting up routing tables (RIP, OS
School: University Of Toronto
Course: Internetworking
Address Resolution Protocol (ARP) 1 Overview Interface to Ethernet 2 Need for Address Translation Note: The Internet is based on IP addresses Local area networks use MAC addresses The ARP and RARP protocols perform the translation between IP and MAC l
School: University Of Toronto
Course: Internetworking
Data Link Protocols Relates to Lab 2. This module covers data link layer issues, such as local area networks (LANs) and pointtopoint links, Ethernet, and the PointtoPoint Protocol (PPP). 1 TCP/IP Suite and OSI Reference Model The TCP/IP architecture
School: University Of Toronto
Course: Internetworking
Introduction to IPv6 J. Liebeherr, 2012, All rights reserved Internet Protocol: Which version? There are currently two versions of the Internet Protocol in use for the Internet IPv4 (IP Version 4) Specified in 1980/81 (RFC 760, 791) Four byte addresses
School: University Of Toronto
Course: Internetworking
Subnetting and Supernetting Network Prefix and Host number IP address consists of a network prefix and a host number Prefix notation: 128.100.11.60/16 Notation with netmask: 128.100.11.60 255.255.0.0 Subnetting Scenario: Organization has a large netwo
School: University Of Toronto
Course: Internetworking
TCP/IP Networking An Example Introductory material. This module illustrates the interactions of the protocols of the TCP/IP protocol suite with the help of an example. The example intents to motivate the study of the TCP/IP protocols. 1 A simple TCP/IP Ex
School: University Of Toronto
Course: Internetworking
Address Lookup in IP Routers Routing Table Lookup Routing Table Output Scheduling Switch Fabric Routing Decision Routing Table Forwarding Decision Routing Table Forwarding Decision 2 IPv4 Routing Table Size Source: Geoff Huston, APNIC 3 Routing table look
School: University Of Toronto
Course: Internetworking
Intro to IPv6 Addresses IPv6 Header 32 bits version (4 bits) Traffic Class (8 bits) Payload Length (16 bits) Flow Label (24 bits) Next Header (8 bits) Hop Limits (8 bits) Source IP address (128 bits) Destination IP address (128 bits) IPv6 addresses have
School: University Of Toronto
Course: Fields And Waves
EE135,Winter2012 Reading:nishChapter1,Ulabyet.al.6thedi9on Chapter2,sec9ons2.12.9.pp4887. Homework#2:problems,due1/26/12 chap.1,1.28 chap.2,2.1,2.6(1stpart),2.7(1stpart),2.12,2.13,2.19 DiscussionSession:78pmWednesdays,JacksLounge Prelim.1onFeb.2,2012,Thu
School: University Of Toronto
Course: Fields And Waves
Transmission Lines Smith Chart & Impedance Matching (Intensive Reading) 1 The Smith Chart Transmission line calculations such as the determination of input impedance using equation (4.30) and the reflection coefficient or load impedance from equation (4.3
School: University Of Toronto
Course: Fields And Waves
ECE 134 Introductory Electromagnetics Prof. York Review of TransmissionLine Theory The term transmissionline in electromagnetics is commonly reserved for those structures which are capable of guiding TEM waves. Transmissionlines are a special class of
School: University Of Toronto
Course: Fields And Waves
f ZL zL yB B L = 1 GHz j = RL CL = 60 j71.7 = 1.5 + j1.8 = 1 + j1.5 1 = 40 (1.5) = 0.03755 (inductive) 1 = BB  (1.5) = 4.24 nH d = 0.5 0.446 + 0.176 = 0.23 = 0.046 m = 2 c 3 1GHz = 0.2 m Problem 2 Problem 2.63: A 50 lossless line 0.6 long is terminated
School: University Of Toronto
Course: Fields And Waves
Problem 7.19 Ignoring reection at the airsoil boundary, if the amplitude of a 3GHz incident wave is 10 V/m at the surface of a wet soil medium, at what depth will it be down to 1 mV/m? Wet soil is characterized by r = 1, r = 9, and = 5 104 S/m. Solution:
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 9 Topics: PlaneWave Propagation, Propagation in lossy media, electromagneti
School: University Of Toronto
Course: Fields And Waves
Problem 8.1 A plane wave in air with an electric eld amplitude of 20 V/m is incident normally upon the surface of a lossless, nonmagnetic medium with r = 25. Determine the following: (a) The reection and transmission coefcients. (b) The standingwave rati
School: University Of Toronto
Course: Fields And Waves
Problem 7.1 The magnetic eld of a wave propagating through a certain nonmagnetic material is given by H = z 30 cos(108t 0.5y) (mA/m) Find the following: (a) The direction of wave propagation. (b) The phase velocity. (c) The wavelength in the material. (d)
School: University Of Toronto
Course: Fields And Waves
Problem 3.41 Evaluate the line integral of E = x x y y along the segment P1 to P2 of the circular path shown in the gure. y P1 = (0, 3) x P2 = (3, 0) Solution: We need to calculate: P2 P1 E d . Since the path is along the perimeter of a circle, it is bes
School: University Of Toronto
Course: Fields And Waves
Problem 6.1 The switch in the bottom loop of Fig. P6.1 is closed at t = 0 and then opened at a later time t1 . What is the direction of the current I in the top loop (clockwise or counterclockwise) at each of these two times? R2 I t = t1 t=0 R1 Figure P6.
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 5 Topics: diagrams Impedance matching, transient response of transmission li
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 5 Topics: Review of vector calculus Reading: Chapter 3 1. 2. 3. 4. 5. 6. Ula
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 4 Topics: Timeharmonic behaviour of transmission lines, standing waves, Smi
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 2 Topics: Timeharmonic behaviour of transmission lines, standing waves Read
School: University Of Toronto
Course: Fields And Waves
ECE320H1F Fields and Waves Problem Set 1 Solution 1. Calculate the current phasor: . Convert to time domain: 0.6 0.6 cos 67 . 2. a) First convert from sin to cos, then convert into a phasor: 4 cos 90 3 cos 30 3 30 4 90 Transform back into time domain: 3 3
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 3 Topics: Timeharmonic behaviour of transmission lines, standing waves, imp
School: University Of Toronto
Course: Fields And Waves
ECE320H1FFields and Waves Problem Set 3 Solutions Fall 2010 1) L 2 C 2 ) (1 j ) ( R jL )(G jC ) RG (1 j R G 1 1 Now, use the following relation: (1 x) 2 1 x for x 1 2 L C (Note that 1 and 1 ) R G L C j L C 1 L C j L C RG (1 j )(1 j ) RG 1 ( ) ( )(
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE320H1F FIELDS AND WAVES PROBLEM SET 1 Topics: Review of phasors, distributed parameter model Reading: Ulaby sect
School: University Of Toronto
Course: Fields And Waves
U NIVERSITY OF T ORONTO FACULTY OF A PPLIED S CIENCE AND E NGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE 320H1F F IELDS AND WAVES MIDTERM 17 November 2011, 19:00 20:30 Examiner: Prof. George V. Eleftheriades, Pr
School: University Of Toronto
Course: Fields And Waves
Finite Transmission Lines 28 ECE320 / Prof. S. V. Hum 29 ECE320 / Prof. S. V. Hum Reflection Coefficient 30 ECE320 / Prof. S. V. Hum Standing Waves and VSWR 31 ECE320 / Prof. S. V. Hum Standing Waves and VSWR 32 ECE320 / Prof. S. V. Hum Standing Waves and
School: University Of Toronto
Course: Fields And Waves
U NIVERSITY OF T ORONTO FACULTY OF A PPLIED S CIENCE AND E NGINEERING The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE 320H1F F IELDS AND WAVES MIDTERM 19 November 2010, 19:30 21:00 Examiner: Prof. George V. Eleftheriades, Pr
School: University Of Toronto
Course: Fields And Waves
UNIVERSITY OF TORONTO Department of Electrical and Computer Engineering ECE320H1F Fields and Waves Course Outline 2012 Instructor Office Room Email Address Lecture Times Prof. S. V. Hum BA5122 sean.hum@utoronto.ca Mondays 12pm GB220 Wednesdays 910am GB1
School: University Of Toronto
Course: Fields And Waves
Q1 a) Vemf = j2.094 cos(tau) mV b) Yes, the antenna is polarization sensitive since the voltage depends on the cos(tau). The magnitude of the voltage is maximized when cos(tau) =1, or tau=0 c)Vemf = 0 V d) Vemf = j49.3 mV e) I = 0.988 mA Q2 a) v_phase =
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 3 For the Chapter 3 questions, be sure to draw the cash flow diagrams to help understand the problem. Question 1 Annuity Valuation Methods 316  Consider the various approaches to the problem as there is more
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 4 Question 1 Present Value Project Analysis 47 Question 2 Internal Rate of Return Project Analysis In order to improve air quality, the Ministry of the Environment has tightened the regulations on the accepta
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 5 Question 1 Capital Cost Tax Factor The Six Points Construction Company is a profitable construction company. It has purchased a bulldozer for $50,000. Assume that Six Points Construction acquired this power
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 9 Question 1 Accounting Statements  Basic 91 This is an excellent warmup accounting question before attempting Problem Set #1 and Question 2. Question 2 Accounting Statements More Complex i. A new "Pizza Pi
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 6 Question 1 Public Works Project B/C Ratio Analysis 66 Remember that the incremental approach must be used in this problem because it asks for the B/C ratio method. Also note that i=0 implies that money has
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 1 Question 1 Cash Flow Analysis Two investment opportunities are available. Each requires a $1 000 investment. The returns are guaranteed and are as follows (EOY end of year): Investment Choice A Choice B EOY
School: University Of Toronto
Course: Engineering Economics
ECE 472 Tutorial Review Questions for Chapter 7 Question 1 BreakEven Analysis A store owner is considering purchasing a Kodak photo kiosk. It can be purchased for $50 000 and is expected to have a useful life of 4 years at which time its salvage value wi
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2010 Quiz 1  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only aid permitted are the t
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2013 Quiz 2  Solutions Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. No calculators may be used. Write your answers on the pages provided, using
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Fall 2012 Solutions Quiz 1 Instructions (read carefully): The time for this quiz is 50 minutes. This is a closed book and closed notes inclass exam. Nonprogrammable calculators are permitted The only other aid permitted are t
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2013 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You can bring two handwritten aid sheets (standard form, only one side of each sheet can be written) or one sheet (writ
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2012 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your textbook, l
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2011 Quiz 2 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your textbook, l
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2007 Quiz 2 Solution Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use two handwritten aid sheets prepared by you and a calculator. You may not use your te
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2013 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one singlesided handwritten aid sheet prepared by you and a calculator. You may not use your
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2012 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one singlesided handwritten aid sheet prepared by you and a calculator. You may not use your
School: University Of Toronto
Course: Computer Networks 2
ECE 466: Computer Networks II Winter 2008 Quiz 1 Instructions: Read carefully before beginning. The time for this quiz is 50 minutes. You are permitted to use one handwritten aid sheet prepared by you and a calculator. You may not use your textbook, le
School: University Of Toronto
Course: Computer Networks 2
University of Toronto Faculty of Applied Science and Engineering Final Exam, May 2008 ECE 466: Computer Networks II Examiner: J. Liebeherr Exam Type: D Permitted aids: Two handwritten aid sheets (standard form, only one side of each sheet can be written
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2012 1 Homework 3 Homework 3 ECE 345 Algorithms and Data Structures Fall Semester, 2012 To be submitted by October 30 at noon in the drop box labeled ECE345 in the SF basement down the hall from the ECE undergraduate oce (the corrid
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2012 1 Homework 5 Homework 5 ECE 345 Algorithms and Data Structures Fall Semester, 2012 To be submitted by December 5 at 2pm in the drop box labeled ECE345 in the SF basement down the hall from the ECE undergraduate oce (the corrido
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2012 1 Homework 4 Homework 4 ECE 345 Algorithms and Data Structures Fall Semester, 2012 To be submitted by November 21 at 2pm in the drop box labeled ECE345 in the SF basement down the hall from the ECE undergraduate oce (the corrid
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2010 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of e
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2012 1 Homework 2 Homework 2 ECE 345 Algorithms and Data Structures Fall Semester, 2012 Due: October 12, 2012, inclass All page numbers are from 2001 edition of Cormen, Leiserson, Rivest and Stein. For each algorithm you asked to
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2012 1 Homework 1 Homework 1 ECE 345 Algorithms and Data Structures Fall Semester, 2012 To be submitted by Monday, October 1 at 2pm in the drop box labeled ECE345 in the SF basement down the hall from the ECE undergraduate oce (the
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Final Examination ECE 345 Algorithms and Data Structures Fall 2010 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of eve
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #5 Chapter Five RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) + cos(A+B) 2 sinA sinB = cos(AB) cos(A+B)
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #3 Chapter Three RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 1a. Find the DC component of a(t) = 3 sin(t) on the interval t =
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #10 Chapter Ten RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) + cos(A+B) 2 sinA sinB = cos(AB) cos(A+B)
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #6 Chapter Six RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) + cos(A+B) 2 sinA sinB = cos(AB) cos(A+B) 2
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory Quiz #8 with MATLAB Applications Chapter Eight RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) + cos(A+B) 2 sinA sinB = cos(AB) cos(A+B)
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory Quiz #9 with MATLAB Applications Chapter Nine RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) 2 sinA sinB = cos(AB) 2 sinA cosB = sin(A
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory Quiz #7 with MATLAB Applications Chapter Seven RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 2 cosA cosB = cos(AB) 2 sinA sinB = cos(AB) 2 sinA cosB = sin(A
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #4 Chapter Four RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators 1. A voltage signal p(t) is shown in terms of its complex Fourier
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #2 Chapter Two RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators Consider the signals a(t) = cos( 2 t ) and b(t) = 1/3 cos( 6 t ) an
School: University Of Toronto
Course: Digital Signal Processing
NAME: NUMBER: Practical Signals Theory with MATLAB Applications Quiz #1 Chapter One RICHARD J. TERVO Answer all questions in the space provided No other work will be graded No calculators On the graph below, make a neat and labeled sketch of the signal s(
School: University Of Toronto
Course: Computer Organization
Page 1 of 17 Last Name (in case pages get detached):_ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2011 ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Duration: 2.5 Hours Prof.s Anderson, Enright Jerger, and Ste
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2010 Second Year ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Examiner A. Moshovos Instructions This is a type D exam. You
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ NIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2010 Second Year ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Examiner P. Anderson, N. Enright Jerger, A. Moshovos Instructi
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2013 Second Year ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Examiner P. Anderson, N. Enright Jerger, and A. Moshovos Inst
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, DECEMBER 2013 Third Year ECE352 COMPUTER ORGANIZATION Exam Type: D Examiner A. Moshovos Instructions This is a type D exam. You ar
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2013 Second Year ECE352 S COMPUTER ORGANIZATION Exam Type: D Examiner A. Moshovos Instructions This is a type D exam. You ar
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2008 Second Year ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Examiners A. Moshovos, G. Steffan Instructions This is a type
School: University Of Toronto
Course: Computer Organization
Student # (use if pages get separated) _ UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2009 Second Year ECE243H1 S COMPUTER ORGANIZATION Exam Type: D Examiners A. Moshovos, G. Steffan Instructions This is a type
School: University Of Toronto
Course: Digital & Computer System
University of Toronto Faculty of Applied Science and Engineering Final Exam December 2012 ECE253 Digital and Computer Systems Examiner Prof. Stephen Brown Print: First Name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Last Name . . . . . . .
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2013 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of e
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2012 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of e
School: University Of Toronto
Course: Algorithms And Data Structures
University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2010 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of eve
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2009 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of e
School: University Of Toronto
Course: Algorithms And Data Structures
University of Toronto ECE345: Algorithms and Data Structures Solutions to Midterm Examination (Fall 2009) 1. (a) False. 2 2 2 First, since n = O(2n ), 2n + n = (2n ). limn 2 2n n2 n So it remains to show that limn 22 2n2 = = . (b) Base case: n = 1 holds
School: University Of Toronto
Course: Algorithms And Data Structures
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2005 Print your name and ID number neatly in the space provided below; print your name at the upper right corner of e
School: University Of Toronto
Course: Communication Systems
Department of Electrical & Computer Engineering University of Toronto Communication Systems I  ECE 316F Midterm Test  October 24, 2014 (E. S. Sousa) Solutions Marks: (14 + 12 + 14 = 40). Each of the 20 parts is worth 2 marks. Begin the answer to each of
School: University Of Toronto
Course: Digital Signal Processing
Name: Student No.: University of Toronto Electrical & Computer Engineering ECE 455, Fall 2013 Thursday, October 24, 2013 Test #1 Professor Deepa Kundur Duration: 50 minutes All work must be performed within the space provided. You may use the back of she
School: University Of Toronto
Course: Digital Signal Processing
Name: Student No.: University of Toronto Electrical & Computer Engineering ECE 455, Fall 2013 Thursday, November 28, 2013 Test #2 Professor Deepa Kundur Duration: 50 minutes All work must be performed within the space provided. You may use the back of sh
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte). (a) Explain the difference between the advertised window and th
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 5 Problem 1. Policy Based Routing in BGP The figure shows a network with six autonomous systems. AS4 owns the prefix 10.0.1.0/24 and sends an advertisement to AS1 with the following pre
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions: Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figure 1. No machine is
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 2 Problem 1. Describe how class A, B, and C IP addresses are recognized in a binary representation of IP addresses ? Class A  8 bit prefix  0. Class B  16 bit prefix  10. Class C  24 bit prefix  110. Problem 2.
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 4 Problem 1. Consider the following set of prefixes a) 0001* b) 00010* c) 00011* d) 001* e) 0101* f) 011* g) 100* h) 1010* i) 1100* j) 11110000* Construct the following tries and trees 1) a binary trie for the set of
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Set 3 Solutions Problem 1. Consider the network shown in Figure 1 with three hosts (HostA, HostB, HostC), one router (Router1), and two Ethernet segments. The figure includes the network configuration, the IP addresses, the
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Set 3 Problem 1. Consider the network shown in Figure 1 with three hosts (HostA, HostB, HostC), one router (Router1), and two Ethernet segments. The figure includes the network configuration, the IP addresses, the netmasks,
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Problem Sheet 1 Instructions (read carefully): Try to solve the problems on your own. Solutions will be discussed in tutorials. Problem 1. Consider an Ethernet network with three hosts, Host A, Host B, and Host C as shown in Figu
School: University Of Toronto
UofTorontoECE 345Winter, 2015 1 Homework 2 Homework 2 ECE 345 Algorithms and Data Structures Winter Semester, 2015 Due: Feb 10 at 12noon in ECE345 dropbox All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein. For each algori
School: University Of Toronto
UofTorontoECE 345Winter, 2015 1 Homework 1 Homework 1 ECE 345 Algorithms and Data Structures Winter Semester, 2015 Due: 1PM, Jan 27, in ECE345 dropbox (next to SFB560) This homework is designed so you practice your background in introductory discrete math
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 20142015 Problem Set #4  Due November 16, 2014 1. Consider the twoplayer zerosum continuouskernel game where each of the two playe
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 20142015 Problem Set #5  Due November 26, 2014 1. Exercise 6.1. 2. Exercise 7.1. 3. Exercise 7.2. 4. Consider the replicator dynamics
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #3  Due October 26, 2014 1. Consider the twoplayer bimatrix game with the following cost matrices A= 2 1 B= 1 2
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #2  Due Oct 19, 2014 1. Consider the twoplayer zerosum matrix game with the following cost matrix 1 3 3 2 A= Find t
School: University Of Toronto
Course: Game Theory And Evolutionary Games
University of Toronto Department of Electrical and Computer Engineering ECE1657 Game Theory and Evolutionary Games Fall 2014 Problem Set #1  Due October 5 1. Consider the twoplayer zerosum matrix 1 5 A= 2 game with the following cost matrix 4 2 3 2 1
School: University Of Toronto
Course: Game Theory And Evolutionary Games
DescriptionofprojecttopicCooperativeGames WenyangLiu Topic: Cooperative Games A cooperative game is defined as a game where groups of players may enhance cooperative behaviors compete with each other, rather than individual competition. One significant fo
School: University Of Toronto
Course: Algorithms And Data Structures
Chapter 23 More NPComplete Problems CS 473: Fundamental Algorithms, Spring 2011 April 21, 2011 23.0.0.1 Recap NP: languages that have polynomial time certiers/veriers A language L is NPComplete i L is in NP for every L in NP, L P L L is NPHard if for
School: University Of Toronto
Course: Algorithms And Data Structures
Algorithms and Complexity. Exercise session 6 NPproblems In mobile telephony, you need to solve the frequency allocation problem, which is stated as follows. There are a number of transmitters deployed and each of them can transmit on any of a given set
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Tutorial on Polynomialtime Reductions Tutorial on Polynomialtime Reductions ECE 345 Algorithms and Data Structures Fall Semester, 2013 Denition 0.1 (Polynomial time reducibility) : Language B is polynomial time reducible to
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Homework 4 Homework 4 ECE 345 Algorithms and Data Structures Fall Semester, 2013 Due: Nov 20th, 2PM ECE345 drop box All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein. For each algorithm you a
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Homework 1 Homework 1 ECE 345 Algorithms and Data Structures Fall Semester, 2013 Due: Sept 30th by 2pm This homework is designed so you practice your background in introductory discrete mathematics and combinatorics. You need
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Homework 2 Homework 2 ECE 345 Algorithms and Data Structures Fall Semester, 2013 Due: October 14, 2013, ECE345 drop o box All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein. For each algorithm
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Homework 5 Homework 5 ECE 345 Algorithms and Data Structures Fall Semester, 2013 Due: Dec 6th, 2PM ECE345 drop box All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein. For each algorithm you as
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2013 1 Homework 3 Homework 3 ECE 345 Algorithms and Data Structures Fall Semester, 2013 Due: Nov 1st, by 2PM  ECE345 drop box All page numbers are from 2009 3rd edition of Cormen, Leiserson, Rivest and Stein (CLRS). For each algo
School: University Of Toronto
Course: Computer Networks
ECE 361 Computer Networks Fall 2013 Office Hrs: Mon 34 pm or by appointment A. LeonGarcia, Bahen 4120, 4169784764 alberto.leongarcia@utoronto.ca Nadeem Abji (nadeem.abji@utoronto.ca): Course & Lab Coordination; Houman Rastegarfar (houman.rastegarfar@m
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 5 1. Explain the difference between connectionless unacknowledged service and connectionless acknowledged service. How do the protocols that provide these services differ? Solution: In an acknowledged connectionless network, reliable
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 10 1. If a LIS has N members, how many VCCs are required by the LIS to support full connectivity? Solution: A logical IP subnetwork (LIS) that has N members requires N (N 1) VCC for full connectivity. 2. Suppose a department installs
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 8 1. Identify the address class of the following IP addresses: 200.58.20.165; 128.167.23.20; 16.196.128.50; 50.156.10.10; 250.10.24.96. Solution: An IP address has a fixed length of 32 bits, where the most significant bits identify th
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 7 1. Explain how a network that operates internally with virtual circuits can provide connectionless service. Comment on the delay performance of the service. Can you identify inefficiencies in this approach? Solution: The connection
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 6 (Solution to problem 29 to be added.) 1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches? Solution: The computers in a LAN are separated by a short distance (typically < 100m)
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 9 1. Suppose that instead of ATM, BISDN had adopted a transfer mode that would provide constantbitrate connections with bit rates given by integer multiples of 64 kbps connections. Comment on the multiplexing and switching procedure
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 2 NOTE: A few solutions are missing and will be added. 1. Explain how the notion of layering and internetworking make the rapid growth of applications such as the World Wide Web possible. Solution: Internetworking allows many componen
School: University Of Toronto
Course: Computer Networks
Solutions to Chapter 1 1a. Describe the stepbystep procedure that is involved from the time you deposit a letter in a mailbox to the time the letter is delivered to its destination. What role do names, addresses and mail codes (such as ZIP codes or post
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2014 1 Homework 3 Homework 3 ECE 345 Algorithms and Data Structures Fall Semester, 2014 Due: Nov 4, in drop box All page numbers are from 2009 edition of Cormen, Leiserson, Rivest and Stein. For each algorithm you asked to design
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2014 1 Homework 1 Homework 1 ECE 345 Algorithms and Data Structures Fall Semester, 2014 Due: Sept 25, in ECE345 dropbox (next to SFB560) This homework is designed so you practice your background in introductory discrete mathematics
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2014 1 Homework 4 Homework 4 ECE 345 Algorithms and Data Structures Fall Semester, 2014 Due: Nov 25 in drop box All page numbers are from 2009 edition of Cormen, Leiserson, Rivest and Stein. For each algorithm you asked to design
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #6 with MATLAB Applications RICHARD J. TERVO Sampling and Reconstruction A discrete signal s(nT) can be created from a continuous signal s(t) by multiplying s(t) by an impulse train with period T as: s(nT ) = + (t nT ) s(t)
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #7 with MATLAB Applications Laplace Transform RICHARD J. TERVO The Laplace transform X(s) of a time domain signal x(t) is generally defined as: X(s) = + x(t) e st dt The onesided form of the Laplace transform is commonly see
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #8 with MATLAB Applications RICHARD J. TERVO The zTransform The ztransform X(z) of a sampled time domain signal x(nT) or x[n] is generally defined as: X(z) = + x[n] z n n= where z is a complex term. The onesided form of th
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #4 with MATLAB Applications RICHARD J. TERVO The Fourier Transform The Fourier transform S(f) of a time domain signal s(t) is given by: + S( f ) = s(t) e j 2 ft dt and the inverse Fourier transform is: s(t) = + S( f ) e+ j 2
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory with MATLAB Applications RICHARD J. TERVO Lab #5 System Modelling When a time domain signal s(t) enters a system with response function h(t), the output g(t) is described by the convolution: + g(t) = s(t) h(t) = s(x) h(t x) dx The
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory with MATLAB Applications RICHARD J. TERVO Lab #3 Complex Fourier Series The complex Fourier series representation of a periodic signal s(t) with period T=1/f0 is: s(t) = Ce + j 2 nf0t n n= where each of the components Cn at freque
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory Lab #2 with MATLAB Applications Fourier Series Components RICHARD J. TERVO The Fourier series approximation of a periodic signal s(t) with period T=1/f0 is given by: s(t) = A0 + An cos(2 nf0 t) + Bn sin(2 nf0 t) n=1 where each of
School: University Of Toronto
Course: Digital Signal Processing
Practical Signals Theory with MATLAB Applications RICHARD J. TERVO Lab #1 Signals Analysis using MATLAB This lab explores the use of MATLAB to study and analyze signals and systems. 1. Use MATLAB to complete Quiz #1 (attached). As a prelab exercise, go t
School: University Of Toronto
Course: NEURAL BIOELECTRICITY
PROPAGATION OF NEURONAL ELECTRICAL ACTIVITY INTRODUCTION The propagation of bioelectricity within a neuron occurs both passively and actively. Propagation and integration of synaptic inputs along the dendritic tree is primarily passive, while action poten
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
University of Toronto The Edward S. Rogers Sr. Department of Electrical and Computer Engineering ECE110S ELECTRICAL FUNDAMENTALS  SUPPLEMENT Laboratory Instructions Page i. ii. iii. iv. v. vi. Laboratory Guidelines Experiment 1 Equipment Exploration Expe
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
ECE110S Laboratory TA allocation  2013 Tuesday Wednesday 2  4 pm Thurday Friday 2  4 pm Kyle Cheng Sinisa Colic Samira Karimelahi Charles Lin Nima Zareian Shuang Xie Dongpeng Kang Feihu Xu Shuze Zhao Yiwei Zhang Jingshu Yu Mohammadsadegh Faraji 4  6 p
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
ECE110S Laboratory Schedule (GB341)  2013 W EEK DATE Tue. 46 pm Wed. 24 pm Wed. 46 pm Thur. 46 pm Fri. 24 pm Fri. 46 pm PRA 01 PRA 02 PRA 05 PRA 06 PRA 07 PRA 08 PRA 03 PRA 04 PRA 09 PRA 10 PRA 11 PRA 12 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 Ja
School: University Of Toronto
ECE552 Computer Architecture Fall 2013 Lab Assignment 5: Data Caches 1 Objective The objective of this assignment is to investigate the impact of data prefetchers on cache performance. All work on this assignment is to be done in groups of two. This assig
School: University Of Toronto
ECE552 Computer Architecture Fall 2013 Lab Assignment 6: Coherence 1 Objective The goal of this lab is to enhance your understanding of cache coherence. In the lectures you learned the fundamental concepts of coherence protocols. However, even simple thre
School: University Of Toronto
Course: Www.control.utoronto.ca/~broucke/ece311s/ECE311.html
CONTROL SYSTEMS LABORATORY ECE311S LAB1 Final Report Lab date: Students Names Student Numbers 1 Parts 510: The relationship between the parameters a and b is_ Provide a derivation of this relationship based on your experimental observations: The values o
School: University Of Toronto
Course: Www.control.utoronto.ca/~broucke/ece311s/ECE311.html
CONTROL SYSTEMS LABORATORY ECE311S LAB2: Cruise Control Design Final Report Lab date: Students Names Student Numbers 1 Identification of model parameters a and b The estimated parameters are: a=_ b=_ Control design using Matlab Part 1 Root locus plot when
School: University Of Toronto
Course: Www.control.utoronto.ca/~broucke/ece311s/ECE311.html
CONTROL SYSTEMS LABORATORY ECE311S LAB2: Cruise Control Design Final Report Lab date: Students Names Student Numbers 1 Identification of model parameters a and b The estimated parameters are: A= 1.2 b= 8 Control design using Matlab Part 1 Figure 1: Root l
School: University Of Toronto
Course: Computer Organization
University of Toronto, Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering ECE 243S Computer Organization 2013 Lab Structure There are seven labs of three hours each, and so you will have one 3hour lab every week.
School: University Of Toronto
Course: EK
ECE231S  Introductory Electronics 2013 Lab Handout Updated January 17, 2013 Department of Electrical and Computer Engineering University of Toronto Lab Handout ECE231 Introductory Electronics Table of Contents ECE231S Introduction .1 Lab 1: OpAmp Circui
School: University Of Toronto
Course: Operating Systems
Lab 3.2: Overview David Lie ECE344 University of Toronto 1 Tasks Major Task: Implement Swapping Minor Task Performance counters and tuning ECE344: Operating Systems 2 Implementing Swap Overview: In your coremap allocation function, you should currently
School: University Of Toronto
Course: Operating Systems
Lab 3.1: Overview David Lie ECE344 University of Toronto 1 Tasks Major Task: Implement as_copy() so you can support fork() Minor Task Implement sbrk() ECE344: Operating Systems 2 Implementing as_copy() As_copy() in dumbvm just does a keep copy of the
School: University Of Toronto
Course: Operating Systems
Lab 3.0: Overview David Lie ECE344 University of Toronto 1 Primer Look at kern/arch/mips/include/tlb.h: Description of the TLB interface 0xc000000 KSEG0 Understand memory layout of MIPS 0x8000000 Look at kern/arch/mips/include/vm.h KUSEG: user progra
School: University Of Toronto
Course: Operating Systems
Lab 2.1: Overview David Lie ECE344 University of Toronto 1 Function call flow sys_execv sys_fork thread_fork md_forkentry md_usermode mips_usermode ECE344: Operating Systems 2 Md_usermode vs md_forkentry Sets up processor for going back to userspace for a
School: University Of Toronto
Course: Operating Systems
Lab 2: Overview David Lie ECE344 University of Toronto 1 Overview Some notes: How to use splhigh/splx Explanation of system calls ECE344: Operating Systems 2 Splhigh/Splx These disable interrupts Think of this as a global lock for all threads. Everyt
School: University Of Toronto
Course: Operating Systems
Lab 1: Overview David Lie ECE344 University of Toronto 1 Overview Review 3 synchronization types: Locks Semaphores Conditional Variables What is deadlock? Overview of synch.h Tips on Debugging ECE344: Operating Systems 2
School: University Of Toronto
Course: Operating Systems
Lab 0: Overview David Lie ECE344 University of Toronto 1 Lab Goals Get familiar with OS161 Learn to build and install a kernel and test environment Get familiar with tools: Cscope: source code navigation Subversion: versioning and collaboration GDB:
School: University Of Toronto
University of Toronto, Department of Electrical and Computer Engineering ECE241F  Digital Systems  Lab 3 More Complex Logic Design: 7Segment Displays Fall 1999 1.0 Purpose The purpose of this lab is to build several more complex logic circuits and to g
School: University Of Toronto
ECE334S University of Toronto Lab 0 Lab 0 Introduction to Micromagic ECE334S Objective: The purpose of this lab is to get you familiar with the software we use in the labs. We will use the SUE design manager and MAX layout environment tools from Micromagi
School: University Of Toronto
ECE241  Digital Systems University of Toronto Lab #7  Fall 2008 Complex State Machines and Video Graphics Array (VGA) Display 1 Introduction The purpose of this laboratory is to further expand your understanding of nite state machines (FSMs) and to lear
School: University Of Toronto
Course: Circuit Analysis
Chapter 19 1. a. PT = 60 W + 45 W + 25 W = 130 W b. QT = 0 VARS, ST = PT = 130 VA c. 130 VA S = 0.542 A ST = EIs, Is = T = E 240 V d. 60 W = 204.2 (0.542 A ) 2 V = IsR = (0.542 A)(204.2 ) = 110.68 V V1 = V2 = E V = 240 V 110.68 V = 129.32 V 2 2 (129.32 V
School: University Of Toronto
Course: Circuit Analysis
Chapter 24 1. a. positivegoing d. f. g. 2. Vb = 2 V tp = 0.2 ms V1 V 2 100% V 8V + 7.5 V V= = 7.75 V 2 8 V 7.5 V % tilt = 100% = 6.5% 7.75 V 1 1 1 prf = = = 625 kHz T (2.0 ms 0.4 ms) 1.6 ms % tilt = tp T 100% 0.2 ms 100% = 12.5% 1.6 ms a. negativeg
School: University Of Toronto
Course: Circuit Analysis
Chapter 2 1. 2. a. F= k Q1Q2 (9 109 )(1 C)(2 C) = 18 109 N r2 (1 m) 2 b. F=k Q1Q2 (9 109 )(1 C)2 C = = 2 109 N r2 (3 m) 2 c. F= k Q1Q2 (9 109 )(1 C)(2 C) = 0.18 109 N 2 2 r (10 m) d. Exponentially, a. r = 1 mi: 3. r3 10 m F 18 109 N = 10 while 1 = 100 r
School: University Of Toronto
Course: Circuit Analysis
Chapter 4 1. V = IR = (5.6 mA)(220 ) = 1.23 V 2. I= V 24 V = 3.53 A R 6.8 3. R= V 24 V = 16 k = I 1.5 mA 4. I= V 12 V = 300 A R 40 103 5. V = IR = (3.6 A)(0.02 M) = 0.072 V = 72 mV 6. I= V 120 V = 2.4 mA R 50 k 7. R= V 120 V = 54.55 = I 2.2 A 8. I= V 1
School: University Of Toronto
Course: Circuit Analysis
Chapter 1 1. 2. 3. 4. = 5. 6. d 20,000 ft 1 mi 60 s 60 min = = 1363.64 mph t 10 s 5,280 ft 1 min 1 h 1h 4 min = 0.067 h 60 min d 31 mi = = 29.05 mph t 1.067 h 3 ft 100 yds 1 yd 1 mi 5,280 ft = 0.0568 mi 60 mi 1 h 1 min = 0.0167 mi/s h 60
School: University Of Toronto
Course: Circuit Analysis
Chapter 12 : CGS: 5 104 Maxwells, English: 5 104 lines B: CGS: 8 Gauss, English: 51.62 lines/in.2 1. 2. : SI 6 104 Wb, English 60,000 lines B: SI 0.465 T, CGS 4.65 103 Gauss, English 30,000 lines/in.2 3. a. B= 4 104 Wb = = 0.04 T A 0.01 m 2 4. a. R= 0.06
School: University Of Toronto
Course: Circuit Analysis
Chapter 14 1. 2. 3. a. (377)(10) cos 377t = 3770 cos 377t b. (200)(0.6) cos(754t + 20) = 120 cos(754t + 20) c. ( 2 20)(157) cos(157t 20) = 4440.63 cos(157t 20) d. (200)(1) cos(t + 180) = 200 cos(t + 180) = 200 cos t a. Im = Vm/R = 150 V/3 b. Im = Vm/R = 3
School: University Of Toronto
Course: Circuit Analysis
Chapter 5 1. a. b. c. d. e. f. E and R1 R1 and R2 E1, E2, and R1 E1 and R1; E2, R3 and R4 R3, R4 and R5; E and R1 R2 and R3 2. a. b. c. d. RT = 0.1 k + 0.39 k + 1.2 k + 6.8 k = 8.49 k RT = 1.2 + 2.7 + 8.2 = 12.1 RT = 8.2 k + 10 k + 9.1 k + 1.8 k + 2.7 k
School: University Of Toronto
Course: Circuit Analysis
Chapter 3 1. a. 0.5 in. = 500 mils b. 1000 mils 0.02 in. = 20 mils 1 in. c. 1 1000 mils in. = 0.25 in. = 250 mils 4 1 in. d. e. 39.37 in 1000 mils 10 mm = 10 103 m = 393.7 mils 1 m 1 in 3 12 in. 10 mils 0.01 ft = 120 mils 1 ft 1 in. f
School: University Of Toronto
Course: Circuit Analysis
Chapter 20 a. 1. s = s 250 rad/s = 39.79 Hz = 2 2 fs = b. s 1 1 = = 250 rad/s LC 1 H)(16 F) = 1 = 3496.50 rad/s (0.51 H)(0.16 F) s 3496.50 rad/s = 556.49 Hz = 2 2 fs = 1 = 22,173 rad/s (0.27 mH)(7.5 F) 22,173 rad/s = 3528.93 Hz fs = s = 2 2 c. XC = 30 V
School: University Of Toronto
Course: Circuit Analysis
Chapter 23 E = EL/ 3 = 208 V/1.732 = 120.1 V I = a. c. b. V = E = 120.1 V d. IL = I = 12.01 A E = EL/ 3 = 208 V/1.732 = 120.1 V b. V = E = 120.1 V Z = 12 j16 d. IL = I = 6 A b. V = 120.1 V I = 3. V 120.1 V = 12.01 A = 10 R 2. a. c. 1. = 20 53.13 V 120.1
School: University Of Toronto
Course: Circuit Analysis
Chapter 13 1. a. b. c. d. e. 10 V 15 ms: 10 V, 20 ms: 0 V 20 V 20 ms 2 cycles 2. a. b. c. d. e. 200 A 1 s: 200 A, 7 s: 200 A 400 A 4 s 2.5 cycles 3. a. b. c. d. e. 40 mV 1.5 ms: 40 mV, 5:1 ms: 40 mV 80 mV 2 ms 3.5 cycles 4. a. T= b. c. d. 5. a. b. c. d. 1
School: University Of Toronto
Course: Circuit Analysis
Chapter 16 (8 90)(12 0) = 3.69 j1.54 4 22.65 j8 12 ZT = j4 + Is = c. I1 = 3.5 A 22.65 d. I2 = e. VL = Is XL = (3.5 A 22.65)(4 90) = 14 V 112.65 a. ZT = 3 + j6 + 2 0 8 90 = 3 + j6 + 1.94 14.04 = 3 + j6 + 1.88 j0.47 = 4.88 + j5.53 = 7.38 48.57 b. Is = c.
School: University Of Toronto
Course: Circuit Analysis
Chapter 22 a. 2 (40 mH) 2 M = k L p Ls L s = M 2 = 50 mH (50 mH)(0.8) 2 L pk b. 1. ep = N p es = kNs c. ep = L p es = M 2. a. d p dt d p dt di p dt di p dt = (20)(0.08 Wb/s) = 1.6 V = (0.8)(80 t)(0.08 Wb/s) = 5.12 V = (40 mH)(0.3 103 A/s) = 12 V = (80 mH
School: University Of Toronto
Course: Circuit Analysis
Chapter 6 1. a. b. c. d. e. f. g. R2 and R3 E and R3 R2 and R3 R2 and R3 E, R1, R2, R3, and R4 E, R1, R2, and R3 E2, R2 and R3 2. a. b. R3 and R4, R5 and R6 E and R1, R6 and R7 3. a. RT = b. RT = c. RT = d. e. 1 1 3 1 1 1 1 10 S 0.5 103 S 33.33 106 S 1 k
School: University Of Toronto
Course: Algorithms And Data Structures
Selected Solutions for Chapter 2: Getting Started Solution to Exercise 2.22 S EL ECTION S ORT.A/ n D A: length for j D 1 to n 1 smallest D j for i D j C 1 to n if Ai < Asmallest smallest D i exchange Aj with Asmallest The algorithm maintains the loop in
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2007 1 Drawing Trees Drawing Trees ECE 345 Algorithms and Data Structures Fall Semester, 2007 1 1.1 How to draw a tree Dening the problem The rst algorithm we examine is one to determine a clean way to draw a tree. For instance, we
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2009 U of Toronto 1 Theory of Computation Theory of Computation ECE 345 Algorithms and Data Structures Fall Semester, 2009 U of Toronto Computations are designed for processing information. They can be as simple as an estimation for
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2009 U of Toronto 1 Self Adjusting Binary Search Trees Self Adjusting Binary Search Trees ECE 345 Algorithms and Data Structures Fall Semester, 2009 U of Toronto 1 The weighted dictionary problem In the weighted dictionary problem [
School: University Of Toronto
Course: Algorithms And Data Structures
CS 345Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 345 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has been a signicant research activity in ecient parallel al
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2009 U of Toronto 1 Greedy Algorithms Greedy Algorithms ECE 345 Algorithms and Data Structures Fall Semester, 2009 U of Toronto 1 Scheduling with Deadlines We have a set of n jobs to execute, each of which takes unit time. At any ti
School: University Of Toronto
Course: Algorithms And Data Structures
Hash Tables We are interested in a data structure that given a collection of n keys it implements the dictionary operations Insert(), Delete() and Search() efficiently AVL trees can do that in O(log n) time and they are space efficient. Arrays can do th
School: University Of Toronto
Course: Algorithms And Data Structures
Optimal Polygon Triangulation (dynamic programming) A polygon: a sequence of straightline segments that close at the end. e.g. v5 v0 v4 v1 v3 v2 A polygon is simple if all segments do not cross. e.g. A simple polygon is convex if the line segments that c
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
University of Toronto Department of Electrical and Computer Engineering Instrumentation Laboratory GB341 Laboratory Equipment Instruction Manual 2011 Page 1. 2. 3. 4. 5. 6. 7. 8. Wires and Cables Protoboard DC Power Supply 3.1 GWInstek Laboratory Model G
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
ECE110H1S  Electrical Fundamentals  Assignments Assignment WileyPlus (online) / endofchapter Problems 1 Halliday: ch 21  1,5,7,9,13,19,23,25,27,29,39 Halliday: ch 22  2,5,9,11,15,41,43,77 2 Halliday: ch 23  1,3,5,7,9,15,17,21,25,29,33,35,41 Hallid
School: University Of Toronto
Course: Fundamentals Of Electrical Circuits
University of Toronto Edward S. Rogers Sr. Dept. of Electrical & Computer Engineering ECE 110H1 S Electrical Fundamentals 2013 COURSE INFORMATION 1. COURSE DESCRIPTION A study of the physics of electricity and magnetism: Coulombs law, Gauss laws, BiotSav
School: University Of Toronto
Course: Computer Security
ECE 568 Computer Security Winter 2012 Course Syllabus General Information Welcome to ECE 568! This course covers principles of computer systems security. It starts by examining how to identfy security vulnerabilites, how they can be exploited, and then di
School: University Of Toronto
Course: Internetworking
ECE 461 Internetworking Instructor: Prof. Jrg Liebeherr University of Toronto Websites The course website is http:/www.comm.utoronto.ca/~jorg/teaching/ece461 Lecture slides, lab information, problem sets for tutorials Blackboard: Used for announcements
School: University Of Toronto
Course: Algorithms And Data Structures
UofTorontoECE 345Fall, 2014 1 Course Information Course Information ECE 345 Algorithms and Data Structures University of Toronto Dept. of Electrical and Computer Engineering Fall Semester, 2014 Welcome to ECE345! Algorithms today play an important role i
School: University Of Toronto
Course: Intro To Electronics
ECE335F Electronic Devices Fall 2013 ECE335F Introduction to Electronic Devices LEC 01 ECE335H1F Prof. Wai Tung Ng PT484A, ngwt@vrg.utoronto.ca LEC 01 Tue 10:00 11:00 GB303 ECE335H1F Wed 10:00 11:00 GB303 ECE335H1F Thu 10:00 11:00 GB303 ECE335H1F TUT 01 W
School: University Of Toronto
Lecture Week ECE231&Course&Syllabus&and&Detailed&Course&Schedule& Jan& 1 8~11 1 2 3 Jan& 4 14~18 5 6 Jan& 7 21~25 8 9 Jan28&O& 10 Feb1 Section Description Course&outline Learning2objectives:2From2this2section,2students2will2be2able2to2 Reading Homework Pr
School: University Of Toronto
# UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING Department of Electrical and Computer Engineering ECE 231S Introductory Electronics Course Outline This course is an introduction to electronic circuits using operational amplifiers, diode
School: University Of Toronto
2013/ ECE216H1S SIGNALS AND SYSTEMS Course Description: Introduction to the general mathematical modeling of signals and systems, useful in many areas of engineering including communications, control, biomedical processing and power engineering, to name a
School: University Of Toronto
Lecture Week ECE231&Course&Syllabus&and&Detailed&Course&Schedule& Jan& 1 8~11 1 2 3 Jan& 4 14~18 5 6 Jan& 7 21~25 8 9 Jan28&O& 10 Feb1 Section Description Course&outline Learning2objectives:2From2this2section,2students2will2be2able2to2 Reading Homework Pr
School: University Of Toronto
Course: Digital Communication
SYLLABUS  PROJECT MANAGEMENT aps1001hf September to December 2011 Instructors: Keith Farndale (Farndale@procept.com) Class size: Cap of 50 for each of the two sections Prerequisite: None, but those with some engineering work experience will get it much b