AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
AISSCE 2019
MARKING SCHEME - COMPUTER SCIENCE
1) a) void, char, int, float, double (any 4)
b) iostream.h & string.h
#define Area(L,B) L*B
struct Recta
{
c) int Length, Breadth;
};
void main()
{
Recta R = {10, 15};
cout<<Area([Link], [Link]);
}
d) Second & First
First * Second
3.0 * 8
e) 2.5 * 4
1.5 * 3
f) (iii) 30$40$50$60$
minIMUM 1, max 5
(i) Statement 3
II) a) (ii) Copy Constructor
Test T4(T1)
b)
(i) Destructor, When the scope of the object P is over (when the program terminates)
(ii) Points are 20 & 5
OR
Polymorphism - The ability of a message to be expressed in different forms
eg:
void area(float r) Function 1
{
b) cout<< 3.14*r*r;
}
void area(int l,int b) Function 2
{
cout<< l * b;
}
area(3.5); Function 1 is called
area(10,20); Function 2 is called
Page 1
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
class GRAPH
{
int Xunit, Yunit;
char Type[20];
void AssignType()
{
if(Xunit==0 ||Yunit==0)
c) strcpy(Type,"None");
else if(Xunit>Yunit)
strcpy(Type,"Bar");
else if(Xunit < Yunit)
strcpy(Type,"Line");
}
public :
void InXY()
{
cin>>XUnit>>YUnit;
AssignType();
}
void OutXY()
{
cout<<XUnit<<" "<<Yunit<<" "<<Type<<endl;
}
};
(i) Multilevel
(ii) Data Members : Labs
d) Member Functions : put(), Get(), Take()
(iii) Data Members : Roof
Member Functions : Take(), Give(), In()
(iv) Data Members : None
Member Functions : Take(), Give(), In() , Out()
OR
Page 2
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
class FrontOffice : protected HeadQuarter
{
char Location[10];
double Budget;
public: FrontOffice()
d) {
Budget= 100000;
}
void Assign()
{
gets(Location);
cin>>Budget;
}
void Display()
{
cout<< Location <<" "<<Budget;
}
};
Void NoTwoThree(int Arr[], int N)
{
for( int i=0;i<N;i++)
If(Arr[i]%2!=0 && Arr[i]%3!=0)
cout<<Arr[i]<<” at Location ”<< i<<endl;
}
OR
3. a)
Void ReArrange(int Arr[], int N)
{
for( int i=0j=nN-1;i<N/2;i++.j--)
{
int t=Arr[i];
Arr[i]=Arr[j];
Arr[j]=t;
}
}
Void XOXO(char M[4][4])
{
for( int i=0;i<4;i++)
for( int j=0;j<4;j++)
{
b) if(M[i][j]=='X')
M[i][j]='O';
else if(M[i][j]=='O')
M[i][j]='X';
}
}
OR
Page 3
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Void ColSwap(int A[4][4])
{
for( int i=0;i<4;i++)
{
int t=A[i][0];
A[i][0]= a[i][2];
A[i][2]= a[i][t];
}
}
m=20, n=10, w=2
Adrr of P[5][2]=ba+w(n(i-lbr)+(j-lbc))=25000
=ba+2(10(5-0)+(2-0) =25000
=ba+104 =25000
ba=25000-104 = 24896
Addr of P[10][5] =24896+2(10(10-0)+(5-0)
c) =24896+210 =25106
OR
m=20, n=30, w=2, ba=25000
Adrr of P[5][6] =25000+2((5-0)+20(6-0)
=25000+250 =25250
Int T=-1;
void pop(Book B[],int &T)
{
If(T==-1)
{
Cout<<”\nStack Underflow”;
Return;
}
Cout<<”\nPopped element is”<<B[T].Bno<<” “<<B[T].Bname<<endl
T--;
}
OR
d)
Page 4
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
d)
void BookStack::Push()
{
Book *ptr=new Book;
cin>>ptr->Bno;
gets(ptr->Bname;
ptr->link=NULL;
if(Top==NULL )
Top=ptr;
else
{
ptr->Link=Top;
Top=ptr;
}
}
Answer: 50
OR
e)
Page 5
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
e)
void LongToShort()
{
iIfstream fin(“[Link]”);
ofstream fout(“[Link]”);
int ctr=0;
char ch;
while(![Link]())
{
[Link](ch);
ctr++;
if(ctr>150)
break;
fout<<ch;
}
[Link]();
[Link]();
}
4.a)
OR
Page 6
4.a)
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
void LongWords()
{
iIfstream fin(“[Link]”);
char ch[20];
int l=0;
while(![Link]())
{
fin>>ch;
if(strlen(ch)>9)
cout<<ch<<" ";
}
[Link]();
}
void TotalPrice()
{
iIfstream fin(“[Link]”);
Stock s;
while([Link]((char*)&s,sizeof(s)))
{
if([Link]()>150)
cout<<[Link]();
}
[Link]();
}
b) OR
void Details(int N)
{
iIfstream fin(“[Link]”);
Doctor s;
while([Link]((char*)&s,sizeof(s)))
{
if([Link]()==N)
[Link]();
}
[Link]();
}
Read :2
Read: 4
OR
c)
seekg() will place the get pointer at the specified byte number.
tellg() returns the byte number of the get pointer
Seekg() will place the get pointer at the specified byte number.
tellg() returns the byte number of the get pointer
SECTION C
5 (i) select * from TRAINS wHERE START="New Delhi";
(ii) select PNR, PNAME, GENDER,AGE FROM PASSENGERS WHERE AGE<50;
(iii) SELECT GENDER, COUNT(*) FROM PASSENGERS GROUP BY GENDER;
Page 7
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
(iv) SELECT * FROM PASSENGERS WHERE TNO=12015;
(v) MAX(TRAVELDATE) MIN(TRAVELDATE)
2018-11-10 2018-05-09
(vi) END COUNT(*)
Habibganj 2
Amritsar Junction 2
New Delhi 4
(vi) END COUNT(*)
Habibganj 2
Amritsar Junction 2
New Delhi
(vii) DISTINCT TRAVELDATE
2018-12-25
2018-11-10
2018-10-12
2018-05-09
(viii) TNAME PNAME
Amritsar Mail N S SINGH
Swarna Shatabdi J K SHARMA
Swarna Shatabdi R SHARMA
(X +Y).Z = X.Y+X.Z
6. a)
Hence Proved
b) Page 8
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
b)
c) (X+Y+Z').(X+Y'+Z').(X'+Y'+Z).(X'+Y'+Z')
d)
7.a) Trojan Horse
b) VoIP
1. 4G is very fast compared to 3G
c) 2. 4G has very frequency and download rate than 3G
3. 4G provdes Mobile web access
MBPS - Muga Bytes Per Scecond
d) WAN - Wide Area Network
CDMA - Code Division Multiple Access
WLL - Wireless in Local Loop
e i) Admin Block
ii) Switch
iii) Star Topolgy
iv) ethernet cable
Page 9
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
2
1
Page 10
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 11
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 12
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 13
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 14
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 15
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 16
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 17
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
Page 18
