All categories

3 years ago

PlZZZZZZZ help will give Brainliest

Computers and Technology

2 answers:

melamori03 [73]3 years ago

7 0

I believe it is called “Transition”

dalvyx [7]3 years ago

3 0

Answer:

Phone

Explanation:

You might be interested in

Write a basic notation for

Licemer1 [7]

Answer:

$a = (b + c)/(2 * c)$

$z = x/(y + c)$

$c = (9 * c + 32)/5$

Explanation:

Required

The expression in basic

To do this, we use () to group items, / as divide and * to combine factors

So, we have:

$(a)\ a = \frac{(b + d)}{2c}$

In basic, it is:

$a = (b + c)/(2 * c)$

$(b)\ z = \frac{x}{y + c}$

In basic, it is:

$z = x/(y + c)$

$(c)\ c = \frac{9c + 32}{5}$

$c = (9 * c + 32)/5$

4 0

3 years ago

A/an controls the flow of data between a computer and the network.

strojnjashka [21]

Answer:

The NIC (Network Interface Card) is the computer network component that controls the flow of data between a computer and the network.

Explanation:

5 0

3 years ago

Create a series called 'directors' that contains each director's name and his or her average rating. Print out the type of your

sasho [114]

Using the computational language in python it is possible to write a code that we will use graphics to organize the names of the directors and the films they made.

<h3>Writing code in python:</h3>

import pandas as pd

df = pd.read_csv('all_data/movie_metadata.csv')

print('Shape: ',df.shape)

df.head()

name = df[['director_name','imdb_score']]

directors = name.groupby(['director_name']).mean()

directors = directors.reset_index()

directors = directors.stack()

print(directors,'\n')

print(type(directors),'\n')

print(directors[directors=='Steven Spielberg'],'\n')

print(directors[102]['imdb_score'])

miyazaki = df[df['director_name'] == 'Hayao Miyazaki']['movie_title']

print(miyazaki)

pivot_agg = pd.pivot_table(df,values='imdb_score', index=['country'], columns=['director_name'],aggfunc=np.median)

pivot_agg

gladiator_duration = df[df['movie_title']=='Gladiator\xa0']['duration']

gladiator_duration

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

#SPJ1

6 0

2 years ago

Scrabble is a word game in which words are constructed from letter tiles, each letter tile containing a point value. The value o

Fantom [35]

Complete question:

Scrabble is a word game in which words are constructed from letter tiles, each letter tile containing a point value. The value of a word is the sum of each tile's points added to any points provided by the word's placement on the game board. Write a program using the given dictionary of letters and point values that takes a word as input and outputs the base total value of the word (before being put onto a board). Ex: If the input is: PYTHON

the output is: 14

part of the code:

tile_dict = { 'A': 1, 'B': 3, 'C': 3, 'D': 2, 'E': 1, 'F': 4, 'G': 2, 'H': 4, 'I': 1, 'J': 8, 'K': 5, 'L': 1, 'M': 3, 'N': 1, 'O': 1, 'P': 3, 'Q': 10, 'R': 1, 'S': 1, 'T': 1, 'U': 1, 'V': 4, 'W': 4, 'X': 8, 'Y': 4, 'Z': 10 }

Answer:

Complete the program as thus:

word = input("Word: ").upper()

points = 0

for i in range(len(word)):

for key, value in tile_dict.items():

if key == word[i]:

points+=value

break

print("Points: "+str(points))

Explanation:

This gets input from the user in capital letters

word = input("Word: ").upper()

This initializes the number of points to 0

points = 0

This iterates through the letters of the input word

for i in range(len(word)):

For every letter, this iterates through the dictionary

for key, value in tile_dict.items():

This locates each letters

if key == word[i]:

This adds the point

points+=value

The inner loop is exited

break

This prints the total points

print("Points: "+str(points))

6 0

3 years ago

It takes 2 seconds to read or write one block from/to disk and it also takes 1 second of CPU time to merge one block of records.

Alexxx [7]

Answer:

Part a: For optimal 4-way merging, initiate with one dummy run of size 0 and merge this with the 3 smallest runs. Than merge the result to the remaining 3 runs to get a merged run of length 6000 records.

Part b: The optimal 4-way merging takes about 249 seconds.

Explanation:

The complete question is missing while searching for the question online, a similar question is found which is solved as below:

Part a

For optimal 4-way merging, we need one dummy run with size 0.

Merge 4 runs with size 0, 500, 800, and 1000 to produce a run with a run length of 2300. The new run length is calculated as follows $L_{mrg}=L_0+L_1+L_2+L_3=0+500+800+1000=2300$
Merge the run as made in step 1 with the remaining 3 runs bearing length 1000, 1200, 1500. The merged run length is 6000 and is calculated as follows