Unit 2 - Chapter 4 Flashcards

1
Q

External Representation

A

the way information is represented by humans and the way it is entered at a keyboard or displayed on a printer or screen.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Internal Representation

A

the way information is stored in the memory of a computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Binary Numbering System

A

Binary is a base-2 positional numbering system. There are only two digits, 0 and 1, and the value of the positions in a binary number is based on powers of 2.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Maximum number of binary digits that can be used

A

Typically this value is 16,32, or 64 bits.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Arithmetic overflow

A

An attempt to represent an integer that exceeds the maximum allowable value.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Computer Science

A

Must del with a finite and sometimes quite limited set of possible representations and it must handle the errors that occur when those limits are exceeded.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Signed numbers

A

To represent signed integers ( in binary) we can use the left most bit of a number to represent a sign, with 0 meaning positive ( +) and 1 meaning negative ( - ). This form of signed integer representation is termed => signed/ magnitude notation, and it is one of a number of different techniques for representing positive and negative whole numbers. Disadvantage => This technique causes the issue of + 0 / - 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The meaning of a binary number stored in memory

A

is based solely on the context in which it is used. The context determines the meaning of a binary string.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Two’s complement representation

A

The positive numbers begin at 000…and proceed in order around the circle to the right, Negative numbers begin at 111 and proceed in order around the circle to the left. The leftmost digit specifies whether the number is to be given a positive interpretation ( leftmost bit = 0 ) or a negative interpretation ( left most bit = 1 ) ====»> there is only one single zero, the binary number 000… DISADVANTAGE: you can always represent one more negative number than positive

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Fractional Numbers

A

To represent fractions in binary you must first convert the number to scientific notation. +-M x B +-E
M = Mantissa
B= exponent base
E = exponent
** The mantissa ( or significand or coefficient) is part of a number consisting of its significant digits
For example:
0.6259 x 10 to the power of 3
0.6259 is significant
10 is the base
3 is the exponent
In a floating point number the first bit is the sign ( + or - ) the net bits are for the exponent and the rest is for the significand.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Textual Information

A

To represent textual material in binary, the system assigns each printable letter or symbol in our alphabet a unique number, and then stores that symbol internally using the binary equivalent of that number.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

ASCII

A

Currently, the most widely used code for representing characters internally in a computer system is called ASCII, an acronym for the American Standard Code for information exchange. ASCII is an international standard for representing textual information in the majority of computers. It uses 8 bits to represent each character, so it is able to encode a total of 2 to the power of 8 or 256 different characters . These are assigned the integer values 0 to 255.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Unicode

A

a code set that has gained popularity because it uses 16-bit representation for characters. This means it is able to represent 2 to the power of 16 = 65,536 unique characters. This is especially important for representing emojis and characters other than English.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Analog Representation

A

objects can take on any value. Amplitude => loudness => the greater the amplitude the louder the sound. => the Period of the wave designated as T is the time is takes for the wave to make one complete cycle. => The frequency is the total number of cycles per unit measured in cycles/second, also called hertz and defined as f= 1/T
***** The frequency is a measure of pitch, the highness or loudness of a sound. The higher the frequency, the higher the perceived tone.
===»> Human ear can generally detect sounds in the range of 20 to 20,000 hertz.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

To store a waveform in a computer

A

the analog signal must first be digitized, that is, converted to a digital representation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

sampling

A

At fixed time intervals, the amplitude of the signal is measured and stored as an integer value. The wave is thus represented in digital form as a sequence of sampled numerical amplitude.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Accuracy of Sound

A

The accuracy with which the original sound can be reproduced is dependent on two key elements - the sampling rate and the bit depth.

18
Q

Sampling rate

A

measures how many times per second we sample the amplitude of the soundwave. The more often we sample, the more accurate the reproduction. Also, the more often we sample, the greater the range of frequencies that can be captured.

19
Q

Bit depth

A

The number of bits used to encode each sample.
==»> Most audio encoding schemes today use either 16 or 24 bits per sample level, allowing for either 65K or 16M distinct amplitude levels.

20
Q

Scanning

A

Measuring the intensity values of distinct points located at regular intervals across the image surface. These points called pixels are picture elements. The more pixels used, the more accurate the encoding of the image.

21
Q

Raster graphics

A

Used by well-known graphics standards such as JPEG ( join photographer experts group), GIF ( graphics Interchange Format), and BMP ( bitmap). It is a dot matrix data structure that represents a generally rectangular grid of pixels, viewable via a computer display, paper, or other display medium.

22
Q

To digitize images, black and white or colour,

A

we measure the intensity value of the image at a discrete set of points. For colour, we need to store more information about each pixel.

23
Q

RGB encoding scheme

A

Most common format for storing colour images, RGB is an acronym for red green blue. This technique describes a specific colour by capturing the individual contribution to a pixel’s colour of each of the three colours. It uses one byte for each colour, allowing us to represent an intensity range from 0 to 255.

24
Q

True colour

A

24 bit colour encoding scheme or 2 power 24 distinct colours approximately 16.7 million. The encoding scheme use in the JPEG format.

25
Q

Color palette

A

Technique used in the Graphics Interchange Format ( GIF), which uses a palette that can hold as few as 2 colours or as many as 256.
===» This is also called colour lookup palette ( CLUT). A palette is a correspondence table in which selected colours from a certain color space’s color reproduction range are assigned an index, by which they can be referenced.
===» By referencing the colors via an index, which takes less information than the one needed to describe the actual colors in said color space, this technique aims to reduce data usage, be it as processing payload, transfer bandwith, RAM usage or persistent storage.
===» Images in which colors are indicated by references to a CLUT are called indexed colour images.

26
Q

Data Compression

A

Data compression algorithms attempt to represent information in ways that preserve accuracy while using significantly less space

27
Q

Run-length encoding

A

This method replaces a sequence of identical values ( V1, V2, V3) by a pair of values ( V, N) which indicates the value v is replicated n times.

28
Q

Compression ration

A

measures how much they reduce the storage requirements of the data : compression ratio = size of the uncompressed data / size of the compressed data

29
Q

Lossless compression

A

This means that no information is lost in the compression, and it is possible to exactly reproduce the original data

30
Q

Lossy compression schemes

A

compress data in a way that does not guarantee that all of the information in the original data can be fully and completely recreated.

31
Q

transitor

A

a solid-state device that has no mechanical or moving parts ( electronic device). It is bistable. It can be in an off state, which does not allow electricity to flow, or in an ON state, in which electricity can pass unimpended. The switching of a transistor from the OFF to the On state, and vice-versa, is done electronically rather than mechanically. This allows the transistor to be fast as well as extremely small.

32
Q

Boolean Logic

A

Area of mathematics that deals with rules for manipulating the two logical value true and false. Used to construct circuits that perform operations such as adding numbers, comparing numbers and fetching instructions. In Boolean logic, the operations used to construct Boolean expressions are AND, OR< & NOT and they map a set of ( true, false) values into a single ( true, false) result.

33
Q

AND & OR

A

require two operands and are therefore called binary equators

34
Q

NOT

A

requires only one operand and is called a unary operator like the square root operator in arithmetic

35
Q

Tautology

A

A Boolean expression that is always true.

36
Q

Gates

A

A gate is an electronic device that operates on a collection of binary inputs to produce a binary output. That is, it transforms a set of ( 0,1) input values into a single ( 0,1) output value according to a specific transformation rule.

37
Q

Computer Circuit

A

A circuit is a collection of logic gates that transforms a set of binary inputs into a set of binary outputs and in which the values of the outputs depend only on the current values of the inputs.

38
Q

Compare-for-equality circuit or CE circuit

A

Tests two unsigned binary numbers for exact equality. The circuit produces the value 1 ( true) if the two numbers are equal and the value 0 ( false) if they are not.

39
Q

Full added

A

An addition circuit that performs binary addition on tow unsigned N-bit integers.

40
Q

Control Circuits

A

are used not to implement arithmetic operations but to determine the order in which operations are carried out and to select the correct data values to be processed. Sequencing and decision making inside a computer.