Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Illustrate working of Synchronous Counters?
The main drawback of ripple counter is delay in changing the value. How? To understand this let's take a case when state of ripple counter is 0111. Now subsequent state will be 1000 that means change in state of all flip-flops. However will it take place concurrently in ripple counter? No first O0 will change then O1, O2 and finally O3. Delay is proportional to length of the counter. Thus to avoid this drawback of ripple counters we use synchronous counters in which all flip-flops change their states simultaneously. Figure below shows 3-bit synchronous counter.
Figure: Logic diagram of 3-bit synchronous counter
You can understand the working of this counter by analyzing sequence of states (O0, O1, O2) given in Figure below.
Figure: Truth table for 3 bit synchronous counter
The operation can be briefed as: -
i) First flip-flop is complemented in each clock cycle.
ii) Second flip-flop is complemented on occurrence of a clock cycle if current state of first flip-flop is 1.
iii) Third flip-flop is fed by an AND gate which is connected with output of first and second flip-flops. It will be complemented only when first and second flip-flops are in Set State.
Input a list of positive numbers, terminated by 0, into an array Numbers. Then display the array and the largest and smallest number in it.
The method for updating the main memory as soon as a word is removed from the Cache is known as (A) Write-through (B) write-back (C) protected write
Write a function "plot2fnhand" that will receive 2 function handles as input arguments, and will show in two Figure Windows plots of these functions, with the function names in the
Q. Determine what part of global array to work on thread number? #include void subdomain(float x[ ], int istart, int ipoints) { int i; for (i = 0; i x[istart+
What is called PCP? The phenomenon of un-decidability is not confined to problems concerning automata. An un-decidable problem concerning on simple manipulation of strings is k
What is the advantage of buffering? Is buffering always effective? Justify your answer with help of an example. I/O buffer: One type of input-output requirement arises from d
Ask question bhjjnjnnjnjm#Minimum 100 words accepted#
Data can be changed from special code to temporal code by using ? Ans. By using Shift Registers data can be changed from special code to temporal code. A Register wherein data ge
Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes
ALE-> Address latch enable...In the case of microcontroller (8051)& microprocessor 8085 the data line and low order 8 bit address lines are multiplexed. In order to getting address
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd