What is the difference between = = = and = =, Computer Engineering

Assignment Help:

What is the difference between = = = and = = ?

output of "==" can be 1, 0 or X.

output of "===" can only be 0 or 1.

When you are comparing 2 nos using "==" and if one/both numbers have one or more bits as "x" then output would be "X" . However if use "===" output would be 0 or 1.

e.g A = 3'b1x0

B = 3'b10x

A = = B would give X as output.

A = = = B would give 0 as output.

"= ="  is  used  for  comparison  of  only  1's  and  0's  .It  can't  compare  Xs.  If  any  bit  of  input  is  X output would be X

"= = =" is used for comparison of X also.

 


Related Discussions:- What is the difference between = = = and = =

What is pci bus, What is PCI bus? The Peripheral component interconnect...

What is PCI bus? The Peripheral component interconnect(PCI) bus is a standard that handles the functions found on a processor bus but in a standardized format that is independe

State about CSMA/CA, State about CSMA/CA It belongs to a class of proto...

State about CSMA/CA It belongs to a class of protocols known as multiple access methods. CSMA/CA  stands  for:  Carrier  Sense  Multiple  Access  with  Collision Avoidance.  In

Explain what are the different hazards, There are situations, called hazard...

There are situations, called hazards that stop the next instruction in the instruction stream from implementing during its designated clock cycle. Hazards decrease the performance

Explain session_start subroutines, Can you give an example of what might be...

Can you give an example of what might be best suited to place in the application_Start and Session_Start subroutines? Application Start - We can place code to initialize var

Efficiency of vector processing over scalar processing, Efficiency of Vecto...

Efficiency of Vector Processing over Scalar Processing As we know a serial computer processes single scalar operands at a time. So if we have to process a vector of length 'n'

What is reducibility, What is reducibility?  The primary method of prov...

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

Define data path, Define data path. The registers, the ALU, and the int...

Define data path. The registers, the ALU, and the interconnecting bus are collectively referred to as the data path.

Qualitative independent variable, Let Consider a multiple regression model ...

Let Consider a multiple regression model for a response y, with one quantitative idividually variable x1, and one qualitative variable at three levels. a)    Write a first-order m

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

Combinatorial and scheduling problems, Combinatorial and Scheduling Proble...

Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where

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