Guru Gobind Singh Indraprastha Vishwavidyalaya 2008-2nd Year B.C.A Computer Application Object Oriented Programming, Third Semester, End Term , Year , , - Question Paper
intmr itnm/wmt
_ intoDSjMism iwai pi iMMP-;
I paper Coda. 6CAt9t Sutfct Otfct Or**md PrvgnmmHtg
'hptrttMM (Btch M06-M97)__
nm*: jHoun _ ____ _ _ ___MuJmm Mtrta :tt_
r moM~Amnpta*qvmtton* mtmtticfiotciitmdkwtid
jHNt (W* maa* adwentage* of oCveotenentad programmmg 0acr*e aach advartage by gwmg a amiable example.
, yfii ppecrfeefteuaegaofoonetnC**
jm Owe anexampieofa genenec|* Explain I.
M tfw difference between a defeUI ecnttwctor and a copy cowrvm
jjf How art virtual fundon* implemented M C++?
</f\ Whmone<einhentanoe? Wiat are tt advantage* and dnadwttget?
'jary+rt DmN Wtne funcOona be used niMM of pKn oW * Mine macro*?
''JW 0n an example m tte term of code to 9<am me ue of a template (0 Vtttywdebugpng required? GweMMabieexamplee to fustrfyi
t it Eacepuon handing Whet are m ueea? <2.lx102S)
02 (a>-'MeeC+programtoar<owtMconceptofinhertanca (J) .( Wrtleshortftota*on- k2M>
<l) totormaeon MOng (I) Abstraction (w<fi sunaWO examplee/program)
OH
(a) VW*t n polymorphic? How can run Bm* potymorpJwn m implemented? How w tale boomg related to It? Gwe tuttWe exampwe (6.9)
(b) Gne short not** on * (Jx24) (I) Dynemc memory alocabon (10 Fincwnai decompeoftton
03 (a) Create a ciaaa canafl '*went\ Mm multiple conttnxaor* in r dan nclude method* to
generate raport-oanj of marks obtained in S subject* The program houM run and deplay (he reeulta tar atleeet 20 students The program should uee the concept of dynnc memory aBocadon (43)
Owe short note on garbage wiataon wjC++ (3)
How do we alocata muibdmannonai array uang new? 13)
OR
(a) Vftee a progiam in C++ to show tie concept of metectass (4)
<b) How are C++ objects laid out in memory? (4)
(c) Can a proyammer fcee () po**** atocoaa with new? Can ha delete porter* etocated wh maNoc <>? Expkan (4J)
04 (a) V*tM tfwl noiea on:- (3*1)
(1) Method and Paramewc pomorpNsm
(ii) Orfleroncea between overtoedlng and ovenUng m Wr*e a dae* linked quene*' in C++. TNi dess moUd Mm luncdons lor adding or deleting an flam ton ne queue after neceaaary cheoka The Mad queue * not to be implemented uemg arrays (C.i)
OR
Crve Mlaience Between compoMon and claaeScebon hererehy uamg sutatte code (3) a cod* n C++ to show Vie concept of operator overloading (*.)
tiree cperaiora 9*t cannot be overtoeded Ore ther ywooo n C++ aiao (3)
(avNita a gananc twap macro n C - A macro can nwep any r>pe of data (w. rt char. r (ML ttructatc) (8)
Wrkaanortneiaaon- {2.Sx37.)
jA Nemeapeoei and thaw a<Vantsge
o) tXerwnoe between muNtavei and munpie wftantance (M PorMtant object*
Ofi
(a) Wrca a program in C++ to thow Ih* concept of eaeepbon handing How do *e change tna tmng lengn of an array of char to prwant memory leaM even V aomeone *>row an eacapton? (t.S)
<b) Wme short note*on* (2x3>9)
(l) Me open () and doae () tjntax
(h) Straama and Os type*
(0 lAMy of generic claae
01
OS
|
Attachment: |
| Earning: Approval pending. |
