Contents
1.
DEFINE BOOLEAN
ALGEBRA
2.
COMPLEXITY OF THE
QUICKSORT ALGORITHM
3.
BRIEFLY DESCRIBE
HOW A CPU WORKS WITH THE HELP OF BASIC BUILDING BLOCK DIAGRAM WITH AN EXAMPLE
4.
ASSEMBLY LANGUAGE
5.
OPERATING SYSTEM
6.
ANALOG COMPUTER
AND DIGITAL COMPUTER
7.
COMPUTER PROGRAMMING
LANGUAGE
ü DEFINE BOOLEAN ALGEBRA
A class of elements B together with two binary operations +
and . is a Boolean algebra, if the fooling for postulates hold :-
P1:- Both the operations +
and . are commutative, i.e. for any two
elements a and b of B, a+b=b+a and a∙b=b∙a.
P2:- Each of the
operations + and . are distributive over the other, i.e., for any elements a, b
and c in B, a+b∙c=(a+b)∙(a+c)
and a(b+c) =a∙b+a∙c .
P3:- There exist in B
distinct is identity elements 0 and 1 (0 ≠1) for the operations + and ∙
respectively, such that for any element a of B. a+0=0+a=a and a∙1=1∙a=a.
P4:-For every element
a of B, there exists an element a’ (called the complement of a) in B, such that
a+a’=1 and a∙a’=0.
