PUNJABI UNIVERSITY, PATIALA

ORDINANCES AND OUTLINES OF TESTS, SYLLABI AND COURSES OF READING FOR M.TECH (Part Time (COMPUTER SCIENCE ! ENGINEERING PART"I (#ST ! $%& SEMESTER $'#("#) ! $'#)"#* Se++i,%

DEPARTMENT OF COMPUTER SCIENCE PUNJABI UNIVERSITY PATIALA

SYLLABUS OUTLINES OF PAPERS AND TESTS M. TECH (COMPUTER SCIENCE ! ENGINEERING (PART TIME FIRST YEAR"FIRST SEMESTER E-AMINATIONS $'#("#) ! $'#)"#* Se++i,% CODE NO. CS-611 CS-615 CS-616 TITLE OF PAPER Object Oriented Programming Using C++ Data Structures !"gorit#ms So$t%are &ab-' (C++ and Data Structures) +ota" CONTINUOUS ASSESSMENT 50 50 60 160 UNIVERSITY E-AMINATION 50 50 *0 1*0 MA-IMUM MAR.S 100 100 100 300 TIME ALLO/ED 3 Hrs. 3 Hrs. 3 Hrs.

M. TECH (COMPUTER SCIENCE ! ENGINEERING (PART TIME FIRST YEAR"SECOND SEMESTER E-AMINATIONS $'#("#) ! $'#)"#* Se++i,% CS-61, CS-613 CS-61* O-erating S.stems Com-uter !rc#itecture Para""e" Processing Database /anagement S.stem +ota" 50 50 50 150 50 50 50 150 100 100 100 300 3 Hrs 3 Hrs. 3 Hrs.

CONTINUOUS ASSESSMENT (THEORY PAPERS) 1. . $. %. Two tests will be conducted during the Semester. Both the tests will be considered for assessment. Assessment!"ui##es Attendance Class &artici'ation and beha(iour : : : : 60% of the marks allotted for Continuous Assessment 0% of the marks allotted for Continuous Assessment 10% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

CS"0## OBJECT ORIENTED PROGRAMMING USING C11 LTPC )#'* Ma2im3m Mar4+5 *' Mi%im3m Pa++ Mar4+5 )'6 Ma2im3m Time5 ( Hr+. Le7t3re+ t, 8e &e9i:ere&5 **"0'

A I%+tr37ti,%+ ;,r <a<er"+etter+ +#e 0uestion -a-er %i"" consist o$ $i1e sections !2 32 C2 D and 4. Sections !2 32 C and D %i"" #a1e t%o 0uestions $rom t#e res-ecti1e sections o$ t#e s.""abus and %i"" carr. ,05 mar6s eac#. Section 4 %i"" #a1e 5-10 s#ort ans%er t.-e 0uestions %#ic# %i"" co1er t#e entire s.""abus uni$orm". and %i"" carr. ,05 mar6s in a"". B I%+tr37ti,%+ ;,r 7a%&i&ate+ 1. Candidates are re0uired to attem-t one 0uestion eac# $rom sections !2 32 C and D o$ t#e 0uestion -a-er and t#e entire section 4. ,. Use o$ non -rogrammab"e scienti$ic ca"cu"ator is a""o%ed. SECTION A E:,93ti,% ,; OOP5 Procedure Oriented Programming2 OOP Paradigm2 !d1antages and disad1antages o$ OOP o1er its -redecessor -aradigms. C=ara7teri+ti7+ ,; O8>e7t Orie%te& Pr,?rammi%?7 !bstraction2 4nca-su"ation2 Data #iding2 'n#eritance2 Po".mor-#ism2 Code 48tensibi"it. and 9eusabi"it.2 User de$ined Data +.-es. I%tr,&37ti,% t, C115 'denti$ier2 :e.%ords2 Constants2. O-erators7 !rit#metic2 re"ationa"2 "ogica"2 conditiona" and assignment2 si;e o$ o-erator2 o-erator -recedence and associati1it.. +.-e con1ersion2 1ariab"e dec"aration2 e8-ressions2 statements2 mani-u"ators. 'n-ut and out-ut statements2 stream '<O2 Conditiona" and 'terati1e statements2 brea6ing contro" statements. SECTION B Storage C"asses7 !utomatic2 Static2 48tern2 9egister. !rra.s2 !rra.s as C#aracter Strings2 Structures2 Unions2 3it $ie"ds2 4numerations and User de$ined t.-es. Pointers7 Pointer O-erations2 Pointer !rit#metic2 Pointers and !rra.s2 /u"ti-"e indirections2 Pointer to $unctions. =unctions7 Protot.-ing2 De$inition and Ca""2 Sco-e 9u"es. Parameter Passing7 b. 1a"ue2 b. address and b. re$erence2 =unctions returning re$erences2 Const $unctions2 recursion2 $unction o1er"oading2 De$au"t !rguments2 Const arguments. Pre--rocessor7 >de$ine2 >error2 >inc"ude2 >i$2 >e"se2 >e"i$2 >endi$2 >i$de$2 >i$nde$2 >unde$. +.-e casting7 static?cast2 const?cast2 d.namic?cast2 reinter-ret?cast. SECTION C C"asses and Objects7 C"ass Dec"aration and C"ass De$inition2 De$ining member $unctions2 ma6ing $unctions in"ine2 nesting o$ member $unctions2 /embers access contro"2 t#is -ointer. union as s-ace sa1ing c"asses. Objects7 Object as $unction arguments2 arra. o$ objects2 $unctions returning objects2 Const member $unctions. static data members and static member $unctions. $riend $unctions and $riend c"asses. Constructors7 -ro-erties2 t.-es o$ constructors (De$au"t2 -arameteri;ed and co-.)2 D.namic constructors2 mu"ti-"e constructors in c"asses. Destructors7 Pro-erties2 @irtua" destructors. Destro.ing objects. 9u"es $or constructors and destructors. !rra. o$ objects. D.namic memor. a""ocation using ne% and de"ete o-erators. Aested and container c"asses Sco-es7 &oca"2 B"oba"2 Aames-ace and C"ass2 'n#eritance7 De$ining deri1ed c"asses2 in#eriting -ri1ate members2 sing"e in#eritance2 t.-es o$ deri1ation2 $unction rede$ining2 constructors in deri1ed c"ass. +.-es o$ in#eritance7 Sing"e2 /u"ti-"e2 /u"ti"e1e" and H.brid. +.-es o$ base c"asses7 Direct2 'ndirect2 @irtua"2 !bstract. SECTION D Po".mor-#ism7 /et#ods o$ ac#ie1ing -o".mor-#ic be#a1iour. O-erator o1er"oading7 o1er"oading binar. o-erator2 o1er"oading unar. o-erators2 ru"es $or o-erator o1er"oading2 o-erator o1er"oading using $riend $unction. =unction o1er"oading7 ear". binding2 Po".mor-#ism %it# -ointers2 1irtua" $unctions2 "ate binding2 -ure 1irtua" $unctions and abstract base c"ass Di$$erence bet%een $unction o1er"oading2 rede$ining2 and o1erriding.
$

+em-"ates7 Beneric =unctions and Beneric C"asses2 O1er"oading o$ tem-"ate $unctions. 48ce-tion Hand"ing catc#ing c"ass t.-es2 #and"ing deri1ed c"ass e8ce-tions2 catc#ing e8ce-tions2 restrCSing e8ce-tion2 ret#ro%ing e8ce-tions2 terminate and une8-ected2 uncaug#t e8ce-tions. =i"es and streams7 C"asses $or $i"e stream o-erations2 o-ening and c"osing o$ $i"es2 stream state member $unctions2 binar. $i"e o-erations2 structures and $i"e o-erations2 c"asses and $i"e o-erations2 '<O %it# mu"ti-"e objects2 error #and"ing2 se0uentia" and random access $i"e -rocessing. TE-T BOO.S5 1. ,. Herbert Sc#i"dt2 C+#e Com-"ete 9e$erence C++D2 +ata /cBra%-Hi""2 ,001. Deite" and Deite"2 CC++ Ho% to ProgramD2 Pearson 4ducation2 ,001

REFERENCE BOO.S 5 1. 9obert &a$ore2 CObject Oriented Programming in C++D2 Ba"gotia Pub"ications2 1EE*. ,. 3jarne Strautru-2 C+#e C++ Programming &anguageD2 !ddition- Fes"e. Pub"ication Co.2 ,001. 3. Stan"e. 3. &i--man2 Gosee &ajoie2 CC++ PrimerD2 Pearson 4ducation2 ,00, *. 4. 3a"agurusam.2 C Object Oriented Programming %it# C++D2 +ata /cBra%-Hi""2 ,001

CS"0#* 5 DATA STRUCTURES ! ALGORITHMS LTPC )#'* Ma2im3m Mar4+5 *' Mi%im3m Pa++ Mar4+5 )'6 Ma2im3m Time5 ( Hr+. Le7t3re+ t, 8e &e9i:ere&5 **"0'

A I%+tr37ti,%+ ;,r <a<er"+etter +#e 0uestion -a-er %i"" consist o$ $i1e sections !2 32 C2 D and 4. Sections !2 32 C and D %i"" #a1e t%o 0uestions $rom t#e res-ecti1e sections o$ t#e s.""abus and %i"" carr. ,05 mar6s eac#. Section 4 %i"" #a1e 5-10 s#ort ans%er t.-e 0uestions %#ic# %i"" co1er t#e entire s.""abus uni$orm". and %i"" carr. ,05 mar6s in a"". B I%+tr37ti,%+ ;,r 7a%&i&ate+ 1. Candidates are re0uired to attem-t one 0uestion eac# $rom sections !2 32 C and D o$ t#e 0uestion -a-er and t#e entire section 4. ,. Use o$ non--rogrammab"e scienti$ic ca"cu"ator is a""o%ed. SECTION A Data Structure7 'ntroduction to data structure and a"gorit#m. !"gorit#m ana".sis7 +ime s-ace trade o$$ a"gorit#ms and 3ig O notation2 e$$icienc. o$ a"gorit#ms2 Forst case and a1erage case ana".sis. !rra.s7 'ntroduction2 one dimensiona" and mu"tidimensiona" arra.s2 memor. re-resentation o$ arra.s2 o-erations on arra.s2 s-arse arra.s and s-arse matrices and t#eir im-"ementation2 !d1antages and "imitation o$ arra.s. Stac6s7 'ntroductionH O-eration on stac6sH 'm-"ementation o$ stac6s. !--"ication o$ stac6s7 matc#ing -arent#esis2 e1a"uation o$ arit#metic e8-ressions2 con1ersion $rom in$i8 to -ost$i82 recursion. Iueues7 introduction2 o-eration on 0ueues2 circu"ar 0ueue2 memor. re-resentation o$ 0ueues2 -riorit. 0ueues2 a--"ication o$ 0ueues. SECTION"B &in6ed &ist7 'ntroductionH o-eration on "in6ed "ist2 circu"ar "in6ed "ist2 doub". "in6ed "ist2 #eader "in6ed "ist2 im-"ementation o$ "in6ed "ist2 a--"ication o$ "in6ed "ists. +rees7 'ntroductionH 3inar. +reeH +#readed 3inar. +reesH 3inar. Searc# +reeH !@& +rees2 3a"anced +reesH 3-+rees2 Hea-. SECTION"C Bra-#s7 'ntroduction Bra-#7 Bra-# termino"og.. /emor. 9e-resentation o$ Bra-#s7 adjacenc. matri8 re-resentation o$ gra-#s2 adjacenc. "ist or "in6ed re-resentation o$ gra-#s. O-erations -er$ormed on gra-#s7 3readt#-$irst and De-t#-$irst searc#2 Dij6astra S#ortest Pat# a"gorit#m2 /inimum S-anning +ree2 :rus6a" !"gorit#m2 Prims !"gorit#ms !--"ication o$ gra-#s. Has#ing7 Has#ing tec#ni0uesH Co""ision reso"utionH o-en addressing2 c#ainingH !--"ication o$ #as#ing. SECTION"D Sorting7 Se"ection Sort2 'nsertion Sort2 /erge Sort2 3uc6et Sort2 9adi8 Sort2 Iuic6 Sort and Hea- Sort2 48terna" Sorting tec#ni0ues. &o%er bound $or sorting2 Decision +rees. !"gorit#m Design +ec#ni0ues7 Di1ide and Con0uer !"gorit#ms2 Breed. !"gorit#ms2 D.namic Programming2 3ac6 +rac6ing !"gorit#ms.

TE-T BOO.S 5 1. /. !. Feiss2 JData Structures and !"gorit#m !na".sis in C++2 Pearson 4ducation2 ,00,. ,. !. +anenbaum2 K. &an#gsam and !. G. !ugenstein2 JData Structures Using CJ2 Prentice Ha"" o$ 'ndia2 1EE0. 3. CO9/!A2 'ntroduction to !"gorit#ms2 3rd 4dition REFERENCE BOO.S 5 1. ,. 3. S. Sa#ni2 JData Structures2 !"gorit#ms and !--"ication in C++2 /cBra%-Hi""2 1EEL. Dona"d :nut# 7 =undamenta" !"gorit#ms. @o"-1 Dona"d :nut# 7 Sorting Searc#ing. @o"-3
)

CS"0#0 SOFT/ARE LAB"I (C11 a%& Data Str37t3re+ LTPC ''00 /a8imum /ar6s7 M /inimum Pass /ar6s7 *05 /a8imum +ime7 3 Hrs. Practica" Sessions to be conducted7 *5-55

+#e &aborator. assignments $or t#is "ab %i"" inc"ude t#e assignments $rom t#e Pa-ers CS-611- (Object Oriented Programming Using C++) and CS-615-(Data Structures !"gorit#ms). M/a8imum /ar6s $or Continuous !ssessment7 /a8imum /ar6s $or Uni1ersit. 48amination7 60 *0

M.TECH (Part Time (Part I SECOND SEMESTER $'#("#) ! $'#)"#* Se++i,% CS"0#$ OPERATING SYSTEMS LTPC )#'* Ma2im3m Mar4+5 *' Mi%im3m Pa++ Mar4+5 )'6 Ma2im3m Time5 ( Hr+. Le7t3re+ t, 8e &e9i:ere&5 **"0'

A I%+tr37ti,%+ ;,r <a<er"+etter+ +#e 0uestion -a-er %i"" consist o$ $i1e sections !2 32 C2 D and 4. Sections !2 32 C and D %i"" #a1e t%o 0uestions $rom t#e res-ecti1e sections o$ t#e s.""abus and %i"" carr. ,05 mar6s eac#. Section 4 %i"" #a1e 5-10 s#ort ans%er t.-e 0uestions %#ic# %i"" co1er t#e entire s.""abus uni$orm". and %i"" carr. ,05 mar6s in a"". B I%+tr37ti,%+ ;,r 7a%&i&ate+ 1. Candidates are re0uired to attem-t one 0uestion eac# $rom sections !2 32 C and D o$ t#e 0uestion -a-er and t#e entire section 4. ,. Use o$ non -rogrammab"e scienti$ic ca"cu"ator is a""o%ed. SECTION A O<erati%? S@+tem7 De$inition2 O-erating S.stem as 9esource /anager. T@<e+ ,; O<erati%? S@+tem 7 Sim-"e 3atc# Processing2 /u"ti--rogrammed 3atc# Processing2 +ime S#aring2 Persona" Com-uter s.stems2 Para""e"2 Distributed and 9ea" +ime O-erating S.stems. O-erating S.stem Com-onents2 Ser1ices2 Ca""s2 S.stem Programs2 O-erating S.stem Structure2 @irtua" /ac#ines2 S.stem Design and 'm-"ementation. 'ntroduction to -rocesses (-rocess mode"2 im-"ementation o$ -rocesses)2 inter--rocess communication (race conditions2 critica" sections2 mutua" e8c"usion %it# bus. %aiting2 s"ee- and %a6eu-2 sema-#ore2 e1ent counters2 monitors2 message -assing and e0ui1a"ence o$ -rimiti1es). T=rea&+5 +#read Usage2 t#reads in User S-ace2 t#reads in :erne"2 H.brid 'm-"ementation2 Sc#edu"er !cti1ation2 Po--u- t#reads. CPU S7=e&39i%?7 3asic Conce-ts2 Sc#edu"ing Criteria2 !"gorit#ms /u"ti-"e--rocessor Sc#edu"ing2 9ea" +ime Sc#edu"ing2 !"gorit#m 41a"uation. SECTION B /emor. /anagement7 /emor. /anagement %it#out s%a--ing or -aging2 s%a--ing2 1irtua" memor.2 -age re-"acement a"gorit#ms (+#e o-tima" -age re-"acement a"gorit#m2 +#e notrecent".-used -age re-"acement a"gorit#m2 c"oc6 -age re-"acement a"gorit#m2 "east recent". used )2 segmentation. =i"e and Director. S.stem7 =i"es (=i"e naming2 $i"e structure2 $i"e t.-es2 $i"e access2 $i"e attributes2 $i"e o-erations2 memor.-ma--ed $i"es)2 Directories (#ierarc#ica" director. s.stems2 -at# names and director. o-erations)2 =i"e s.stem im-"ementation (im-"ementing $i"es and directories2 s#ared $i"es2 dis6 s-ace management2 $i"e s.stem re"iabi"it. and $i"e s.stem -er$ormance). SECTION C Distributed o-erating S.stem7 'ntroduction to Distributed o-erating S.stems (goa"s o$ distributed s.stems2 so$t%are conce-ts and design issues)2 S.nc#roni;ation in distributed s.stems (C"oc6 s.nc#roni;ation2 mutua" e8c"usion2 atomic transactions2 dead"oc6s in distributed s.stems). Processes and -rocessors in distributed s.stems (+#reads2 s.stem mode"s2 -rocessor a""ocation2 sc#edu"ing in distributed s.stems)2 Distributed =i"e s.stems (Distributed $i"e s.stem design2 distributed $i"e s.stem im-"ementation2 trends in distributed $i"e s.stems) SECTION D Protection and Securit.7 Securit. (+#e securit. en1ironment2 securit. $"a%s2 internet %orm2 generic securit. attac6s2 design -rinci-"es $or securit. and user aut#entication)2 -rotection mec#anisms (-rotection domains2 access contro" "ists2 ca-abi"ities2 -rotection mode"s). Case Stud.7 &'AUN S.stem7 Histor.2 Design Princi-"e2 :enne" /odu"es2 Process /anagement Sc#edu"ing2 /emor. /anagement2 =i"e S.stem2 'n-ut and Out-ut2 'nter -rocess Communication2 Aet%or6 Structure2 Securit.. TE-T BOO.S5 1. !. S. +anenbaum2 C/odern O-erating S.stemsD2 Pearson 4ducation. ,. Si"bersc#at; and Ba"1in2 JO-erating S.stem Conce-tsJ2 !ddison-Fes"e. -ub"is#ing2 Co.
*

REFERENCE BOO.S 5 1. ,. 3. *. H./. Diete"2 C!n 'ntroduction to O-erating S.stemD2 Pearson 4ducation. D. /. D#amd#ere2 CO-erating S.stems O ! Conce-t 3ased !--roac#D2 +ata /cBra%Hi"". /. Sing#a"2 A. B. S#i1aratri2 C!d1anced Conce-ts in O-erating S.stemsD2 +ata /cBra%Hi"". Fi""iam Sta""ings2 CO-erating S.stemsD2 Pearson 4ducation

CS"0#( COMPUTER ARCHITECTURE AND PARALLEL PROCESSING LTPC )#'* Ma2im3m Mar4+5 *' Mi%im3m Pa++ Mar4+5 )'6 Ma2im3m Time5 ( Hr+. Le7t3re+ t, 8e &e9i:ere&5 **"0'

A I%+tr37ti,%+ ;,r <a<er"+etter+ +#e 0uestion -a-er %i"" consist o$ $i1e sections !2 32 C2 D and 4. Sections !2 32 C and D %i"" #a1e t%o 0uestions $rom t#e res-ecti1e sections o$ t#e s.""abus and %i"" carr. ,05 mar6s eac#. Section 4 %i"" #a1e 5-10 s#ort ans%er t.-e 0uestions %#ic# %i"" co1er t#e entire s.""abus uni$orm". and %i"" carr. ,05 mar6s in a"". B I%+tr37ti,%+ ;,r 7a%&i&ate+ 1. Candidates are re0uired to attem-t one 0uestion eac# $rom sections !2 32 C and D o$ t#e 0uestion -a-er and t#e entire section 4. ,. Use o$ non -rogrammab"e scienti$ic ca"cu"ator is a""o%ed. SECTION A 'ntroductionH =unctiona" Units7 Processor2 /emor.2 'n-ut<Out-utH 3us Organi;ed Com-uter7 3uses2 +iming2 3us Fidt#2 C"oc6H 9egister Organi;ed Com-uterH 'nstruction 'm-"ementation2 +iming and Contro"H Contro" Design7 Hard%ired2 /icro--rogrammed2 Hard%ired contro" 1s. /icro--rogrammed contro"H 'nstruction Codes7 Stored Program2 'nstruction 9e-resentation2 'nstruction C.c"e2 'nstruction t.-es2 $ormats and addressing modesH Data re-resentation2 4rror Detection and Correction Codes2 'nterru-t7 'm-"ementation2 'nterru-t -riorities. SECTION B Contro" &ogic7 =undamenta"s2 Structure2 Contro" Signa"sH Hard%ired Contro" Design7 Conce-ts2 Design /et#ods2 48am-"e2 Design o$ Contro" UnitH /icro--rogrammed Contro" Design7 Conce-ts2 /icroinstructions2 Contro" /emor.2 /icroinstruction !ddressing2 +iming2 /icroinstruction Se0uencer2 Design Consideration2 Se0uencing +ec#ni0uesH Para""e"ism in /icroinstructions2 Hori;onta" /icroinstructions2 @ertica" /icroinstructions2 Hori;onta" 1s. @ertica" microinstruction2 Aano--rogramming. SECTION C /emor. S.stems7 /emor. +ec#no"og.2 De1ice C#aracteristics2 /emor. t.-es2 Per$ormance and CostH 9andom !ccess /emories7 Organi;ation2 Static 9andom !ccess /emor.2 D.namic 9!/H Seria"-!ccess /emories (S!/)7 !ccess /et#od2 /emor. organi;ationH /agnetic /emories7 9ecording =ormats</et#ods2 Dis6<+a-e Units2 O-tica" /emories2 /agneto-o-tica" Dis6sH 9ead-On".-/emories2 ="as# /emor.H Cac#e /emories7 /a--ing2 9e-"acement Po"iciesH /u"ti"e1e" /emories2 @irtua" /emor.2 /emor. /anagement. SECTION D Para""e" Processing7 'ntroduction2 Para""e"ism +.-es2 Para""e" Com-uter Structures2 /u"ti-rocessor S.stemsH Pi-e"ine Processors7 C"assi$ication2 Processor Pi-e"ining2 &inear Programming2 Benera" Pi-e"ines and 9eser1ation +ab"esH 'nter"ea1ed /emor. Organi;ationH @ector Processors7 C#aracteristics2 Pi-e"ined @ector Processing /et#odsH 'nterconnection Aet%or6s7 Categori;ation2 Static2 D.namic2 &inear 3usH S%itc#ing +ec#ni0uesH /es# Connected Aet%or6s2 Cube 'nterconnected Aet%or6s2 /u"tistage 'nterconnection Aet%or6s2 +.-es2 =au"t-+o"erance2 9outing2 9e"iabi"it.. TE-T BOO.S 5 1. ,. Go#n P. Ha.es7 CCom-uter !rc#itecture and Organi;ationD2 +#ird 4dition2 /cBra%-Hi"" 'nternationa" 4dition. :ai H%ang and =.!. 3riggs7 JCom-uter !rc#itecture and Para""e" ProcessingD2 /cBra%Hi"" 'nternationa" 4dition REFERENCE BOO.S 5 1. ,. !.S. +anenbaum7 CStructured Com-uter Organi;ationD2 PH' Sta""ing7 CCom-uter Organi;ation and !rc#itectureD2 Pearson 4ducation2 !sia.

CS"0#)5 DATABASE MANAGEMENT SYSTEM LTPC )#'* Ma2im3m Mar4+5 *' Mi%im3m Pa++ Mar4+5 )'6 Ma2im3m Time5 ( Hr+. Le7t3re+ t, 8e &e9i:ere&5 **"0'

A I%+tr37ti,%+ ;,r <a<er"+etter +#e 0uestion -a-er %i"" consist o$ $i1e sections !2 32 C2 D and 4. Sections !2 32 C and D %i"" #a1e t%o 0uestions $rom t#e res-ecti1e sections o$ t#e s.""abus and %i"" carr. ,05 mar6s eac#. Section 4 %i"" #a1e 5-10 s#ort ans%er t.-e 0uestions %#ic# %i"" co1er t#e entire s.""abus uni$orm". and %i"" carr. ,05 mar6s in a"". B I%+tr37ti,%+ ;,r 7a%&i&ate+ 1. Candidates are re0uired to attem-t one 0uestion eac# $rom sections !2 32 C and D o$ t#e 0uestion -a-er and t#e entire section 4. ,. Use o$ non--rogrammab"e scienti$ic ca"cu"ator is a""o%ed. SECTION A Tra&iti,%a9 Fi9e Pr,7e++i%? S@+tem5 C#aracteristics2 &imitations. Database7 De$inition2 Com-osition. D3/S7 De$inition2 C#aracteristics2 !d1antages o1er +raditiona" =i"e Processing S.stem2 'm-"ication o$ Database !--roac#. Users o$ Database2 D3! and #is 9es-onsibi"ities. Database Sc#ema and 'nstance. D3/S !rc#itecture2 Data 'nde-endence2 /a--ing bet%een di$$erent "e1e"s. Database &anguages7 DD&2 D/&2 DC&. Database Uti"ities. :e.s7 Su-er Candidate2 Primar.2 Uni0ue and =oreign. 4-9 mode"7 Conce-ts2 4ntities and 4ntit. Set2 !ttributes2 /a--ing Constraints2 4-9 Diagram2 Fea6 4ntit. Sets2 Strong 4ntit. Sets2 !ggregation2 Benera"i;ation2 Con1erting 49 Diagrams to +ab"es. SECTION B O1er1ie% o$ Aet%or6 and Hierarc#ica" /ode" and t#eir di$$erences. Object Oriented Data /ode"7 !bstraction2 4nca-su"ation2 'n#eritance and Persistence. Object 9e"ationa" /ode"2 Di$$erence bet%een OOD3 and O9D3. 9e"ationa" Data /ode"7 Conce-ts2 Constraints. 9e"ationa" !"gebra7 3asic O-erations2 !dditiona" O-erations. 9e"ationa" Ca"cu"us7 +u-"e and Domain 9e"ationa" Ca"cu"us. SECTION C Database Design7 =unctiona" De-endenc.2 Decom-osition2 Prob"ems o$ 3ad Database Design2 Aorma"i;ation2 /u"ti1a"ued De-endenc.2 Goin De-endenc. and Hig#er Aorma" =orms2 Database Design Process. Database Protection7 'ntegrit.2 Database Concurrenc.7 Prob"ems o$ Concurrent Databases2 /et#ods o$ #and"ing Concurrenc.2 &oc6ing2 time Stam-ing2 Data 9eco1er.. SECTION D Distributed Databases7 Conce-ts2 Structure2 +radeo$$s in Distributed Databases2 /et#ods o$ Data Distribution7 =ragmentation2 9e-"ication O1er1ie% o$ Deducti1e Databases2 Data Fare#ousing and O&!P2 and Data /ining2 /u"timedia Databases2 +em-ora" Database2 S-atia" Database2 /obi"e Databases2 C"ient<Ser1er !rc#itecture. TE-T BOO.S 5 1. 4"masr.2 Aa1at#e2 C=undamenta"s o$ Database S.stemD2 Pearson 4ducation. ,. +#omas Conno"".2 Caro".n 3egg2 JDatabase S.stemsJ2 Pearson 4ducation. REFERENCE BOO.S 5 1. @.:.Gain2 CDatabase /anagement S.stemsD2 Fi"e.. ,. 9. 9ama6ris#anan2 G. Be#r6e2 CDatabase /anagement S.stemsD2 /cBra% Hi"". 3. Henr. =. :ort#2 ! Si"bersc##at;2 CDatabase Conce-ts2J +ata /cBra% Hi"". *. C.G. Date 2J !n 'ntroduction to Database S.stemsD2 Pearson 4ducation. 5. /. +. O;su2 P @a"durie;2 CPrinci-"es o$ Distributed Database S.stemsD2 Pearson 4ducation. 6. Aa1een Par6as#2 C'ntroduction to Database /anagementD2 +ata /cBra% Hi"". P. 3obro%s6i2 CC"ient Ser1er !rc#itecture and 'ntroduction to Orac"e PD. L. Ge$$re. D. U""man2J Princi-"es o$ Database S.stems2J ,nd 4dition2 Ba"gotia Pub. P1t. &td. E. !nde. O--e"2D9e"ationa" Databases O Princi-"es and =undamenta"sD2 Fi"e.
10