syllmcase2ys171220.pdf - guru gobind singh indraprastha

AIP*ud Lg fi c -5o6 c-o',..,.;#*

SCHEME OF EXAM!NATION

DETAILED SYLLABUS

(w. e.f. Academic Year 2020-2021 onwards)

For

MASTER OF COMPUTER

APPLICATIONS IN

SoFTWARE ENGINEERING (MCA-SE) DEGREE

(02 Years)

Offered at USIC&T, of GGSIPU

GURU GOBIND SINGH

I N DRAPRASTHA U N IVERSITY

SECTOR 16C, DWARKA, NEW DELHI

Syllabus of Master of Computer Applications (MCA), approved by 52"d (online) BoS of USIC&I held on 29.11.2020 and

v

&

AC Sub Comrnittee on 30.11.2020 to be made effectlve from the Academic \ea( 2020-)021 onwards

/a-r

\1

Programme Outcomes tbr MCA(Sl))

l. Oomputational Knowledge:Appll'knowledge- of cotnputins lundamentals. cornputine spccialisation. rnalhcrlatics. and cjornain knorrl-edgc- appropriatc lbr the cornputing specialisation to the abstraction and conccptualisation ol'conrpurirrurnodels frorn defined problems and requirernents.

2, I'roblem Analvsis:ldcntify. fbrmulate. research literature, and solve corrplcx cornputinq problcrrs rcaching subslantiatec1 con-clusiorrs using fundamcntal principles of'mathelnatics. computine scienccs. and relcvant domain disci-p lin es.

3. Design /Development of Solutions:Design and evaluate solutions for complex computing problems, and design and evaluate systems. compo-nents, or processes that meet specified needs with appropriate consideration tbr public health and safety.cultural, societal, and environmental considerations.

{. Conducl Investigations of Complex Computing I)roblems:l.,se rcsearch-bascd knowlcdge and rescarch rrethods including design ol'cxpcrilucnts. analysis and intcr-pretation of data. and synthcsis of tlre inforrration to provide valid conolusions.

5. Modern 'l'ool Iisagc:('rcate, selcct. adapt and apply appropriate tcchniclucs. rr:s()urccs. arrd rrodcrn conrl'ruting tools to cgrnplcrconrputing activitics. rvith an understandinq ol- the I i ntitatiorrs.

6. Professional Ethics:L.lnderstand and cornmit to professional ethics and cybcr regulations. responsibilitics. and norms o1'prol'es-sional computing practice.

7. t,il'c-long Lcarning:I{ecocnise lhe need. and have the ability. to engage in indcpendent learnins lirr continual dcvelopnrcnr as a

conrputing prol'essional.

ll. Project management and finance:I)emonstrate knowledgc and understanding of the cornputing and managemcnt principlcs and apply thesclo one's own work, as a member and leader in a team, to nranaqc projccts ancl innrultidisci pl inary errr, i ronrncr.rts.

9. Communication E,ffi cacy:Communicate effectively with the computing community, and with society at large. about complex com-puting activities by being able to comprehend and write effective reports, design documentation, make ef,-fective presentations, and give and understand clear instructions.

10. Societal and Environmental Concern:Understand and assess societal, environmental, health, saflety. legal. and cultural issues within local andglobal contexts. and the consequential responsibilities relevant to professional computing practice.

I l. Individual and'l'cam Work:liunction effectively as an individual and as a rncmber or leader in diversc tcants and in nrultidisciplinarycrrv ironments.

I 2. lnnovation and F.ntrepreneurshipldcntify a tinrely opporrunity and usins innovation to pllrsue that opporlunil\ to crcatc value and w,calth lilrthe betterment olthe individual and society ar large

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of IJSIC&T held on 29.11.2o2e andAC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2020-2021 onwards.

8/

Scheme of Study (MCA-SE)

FI RS'I' SI]MESl'EII I,]XAMINA'I'I ON

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.11..2020 and

AC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2020-2021 onwards.

\8

I)a pcrII)

PaperCode

['apcr I, 1'lP Crcdit

44601 r1'601 Database Managcrnent Systcnt -) I 4

44603 I'f603 Computer Organization and Architecture -) I 44460s I f605 Software [:nginecring -l I 444607 I f607 Data Structure and Algorithm -) I 444609 I't609 lroundation ol' C<lrnpr.rtcr Scicnce f

J I 4

446t I I't'6r r 0biect Oricnted Programming J I 4I)ract ical44661 t't'661 Database Management System I-ab 0 2 I

44663 I't'663 Data Structure and Algorithm Lab 0 2 I

44665 I't'665 Software Engineering Lab 0 2 I

44667 t't-667 Obiect Oriented Programming Lab 0 ) I

44669 I't'669 -l'erm Paper I (NtJLS*) 0 4 2

'l'otal r8 l4 30

N

-

\X


SECOND SEMIISl-EII EXAMINA'I'ION

4

4

1

4

4

Minimr"rm3 credits

'l'erm Pa II UlrS* 0 2

'l'otal r8 29

Syllabus of Master of Computer Applications (MCA), approved by 52"d (online) BoS of USIC&T held on 29.11.2020 and


I'apcrID

PaperCode

Paper t. 't'/P (l rcd it

44602 tT602 Data Communication and Networking 1-) I 4

44604 Ir604 Operating Systems J I 444606 I1'606 Software Testing and Quality Assurance ) I 44460ti r r'608 AI and Machine l-earning

