(i) To collect demographic information about who has visited the Web site.
(ii) It helps to personalize the user's experience on the Website.

Class comprises of members. Member functions are called as methods. The member functions of a class can be defined in two ways.
(i) Inside the class definition
(ii) Outside the class definition

Minimum (a, b)
- - inputs : a, b
- - outputs : result = a \(\downarrow\) b

Thamizpori (தமிழ்பொறி) is a Tamil translation application having more than 30000 Tamil words equalent to English words. Using-this application. we can transalte small English sentences into Tamil.

Size: Object Oriented Programs are much larger than other programs.
Effort: Object Oriented Programs require a lot of work to create.
Speed: Object Oriented Programs are slower than other programs, because of their size.

It is the software in which the source code is available to the general public for use and modification from its original design, free of charge.

Printers are divided into two main categories:
(i) Impact Printers
(ii) Non Impact printers

Model of the action with an assignment statement:
1. --farmer, goat, grass, wolf = L,L.L.L.
2. Farmer, goat:= R, R
3. -farmer, goat, grass, wolf = R.R.L,L
4. --farmer: = L
5. --farmer, goat, grass, wolf = L,R,L.L
6. farmer, grass: = R, R
7. --farmer, goat, grass, wolf = R,R,R,L
8. farmer, goat: = L, L
9. --farmer, goat, grass, wolf = L,L,R,L
10. farmer, wolf: = R.R
11. --farmer, goat, grass, wolf = R,L,R,R
12. farmer: = L
13. --farmer, goat, grass, wolf = L,L,K,R
14. farmer, goat: = R,R
15. -- farmer, goat, grass, wolf = R,R,R,R

Multiprocessing is one of the features of operating system. It has two or more processors for a single running process. Each processor works on different parts of the same task or two or more different tasks.

#include< iostream >
using namespace std;
class add
{
int num1, num2, sum;
public:
add ( )
{
cout < < "\n Constructor without parameters ...";
num1=0;
num2=0;
sum=0;
}
add (int s1, int s2)
{
cout < < "\n Parameterized constructor ...";
num1= s1;
num2=s2;
sum=0;
}
add (add &a)
{
cout < < "\n Copy Constructor ...";
num1= a.num1;
num2=a.num2;
sum=0;
}
void getdata ( )
{
cout < < "\n Enter data ...";'
cin > > num 1 > > num2;
}
void addition ( )
{
sum=num1+num2;
}
void putdata ( )
{
cout < < "\n The numbers are ..";
cout< <num 1 < < '\t' < < num2;
cout < < "\n The sum of the numbersare .."< < sum;
}
};
int main ( )
{
add a, b (10, 20) , c(b);
a.getdata ( );
a.addition( );
b.addition( );
c.addition( );
cout< < "\n Object a:";
a.putdatat);
cout < < "\n Object b :";
b.putdata( );
cout < < "\n Object c..";
c.putdata( );
return 0;
}

To solve a problem recursively, the solver reduces the problem to sub-problems, and calls another instance of the solver, known as sub-solver, to solve the sub-problem. The input ,size to a sub-problem is smaller than the input size to the original problem. When the solver calls a sub-solver, it is known as recursive call. The magic of recursion allows the solver to assume that the sub-solver (recursive call) outputs the solution to the sub-problem. Then, from the, solution to the sub-problem, the solver constructs the solution to the given problem.
As the sub-solvers go on reducing the problem into sub-problems of smaller sizes, eventually the sub-problem becomes small enough to be solved directly, without recursion. Therefore, a recursive solver has two cases:
1. Base case: The problem size is small enough to be solved directly. Output the solution. here must be at least one base case.
2. R-ecursion step: The problem size is not small enough. Deconstruct the problem into a sub-problem, strictly smaller in size than the given problem. Call a sub-solver to solve the sub problem. Assume that the sub-solver outputs the solution to the sub problem. Construct the solution to the given problem.
This outline of recursive problem solving technique is shown below.
solver (input)
if input is small enough
construct solution
else
find sub_Problems of reduced
input
solutions to sub problems =
solver for each sub .Problem
construct solution to the
problem from
solutions to the sub_problems
Whenever we solve a problem using recursion, we have to ensure these two cases: In the recursion step, the size of the input to the recursive call is strictly smaller than the size of the given input, and there is at least one base case.

