Electrical Engineering Answers

Questions: 2 117

Answers by our Experts: 1 750

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

The switch in the circuit shown in Figure 2 has been closed for a long time. It opens at 

t = 0. Analyze it and find i(t) for t > 0.  



The switch in the circuit shown in Figure 2 has been closed for a long time. It opens at 

t = 0. Analyze it and find i(t) for t > 0.  




The objective is to analyze the Resistance-Inductance (RL) circuit in Figure 1, where 

the circuit switch is closed at time t < 0 s and then opened at time t = 0 s. Based on the 

knowledge of circuit laws and techniques, analyze the circuit and determine i, i

o

 and v

o

 

for all t.  





Derive and explain gauss’ law


find the orthogonal trajectories of the ellipses 4x^2 + y^2 = cx


Solve by using gaussian elimination


x+2y-3z=-1


-3x+y-2z=-7


5x+3y-4z=2


Explain the Comparison of 3 mapping techniques between main memory to cache memory in the tabular form. show how and from where CPU will access the word from the cache memory in each mapping technique with the help of diagram. Take the word number as per your roll no. for example if your roll no is 35 than you have to show how and from where CPU will access W35 from the cache memory in case of each mapping technique with the help of diagram. Assume the main memory size as 16 KB, line size 128 bytes, cache size 1K bytes and k value is 4 .

A virtual memory has a page size of 2K(words). There are eight pages


and four blocks. The associative memory page table contains the following


entries:


Page Block


0 3


2 1


5 2


6 0


Make a list of all virtual addresses (In decimal) that will cause a page


fault if used by the CPU.


Explain set (with 2-set) associative mapping cache. Consider a 4-way set


associative mapped cache of size 64 KB with block size 512 bytes. The size


of main memory is 256 KB. Find a) Number of bits in tag


b) Tag directory size


 Consider page reference string of 1 2 3 0 5 0 1 2 1 4 5 0 7 1 2 Using the first in first out (FIFO) page replacement algorithm, draw THREE (3) page frames (3 pages can be in memory at a time during process) for the above-mentioned page reference string. b Calculate the hit rate and fault rate for your answer. 


LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS