SYLLABI AND COURSES OF READING FOR POST GRADUATE DIPLOMA IN COMPUTER APPLICATIONS (Semester I st & II nd ) 2!2"!# & 2!#"2!$ Sess%&ns DEPARTMENT OF COMPUTER SCIENCE PUN'ABI UNI(ERSITY PATIALA 1 OUTLINE OF PAPERS AND TESTS for P.G.D.C.A. First Semester Code Title of Paper University Examination Continuous Assessment Max. Mars Exam. Duration !ours PGDCA-101 Fundamentals of Information Technology 80 20 100 PGDCA-102 !"erating #ystems 80 20 100 PGDCA-10 Programming Fundamentals through $C$ %anguage 80 20 100 PGDCA-10& Com"uter !rgani'ation and Architecture 80 20 100 PGDCA-10( #oft)are %a* + I !ffice Automation and Producti,ity Tools &0 -0 100 PGDCA-10- #oft)are %a* + II Programming Fundamentals through $C$ %anguage &0 -0 100 "## $## %## Note: 1. The *rea/ u" of mar/s for the Continuous assessment for theory "a"ers )ill *e as under0 i. !ne or t)o tests out of )hich minimum one *est )ill *e considered for assessment. 1( 1ar/s ii. Attendance2 Class "artici"ation and *eha,iour ( 1ar/s 2. The *rea/ u" of for the Continuous Assessment for the "ractical )ill *e as under0 i. T)o or three tests out of )hich minimum t)o )ill *e considered for e,aluation 3-04 of Total mar/s5 - 1ar/s ii. %a* Assignments 304 of Total mar/s5 18 1ar/s iii. Attendance6Class "artici"ation and *eha,iour 310 4 of Total mar/s5 - 1ar/s 2 PGDCA&'#' Fundamentals of (nformation Te)*nolo+y 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A !istori)al Evolution of Computer3 9loc/ Diagram of com"uter2 characterisation of com"uters2 ty"es of com"uters2 the com"uter generations. 0asi) Anatomy of Computers0 memory unit2 in"ut-out"ut unit2 arithmetic logic unit2 control unit2 central "rocessing unit2 <A12 <!12 P<!12 :P<!1. (nput&1utput Devi)es3 =ey*oard2 1ouse2 >oy tic/2 Trac/ 9all2 Touch #creen2 %ight Pen2 Digiti'er2 #canners2 ?oice <ecognition De,ices2 !"tical <ecognition de,ices2 Dot matri72 Character and %ine "rinter2 Des/>et "rinter2 %aser "rinter2 and "lotters. SECT(12&0 2um4er System3 @on-"ositional and "ositional num*er systems2 9ase con,ersion2 *inary2 decimal2 he7adecimal2 and octal systems2 con,ersion from one system to the other. 0inary Arit*meti)3 Addition2 su*traction and multi"lication. Computer Codes3 )eighted and non-)eighted code2 9CD2 :9CDIC2 A#CII2 ;nicode2 A#-2 Grey Codes. SECT(12&C Computer Soft5are3 Introduction2 ty"es of soft)are2 systems soft)are2 G;I2 o"erating system2 high le,el languages2 assem*lers2 com"ilers and inter"reters2 system utilities2 a""lication "ac/ages2 stages in the de,elo"ment of soft)are2 "rogram testing and de*ugging2 "rogram documentation2 conce"t of firm)are. SECT(12&D Appli)ations of (nformation Te)*nolo+y and Trends3 IT in 9usiness and Industry2 IT in :ducation B training2 IT in #cience and Technology2 IT and :ntertainment2 Current Trends in IT A""lication - AI2 ?irtual <e"orts2 ,oice recognition2 <o*ots2 1ultimedia Technology. E&Commer)e3 1eaning2 its ad,antages B limitations2 Infrastructure for :-commerce2 Ty"es of :-Commerce A""lications. Multimedia3 Conce"ts2 Com"onents and A""lication. Text 0oo3 1. P.=. #inha and P. #inha2 Foundations of Com"uting2 First :dition2 20022 9P9. 6eferen)es3 1. Chetan #ri,ast,a2 Fundamentals of Information Technology2 =alyani Pu*lishers. 2. Tur*an 1clean and Cet*rete2 Information Technology and 1anagement2 #econd :dition2 20012 >ohn Ciley B #ons. . #atish >ain2 Information Technology2 9P92 1DDD. &. #u/hmeen =aur2 ?i/ram Gu"ta2 #. #. Eatia and @a,neet =aur2 $Fundamentals of Information Technology$2 =alyani Pu*lishers.
PGDCA&'#$ 1peratin+ Systems
1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A (ntrodu)tion to operatin+ System3 Definition2 its need and !"erating system ser,ices2 :arly systems2 Introduction to ,arious ty"es of o"erating systems0 9atch "rocessing o"erating system2 1ulti"rogramming o"erating system2 Time #haring o"erating system2 1ulti tas/ing o"erating system2 Distri*uted o"erating system2 @et)or/ o"erating system2 <eal time o"erating system2 1ulti "rocessor system and "arallel "rocessing. SECT(12&0 Pro)ess Mana+ement3 Process conce"t2 ty"es of Process scheduling2 9asci conce"t of CP; #cheduling2 #cheduling criteria2 and #cheduling algorithms0 FCF#2 #>F2 <ound <o*in B Fueue Algorithms2 Deadloc/ defintion and its characteri'ation. SECT(12&C 7indo5s3 G;I2 Icon2 Tool*ar Cor/ing )ith files2 closing and sa,ing a file 1ouse 1echanics0 Clic/2 dou*le clic/2 Drag and dro" method2 Installation of a ne) soft)are2 Control "anel2 :7"lorer2 Accessories2 @et)or/ @eigh*our hood2 system tools2 <ecycle *in2 Files and directory management under )indo)s2 <unning "rograms SECT(12&D Unix3 #tructure of ;ni72 =ernel and shell2 Commands of ;ni72 ;ni7 file system2 o)n file system2 :lectronic mail. ?i :ditor0 :diting te7t2 screen controls Printing and s"ooling ;ni7 Administration0 #u"eruser2 9ooting2 9ac/u"2 Creating and managing ne) accounts. Text 4oos3 1. <ath*one2G Cindo)s for dummiesG2 Pusta/ mahal 2. #tan =elly-9ootley2G;nderstanding ;@IAG2 #y*e7 Tech asian edition . #il,erschat'2G!"erating system conce"tsG2 Pearson :ducation India. & PGDCA&'#. Pro+rammin+ Fundamentals t*rou+* 8C8 9an+ua+e 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A Pro+rammin+ pro)ess3 Pro*lem definition2 "rogram design2 coding2 com"ilation and de*ugging. Fundamentals of C3 Identifiers and /ey)ords2 data ty"es2 in"ut and out"ut2 ty"e con,ersion2 o"erators and e7"ressions0 Arithmetic2 unary2 logical and relational o"erators2 assignment o"erator2 conditional o"erator2 and li*rary functions. SECT(12 &0 Control statements3 *ranching2 loo"ing using for2 )hile and do-)hile statements2 nested control structures2 s)itch2 *rea/ and continue statement Fun)tions3 definition2 call "rototy"e and "assing arguments to a function2 recursion ,ersus iteration Stora+e )lasses3 automatic2 e7ternal and static ,aria*les. SECT(12 &C Arrays3 Definition2 accessing elements2 initiali'ation2 "assing to functions2 multi dimensional arrays2 strings Pointers3 address and referencing o"erators2 declaration2 assignment2 "assing "ointer to functions2 "ointer arrays SECT(12 &D Stru)tures3 ,aria*les2 accessing mem*ers2 nested structures2 "ointer to structures2 self referential structures. Files in C3 #e8uential files2 random access files2 ;nformatted files2 Te7t files2 *inary files. Text 0oo3 1. 9yron Gottfried 2 HProgramming )ith C2 #econd edition2 #chaumI s outline seriesG T1E 6eferen)es3 1. <am =umar and <a/esh Aggar)al 0 Programming in Ansi C2 T1E 2. 9.C. =errighan and D.1.<ichie2 H The C "rogramming languageG2 2 nd edition2 PEI . E.E. Tan B T.9. Dora'io2G C Programming for engineers B Com"uter #cienceG2 1cgra) Eill international edition. &. ?i/ram Gu"ts and #. #. 9hatia2 $Programming Fundamentals through C %anguage$ =alyani Pu*lishers. ( PGDCA&'#" Computer 1r+ani:ation and Ar)*ite)ture 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A 0oolean Al+e4ra3 9oolean o"erations2 Truth Ta*les2 9oolean %a)s2 =-ma"s 322 and & ,aria*le ma"s2 donJt care conditions5. SECT(12 &0 0asi) Gates; Com4inational lo+i) desi+n3 half-adder2 full adder2 "arallel adder. Se<uential )ir)uits3 conce"t2 fli"-flo"s 3D2 <#2 >=2 T52 counters 3<i""le2 Asynchronous2 #ynchronous5. Instruction codes2 Instruction formats2 Instruction cycle2 Addressing modes. SECT(12 &C <egister Transfer %anguage2 Arithmetic2 %ogic and #hift micro-o"erations2 Arithmetic %ogic #hift unit Control Memory3 Design of control unit2 1icro "rogrammed and hard)ired control unit 3o,er,ie) only52 Features of <I#C and CI#C SECT(12 &D Memory 1r+anisation3 memory hierarchy2 1emory ty"es0 cache2 associati,e and other ty"es. (=1 or+ani:ation3 I6! interface2 1odes of data transfer0 Programmed I6!2 Interru"t initiated I6!2 D1A. 9loc/ diagram de"icting architecture of 808( machine. Text 0oo3 1. 1.1. 1ano2 $Com"uter #ystem Architecture$. Third :dition2 Prentice-Eall of India2 2002. 6eferen)es3 2. A.#.Tannen*aum2 $#tructured Com"uter !rganisation$. Prentice-Eall of India2 1DDD. . Cilliam #tallings2 $Com"uter !rganisation and Architecture$. - th :dition2 Pearson :ducation2 2002. - PGDCA&'#-3 Soft5are 9a4 ( >1ffi)e Automation and Produ)tivity Tools/ 1a7imum 1ar/s0 ? %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. This la*oratory course )ill com"rise as e7ercises *ased on !ffice Automation and Producti,ity Tools. #tudents are re8uired to "ractice follo)ing0 7(2D17S3 Cindo)s conce"ts2 features2 )indo)s structure2 des/to"2 tas/*ar2 start menu2 my com"uter2 <ecycle 9in2 Cindo)s Accessories. #ystem Tools; communication2 #haring Information *et)een Programs. MS 7ord3 Introduction to Cord Processing2 Interface2 Tool*ars2 <uler2 1enus2 =ey*oard #hortcut2 :diting a Document2 Pre,ie)ing documents2 Printing documents2 Formatting Documents2 Chec/ing the grammar and s"elling2 Formatting ,ia find and re"lace2 ;sing the Thesaurus2 ;sing Auto Correct2 Auto Com"lete and Auto Te7t2 )ord count2 Ey"henating2 1ail merge2 mailing %a*els Ci'ards and Tem"lates2 Eandling Gra"hics2 ta*les and charts2 Con,erting a )ord document into ,arious formats. MS&Po5erPoint3 Creating slides2 A""lying transitions and sound effects2 setting u" slide sho)s2 Animation. MS E@CE93 Creating )or/sheet2 entering data into )or/sheet2 heading information2 data2 te7t2 dates2 al"hanumeric2 ,alues2 sa,ing B 8uitting )or/sheet2 !"ening and mo,ing around in an e7isting )or/sheet2 Tool*ars and 1enus2 /ey*oard shortcuts2 Cor/ing )ith single and multi"le )or/*oo/2 Cor/ing )ith formulas B cell referencing2 Formatting of )or/sheet. K1a7imum 1ar/s for continuous assessment 0 -0 1a7imum 1ar/s for ;ni,ersity e7amination 0 &0 T*e 4rea up of mars for t*e University examination 5ill 4e as under i. 9a4 6e)ord '# Mars ii. Aiva Ao)e '- Mars iii. Tas +iven in t*e examination=Pro+ram Development and Exe)ution '- Mars L PGDCA&'#%3 Soft5are 9a4 (( >Pro+rammin+ Fundamentals t*rou+* 8C8 9an+ua+e/ 1a7imum 1ar/s0 ? Practical ;nites to *e conducted0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. This la*oratory course )ill com"rise as e7ercises to su""lement )hat is learnt under "a"er PGDCA-100 Programming Fundamentals through $C$ %anguage. #tudents are re8uired to de,elo" "rograms *ased u"on0 1. ?arious data ty"es in C language 2. ?arious constructs in the C language . <eading )riting te7t files. K1a7imum 1ar/s for continuous assessment 0 -0 1a7imum 1ar/s for ;ni,ersity e7amination 0 &0 T*e 4rea up of mars for t*e University examination 5ill 4e as under i. 9a4 6e)ord '# Mars ii. Aiva Ao)e '- Mars iii. Tas +iven in t*e examination=Pro+ram Development and Exe)ution '- Mars
8 ORDINANCES AND OUTLINES OF TESTS, SYLLABI AND COURSES OF READING FOR POST GRADUATE DIPLOMA IN COMPUTER APPLICATIONS (Semester II nd ) 2!2"!# & 2!#"2!$ Sess%&ns D OUTLINE OF PAPERS AND TESTS for P.G.D.C.A. Se)ond Semester Code Title of Paper University Examination (nternal Assessment Max. Mars Exam. Duration !ours PGDCA-201 Data #tructures 80 20 100 PGDCA-202 !*Mect !riented Programming )ith CNN 80 20 100 PGDCA-20 Data*ase 1anagement #ystem )ith 1# ACC:## 80 20 100 PGDCA-20& Fundamentals of Com"uter @et)or/s2 Internet and #cri"ting %anguages 80 20 100 PGDCA-20( #oft)are %a* + III Data #trucutres and Programming )ith CNN &0 -0 100 PGDCA-20- #oft)are %a* + I?1# ACC:## and #cri"ting %anguages &0 -0 100 "## $## %## Note: 1. The *rea/ u" of mar/s for the Continuous assessment for theory "a"ers )ill *e as under0 i. !ne or t)o tests out of )hich minimum one *est )ill *e considered for assessment. 1( 1ar/s ii. Attendance2 Class "artici"ation and *eha,iour ( 1ar/s 2. The *rea/ u" of for the Continuous Assessment for the "ractical )ill *e as under0 i. T)o or three tests out of )hich minimum t)o )ill *e considered for e,aluation 3-04 of Total mar/s5 - 1ar/s ii. %a* Assignments 304 of Total mar/s5 18 1ar/s iii. Attendance6Class "artici"ation and *eha,iour 310 4 of Total mar/s5 - 1ar/s 10 PGDCA&$#' Data Stru)tures 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A 9asic conce"t and notations2 data structures and data structures o"erations2 mathematical notation and functions2 algorithmic com"le7ity2 9ig J!J notations and time s"ace trade off. Arrays3 %inear array2 re"resentation of linear array in memory2 Tra,ersing linear array2 insertion and deletion in an array2 multi-dimensional array0 ro)-maMor2 column maMor order2 s"arse array. SECT(12&0 Sta)s3 Push and Po" in stac/. <e"resentation of stac/ in memory 3lin/ed and se8uential5 a""lications of #tac/0 con,ersion from infi7 notation to "ost fi7 notations2 e,olution of "ostfi7 notation2 matching of Parenthesis2 recursion2 To)er of Eanoi. SECT(12&C 9ined list3 re"resentation of lin/ed list using static and dynamic data structures2 Com"arison of %inear and non-linear data structures2 Insertion and deletion of a node from a linear lin/ed list2 Introduction to dou*ly and circular lin/ed lists2 A""lication of lin/ed lists. SECT(12&D Sear)*in+ and Sortin+3 %inear and *inary search2 9u**le #ort2 Insertion #ort2 #election #ort2 1erge #ort2 <adi7 #ort and Fuic/ #ort com"arison of ,arious searching and sorting algorithms. Text 0oos3 1. #eymour %i"schut' $Theory B Practice of Data #tructures$2 1cGra) Eil2 1DD8 2. Thomas @a"s and 9hagat #ingh2 Introduction to Data #tructures. 11 PGDCA&$#$ 14Be)t 1riented Pro+rammin+ 5it* CCC 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A Evolution of 11P 3 Procedure !riented Programming2 !!P Paradigm2 Ad,antages and disad,antages of !!P o,er its "redecessor "aradigms. Characteristics of !*Mect !riented Programming. (ntrodu)tion to CCC 3 Identifier2 =ey)ords2 Constants2 !"erators0 Arithmetic2 relational2 logical2 conditional and assignment. #i'e of o"erator2 !"erator "recedence and associati,ity. Ty"e con,ersion2 ?aria*le declaration2 e7"ressions2 statements2 mani"ulators. In"ut and !ut"ut statements2 stream I6!2 Conditional and Iterati,e statements2 *rea/ing control statements. SECT(12&0 #torage Classes2 Arrays2 Arrays as Character #trings2 #tructures2 ;nions2 9it fields2 :numerations and ;ser defined ty"es. Pointers 3 Pointer !"erations2 Pointer Arithmetic2 Pointers and Arrays2 1ulti"le indirections2 Pointer to functions. Functions0 Prototy"ing2 Definition and Call2 #co"e <ules. Parameter Passing0 *y functions2 recursion2 function o,erloading2 Default Arguments2 Const arguments2 Pre-"rocessor2 Ty"e casting. SECT(12&C Classes and 14Be)ts 3 Class Declaration and Class Definition2 Defining mem*er functions2 ma/ing functions inline2 @esting of mem*er functions2 1em*ers access control2 this "ointer2 !*Mects0 !*Mect as function arguments2 array of o*Mects2 functions returning o*Mects2 Const mem*er. #tatic data mem*er and #tatic mem*er functions2 Friend functions and Friend classes. Constru)tors3 Pro"erties2 ty"es of constructors2 Dynamic constructors2 multi"le constructors in classes. Destru)tors3 Pro"erties2 ?irtual destructors2 Destroying o*Mects2 <ules for constructors and destructors. Array of o*Mects. Dynamic memory allocation using ne) and delete o"erators2 @ested and container classes2 #co"es0 %ocal2 Glo*al2 names"ace and Class. SECT(12&D (n*eritan)e3 Defining deri,ed classes2 inheriting "ri,ate mem*ers2 single inheritance2 ty"es of deri,ation2 function redefining2 constructors in deri,ed class2 Ty"es of inheritance2 Ty"es of *ase classes2 Code <eusa*ility. Polymorp*ism3 1ethods of achie,ing "olymor"hic *eha,ior. Polymor"hism )ith "ointers2 ,irtual functions2 late *inding2 "ure ,irtual functions and a*stract *ase class. 1perator overloadin+3 o,er loading *inary o"erator2 o,erloading unary o"erators2 rules for o"erator o,erloading2 o"erator o,erloading using friend function. Function o,erloading0 early *inding. Difference *et)een function o,erloading2 redefining2 and o,erriding. Text 0oo0 1. Eer*ert #childt. $The Com"lete <eference CNN$2Tata 1cGra)-Eill22001 6eferen)es0 1. Deitel and Deitel2 $CNN Eo) to Program$2 Pearson :ducation2 2001 2. <o*ert %afore2 $!*Mect !riented Programming in CNN$2 Galgotia Pu*lications/2 1DD&. . 9Marne #trautru"2 $The CNN Programming %anguage$2 Addition-Cesley Pu*lication Co.2 2001. &. #tanley 9. %i""man2 >osee %aMoie2 $CNN Primer$2 Pearson :ducaion2 2002 (. :.9alagurusamy2 $!*Mect !riented Programming )ith CNN$2 Tata 1cGra)-Eill2 2001. 12 PGDCA&$#. Data4ase Mana+ement System 5it* MS ACCESS 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A Traditional file pro)essin+ system 3 Characteristics2 limitations2 Data*ase 0 Definition2 com"osition. Data4ase Mana+ement System3 Definition2 Characteristics2 ad,antages o,er traditional file "rocessing system2 ;ser of data*ase2 D9A and its res"onsi*ilities2 Data*ase schema2 instance. D91# architecture2 data inde"endence2 ma""ing *et)een different le,els. Data4ase lan+ua+es3 DD%2 D1%2 DC%. Data*ase utilities2 Data 1odels2 =eys0 #u"er2 candidate2 "rimary2 uni8ue2 foreign. SECT(12&0 Entity relations*ip model3 conce"ts2 ma""ing cardinalities2 entity relationshi" diagram2 )ea/ entity sets2 strong entity set2 aggregation2 generali'ation2 con,erting :< diagrams to ta*les. !,er,ie) of @et)or/ and Eierarchical model. 6elational Data Model3 conce"ts2 constraints. <elational alge*ra0 9asic o"erations2 additional o"erations. SECT(12&C Data4ase Desi+n3 Functional de"endency2 decom"osition2 "ro*lems arising out of *ad data*ase design2 normali'ation2 multi-,alued de"endency2 Data*ase design "rocess2 data *ase "rotection2 data*ase integrity. Data4ase )on)urren)y3 Defintion and "ro*lems arising out of concurrency. Data4ase se)urity3 Authentication2 authori'ation2 methods of im"lementing security. SECT(12&D MS&ACCESS3 Introduction to 1#-ACC:##2 )or/ing )ith data*ase and ta*les2 8ueries in Access2 A""ling integrity constraints2 Introduction to forms2 sorting and filtering2 Controls2 <e"orts and 1acro0 creating re"orts2 using 1acros. Text 0oo3 1. 9.P. Desai2 HData*ase management systemG 9P9 "u*lications2 @e) Delhi. 6eferen)e3 1. C.>. Date2 $An Introduction to Data 9ase #ystems$2 rd :d.2 @arosa Pu*lishers2 1DDL 2. >effrey D. ;llman2 $Princi"les of Data*ase #ystems$2 2nd :d.2 Galgotia Pu*.2 1D8&. . D. =roen/e.2 $Data*ase Processing$2 Galgotia Pu*lications2 1D8L. &. Eenry F. =orth2 HData*ase #ystem Conce"tsG2 1cGra) Eill. Inc.2 1DDL. (. @a,een Pra/ash2 HIntroduction to Data*ase 1anagementG2 T1E2 1DD. -. I,an 9ayross2 H !racle L The com"lete referenceG2 9P9 Pu*lications. L. 9o*ro)s/y2 H Client ser,er architecture and Introduction to !racle LG2 1DD- 8. :lmisry @a)athy2 $Introduction to data*ase #ystem$2 Pearson :ducation India. D. Content De,elo"ment Grou" $Cor/ing )ith 1#-!FFIC: 2000$2 T1E 1 PGDCA&$#" Fundamentals of Computer 2et5ors; (nternet and S)riptin+ 9an+ua+es 1a7imum 1ar/s0 ,# %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. A/ (nstru)tions for paper&setters The 8uestion "a"er )ill consist of fi,e sections A2 92 C2 D and :. #ections A2 92 C and D )ill ha,e t)o 8uestions from the res"ecti,e sections of the sylla*us and )ill carry 204 mar/s each. #ection : )ill ha,e (-10 short ans)er ty"e 8uestions )hich )ill co,er the entire sylla*us uniformly and )ill carry 204 mar/s in all. 0/ (nstru)tions for )andidates 1. Candidates are re8uired to attem"t one 8uestion each from sections A2 92 C and D of the 8uestion "a"er and the entire section :. 2. ;se of non "rogramma*le scientific calculator is allo)ed. SECT(12&A Computer 2et5ors3 Introduction2 A""lications2 @et)or/ hard)are and #oft)are 3"rotocol hierarchies2 design issues for layers2 interfaces and ser,ices0 connection oriented and connection less52 @et)or/ structure and architecture - "oint to "oint2 multicast2 *roadcast2 Classification of net)or/s-%A@2 1A@ and CA@. <eference models - the !#I reference model2 TCP 6 IP reference model. Com"arison *et)een !#I and TCP 6 IP models. SECT(12 &0 (nternet3 Introduction2 <elays2 <e"eaters2 9ridges2 <outers2 Gate)ays. (nternet 5orin+3 Eo) net)or/s differ2 concatenated ,irtual circuits2 connectionless internet)or/ing2 tunnelling2 internet)or/ <outing2 fragmentation2 Fire)alls2 internet architecture. SECT(12 &C Appli)ation layer3 The D@# @ame #"ace2 :lectronic 1ail2 The Corld Cide Ce*2 FTP0 introduction2 data transfer and distri*uted com"utation2 Generalised File Transfer2 The File Transfer Protocol. 2et5or se)urity3 Introduction to cry"togra"hy2 su*stitution ci"hers2 trans"osition ci"hers2 one- time "ads2 t)o fundamental cry"togra"hic "rinci"les. SECT(12 &D S)riptin+ lan+ua+es3 !TM93 Introduction to ET1%2 ET1% and the Corld Cide Ce*2 ET1% elements2 *asic structure elements of ET1%2 the t)o categories of *ody elements + *loc/ le,el and te7t le,el2 creating ET1% "ages2 ,ie)ing "ages in different *ro)sers2 rule for nesting. ET1% tags2 colours and fonts2 formatting the *ody section2 creating lin/s2 creating e7ternal lin/s2 creating internal lin/s. Text 0oo3 1. Andre) #. Tanen*aum2 HCom"uter @et)or/sG2 Third :dition2 PEI Pu*lications2 1DDL. 2. 9 Forousan2 Introduction to data communication and net)or/ing 6eferen)es3 . Douglas :. Comer 2 $Com"uter @et)or/s and Internets$ 2nd :diton2 Addison Cesley. &. D. 9ertsellas and <. Gallager2 HData @et)or/sG2 2nd :dition2 Prentice Eall2 1DD2. 1& PGDCA&$#-3 Soft5are 9a4 ((( >Data Stru)tures and 14Be)t 1riented Pro+rammin+ 5it* CCC/ 1a7imum 1ar/s0 ? %ectures to *e deli,ered0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. This la*oratory course )ill com"rise as e7ercises to su""lement )hat is learnt under "a"er PGDCA-2010 Data #trucutres and 200 P*Mect !riented Programming )ith CNN. #tudents are re8uired to de,elo" "rograms 1. 9ased u"on ,arious constructs in the CNN language. 2. #earching and sorting algorithms in CNN language . Data strcutres li/e stac/2 8ueues and lin/ed lists in CNN language. K1a7imum 1ar/s for continuous assessment 0 -0 1a7imum 1ar/s for ;ni,ersity e7amination 0 &0 T*e 4rea up of mars for t*e University examination 5ill 4e as under i. 9a4 6e)ord '# Mars ii. Aiva Ao)e '- Mars iii. Tas +iven in t*e examination=Pro+ram Development and Exe)ution '- Mars 1( PGDCA&$#%3 Soft5are 9a4 (A >S)riptin+ 9an+ua+es/ 1a7imum 1ar/s0 ? Practical ;nites to *e conducted0 "#&-# 1inimum Pass 1ar/s0 .- 4 Time allo)ed0 . !rs. This la*oratory course )ill com"rise as e7ercises to su""lement )hat is learnt under "a"er PGDCA-200 Data*ase 1anagement #ystem )ith 1# ACC:## and PGDCA-20&0 Fundamentals of Com"uter @et)or/s2 Internet and #cri"ting %anguages. #tudents are re8uired to "ractices0 MS ACCESS3 Creating ta*les2 8ueries in 1# Access2 A""ling integrity constraints2 creating forms2 sorting and filtering2 creating re"orts. !TM93 Ta*les2 Forms2 Frames and other te7t formatting tags D!TM93 Cascading style sheets and Document o*Mect model DavaS)ript3 Introduction to >a,a#cri"t. K1a7imum 1ar/s for continuous assessment 0 -0 1a7imum 1ar/s for ;ni,ersity e7amination 0 &0 T*e 4rea up of mars for t*e University examination 5ill 4e as under i. 9a4 6e)ord '# Mars ii. Aiva Ao)e '- Mars iii. Tas +iven in t*e examination=Pro+ram Development and Exe)ution '- Mars