I-luman Values and Prol-essional F,thics (NtJIlS)-) I 4

44626 n'626 2 2

Core (School) t)lective - I (Select any one)446t0 t-t610 Software Requirement & trlicitation

Clomputer Graphics & MultimediaI 0

446t2 t't-6t2 4 0

446t4 I I 6l.l Internet of -f hings'f heory of Compr"rtation

1 0

446t6 It'6 t 6 4 0

446t8 11'6I 8 Optimization'l'echniqucs 4 0

44620 IT620 Front End Design Techniques 4 0 4

44622 t'T622 Simulation and Modelling 4 0 4

44624 n'624 Mobile Computing 4 0 4

Open Elective - I (Select any one)Illectivcs oflcrcd hy' t-ISIC& l' or anv School oi'thc[-Jniversitv

Practical44662 tl-662 Software'l'esting and Quality Assurancc Lab 0 1 I

44664 tT664 I-ab Based on Core-Elective - I 0 2 I

14666 n 666 4

t2

&

--- ---l

l

-

\6

Schcme of Study (MCA-SIi)1'II IRD SI.] MI,] S1-EIt T]XAM INA'I'I()N

Paper

DataSoftware Pro

4

* The paper code, prepared and the syllabus to be provided by the [.lniversitySchool of Environment Management.

Syllabus of Master of Computer Applications (MCA), approved by 52^" (online) BoS of USIC&T held on 29.11.2020 and

AC Sub Committee on 30.11.2020 to be made effective from the Academic \ear 2020-2021 onwards.

rf

.1

4

4

PaperIt)

I'aperCode

t,

-)

't'/t' Credit

4470 I I',f 701

44103 IT7()3 J

44705 IT7O5 Mobi le Arcl-ritecture and Prograntming J I 4

Environmental Science * J J*Papcr ID and I'aper Code to be provided by LJSIIMCore Mcctiver -ll a one

'14101 t f7o7 Desi Paltcrns 4 0 {14109 I't709 Compiler Design 4 0 4

441| t'f 7l I Block chain Technology 4 0 4441 t3 ITTI3 E-commerce 4 0 4

441 ls It'7 I 5 Cloud Computirrg 4 0 4

447 17 rclt7 Scmantic Web'l'cchrrologies\arr*rl i i,rgi,rgi I'r:,iccsiingAdvanced Database Management Systenrs

Social Netuolk Analvsis

4 0 4

441 t9 I1-7 I 9 4 0

44121 n'721 4 0 4

44723 tT123 4 0 4

44725 tT125 Scientif'ic inCore Iilective -lll 0n8A

^141 rc727 le and

4 0 Aa

4 0

044729 rc729 Obiect Oriented Analysis and Desigr-r 4 .l

4/+4131 I't'731 Network Securitv' 4 0

-l.l /JJ Ir'73i Cyber Security 4 0

44735 I',f 73 5 Soll Computing 4 0

4,1737 tTl3l Big Data and Nosql 4 0

44739 l'1739 Nature lnspired Al gorithnrs 4 0

44141 l1-741 Advanced Computer Architecture 4 0

441 43 t't-743 Software Defined NetworksDigital lmage Processing

4 0 4

441 45 t't'7 45 4 0

Open Elective -lI (Select any one)E,lectives ol'fered by USIC&T or any othcr School olthc[-: n iversity

Minimum3 Credits

Practical441 61 t't']6t Data Analvtics [,ab

SoliwareMobilc Programming l-ab

0 2

4.1163 fi763 0 )l441 65 tt165 0

0441 61 t'n67 Technical Repon Writing (NUES*) 2

i0'l'otal Iu ll

&

l

'l

I

'',1

I

I

I'!

I

l

\>


I'OUITTH SI]M ESTEII I.]XAM INA'I'ION

Syllabus of Master of Computer Applications (MCA), approved by 52^d (online) BoS of USIC&T held on 29.tt.2020 andAC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2020-2021 onwards.

R

PaperID

PaperCode

Paper t. 'r.il,

44162 t't-762 Dissertation (Major Project) 2o

44764 |764 Seminar and Presentation bascd on I)isscrration (Ntjl:S*) 4'I'otal .JA

-a

I

Credit

-1

\k

44504

Ilridge (lourses lbr non computer science students

Paper

Introduction to Pro ITIIN inClntroduction to I'l-Di tal ElectronicsWeb Technol'l'otal

I, 'l.ll'

1J

t24

Note: Students without B.Sc. (Computer Science)/ Elachelor of Computer Applications) /

Bachelor o1'Science (lnformation Technology) or equivalent as decided by the AcademicProgramme Committee (APC) o1'the School shall have to complete the bridge course

before the degree of MCA(SE) can be awarded.

Students have to do the Bridge courses through Swayam,NP'l'El/as decided by thcAcademic Programme Committee (APC) of the School. These papers have to be qualifiedby the students. Iror these papers examination shall be conducted, on qualifying the course

as offered by Swayam,/NPTL, by the School as NUES, the same shall be transferred toexamination division of the University. The degree to be awarded to the student onlysubject to the acquiring qualifying grade/marks in the bridge courses and the minimumcredits in the regular courses of the scheme of study I'or l-4 semesters.-I'hese Courses shall

be qualifying in nature;they shall not be included forcalculation of CGPA.'fhe qualifyingmarks shall be 40 marks in each paper.

Note

L Ordinance:'['he evaluation shall be as per thc Ordinance I I of'thc universitv

