GSS 211
INTRODUCTION TO COMPUTER
Blue print for modern computing and Charles Babbage (The father of
Analytical engine. Computer)
Augusta Ada (First Suggested binary system should be used for 1840s
Programmer) storage rather than decimal system.
George Boole Developed Boolean logic for computer 1850s
Dr. Herman Hollerith circuitry. 1890
Introduced the First electromechanical
punched-card.
2 10 R 1
2 5 R0
2 2 R1
2 1 R0
0 R1
Conversion from Hex to Decimal
• Given the Hexadecimal Number: 19FDE16
Calculating its Decimal Equivalent
Steps Hex Number Decimal Equivalent
Step 1
19FDE16 ((1 x 164) + (9 x 163) + (F x 162) + (D x 161) + (E x 160))10
Step 2
19FDE16 ((1 x 164) + (9 x 163) + (15 x 162) + (13 x 161) + (14 x 160))10
Step 3
19FDE16 (65536+ 36864 + 3840 + 208 + 14)10
Step 4
19FDE16 10646210
How to Convert from Hex to Binary
Step 1: Convert each Hex digit to 4 Binary digits
Example: Convert (4E)16 to binary:
(4)16 = (0100)2
(E)16 = (1110)2, So (4E)16 = (01001110)2
• Example 2: Convert (4A01)16 to binary:
(4)16 = (0100)2
(A)16 = (1010)2
(0)16 = (0000)2
(1)16 = (0001)2
So
(4A01)16 = (0100101000000001)2
BINARY, DECIMAL AND HEXADECIMAL ARITHMETIC
BINARY DECIMAL HEXADECIMAL
1111100 124 7C
+ 10010 + 18 + 12
10001110 142 8E
1110 1001 B7
- 0101 - 0101 + 3A
1001 0100 F1
LOGICAL OPERATIONS ON BITS
• There are 4 main logical operations on Hex and
Binary numbers:
AND: It is a dyadic operation i.e it accepts
exactly two operands. If one or both the
operands is 0, the result is 0, else is 1.
OR(Inclusive-OR): If one of the operands or
both is 1, the result is 1 else is 0. it is also dyadic.
XOR (exclusive-or): If both operands is the
same, the result is 0, else is 1. it is also dyadic.
NOT: It is a Monadic i.e it accepts only one
operand.
SIGNED AND UNSIGNED NUMBERS
• Negative values is rept -128……..-1
• Positive values is rept 0………….127 i.e with 8bits
• In general, with n-bits, we can rept, the signed
values in the range 2 (n-1) to +2 (n-1) -1
• NEGATIVE NUMBERS
• The 4 common representations for signed
binary numbers are:
• Sign-and-magnitude
• Excess
• 1’s complement
• 2’s complement
SIGN-AND-MAGNITUDE
• The prefix bit is used to indicate the sign of
the no.
• i.e A Positive value sign bit = 0, While
• negative value sign bit = 1.
• Example 1: 8 bit sign-and-magnitude rept of
-75 is 11001011
• Example 2: 8 bit sign-and-magnitude rept of
-82 is 11010010
• An 8-bit sign-and-magnitude allows values
b/w -127 to +127
1’S COMPLEMENT 8-bits binary system
• For positive values, the 1’s complement is the
same as the binary representation.
• E.g 75 = 01001011 both in binary and 8-bit 1’s
complement system.
• Given a number X in n-bits binary number,
• -X = 2n -X-1, where n = 8
• E.g: 75 = (01001011)2 in an 8-bit binary system
-75 = (10110100)1s in the 8-bits 1’s complement
N/B: Invert all the bits in binary to get the 1’s
complement.
2’S COMPLEMENT 8-bits binary system
• For positive values, the 2’s complement is the
same as the binary representation.
• Given a number X in n-bits binary number,
• -X = 2n -X, where n = 8
• E.g: 75 = (01001011)2 in an 8-bit binary
system
• -75 = (10110101)2s in the 8-bits 2’s complement
• i.e Using the formula above;
• 28 – 75 = 256 – 75 = 181(10110101)
• -75 = 181= (10110101)2s
RULES FOR 2’S COMPLEMENT 8-Bits
• Given any number, to get the 2’s complement, do
the following:
• Step 1: Get the 8-bits binary equivalent of the
number without the sign
• Step 2: Invert all the bits in binary to get the
negative value of the number ( i.e 1’s
complement)
• Step 3: Add 1 to the inverted bits to get the
2’s complement.
• N/B: 2’s Complement = 1’s Complement + 1
RADIX COMPLEMENT
• In the decimal number system, the radix
complement is the 10’s complement.
• Therefore, the 10’s complement of the
number N is obtained by subtracting each
digit of the number from 9 and then adding 1
to the LRD of the number so formed.
• E.g 1: Find the Radix complement of 22?
99 – 22 = 77 + 1 = 78
• E.g 2: Find the Radix complement of 948
999 – 948 = 51 +1 = 52
DIMINISHED RADIX COMPLEMENT
• In the decimal number system the
diminished radix complement is 9’s
complement. This is obtained by subtracting
each digit of the number from 9.
• E.g 1: Find the Diminished Radix complement
of 22?
99 – 22 = 77
• E.g 2: Find the Radix complement of 948
999 – 948 = 51
ADDITION IN 1’S COMPLEMENT 4-bits
TYPES OF MONITORS
CRT (Cathode Ray Tube)
LCD (Liquid Crystal Display)
LED (Light Emitting Diode)
BASIC MONITOR TERMINOLOGIES
• Display size: screen size (measured diagonally for
LCD and plasma. Display aspect ratio.
• Flat Screen and Flat Panel: flat screen is
applicable to CRT monitors and flat panel is
applicable to LCD and LED.
• Digital and HDTV signals: DTV signals are
transmitted as a stream of digital data represented by
patterns of 1’s and 0’s.
The lowest level- standard definition digital(SDTV)
Highest level – High definition digital signal
• Pixel: pixel are substances that helps in producing
images on the computer using small dots, each dot
contains tiny red, green and blue tread.
• Resolution and Dot pitch: The smaller and closer
the pixels are to one another, the clearer the picture
appears.
• Screen size and viewing distance: resolution for
monitors
• Screen-aspect ratio: this is resolution imposition i.e
against the native resolution. N/B it is not
applicable to LCD monitors.
• Refresh rate and frame rate: Refresh rate is the no
of times a complete image is drawn on the screen
per second, while frame rate signifies how often the
image being displayed is repeated per fraction of
second before it is changed.
• Progressive scan and interlaced scan: this has to do
with pictures/image formation.
• Contrast ratio and brightness: contrast ratio
compares b/w white and black pixels, while
brightness is a measurement of the amount of light
produced by the monitor. Low brightness is often
recommended.
• Viewing angle: acceptable horizontal viewing angle
is 110 degrees for a person.
Comparison table for Monitors
Low speed and low quality text High speed and high quality text
Dot Matrix Print head, 9-24 pins and solenoids. Not expensive. 600-36,000 characters
Daisy wheel Daisy(petal) wheel, servo motor. It does not print 1,500-3,300
graphics, and it prints similar to a typewriter. characters
Line Printers 1,200-6,000 lines
USB CONNECTORS
• There are several types of USB connectors.
• Any connector mounted on the host or device is
called the receptacles, and the connector
attached to the cable is called the plug.
• Recently, we have 7 USB connectors namely;
• Standard-A
• Standard-B
• Mini-A
• Mini-B
• Micro-A
• Micro-AB
• Micro-B
COMPUTER NETWORKS
• Network: A Network refers to any interconnected
group of people or things capable of sharing
meaningful information with one another.
• E.g A Network of Lawyers, Lecturers, or a network of
computers (Here, computers are the things sharing the
meaningful information.
• Computer Network refers to a collection of computers
and devices connected by a communication channels.
• In addition to data sharing, computer networks can also
share resources like Printers, Scanners etc.
• Node: This refers to any computer or digital device
using the network. E.g 10 nodes in a network.
• Links: are the physical connections
(wired/wireless) that carry messages b/w nodes.
• Standalone System: this refers to a machine
/computer that is not connected with other
devices.
• Peer-to-Peer Network: This is a computer
network with no dedicated server.
• Client-Server network: This is a computer
network whereby one or more systems(Server)
perform critical functions on behalf of the other
systems(Client). E.g User authentication,
databases etc as in Banks, Institutions etc.
NETWORK TOPOLOGY(ARCHITECTURE)
• This refers to the layout pattern/arrangement of the
various element (Links, nodes etc) of a computer
network.
• This arrangement can be classified into two;
• Physical Topology: This refers to the physical
placement of the network various components, like
the device location, cable installation etc.
• Logical Topology: This shows how data flows within a
network, regardless of its physical design or
placement.
• N/B: The physical topology b/w two or more nodes in
network might be the same, yet they are logically
different and vice versa.
TYPES OF NETWORK TOPOLOGIES
• There are different kinds of network topologies in
a computer network, these includes;
• Point-to-Point: This is the simplest form of
network topology. It is faster and more reliable
because there is a direct link b/w two nodes. It
can only be implemented in a small area where
nodes are in close proximity. E.g A cyber café.
• Bus Topology: Here, one main cable acts as a
backbone for the network, and all nodes are
directly connected to that main cable.
• Star Topology: Each node is connected to the
central hub, using a point-to-point link.
• Ring Topology: Here, the computers in a network
are connected in a circular fashion and the data
travels in one direction. Each computer is logically
connected to the next computer, forming a single
pathway for signals through the network.
• Mesh Topology: Here, every node has a direct
Point-to-point connection to every othe node in
the network.
• Tree Topology: This combines multiple star
topologies onto a Bus.
TOPOLOGIES COMPARISON TABLE
TYPES ADVANTAGES DISADVANTAGES
P-TO-P • It is very simple and easy to install • Not suitable for large network
structure
BUS •Easy to install •Not Robust
•Low cost of installation •Difficult to troubleshoot
• Not suitable for large network
structure
STAR •Low startup cost •More expensive than Bus structure(
•Accommodates expansion(nodes) b/cos it requires more cables)
•Robust in nature
RING •Easy to install and troubleshoot •Not suitable for expansion(nodes)
•Data can travel over long distances •Not Robust