This is a band pass filter In band stop filter C2 is connected in between R1 and C1 (Requires inverting input) Low pass filter High Pass filter (LPF and HPF requires differential input) differentiation and integrator ADDER Subtractor (for integrator, differentiator,adder,subtractor requires inverting input) Diode logic Resistor transistor logic: dissipates more power 1}DCTL(direct coupled transistor logic):it is used for to save space 2}Resistor capacitor transistor logic:input resistor are parallel with capacitors Emitter coupled Logic: it uses NPN transistor in differential amplifier range of input voltages are used so BJT will not goes into saturation region it is due to very high switching speed also called common mode logic or current switch emmiter follower CMOS: it utilize power during transition in logic so it uses very less power Power Scale::P=@cv^2.....@ is activity factor CMOS have speed limitation due to in...
Data structures through C lang. Data structure is a way to store and organize the data in computer so that it can used efficientaly data structure have two type 1) abstract data type(ADT)(mathematical and logical data type) 2) implementation data type list abstract data type is not memory efficient in terms of inserting and removing the data from an array here time require is (T dirc.n) where n is the number element in an array that is if we are using just array for storing the data then at the time of inserting the new data into an array then array will shift a whole bytes from array in Linked list node are available node=int value + add. of next node Θ ---------------------------------------------------------------------------- # Algorithms & Data Structures: Q. What is data structure? - it is a way to store data into the memory(main memory) in an oraganized manner so that we can perform operations on it efficiently. ...
RTOS NOTES Hard realtime OS has less jitter and Soft real time jitter has High jitter jitter : it is the time between two interrupt Event driven systems switch between tasks based on their priorities while time sharing systems switch the task based on clock interrupts. Most RTOS’s use a pre-emptive scheduling algorithm. The most common designs are Event-driven – switches tasks only when an event of higher priority needs servicing; called preemptive priority , or priority scheduling. Time-sharing – switches tasks on a regular clocked interrupt, and on events; called round robin . A task has three stages 1. Runing 2.Ready 3.Blocked(Waiting for an event,I/O for example) On simpler non-preemptive but still multitasking systems, a task has to give up its time on the CPU to other tasks, which can cause the ready queue to have a greater number of overall tasks in the ready to be executed state ( resource starvation ). laxity = Absolute deadline...
Comments
Post a Comment