DP Ss3 Note First Term
DP Ss3 Note First Term
1. INDEXES
2. DATA SECURITY
3. DATA SECURITY 2
4. CRASH RECOVERY
7. NETWORKING
8. NETWORKING 2
9. NETWORKING 3
CONTENT
An Index is a copy of database table that has been reduced to certain fields and the copy is
always in sorted form. The index also contains a pointer to the corresponding record of the
actual table so that the fields not contained in the index can also be read. Index contains a
value and a pointer to first record that contains data value.
A Database Index is a data structure that speeds up certain operation on a file. The Operation
involves a search key which is the set of record files (in most cases a single field). The elements
of an index are called data entries. Data entries can be actual data record. A given file
of data records can have several indexes, each with different search keys as showed in the table
below.
The search engine searches for a value in table or file in two ways. The table scan which is
sequential and index which is random.
Indexes are special lookup tables that the database engine uses to speed up data retrieval. An
index in a database is similar to an index in the back of a book.
An index table or file consists of records called index entries. It is of the form
The search key field is used to sort the rows (in the index column) and the pointer field (in index
column) indicates where the actual data in the table will be retrieved. When a table has an
index it simply means the records in that table has been sorted in one way or the other.
Indexes are automatically created when primary key and unique constraints are defined on
table columns.
Index Classification
Clustered index is an index whose sorting order determines the order of how the rows/records
in a table are stored. There could be only one clustered index in a table because there could
always be one way of arranging the records in a table at a given time. For example, if you are
asked to arrange some tables in a room, you could arrange them in a round form, row form or
packed them close together, only one way at a time. Clustered index also means that related
values in a table are stored close to each other according to the order of the index. A Clustered
index is when a file is organized so that the ordering of data records is the same as or closes to
the ordering of data entries. A clustered index can take place only if the data records are sorted
on the search key field. For example, suppose that students records are sorted by age; an index
on age that stores data entries in sorted order by age is a clustered index.
Indexes that maintain data entries in sorted order by search key use a collection of index
entries, organized into a tree structure to guide searches for data entries. Thus, clustered
indexes are relatively expensive to maintain when the file is updated, when data entries are to
be moved across pages, and if records are identified by a combination of page id and slot as is
often the case, all places in the database that point to a moved record must also be updated to
point to the new location. These additional updates can be time consuming.
Unclustered Index
This an index whose sorting order does not determine the order of how the rows/records in a
table are stored. This means that the search keys in the index column is sorted in one order
while the actual records or rows are sorted in another order or are not sorted at all.
This is an index that is not clustered. A data file can contain several unclustered index. For
example, supposing that students records are sorted by age; and if additional index on GPA
field is included, it is called unclustered index.
This is said to be dense if it contains (at least) one data entry for every search key value that
appears in a record in the indexed file.
In a dense index, index record appears for every search key value in the file or table. That is
every search key in the index column has a particular record it will point to in the table or file.
Sparse Index
A Sparse Index contains one entry for each page of records in the data file. The index record
contains the search key and a pointer to the first data record with that search key value. A
Sparse index must be clustered and it is smaller than a dense index.
Primary index is an index defined on a primary key column(s) of a relation with unique
constraint which guarantee that the field will not contain duplicate values and determine the
order of how the records are physically stored on the disk. Note that this is also called clustered
index.
This is an index on a set of fields that includes the primary key. Primary index contains records
that are usually clustered. A primary index is created for the primary key of a table.
Secondary Index
Secondary index is an index defined on a non-key field which may contain duplicate values and
as such does not determine the order of how the records are physically stored on a disk. It is
also called non-clustered index.
For example, in student database, student ID is used to look up for a student as the key,
however, one might want to look up for a student using Last Name by creating secondary index
on that column.
Secondary index is an index that is not a primary index i.e. it does not include primary key.
Secondary index can be created on non- key attribute. It contains duplicate data entries.
A Unique index is an index in which the search key contains some candidate key.
Composite search keys or concatenated keys are when the search key for an index contain
several fields. For example, considering a collection of employee records with field name, age
and salary stored in sorted order by name. if the search key is composite, an equality query is
one in which each field in the search key is bound to a constant. For example, we can ask to
retrieve all data entries with age = 20 and sal = 10, the hashed file organization supports only
equality queries since a hash function identifies the bucket containing desired records only if a
value is specified for each field in the search key.
The search key for an index can contain several fields, such keys are called Composite Search
Keys or Concatenated Keys.
Range Queryis the one in which not all fields in the search key are bound to constants. For
example, we can ask to retrieve all data entries with age = 20; this query implies that any value
is acceptable for the sal fields. Another example of a range query is when ask to retrieve
all data entries with age < 30 and sal > 40
GENERAL EVALUATION
Class Task
1. ………. is a database table that has been reduced to certain fields. a) Table b) An index c)
Table model d) Network model
2. The copy of an index is always in …… form. a) duplicate b) field c) sorted d) domain
3. The ………… index can take place only if the data records are sorted on the search key
field. a) unclustered (b)insert (c) update (d) clustered
4. A …………….. can contain several unclustered indexes a) data file b) primary c) check d)
index
5. Index contain a value and ……. (a) pointer (b) sign (c) update (d) model
6. ………. is an index in which the search key contains some candidate key. a) Unique index
b) An index c) composite d) sparse index
7. …… can be created on a non- key attribute. a) primary index b) dense index c)
secondary index d) sparse index
8. A sparse index contains one entry for each ……of records in the data file. a) page b) table
c) row d) column
9. ………is the one in which not all fields in the Search key are bound to constant. a) dense
index b) composite search key c) secondary index d) range query
10. ……. is when the search key for an index contain several fields. a) primary index b)
composite search key c) secondary index d) unique index
11. Differentiate between a unique index and a range query.
Ticket-Out
1. What is an index?
2. What are data entries?
3. Differentiate between clustered index and unclustered index.
4. State two reasons why clustered index is expensive to maintain.
5. Distinguish between dense index and sparse index
6. Explain primary and secondary index
7. Create a student table with the following fields: name, age, and scores of 5 records.
Create an index using a composite keys name and age. (show the table and SQL
statements)
CONTENT
What is Database Security? Database Security concerns the use of a broad range of information security
controls to protect database against compromise of their integrity, confidentiality and availability.
What is Data Security? Data security is the practice of keeping data protected from corruption
and unauthorized access. The focus behind data security is to ensure privacy while protecting
personal or corporate data.
It is a means of putting in place the different form of information security controls to protect
database against compromise of their confidentiality, integrity and availability.
1. Risk Assessment: This will enable you to identify the risks you are faced with and what could
happen if valuable data is lost through theft, malware infection or a system crash.
2. Securing Data: Since data can be compromised in many ways, the best security against misuse
or theft involves a combination of technical measures, physical security and a well-educated
staff. You should implement clearly defined polices into your infrastructure and effectively
present them to the staff.
3. Data security is critical for most business and even home computer users. Client information,
payment information, personal files, bank account details- all this information can be hard to
replace and potentially dangerous if it falls into the wrong hands. Data lost due to disaster such
as a flood of fire is crushing, but losing it to hackers or a malware infection can have much
greater consequences.
Access Control
1. Access Control: Is the selective restriction of access to a place or other resource. The act of
accessing may mean consuming, entering, or using. Permission to access a resource is called
authorization.
2. Auditing: Database auditing involves observing a database so as to be aware of the actions of
database users. Database administrators and consultants often set up auditing
for security purposes, for example, to ensure that those without the permission to access
information do not access it.
3. Authentication: Is the validation control that allows you to log into a system, email or
blog account etc. Once logged in, you have various privileges until logging out. Some systems
will cancel a session if your machine has been idle for a certain amount of time, requiring that
you prove authentication once again to re-enter. You can log in using multiple factors such as a
password, a smart card or even a fingerprint.
4. Encryption: This security mechanism uses mathematical scheme and algorithms to
scramble data into unreadable text. It can only be decoded or decrypted by the party that
possesses the associated key.
Integrity Control
5. Backup: This is the process of making copy and archiving of computer data in the event
of data loss which is used to restore the original data. Backups have two distinct purposes. The
primary purpose is to recover data after its loss, be it by data deletion or corruption. The
secondary purpose of backups is to recover data from an earlier time, according to a user-
defined data retention policy, typically configured within a backup application for how long
copies of data are required. Backup is just one of the disaster recovery plans.
Application Security
Application security is the use of software, hardware and procedural methods to protect
application from external threats.
Class Task
CONTENT
Class Task
Ticket-Out
1. …..……… is the computer professional responsible for the configuration, administration and
maintenance of a database (a) Programmer (b) System administrator (c) Database
administrator (d) System analyst
2. Mention five (5) duties of a database administrator
SUBJECT: DATA PROCESSING
WEEK FOUR
DURATION: 45 MINUTES
TOPIC: CRASH RECOVERY
INSTRUCTIONAL MATERIALS: CLASSIC COMPUTER STUDIES BOOK 1, TUTORIAL VIDEOS &
PICTURE MATERIALS
OBJECTIVES: at the end of the lesson, learners should be able to:
1. Ensure data integrity by recovering data loss after crash
CONTENT
Crash recovery is the process by which the database is moved back to a consistent and usable
state. This is done by rolling back incomplete transactions and completing committed
transactions that were still in memory when the crash occurred. When the database is in a
consistent and usable state, it has attained what is known as a point of consistency. Following a
transaction failure, the database must be recovered.
1. A power failure on the machine causing the database manager and the database partitions
on it to go down.
This is a recovery algorithm designed to work with no-force, steal database approach. It is used
by IBM DB2, MS SQL Server and many other database systems.
The three main principles that lie behind ARIES recovery algorithm
1. Write Ahead Logging: Any change to an object is first recorded in the log, and then the log must
be written to a stable storage before changes to the object are written to a disk.
2. Repeating History during Redo: On restart, after a crash, ARIES retraces the actions of a
database before the crash and brings the system back to the exact state that it was in before
the crash. The n it undoes the transaction still active at crash time.
3. Logging Changes during Undo: Change made to the database while undoing transactions are
logged to ensure such an action isn’t repeated in the event of repeated restarts.
1. Analysis Phase: The first phase, analysis, computes all the necessary information from the log
file.
2. REDO Phase: The Redo phase restores the database to the exact state at the crash, including all
the changes of uncommitted transactions that were running at that point time.
3. UNDO Phase: The undo phase then undoes all uncommitted changes, leaving the database in a
consistent state. After the redo phase the database reflects the exact state at the crash.
However, the changes of uncommitted transactions have to be undone to restore the database
to a consistent state.
THE WRITE-AHEAD LOG PROTOCOL: Write Ahead Logging (WAL) is family of techniques for
providing atomicity and durability (two of the ACID properties) in database systems. In a system
using WAL, all modifications are written to a log before they are applied. Usually both redo and
undo information is stored in the log. WAL allows updates of a database to be done in one
place.
ATOMICITY: This is the property of transaction processing whereby either all the operations of
transactions are executed or none of them are executed (all-or-nothing)
DURABILITY: This is the ACID property which guarantees that transactions that have committed
will survive permanently.
LOG: A transaction log (also transaction journal, database log, binary log or audit trail) is
a history of actions executed by a database management system to guarantee ACID properties
over crashes or hardware failure. Physically, a log is a file of updates done to the database,
stored in stable storage.
CHECK POINTING: Check pointing is basically consists of storing a snapshot of the current
application state, and later on, use it for restarting the execution in case of failure. A check
point record is written into the log periodically at that point when the system writes out to the
database on disk all DBMS buffers that have been modified. This is a periodic operation that can
reduce the time for recovery from a crash.
Check points are used to make recovery more efficient and to control the reuse of primary and
secondary log files. In the case of crash, backup files will be used to recover the database to the
point of crash.
Media Recovery
Media recovery deals with failure of the storage media holding the permanent database, in
particular disk failures. The traditional database approach for media recovery uses archive
copies (dumps) of the database as well as archive logs. Archive copies represent snapshots of
the database and are periodically taken.
The archive log contains the log records for all committed changes which are not yet reflected
in the archive copy. In the event of a media failure, the current database can be reconstructed
by using the latest archive copy and redoing all changes in chronological order from the archive
log.
A faster recovery from disk failures is supported by disk organizations like RAID (redundant
arrays of independent disks) which store data redundantly on several disks. However, they do
not eliminate the need for archive based media recovery since they cannot completely rule out
the possibility of data loss, e.g. when multiple disk fail.
Class Task
Ticket-Out
1. Explain the following terms in crash recovery (i) Media recovery (ii) Check point (iii) The Write –
Ahead log protocol
2. Discuss the concepts of ARIES in crash recovery.
3. Discuss the concept of ARIES in crash recovery.
4. Explain the difference between media recovery and check point.
5. Explain the difference between a system crash and a media failure.
SUBJECT: DATA PROCESSING
WEEK FIVE
DURATION: 45 MINUTES
TOPIC: PARALLEL AND DISTRIBUTED DATABASES
INSTRUCTIONAL MATERIALS: CLASSIC COMPUTER STUDIES BOOK 1, TUTORIAL VIDEOS &
PICTURE MATERIALS
OBJECTIVES: at the end of the lesson, learners should be able to:
1. Define what parallel and distributed database is.
CONTENT
Parallel database
Shared memory architecture - Where multiple processors share the main memory (RAM)space
but each processor has its own disk (HDD). If many processes run simultaneously, the speed is
reduced, the same as a computer when many parallel tasks run and the computer slows down.
Shared disk architecture - Where each node has its own main memory, but all nodes share
mass storage, usually a storage area network. In practice, each node usually also has multiple
processors.
Shared nothing architecture - Where each node has its own mass storage as well as main
memory.
The Benefits of Parallel Database
1. Higher Performance - more CPUs available to an application, higher speedup and scaleup can
be attained.
2. Higher Availability - Nodes are isolated from each other, so a failure at one node does not bring
the whole system down.
3. Greater Flexibility - An OPS environment is extremely flexible. Instances can be allocated or de-
allocated as necessary.
4. More Users - Parallel database technology can make it possible to overcome memory limits,
enabling a single system to serve thousands of users.
Distributed Database
In a distributed database, data is stored in different systems across a network. For Example, in
mainframes, personal computers, laptops, cell phones, etc.
1. In a distributed database, data can be stored in different systems like personal computers,
servers, mainframes, etc.
2. A user doesn’t know where the data is located physically. Database presents the data to the
user as if it were located locally.
3. Database can be accessed over different networks.
4. Data can be joined and updated from different tables which are located on different machines.
5. Even if a system fails the integrity of the distributed database is maintained.
6. A distributed database is secure.
Ticket-Out
CONTENT
Architectural Models
1. Client-server model Architecture for DDBMS: The system is structured as a set of processes,
called servers that offer services to the users, called clients.
A server can itself request services from other servers; thus, in this new relation, the server itself
acts like a client
2. Peer – to – Peer Architecture for DDBMS: All processes (objects) play similar role.
Processes (objects) interact without particular distinction between clients and servers.
The pattern of communication depends on the particular application.
A large number of data objects are shared; any individual computer holds only a small
part of the application database.
Processing and communication loads for access to objects are distributed across many
computers and access links.
Data Replication
Data replication is a database management technique that involves creating and maintaining
multiple copies of data across distributed locations or nodes in a networked environment. This
redundancy is introduced for various reasons, including improving data availability, fault
tolerance, and performance. Here are some key aspects of data replication:
High Availability: Data replication ensures that data is available even in the event of
hardware failures or network issues. If one copy of the data becomes unavailable,
applications can still access the data from another replica.
Fault Tolerance: Replication enhances fault tolerance by providing backup copies of
data. If one replica fails, the system can continue to operate using other available
replicas.
Load Balancing and Performance: Multiple replicas of data can be used to distribute
read and write operations, reducing the load on individual database servers and
improving overall system performance.
Latency Reduction: By placing data replicas closer to the users or applications that need
those, replication can reduce data access latency. This is especially important for
distributed and geographically dispersed systems.
Disaster Recovery: Replicated data can serve as a disaster recovery strategy. In the
event of a catastrophic failure or data corruption, backups in the form of replicas can be
used to restore the system.
Consistency Models: Replication introduces challenges related to data consistency.
Different consistency models, such as strong consistency, eventual consistency, and
causal consistency, can be employed based on application requirements.
Synchronization and Conflict Resolution: When multiple copies of data are updated
concurrently, conflicts can occur. Systems need mechanisms to detect and resolve
conflicts to maintain data integrity.
Ticket-Out
1. Explain data fragmentation and replication.
2. Name the types of architectural models in DBMS
SUBJECT: DATA PROCESSING
WEEK SEVEN
DURATION: 45 MINUTES
TOPIC: NETWORKING
INSTRUCTIONAL MATERIALS: CLASSIC COMPUTER STUDIES BOOK 1, TUTORIAL VIDEOS &
PICTURE MATERIALS
OBJECTIVES: at the end of the lesson, learners should be able to:
1. Explain the meaning of networking
CONTENT
Networking
Networking is the practice of linking or connection of two or more computing devices together
for the purpose of sharing data. Networks are built with a mix of computer hardware
and computer software.
Network Design
Computer networks also differ in their design. The two basic forms of network design are called
client/server and peer-to-peer. Client-server networks feature centralized server computers
that store email, Web pages, files and or applications.
1. Files/documents
2. Software
3. Printer
4. Scanner
5. Hard disk
6. Computers
Computer Network Terminologies
A Network Topology: A network topology represents its layout or structure from the
point of view of data flow.
Network Protocols: Communication languages used by computer devices are called
network protocol. Yet another way to classify computer networks is by the set of
protocols they support. Networks often implement multiple protocols with each
supporting specific applications. Popular protocols include TCP/IP, the most common
protocol found on the Internet and in home networks.
The Internet: The Internet is the global system of interconnected computer networks
that use the Internet protocol suite (TCP/IP) to link devices worldwide. It is A network of
networks that consists of private, public, academic, business, and government networks
of local to global scope, linked by a broad array of electronic, wireless, and optical
networking technologies. The Internet carries an extensive range of information
resources and services, such as the inter-linked hypertext documents and applications of
the World Wide Web (WWW), electronic mail, telephony, and peer-to-peer networks
for file sharing.
Classes of Networks
Intranet
Extranet
An intranet
An intranet is a private network that is contained within an enterprise. It may consist of many
interlinked local area networks and also use leased lines in the wide area network. Typically, an
intranet includes connections through one or more gateway computers to the outside Internet.
The main purpose of an intranet is to share company information and computing resources
among employees. An intranet can also be used to facilitate working in groups and for
teleconferences.
An Extranet
An extranet is a private network that uses Internet technology and the public
telecommunication system to securely share part of a business‘s information or operations with
suppliers, vendors, partners, customers, or other businesses. An extranet can be viewed as part
of a company’s intranet that is extended to users outside the company. It has also been
described as a “state of mind” in which the Internet is perceived as a way to do business with
other companies as well as to sell products to customers.
Class Task
Ticket-Out
CONTENT
Network Topology
A network topology is the pattern in which nodes (i.e., computers, printers, routers or other
devices) are connected to a local area network(LAN) or other network via links (e.g., twisted
pair copper wire cable or optical fiber cable).
There are four principal topologies used in LANs: bus, ring, star and mesh. The most widely
used of these is bus, because it is employed by Ethernet, which is the dominant LAN
architecture.
In a bus topology all devices are connected to a central cable, called the bus or backbone. This
topology is relatively inexpensive and easy to install for small networks.
In a ring topology each device is connected directly to two other devices, one on either side
of it, to form a closed loop. This topology is relatively expensive and difficult to install, but it
offers high bandwidth and can span large distances. A variation is the token ring, in which
signals travel in only one direction around the loop, carried by a so-called token from node to
node.
In a star topology all devices are connected directly to a central computer or server. Such
networks are relatively easy to install and manage, but bottlenecks can occur because
all data must pass through the central device.
The mesh topology can be either a full mesh or a partial mesh. In the full mesh,
each computer is connected directly to each of the others. In the partial mesh, some computers
are connected to most of the others, and some are connected only to those other nodes with
which they exchange the most data.
The several basic network topologies can be combined in various ways to form hybrid
topologies, such as a ring-star network or a tree network. The latter consists of two or more
star networks connected to a linear bus.
The word topology comes from the Greek words “topos” meaning place and “logos” meaning
study. It is a description of any locality in terms of its layout. Topology is a branch
of mathematics concerned with properties of geometric figures that are distorted without
tearing or bonding together.
Class Task
Ticket-Out
CONTENT
Types of Networking
A local area network (LAN) is a network that connects computers and devices in a limited
geographical area such as home, school, computer laboratory, office building, or closely
positioned group of buildings. Each computer or device on the network is a node.
A Metropolitan area network (MAN) is a large computer network that usually spans a city or a
large campus.
A wide area network (WAN) is a computer network that covers a large geographic area such as
a city, country, or spans even intercontinental distances, using a communications channel that
combines many types of media such as telephone lines, cables, and air waves. A WAN often
uses transmission facilities provided by common carriers, such as telephone companies.
Client-Server Network
A client-server network is designed for end-users, called clients, to access resources such as
files, songs, video collections, or some other service from a central computer called a server.
In its simplest form, a peer-to-peer (P2P) network is created when two or more PCs are
connected and share resources without going through a separate server computer. A P2P
network can be an ad hoc connection—a couple of computers connected via a Universal Serial
Bus to transfer files.
Class Task
1. Explain the following types of computer networks. (a) PAN (b) MAN (c) LAN
Ticket-Out
1. State 5 importance of computer networking.
SUBJECT: DATA PROCESSING
WEEK TEN
DURATION: 45 MINUTES
TOPIC: COMPUTER VIRUS
INSTRUCTIONAL MATERIALS: CLASSIC COMPUTER STUDIES BOOK 1, TUTORIAL VIDEOS &
PICTURE MATERIALS
OBJECTIVES: at the end of the lesson, learners should be able to:
1. State the meaning of computer virus
CONTENT
Computer virus is a program intentionally written by some software developer to cause damage
to the computer, programs and files in which it found itself. The computer virus may be
designed to display unwanted messages.
The computer virus is a program that has the ability to replicates itself by changing other
programs to include a copy of itself. A virus causes the infected computer system to function in
ways not originally planned. The computer virus cannot be seen with your natural eyes yet the
effects can be notified on an infected system.
There are basically three ways in which a virus will infect your microcomputer.
Boot Sector
A boot sector virus infects hard drives and flash disks by making itself available on the boot
sector of the disk. Booting up from an infected flash disk can cause damage to the hard drive.
Document Virus
A document virus can affect the document by moving from disk partition table to a different
sector and replace it with its own code, therefore infecting document as they are accessed.
Examples of Viruses
1. Trojan horse
2. Sleeper
3. Logic bomb
4. Alabama virus
5. Christmas virus
6. Worm
7. Data crime virus
8. Jerusalem Virus
9. Barcelona virus
10. April 1st virus
Sources of Viruses
1. Infected diskettes
2. Hard drive
3. Infected CD ROMS
4. Internet download
5. E-mail
6. Illegal duplication of software
7. Bad handling of computer
Class-Task
Ticket-Out
CONTENT
Hardware Maintenance
Maintenance of computer hardware is a way of taking care, repairing and replacing broken and
failing computer hardware.
Computer hardware components attract dust, dirt, lint, carpet fibers, pet hair and smoke
particles. The air from the computer cooling fan contains grime which settles on the
components and causes overheating which eventually results in permanent hardware failure.
As a result of this, complete cleaning should be done at least once a year and if the computer is
used in hot, dusty moist environment, cleaning must be performed more frequently.
Step 1: Always shut down, power off the system before carrying out
any computer maintenance.
Step 2: Never sprays any liquid onto any computer component. Spray or pour the liquid on a
lint – free cloth and wipe the PC with the cloth. Avoid product with certain cellulose which will
leave streaks on your computer equipment. The use of paper towels or an old rag to clean
delicate surfaces of a computer should be discouraged because paper products contain
cellulose which can scratch delicate surfaces of your hardware.
Step 3: Use vacuum cleaner to remove dirt, dust, food and hair from keyboards.it is advisable to
wear an anti – static wrist strip to reduce the transfer of static electricity from the body to
the computer.
Step 4: Do not apply cleaning solution including water directly to computer components.
Step 5: Do not use your breath to blow the dust off the components because your breath
contains moisture and the components are not built to be rust- proof.
Step 7: Do not use anything wet or damp inside the computer case.
Step 8: Do not let any component or circuit board inside the computer case get wet or damp.
Step 9: Do not attempt to clean the motherboard with a cloth as it may damage the electrical
components. Use a slightly moist cloth to wipe off dust and grime inside the computer case.
1. A clean non-abrasive cloth such as microfiber, cotton, T-shirt, cotton handkerchief should be
used and avoid using paper towels, dish towels, facial tissue, old rag.
2. Portable vacuum.
3. Appropriate cleaning solution.
4. Cotton swabs.
5. Foam swabs.
6. DVD or CD-ROM cleaner.
Step 2: Lightly dampen a cleaning cloth with isopropyl alcohol and wipe down the outside of
the
computer mouse a mouse pad.
Step 3: Remove the bottom cover of the mouse. To this, turn it over and note the directional
arrows that indicate the direction of rotation, or how to slide it off. Press with your fingers in
the direction of the arrows and then turn the mouse right side up, letting the cover and mouse
ball drop into your hand.
Step 4: Wipe the computer mouse ball with a lint-free cloth dampened with isopropyl alcohol.
Put it aside.
Step 5: Dampen a swab with isopropyl alcohol and clean between, around and on top the keys.
Change swabs as they become dirty. You may need several swabs.
Step 7: Wipe the mouse cord. Lightly dampen a cleaning cloth with mild soap solution and
gently pull the cord through the cloth.
Step 1: Unplug the power supply cord and cable from the back of the monitor and allow it to
cool for at least 20 minutes.
Step 2: Vacuum the outside of the monitor, particularly the cooling grooves, holes or slots in
the top surface where heavy dust or other debris may have collected. Blow compressed air in
short puffs at an angle to the monitor surface. The goal is to remove dust and dirt without
letting anything fall into the ventilation holes.
Step 3: Lightly dampen a cloth with a mild soap solution and wipe down the outside plastic
portions of the monitor.
Step 4: Clean the monitor cables and power cord while they are disconnected. Lightly dampen a
cloth with mild soap solution and gently pull the cables and cords through the cloth.
Step 5: Check the documentation or call the manufacturer to find out if your monitor screen
has anti-glare, or other delicate coatings. If so, ask the manufacturer or cleaning instructions. If
it does not have these special coatings you may spray a window cleaner unto a lint-free cloth
and wipe it clean. Do not spray directly onto the screen. Chemicals may drip inside the monitor
and damage it.
Step 6: For dusty or dirty manufacturing environments use a computer dust cover to protect
the monitor
Step 1: Remove the cable from the back of the computer case.
Step 2: Use a vacuum cleaner to remove debris between the key. If no vacuum is available, turn
the keyboard upside down and gently tap on the back side dislodge debris.
Step 3: Aim between the keys and compressed air to remove remaining dust and debris. Use
short puffs of air applied at about a 30-45 degree angle to the keyboard surface. Alternate
between blowing the keys and tapping the keyboard upside down to dislodge particles until it is
clean.
Step 4: Lightly dampen a cloth with a mild soap solution and wipe down the outside of the
keyboard. Do not spray soap solution directly onto the keyboard.
Step 5: Dampen a swab with isopropyl alcohol and clean between, around and on top of the
keys. Change swabs as they become dirty. You may need several swabs.
Step 6: Wipe the keyboard cord. Lightly dampen a cleaning cloth with mild soap solution and
gently pull the cord through the cloth. Dry the cord with a dry cloth.
Step 7: For dusty or dirty manufacturing environments a good keyboard cover is recommended.
1. Plug your laptop into the socket and you can leave it there whenever possible.
2. You can recharge your laptop’s battery whether the battery is fully drained or not.
3. There is no need to fully drain your laptop’s lithium-ion battery every time you use it.
4. Lithium-ion battery have a rapid-charging option. This option is available either on a custom tab
inside the Power Option dialog box or from special battery software that came with your
laptop.
5. Do not over charge the battery, charge the battery when is getting low between 20%- 10% and
do not dry the battery.
1. The battery needed to be fully charge before use at least for 4 to 6 hours.
2. Ensure that the UPS is kept in contact to its electrical ground at all times. Do not over load
3. Do not let the UPS shut down by itself because it can damage battery.
1. Purchase DVD laser cleaning kit. The kit is comprised of a single disc that is design to spin in
your drive and remove all dust from the lens.
2. Place the CD/DVD laser lens cleaning disc inside your DVD drive’s tray. Close the tray and
allow the CD spin in the drive. As it spins, it will clear your lens of most, if not all, of the dust
that is on it.
3. Purchase a can of spray air. As an extra precaution, open your drive’s disc tray and gently
spray a can of spray air into it. This will remove any of the big pieces of dust that may be lurking
inside the tray.
SOFTWARE MAINTENANCE
The maintenance of programs inside the computer system such as virus, a spyware removal,
backup software and a registry removal, cleaner. Every PC should be installed with an anti-virus,
a spyware removal application back up and a registry cleanser.
2. PERFECTIVE MAINTENANCE: This is a measure taken by computer programmer to upgrade the way a
software programs function or how fast it processes, requests, develop software menu layouts and
command interface so as to ensure that the program has zero tolerance for flaws.
3. ADAPTIVE MAINTENANCE: It takes care of the changes that occur in software development. For
instance, if there is a change in processors speed, thus change will invariably affect how the software
performs on a single computer software interfaces with other software programs. So changes in one
program necessitates changes in other programs.
1. Never turn your computer off with the power switch on until window has shut down.
2. Get a UPS (Uninterrupted Power Supply) for your computer.
3. Back up your data to external hard drives, DVD/ CD ROMS, USB/ drives, memory card etc.
4. Run scan disk and defragment at least once in a month.
5. Never unplug peripheral from the computer when it is on.
6. Ensure that you have 300 mbs or 500-600 mbs of free space on your C Drive for window XP,
Vista, or Window 7.
7. Do not allow a lot of programs to load up when you start your computer.
8. Use anti-virus checker regularly.
9. Use a firewall program for a high speed internet connection.
10. Keep track of the software disk you receive with your computer and new peripheral.
11. Make sure window update is set.
Class Task
1. Which of the following is not a software maintenance? a) Virus b) Spyware c) Hard disk d) Registry
removal
2. The software maintenance that involves developing and deploying solutions to problems is .……… a)
corrective b) adaptive c) preventive d) perfective
3. The software maintenance that takes care of the changes that occur in software maintenance is called
……… a) adaptive b) corrective c) perfective d) preventive
Ticket-Out