2. Maximum and minimum duration: Minimum duration of study shall be N,,.2

years (M=4 semesters) while the maximum duration oi'registration of the students

shall be N+2 years (Mr4 semesters) as per Ordinance ll of the lJniversity.

3. Maximum and Minimum Credits: The total number of the credits of the

MCA(SE) programme (Maximum credits) shall be the total number of credits

taken by the student subject to acquiring a minimum of 104 credits for the award

ofthe degree.

'l'he rninimum curriculurn study requiremcnt fbr thc studcr-rt shall bc lll crcdits.thc actual number o1- crcdits studied by thc stLrdcnt can be highcr on choice o1'

opcn clcctivcs.

Syllabus of Master of Computer Applications (MCA), approved by 52^d (online) BoS of USIC&T held on 29.11.2020 and

AC Sub Committee on 30.1-1.2020 to be made effective from the Academic \ear 2020-2021 onwards.

I'aperID

PaperCode

44501 SE5O I

44502 SE 50244503 SE 503

SL. 504

J

J I

J

II

Y

\a

I:ach stuclcnt shall be rcquircd to appcar lbr thc cxaminatiorr in all colrscsstLrdied. IIowever. forlhe arvarci ol'thc dcgrcc a studcnt shall be reqLrircd to carn a

rnirrirnurn I 04 crcdits.

4. A course on Entrepreneurship Mindset shall be off'ered as an open clective

5. 'Ihe practical shall be based on the syllabus of the 'I'heory Paper. 'l'hc list ol'praclic-al to he decided by the Academic Programmc Committee of t,lSIC&'l-

NUES*: No End-'I'erm Exam would be held for this course. Marks out of 100 shall be

awarded as the continuous evaluation of the perfbrmance. 'Ihe evaluation rnodalities shallbe decided by the academic program committee of the schoo[.

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.11.2020 and

AC Sub Committee on 30.11-.2020 to be made effective from the Academic \ear 2020-2O21- onwards.

&'

\')/

Paper II): 44601

Code: 11'601 Paper: Database Management System

t,

3

'r'fi, cll

Course Outcomes:

COJ

Course Outcomes -Program Oulcomes Matrix

Filled on a scale of I to 3 (-l-lligh: 2=Modcratc: I [.ou,: "-'fbr no corrclation)

UNIT I

Basic concepts: database & database users, characteristics of the database systems, conceptsand architecture, date models, schemas & instances, DBMS architecture & data independence,database languages & interfaces, data modelling using the entity-relationship approach.Extended ER concepts - Specialization/Generalization, Aggregation, Mapping of ER model toRelational Model

r..NI't'2

Ilclational Iltlticl corrccpts. relati()nal rrrtldcl constrait.rts. r'clatiorral algcbra. SQL I)DI-. tX l. &I)MI- vicr.r's attcl indcxes in SQl.. I'1./SQl. Proglarnrnine. Storcd I)rocctiLrrcs. [,rscr I)cllrrcti[:r.rnctions. Cursors. [:rror Ilandlirrg. I riggcrs.

TJNIl'J

Itelational data base design: functional dependencies & nonnalizatiorr lbr relational databases.normal lorms based on functional dependencies. (lNIr, 2NIr, 3NF & IICNIT), lossless join arrddependency preserving decornpositiort, normal forms based on multivalued & .ioin dependencies

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of US|C&T held on 29.11.2020 andAC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2020-2027 onwards.

I NSTRTJ C]'IONS 1'O PAPEIT SE'I']'I]IIS : Maximum Marks:75l. Question No. I should be compulsory and cover the entire syllabus. 'l'his question should havc

objective or short answer lyre questiorrs. It should be of'25 rnarks.2. Aparr liom Question No. l, rest ol'the paper shall consist of fbur units as per the syllabus.

Every unit should have two questions. However, student may be asked to attempt only I ques-tion from each unit. Eqc! question should be 12.5 marks

cor('o 2

Ability to design a relational database model.

lbrms

s lll I" arrd

Abil to ol- databasc

Abili to wntethe

CO-l Abil to cor-rstruct transacti<ln routrnes

POI PO2 PO3 PO4 tro5 PO6 PO7 POU PO9 POIO I'OI I POl2colc()2

J

J

J J ')I I

J J 2 I l

('oiC()4

.) -) J 2 I I

J J J 2 I I

V

i

l

II1

(4NF & 5NF) & dotnain key norrnal lilrrn. Propcrties ol- 'l'rarrsactiorr. 'l ransaction statcs.'l'rausactior.r

Schccl ul c

I.JNIl' 4

