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
ioda
3 years ago
8

I need help on my binary search on khan academy plzzz help

Computers and Technology
2 answers:
Nastasia [14]3 years ago
7 0

Answer:

Explanation:

LOok CloSeR

crimeas [40]3 years ago
6 0

Answer: i don't get what you are asking

Explanation:

You might be interested in
Calculate the maximal size of a file if we have:
ollegr [7]

Answer:

4 GB

Explanation:

<u>Determine the maximal size of a file </u>

100 direct block address

= 100 * 1024 = 102400

One single indirect block address

= 128 * 1024 = 131072

One double indirect block address

= 128 * 128 * 1024 = 16777216

one triple indirect block address

=  128 * 128 * 128 * 1024 = 2147483648

one quadruple indirect block addresses

=  128 * 128 * 128 * 128 * 1024 = 274877906944

maximal size of the file

= ∑ 102400 +  131072 + 16777216 + 2147483648 + 274877906944

= 4GB

7 0
3 years ago
What type of hard drive is in original xbox?
castortr0y [4]
The original Xbox had an 8GB hard disk drive, or HDD.

You basically gave yourself the answer! A hard drive.
4 0
3 years ago
You are given a string of n characters s[1 : : : n], which you believe to be a corrupted text document in which all punctuation
alexdok [17]

Answer: provided in the explanation section

Explanation:

Given that:

Assume D(k) =║ true it is [1 : : : k] is valid sequence  words or false otherwise

  • To determine D(n)

now the sub problem s[1 : : : k] is a valid sequence of words IFF s[1 : : : 1] is a valid sequence of words and s[ 1 + 1 : : : k] is valid word.

So, from here we have that D(k) is given by the following recorance relation:

D(k) = ║ false maximum (d[l]∧DICT(s[1 + 1 : : : k]) otherwise

Algorithm:

Valid sentence (s,k)

D [1 : : : k]             ∦ array of boolean variable.

for a ← 1 to m

do ;

d(0) ← false

for b ← 0 to a - j

for b ← 0 to a - j

do;

if D[b] ∧ DICT s([b + 1 : : : a])

d (a) ← True

(b). Algorithm Output

      if D[k] = = True

stack = temp stack           ∦stack is used to print the strings in order

c = k

while C > 0

stack push (s [w(c)] : : : C] // w(p) is the position in s[1 : : : k] of the valid world at // position c

P = W (p) - 1

output stack

= 0 =

cheers i hope this helps !!!

8 0
3 years ago
Does anyone know what this logo is??
scoray [572]

Answer:

I have got no idea it looks like an older style

8 0
2 years ago
Read 2 more answers
Which statement is true regarding Artificial Intelligence (AI)?
Effectus [21]
Data is the fundamental reason AI succeeds or fails.
This statement is true regarding Artificial Intelligence (AI)
6 0
3 years ago
Other questions:
  • Which part of the faucet is the aerator?
    13·1 answer
  • Please help! (I cant figure out)
    13·1 answer
  • What function would you use to find the mean in a Microsoft excel document ?
    6·2 answers
  • Assuming there are 100 million households in the US, and that each household has two HDTVs, and that each TV is used to watch 4
    15·1 answer
  • Compute (110110001.01)2 + (27.12)10 + (121.25)16 – (130.20)16 and display the answer in hexadecimal base.
    7·1 answer
  • How many questions have you seen so far other than this one?
    10·2 answers
  • You designed a program to create a username using the first three letters from the first name and the first four letters of the
    6·1 answer
  • Pls help! for computers edge 2021
    7·1 answer
  • A slide titled Alexander Graham Bell. There are 6 bulleted entries on the slide, and there is a lot of text on the slide. There
    11·2 answers
  • terms found in provider documentation (e.g., difficult, extensive, or unusual) would support adding modifier to a cpt code.
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!