Introduction to Computers:
A computer system consists of hardware and software.
Computer hardware is the collection of physical elements that comprise a computer system.
Computer software is a collection of computer programs and related data that provides the
instructions for a computer what to do and how to do it. Software refers to one or more computer
programs and data held in the storage of the computer for some purposes.
Basically computer software is of three main types
1. Operating System
The Operating System (OS) is an interface between the compute software and hardware. The
most popular and latest operating systems include Windows XP, Mac, UNIX, Linux, Windows Vista,
etc.
2. Application Software
The application software is widely used for accomplishment of specific and precise tasks which is
a step ahead than the basic operations or running of the computer system. The application software
includes printing documents, and permitting access to internet for web and video co nferencing
activities. The Application software indirectly does the interaction with the machine to perform all
these functions.
3. System Software
System software directly interacts with computer hardware. Some of the examples are the device
drivers for CPU, Motherboard, Mouse, Printer, Keyboard, etc. The system software takes the
responsibility of control, integration and managing individual hardware machine of the computer.
Computing Environment:
Computing Environment is a collection of computers / machines, software, and networks that
support the processing and exchange of electronic information meant to support various types of
computing solutions.
Types of Computing Environments:
Personal Computing Environment
Client Server Environment
Time sharing Environment
Distributed Environment
Algorithm:
An algorithm is a description of a procedure which terminates with a result. Algorithm is a stepby-step method of solving a problem.
Properties of an Algorithm:
1) Finiteness: - An algorithm terminates after a finite numbers of steps.
2) Definiteness: - Each step in algorithm is unambiguous. This means that the action specified by the
step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any
confusion.
3) Input: - An algorithm accepts zero or more inputs
4) Output:- An algorithm should produce at least one output.
5) Effectiveness: - It consists of basic instructions that are realizable. This means that the instructions
can be performed by using the given inputs in a finite amount of time.
Flowchart:
A flowchart is a graphical or pictorial representation of an algorithm.
Each step in the process is represented by a different symbol and contains a short description of
the process step. The flow chart symbols are linked together with arrows showing the process flow
direction. Some common flowcharting symbols are listed below.