Serializability, Concurrency control techniques: locking techniques, time stamp ordering.I{ecoverable schedules, granularity of data items, Deadlock detection and I{ecovery, recoverytechniques: recoverv concepts, database backup and recovery fiom catastrophic failures.Concepts of Object Oriented Database Management systems & Distributed DatabaseManagement Systems

'l'ext Ilooks:

l. I{. I:lrnsari and S. IJ. Navathc. "lrunclanrcr.rtals o1'clatabasc s\stclns". I)carst'lrr Iciucatitln.7th I:clition. l0l8

Itel'ercnce llooks:

l. A. Silbet'schatz. I'1. Ir. Korth and S. Sudershan, "[)atabasc Svstcrn C'orrccpt". Mc(lrawIlill. 6th lrdition.20 I 3.

l. I)atc. ('..1.. "An introduction 1o databasc svstenrs". {lth l:clition. l)carsorr I:clucation. 1008.i. P. Rob & C. Cororrel. "Databasc S-ystcrls: l)esign lmplcmcntation & Managcnrcnl".

'l'lromsor.r [,earning. 6th Editiorr. 20044. Desai. B.. "An introduction to database concepts". Galgotia pr,rblications. 2010


AC Sub Committee on 30.11..2020 to be made effective from the Academic Year 2020-2021 onwards.

<-

\o

I)aper I I):{{603

Code:l'l'60J Paper: Computcr Organization and Architecture

L

3

.I'lI' C

J

Course Outcomes:

Course Outcomes -l)rogram Outcomcs Matrix

Iiillcci on a scalc ol-l to -i (3 lligh:2 Modcratc: I I-ou: '-'lirr rro corrclatiorr)

C'O3

C()4 J

TJNIl'I

Data Representation: Binary numbers, binary codes, fixed point representation, floating pointre presentation, error detection codes. Computer Arithmetic: lntroduction. addition andsubtraction, multiplication algorithms, division algorithms. floating point arithmetic operation.decimal arithmetic unit, decimal arithrnetic operations. Register T'ransl-er and Micro operation:Register transfer language, register transfer, bus and rnemory transl-er, arithmetic microoperations. logic micro operations, shift micro operations.

TJNIl'2

Ilasic Computer Organization and Design: Instruction codes, cor]rputer rcgisters, compLrterinstructions, timing & control, instruction cycle, memory relbrence instructions. input- outpr"rt andirrterrupts, design ol basic computer, design ol accumulator logic. Microprogrammed ControlIJnit : C]ontrol memory, address sequencing. C-'entral Processing tJnit: tntroduction. generalregister organization. stack organization, instruction formats, addressing nrodes. RISC and CtSC.

TJNI'I'J

Syllabus of Master of Computer Applications (MCA), approved by 52'd (online) BoS of USIC&T held on 29.1,1,.2020 and

AC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2O2O-2O21 onwards.

2

coI Ability to understand theol- computer architecture.

data representations. basic operations on data, and components

('o 2 Abil lo thc knowl of'Basic C ization andAbil to the I i nterl ac i and men.ro lzalIon.co3

CO4 Ability to understand the parallcl prqcessing, pipeline conoept arrd multiprocessors

COIPOI PO2 PO3 PO4 Iro.s PO6 PO7 t,o8 I'O9 I'OI0 POil IroI22 J ) ) I I 2 I

C()2 J ') J ) I 2 I l

2 2 2 ')I 2 I I

2 2 I 2 I I

Y

i INSTRUC - - Vtaiimum Marts: * i

I I. Question No. I should be compulsory and cover the entire svllabus. This question should naue I

l_ qEggl1g !f short ans*er type . Ir should be of 25 marks. I

I Z Ap..n rpcr rt,rll ."rrtitl "l-

tbur units i., p", th.'s-vllabLLsl]

I Every unit should have two questions. However, student may be asked to attempt only I ques- |

l_ tion from each unit. Each question should be 12.5 marks l

Input - Output Organization: Peripheral dcvices, input - Output interlace, asynchronous datatransfer, modes ol data transfer, priority interrupt, direct memory access, input outputprocessor. Memory Organization: Memory hierarchy. main mernory, auxiliary memory,associative memory, cache memory, virtual memory, memory management hardware.

LJNII'4

Parallel Processing, Loosely and'l'ightly Coupled Processors. Amadhl's Larv. Pipelining,Arithmetic Pipeline. Instruction Pipeline, RISC Pipeline, Vector Processing. Array Processors.Multiprocessors, Interconnection Structures. Inter-processor Arbitration, Communication andSyrrchronization. Cache Coherence.

'l'ert liroks:

M. Morris Mano. Ita.iib Mall "Computcr S1'slem ar"rd ArchitectLrc". Ilcvisccl Ihird l.cli-tiot.t Pcarsorr l:dr.rcatiorr. 20 I 7

Itel'crence Ilooks:

l. t'}al ('haLrdhLrri. P. "Corrpirtcr Orcanizatiorr & [)csign". 3''r Irclirion. t'l ll. 2009.). Ilaycs .1.I']. "Conrputcr Arclritecturc and Organization". Mc (lrau, IIill.l97ti.3. Stallings. W. "Cornputcr Orgarrization & Architecture". lgttr l:clition I)ciirsor.r l:clucatitrn

2016.

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.1L.2020 and


1