Process Management:
Process management is a function that includes creating and deleting processes and providing mechanisms for processes to communicate and synchronize with each other.
A process is a unit of work (program) in a computer. A word processing program being run by an individual user on.a computer is a process. A system task, such as sending output to a printer or screen, can also be called as a Process.
A computer consists of a collection of processes, they are classified as two categories:
1. Operating System processes which is executed by system code
2. User Processes which is executed by user code. All these processes can potentially execute concurrently on a single CPU. A process needs certain resources including CPU time, memory, files and 110 devices to finish its task.
The Operating System is responsible for the following activities associated with the process management:
1. Scheduling processes and threads on the CPUs.
2. Creating and deleting both user and system processes
3. Suspending and resuming processes.
4. Providing mechanisms for process synchronization.
5. Providing mechanisms for the process communication
The following algorithms are mainly used to allocate the job (process) to the processor.
1. FIFO
2. SJF
3. Round Robin
4. Based on Priority.

The switch statement is a multi-way branch statement. It provides an easy way to dispatch execution to different parts of code based on the value of the expression. The switch statement replaces multiple if-else sequence.
The syntax of the switch statement is:
switch( expression)
{
case constant 1:
statement( s);
break;
case constant 2:
statement( s);
break;
default:
statement(s);
}
Example:
#include < iostream.h >
using namespace std;
int main( )
{
int num;
cout << "\n Enter week day number:";
cin >> num;
switch (num)
{
easel : cout << "\n Sunday";break;
case2 : cout << "\n Monday";break;
case3 : cout << "\n Tuesday";break;
case4 : cout << "\n Wednesday";break;
case5 : cout << "\n Thursday'xbreak;
case6 : cout << "\n Friday";break;
case7 : cout << "\n Saturday";break;
default: cout << "\n Wrong input.. ...";
}
}
Output:
Enter week day number: 6
Friday

A number system is a set of digits used to represent the values derived from a common base or radix.
Decimal Number System:
(i) The term Decimal is derived from a Latin prefix deci, which means ten.
(ii) The Decimal number system has ten digits ranging from 0-9. Because this system has ten digits.
(iii) It is also called as a base ten number system or denary number system.
(iv) Decimal number should always be written with a subscript 10.
Binary Number System:
(i) The decimal number system is not convenient to implement in digital system.
(ii) For instance, it is very difficult to design electronic equipment so that it can work with 10 different voltage levels (each one representing one decimal character, 0 through 9).
(iii) On other hand, it is very easy to design simple, accurate electronic circuits that operate with only 2 voltage levels.
(iv) For this reason, almost every digital system utilizes the binary number system (base 2) as the basic number system of its operation;
(v) In a binary system, there are only two symbols or possible digit values, 0 and 1.
Octal Number System:
(i) The octal number system is playing a vital role in digital computer work.
(ii) The octal number system has a base of 8.
(iii) It means that it has eight unique symbols such as 0,1,2,3,4,5,6 and 7.
(iv) Thus, each digit of an octal number can have any value from 0 to 7.
(v) The places to the left of the octal point are positive powers of 8 and places to the right are negative powers of 8.
Hexadecimal Number System:
(i) The hexadecimal system uses base 16 in digital systems.
(ii) It has 16 possible symbols.
(iii) It uses the digits 0 through 9 plus the letters A, B, C, D, E and F as the 16 different symbols.
(iv) Hexadecimal System is a positional value system, wherein each hexadecimal digit has its own value or weight expressed as a power of 16.

Flowchart is a diagrammatic notation for representing algorithms. They show the control flow of algorithms using diagrams in a visual manner. In flowcharts, rectangular boxes represent simple statements, diamond-shaped boxes represent conditions, and arrows describe how the control flows during the execution of the algorithm. A flowchart is a collection of boxes containing statements and conditions which are connected by arrows showing the order in which the boxes are to be executed.
(i) A statement is contained in a rectangular box with a single outgoing arrow, which points to the box to be executed next.

(ii) A condition is contained in a diamond-shaped box with two outgoing arrows, labelled true and false. The true arrow points to the box to be executed next if the condition is true, and the false arrow points to the box to be executed next if the condition is false.

(iii) Parallelogram boxes represent inputs given and outputs produced.

(iv) Special boxes marked Start and End are used to indicate the start and end of execution:

Let the variables a, b, c represent the glass A, glass B and Glass C respectively. Variables A, B, C can store values APPLE, GRAPE or EMPTY.
Initial State:
1.-- a, b, c : = APPLE, GRAPE, EMPTY
2. C : = b
3.-- a, b, c : = APPLE, EMPTY, GRAPE
4. b : = a
5.-- a, b, c : = EMPTY, APPLE, GRAPE
6. a : = C
7.-- a, b, c : = GRAPE, APPLE, EMPTY
Final State:
Specification:
1. Exchange ()
2. -- inputs: a, b, c :- APPLE, GRAPE, EMPTY
3.--outputs: a, b, c:- GRAPE, APPLE, EMPTY

Read-only memory (ROM):
1. Read only memory refers to special memory in a computer with pre-recorded data at manufacturing time which cannot be modified.
2. The stored programs that start the computer and perform diagnostics are available in ROMs. ROM stores critical programs such as the program that boots the computer.
3. Once the data has been written onto a ROM chip, it cannot be modified or removed and can only be read.
4. ROM retains its contents even when the computer is. turned off. So, ROM is called as a non-volatile memory.
Programmable Read-Only Memory (PROM):
1. Programmable read-only memory is also a nonvolatile memory on which data can be written only once. Once a program has been written onto a PROM, it remains there forever.
2. Unlike the main memory, PROMs retain their contents even when the computer is turned off.
3. The PROM differs from ROM. PROM is manufactured as a blank memory, whereas a ROM is programmed during the manufacturing process itself.
4. PROM programmer or a PROM burner is used to write data to a PROM chip. The process of programming a PROM is called burning the PROM.
Erasable Programmable Read-Only Memory (EPROM):
1. Erasable Programmable Read Only Memory is a special type of memory which serves as a PROM, but the content can be erased using ultraviolet rays.
2. EPROM retains its contents until it is exposed to ultraviolet light. The ultraviolet light clears its contents, making it possible to reprogram the memory.
3. An EPROM differs from a PROM, PROM can be written only once and cannot be erased.
4. EPROMs are used widely in personal computers because they enable the manufacturer to change the contents of the PROM to replace with updated versions or erase the contents before the computer is delivered.
Electrically Erasable Programmable Read Only Memory (EEPROM)
1. Electrically Erasable Programmable Read Only Memory is a special type of PROM that can be erased by exposing it to an electrical charge.
2. Like other types of PROM, EEPROM retains its contents even when the power is turned off.
3. Comparing with all other types of ROM, EEPROM is slower in performance.

C++ Program that assigns data to members of a structure variable and displays the contents
include< iostream >
using namespace std;
struct Employee
{
char name[50];
int age;
float salary;
};
int main( )
{
Employee e1;
cout < < "Enter Full name:";
cin > > e1.name;
cout < < endl < < "Enter age:";
cin > >e1.age;
couts < < endl < < "Enter salary:";
cin-c-e1.salary; ,
cout < <"\nDisplaying Information." << endl;
cout< < "Name:" < < e1.name < < endl;
cout< < "Age:" < < e1.age < < endl:
cout < < "Salary:" < < e1.salary;
return 0;
}
Output:
Enter Full name:
Ezhil
Enter age:
27
Enter salary:
40000.00 .
Displaying Information.
Name: Ezhil
Age: 27
Salary: 40000.00

The goto statement is a control statement which is used to transfer the control from one place to another place without any condition in a program.
The syntax of the goto statement is;

Some Facts About the execution of constructor in inheritance
i. Base class constructors are executed first, before the derived class constructors execution
ii. Derived class cannot inherit the base class constructor but it can call the base class constructor by using Base_class name::base_class_constructor() in derived class definition
iii. If there are multiple base classes, then its start executing from the left most base class
iv. In multilevel inheritance, the constructors will be executed in the order of inheritance The destructors are executed in the reverse order of inheritance.

Encapsulation is the most striking feature of a class. The data is not accessible to the outside world, and only those functions which are wrapped in the class can access it. This encapsulation of data from direct access by the program is called data hiding or information hiding.

C++ provides a rich collection of functions ready to be used for various tasks. The tasks to be perfornned by each of these are already written, debugged and compiled, their definitions alone are grouped and stored in files called header files. Such ready-touse sub programs are called pre-defined functions or build-in functions.

1) 0 +  0  = 0
2) 1 +  0 = 1  
3)  1+ 1 = 1
4) 0 + 1 = 1 

(i) Sequential Control Flow
(ii) Alternative Control Flow
(iii) Iterative Control Flow.