Professional Documents
Culture Documents
Computer system
Computer System
Control Unit
Main Memory
Backing Storage
Control signals
Data flow
Components of a CS.
2. Input units
- Used to enter data( raw unprocessed facts) and instructions to
the computer.
3. Output units
- Used for delevering the processed result from the computer in
useful form.
4. Backing storage units
4
- Backing storage units need for high capacity data storage
devices that can store data in a more permanent form for later
retrieral, updating and referencing.
- Backing storage is also called secondary storage external
storage and auxiliary storage.
Chapter 2: MICOPROCESSOR.
Question 1. Cache Memory?
- Cache memory is a small amount of very fast store with faster
access time than the main memory.
- Cache memory is used to temporaryty store data instructions
that are likely to be retrieved many times, thus speeds up the
processing of data.
- Sits between main storage and the processor acting as holding
area through which all data and instructions pass.
- Old data in the cache memory is over written by new then cache
is full.
Question 2. Virtual Memory?
- Virtual memory makes use of both the main memory and
backing store.
- In a virtual memory sys, each user has the illusion that his
program is in the main memory all the time.
- The sys maintains this illusion by keeping some of the “unused”
portion of the program’s code and data on a backing store device
which is usually magnetic disk
- The movement of the unused portion from the backing store to
the mian memory is transparent to the users.
- Please refer to diagram for virtual memory.
A3
A2
A1
A3
A2 A1
Virtual Memory
2 1 40 15 8
1
0 7
1
(7690)10 = (17012)8
- Hexadecimal:
6396 16
159 399 16
1 156 79 24 16
2 1 8 1
2 5 1 1
1
C F
(6369)10 = (CF81)16
2. Convert to others from binary
- To decimal
(101010)2 (?)10
1.25 + 0.24 + 1.23 + 0.22 + 1.21 + 0.20 = 42
(101010)2 = (42)10
17
- To octal
100101101
1st step change into denary
= 1.28 + 1.25 + 1.23 + 1.22 + 1.20
= 256 + 32 + 8 + 4 + 1
=(301)10
2nd step: convert to octal
301 8
61 37 8
5 5 4
(301)10 = (455)8 (100101101)2 = (455)8
- To hexadecimal
110111011011
1st step
= 1.211 + 1.210 + 1.28 + 1.27 + 1.26 + 1.24 + 1.23 +
1.21 + 1.20
= 2048+ 1024 + 256 + 158 + 64 + 16 + 8 + 2 + 1
= (3547)10
2 step
nd
3547 16
384 221 16
27 1 61
1 1 3
1 3
247 1
123 1
61 1
30 1
15 1
7 1
3 1
1 1
0 1
(247)10 = (11110111)2
= 0. 1111011 x 2
normalized exponential form
Question 3. Integer and Floating – point arithmetic?
18
1. Floating – point Addition
a. (0.1011 x 25 ) + (0.1001 x 25 )
= (0.1011 + 0. 1001) x 25
= 1.0100 x 25
= 0.10100 x 26
b. (0.1001 x 23 ) + (0.1110 x 25 )
= (0.001001 x 25 ) + (0.1110 x 25 )
= (0.001001 + 0.111000) x 25
= 1.000001 x 25
= 0.1000 x 26 (here have truncation)
(0.1000001 x 26 )
2. Floating – point subtraction
a. (0.1110 x 27 ) – (0.1100 x 27 )
= 0.0010 x 2 7
= 0. 10 x 25
(0.1001 x 28 ) – ( 0.1000 x 25 )
= (0.1001 x 28 ) – ( 0.0001 x 28 )
= 0.1000 x 28
3. Floating – point multiplication
(0.1010 x 23 ) x (0.1100 x 23 )
= (0.1010 x 0.1100) x 26
= 0.01111 x 26
= 0.1111 x 25
(0.11110 x 2 )
3
x ((0.01011) x 24 )
= (0.11110 x 0. 01011) x 27
= 0.001111 x 27
= 0.1111 x 25
4. Floating – point division.
(0.11010 x 26) : (0.001 x 26)
= (0.11010 x 26) : (1 x 23)
= 0.1101 x 26 : 1x 23
= 0.1101 x 2 3
1234
5
Data item
12345
Da
ta item
Main storage
Direct addressing
Indirect addressing
3. Indexed addressing
- The main applications of this type of addressing technique is to
enable to access of sequential locations in memory that are
adjacent to each other
- Each adjcent memory address has value n+1, where n is the
address of the previous location
- When the first of the location have been accessed, the next
memory location in sequence is accessed by simply increasing
the add of the present location by 1 & using accessing it
- The starting address of the series of locations is specified in the
operand of the instruction
- In order to access the next location in sequence, the content of
the index register is increased by 1 a added to the opreand
address
- This is done repeatedly until the last memory location in the
series is processed
20
Indexed addressing.
OP – CODE OPERAND
Index Register
Chapter 6: TRANSLATORS.
Question 1. Translators?
1. Assemblers
• Def: A program that translates assembly language into machine
code. Dos machine instruction is generated for each source instruction
- The resulting program ran only be executed when the assembly
process is completed
• Operation:
- Translates mnemonic operation codes into machine code &
symbolic address into machine address
- Includes the neressary linkages for closed subroutines and
inserts appropriate machine code for macros
- Allocates area of storage
- Detects and indicates valid source language instruction
- Procedures the object program on tape or disk required
- The lesting may also include error codes if appropriate. To
illustrate the methods used just think about an assembly
program. We must first look at the directives
A directive is used to control the assembly process, it
is not asembled but is obeyed by the assembler
when it is encouteded, e.g ”END”, is sometimes
called a pseudo-operation code on pseudo-opcode
2. Interpreter
A program which translates and executes each source statement in logical
sequence as the program one instruction at a time, completely translating
and executing each instruction before it goes onto the next
- Interpreter, which deals with the source program one instruction
at a time, completely translating and executing each instruction
before it goes onto the next
- Interpreter seldom produce object code but call upon inbuilt
routines instead
- Some intermediate code is usually produced tempororily
- If an interpreter is used, the source program will be translated
every time the program is executed
- Interpreters are widely used, particular for the programming
language Basic on small computers
• Interpriter are used for such things as:
- Handling user commands in an interactive sys
- Debugging programs as they run
- Handling software produced for or by a different computer
3. Compilers:
24
A program that translates HLL into a machine orientated language, often the
machine code. Many machine instructions are generated for each source
statement
- The compiler:
Translates the source program statements into
machine code
Includes linkage for closed subroutines
Allcocates areas of main storage
Generates the object program on cards, tape and
disc as required
Produces a printed listing of the source and objected
programs when required
Tabulates a lish of errors found during compilation
- Compilers are commonly used for the translation of HLL program
- Compiler translates the whole of the HLL source program into a
machine code object program prior to the program being loaded
into main memory and executed
- If a compiler is used, the same program need only be translated
once
• Stages of compilation
lexical analysis
systatical analysis
code generation
Chapter 7: SOFTWARE.
Question 1. Application software?
- Application software comprises the programs that are written
specifically to achieve resulting appertaining to the company’s
activities
- Application software comes from two source
They produce by themselves
Buy from an external agency
1. Ads and dis of using application packages in house
Ads
- The requirements of the application are more easily met
- There is more control in testing and debugging
- The more control over the usage and support obtained
Dis
- There is a waiting period before the application can be
implemented
- Development cost is higher than buying a package
2. Ads and dis of using application package
Ads:
- The packages can be used immediately
- Documentation is generally good
- It can be used on a varisty of machines
25
- It is cheaper as the costs of the packages are shared between
many users
- Comprehensive on line help information and guided tutorials
available
- Easily remembered command syntax
- Can be used in confunction with other software in an integrated
fashion
Dis:
- Modifications may be difficult for some applications
- Package may be two generalized to suit user needs
- Some features purchased may not be required
- Support given depends on stability and professionalison of the
vendor
- User are required to comply with the owner’s regulations
Question 2. Utility software?
- Certain processing is common to a high proportion of computer
users, and so utility software has been created to cater for this
need
- Utility software is intended to be sufficiently flexible to meet
most user’s requirements and is tailored to meet their precise
needs by means of parameter entered prior to use
- Some of the utility programs described below may be
incorporated into the OS that is used with a particular computer
File conversion: this convers the transference of data
from any medium to any other
File copying: an exact copy of a data set is made on
to another lot for the same type of storage medium
File reorganisation: direct access, files over flow
records are stored in designed blocked, this is
acceptable up to a point but from time it si necessary
to reorganise the file so as to remove the overflow
File maintenance(amendment): this procedure
involves the straightforward insertion and deletion of
records into or form sequential files
Sorting: is frequently necessary in order to arrange a
set of records into a certain sequence based on their
key values
Dumping routines: a dump routine is used in
confunction with a restfirt program ...
House keeping operations: there are programs or
parts of a programs not directly concerned with the
solution of the problem in hand
Trace routines: these entails, the dumping, display or
printing of th program or other contents of the main
store during program testing to facilitate error
detection
- Utilitys are commonly used to perform these functions:
26
Copying of files
Sorting of data
Merging of files
Data recovery
Reformating of records by reamanging their fields
File reorganization
Reporting of sys status and usages
Question 3. System software?
There are three main types of memory placement policy:
- First fit
- Best fit
- Worst fit
1. First fit policy, an incoming job is placed in the first available free
space large enough to fit it. This allows the placement decision to be
made quickly
2. Best fit policy, an incoming job is placed in the free space in which it
fits most tightly
3. Worst fit policy, an incoming job is placed in the largest possible hole
of free space
Question 4. Types of scheduling?
- Scheduling of job is also an important part of any OS. It involves
keeping track of and deciding which job is to be executed
- Types of scheduling
Deadline scheduling
First in first out scheduling(FIFO)
Round robin scheduling
Shortest job first(STF) scheduling
Shortest remaining time scheduling(SRT)
- More details about types of scheduling
In deadline scheduling certains are scheduled to be
completed by a specifir time or deadline. Deadline
scheduling can be very complex requiring substantial
overhead in resource management
FIFO scheduling: processes are dispatched according
to their arrival time in the ready queue. This type of
Round robin scheduling is similar to FIFO scheduling
but the difference lies in that each job is given a slice
of CPU time
SJF scheduling: shorter jobs are more favoured than
longer one. SJF selects job that ensures the next jobs
will complete & leave the sys as soon as possible
SRT scheduling: the job will the smallest estimated
remaining run time is executed first. In SRT, a
running job may be replaced by a new job with a
shorter estimated run time
Chapter 8: MEMORY MANAGEMENT.
Question 1. Virtual Storage System?
27
- Instructions and data not currently needed might even be stored
on the disk and thus free up a portion memory
- Virtual storage systems have evolved to meet these needs.
Virtual storage systems allow programs to be as large as
necessary, even larger that the physical storage capacity of the
computer
- Translating the user’s view of the program into the physical
reality of computer storage is one of the major task performed
by virtual memory OS like IBM’s MVS and digital VMS
- Virtual storage system included non paged systems
Paged systems
Chapter 9: NETWORKING.
Question 1. Types of network layout?
Network topology is the name given to the various types of network layout
1. Start network(or centralised network)
- This network all communications go through a central node
Node A
Node D
Central(Hub) active
Passtive
Node C
Node B
- The centra of star network is the hub which performs the
function of routing msgs and data within the network
- The hub manages & senvices all incoming and outgoing
communication traffic. It’s also provide info services from a large
central data bases
2. Mesh network (or distributed network)
- This network may be fully connected or partially connected
A
E B
D C
- Data can get from one node to another node via different route
- Multi point to point
3. Ring network( or loop network)
A B
28
D C
- Work stations connect to the ring
- More cabling requiring than BUS
- The connectors used with a lot of problem
- Cable is used UTP, STP
4. Bus network( or multidrop network)
A B
Modem modem
Digital signal analog signal
OR
Computer Modem Computer Modem
This method means that’s data can be transmitted in both directions, but is
only on direction at a time
c. Full duplex trasmission
S S S S
T T T T
A 11000001 O 1111111 A 11000010 O
R P R P
T T
Synchronous:
- The speed of transmission is much faster
- Transmission groups of character can be send down the line
without the start and stop bits
Direction of transmission
000111000001011100000011
Question 3. LAN_Local Area Networks?
• Def: A LAN is a communication network in that connects office
equipment to provide a variety of data communication service
which features high transmission rates and low error rates
• Characteristics:
- Utilisation of some type of switching topology
- Locality restricted to a few miles or in the same bulding
- Proprietorship by a single organisation
• Features:
30
- LAN is after used in offices & it connects of fire equipment to
provide a variety of data communication. Service with light
transmission rate and low errors rate
- The majorities of LANs are connected by coxial cable, and the
protocol(rule for communication) is very simple
• Three other important aspects of LANs:
- Acess method (protocol)
Central control
CSMA_CD
Empty slot access
Token access/token passing
• LAN transmission modes:
There are 2 main types of LAN transmission modes
a. Baseband transmission: is essentially & binary method, each bit
being represented by one of two states of an electric pulse
passing through the network.
Baseband is nevertheless suitable for most LANs, and is the
mode employed by Ethernet and Cambridge Ring network
b. Broadband transmission: the data is modulates into a carrier
wave. Broadband transmission has a much greater band width
than baseband, it can transmit sth like ten times as much in a
given time
• LAN is one of the distributed processing designs
- LAN are considered loosely coupled system processors are
located in separate machines and communicate at relatively low
speeds
- LAN is the means by which distribution takes places, regardless
of what are distributed
Chapter 10: DATA COMMUNICATIONS.
Question 1. Write a short note of?
1. Communication is an extensive subject in its own right, encompassing
not only data transmission but also sound and video transmission via
telephone lines, radio links and satellite links.
2. Multiplexing is a means of combining together data from several
sources so that it can be transmitted along one comminication line
3. Front – end processing: A front – end processor is usually a
minicomputer or a microcomputer interposed between the main
computer and the multiplexor
Its purpose is to relieve the host computer from the bunden of
communications housekeeping
4. Concentrators are device used to gather the bit from each terminal or
group of terminal and hold them on buffer store unit until there are
sufficient to justify forward transmission
5. Protocol is an “agreement” where by devices can communicate is a
fully understand manner
6. Multidrop line<multipoint line> has several terminals on concentrator
attached to it
31
7. Distributed data processing sys is one of which interconnected points
at which processing power and storage capacity are availble
Question 2. Fibre Optics?
• Fibre optics is that data and other information is transmitted in the
form of light through very fine glass fibres
• Ads:
- High bandwidth eg data transmission capacity
- Low cross – talk eg interference between adjacent fibres
- Low attenuation eg loss of signal strength
- Freedom from interference from external electrical and
electromagnetic equipment
- High reliability
- Safe because no heat, sparks or electrical voltages are created
- Economic because glass is loss expensive than copper
Chapter 11: DISTRIBUTED PROCESSING.
Question 1. Client/ Server Model?
- It’s common way to employ distributed processing that is client/server
architecture which splits into components
- Server store & main palates the actual data & provide secenity, losting
function transaction logging recovery capabilities
- Client/ server model seems like PC lan each server support more users
- Data request in form of SQL(structure quenf language) command
travel across the network from client to server
Client Server
Database
Request
LAN Response
Question 2. File sharing VS client server?
Network
Application
tool
process
Application
tool Database
process
Client Server
The file sharing model
Network
Database Database
engine engine Database
process process
Interface Interface
The client/ server model
Application Application
TCP TCP
O IP O IP
S S
Network access Network access
protocol 1 protocol 2
IP
Network 1 NAP 1 Network 2
Netwo
NAP2
Contents
CHAPTER 2 MICROPROCESSOR.....................................................................3
CHAPTER 6 TRANSLATORS..........................................................................20
CHAPTER 7 SOFTWARE...............................................................................21
CHAPTER 9 NETWORKING...........................................................................23