{

6\

Paper ID: 44605

Code: IT.605 Papcr: Soltware Iingineering

LTlPC

311

Course Outcomes:

Ability to analyse the requirements and to design, develop. and mainlain the sollwareS III S

Abili to estimate the size and cost ol'soliwareAbilit-"'to dcsign and e.recutc thc tcsl cascs lirr solirvarc s_\'stcnrs Lrsing diilbrcnt tcstirrg

(lourse Oulcomes -Program Outcomcs Matrix

Filledonascalcof lto3(3-High; 2,-Moderate; l..l.ow; '-'lbrnocorrelation)

POti I'O9

UNII'I

Softrvare Process Models: Soliwale Process. Generic I)rocess Modcl l;rarnework Activitr. .l ask

Set and Proccss Patte rnsl Process Lilec-v-c)e. Prescriptive Process Models Watcrlall. incrcrnental.I:voliltionan concLlrrent models. Agile [)roccss Modcls [:rtrenrc Prograrunrir.tg (XI'). AclaptivcSoftware [)evclopment. Scrun.r. Dynamic Systcnr Dcvelopmcr.rt Mocicl. Fcalurc I)rivctr[)cvelopment, Cry'stal.

TJNII'2

Sollrvare Iiequiretnents: I'-unctiot-tal aud Non-[iunctional lteqr,rirerncnts: I'.iicitir-rg llccluircrrenls.Developing LJse Cascs, [i.cquirement Analvsis and Modclling; IleqLrirentents I{cvicr,r. Solir.,,arcIlequirement and Specification (SI{S) [)ocument. Irstimation and SchedLrling ol' SoliwarcPro.iects:Soliware Sizit-tg, LOC and IrP based [:.stimations; [:rstimaling Cost and l.-ilirrr; lr.stintatiorrMociels. Constructive Cost Modcl (COCOMO). Pro.iect SchcdLrling and Stafling; l'irnc-line(l harts.

Syllabus of Master of Computer Applications (MCA), approved by 52^d (online) BoS of USIC&.| held on 29.11.2020 and


INS'|ILUC]'IONS'l'O I'>AI'EIl Stll"[!]R.S: MaximumMarks:75l. Question No. I should be conrpulsory' and cover 1hc cntirc slllabus. 'l his qllcstion siroLrid

lrave objectivc or short at-lswer typc qucstions. It should be ol-25 r.narks.

2. Apart from Question No. l, rest of the paper shall consist of four units as per the syllabusEvery unit should have two questions. However, student may be asked to attempt only I

question fi'om each unit. Each qlqslign should be 12.5 marks

cot Abiti to use understand the sollware rocess rrodels.c()2

co3c()4

POI PO2 PO3 PO4 POs PO6 PO7 PO l0 POllCOI J J J I I 2 J I

co2 J J J I 2 I J J I

COi J J J I I 2 1J I

co4 ) J J I 2 I I J I

p[Ig-q!q.

t)oI2

I

l

II

- ..1;: .-r:iira{€F!*.=a'}-::c:1|sE}y=Y:-f:---,,:' ir !:-)r - s- '? '

UNIT3

Soliu'are Design: Abstraction. Architecture. Pattcrns. Scparation ol' Conccrns. Moclr"rlaritt.lnlbrmatiorr tliding. l:unctional Inclcpcndence. Cohcsion and ('oupling: Ob.jcct-Oricnted Dcsi{-1n.

I)ata I)esign. ArchitcctLrral I)csign. []scr lrtlcrlacc l)csiqn. ('onr1.loncnl l.cvcl I)csien.soliuarcQLralitl': Mc('all's QLralitv lractors. ISO 9126 QLralit.r I:actors. QLralitr' ('orrtrol. QLralirrAssurance. Itisk Management. I{isk Mitigation. Monitoring anci Manaecntent 1l{MMM):Soliware ttel iabi I ity.

I..INI1'4

Software-l'esting: Verification and Validation; Error, I"ault. Bug and l"ailure; Unit and Integratiorr'l'esing; White-box and Black-box 'Iesting; Basis Path '[esting, Control Structure 'festing,

Deriving Test Cases, Alpha and Beta Testing; Regression Testing, Performance -l-esting,

Stress1-esting. Software Configuration Management: Change Control and Version Control: SoftwareReuse. Software Re-engineering, Reverse Engineering.Component Based Development, Aspect-Oriented Software Development, Formal Methods.

'l'ext Ilooks:

L ltogcr S. f)ressrnan, "Sotiwarc ['.ngincering- A l)ractitioncr's Approach". t:ighth [:clitiorr.McGraw-tliil lntcnrational l:dition. 201 0.

2. K.K. Aggarwal & Yogesh Singh. "Solinare [:rrgincering". \cu ngc Intcrnational [)Lrb-

Iishcrs. Nelv Delhi.'fhird l:dition. 200U.

ILelt'rence llooks:

l. I'}ankaj .lalotc."A Concise lntroductior"r to Soliwarc I'.ngirrcerirrg". Springer, 200t3.

2. lan Sornmerville. "Softwarc ['.ngineeling", lOth edition. Pearsorr.20lli.3. Stephan Scach. "Sotlware L.ngineering". McGrarv llill. 200ti4. CemKaner. .lack Falk. Nguven Quoc. "'l'csting (lonrpuler Sofiuarc". Sccond L:clition.

Van Nostrand lteinhold. Ncu York. 199i.5. GojkoAszic. "Specitication by Lxample", Manning Publications. 201 l.6. Kent Ilack, "Test-Driven f)evelopment lly l.:xanrple". Pearson I:dLrcation, 200,i.7. Boris []cizcr', "Software Systcrn'l'esting and Quality Assurancc". Van Nostrand Ilcirr-

hold. Ncw York. l9tl4.8. Mike ('ohn. "Soliwarc [)evclopnrcnt [Jsirrg Scrunr SLrccccclinn rrit]r Agilc". PeArsorr

I:clr"rcation.

Syllabus of Master of Computer Applications (MCA), approved by 52^d (online) BoS of USIC&T held on 29.11.2020 and


v

v

I I

I

I'aper lD: 44607

Codc: I'l'607 Paper: Data Structurc and Algorithm

f,

3

T/P C

t4

INSTRUCI'IONS TO PAPER SI]'['IERS: Maximum Marks: 75l. Question No. I should be compulsory and cover the entire syllabus. I'his question should

have ob ive or short answer uestions. lt should be of 25 marks2. Apaft from Question No. l, rest of the paper shall consist ol lour units as per the syllabus

Every unit should have two questions. However, student may be askcd to attempt only I

uestion fl'om each urrit. l.,ach uestior.r shor-rld bc 12.5 rlarks

Course C)utcomes

(lourse Outcomcs -Program Outcomes Matrix

[]illed on a scalc ol- I to 3 (3 -lligh: 2,Moclcratc: I l-oi,r': '-'1or r.ro corrclation)

PO5 I)O6 Iro9 PO r0 POII PO I2POI PO2 PO3 P()4 PO7 POU

col -) J J J J J

J

2 2

2

2

c()2 J J J J J 2

CO3 J J J J J J 2 I

CO4 J J J J J J 2 2 I

TJNIl'I

Introduction to data structures, arrays and its applications, Sparse Matrix, singly linked lists,doubly linked lists, circular list, Implementation of stacks and queues using arrays and linkedlists, circular queues, applications ofstack and queue.

I.,]NI'T 2

'l'rccs. Irorcst. llinarl 'l'ree. 'l'hreacled Ilinarl ['rec. tcrntinolour'. rcprcserrtalion. [iinary' Scarchtrcc (inscrtion. dclction ancl cliiicrcnt tlavcrsals tcchniclLrcs). IJalanccd Scarclr tlccs, AV[- It'ccs. I]tree. ll i trecs. lJx 'l'rcc. [)ata Strr-rclr-rrc iirr Scts. dis.ioint sels in'rplcrncntation. (iraph Algoritl-rnts:lerrrinologv. Iiepresentation. Craplr travcrsals. Illcaclth-lrirst Search. I)c;lth Irirst Sealch.Shoflest Paths. Marirnum lrlow. Minintum Spanning lrecs.

TJNI'I'3

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.11,.2020 and


coI Ile able to understand thc dill'erence between dala strllctLlrc anri structured clata r.lith 1-cw

cramples such as stack. qucue ancl link listCO2 Ability to model different types oltrees, balance trees and graphs

Ability to analyze the timc/ spacc conrplexity arrd understanding ciii'f'crcnt kinds o1'searching/sorling algorithms

cto 3

C]O 1 Ability to apply the knowledge ol dynamic paradigm. greedy paradigm ancl idea o1'NPcompletc problems.

L*

s

Notion of Algorithrn. Growth of lunctions" tJse oi- llig O . ^ . O in altalvsis. Slin.rrnatior.rs.I{ecurrences: 'l-he substitution rnethod. 'l'he itcration ntcthod. 'l'hc ntastcr ntcthocl. Scarc}ring'['echniques: Sequential Search Binary Scarch. hashingSorlirrg lechniques: Insertion Sorr. I)ividc ancl conqucr I'araciigm ol-Problen-r solr,'ing (Mer-qc sort.Quick Sort). Priority'Qucues irnplernentation using IIcap sor1, sorling irr linear timc (cor.rnt so11.

radir sor1. bucket sort).

UNII'4

Design Techniques with examples: Dynamic Programming, Greedy Algorithms, Backtracking,Branch and Bound, Concepts of I'], NP arrd NP hard and NP complete Class Problems; NP-completeness and Reducibility, Approximation Algorithnrs, Randomized Algorithms for NPcomplete problems.

'l'ext llooks:

I 'l'.11. ('onlcn. ('.1r. l.ciscrson. IL.l.. Ilivcst ancj (-. Stcin. "lntrodLrctiorr to Algorithnrs".PIll l,earning Pvt. l.td. (Originall-v- MII'I)rcss): I'hircl cclition. 2010

2. F.llis Ilorowitz. Sanaj Sahni. Anderson-l-'r'eed. "l'undamcntals o1'l)ata Struclures in (1".

Second Edition. [Jniversity Press, 200t1.

i. L:llis Horowitz, Saftaj Sahni, S. I{ajeshkaran, "frundamentals ol Compurer algorithrn".University Press. Jan 2008.

Ilel'crence Ilooks:

I. Il.Kruse. C.L.'l'ondo. IIP Ler-rng, Shashi M. "Data Slructures ancl Progrant [)esign in C".Sc'cond Ildition. Pearson ['.ducation, 1991.

). Jon Kleinberg and Eva'l'ardos , "Algoritl-rrr [)esign". Pearsorr I:dition. ]006.3. San.joy Dasgupta, Christos I'apadimitriou, [Jrnesh Yaz-irant. "Algorithms".'l'MII.2017.4. A.S.'l'anenbautn. Y. [,angsam. anc] M..1. Auscnstein. ''l)ataStrLrctLrrcs l,sing C". Pcarson

Irducation. 1996

-5. B.W. Kcrnigharr. Dennis M.li"itchie. "'l'hc C l)rograrnnring Langr-ragc". I)carson [::ciuca-

tion. l9tl8.6. S. Sahni and I:. llororvilz,. "l)ata Strr"rctr-rrcs". (ialgotia Pr-rblications. 2004.1. Anarrr l-cvitin. "lrttroduction to the [)csitrt and Analvsis ot'Algorithn'r". I)carson I:ciuca-

tion Asia. 200i.tl. Ka:nlhane . "lntroduction to [)ata Structulc in (."'. l)carson I:ducatiorr9. Anatrv l,evitin. "lntroduction to thc Dcsign and Analvsis ol'Aigorithm". I)earsor-r l'.ciuca-

tion. 201 I .

10. Sara [Jaase and Allen Van Gclder. "Oorlt1-ruter Algorithms - lntrocluction to l)esign andAnalvsis", Pcarson Lrducatiou, I 999.

Il. Il.A. I"orouzan and I{.}r. (iilberg. "CompLttcr science. a structurcd prograrrrnir-rg approachusing C" . l'hird edition. Cengage l.carnirrs. 2007.

12. A.V.Aho. J.lr. Ilopcroii and J.l).tJllman. "'lhc l)esign ancl Arralvsis O1'C'ompLrtcr Algo-lithrns". Pearson Lrducation. 1 974.

13. Seymour Lipschutz, Data Structures, Schaunt Series.'fMII,2014

Syllabus of Master of Computer Applications (MCA), approved by 52"d (online) BoS of USIC&T held on 29.11.2020 and

AC Sub Committee on 30.11.2020 to be made effective from the Academic \ear 2020-2021 onwards.

{

4.

Paper lD:44609

(lode:l'l'609 Paper: Foundation of Computer Science

t.

3

.I'iP C

l4

INSTRUCTIONS'l'O PAPER SE'I"[[]RS: Marimum Marks: 75l. Question No. I should be compulsory and cover thc cntirc sy'llabus.'l'his question should

have o ective or shon answer lt should be ol2-5 rnarks.

Course Outcomes:

Ability inspect the graph theoretic algorithm to lay down foundation for complexdata anal

('ourse Outcomes -l)rogram Outconres Matrir

Filled orr a scalc of i to 3 (3 Ilighl ? Moderatc: I [.ou: '-'lbr no corrclation)

TJNII'1

Sets, Relation, and Number theory: Sets and Relations: Set Operations, I{epresentation andPropenies of Itelatious, L,quivalerrce I{elations, Paftially Ordering. Mathematical Induction,Basics oiCounting, Pigeonhole Principle, Permutations and Combinations, Inclusion- ExclusionPrinciple. Modular arithmetic, Prime numbers, congrucnces (linear arrd quadratic)

TJNII'2

l,ogic. Inferencing, and Recurrences: Mathematical [.ogic: Propositional and Predicatc l,ogic.Propositional Equivalences. Normal Fomrs, Predicates and Quantifiers, Nested Quantiliers, I{Lrles

of lnference, Proof by Resolution. Recurrence relations, solution methods fbr Iinear, first-orderrecurrence relations with constant coefficients.

I.,INI1'3

Gloup theory: Group identity and uniquerress, inverse and its uniqueness, isomorphism andhomomorphism. subgroups, Cosets and Lagrange's theorem, Permutation group, Normal


AC Sub Committee on 30.1"1".2020 to be made effective from the Academic \ear 2020-2021 onwards.

2. Apan from Question No. l, rest of the paper shall consist ol'lour units as per the syllabus.E,very unit should have two questions. However. student may be asked to atlempt only I

r-rcstion from each uni1. Each should be 12.5 marks

cor Ability to utilize the lechniques lbr constlucting rnathematical prool.s and countingprinc iplcs

co2 Develop computational thinking to approach traclable problemsco3 Ability to apply the basics of number theoryco4

POI Ir()2 POi PO4 POs Iro6 PO7 POU PO9 PO l0 POlI PO I2COI _) 2 J 2 _) J 2 2 I

('o2 f_) 2 J 2 J J 2 2 I

C()3 J JaJ 2 J J 2 2 I

C()4 1J 2 J 1 J J 2 2 I

5

subgroup and quotient groups. Overview of Rings, Field and polynomials, Finite fields and someapplications, Error Correcting codes (Linear and circular codes).

IJNIl'4

Graph theory: Craph terminology, Paths and Circuits, Shortest Paths in Weighted Graphs,Spanning trees, E,ulerian Paths and Circuits, Hamiltonian Paths and Circuits. Planner graph,Graph C'oloring, Five color Theorem, Matching in Bipartite Graphs.

'l'ext IJooks:

l. Kenneth Rosen, "Discrete Mathematics and Its Applications". McGrawllill.20lT

Reference Books:

l. Nonratr t-. tliggs, "[)iscretc Matherratics". Seconcl cdition. Oxfbrd LJrricrsity Press, NewI)elhi. 2002.

2. J.P. l'remblay & R. Mamohan, "Discrete Mathenratical Structule rvith Application roComputer Science,"'l'MIJ, New Delhi.2000.

3. Kolman, tlusby &lloss "Discrete Mathematical Slructurcs". 6th eclition. PIll/Pearsorr.2009.

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.1L.2020 and


&/

-/tl/

L 'I-IP CI)aper I I): {;16l I

Code: 11'6ll Paper: Ob.iect Orientcd Programming 311

2. Aparl from Question No. l, rest of the paper shall consist of fbur units as per the syllabus.Every urrit should have two questions. However, student may be asked to attempt only I questionfrom each unit. Each question should be 12.5 marks

Course Outcomes:

Explain the fundamentals olan OOP language and various f-eaturcs ot'Cl to suppofl(X)P ltcl les

Course Outcomes -Program Outcomes Matrix

I.JNIl'I

lntroduction to Object Oriented Programming, Advantage of Object Oriented Programming, Ad-vantage of C I t, Application olC l t. Basic elements in Cl t, Ct t lrunction & its Prototypes:-l'ypes of Function, Actual& Formal Arguments, Default Argument, Function Overloading. Op-erator Overloading. Classes & Objects in C -r+, Access Specifiers, lnline Member Function,F'riend Function, The 'this' Keyword, Static & Non Static Mernber Function, Constructors &Destructors, Array of Class Object, Union & Classes, Nested Classes, Inheritance in C+-1-,

Overriding Member Function

UNI'I'2

I)olymorpl-risn-r in C t i-: 'l-ypcs of'Polyrnorphisnr, Overloacling Mcnrber & Non Mcrnbcr lrrrnclion.Virlual & Pure Virlual [rurrctiotr. Abslract CIass. I{cstriction On Ijsing Abstract Classcs. Inlro-dLrction 1o.lava: Java Architecture. Java [)cvclopnrent Kit (.1 I)K). Advantagc ol'Java. Applica-

Syllabus of Master of Computer Applications (MCA), approved by 52'" (onlrne) uoS of t.lSlC&l held on 29.11.2020 and

AC Sub Committee on 30 \1.2020 to be madc effective f rom the Acadernrc Yr:ar 2020 2021 onwards.

I NSTRUCl'IONS'I'O PAPI]R SE'I"I'ERS :

:75Maximum Marks

l. Question No. I should be compulsory and cover the entire syllabus. 'fhis question should haveobjective or shoft answer type questions. It should be of 25 marks.

COI

cC)2 Analyze the fundamental features ol.lava programming language. discuss the conceptofpackages and understand the use o1'standard Java classes

CO3 l.earn and implement nrultithreading and exception handling in Java and explain thcconcept ofapplets in Java

C()4 Design the windowed applications and web-based applications using applet and swingpackages and implement event handling. Implement the Inputi Outpr"rt streams anddatabase connectivity in Java

Iro I PO2 PO3 PO4 PO5 P()6 POl PO8 Iro9 PO l0 POil PO I2COI J J J J J 2 J 2 2 2 2 ')

C()2 J J J J J 2 -)

J

) 2 I I 2

COJ ) l ) ') 2 ) I I

c()4 J 2 J J 2 J 2 I I')

&/

-) L t

tion of Java, compilation and execution process. Basic elements in Java Programming. Classes &Objects in Java, Constructors, Class inheritance and Polyrnorphism in Java, [Jsing super and fl-nal, Abstract Classes and Interfaces. Extending Interfaces. Dynamic Method Dispatch. GarbageCollection. Packages in Java: Defining a Packages, Java Cllass t,ibraries, User Defined packages.Standard Classes in Java: String, StringEluft-er, String-l-okenizer, Object class, System class,Wrapper Classes

T \I'I'J

L,xception Handling in Java: fundamentals. exception types, uncaught exceptions, throw andthrows keywords. finally, built-in exceptions, user-defined exceptions. Multithreading in Java:fundamentals, Java thread model, creating threads, using methods of 'l'hread class, thread priority,thread synchronization, Inter-thread communication: wait. notify, notiry all. Applets: appletpackage. life cycle of an applet and security concerns. configuring applets. passing parameters toan applet

tiNIl'.1

Swing: Introduction To Swing, Swing Features, Hierarchy Of .lava Swing Classes, Swirrg GtJIComponents, Packages Used In Swing, Using Swing APl. AW'f v/s Swing. F.vent Ilandling InSlvings, [:vent I-istenel Intcrtaces. Adapter and Inner Classcs, Working with windorvs. OraphicsObject and Layout managers. Input/Output Ilandling in Java: Input/Output Stream. StreanrFilters. l]ulfcred Streams, Data input arrd Output Stream, Print Strcam. File handling. Overviewof JDBCI, Object serialization, Remote Method Invocation. Java Nativc Interfaces. JavaCollection I-ramework

'l'ext lJooks:

l. []. Stroustrup. l'rograrnming: Prirrciples and Praclicc Ljsing C t i. Pearson, Seconci t:ditiorr.20142. tl. Schildt. "Java -'l'he Cornplete Rel'erencc". Ninth cditiorr. Mc(llaw IIill t:dLrcation. 2017

Ileference Ilooks:

l. G. tlooch. I{. Maksimchuk. M. l:nglc et al. Ob-iect-Oricrrtcd Anallsis ancl [)esign rrirh Appli-cations. I-hird edition, Addison-wesley, 2007.

2. R. [.afbre, Object Oriented Prograrnrring irr C' t 1. Irouflh cdition" 200tt.l. [:. i]alagurus\\arn\'. Objcct Oricntcd Progran.rn'rir.rg with (l;,. Scvcr.rth I:ditiurr. Mc(lrarr IIill

lrclucatiorr (lndia). 20 I 7.

4. I'j. I)ictcl and II. I)eitel. ".lava Ilow to [)rogram". Elcvcnth cdition. Pcarson.20]8.5. []. Vatttters. Iltsitlc thc .lava VirtLral Machinc. Mc(lrarr IIill l:ducatiorr. Scconci t:rlitiotr. 19996. D. Liarrg. Introduction to Java l)rourarnrnir'rg. Scvcnth I:dition. I)carsorr. ](X)9.1. K. Sicrraand Il. []atcs, Ilcad Ijirsl.lava. Second [:clition. O'ltcillr.1009.

Syllabus of Master of Computer Applications (MCA), approved by 52nd (online) BoS of USIC&T held on 29.1.1.2020 andAC Sub Committee on 30.11.2020 to be made effective from the Academic Year 2020-2021 onwards.

I

V

syllmcase2ys171220.pdf - guru gobind singh indraprastha

Documents