Circuit analysis-II Problem Statement: PART (A)

Quiz 1

Abs # 5

A well-reputed R&D organization wants to design a receiver. They have given this project to IUIC 3rd semester students and they have to design either by series or parallel resonance method. Their specifications are as below: Receiver has a Resonance frequency of 30 kHz Bandwidth of 10kHz Capacitor C =1uF

Make suitable assumptions where required You have to provide the mathematical steps required for that on blank page and simulate and draw the resonance curve on Multisim provided in lab.

PART (B) Now assume that signal is received to the same receiver having some synchronizing issues that is having frequency 10 kHz 5Vp resulting some offset signal. Design a buffer after that receiver that corrects the offset.

Note: Mathematical calculations + simulation required.

In real life the importance of data structure is much more bcoz it providing a disconnected transaction between database & workstation just take a example that when some one going to on line shopping at that time at first he/she wants to select the items to purchase simultaneously if the person donot want some selected items then he/she can also retrieve from the list,these all are done in data structure when you at last enter the submit button at that time this will retrieve from the database & enters in to sales list. Means these all transaction are done in data structure there is no need to transect with data base by that transaction will be faster,secure,good performance,efficient

Read more: http://wiki.answers.com/Q/What_are_real_life_applications_of_data_structures#ixzz2BSu0Yc4V

For me, the use of stacks is often a "you know it, when you see it," situation. But when I don't need it, I have trouble thinking of very many real-world software uses. I can think of a couple uses though. 1) In some situations, you might use a stack to hold information for undo/redo features in an applications. 2) The computer's call stack is also and important use of a stack. When you run a program, a stack holds information on the functions/procedures and the local variables in that function. When a function is called, a new data structure is added to the stack. The structure contains items such as new local variables for that function and the "return address" the program should go to after that function is complete. (On a higher level, you can think of the return address as telling the program what line of code it should go back to when a function is complete.) Each time a function is called, a new item is pushed on to the stack. When that subroutine/function or nested block of data is complete, that item is popped off the stack and the program returns to its previous location in the code using the return address. The stack allows local variables to be kept separate.... this is why recursive functions can have their own variables with each call. Here is a wiki link for more about call stacks...http://en.wikipedia.org/wiki/Call_stack 3) Occasionally I have had to process data in a way that I had to start with the last time first. If you are dealing with an unknown amount of data, you may have to simply save the data you are receiving/reading until you reach the end... You save the data by pushing it on to a stack and then process the data data by popping it off until the stack is empty. Depending on the specific situation, this may or may not be a very efficient way of doing things, but it can be used.