Which of the following best describes the difference between the domain and path of a URL?

What is a file allocation table (FAT), andwhere is it found on a floppy disk?

Akimi4 [234]

Answer:

File Allocation Table(FAT):- It is a computer file system design and it is widely used on many computers and most of the memory cards. FAT file systems are commonly found on flash memory cards,floppy disks, digital cameras, and many other portable devices.

In floppy disks, the FAT has been standardized as ISO/IEC 9293 and ECMA-107.These include FAT12 and FAT16 only without any long filename support.

5 0

3 years ago

The memory capacity in bits for performing the operation y = f (x) using the table lookup method, where x is an 8-bit number and

Flura [38]

Answer:

The page field is 8-bit wide, then the page size is 256 bytes.

Using the subdivision above, the first level page table points to 1024 2nd level page tables, each pointing to 256 3rd page tables, each containing 64 pages. The program's address space consists of 1024 pages, thus we need we need 16 third-level page tables. Therefore we need 16 entries in a 2nd level page table, and one entry in the first level page table. Therefore the size is: 1024 entries for the first table, 256 entries for the 2nd level page table, and 16 3rd level page table containing 64 entries each. Assuming 2 bytes per entry, the space required is 1024 * 2 + 256 * 2 (one second-level paget table) + 16 * 64 * 2 (16 third-level page tables) = 4608 bytes.

First, the stack, data and code segments are at addresses that require having 3 page tables entries active in the first level page table. For 64K, you need 256 pages, or 4 third-level page tables. For 600K, you need 2400 pages, or 38 third-level page tables and for 48K you need 192 pages or 3 third-level page tables. Assuming 2 bytes per entry, the space required is 1024 * 2 + 256 * 3 * 2 (3 second-level page tables) + 64 * (38+4+3)* 2 (38 third-level page tables for data segment, 4 for stack and 3 for code segment) = 9344 bytes.

Explanation:

16 E the answer

5 0

3 years ago

find_cow(name, cows) Given a name and a Python list of Cow objects, return the Cow object with the specified name. If no such Co

nadya68 [22]

Using the computational knowledge in python it is possible to write a code that Given a name and a Python list of Cow objects

<h3>Writting the code in python:</h3>

def load_cows(filename):

cow_dict = dict()

f = open(filename, 'r')

for line in f:

line_data = line.split(',')

cow_dict[line_data[0]] = int(line_data[1])

return cow_dict

def greedy_cow_transport(cows, limit=10):

trips = []

cowsCopy = cows.copy()

sortedCows = sorted(cowsCopy.items(), key=lambda x: x[1], reverse = True)

while sum(cowsCopy.values()) > 0:

ship = []

total = 0

for cow, value in sortedCows:

if cowsCopy[cow] != 0 and value + total <= limit:

ship.append(cow)

total += value

cowsCopy[cow] = 0

trips.append(ship)

return trips

def brute_force_cow_transport(cows,limit=10):

trips = []

possibilities = []

for i in power_list:

ship = []

for j in i:

ship_weights = []

for k in j:

ship_weights.append(cows[k])

#print(ship_weights)

ship.append(sum(ship_weights))

#print(ship)

if all(d <= limit for d in ship):

possibilities.append(i)

pruned_possibilities = []

for k in possibilities:

if k not in pruned_possibilities:

pruned_possibilities.append(k)

# now find the minimum list length:

min_list_len = min(map(len, pruned_possibilities))

for l in pruned_possibilities:

if len(l) == min_list_len:

return l

def compare_cow_transport_algorithms():

greedy_start = time.time()

greedy_results = greedy_cow_transport(cows, limit = 10)

greedy_end = time.time()

print('Greedy Algorithm time:', greedy_end -greedy_start)

brute_force_start = time.time()

brute_force_results = brute_force_cow_transport(cows, limit = 10)

brute_force_end = time.time()

print('Brute force time:', brute_force_end - brute_force_start)

print('Greedy Algorithm results:', greedy_results)

print('Number of trips returned by Greedy Algorithm:', len(greedy_results))

print('Brute Force Algorithm results:', brute_force_results)

print('Number of trips returned by Brute Force Algorithm:', len(brute_force_results))

See more about python at brainly.com/question/13437928

#SPJ1

4 0

2 years ago

What kind of bond is created by the attraction between atomic particles of opposite charge?

Veseljchak [2.6K]

That is called an lonic bond.

Ionic bonds are formed between elements with greater than 1.4 electronegative variance and to a lesser extent by first ionization energy variance, such as alkali metals and nonmetal halogens for example. The element of lesser electronegativity, the cation, donates an electron(s) from it's valance shell to the element with the greater electronegativity, the anion, which accepts the electron(s) unto it's valance shell. This bond is extremely strong and has a high melting point but because of waters polar nature this type of bond, usually, not always, disassociates in water.

5 0

3 years ago

Read 2 more answers

What is the definition of podcast

Yanka [14]

a digital studio that is been live to all around the world

6 0

3 years ago