All categories

3 years ago

What is word processing and word wrap?

1 answer:

8 0

MARK ME BRAINLIEST

1. Sometimes referred to as a run around, word wrap is a feature in text editors and word processors that moves to the next line when reaching the end without requiring you to press Enter. For example, in the picture below you can see as each section is shrunk the sentence is wrapped, so it does not extend past the border. You can see a live example of how text wraps by resizing the browser window on this page.

2. word proc·ess·ing

the production, storage, and manipulation of text on a computer or word processor.

You might be interested in

Using numerous computers to inundate and overwhelm the network from numerous launch points is called a(n) ________ attack.

AnnZ [28]

Distributed Denial of Service / DDoS

4 0

2 years ago

Define inheritance. give an example

Nezavi [6.7K]

A class can be defined using another class as a foundation. In object-oriented programming terminology, one class can inherit fi elds and methods from another. An object that inherits from another is called a subclass, and the object it inherits from is called a superclass. A subclass extends the superclass.

3 0

2 years ago

In what year was the first permanent photographic image created?

kvv77 [185]

Answer:

1826

Explanation:

it was in 1826 when the first permanent photographic image was created.

5 0

2 years ago

The software used to help run the computer hardware is the _____.

TiliK225 [7]

C. system software
if it means drivers and so on

6 0

2 years ago

Read 2 more answers

1. How many bits would you need to address a 2M × 32 memory if:

Dominik [7]

Answer:

a) 23 b) 21
a) 43 b) 42
a) 0 b) 0

Explanation:

1) How many bits is needed to address a 2M * 32 memory

2M = 2^1*2^20, while item =32 bit long word

hence ; L = 2^21 ; w = 32

a) when the memory is byte addressable

w = 8; L = ( 2M * 32 ) / 8 = 2M * 4

hence number of bits = log2(2M * 4)= log2 ( 2 * 2^20 * 2^2 ) = 23 bits

b) when the memory is word addressable

W = 32 ; L = ( 2M * 32 )/ 32 = 2M

hence the number of bits = log2 ( 2M ) = Log2 (2 * 2^20 ) = 21 bits

2) How many bits are required to address a 4M × 16 main memory

4M = 4^1*4^20 while item = 16 bit long word

hence L ( length ) = 4^21 ; w = 16

a) when the memory is byte addressable

w = 8 ; L = ( 4M * 16 ) / 8 = 4M * 2

hence number of bits = log 2 ( 4M * 2 ) = log 2 ( 4^1*4^20*2^1 ) ≈ 43 bits

b) when the memory is word addressable

w = 16 ; L = ( 4M * 16 ) / 16 = 4M

hence number of bits = log 2 ( 4M ) = log2 ( 4^1*4^20 ) ≈ 42 bits

3) How many bits are required to address a 1M * 8 main memory

1M = 1^1 * 1^20 , item = 8

L = 1^21 ; w = 8

a) when the memory is byte addressable

w = 8 ; L = ( 1 M * 8 ) / 8 = 1M

hence number of bits = log 2 ( 1M ) = log2 ( 1^1 * 1^20 ) = 0 bit

b) when memory is word addressable

w = 8 ; L = ( 1 M * 8 ) / 8 = 1M

number of bits = 0

5 0

2 years ago