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
Alex17521 [72]
3 years ago
5

......... mi2hejejid8eo19o1b2bxhxjxjdnneejk2929nr

Computers and Technology
2 answers:
Mila [183]3 years ago
5 0

Answer:

hi  thsu si s5

Explanation:

brace use

Helga [31]3 years ago
3 0

Answer:

felt

Explanation:

mood bc xryd ctfu   vyjh bk ju giy fu tcg v jhbkjn

You might be interested in
The common channel signaling (CCS) system provides a separate network dedicated to control and signaling over the PSTN. This ena
dezoksy [38]
The correct answer is A.True
8 0
3 years ago
The primary input device for interacting with the operating system is the ____.
andre [41]
The primary input device is the Mouse.
3 0
3 years ago
Read 2 more answers
How to make classs constructer java.
ladessa [460]

Answer:

A constructor doesn't have a return type.

The name of the constructor must be the same as the name of the class.

Unlike methods, constructors are not considered to be members of a class.  

A constructor is called when a new instance of an object is created.

Explanation:

4 0
3 years ago
let m be a positive integer with n bit binary representation an-1 an-2 ... a1a0 with an-1=1 what are the smallest and largest va
Ahat [919]

Answer:

Explanation:

From the given information:

a_{n-1} , a_{n-2}...a_o in binary is:

a_{n-1}\times 2^{n-1}  + a_{n-2}}\times 2^{n-2}+ ...+a_o

So, the largest number posses all a_{n-1} , a_{n-2}...a_o  nonzero, however, the smallest number has a_{n-2} , a_{n-3}...a_o all zero.

∴

The largest = 11111. . .1 in n times and the smallest = 1000. . .0 in n -1 times

i.e.

(11111111...1)_2 = ( 1 \times 2^{n-1} + 1\times 2^{n-2} + ... + 1 )_{10}

= \dfrac{1(2^n-1)}{2-1}

\mathbf{=2^n -1}

(1000...0)_2 = (1 \times 2^{n-1} + 0 \times 2^{n-2} + 0 \times 2^{n-3} + ... + 0)_{10}

\mathbf {= 2 ^{n-1}}

Hence, the smallest value is \mathbf{2^{n-1}} and the largest value is \mathbf{2^{n}-1}

3 0
3 years ago
Place the following discoverers in the correct chronological order of the timeframe for their discoveries, from earliest to most
Alex787 [66]
The correct order or answer is the 2nd choice.

Pythagoras, Gauss, Edison, Hawking. The following are the most noted discoveries of each.

Pythagoras, 500 B.C. School Of Mathematics and Pythagorean theorem.Edison, Year 1879 - Invention of incandescent light bulb.Gauss, Year 1801 - Therom of Alegbraic Solution. Stephen Hawking Year1980 - Studies in cosmology particularly contributing to the context of black holes.
5 0
3 years ago
Other questions:
  • What term is used to describe a chipset developed and promoted by the U.S. government from 1993 to 1996 as an encryption device
    9·1 answer
  • Sarah wants to calculate how much of a profit she would make on producing and selling a new product. Sarah should use a _____.
    13·1 answer
  • ____ languages create source code using words and structures similar to spoken language.​
    15·1 answer
  • Which of the following are types of home internet service? Check all that apply
    7·1 answer
  • In Word, a red wavy underline indicates a/an
    15·1 answer
  • Assign a variable solveEquation with a function expression that has three parameters (x, y, and z) and returns the result of eva
    6·1 answer
  • Mississippi law codes state that bullying and cyberbullying are against the law. A court can decide to incur ___________________
    10·1 answer
  • Launa is reviewing several videos from her friends doing the latest dance challenge before they are published on their own
    11·1 answer
  • 4.9 Code Practice: Question 4 Edhisive
    14·2 answers
  • A user logs in to a virtual world and creates an animated character representing themselves, which they then use to move through
    15·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!