1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Schach [20]
3 years ago
8

Code for XOR with two input logic gate

Engineering
1 answer:
Aleks04 [339]3 years ago
3 0

Explanation:

An XOR gate (sometimes referred to by its extended name, Exclusive OR gate) is a digital logic gate with two or more inputs and one output that performs exclusive disjunction. The output of an XOR gate is true only when exactly one of its inputs is true.

You might be interested in
Consider two different versions of algorithm for finding gcd of two numbers (as given below), Estimate how many times faster it
juin [17]

Answer:

Explanation:

Step 1:

a) The formula for compute greatest advisor is

     gcd(m,n) = gcd (n,m mod n)

the gcd(31415,14142) by applying Euclid's algorithm is

    gcd(31,415,14,142) =gcd(14,142,3,131)

                                  =gcd=(3,131, 1,618)

                                   =gcd(1,618, 1,513)

                                   =gcd(1,513, 105)

                                   =gcd(105, 43)

                                    =gcd(43, 19)

                                     =gcd(19, 5)

                                      =gcd(5, 4)

                                      =gcd(4, 1)

                                      =gcd(1, 0)

                                      =1

STEP 2

b)  The number of comparison of given input with the algorithm based on  checking consecutive integers and Euclid's algorithm is

     The number of division using Euclid's algorithm =10 from part (a)

      The consecutive integer checking algorithm:

      The number of iterations =14,142 and 1 or 2 division of iteration.

        14,142 ∠= number of division∠ = 2*14,142

         Euclid's algorithm is faster by at least 14,142/10 =1400 times

          At most 2*14,142/10 =2800 times.

5 0
3 years ago
How are project deliverables determined?
Greeley [361]

Answer:

The essence including its problem is listed throughout the clarification section following.

Explanation:

Projects build deliverable that seem to be the products of the venture or indeed the implementation of the project. This ensures that perhaps the agile methodology may be as broad as either the goal of the study itself as well as the coverage that would be part of a much larger venture.

For every other production to have been marked as "deliverable" within the same project, this should satisfy a few eligibility requirements:

  • It should be within the development of the work.
  • The interested parties-external or internal-must consent to the above. This is perhaps the product of hard effort.

So that the above seems to be the right answer.

7 0
3 years ago
Read 2 more answers
Show the ERD with relational notation with crowfoot. Your ERD must show PK, FKs, min and max cardinality, and correct line types
zhenek [66]

Answer

The answer and procedures of the exercise are attached in the following archives.

Step-by-step explanation:

You will find the procedures, formulas or necessary explanations in the archive attached below. If you have any question ask and I will aclare your doubts kindly.  

3 0
3 years ago
In a team, a person’s efforts are less identifiable than when that person works independently. Because the person’s efforts are
Eduardwww [97]
The answer is deindividuation - a psychological state in which a person does not feel individual responsibility.
3 0
3 years ago
Compare and contrast ""centralized"" and ""decentralized"" routing algorithms. (What are the advantages and disadvantages of eac
pantera1 [17]

Answer:

Comparison between centralized and decentralized routing algorithms:

The major similarity between both centralized and decentralized routing algorithms is that they are both communication serving systems. They both utilize node system(e.g, computer) and are both a communication liking system( e.g, Cable).

Contrasting between centralized and decentralized routing algorithms:

There are few differences between these two type of communication link or path way system but to name a couple of them,

For centralized, there is a single client server distribution node which simply means that one or more client server system are connected to a central processing server.

This also means that if the central processing server or pathway fails, it leads to the failure of the entire system. That is, there is no sending, responding or general processing of any form of requests. Example of a system that uses the centralized routing algorithm is the google search engine.

WHILE:

for the decentralized routing algorithms, there are multiple client server distribution pathway and each server makes its own decision. Here,there is no single entity that receives and responds to the request therefore,failure of any form of central path way processing node does not lead to the failure of the whole system unlike for the centralized system.

Advantages of centralized routing algorithm:

It can be easily protected or secured due to the nature of the system. If the central node is been secured, it generally translate to the different client node being secured.

It is easy to disconnect a connected client node from the central pathway node or central server as the case may be.

Disadvantages of centralized routing algorithm:

The client nodes are totally dependent on the central node or server so if there is a failure in the central server, the client node is then totally shut down.

Advantages of decentralized routing algorithm:

There is a random distribution of data on all the processing node or server which automatically creates a form of balance within the system. This leads to minimal or no down time processing client request.

Disadvantages of decentralized routing algorithm:

Due to the nature or fact that there are multiple processing system for different client node, it is difficult to detect which client node or request processing server is faulty. This can lead to delay in the fixing of fault in the system should it arise.

Why do we prefer a ""decentralized"" algorithm for routing messages through the internet?

The major reason why decentralized algorithm routing is preferred is because of the level of security attached to it. Each processing servers are secured independently and there is privilege of utilizing independent networking system.

5 0
3 years ago
Other questions:
  • James River Jewelry is a small jewelry shop. While James River Jewelry does sell typical jewelry purchased form jewelry vendors,
    15·1 answer
  • A digital Filter is defined by the following difference equation:
    11·1 answer
  • what is the expected life 1 inch diameter bar machined from AISI 1020 CD Steel is subjected to alternating bending stress betwee
    9·1 answer
  • Please Help !!
    5·1 answer
  • Which actions would the maintenance and operations crews carry out as a building is completed and preparing to open to the publi
    8·2 answers
  • a coil consists of 200 turns of copper wire and has a cross-sectional area of 0.8mm square . The mean length per turn is 80 cm a
    5·1 answer
  • Most of the work that engineers do with fluids occurs in nature. True False
    6·1 answer
  • If a tapered roller bearing is adjusted to loose, the bearing will bind and overheat.
    11·1 answer
  • For heat transfer purposes, a standing man can be mod-eled as a 30-cm-diameter, 170-cm-long vertical cylinderwith both the top a
    11·1 answer
  • How to make text take shape of object in affinity designer
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!