Page 67 - DLIS108_INFORMATION_AND_COMMUNICATION_TECHNOLOGY_APPLICATIONS

VED1
e\L-lovely-eng\comm7-1.pmd IInd 16-9-11 IIIrd 27-12-11 IVth 4-1-12

Information and Communication Technology Applications

them. However if you can get the type of application programs you are looking for, one of the
Notes systems listed below may be a good choice.
• Unix: A system that has been around for many years and it is very stable. It is primary used to
be a server rather than a workstation and should not be used by anyone who does not under-
stand the system. It can be difficult to learn. Unix must normally run an a computer made by
the same company that produces the software.
• Linux: Linux is similar to Unix in operation but it is free. It also should not be used by anyone
who does not understand the system and can be difficult to learn.
• Apple MacIntosh: Most recent versions are based on Unix but it has a good graphical inter-
face so it is both stable (does not crash often or have as many software problems as other
systems may have) and easy to learn. One drawback to this system is that it can only be run
on Apple produced hardware.

Explain the different types of operating system.

7.5 Algorithm

In mathematics and computer science, an algorithm is an effective method expressed as a finite list
of well-defined instructions for calculating a function. Algorithms are used for calculation, data
processing, and automated reasoning. In simple words an algorithm is a step-by-step procedure for
calculations.
Starting from an initial state and initial input (perhaps empty), the instructions describe

a computation that, when executed, will proceed through a finite number of well-defined successive
states, eventually producing “output “and terminating at a final ending state. The transition from
one state to the next is not necessarily deterministic; some algorithms, known as randomized
algorithms, incorporate random input.
A partial formalization of the concept began with attempts to solve the problem (the “decision
problem”) posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to
define “effective calculability”or “effective method”;those formalizations included theGödel–
Herbrand–Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church’s lambda calculus of
1936, Emil Post’s “Formulation 1” of 1936, and Alan Turing’s Turing machines of 1936–7 and 1939.
Giving a formal definition of algorithms, corresponding to the intuitive notion, remains a challenging
problem.
Algorithm and Library
Library sort, or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with
gaps in the array to accelerate subsequent insertions. The name comes from an analogy:
Suppose a librarian were to store his books alphabetically on a long shelf, starting with the As at the
left end, and continuing to the right along the shelf with no spaces between the books until the end
of the Zs. If the librarian acquired a new book that belongs to the B section, once he finds the correct
space in the B section, he will have to move every book over, from the middle of the Bs all the way
down to the Zs in order to make room for the new book. This is an insertion sort. However, if he
were to leave a space after every letter, as long as there was still space after B, he would only have
to move a few books to make room for the new one. This is the basic principle of the Library Sort.
The algorithm was proposed by Michael A. Bender, Martín Farach-Colton, and Miguel Mosteiro in
2006.

62 LOVELY PROFESSIONAL UNIVERSITY