Professional Documents
Culture Documents
AISSCE 2019
MARKING SCHEME - COMPUTER SCIENCE
1) a) void, char, int, float, double (any 4)
b) iostream.h & string.h
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
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"
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;
}
}
OR
Page 3
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
}
}
OR
m=20, n=30, w=2, ba=25000
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(“MESSAGE.TXT”);
ofstream fout(“SMS.TXT”);
int ctr=0;
char ch;
while(!fin.eof())
{
fin.get(ch);
ctr++;
if(ctr>150)
break;
fout<<ch;
}
fin.close();
fout.close();
}
4.a)
OR
Page 6
4.a)
AISSCE - 2019MARKING SCHEME-COMPUTER SCIENCE"
void LongWords()
{
iIfstream fin(“CONTENTS.TXT”);
char ch[20];
int l=0;
while(!fin.eof())
{
fin>>ch;
if(strlen(ch)>9)
cout<<ch<<" ";
}
fin.close();
}
void TotalPrice()
{
iIfstream fin(“STOCK.DAT”);
Stock s;
while(fin.read((char*)&s,sizeof(s)))
{
if(s.Rprice()>150)
cout<<s.Rname();
}
fin.close();
}
b) OR
void Details(int N)
{
iIfstream fin(“DOCTORS.DAT”);
Doctor s;
while(fin.read((char*)&s,sizeof(s)))
{
if(s.GetNo()==N)
s.show();
}
fin.close();
}
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"
(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)
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