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
nata0808 [166]
3 years ago
12

Compute the bitwise XOR between 10010100 and 11101010.

Computers and Technology
1 answer:
Contact [7]3 years ago
8 0

Answer:

The resultants bits for two strings are 0111 1110

Explanation:

Given details:

two pair of strings are

10010100

11101010

comparing two pair of strings, then perform XOR operation

Rules to follow for XOR

If both the bits are same then resultant is zero 0 and if bits are different resultant is one

XOR operation:

10010100

11 1 01010

-------------

01111110

The resultants bits for two strings are 0111 1110

You might be interested in
Do you think communities or countries can survive without the internet?why or why not?​
abruzzese [7]

Answer:

here

Explanation:

Generally, very few will survive without internet and some technology geek will die overnight due to lack of things to research. Most of the brand and business will lose their online presence in no internet mode

7 0
3 years ago
Which cell formatting is most likely to use $?
TiliK225 [7]
Currency is the correct answer
4 0
3 years ago
Read 2 more answers
Suppose that we pick the following three tuples from a legal instance of a relation S (S has 100 tuples in total). Relation S ha
AysviL [449]

Answer:

The correct answer is BC → A, A does not hold over S. we noticed the tuples (1 ,2 ,3 ) and (4 ,2 ,3) which can hold over S)

Explanation:

Solution

No, since in this case the instance of S is provided. so such particular dependencies are unable to breach through such instance, but unable to tell which the dependencies hold towards S.

A functional dependency holds towards only when a relation forms a statement regarding the complete allowed instances of relation.

8 0
3 years ago
The height of a small rocket y can be calculated as a function of time after blastoff with the following piecewise function: y 5
SOVA2 [1]

Answer:

High level Language

understand

Explanation:

rocket is 0...4433456u888

5 0
2 years ago
For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method g
konstantin123 [22]

Answer:

In Python:

def gcd(m,n):

if n == 0:

 return m

elif m == 0:

    return n

else:

 return gcd(n,m%n)

Explanation:

This defines the function

def gcd(m,n):

If n is 0, return m

<em> if n == 0: </em>

<em>  return m </em>

If m is 0, return n

<em> elif m == 0: </em>

<em>     return n </em>

If otherwise, calculate the gcd recursively

<em> else: </em>

<em>  return gcd(n,m%n)</em>

<em />

<em>To call the function to calculate the gcd of say 15 and 5 from main, use:</em>

<em>gcd(15,5)</em>

6 0
3 years ago
Other questions:
  • Which three phrases describe a wireframe
    12·1 answer
  • 10 facts about turbines
    11·2 answers
  • The inventory tracking system shows that 12 laptop were on hand before a customer brings two laptops to the register for purchas
    9·1 answer
  • Is it necessary that every autonomous system use the same intra-AS routing algorithm? Why or why not?
    10·1 answer
  • When a formula contains the address of a cell, it is called a(n) ________.
    15·1 answer
  • Which command can be used to find errors on a hard drive​
    6·1 answer
  • I need help with workplace safety systems please help
    10·1 answer
  • Website managers use____ every day.
    10·2 answers
  • Which letter shows the ball when it has the maximum kinetic energy
    15·1 answer
  • What are three ways a person may use a computer without realizing it?
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!