Answer:
Each description of a PC needs to clarify how the PC handles data: numbers, text, pictures, sound, films, directions.
Using bits to represent data implies that the computer has to use a lot of memory since every character has a group of bits representing it.
The PC is an electronic gadget. Every one of its wires can either convey electric flow or... not convey current. Thus, similar to a light switch, it sees just two states. Incidentally, this is sufficient to make the entire thought work. Indeed, any framework that can speak to in any event two states can speak to data. Take, for instance, the Morse code that is utilized in telecommunication. Morse is a sound transmission framework that can convey a short signal (spoke to by a dab) and a long beeeeeep (spoke to by a scramble). Any letter or number can be spoken to by a mix of these two images. Snap here to see a Morse interpreter.
Explanation:
Essentially with PCs. To speak to a number, we utilize the parallel number-crunching framework, not the decimal number framework that we use in regular day to day existence. In the double framework, any number can be spoken to utilizing just two images, 0 and 1. (Morse is nearly, yet not exactly (because of the delays between letters) a paired framework. A framework firmly identified with Morse is utilized by PCs to do information pressure (more about this later).
Answer:
When you use the expression 'At the Drop of a Hat' you mean that something is happening instantly, without any delay. Example of use: “We're all packed and ready to go; we can leave at the drop of a hat.”
Explanation:
Hope this helped!! :)
Pls thank and maybe brainliest??
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
You can list the numbers . keep listing them till you find the same numbers
