All categories

3 years ago

The hardware that takes the input data and works with it

Computers and Technology

1 answer:

pogonyaev3 years ago

5 0

Answer:

Examples of input devices include keyboards, mice, scanners, digital cameras and joysticks.

Explanation:

You might be interested in

What is the difference between a heap (a minheap) and a binary search tree?

denis-greek [22]

Answer:

Some differences between Heap and Binary search trees are as following:-

A heap is a complete binary tree.While a Binary Search Tree may be a complete,prefect binary tree.

A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum.While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.

4 0

3 years ago

What does the term hardware refer to?

Jobisdone [24]

Answer:

The physical components that a computer is made of

Explanation:

as u can see these components and u can repaire these components if they got damaged

6 0

3 years ago

What is c also write it's features

Marina86 [1]

C is a language used to write complex programs.

4 0

3 years ago

Read 2 more answers

Consider the following modification to the Merge Sort algorithm: divide the input array into thirds (rather than halves), recurs

ehidna [41]

Answer:

The correct answer to the following question will be "n logn".

Explanation:

Time Complexity should be the same as the whole last particular instance, just the log base keeps changing with three.
Throughout the circumstance of separating 2 arrays, we want one correlation. however, for splitting between 3-way arrays, will require 2 comparisons to sort.
However, after breaking the array into 3, we can lower the number of transfers by growing the comparison. So the time complexity would then persist the same, but the log should get base 3 as we've classified into different parts.

So the time complexity will be:

⇒ $T(n)=3T(\frac{n}{3})+ O(n)$

⇒ $=O(n \ logn) \ with \ base \ 3$

7 0

3 years ago

The instruction format of a computer is given by one indirect bit, opcode bits, register address bits, immediate operand bits an

oksian1 [2.3K]

Answer:

Following are the answer to this question:

Explanation:

The memory size is 1 Giga Bytes which is equal to $2^{30}$

$\texttt{Number of address bits \ \ \ \ \ \ \ \ \ \ \ \ \ \ Number of addresses}\\\\ \ \ \ \ 30 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ 2^{30}= 1073741824$

B) $\texttt{I \ \ \ Opcode \ \ \ Register address \ \ \ Immediate operand \ \ \ Memory address}\\\\\\\textt{1 \ bit \ \ \ \ \ \ 128 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ 2 \ bits \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ 24 \ bits \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ 30 \ bits}\\\\\\$ $= 2^7 \\\\ = 7 \ bits$

calculating the register Bits:

$= 64-(1+7+24+30)\\\\=64 -62\ \ bits\\\\= 2\ \ bits\\$

Immediate value size while merging the additional benefit with the address field:

$= 2^{24} + 2^{30}\\\\= 2^{54}\\\\$ $\texttt{Range before combining(-,+) 24 bits \ \ \ \ \ \ Range after combining( -,+)54bits}\\\\$ $\textt{-2^{12} from + (2^{12}-1) \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ -2^{27} from + (2^{27}- 1)}$

$= \frac{24}{2} = 12\\\\= \frac{54}{2} = 27$

The range is accomplished by dividing the bits by 2 into the two sides of the o and the number is one short to 0.

8 0

3 years ago