Explain sr latch with nand gate, Computer Engineering

Assignment Help:

Explain SR Latch with NAND Gate?

SR Latch has two useful states:

  • Set state, when output Q=1 and Q'=0.
  • Reset state, when output Q=0 and Q'=1.Output Qand Q' are normally complement of each other.

1999_SR Latch with NAND Gate 1.png

  • Undefined state, when Q=1 and Q'=1, occurred when both inputs R and S are equal to 0 at the same time.
  • Under normal conditions, both inputs of the latch (Rand S) remain at 1 unless the state has to be changed.
  • To let latch in the set state, Smust be 0
  • To let latch in the reset state, Rmust be 0
  • The inputs Sand Rmust go back to 1 before any other changes to avoid the occurrence of the undefined state (when Q=1 and Q'=1)
  • The latch go to the set state or reset state and stay there even after both inputs return to 1.

1133_SR Latch with NAND Gate 2.png


Related Discussions:- Explain sr latch with nand gate

C++, program to find area under the curve y=f(x) between x=a and y=b , inte...

program to find area under the curve y=f(x) between x=a and y=b , integrate y=f(x)between limits of a and b

Explain why the ROM is a volatile memory, Is the ROM a volatile memory? Exp...

Is the ROM a volatile memory? Explain Ans. No, ROM is a Non-Volatile memory. Programming of ROM includes making of the needed  interconnections at  the time of fabrication and

Can math operations be performed on a void pointer, Can math operations be ...

Can math operations be performed on a void pointer? No. Pointer addition and subtraction are based on advancing the pointer by a number of elements. By explanation, if you have

Two "next screen "attributes, Of the two "next screen "attributes the attri...

Of the two "next screen "attributes the attributes that has more priority is?? Dynamic.

Construct the finite automata, Give the regular expression of the set of al...

Give the regular expression of the set of all even strings over the alphabet {a, b} along with at least one of the two substrings aa or bb. As well construct the finite automata wh

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Compiling and running the pvm program, Now we will learn how to compile and...

Now we will learn how to compile and run PVM programs. To compile the program change to directory pvm/lib/archname where archname is architecture name of your computer. Then the su

When will the current screen processing terminates, When will the current s...

When will the current screen processing terminates? A current screen processing terminates when control reaches either a Leave-screen or the end of PAI.

Explain the working of linker, Explain the Working of Linker? Linker a...

Explain the Working of Linker? Linker as well called as link editor and binder. A linker is the program that combines object modules to form an executable program. Several pro

Structure of internet servers address, Structure of Internet Servers Addres...

Structure of Internet Servers Address Structure of an Internet server's address keyed into a client's software is as below: http://www.expertsmind.com Where: htt

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd