1657615686xii Computer SC
1657615686xii Computer SC
1657615686xii Computer SC
SILCHAR REGION
STUDY MATERIAL
CLASS-XII
SESSION 2014-15
KENDRIYA VIDYALAYA SANGATHAN
(SILCHAR REGION)
SESSION 2014-15
CLASS: XII
(Somit Srivastava)
Deputy Commissioner
Character Set- Set of valid characters which are recognized by c++compiler i.e Digits (0-9),
Alphabets (A-Z & a-z) and special characters + - * , . “ ‘ < > = { ( ] ) space etc i.e
256 ASCII characters.
Data type conversion- Conversion of one data type into another data type. Two type of
conversion
i. Implicit Conversion – It is automatically taken care by complier in the case of lower range
to higher range e.g. int x, char c=’A’ then x=c is valid i.e character value in c is automatically
converted to integer.
ii. Explicit Conversion- It is user-defined that forces an expression to be of specific type. e.g.
double x1,x2 and int res then res=int(x1+x2)
Variable- Named storage location where value can be stored and changed during program
execution. e.g. int x, float y, float amount, char c;
Constant- Memory block where value can be stored once but can’t be changed later on during
program execution. e.g. const int pi =3.14;
cout – It is an object of ostream class defined in iostream.h header file and used to display
value on monitor.
cin – It is an object of istream class defined in iostream.h header file and used to read value from
keyboard for specific variable.
comment- Used for better understanding of program statements and escaped by the compiler to
compile . e.g. – single line (//) and multi- line(/*….*/)
Cascading – Repeatedly use of input or output operators( “>>” or “<<”) in one statement with cin
or cout.
Control structure:
Sequence conditional Multiple Switch Statement loop control statement
control statement Choice (Alternate for ifelse- (while ,do… while, for)
statement(if (if else) Statement if) works for
) If –else-if only exact match
Syntax Syntax Syntax Syntax Syntax
if(expressio If(expressio If switch(int / char while(expression)
n) n) (expression) variable) {
{ { { { case literal1: statements;
statements; statements; statements [statements }
} } } break;] Entry control loop works for
else else case literal2: true condition.
{ if(expression) [statements,
statements; { break;] do
} statement default:statements; {
} } statements;
else Break is } while(expression);
{ compulsory Exit Control Loop
statement statement with
} every case because execute at least once if
if it is not included the condition is false at
then the controls beginning.
executes next case
statement until nextfor loop
break encountered for(expression1;expressio
or end of swtich n2;expression3)
reached. {
Default is optional,statement;}
it gets executed Entry control loop
when no match is works for true condition and
found preferred for fixed
no.of times.
Note: any non-zero value of an expression is treated as true and exactly 0 (i.e. all bits contain 0) is
treated as false.
Nested loop -loop within loop.
exit()- Defined in process.h and used to terminate the program depending upon certain condition.
break- Exit from the current loop depending upon certain condition.
continue- to skip the remaining statements of the current loop and passes control to the next loop
control statement.
goto- control is unconditionally transferred to the location of local label specified by
<identifier>.
For example
A1:
cout<<”test”;
goto A1;
Array- Collection of element of same type that are referred by a common name.
A A[0 A[1] A[2 A[3] A[4 A[5] A[6 A[7] A[8 A[9]
] ] ] ] ]
S K V K u m b h i r g r a m \0
Declaration – int a[3][4], means ‘a’ is an array of integers are arranged in 3 rows & 4columns.
0 1 2 3
A[0] A[0]
0 A[0][1] A[0][3]
[0] [2]
A[1] A[1]
1 A[1][1] A[1][3]
[0] [2]
A[2] A[2]
2 A[2][1] A[2][3]
[0] [2]
Function -Name given to group of statements that does some specific task and may return a
value. Function can be invoked (called) any no. of time and anywhere in the program.
Function prototypes-Function declaration that specifies the function name, return type and
parameter list of the function.
syntax: return_type function_name ( type var1, type var2,…., type varn ) ;
Actual Parameters
Variables associated with function name during function call statement.
Formal Parameters
Variables which contains copy of actual parameters inside the function definition.
Local variables
Declared inside the function only and its scope and lifetime is function only and hence
accessible only inside function.
Global variables
Declared outside the function and its scope and lifetime is whole program and hence
accessible to all function in the program from point declaration.
Example :
#include <iostream.h>
int a=20; // global
void main()
{
int b=10; // local
cout<<a<<b;
}
Processing of two or more functions having same name but different list of parameters
Function recursion
Function that call itself either directly or indirectly.
Structure-Collection of logically related different data types (Primitive and Derived) referenced
under one name.
e.g. struct employee
{
int empno;
char name[30];
char design[20];
char department[20];
}
Declaration: employee e;
Input /Output : cin>>e.empno; // members are accessed using dot(.) operator.
cout<<e.empno;
Nested structure
A Structure definition within another structure.
A structure containing object of another structure.
e.g. struct address
{
int houseno;
char city[20];
char area[20];
long int pincode;
}
struct employee
{
int empno;
char name[30];
char design[20];
char department[20];
address add; // nested structure
}
Declaration: employee e;
Input /Output : cin>>e.add.houseno; // members are accessed using dot(.) operator.
cout<<e.ad.houseno;
#define Directives
1 Marks questions
(1) Which C++ header file(s) will be essentially required to be included to run /execute the
following C++ code:
void main()
{
char Msg[ ]="Sunset Gardens";
for (int I=5;I<strlen(Msg);I++) //String.h
puts(Msg); // stdio.h
}
Ans : stdio.h, string.h
(2) Name the header files that shall be need for the following code: (CBSE 2012)
void main()
{
char text[] =”Something”
cout<<”Remaining SMS chars: ”<<160-strlen(text)<<endl; //string.h
}
Ans: iostream.h, string.h
2 Marks questions:
1) Rewrite the following program after removing the syntactical error(s) if any.Underline each
correction. CBSE 2012
#include<iostream.h>
Class Item
{
long IId, Qty;
public:
void Purchase { cin>>IId>>Qty;}
void Sale()
{
cout<<setw(5)<<IId<<”Old:”<< Qty<<endl;
cout<< “New :”<<Qty<<endl;
} };
void main()
{
Item I;
Purchase();
I.Sale()
}
Ans : #include<iostream.h>
class Item // C capital
{
long IId, Qty;
public:
void Purchase ( ) { cin>>IId>>Qty;} // ( ) after function name
void Sale( )
{
cout<<setw(5)<<IId<<”Old:”<< Qty<<endl;
cout<< “New :”<<Qty<<endl;
}};
void main()
{
Item I;
I. Purchase( ); // object missing
I.Sale( ) ; // ; is missing
}
Ans : vR2Good
R2GoOd
2GOOd
gOOd
3) Observe the following program and find out, which output(s) out id (i) to (iv) will not be expected from
program? What will be the minimum and maximum value assigned to the variables Chance?
#include<iostream.h> CBSE 2012
#include<stdlib.h>
void main()
{
randomize();
int Arr[] = {9,6};, N;
int Chance = random(2)+10;
for(int c=0;c<2;c++)
{
N= random(2);
cout<<Arr[N];
}
}
i) 9#6#
ii) 19#17#
iii) 19#16#
iv) 20#16#
Ans: The output not expected from program are (i),(ii) and (iv)
Minimum value of Chance =10
Maximum value of Chance = 11
3 Marks questions:
4) Find the output of the following program: CBSE 2012
#include<iostream.h>
class METRO
{
int Mno, TripNo, PassengerCount;
public:
METRO ( int Tmno=1)
{ Mno =Tmno; PassengerCount=0;}
void Trip(int PC=20)
{ TripNo++, PassengerCount+=PC};
void StatusShow()
{ cout<<Mno<< “:”<<TripNo<< “ :”<<PassengerCount<<endl;}
};
void main()
{
M 5 0 0
5 1 20
METRO M(5),T;
M.Trip();
T 1 0 0
1 1 0
M.StatusShow();
T.StatusShow();
M.StatusShow();
}
Ans : 5: 1: 20
1: 1: 0
5: 1: 20
5) Rewrite the following program after removing the syntactical error(s) if any. Underline each
correction.
#include<iostream.h>
void main( )
{ F = 10, S = 20;
test(F;S);
test(S);
}
void test(int x, int y = 20)
{ x=x+y;
count<<x>>y;
}
6) Rewrite the following program after removing syntactical error(s) if any. Underline
each correction.
#include “iostream.h”
Class MEMBER
{ int Mno;
float Fees;
PUBLIC:
void Register ( ) {cin>>Mno>>Fees;}
void Display( ) {cout<<Mno<<" : "<<Fees<<endl;}
};
void main()
{ MEMBER delete;
Register();
delete.Display();
}
9) Rewrite the following C++ program after removing the syntax error(s) if any.
Underline each correction. [CBSE 2010]
include<iostream.h>
class FLIGHT
{ Long FlightCode;
Char Description[25];
public
void addInfo()
{ cin>>FlightCode; gets(Description);}
void showInfo()
{ cout<<FlightCode<<”:”<<Description<<endl;}
};
void main( )
{ FLIGHT F; addInfo.F(); showInfo.F; }
10) In the following program, find the correct possible output(s)from the options:
#include<stdlib.h>
#include<iostream.h>
void main( )
{ randomize( );
char City[ ][10]={“DEL”, “CHN”, “KOL”, “BOM”, “BNG”};
int Fly;
for(int I=0; I<3;I++)
{Fly=random(2) + 1;
cout<<City[Fly]<< “:”;
}}
Outputs:
(i) DEL : CHN : KOL: (ii) CHN: KOL : CHN:
(iii) KOL : BOM : BNG: (iv) KOL : CHN : KOL:
11) In the following C++ program what is the expected value of Myscore from options (i) to (iv) given
below. Justify your answer.
#include<stdlib.h>
#include<iostream.h>
void main( )
{ randomize( );
int Score[ ] = {25,20,34,56,72,63},Myscore;
cout<<Myscore<<endl;
}
i) 25 (ii) 34 (iii) 20 (iv) Garbage Value.
int main(void)
{
printData pd; // Call print to print integer
pd.print(5); // Call print to print float
pd.print(500.263);//// Call print to print character
pd.print("Hello C++"); return 0; }
When the above code is compiled and executed, it produces following result:
Printing int: 5
Printing float: 500.263
Printing character: Hello C++
OBJECT ORIENTED PROGRAMMING CONCEPTS
Object Oriented Programming follows bottom up approach in program design and emphasizes on safety and
security of data..
FEATURES OF OBJECT ORIENTED PROGRAMMING:
Inheritance:
Inheritance is the process of forming a new class from an existing class or base class. The base class is also
known as parent class or super class.
Derived class is also known as a child class or sub class. Inheritance helps in reusability of code , thus
reducing the overall size of the program
Data Abstraction:
It refers to the act of representing essential features without including the background details .Example :
For driving , only accelerator, clutch and brake controls need to be learnt rather than working of engine and
other details.
Data Encapsulation:
It means wrapping up data and associated functions into one single unit called class..
A class groups its members into three sections: public, private and protected, where private and protected
members remain hidden from outside world and thereby helps in implementing data hiding.
Modularity :
The act of partitioning a complex program into simpler fragments called modules iscalled as modularity.
It reduces the complexity to some degree and
It creates a number of well-defined boundaries within the program .
Polymorphism:
Poly means many and morphs mean form, so polymorphism means one name multiple forms.
It is the ability for a message or data to be processed in more than one form.
C++ implements Polymorhism through Function Overloading , Operator overloading and Virtual functions
.
Classes in Programming :
It is a collection of variables, often of different types and its associated functions.
Class just binds data and its associated functions under one unit there by enforcing
encapsulation.
Classes define types of data structures and the functions that operate on those data structures.
A class defines a blueprint for a data type.
Declaration/Definition :
A class definition starts with the keyword class followed by the class name; and the class body, enclosed by
a pair of curly braces. A class definition must be followed either by a semicolon or a list of declarations.
class class_name
{
access_specifier_1:
member1;
access_specifier_2:
member2;
...
} object_names;
[Note: the default access specifier is private.
Example :
class Box
{
int a;
public:
double length; // Length of a box
double breadth; // Breadth of a box
double height; // Height of a box
} container; // container is an object of class Box
Member-Access Control
Type of Access Meaning
Private Class members declared as private can be used only by member functions and friends
(classes or functions) of the class.
Protected Class members declared as protected can be used by member functions and friends
(classes or functions) of the class. Additionally, they can be used by classes derived
from the class.
Public Class members declared as public can be used by any function.
OBJECTS in C++:
Objects represent instances of a class. Objects are basic run time entities in an object oriented
system.
Creating object / defining the object of a class:
The general syntax of defining the object of a class is:-
Class_name object_name;
In C++, a class variable is known as an object. The declaration of an object is similar to that of a variable of
any data type. The members of a class are accessed or referenced using object of a class.
Box Box1; // Declare Box1 of type Box
Box Box2; // Declare Box2 of type Box
Both of the objects Box1 and Box2 will have their own copy of data members.
Accessing / calling members of a class. All member of a class are private by default.
Private member can be accessed only by the function of the class itself.
Public member of a class can be accessed through any object of the class. They are accessed or called
using object of that class with the help of dot operator (.).
The general syntax for accessing data member of a class is:-
Object_name.Data_member = value;
The general syntax for accessing member function of a class is:-
Object_name. Function_name ( actual arguments );
class sum
{
int A, B, Total;
public:
void getdata ();
void display ();
};
void sum:: getdata () // Function definition outside class definition Use of :: operator
{
cout<<” \ n enter the value of Aand B”;
cin>>A>>B;
}
void sum:: display () // Function definition outside class definition Use of :: operator
{
Total =A+B;
cout<<”\n the sum of A and B=”<<Total;
}
INLINE FUNCTIONS
Inline functions definition starts with keyword inline
The compiler replaces the function call statement with the function code itself(expansion) and
then compiles the entire code.
They run little faster than normal functions as function calling overheads are saved.
A function can be declared inline by placing the keyword inline before it.
Example
inline void Square (int a)
{
In place of function call ,
function body is substituted
because Square () is inline
function
cout<<a*a;
}
void main()
{.
Square(4); { cout <<4*4;} // { cout <<4*4;}
Square(8) ; { cout <<8*8; } // { cout <<8*8; }
}
Pass Object As An Argument
/*C++ PROGRAM TO PASS OBJECT AS AN ARGUMEMT. The program Adds the two
heights given in feet and inches. */
#include< iostream.h>
#include< conio.h>
class height
{
int feet,inches;
public:
void getht(int f,int i)
{
feet=f;
inches=i;
}
void putheight()
{
cout< < "\nHeight is:"< < feet< < "feet\t"< < inches< < "inches"< < endl;
}
void sum(height a,height b)
{
height n;
n.feet = a.feet + b.feet;
n.inches = a.inches + b.inches;
if(n.inches ==12)
{
n.feet++;
n.inches = n.inches -12;
}
cout< < endl< < "Height is "< < n.feet< < " feet and "< < n.inches< < endl;
}
};
void main()
{
height h,d,a;
clrscr();
h.getht(6,5);
a.getht(2,7);
h.putheight();
a.putheight();
d.sum(h,a);
getch();
}
/**********OUTPUT***********
Height is 6feet 5inches
Height is 2feet 7inches
Height is 9 feet and 0
void INTAX()
{
gets(Name);
cin>>PanNo>>Taxabincm;
CompTax();
}
void OUTAX()
{ cout<<Name<<’\n’<<PanNo<<’\n’<<Taxabincm<<’\n’<<TotTax<<endl; }
};
Public Members
o A function Enter( ) to allow user to enter values for ANo, Name, Agg & call function
GradeMe( ) to find the Grade
o A function Result ( ) to allow user to view the content of all the data members.
Ans:
class Applicant
{
long ANo;
char Name[25];
float Agg;
char Grade;
void GradeMe( )
{
if (Agg > = 80)
Grade = ‘A’;
else if (Agg >= 65 && Agg < 80 )
Grade = ‘B’;
else if (Agg >= 50 && Agg < 65 )
Grade = ‘C;
else
Grade = ‘D’;
}
public:
void Enter ( )
{
cout <<”\n Enter Admission No. “; cin>>ANo;
cout <<”\n Enter Name of the Applicant “; cin.getline(Name,25);
cout <<”\n Enter Aggregate Marks obtained by the Candidate :“; cin>>Agg;
GradeMe( );
}
void Result( )
{
cout <<”\n Admission No. “<<ANo;
cout <<”\n Name of the Applicant “;<<Name;
cout<<”\n Aggregate Marks obtained by the Candidate. “ << Agg;
cout<<\n Grade Obtained is “ << Grade ;
}
};
Ans :
class ITEM
{ int Icode,Qty;
char item[20];
float price,discount;
void finddisc();
public:
void buy();
void showall();
};
void stock::finddisc( )
{ if (qty<=50)
Discount=0;
else if (qty> 50 && qty <=100)
Discount=0.05*price;
else if (qty>100)
Discount=0.10*price;
}
void stock::buy( )
{ cout<<"Item Code :";cin>>Icode;
cout<<"Name :";gets(Item);
cout<<"Price :";cin>>Price;
cout<<"Quantity :";cin>>Qty;
finddisc();
}
void TEST::DISPTEST()
{ cout<<"Item Code :";cout<<Icode;
cout<<"Name :";cout<<Item;
cout<<"Price :";cout<<Price;
cout<<"Quantity :";cout<<Qty;
cout<<"Discount :";cout<<discount;
}
TYPES OF CONSRUCTORS:
1. Default Constructor:
A constructor that accepts no parameter is called the Default Constructor. If you don't declare a constructor
or a destructor, the compiler makes one for you. The default constructor and destructor take no arguments
and do nothing.
2. Parameterized Constructors:
A constructor that accepts parameters for its invocation is known as parameterized Constructors ,
also called as Regular Constructors.
DESTRUCTORS:
A destructor is also a member function whose name is the same as the class name but is preceded by
tilde(“~”).It is automatically by the compiler when an object is destroyed. Destructors are usually used to
deallocate memory and do other cleanup for a class object and its class members when the object is
destroyed.
A destructor is called for a class object when that object passes out of scope or is explicitly deleted.
Example :
class TEST
{
int Regno,Max,Min,Score;
Public:
TEST( ) // Default Constructor
{ }
TEST (int Pregno,int Pscore) // Parameterized Constructor
{
Regno = Pregno ;Max=100;Max=100;Min=40;Score=Pscore;
}
~ TEST ( ) // Destructor
{ Cout<<”TEST Over”<<endl;}
};
The following points apply to constructors and destructors:
Constructors and destructors do not have return type, not even void nor can they return values.
References and pointers cannot be used on constructors and destructors because their addresses
cannot be taken.
Constructors cannot be declared with the keyword virtual.
Constructors and destructors cannot be declared static, const, or volatile.
Unions cannot contain class objects that have constructors or destructors.
The compiler automatically calls constructors when defining class objects and calls destructors when
class objects go out of scope.
Derived classes do not inherit constructors or destructors from their base classes, but they do call the
constructor and destructor of base classes.
The default destructor calls the destructors of the base class and members of the derived class.
The destructors of base classes and members are called in the reverse order of the completion of their
constructor:
The destructor for a class object is called before destructors for members and bases are called.
Copy Constructor
A copy constructor is a special constructor in the C++ programming language used to create a
new object as a copy of an existing object.
A copy constructor is a constructor of the form classname(classname &).The compiler will use the
copy constructors whenever you initialize an instance using values of another instance of the same type.
Copying of objects is achieved by the use of a copy constructor and assignment operator.
Example :
class Sample{ int i, j;}
public:
Sample(int a, int b) // constructor
{ i=a; j=b; }
Sample (Sample & s) //copy constructor
{
j=s.j ; i=s.j;
Cout <<”\n Copy constructor working \n”;
}
void print (void)
{cout <<i<< j<< ”\n”;}
:
};
Note : The argument to a copy constructor is passed by reference, the reason being that whenan
argument is passed by value, a copy of it is constructed. But the copy constructor is creating a copy of the
object for itself, thus, it calls itself. Again the called copy constructor requires another copy so again it is
called.in fact it calls itself again and again until the compiler runs out of the memory .so, in the copy
constructor, the argument must be passed by reference.
The following cases may result in a call to a copy constructor:
When an object is passed by value to a function:
The pass by value method requires a copy of the passed argument to be created for the function to operate
upon .Thus to create the copy of the passed object, copy constructor is invoked
If a function with the following prototype:
void cpyfunc(Sample ); // Sample is a class
Then for the following function call
cpyfunc(obj1); // obj1 is an object of Sample type
The copy constructor would be invoked to create a copy of the obj1 object for use by cpyfunc().
(b) Write statements in C++ that would execute Function 3 and Function 4 of class Exam.
Ans:- Exam a(10); and Exam b(“Comp”, 10);
Q2 Consider the following declaration:
class welcome
{
public:
welcome (int x, char ch); // constructor with parameter
welcome(); // constructor without parameter
void compute();
private:
int x; char ch;
};
Which of the following are valid statements?
welcome obj (33, ‘a9’);
welcome obj1(50, ‘9’);
welcome obj3();
obj1= welcome (45, ‘T’);
obj3= welcome;
Ans. Valid and invalid statements are
welcome obj (33, ‘a9’); valid
welcome obj1(50, ‘9’); valid
welcome obj3(); invalid
obj1= welcome (45, ‘T’); valid
obj3= welcome; invalid
// Derived class
class Rectangle: public Shape
{
public:
int getArea()
{
return (width * height);
}
};
int main(void)
{
Rectangle Rect;
Rect.setWidth(5);
Rect.setHeight(7);
// Print the area of the object.
cout << "Total area: " << Rect.getArea() << endl;
return 0;
}
When the above code is compiled and executed, it produces following result:
Total area: 35
A derived class inherits all base class methods with the following exceptions:
Constructors, destructors and copy constructors of the base class.
Overloaded operators of the base class.
The friend functions of the base class.
When deriving a class from a base class, the base class may be inherited through public, protected or
private inheritance. We hardly use protected or private inheritance but public inheritance is commonly
used. While using different type of inheritance, following rules are applied:
TYPES OF INHERITANCE
1. Single class Inheritance:
Single inheritance is the one where you have a single base class and a single derived class.
2. Multilevel Inheritance:
In Multi level inheritance, a subclass inherits from a class that itself inherits from another
class.
3. Multiple Inheritance:
In Multiple inheritances, a derived class inherits from multiple base classes. It has properties
of both the base classes.
4. Hierarchical Inheritance:
In hierarchial Inheritance, it's like an inverted tree. So multiple classes inherit from a single
base class.
5. Hybrid Inheritance:
It combines two or more forms of inheritance .In this type of inheritance, we can have mixture of
number of inheritances but this can generate an error of using same name function from no of
classes, which will bother the compiler to how to use the functions.
Therefore, it will generate errors in the program. This has known as ambiguity or duplicity.
Ambiguity problem can be solved by using virtual base classes
Q1. Consider the following declarations and answer the questions given below :
class WORLD
{
int H;
protected :
int S;
public :
void INPUT(int);
void OUTPUT();
};
class COUNTRY : private WORLD // Base class WORLD & Sub class Contry
{
int T;
protected :
int U;
public :
void INDATA( int, int)
void OUTDATA();
};
class STATE : public COUNTRY // Base Class COUNTRY & Sub Class STATE
{
int M;
public :
void DISPLAY (void);
};
(i) Name the base class and derived class of the class COUNTRY.
(ii) Name the data member(s) that can be accessed from function DISPLAY().
(iii) Name the member function(s), which can be accessed from the objects of class STATE.
(iv) Is the member function OUTPUT() accessible by the objects of the class COUNTRY ?
Ans:-
(i) Base class : WORLD
Derived class : STATE
(ii) M.
(iii) DISPLAY(), INDATA() and OUTDATA()
(iv)No
Q2. Consider the following declarations and answer the questions given below :
class living_being
{
char name[20];
protected:
int jaws;
public:
void inputdata(char, int);
void outputdata();
}
class animal : protected living_being
{
int tail;
protected:
int legs;
public:
void readdata(int, int);
void writedata();
};
class cow : private animal
{ char horn_size;
public:
void fetchdata(char);
void displaydata();
};
(i) Name the base class and derived class of the class animal.
(ii) Name the data member(s) that can be accessed from function displaydata.
(iii) Name the data member(s) that can be accessed by an object of cow class.
(iv)Is the member function outputdata accessible to the objects of animal class.
Ans:-
(i) Base class : living_being
Derived class : cow
(ii) horn_size, legs, jaws
(iii) etchdata() and displaydata()
(iv)No
Q3. Consider the following and answer the questions given below:
class MNC
{
char Cname[25]; // Company name
protected :
char Hoffice[25]; // Head office
public :
MNC( );
char Country[25];
void EnterDate( );
void DisplayData( );
};
class Branch : public MNC
{
long NOE; // Number of employees
char Ctry[25]; // Country
protected:
void Association( );
public :
Branch( );
void Add( );
void Show( );
};
class Outlet : public Branch
{
char State[25];
public :
Outlet();
void Enter();
void Output();
};
(i) Which class’s constructor will be called first at the time of declaration of an object of class
Outlet?
(ii) How many bytes an object belonging to class Outlet require ?
(iii) Name the member function(s), which are accessed from the object(s) of class Outlet.
(iv)Name the data member(s), which are accessible from the object(s) of class Branch.
Ans:-
(i) class MNC
(ii) 129
(iii) void Enter(), void Output(), void Add(), void Show(), void EnterData(), void DisplayData().
(iv)char country[25]
Q4 Consider the following and answer the questions given below :
class CEO
{
double Turnover;
protected :
int Noofcomp;
public :
CEO( );
void INPUT( );
void OUTPUT( );
};
class Director : public CEO
{
int Noofemp;
public :
Director( );
void INDATA();
void OUTDATA( );
protected:
float Funda;
};
class Manager : public Director
{
float Expense;
public :
Manager();
void DISPLAY(void);
};
(i) Which constructor will be called first at the time of declaration of an object of class Manager?
(ii) How many bytes will an object belonging to class Manager require ?
(iii) Name the member function(s), which are directly accessible from the object(s) of class
Manager.
(iv)Is the member function OUTPUT() accessible by the objects of the class Director ?
Ans:-
(i) CEO()
(ii) 16
(iii) DISPLAY(), INDATA(), OUTDATA(), INPUT(), OUTPUT()
(iv)Yes
Q2:- Consider the following declarations and answer the questions given below:
class book
{
char title[20];
char author[20];
int noof pages;
public:
void read();
void show();
};
class textbook: private textbook
{
int noofchapters, noofassignments;
protected:
int standard;
void readtextbook();
void showtextbook();
};
class physicsbook: public textbook
{
char topic[20];
public:
void readphysicsbook();
void showphysicsbook();
};
(i) Name the members, which can be accessed from the member functions of class physicsbook.
(ii) Name the members, which can be accessed by an object of Class textbook.
(iii) Name the members, which can be accessed by an object of Class physicsbook.
(iv)What will be the size of an object (in bytes) of class physicsbook.
Q3 : Answer the questions (i) to (iv) based on the following:
class CUSTOMER
{
int Cust_no;
char Cust_Name[20];
protected:
void Register();
public:
CUSTOMER( );
void Status( );
};
class SALESMAN
{
int Salesman_no;
char Salesman_Name[20];
protected:
float Salary;
public:
SALESMAN( );
void Enter( );
void Show( );
};
class SHOP : private CUSTOMER, public SALESMAN
{
char Voucher_No[10];
char Sales_Date[8;
public :
SHOP( );
void Sales_Entry( );
void Sales_Detail( );
};
(i) Write the names of data members, which are accessible from object belonging to class
CUSTOMER.
(ii) Write the names of all the member functions which are accessible from object belonging to
class SALESMAN.
(iii) Write the names of all the members which are accessible from member functions of
class SHOP.
(iv)How many bytes will be required by an object belonging to class SHOP?
o By the open() member function of the stream. It will preferred when file is opened in various
modes i.e ios::in, ios::out, ios::app, ios::ate etc.
e.g fstream file;
file.open(“book.dat”, ios::in | ios::out | ios::binary);
File modes:
Open Mode Description
ios::out It open file in output mode (i.e write mode) and place the file pointer in beginning,
if file already exist it will overwrite the file.
ios::in It open file in input mode (read mode) and permit reading from the file.
ios::app It opens the file in write mode, and place file pointer at the end of file
ios::ate It open the file in write or read mode, and place file pointer at the end of file
ios::nocreate If file does not exist this file mode ensures that no file is created and open() fails.
ios::noreplace If file does not exist, a new file gets created but if the file already exists, the open() fails.
eof( ): This function determines the end-of-file by returning true(non-zero) for end of file otherwise
returning false(zero).
close(): This function terminates the connection between the file and stream associated with it.
Stream_object.close();
e.g file.close();
We can also use file>>ch for reading and file<<ch writing in text file.
Binary file functions:
read()- read a block of binary data or reads a fixed number of bytes from the specified stream and
store in a buffer.
Syntax : Stream_object.read ( ( char * )& Object, sizeof (Object ) ) ;
e.g file.read ( ( char * )&s, sizeof( s ) ) ;
write() – write a block of binary data or writes fixed number of bytes from a specific memory
location to the specified stream.
Syntax : Stream_object.write((char *)& Object, sizeof(Object));
e.g file.write((char *)&s, sizeof(s));
Note: Both functions take two arguments, Initial address and length of the variable
File Pointer: The file pointer indicates the position in the file at which the next input/output is to occur.
There read pointer and write pointer associated with a file.
Moving the file pointer in a file for various operations viz modification, deletion , searching
etc. Following functions are used:
seekg(): It places the file pointer to the specified position in input mode of file.
e.g file.seekg(p,ios::beg); or file.seekg(-p,ios::end), or file.seekg(p,ios::cur)
i.e to move to p byte position from beginning, end or current position.
seekp(): It places the file pointer to the specified position in output mode of file.
e.g file.seekp(p,ios::beg); or file.seekp(-p,ios::end), or file.seekp(p,ios::cur)
i.e to move to p byte position from beginning, end or current position.
tellg(): This function returns the current working position of the file pointer in the input mode.
e.g int p=file.tellg( );
tellp(): This function returns the current working position of the file pointer in the output mode.
e.f int p=file.tellp( );
Steps To Create A File
Declare an object of the desired file stream class(ifstream, ofstream, or fstream)
Open the required file to be processed using constructor or open function.
Process the file.
Close the file stream using the object of file stream.
2 Marks Questions:
1. Write a function in a C++ to read the content of a text file “DELHI.TXT” and display all those
lines on screen, which are either starting with ‘D’ or starting with ‘M’. [CBSE 2012]
void DispDorM()
{
ifstream File(“DELHI.TXT”)
char str[80];
while(File.getline(str,80))
{
if(str[0] = =’D’ || str[0] = =’M’)
cout<<str<<endl;
}
File.close(); //Ignore
}
2. Write a function in a C++ to count the number of lowercase alphabets present in a text file
“BOOK.txt”.
int countalpha()
{ ifstream Fin(“BOOK.txt”);
char ch;
int count=0;
while(!Fin.eof())
{
Fin.get(ch);
if (islower(ch))
count++;
}
Fin.close();
return count;
}
4. Assume a text file “coordinate.txt” is already created. Using this file create a C++ function to
count the number of words having first character capital.
int countword()
{ ifstream Fin(“BOOK.txt”);
char ch[25];
int count=0;
while(!Fin.eof())
{
Fin>>ch;
if (isupper(ch[0]))
count++;
}
Fin.close();
return count;
}
5. Function to count number of lines from a text files (a line can have maximum 70 characters or
ends at ‘.’)
int countword()
{
ifstream Fin(“BOOK.txt”);
char ch[70];
int count=0;
if (!Fin)
{
cout<<”Error opening file!” ;
exit(0);
}
while(1)
{
Fin.getline(ch,70,‘.’);
if (Fin.eof())
break;
count++;
}
Fin.close();
return count;
}
2/3 Marks Practice Questions
1. Write a function in C++ to count the number of uppercase alphabets present in a text file
“BOOK.txt”
2. Write a function in C++ to count the number of alphabets present in a text file “BOOK.txt”
3. Write a function in C++ to count the number of digits present in a text file “BOOK.txt”
4. Write a function in C++ to count the number of white spaces present in a text file “BOOK.txt”
5. Write a function in C++ to count the number of vowels present in a text file “BOOK.txt”
6. Assume a text file “Test.txt” is already created. Using this file, write a function to create three files
“LOWER.TXT” which contains all the lowercase vowels and “UPPER.TXT” which contains all the
uppercase vowels and “DIGIT.TXT” which contains all digits.
void read_file( ) //function to read records from student.dat one by into record s
{
ifstream fin;
student s;
fin.open(“student.dat”,ios::in | ios:: binary); //opening the file
fin.read((char *) &s,sizeof(student)); //reading first record from file to record s
while(file)
{
s.output(); // displaying the content of object s (record)
cout<< “\n”;
fin.read ( ( char * ) & s,sizeof ( student ) ) ; // reading next record
}
fin.close();
}
void modify_record()
{
student s;
fstream file;
file.open(“student.dat”,ios::in|ios::out|ios::ate|ios::binary); // opening student.dat in read
&
//write binary mode
int r, pos = -1, f=0;
cout<<”\n enter the rollo no of student whom data to be modified”;
cin>>r ;
//Searching the record with rno = r
file.read( ( char * )&s, sizeof( s ) ) ;
while(file)
{
if (r == s.getrno( )) // will be true if required record found (rno = r)
{
f=1; // f = 1 indicate record found
cout<<”\n record is “;
s.output();
pos =file.tellg()-size(s); //moving the write pointer one record back
break;
}
file.read((char *)&s,sizeof(s)); // writing the modified record to the file
}
if(f == 0 ) // f==0 indicate record did not found
cout<< “\n record not exist”;
}
void delete_record()
{
fstream file(“student.dat”, ios::in|ios::binary);
fstream newfile(“newstu.dat”,ios::out|ios::binary);
student s;
cout<<”\n enter the rollno no of student whom record to be deleted”;
cin>>r;
file.read ( (char *)&s, sizeof( s ) ) ;
while(file)
{
if (r!=s.getrno())
{
newfile.write((char *)&s,sizeof(s));
}
file.read((char *)&s,sizeof(s));
}
file.close();
newfile.close();
}
void search_record()
{ student s;
fstream file;
file.open(“student.dat”,ios::in|os::binary);
int r,flag = 0;
cout<<”\n enter the rollo no of student whom record to be searched”;
cin>>r;
file.read( ( char * )&s, sizeof( s ) ) ;
while(file)
{
if (r==s.getrno())
{ cout<<”\n record is “;
s.output();
flag=1;
break;
}
file.read((char *)&s,sizeof(s));
}
if(flag==0)
cout<< “\n search unsuccessfull”;
file.close();
}
1 Mark Questions
1. Observe the program segment carefully and answer the question that follows:
class stock
{
int Ino, Qty; Char Item[20];
public:
void Enter() { cin>>Ino; gets(Item); cin>>Qty;}
void issue(int Q) { Qty+=0;}
void Purchase(int Q) {Qty-=Q;}
int GetIno() { return Ino;}
};
void PurchaseItem(int Pino, int PQty)
{ fstream File;
47
File.open(“stock.dat”, ios::binary|ios::in|ios::out);
Stock s;
int success=0;
while(success= = 0 && File.read((char *)&s,sizeof(s)))
{
If(Pino= = ss.GetIno())
{
s.Purchase(PQty);
_______________________ // statement 1
_______________________ // statement 2
Success++;
}
}
if (success = =1)
cout<< “Purchase Updated”<<endl;
else
cout<< “Wrong Item No”<<endl;
File.close() ;
}
Ans.1.
i) Statement 1 to position the file pointer to the appropriate place so that the data updation is done for the
required item.
File.seekp( File.tellg( ) - sizeof(stock);
OR
File.seekp(-sizeof(stock),ios::cur);
ii) Staement 2 to perform write operation so that the updation is done in the binary file.
File.write((char *)&s, sizeof(s));
OR
File.write((char *)&s, sizeof(stock));
3 Marks Question
1. Write a function in c++ to search for details (Phoneno and Calls) of those Phones which have
more than 800 calls from binary file “phones.dat”. Assuming that this binary file contains
records/ objects of class Phone, which is defined below.
class Phone CBSE 2012
{
Char Phoneno[10]; int Calls;
public:
void Get() {gets(Phoneno); cin>>Calls;}
void Billing() { cout<<Phoneno<< “#”<<Calls<<endl;}
int GetCalls() {return Calls;}
};
Ans 1 :
void Search()
{
Phone P;
fstream fin;
fin.open( “Phone.dat”, ios::binary| ios::in);
while(fin.read((char *)&P, sizeof(P)))
{
if(p.GetCalls() >800)
p.Billing();
}
Fin.close(); //ignore
}};
2. Write a function in C++ to add new objects at the bottom of a binary file “STUDENT.DAT”,
assuming the binary file is containing the objects of the following class.
class STUD
{int Rno;
char Name[20];
public:
void Enter()
{cin>>Rno;gets(Name);}
void Display(){cout<<Rno<<Name<<endl;}
};
Ans.2.
void searchbook(int bookno)
{ifstream ifile(“BOOK.DAT”,ios::in|ios::binary);
if(!ifile)
{cout<<”could not open BOOK.DAT file”; exit(-1);}
else
{BOOK b; int found=0;
while(ifile.read((char *)&b, sizeof(b)))
{if(b.RBno()==bookno)
{b.Display(); found=1; break;}
}
if(! found)
cout<<”record is not found “;
ifile.close();
}
}
3. Given a binary file PHONE.DAT, containing records of the following class type
class Phonlist
{
char name[20];
char address[30];
char areacode[5];
char Phoneno[15];
public:
void Register()
void Show();
void CheckCode(char AC[])
{return(strcmp(areacode,AC);
}};
Write a function TRANSFER( ) in C++, that would copy all those records which are having areacode
as “DEL” from PHONE.DAT to PHONBACK.DAT.
Ans 3.
void TRANSFER()
{
fstream File1,File2;
Phonelist P;
File1.open(“PHONE.DAT”, ios::binary|ios::in);
File2.open(“PHONEBACK.DAT”, ios::binary|ios::OUT)
while(File1.read((char *)&P, sizeof(P)))
{ if( p.CheckCode( “DEL”))
File2.write((char *)&P,sizeof(P)); }
File1.close();
File2.close();
}
POINTERS
Pointer is a variable that holds a memory address of another variable of same type.
- It supports dynamic allocation routines.
C++MemoryMap :
Program Code : It holds the compiled code of the program.
Global Variables : They remain in the memory as long as program continues.
Stack : It is used for holding return addresses at function calls, arguments passed to the functions,
local variables for functions. It also stores the current state of the CPU.
Heap : It is a region of free memory from which chunks of memory are allocated via DMA functions.
StaticMemory Allocation : Allocation of memory at compile time.
e.g. int a; // This will allocate 2 bytes for a during compilation.
Dynamic Memory Allocation : allocation of memory at run time using operator new and delete.
e.g int x =new int; // dynamic allocation
float y= new float;
delete x; //dynamic deallocation
delete y;
Free Store : It is a pool of unallocated heap memory given to a program that is used by the program for
dynamic memory allocation during execution.
Pointer arithmetic:
Two arithmetic operations, addition and subtraction, may be performed on pointers.
Adding 1 to a pointer actually adds the size of pointer’s base type.
Base address: The address of the first byte is known as BASE ADDRESS.
void main()
{
void swap(int *m, int *n);
int a = 5, b = 6;
cout << “\n Value of a :” << a << “ and b :” << b;
swap(&a, &b);
cout << “\n After swapping value of a :” << a << “and b :” << b;
}
Input :
Value of a : 5 and b : 6
After swapping value of a : 6 and b : 5
#include <iostream.h>
int *min(int &x, int &y) // function returning int pointer
{
if (x < y )
return (&x);
else
return (&y)
}
void main()
{
int a, b, *c;
cout << “\nEnter a :”; cin >> a;
cout << “\nEnter b :”; cint >> b;
c = min(a, b); // pointer returned from the function min will be assigned to pointer variable c
cout << “\n The minimum no is :” << *c;
}
Dynamic structures:
Dynamic allocation:-
The new operator can be used to create dynamic structures also.
struct student
{
int rno;
char name[20];
};
student *s = new student;
To access structure member through structure pointer we use arrow operator(->).
cout << s -> rno;
cout << s -> name
Dynamic deallocation:-
A dynamic structure can be released using the deallocation operator delete as shown below :
delete stu;
Solved Questions
Q1. How is *p different from **p ?
Ans : *p means, it is a pointer pointing to a memory location storing a value in it. But **p means, it is a
pointer pointing to another pointer which in turn points to a memory location storing a value in it.
Ans :
(i) When an object is passed by value, the called function creates its own copy of theobject by just
copying the contents of the passed object. It invokes the object’s copy constructor to create its copy
of the object. However, the called function destroys its copy of the object by calling the destructor
function of the object upon its termination.
(ii) When an object is passed by reference, the called function does not create its own copy of the passed
object. Rather it refers to the original object using its reference or alias name. Therefore, neither
constructor nor destructor function of the object is invoked in such a case.
4. Identify the syntax error(s), if any, in the following program. Also give reason for errors.
void main()
{const int i = 20;
const int * const ptr = &i;
(*ptr++; int j= 15; ptr
= &j; }
Array initialization
void main()
{
int b[10]={3,5,7,8,9}; // array initialization
cout<<b[4]<<endl;
cout<<b[5]<<endl;
}
Output is
9
0
Searching
We can use two different search algorithms for searching a specific data from an array
Linear search algorithm
Binary search algorithm
Linear search algorithm
In Linear search, each element of the array is compared with the given item to be searched for. This
method continues until the searched item is found or the last item is compared.
#include<iostream.h>
int linear_search(int a[], int size, int item)
{
int i=0;
while( i<size && a[i] !=item)
i++;
if(i<size)
return ( i); //returns the index number of the item in the array
else
return (-1); //given item is not present in the array so it returns -1
//since -1 is not a legal index number
}
void main()
{
int b[8]={2,4,5,7,8,9,12,15},size=8;
int item;
cout<<”enter a number to be searched for”;
cin>>item;
int p = linear_search(b, size, item); //search item in the array b
if(p == -1)
cout<<item<<” is not present in the array”<<endl;
else
cout<<item <<” is present in the array at index no “<<p;
}
Binary search algorithm
Binary search algorithm is applicable for already sorted array only. In this algorithm, to search for
the given item from the sorted array (in ascending order),
The item is compared with the middle element of the array. If the middle element is equal to
the item then index of the middle element is returned
If item is less than the middle item then the item will be searched in first half segment of the
array for the next iteration.
If the item is larger than the middle element then the item will be searched in second half of
the array for the next iteration
The same process continues until either the item is found or the segment is reduced to the
single element and still the item is not found (search unsuccessful).
#include<iostream.h>
int binary_search(int a[ ], int size, int item)
{
int first = 0, last = size-1, middle;
while(first<=last)
{
Middle = ( first + last ) / 2;
if( item = = a[middle])
return middle; // item is found
else if(item< a[middle])
last=middle-1; //item is present in left side of the middle element
else
first=middle+1; // item is present in right side of the middle element
}
return -1; //given item is not present in the array, here, -1 indicates unsuccessful search
}
void main()
{
int b[8]={2,4,5,7,8,9,12,15},size=8;
int item;
cout<<”enter a number to be searched for”;
cin>>item;
int p=binary_search(b, size, item); //search item in the array b
if(p = = -1)
cout<<item<<” is not present in the array”<<endl;
else
cout<<item <<” is present in the array at index no “<<p;
}
Item 12 will be
search in array b
{2,4,5,7,9,12,15}
0 7 7/2 = 3 b[3] = 7 Item not found ,
item 12 is greater
than 7
Item 12 will be
search in second
segment array b
{9,12,15}
4 7 11/2 = 5 b[5] = 9 Item not found, 12
is greater than 9
Traversal
Processing of all elements (i.e. from first element to the last element) present in one-dimensional
array is called traversal. For example, printing all elements of an array, finding sum of all elements present
in an array.
#include<iostream.h>
void print_array(int a[ ], int n) //n is the number of elements present in the array
{
int i;
cout<<”\n Given array is :\n”;
for(i=0; i<n; i++)
cout<<a[i]<<”, “;
}
void main()
{
int b[10]={3,5,6,2,8,4,1,12,25,13},n=10;
int i, s;
print_array(b,n);
s = sum(b,n);
cout<<”\n Sum of all elements of the given array is : ”<<s;
}
Output is
Given array is
3, 5, 6, 2, 8, 4, 1, 12, 25, 13
Sum of all elements of the given array is : 79
Sorting
The process of arranging the array elements in increasing (ascending) or decreasing (descending)
order is known as sorting. There are several sorting techniques are available e.g. selection sort, insertion sort,
bubble sort, quick sort, heap short etc. But in CBSE syllabus only selection sort, insertion sort, bubble sort
are specified.
Selection Sort
The basic idea of a selection sort is to repeatedly select the smallest element in the remaining
unsorted array and exchange the selected smallest element with the first element of the unsorted array. For
example, consider the following unsorted array to be sorted using selection sort
A[0] A[1] A[2] A[3] A[4]
Original array
10 2 20 5 9
Normal
numbers
are
sorted
& Bold
number
s are
unsorte
d list
#include<iostream.h>
void select_sort(int a[ ], int n) //n is the number of elements present in the array
{
int i, j, p, small;
for(i=0;i<n-1;i++)
{
small=a[i]; // initialize small with the first element of unsorted part of the array
p=i; // keep index of the smallest number of unsorted part of the array in p
for(j=i+1; j<n; j++) //loop for selecting the smallest element form unsorted array
{
if(a[j]<small)
{
small=a[j];
p=j;
}
}// end of inner loop----------
//----------exchange the smallest element with ith element-------------
a[p]=a[i];
a[i]=small;
//-----------end of exchange-------------
}
} //end of function
void main( )
{
int a[7] = {8,5,9,3,16,4,7}, n = 7, i;
cout<<”\n Original array is :\n”;
for(i=0;i<n;i++)
cout<<a[i]<<”, “;
select_sort(a,n);
Insertion Sort
Insertion sort algorithm divides the array of n elements in to two subparts, the first subpart contain
a[0] to a[k] elements in sorted order and the second subpart contain a[k+1] to a[n] which are to be sorted.
The algorithm starts with only first element in the sorted subpart because array of one element is itself in
sorted order. In each pass, the first element of the unsorted subpart is removed and is inserted at the
appropriate position in the sorted array so that the sorted array remain in sorted order and hence in each pass
the size of the sorted subpart is increased by 1 and size of unsorted subpart is decreased by 1. This process
continues until all n-1 elements of the unsorted arrays are inserted at their appropriate position in the sorted
array.
For example, consider the following unsorted array to be sorted using selection sort
S
[
S[0] S[2] S[3] S[4] S[5] S[6]
1
Original array ]
8 5 9 3 16 4 7
#include<iostream.h>
void insert_sort(int a[ ],int n) //n is the no of elements present in the array
{
int i, j,p;
for (i=1; i<n; i++)
{
p = a[i];
j = i-1;
//inner loop to shift all elements of sorted subpart one position towards right
while( j >= 0 & &a [ j ] > p)
{
a[j+1] = a[j];
j--;
} //---------end of inner loop
a[j+1] = p; //insert p in the sorted subpart
}
}
void main( )
{
int a[7]={8,5,9,3,16,4,7},n=7,i;
cout<<”\n Original array is :\n”;
for(i=0;i<n;i++)
cout<<a[i]<<”, “;
insert_sort(a,n);
Bubble Sort
Bubble sort compares a[i] with a[i+1] for all i=0..n-2, if a[i] and a[i+1] are not in ascending order
then exchange a[i] with a[i+1] immediately. After each iteration, all elements which are not at their proper
position move at least one position towards their right place in the array. The process continues until all
elements get their proper place in the array (i.e. algorithm terminates if no exchange occurs in the last
iteration)
For example, consider the following unsorted array to be sorted using selection sort
S
[
S[0] S[2] S[3] S[4] S[5] S[6]
1
Original array ]
8 5 9 3 16 4 7
#include<iostream.h>
void insert_sort(int s[ ],int n) //n is the no of elements present in the array
{
int i, j,p;
for (i=0; i < n; i++)
{
for( j=1; j < n-1; j++)
{
if( s[j] > s[j+1) // consecutive elements are being checked
{ // swapping the consecutive elements if first value is > next value
p = s[j] ;
s[j]= s[j+1] ;
s[j+1] = p ;
}
}
}
void main( )
{
int a[7]={8,5,9,3,16,4,7},n=7,i;
cout<<”\n Original array is :\n”;
for(i=0;i<n;i++)
cout<<a[i]<<”, “;
insert_sort(a,n);
#include<iostream.h>
Merge(int a[ ], int m, int b[n], int c[ ]) // m is size of array a and n is the size of array b
{
int i=0; // i points to the smallest element of the array a which is at index 0
int j=m-1; // j points to the smallest element of the array b which is at the index m-1 since
b
// is sorted in descending order
int k=0; //k points to the first element of the array c
void main()
{
int a[5]={2,4,5,6,7},m=5; //a is in ascending order
int b[6]={15,12,4,3,2,1},n=6; //b is in descending order
int c[11];
merge(a, m, b, n, c);
cout<<”The merged array is :\n”;
for(int i=0; i<m+n; i++)
cout<<c[i]<”, “;
}
Output is
The merged array is:
1, 2, 2, 3, 4, 4, 5, 6, 7, 12, 15
4 5 6
r
o
w
offset = row * Numcols + column
Example 1.
For a given array A[10][20] is stored in the memory along the row with each of its elements occupying 4
bytes. Calculate address of A[3][5] if the base address of array A is 5000.
Solution:
For given array A[M][N] where M=Number of rows, N =Number of Columns present in the array
address of A[I][J] = base address + sizeof ( type )* offset
address of A[I][J] = base address + sizeof ( type )* ( I * N + J )
here M=10, N=20, I=3, J=5, sizeof(type) = 4 bytes
address of A[3][5] = 5000 + 4 * (3 * 20 + 5)
= 5000 + 4*65 = 5000+260 = 5260
Example 2.
An array A[50][20] is stored in the memory along the row with each of its elements occupying 8 bytes. Find
out the location of A[5][10], if A[4][5] is stored at 4000.
Solution:
Calculate base address of A i.e. address of A[0][0]
For given array A[M][N] where M=Number of rows, N =Number of Columns present in the array
address of A[I][J] = base address + sizeof (type) * (I * N + J)
here M=50, N=20, sizeof(type)=8, I=4, J=5
address of A[4][5] = base address + 8 * (4*20 +5)
4000 = base address + 8 *85
Base address = 4000 – 85 * 8 = 4000 – 680 = 3320
Now to find address of A[5][10]
here M=50, N=20, sizeof(type)=8, I=5, J=10
Address of A[5][10] = base address + 8* (5*20 + 10)
= 3320 + 8*110 = 3320 + 880 = 4200
c
o
l
u
m
n
4 Marks Questions
1. Write a function in C++ which accepts an integer array and its size as arguments and replaces
elements having even values with its half and elements having odd values with twice its value
2. Write a function in C++ which accepts an integer array and its size as argument and exchanges the
value of first half side elements with the second half side elements of the array.
Example: If an array of eight elements has initial content as 2,4,1,6,7,9,23,10. The function should
rearrange the array as 7,9,23,10,2,4,1,6.
3. Write a function in c++ to find and display the sum of each row and each column of 2 dimensional
array. Use the array and its size as parameters with int as the data type of the array.
4. Write a function in C++, which accepts an integer array and its size as parameters and rearrange the
array in reverse. Example if an array of five members initially contains the elements as 6,7,8,13,9,19
Then the function should rearrange the array as 19,9,13,8,7,6
5. Write a function in C++, which accept an integer array and its size as arguments and swap the
elements of every even location with its following odd location. Example : if an array of nine
elements initially contains the elements as 2,4,1,6,5,7,9,23,10 Then the function should rearrange the
array as 4,2,6,1,7,5,23,9,10
6. Write a function in C++ which accepts an integer array and its size as arguments and replaces
elements having odd values with thrice and elements having even values with twice its value.
Example: If an array of five elements initially contains the elements 3,4,5,16,9 Then the function
should rearrange the content of the array as 9,8,15,32,27
STACKS, QUEUES AND LINKED LIST
Stack
In computer science, a stack is a last in, first out (LIFO) data structure. A stack can is characterized
by only two fundamental operations: push and pop. The push operation adds an item to the top of the stack.
The pop operation removes an item from the top of the stack, and returns this value to the caller.
Linked list
In Computer Science, a linked list (or more clearly, "singly-linked list") is a data structure that
consists of a sequence of nodes each of which contains data and a pointer which points (i.e., a link) to the
next node in the sequence.
stack::~stack() //de-allocated all undeleted nodes of the stack when stack goes out of
scope
{
node *t;
while(top!=NULL)
{
t=top;
top=top->next;
delete t;
}
};
void main()
{
stack s1;
s1.push(3);
s1.push(5);
s1.push(7);
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
cout<<s1.pop()<<endl;
}
Output is
7
5
3
Stack is empty 0
2. Scan X from left to right and REPEAT Steps 3 to 6 for each element of X UNTIL the STACK is
empty.
(a) Repeatedly pop from STACK and add to Y each operator which has the same precedence as or
higher precedence than operator.
(a) Repeatedly pop from the STACK and add to Y each operator until a left parenthesis is
encountered.
7. End
For example convert the infix expression (A+B)*(C-D)/E into postfix expression showing stack status
after every step.
Symbol scanned from infix Stack status Postfix expression
( ((
A (( A
+ ((+ A
B ((+ AB
) ( AB+
* (* AB+
( (*( AB+
C (*( AB+C
- (*(- AB+C
D (*(- AB+CD
) (* AB+CD-
/ (/ AB+CD-*
E (/ AB+CD-*E
) AB+CD-*E/
Answer: Postfix
expression of
(A+B)*(C-D)/E is
AB+CD-*E/
1. Read the next element //First element for the first time
4. Pop two operands from the stack //pop one operator in case of unary operator
5. Evaluate the expression formed by the two operands and the operator
7. If no-more-elements then
Else
Go to step 1.
8. End.
Example1: Evaluate the following postfix expression showing stack status after every step
8, 2, +, 5, 3, -, *, 4 /
token scanned from Stack status after processing the Operation performed
postfix expression scanned token
8 8 Push 8
2 8, 2 Push 2
+ 10 Op2=pop() i.e 2
Op1=pop() i.e 8
Push(op1+op2) i.e. 8+2
5 10, 5 Push(5)
3 10, 5, 3 Push(3)
/ 5 Op2=pop() i.e. 4
Op1=pop() i.e. 20
Push(op1/op2) i.e. 20/4
NULL Final result 5 Pop 5 and return 5
Example2:Evaluate the following Boolean postfix expression showing stack status after every step
True, False, True, AND, OR, False, NOT, AND
token scanned from Stack status after processing the Operation performed
postfix expression scanned token
True True Push True
Queue is a linear data structure which follows First in First out (FIFO) rule in which a new item is
added at the rear end and deletion of item is from the front end of the queue. In a FIFO data structure, the
first
element added to the queue will be the first one to be removed. Linear Queue implementation using Array
#include<iostream.h>
const int size=5; // size of queue
class queue
{ int front , rear;
int a[size];
public:
queue() //Constructor to create an empty queue
{ front=0;
rear=0;
}
#include<iostream.h>
struct node
{ int item;
node *next;
};
class queue
{ node *front, *rear;
public:
queue( ) // constructor to create empty queue
{ front=NULL;
rear=NULL;
}
void addQ(int item);
int delQ();
};
void queue::addQ(int item)
{ node * t=new node;
t->item=item;
t->next=NULL;
if (rear==NULL) //if the queue is empty
{ rear=t;
front=t; //rear and front both will point to the first node
}
else
{ rear->next=t;
rear=t;
}
}
int queue::delQ()
{ if(front==NULL)
cout<<”queue is empty”<<return 0;
else
{ node *t=front;
int r=t->item;
front=front->next; //move front to the next node of the queue
if(front==NULL)
rear==NULL;
delete t;
return r;
}
}
void main()
{ queue q1;
q1.addQ(3);
q1.addQ(5) ;
q1.addQ(7) ;
cout<<q1.delQ()<<endl ;
cout<<q1.delQ()<<endl ;
cout<<q1.delQ()<<endl;
cout<<q1.delQ()<<endl;
}
2,3 & 4 Marks Practice Questions
1. Convert the following infix expressions to postfix expressions using stack 2
(i) A + (B * C) ^ D – (E / F – G)
(ii) A * B / C * D ^ E * G / H
(iii) ((A*B)-((C_D)*E/F)*G
2. Evaluate the following postfix expression E given below; show the contents of the stack during the
evaluation
(i) E= 5,9,+2,/,4,1,1,3,_,*,+ 2
(ii) E= 80,35,20,-,25,5,+,-,*
(iii) E= 30,5,2,^,12,6,/,+,-
(iv) E=15, 3, 2, +, /, 7, + 2, *
3. An array A[40][10] is stored in the memory along the column with each element occupying 4 bytes. Find
out the address of the location A[3][6] if the location A[30][10] is stored at the address 9000.
3
4. Define functions in C++ to perform a PUSH and POP operation in a dynamically allocated stack
considering the following : 4
struct Node
{
int X,Y;
Node *Link;
};
class STACK
{
Node * Top;
public:
STACK( )
{ TOP=NULL;}
void PUSH( );
void POP( );
~STACK( );
};
5. Write a function in C++ to perform a Add and Delete operation in a dynamically allocated Queue
considering
the following: 4
struct node
{
int empno ;
char name[20] ;
float sal ;
Node *Link;
};
UNIT-3 DATABASE AND SQL
Data :- Raw facts and figures which are useful to an organization. We cannot take decisions on the
basis of data.
Information:- Well processed data is called information. We can take decisions on the basis of information
Field:- Set of characters that represents specific data element.
Record: Collection of fields is called a record. A record can have fields of different data types.
File: Collection of similar types of records is called a file.
Table: Collection of rows and columns that contains useful data/information is called a table. A table
generally refers to the passive entity which is kept in secondary storage device.
Relation: Relation (collection of rows and columns) generally refers to an active entity on which we
can perform various operations.
Database: Collection of logically related data along with its description is termed as database.
Tuple: A row in a relation is called a tuple.
Attribute: A column in a relation is called an attribute. It is also termed as field or data item.
Degree: Number of attributes in a relation is called degree of a relation.
Cardinality: Number of tuples in a relation is called cardinality of a relation.
Primary Key: Primary key is a key that can uniquely identifies the records/tuples in a relation. This key can
Relational Algebra
The relation algebra is the collection of operations on relations. Each operation takes one or more
relations (tables) and produces another relation as its result. The operations defined in relational algebra are
select, project, Cartesian product, union, set difference, set interception, natural join, division etc.
1. Select operation(denoted by σ ):- select operation is used to select rows from a elation <"
Let us consider the table item
ItemNo Item_Nam Price
e
I1 Milk 10
I2 Bread 15
I3 Ice Cream 25
I4 Namkeen 20
I5 Cake 10
2. Project Operation (denoted by π):- Project operation select columns from a relation.
Consider above table Item
To display item name & price of all items from Item table we can write
π Item_Name, Price (Item)
Result will be
Item_Nam Price
e
Milk 10
Bread 15
Ice Cream 25
Namkeen 20
Cake 10
3. The Cartesian product operation (denoted by X ):- the Cartesian product of relation A and B
is written as A X B. The Cartesian product yield a new relation having degree (Degree of A +
Degree of B) and Cardinality (cardinality of A X Cardinality of B)
Consider the following table student and instructor
4. The Union Operation (denoted by U):- it produces a relation that contains tuples from both
operand relations.
Consider the following relations science and commerce
5467 ajay XI
7665 sumit XI
5. The Set Difference Operation (Denoted by - ):- allows to find tuples that are in one relation but
not in another relation.
Consider above relation science and commerce
The result of Science - Commerce will be as follows
Adno Name Class
5467 ajay XI
6. The Set Interception Operation (denoted by ∩) :-Set Interception operation finds tuples that
are common to the two operand relations.
Consider above relation science and commerce
The result of Science ∩ Commerce will be as follows
Adno Name Class
a. List the names of those students who have obtained DIV I sorted by NAME.
b. Display a report, listing NAME, STIPEND, SUBJECT and amount of stipend received in a year
assuming that the STIPEND is paid every month.
c. To count the number of students who are either PHYSICS or COMPUTER SC graduates.
d. To insert a new row in the GRADUATE table: 11,”KAJOL”, 300, “computer sc”, 75, 1
e. Give the output of following sql statement based on table GRADUATE:
(i) Select MIN(AVERAGE) from GRADUATE where SUBJECT=”PHYSICS”;
(ii) Select SUM(STIPEND) from GRADUATE WHERE div=2;
(iii) Select AVG(STIPEND) from GRADUATE where AVERAGE>=65;
(iv) Select COUNT(distinct SUBJECT) from GRADUATE;
Sol :
a. SELECT NAME from GRADUATE where DIV = ‘I’ order by NAME;
b. SELECT NAME,STIPEND,SUBJECT, STIPEND*12 from GRADUATE;
c. SELECT SUBJECT,COUNT(*) from GRADUATE group by SUBJECT having
SUBJECT=’PHYISCS’ or SUBJECT=’COMPUTER SC’;
d. INSERT INTO GRADUATE values(11,’KAJOL’,300,’COMPUTER SC’,75,1);
e. (i) 63
(ii) 800
(iii) 475
(iv) 4
2. Consider the following tables Sender and Recipient. Write SQL commands for the statements (i) to
(iv) and give the outputs for SQL queries (v) to (viii).
Sender
SenderI SenderName SenderAddress City
D
Recipients
RecID SenderID RecName RecAddress recCity
3. Write SQL command for (a) to (f) on the basis of the table SPORTS
Table: SPORTS
Studen Class Name Game1 Grade Game2 Grade2
t
NO
a. Display the names of the students who have grade ‘C’ in either Game1 or Game2 or both.
b. Display the number of students getting grade ‘A’ in Cricket.
c. Display the names of the students who have same game for both Game1 and Game2.
d. Display the games taken up by the students, whose name starts with ‘A’.
e. Add a new column named ‘Marks’.
f. Assign a value 200 for Marks for all those who are getting grade ‘B’ or grade ‘A’ in both
Game1 and Game2.
4. Consider the following tables Stationary and Consumer. Write SQL commands for the statement (i)
to (iv) and output for SQL queries (v) to (viii):
Table: Stationary
S_ID StationaryName Company Price
Table: Consumer
C_ID ConsumerName Address S_ID
5. Consider the following tables GARMENT and FABRIC. Write SQL commands for the statements (i) to (iv) and
give outputs for SQL queries (v) to (viii).
Table : GARMENT
GCODE DESCRIPTION PRICE FCOD READYDATE
E
Table : FABRIC
FCOD TYPE
E
F04 POLYSTER
F02 COTTON
F03 SILK
F01 TERELENE
(i) To display GCODE and DESCRIPTION of a each dress in descending order of GCODE.
(ii) To display the details of all the GARMENTs, which have READYDATE in between 08–DEC–07
and 16–JUN–08 (inclusive of both the dates).
(iii) To display the average PRICE of all the GARMENTs, which are made up of FABRIC with
FCODE as F03.
(iv) To display FABRIC wise highest and lowest price of GARMENTs from DRESS table. (Display
FCODE of each GARMENT along with highest and lowest price)
(v) SELECT SUM (PRICE) FROM GARMENT WHERE FCODE= ‘F01’;
(vi) SELECT DESCRIPTION, TYPE FROM GARMENT, FABRIC WHERE GARMENT.FCODE =
FABRIC. FCODE AND GARMENT. PRICE>=1260;
(vii) SELECT MAX (FCODE) FROM FABRIC;
(viii) SELECT COUNT (DISTINCT PRICE) FROM FABRIC;
UNIT-4 BOOLEAN LOGIC
Low Order Thinking Questions: (Boolean Algebra)
1. State and verify absorption law in Boolean algebra.
Ans. Absorption Law states that :
a. X+XY=X b. X(X+Y)=X
2. Verify X’.Y+X.Y’=(X’+Y’).(X+Y) algebraically.
Ans. LHS = X’Y + XY’
= (X’+X) (X’+Y’) (Y+X) (Y+Y’)
= 1.(X’+Y’) (X+Y).1
= (X’+Y’) (X+Y)
= RHS, hence proved
3. Write the equivalent Boolean Expression F for the following circuit diagram :
Ans.: A’B+AB+B’C
4. If F(P,Q,R,S) = Π (3,4,5,6,7,13,15) , obtain the simplified form using K-Map.
Ans.:
P+Q
0
P+Q’
0 0 0 0
P’+Q’
0 0
P’+Q
5. F(a,b,c,d)=Σ(0,2,4,5,7,8,10,12,13,15)
F(a,b,c,d) = B1 + B2 + B3
B1 = m0+m4+m12+m8 = c’d’
B2 = m5+m7+m13+m15 = bd
B3 = m0+m2+m8+m10 = b’d’
F(a,b,c,d) = c’d’ + bd + b’d’
6. Write the equivalent Boolean expression for the following logic circuit:
X Y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1
Express in the product of sums form, the Boolean function F(X,Y,Z), the truth table for which is
given below:
5. Write the equivalent Boolean Expression F for the following circuit diagram : 2
6. Write the equivalent Boolean Expression F for the following circuit diagram : 2
7. Convert the following Boolean expression into its equivalent Canonical Sum of Product Form((SOP)
(X’+Y+Z’).(X’+Y+Z).(X’+Y’+Z).(X’+Y’+Z’) 1
8. Convert the following Boolean expression into its equivalent Canonical Product of Sum form (POS):
A.B’.C + A’.B.C +A’.B.C’ 1
10. Write the equivalent Boolean Expression F for the following circuit diagram: 2
SWITCHING TECHNIQUES
Switching techniques are used for transmitting data across networks.
Different types are:
1. Circuit Switching: In the Circuit Switching technique, first, the complete end-to-end transmission path
between the source and the destination computers is established and then the message is transmitted through
the path. The main advantage of this technique is guaranteed delivery of the message. Mostly used for voice
communication.
2. Message Switching: In the Message switching technique, no physical path is established between sender
and receiver in advance. This technique follows the store and forward mechanism.
3. Packet Switching: In this switching technique fixed size of packet can be transmitted across the network
Transmission media:
1. Twisted pair cable: - It consists of two identical 1 mm thick copper wires
insulated and twisted together. The twisted pair cables are twisted in order to
reduce crosstalk and electromagnetic induction.
Advantages:
(i) It is easy to install and maintain.
(ii) It is very inexpensive
Disadvantages:
(i) It is incapable to carry a signal over long distances without the use of repeaters.
(ii) Due to low bandwidth, these are unsuitable for broadband applications.
2. Co-axial Cables: It consists of a solid wire core surrounded by
one or more foil or braided wire shields, each separated from the
other by some kind of plastic insulator. It is mostly used in the
cable wires.
Advantages:
(i) Data transmission rate is better than twisted pair cables.
(ii) It provides a cheap means of transporting multi-channel
television signals around metropolitan areas.
Disadvantages:
(i) Expensive than twisted pair cables.
(ii) Difficult to manage and reconfigure.
3. Optical fiber: - An optical fiber consists of thin glass fibers that can
carry information in the form of visible light.
Advantages:
(i) Transmit data over long distance with high security.
(ii) Data transmission speed is high
(iii) Provide better noise immunity
(iv) Bandwidth is up to 10 Gbps.
Disadvantages:
(i) Expensive as compared to other guided media.
(ii) Need special care while installation?
4. Infrared: - The infrared light transmits data through the air and can
propagate throughout a room, but will not penetrate walls. It is a secure medium of signal transmission.
The infrared transmission has become common in TV remotes, automotive garage doors, wireless
speakers etc.
5. Radio Wave: - Radio Wave an electromagnetic wave
with a wavelength between 0.5 cm and 30,000m. The
transmission making use of radio frequencies is termed as
radio-wave transmission
Advantages:
(i) Radio wave transmission offers mobility.
(ii) It is cheaper than laying cables and fibers.
(iii) It offers ease of communication over difficult terrain.
Disadvantages:
(i) Radio wave communication is insecure communication.
(ii) Radio wave propagation is susceptible to weather effects like rains, thunder storms etc.
6. Microwave Wave: - The Microwave transmission is a line of sight transmission. Microwave signals
travel at a higher frequency than radio waves and are popularly used for transmitting data over long
distances.
Advantages:
(i) It is cheaper than laying cable or fiber.
(ii) It has the ability to communicate over oceans.
Disadvantages:
(i) Microwave communication is an insecure communication.
(ii) Signals from antenna may split up and transmitted in different way to different antenna which leads to
reduce to signal strength.
(iii) Microwave propagation is susceptible to weather effects like rains, thunder storms etc.
(iv) Bandwidth allocation is extremely limited in case of microwaves.
7. Satellite link: - The satellite transmission is also a kind of line of sight transmission that is used to
transmit signals throughout the world.
Advantages:
(i) Area covered is quite large.
(ii) No line of sight restrictions such as natural mountains, tall building, towers etc.
(iii) Earth station which receives the signals can be fixed position or relatively mobile.
Disadvantages:-
(i) Very expensive as compared to other transmission mediums.
(ii) Installation is extremely complex.
(iii) Signals sent to the stations can be tampered by external interference
Network devices:
Modem: A MODEM (MOdulator DEModulator) is an electronic device that enables a computer to transmit
data over telephone lines. There are two types of modems, namely, internal modem and external modem.
RJ45 connector: - The RJ-45(Registered Jack) connectors are the plug-in devices used in the networking
and telecommunications applications. They are used primarily for connecting LANs, particularly Ethernet.
Ethernet Card: - It is a hardware device that helps in connection of nodes within a network.
Hub: A hub is a hardware device used to connect several computers together. Hubs can be either active or
passive. Hubs usually can support 8, 12 or 24 RJ45 ports.
Switch: A switch (switching hub) is a network device which is used to interconnect computers or devices on
a network. It filters and forwards data packets across a network. The main difference between hub and
switch is that hub replicates what it receives on one port onto all the other ports while switch keeps a record
of the MAC addresses of the devices attached to it.
Gateway: A gateway is a device that connects dissimilar networks.
Repeater: A repeater is a network device that amplifies and restores signals for long distance transmission.
PAN (Personal Area Network): A Personal Area Network is computer network organized around an
individual person. It generally covers a range of less than 10 meters. Personal Area Networks can be
constructed with cables or wirelessly.
Network protocol
A protocol means the rules that are applicable for a network.
It defines the standardized format for data packets, techniques for detecting and correcting errors and so
on.
A protocol is a formal description of message formats and the rules that two or more machines must follow
to exchange those messages.
E.g. using library books.
3. WLL(Wireless in Local Loop) : WLL is a system that connects subscribers to the public switched
telephone network using radio signals as a substitute for other connecting media.
4. Email(Electronic Mail): Email is sending and receiving messages by computer.
5. Chat: Online textual talk in real time , is called Chatting.
6. Video Conferencing: a two way videophone conversation among multiple participants is called video
conferencing.
7. SMS(Short Message Service): SMS is the transmission of short text messages to and from a mobile
pone, fax machine and or IP address.
8. 3G and EDGE: 3G is a specification for the third generation of mobile communication of mobile
communication technology. 3G promises increased bandwidth, up to 384 Kbps when a device is stationary.
EDGE(Enhanced Data rates for Global Evolution ) is a radio based high speed mobile data standard.
Network Security Concepts:
Viruses: Viruses are programs which replicate and attach to other programs in order to corrupt the
executable codes. Virus enters the computer system through an external source and become destructive.
Worms: Worms are also self- replicating programs that do not create multiple copies of itself on one
computer but propagate through the computer network. Worms log on to computer systems using the
username and passwords and exploit the system.
Trojan horse: - Though it is a useful program, however, a cracker can use it to intrude the computer system
in order to exploit the resources. Such a program can also enter into the computer through an email or free
programs downloaded through the Internet.
Spams: Unwanted e-mail (usually of a commercial nature sent out in bulk)
Cookies: Cookies are the text messages sent by a web server to the web browser primarily for identifying
the user.
Firewall: A firewall is used to control the traffic between computer networks. It intercepts the packets
between the computer networks and allows only authorized packets to pass.
Cyber Law: Cyber law refers to all the legal and regulatory aspects of Internet and the World Wide Web.
Cyber Crimes: Cyber crime involves the usage of the computer system and the computer network for
criminal activity.
Hacking: Hacking is an unauthorized access to computer in order to exploit the resources.
Web Services:
WWW: The World Wide Web or W3 or simply the Web is a collection of linked documents or pages, stored
on millions of computers and distributed across the Internet.
HTML (Hyper Text Markup Language):- HTML is a computer language that describes the structure and
behavior of a web page. This language is used to create web pages.
XML (eXtensible Markup Language):- Extensible Markup Language (XML) is a meta language that helps
to describe the markup language.
HTTP (Hyper Text Transfer Protocol):- A protocol to transfer hypertext requests and information between
servers and browsers.
Domain Names: A domain name is a unique name that identifies a particular website and represents the
name of the server where the web pages reside.
URL:- The Uniform Resource Locator is a means to locate resources such as web pages on the Internet.
URL is also a method to address the web pages on the Internet. There are two types of URL, namely,
absolute URL and relative URL.
Website: A collection of related web pages stored on a web server is known as a website.
Web browser: A software application that enables to browse, search and collect information from the Web
is known as Web browser.
Web Servers: The web pages on the Internet are stored on the computers that are connected to the Internet.
These computers are known as web servers.
Web Hosting: - Web Hosting or website hosting is the service to host, store and maintain the websites on
the World Wide Web.
Web Scripting: - The process of creating and embedding scripts in a web page is known as Web Scripting.
Types of Scripts:-
(i) Client Side Scripts: - Client side scripts supports interaction within a webpage. E.g. VB Script, Java
Script, PHP (PHP‟S Hypertext Preprocessor).
(ii) Server Side Scripts: - Server side scripting supports execution at server – end. E.g. ASP, JSP, PHP
1. Knowledge Supplement Organization has set up its new centre at Manglore for its office and web
based activities. It has four buildings as shown in the diagram below:
Alph Gam
a ma
Lam
Beta
bda
a. Number of Computers:
Block M 15
Block R 100
Block A 50
Block P 150
UP LUCKNOW
Sales
Head
office
office
Prod
office
Varanasi Kanpur
office Saharanpur office
office
An approximate distance between these offices as per network survey team is as follows:
Sales office 25
Prod office 56
Varanasi Office 85
i) Suggest the placement of the repeater with justification. Name the branch where the server
should be installed. Justify your answer.
ii) Suggest the device to be procured by the company for connecting all the computers within
each of its offices out of the following devices:
Modem
Telephone
Switch/Hub
iv) The company is planning to link its head office situated in Lucknow with the office at Saharanpur.
Suggest an economic way to connect it; the company is ready to compromise on the speed of
connectivity. Justify your answer.
4. Dr. Rizvi Education Society of India is starting its new CBSE School in Mumbai (Maharashtra). The
society is already running a School in Jaunpur (UP) named Dr. Rizvi Learners’ Academy, having 3
major buildings in 2 km area campus. As a network expert you need to suggest the network plan as
per E1 to E4:
Library Building 20
Admin building 35
Mumbai School 5
E1. Suggest the cable layout among various buildings inside school campus for connecting the
buildings.
E2. Suggest the most suitable place to house the server of the school with a suitable reason.
E3. Suggest an efficient device from the following to be installed in each of the building to
connect all the computers:
E4. Suggest the most suitable service (very high speed) to provide data connectivity between
Rizvi Learners’ in Jaunpur and Mumbai CBSE School from the options
1 Entire bandwidth of the cable is consumed Broadband transmission, signals are sent on multiple
by a signal frequencies, allowing multiple signals to be sent
simultaneously.
2 If you have a user account on the domain, you can logon Each computer has a set of accounts.
to any computer on the domain.
3 There can be 100+ computers Typically not more then 20-30 computers
4 The computers can be on different local All computers must be on the same local
network network.
Q.8 what is the differences between POP3 and IMAP Mail Server?
Ans. IMAP is a standard protocol for accessing e-mail from a local server. A simpler e-mail protocol is Post
Office Protocol 3 (POP3), which download mail to the computer and does not maintain the mail on the
server. IMAP, e-mails are stored on the server, while in POP3, the messages are transferred to the client’s
computer when they are read.
Q.9 Name different layer of the ISO OSI Model.
Ans. International Standard Orrganisation – Open Systems Interconnection has seven layers; Physical
Layer,Data Link Layer,Network Layer,Transport Layer,Session Layer,Presentation Layer Application Layer
Q.10 What is client server architecture?
Ans. To designated a particular node which is well known and fixed address, to provide a service to the
network as a whole. The node providing the service is known as the server and the nodes that use that
services are called clients of that server. This type of network is called Client-Server Architecture.
Q.11 What is FDM? Give example.
Ans. FDM-Frequency Division Multiplexing is used in analog transmission. It is often used in short
distance. It is code transparent and any terminal of the same speed can use the same sub-channel after the
sub-channel is established. The best example if FDM is the way we receive various stations in a radio.
Q.12 Describe the following in brief:
i) MOSAIC ii) USENET iii) WAIS
Ans. i) MOSAIC: is the program for cruising the internet. The National centre wrote this program for Super
Computer application at the university of Illinois. It has a simple window interface, which creates useful
hypertext links that automatically perform some of the menu bar and button functions.
ii) USENET: is the way to meet people and share information. Usenet newsgroup is a special group set up
by people who want to share common interests ranging from current topic to cultural heritages.
iii) WAIS: is a WIDE AREA INFORMATION SERVER.
Computer Science (Code 083)
Sample Paper Set - 1
Max. Marks: 70 Duration: 3 Hours
1.
(a) What is the difference between Global Variable and Local Variable? 2
(b) Write the names of the header files to which the following belong: 1
(i) strcmp() (ii) fabs()
(c) Rewrite the following program after removing the syntactical errors (if any). 2
Underline each correction.
#include [iostream.h]
class PAYITNOW
{
int Charge;
PUBLIC:
void Raise(){cin>>Charge;}
void Show{cout<<Charge;}
};
void main()
{
PAYITNOW P;
P.Raise();
Show();
}
(f) In the following program, if the value of N given by the user is 15, what 2
maximum and minimum values the program could possibly display?
#include <iostream.h>
#include <stdlib.h>
void main()
{
int N,Guessme;
randomize();
cin>>N;
Guessme=random(N)+10;
cout<<Guessme<<endl;
}
2.
(a) What do you understand by Data Encapsulation and Data Hiding? 2
a) Answer the questions (i) and (ii) after going through the following class: 2
class Seminar
{
int Time;
public:
Seminar() //Function 1
{
Time=30;cout<<”Seminar starts now”<<end1;
}
void Lecture() //Function 2
{
cout<<”Lectures in the seminar on”<<end1;
}
Seminar(int Duration) //Function 3
{
Time=Duration;cout<<”Seminar starts now”<<end1;
}
~Seminar() //Function 4
{
cout<<”Vote of thanks”<<end1;
}
};
i) In Object Oriented Programming, what is Function 4 referred as and when does it get
invoked/called?
ii) In Object Oriented Programming, which concept is illustrated by Function 1 and Function 3
together? Write an example illustrating the calls for these functions.
class BRANCH
{
char CITY[20];
protected:
float Employees;
public:
BRANCH();
void Haveit();
void Giveit();
};
public:
AUTHOR();
void Start();
void Show();
};
(i) Write the names of data members, which are accessible from objects belonging to class
AUTHOR.
(ii) Write the names of all the member functions which are accessible from objects belonging to
class BRANCH.
(iii) Write the names of all the members which are accessible from member functions of
class AUTHOR.
(iv)How many bytes will be required by an object belonging to class AUTHOR?
3.
(a) Write a function in C++ to merge the contents of two sorted arrays A & B into third array C.
Assuming array A is sorted in ascending order, B is sorted in descending order, the resultant
array is required to be in ascending order.
4
(b) An array S[40][30] is stored in the memory along the row with each of the element occupying 2
bytes, find out the memory location for the element S[20][10], if an element S[15][5] is stored at
the memory location 5500. 4
(c) Write a function in C++ to perform Insert operation in a dynamically allocated Queue
containing names of students. 4
(d) Write a function in C++ to find the sum of both left and right diagonal elements from a two
dimensional array (matrix). 2
4.
(a) Observe the program segment given below carefully and fill the blanks marked as Statement 1
and Statement 2 using seekp() and seekg() functions for performing the required task. 1
#include <fstream.h>
class Item
{
int Ino;char Item[20];
public:
//Function to search and display the content from a
particular //record number
void Search(int );
//Function to modify the content of a particular record number
void Modify(int);
};
(c) Write a function in C++ to search for a BookNo from a binary file “BOOK.DAT”, assuming the
binary file is containing the objects of the following class. 3
class BOOK
{
int Bno;
char Title[20];
public:
int RBno(){return Bno;}
void Enter(){cin>>Bno;gets(Title);}
void Display(){cout<<Bno<<Title<<endl;}
};
5.
(a) What do you understand by Degree and Cardinality of a table? 2
(b) Consider the following tables ACTIVITY and COACH. Write SQL commands for the
statements (i) to (iv) and give outputs for SQL queries (v) to (viii) 6
Table: ACTIVITY
ACode ActivityName ParticipantsNu PrizeMoney ScheduleDate
m
1001 Relay 100x4 16 10000 23-Jan-2004
1002 High jump 10 12000 12-Dec-2003
1003 Shot Put 12 8000 14-Feb-2004
1005 Long Jump 12 9000 01-Jan-2004
1008 Discuss Throw 10 15000 19-Mar-2004
Table: COACH
PCode Name ACode
1 Ahmad 1001
Hussain
2 Ravinder 1008
3 Janila 1001
4 Naaz 1003
(i) To display the name of all activities with their Acodes in descending order.
(ii) To display sum of PrizeMoney for each of the Number of participants groupings (as shown
in column ParticipantsNum 10,12,16)
(iii) To display the coach’s name and ACodes in ascending order of ACode from the table
COACH
(iv) To display the content of the GAMES table whose ScheduleDate earliar than 01/01/2004 in
ascending order of ParticipantNum.
6.
(a) State and verify Demorgan’s Laws. 2
(b) Write the equivalent Boolean Expression for the following Logic Circuit 2
(c) Write the POS form of a Boolean function F, which is represented in a truth table 1
as follows:
U V W F
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
d) What is the purpose of using a Web Browser? Name any one commonly used Web Browser. 1
e) Knowledge Supplement Organisation has set up its new center at Mangalore for its office and web based
activities. It has 4 blocks of buildings as shown in the diagram below:
Block Block
A C
Bloc
Block
kB
D
Number of Computers
Black A 25
Block B 50
Block C 125
Block D 10
e2) Suggest the most suitable place (i.e. block) to house the server of this organisation with a suitable
reason. 1
e4) The organization is planning to link its front office situated in the city in a hilly region where cable
connection is not feasible, suggest an economic way to connect it with reasonably high speed?
1
*************************
CBSE OUTSIDE DELHI 2013-14
(Downloaded from CBSE Academics website)