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
den301095 [7]
3 years ago
13

What would be the code of this in HTML ??

Computers and Technology
1 answer:
Alla [95]3 years ago
8 0

Answer:r tHE RED LINE

Explanation:

Its not supost to be there

You might be interested in
We are continuously sending and receiving messages that may change midstream. This illustrates that____________.
8_murik_8 [283]

Answer:

Communication is a constant process and it can also be corrupted.

Explanation:

Communication is the ability to send and receive messages that can be understood. We constantly communicate with our environment verbally and or orally, using signs and language to express ourselves.

Messages sent can and should be decoded for communication to be complete. It can be corrupted on its path to the decoder, this hinders understanding.

6 0
3 years ago
A a a a I don't need help!?
Arlecino [84]

Answer:

ok

Explanation:

ok

6 0
3 years ago
Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for
12345 [234]

Answer:

See explanation below

Explanation:

Previos concepts

First Come First Serve (FCFS) "is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival".

Shortest job next (SJN), or the shortest job first (SJF) or shortest "is a scheduling policy that selects for execution the waiting process with the smallest execution time".

Shortest remaining time (SRF) "is a scheduling method that is a preemptive version of shortest job next scheduling'".

Round robin (RR) is an algorithm where the time parts "are assigned to each process in equal portions and in circular order, handling all processes without priority"

Solution for the problem

Assuming the dataset given on the plot attached.

Part a

For this algorithm the result would be:

Job A   0-6

Job B   6-(6+3) = 6-9

Job C   9-(9+1) = 9-10

Job D   10-(10+4) = 10-14

Part b

For this algorithm the result would be:

Job A   0-6

Job C   6-(6+1) = 6-7

Job B   7-(7+3) = 7-10

Job D   10-(10+4) = 10-14

Part c

For this algorithm the result would be:

Job A   0-1  until 14

Job B   2-(2+3) = 2-5

Job C   3-(3+2) = 3-5

Job D   9-(9+5) = 9-14

Part d

For this algorithm the result would be:

Job A   0-2 , 7-9, 12-14

Job B   2-4, 9-10

Job C   4-(4+1) = 4-5

Job D   5-7, 10-12

8 0
3 years ago
True or false: in order to keep yourself and co workers safe, you must be able to recognize electrical hazards
solong [7]
I believe it’s true
8 0
3 years ago
Read 2 more answers
Consider a demand-paging system with the following time-measured utilizations: CPU utilization 20% Paging disk 97.7% Other I/O d
Zarrin [17]

Answer:

see explaination please

Explanation:

a. Install a faster CPU. Answer:NO

Optional: a faster CPU reduces the CPU utilizationfurther since the CPU will spend more time waiting for a process toenter in the ready queue.

b. Install a bigger paging disk. Answer:NO

Optional: the size of the paging disk does not affect theamount of memory that is needed to reduce the pagefaults.

c. Increase the degree of multiprogramming Answer:NO

Since each process would have fewer frames available andthe page fault rate would increase

d. Decrease the degree of multiprogramming.Answer: YES

Optional: by suspending some of the processes, the otherprocesses will have more frames in order to bring their pages inthem, hence reducing the page faults.

e. Install more main memory. Answer:Likely

Optional: more pages can remain resident and do notrequire paging to or from the disks.

f. Install a faster hard disk or multiplecontrollers with multiple hard disks. Answer:Likely

(Optional)

g. Add prepaging to the page-fetchalgorithms.Answer: Likely

(Optional.)

h. Increase the page size. Answer:NO

Since each process would have fewer frames available and the page fault rate would increase

5 0
3 years ago
Other questions:
  • Which of the following programs can open a bitmap file?
    11·2 answers
  • An interpreter _______. converts the procedural language one statement at a time converts the source code into machine language
    12·1 answer
  • Briefly explain what is net neutrality and why is it important today
    15·1 answer
  • Need help please will mark brainliest
    15·1 answer
  • The term ____ describes primary storage devices that are implemented as microchips, can read and write with equal speed, and can
    8·1 answer
  • Write a C++ program to count even and odd numbers in array. The array size is 50. The array elements will be entered by the user
    13·1 answer
  • Select all the items of the Design Elements.
    7·1 answer
  • Complete the statement by entering the appropriate term in the space below.
    13·2 answers
  • Which is an example of machine-to-machine communication?
    7·1 answer
  • What type of attack occurs when the threat actor snoops and intercepts the digital data transmitted by the computer and resends
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!