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: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
22. rmhhmuKR4ﬂ./7 i Chapter 1 Introduction: Some Representative Problems Proof. Our general deﬁnition of instability has four parts: This means that we have to make sure that none of the four bad things happens. First, suppose there is an instability of
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 5 Divide and Conquer In the last chapter we studied greedy algorithms for solving certain problems. We will now study another commonly studied class of algorithms that are based on the principle of divide and conquer. 5.1 Mergesort To motivate the
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 4 Greedy Algorithms We will now study a commonly used class of algorithms, known as greedy algorithms. Loosely speaking, a greedy algorithm nds a solution to an optimization problem by iteratively making decisions that myopically optimize some met
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 3 Graphs Many problems that we run into can be cast in the language of graphs. We will thus discuss some necessary concepts pertaining to graphs, as well as some algorithms to infer certain basic properties of graphs. 3.1 Denitions A graph G is a
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 5 Divide and Conquer In the last chapter we studied greedy algorithms for solving certain problems. We will now study another commonly studied class of algorithms that are based on the principle of divide and conquer. 5.1 Mergesort To motivate the
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 4 Greedy Algorithms We will now study a commonly used class of algorithms, known as greedy algorithms. Loosely speaking, a greedy algorithm nds a solution to an optimization problem by iteratively making decisions that myopically optimize some met
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 3 Graphs Many problems that we run into can be cast in the language of graphs. We will thus discuss some necessary concepts pertaining to graphs, as well as some algorithms to infer certain basic properties of graphs. 3.1 Denitions A graph G is a
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 2 Measuring E ciency of Algorithms We will now discuss some standard ways to quantify the e ciency of algorithms. We will start by focusing on runtime (i.e., how long it takes the algorithm to nd the answer); later, we will consider how much memo
School: Amirkabir University Of Technology
Course: Algorithm Design
Algorithms: Analysis and Design Mark Crowley Department of Electrical and Computer Engineering University of Waterloo ii c Mark Crowley Acknowledgments These notes are for the graduate course on Algorithms oered at the University of Waterloo. They closely
School: Amirkabir University Of Technology
Course: Audit
ACC 660 Test #2 Prof. Franciosa October 25, 2013 Name: _ _ _ 1. Which of the following factors most likely would lead a CPA to conclude that a potential audit engagement should not be accepted? A. There are significant related party transactions that mana
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
22. rmhhmuKR4ﬂ./7 i Chapter 1 Introduction: Some Representative Problems Proof. Our general deﬁnition of instability has four parts: This means that we have to make sure that none of the four bad things happens. First, suppose there is an instability of
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Assignment 1 Due Date: November 9, 2015 in class Answer the following questions showing all of your work and explaining your reasoning. The writeup can be written by hand or using a word processor or LaTeX. Whatever approach you use please be as
School: Amirkabir University Of Technology
Course: Advance Mathematic
Yn ( D)e = i s 2 v v ) (. : . ) V(s
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw08.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMR8 CMMI8 CMSY8 %+ CMSY10 CMR6 %DocumentPaperSizes: a4 %E
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
22. rmhhmuKR4ﬂ./7 i Chapter 1 Introduction: Some Representative Problems Proof. Our general deﬁnition of instability has four parts: This means that we have to make sure that none of the four bad things happens. First, suppose there is an instability of
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 5 Divide and Conquer In the last chapter we studied greedy algorithms for solving certain problems. We will now study another commonly studied class of algorithms that are based on the principle of divide and conquer. 5.1 Mergesort To motivate the
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 4 Greedy Algorithms We will now study a commonly used class of algorithms, known as greedy algorithms. Loosely speaking, a greedy algorithm nds a solution to an optimization problem by iteratively making decisions that myopically optimize some met
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 3 Graphs Many problems that we run into can be cast in the language of graphs. We will thus discuss some necessary concepts pertaining to graphs, as well as some algorithms to infer certain basic properties of graphs. 3.1 Denitions A graph G is a
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 2 Measuring E ciency of Algorithms We will now discuss some standard ways to quantify the e ciency of algorithms. We will start by focusing on runtime (i.e., how long it takes the algorithm to nd the answer); later, we will consider how much memo
School: Amirkabir University Of Technology
Course: Algorithm Design
Algorithms: Analysis and Design Mark Crowley Department of Electrical and Computer Engineering University of Waterloo ii c Mark Crowley Acknowledgments These notes are for the graduate course on Algorithms oered at the University of Waterloo. They closely
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Assignment 1 Due Date: November 9, 2015 in class Answer the following questions showing all of your work and explaining your reasoning. The writeup can be written by hand or using a word processor or LaTeX. Whatever approach you use please be as
School: Amirkabir University Of Technology
Course: Audit
ACC 660 Test #2 Prof. Franciosa October 25, 2013 Name: _ _ _ 1. Which of the following factors most likely would lead a CPA to conclude that a potential audit engagement should not be accepted? A. There are significant related party transactions that mana
School: Amirkabir University Of Technology
Course: Microcontroller Devices
LM217M LM317M MEDIUM CURRENT 1.2 TO 37V ADJUSTABLE VOLTAGE REGULATOR s s s s s s s s OUTPUT VOLTAGE RANGE: 1.2 TO 37V OUTPUT CURRENT IN EXCESS OF 500 mA LINE REGULATION TYP. 0.01% LOAD REGULATION TYP. 0.1% THERMAL OVERLOAD PROTECTION SHORT CIRCUIT PROTECT
School: Amirkabir University Of Technology
Course: Microcontroller Devices
LM35 Precision Centigrade Temperature Sensors General Description The LM35 series are precision integratedcircuit temperature sensors, whose output voltage is linearly proportional to the Celsius (Centigrade) temperature. The LM35 thus has an advantage o
School: Amirkabir University Of Technology
Course: Microcontroller Devices
L7800 SERIES POSITIVE VOLTAGE REGULATORS s s s s s OUTPUT CURRENT TO 1.5A OUTPUT VOLTAGES OF 5; 5.2; 6; 8; 8.5; 9; 12; 15; 18; 24V THERMAL OVERLOAD PROTECTION SHORT CIRCUIT PROTECTION OUTPUT TRANSITION SOA PROTECTION DESCRIPTION The L7800 series of three
School: Amirkabir University Of Technology
Course: Microcontroller Devices
The product information in this catalog is for reference only. Please request the Engineering Drawing for the most current and accurate design information. All nonRoHS products have been discontinued, or will be discontinued soon. Please check the produc
School: Amirkabir University Of Technology
Course: Microcontroller Devices
BenQ M23 GSM MODEM Technical Manual Rev. 1r0 eGizmo GSM Modem is a data oriented GSM transceiver system that uses a network provider to connect and transfer data. Using a network provider infrastructure has several advantages. Among them is a low initial
School: Amirkabir University Of Technology
Course: Microcontroller Devices
AVR323: Interfacing GSM modems Features Interface to GSM modems. Implementation of ATCommand set. PDU string compression and decompression. SMS transmission, how to send and receive. 8bit Microcontrollers Application Note 1 Introduction The GSM net used
School: Amirkabir University Of Technology
Course: Microcontroller Devices
ESDA6V15W6 TRANSIL ARRAY FOR ESD PROTECTION Application Specific Discretes A.S.D. APPLICATIONS Where transient overvoltage protection in ESD sensitive equipment is required, such as : n Computers n Printers n Communication systems n Cellular phone handse
School: Amirkabir University Of Technology
Course: Microcontroller Devices
ENC28J60 Data Sheet StandAlone Ethernet Controller with SPI Interface 2006 Microchip Technology Inc. Preliminary DS39662B Note the following details of the code protection feature on Microchip devices: Microchip products meet the specification contained
School: Amirkabir University Of Technology
Course: Microcontroller Devices
dsPIC30F3014, dsPIC30F4013 Data Sheet HighPerformance Digital Signal Controllers 2004 Microchip Technology Inc. Advance Information DS70138C Note the following details of the code protection feature on Microchip devices: Microchip products meet the spec
School: Amirkabir University Of Technology
Course: Microcontroller Devices
dsPIC30F3014/4013 dsPIC30F3014/4013 Data Sheet Errata Clarifications/Corrections to the Data Sheet: 1. Module: DC Temperature and Voltage Specifications RAM Data Retention Voltage (Parameter DC12) in the DC Temperature and Voltage Specifications (Table 23
School: Amirkabir University Of Technology
Course: Microcontroller Devices
CRS04 TOSHIBA Schottky Barrier Rectifier Schottky Barrier Type CRS04 Switching Mode Power Supply Applications Portable Equipment Battery Applications Unit: mm Forward voltage: VFM = 0.49 V (max) Average forward current: IF (AV) = 1.0 A Repetitive peak rev
School: Amirkabir University Of Technology
Course: Microcontroller Devices
C628 Enhanced JPEG Module The C628 Enhanced JPEG Module is a small, lightweight and low power consumption devices including most of the features of a Digital Still Camera (DSC) such as snapshot, video capture, datetime stamp, file management and others.
School: Amirkabir University Of Technology
Course: Microcontroller Devices
C628 Enhanced JPEG Module User Manual v1.1 Release Note: 1. May 2, 2006 official released v1.0 2. Dec 27, 2006 revise electrical characteristics Rm 802, Nan Fung Ctr, Castle Peak Rd, Tsuen Wan NT, Hong Kong Tel: (852) 2498 6248 Fax (852) 2414 3050 Email:
School: Amirkabir University Of Technology
Course: Microcontroller Devices
C3287221 Mono Camera Module with UART Interface User Manual Release Note: 1. 16 Mar, 2009 official released v1.0 Rm 802, Nan Fung Ctr, Castle Peak Rd, Tsuen Wan NT, Hong Kong Tel: (852) 2498 6248 Fax (852) 2414 3050 Email: sales@comedia.com.hk http:/www.
School: Amirkabir University Of Technology
Course: Microcontroller Devices
BC846/847/848/849/850 BC846/847/848/849/850 Switching and Amplifier Applications 3 Suitable for automatic insertion in thick and thinfilm circuits Low Noise: BC849, BC850 Complement to BC856 . BC860 2 1 SOT23 1. Base 2. Emitter 3. Collector NPN Epita
School: Amirkabir University Of Technology
Course: Microcontroller Devices
Features Highperformance, Lowpower AVR 8bit Microcontroller Advanced RISC Architecture 133 Powerful Instructions Most Single Clock Cycle Execution 32 x 8 General Purpose Working Registers + Peripheral Control Registers Fully Static Operation Up t
School: Amirkabir University Of Technology
Course: Microcontroller Devices
Features Highperformance, Lowpower Atmel AVR 8bit Microcontroller Advanced RISC Architecture 130 Powerful Instructions Most Single Clock Cycle Execution 32 x 8 General Purpose Working Registers + Peripheral Control Registers Fully Static Operation
School: Amirkabir University Of Technology
Course: Microcontroller Devices
Features Highperformance, Lowpower AVR 8bit Microcontroller Advanced RISC Architecture 131 Powerful Instructions Most Singleclock Cycle Execution 32 x 8 General Purpose Working Registers Fully Static Operation Up to 16 MIPS Throughput at 16 MHz
School: Amirkabir University Of Technology
Course: Microcontroller Devices
Features Highperformance, Lowpower AVR 8bit Microcontroller Advanced RISC Architecture 131 Powerful Instructions Most Singleclock Cycle Execution 32 x 8 General Purpose Working Registers Fully Static Operation Up to 16 MIPS Throughput at 16 MHz
School: Amirkabir University Of Technology
Course: Microcontroller Devices
AT90USBKey . Hardware User Guide Section 1 Introduction . 13 1.1 1.2 Overview .13 AT90USBKey Features.14 Section 2 Using the AT90USBKey . 25 2.1 2.2 2.3 2.4 2.5 2.6 Overview .25 Power Supply .26 Reset.28 Onboard Resources.
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 5 Divide and Conquer In the last chapter we studied greedy algorithms for solving certain problems. We will now study another commonly studied class of algorithms that are based on the principle of divide and conquer. 5.1 Mergesort To motivate the
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 4 Greedy Algorithms We will now study a commonly used class of algorithms, known as greedy algorithms. Loosely speaking, a greedy algorithm nds a solution to an optimization problem by iteratively making decisions that myopically optimize some met
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 3 Graphs Many problems that we run into can be cast in the language of graphs. We will thus discuss some necessary concepts pertaining to graphs, as well as some algorithms to infer certain basic properties of graphs. 3.1 Denitions A graph G is a
School: Amirkabir University Of Technology
Course: Algorithm Design
Chapter 2 Measuring E ciency of Algorithms We will now discuss some standard ways to quantify the e ciency of algorithms. We will start by focusing on runtime (i.e., how long it takes the algorithm to nd the answer); later, we will consider how much memo
School: Amirkabir University Of Technology
Course: Algorithm Design
Algorithms: Analysis and Design Mark Crowley Department of Electrical and Computer Engineering University of Waterloo ii c Mark Crowley Acknowledgments These notes are for the graduate course on Algorithms oered at the University of Waterloo. They closely
School: Amirkabir University Of Technology
Course: Audit
ACC 660 Test #2 Prof. Franciosa October 25, 2013 Name: _ _ _ 1. Which of the following factors most likely would lead a CPA to conclude that a potential audit engagement should not be accepted? A. There are significant related party transactions that mana
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Practice Homework 4 Answer the following questions : 1. Considering the graph in gure 1: (a) Considering the graph as undirected, list the sets of nodes in each connected component. (b) Considering the graph as directed, list the sets of nodes i
School: Amirkabir University Of Technology
Course: Algorithm Design
22. rmhhmuKR4ﬂ./7 i Chapter 1 Introduction: Some Representative Problems Proof. Our general deﬁnition of instability has four parts: This means that we have to make sure that none of the four bad things happens. First, suppose there is an instability of
School: Amirkabir University Of Technology
Course: Algorithm Design
ECE 606 : Assignment 1 Due Date: November 9, 2015 in class Answer the following questions showing all of your work and explaining your reasoning. The writeup can be written by hand or using a word processor or LaTeX. Whatever approach you use please be as
School: Amirkabir University Of Technology
Course: Advance Mathematic
Yn ( D)e = i s 2 v v ) (. : . ) V(s
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw08.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMR8 CMMI8 CMSY8 %+ CMSY10 CMR6 %DocumentPaperSizes: a4 %E
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 8 Due: Azar 12 Problem 1. In this problem, well use generating functions to solve the recurrence: t0 = 0, t1 = 1, tn = 5tn1 6tn2 (a) Find a closedform generating function F (x) for the sequence (
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.95a Copyright 2005 Radical Eye Software %Title: hw07.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMSY10 CMR8 CMMI8 %DocumentPaperSizes: a4 %EndComments %DV
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 7 Due: Azar 6 Problem 1. How many nwords from the alphabet cfw_0, 1, 2 are such that neighbors dier at most by 1? Problem 2. Of 3n + 1 objects, n are indistinguishable, and the remaining ones are
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw06.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMSY10 CMR8 %DocumentPaperSizes: a4 %EndComments %DVIPSWeb
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 6 Due: Aban 29 Problem 1. Inside a room of area 5, you place 9 rugs, each of area 1 and an arbitrary shape. Prove that there are two rugs which overlap by at least 1 . 9 Problem 2. Twenty pairwise
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.95a Copyright 2005 Radical Eye Software %Title: hw05.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMSY10 CMR8 CMMI8 %DocumentPaperSizes: a4 %EndComments %DV
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 5 Due: Aban 22 Problem 1. For every positive integer p, we consider the equation 1 11 +=. xy p We are looking for its solutions (x, y ) in positive integers, with (x, y ) and (y, x) being consider
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.95a Copyright 2005 Radical Eye Software %Title: hw04.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMR8 CMMI8 CMSY8 %+ CMSY10 %DocumentPaperSizes: a4 %EndCom
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 4 Due: Aban 15 Problem 1. Let p be an odd prime number, let a be any integer, and let b = a(p1)/2 . Show that b mod p is either 0 or 1 or p 1. (Hint: Consider (b + 1)(b 1).) Problem 2. If n, m are
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw03.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMSY10 CMR8 CMMI8 %DocumentPaperSizes: a4 %EndComments %DV
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 3 Due: Aban 8 Problem 1. Prove or disprove: The symmetric dierence of sets S and T is the set of elements that are in exactly in one of S and T . Two expressions for symmetric dierence are (S T )
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw02.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMSY10 CMR8 CMMI8 %+ CMSY8 %DocumentPaperSizes: a4 %EndCom
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 2 Due: Aban 1 Problem 1. Suppose S (n) is a predicate on natural numbers, n, and suppose k N S (k ) S (k + 2). Indicate whether each of the following statements are true or false. (a) n m > n [S (
School: Amirkabir University Of Technology
Course: Advance Mathematic
%!PSAdobe2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw01.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMTI12 CMR12 CMR17 CMBX12 CMMI12 CMR8 CMSY10 CMMI8 %DocumentPaperSizes: a4 %EndComments %DV
School: Amirkabir University Of Technology
Course: Advance Mathematic
In the Name of God Fall 2005 Discrete Mathematics Homework 1 Due: Mehr 24 Problem 1. Consider the following sequence of predicates: Q1 (x1 ) = x1 Q2 (x1 , x2 ) = x1 x2 Q3 (x1 , x2 , x3 ) = (x1 x2 ) x3 Q4 (x1 , x2 , x3 , x4 ) = (x1 x2 ) x3 ) x4 Q5 (x1 , x2
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 7 Fall Semester 1384 Problem 1 In free space, the region 0 < a r b of the spherical coordinate system is filled by a homogeneous linear isotropic dielectric of su
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 6 Fall Semester 1384 Problem 1 a) Explain why the magnetic susceptibility of a diamagnetic material is negative. b) Explain why the magnetic susceptibility of dia
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 5 Fall Semester 1384 Problem 1 Use the uniqueness theorem to prove that the electric field inside an infinitely thin, uniformly charged spherical shell is zero. A
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 4 Fall Semester 1384 Problem 1 r r r v a) Consider the product of a scalar field (r ) by a constant vector a , and obtain 2 (a ) . rr b) Assume that C (r ) is a d
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 3 Fall Semester 1384 Problem 1 The corners of a rectangular current loop are located at the points (a1 , b1 ,0) , ( a 2 , b1 ,0) , ( a 2 ,b2 ,0) , and (a1 ,b2 ,0)
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 2 Fall Semester 1384 Due 84/8/2 Problem 1 rr rr Consider a known irrotational vector field F (r ) . Using F (r ) , we define the scalar field ( x, y, z ) as: ( x,
School: Amirkabir University Of Technology
Course: Advance Mathematic
Electromagnetics School of Electrical and Computer Engineering University of Tehran Homework 1 Fall Semester 1384 Due 84/7/16 Problem 1 The scalar field ( x, y ) = sin( 2x) exp(2y ) is defined in the region 0 x 1 and y 0 . r r r a) Evaluate F = , and show
School: Amirkabir University Of Technology
Course: Advance Mathematic
1 1 g . g . : i L = 2 , q = V C 2V C , i R = 2V R 3 3 3 L L C 2
School: Amirkabir University Of Technology
Course: Advance Mathematic
3v x 1R 3v x 2R 1 2i x vx 1 + 1 is = 5 A vx v + i : . ) ( is . 2 vx