Scribd
Upload
84 views4 pages

N, 4athematics-Ll: Students To Opt Eilher or

The document provides a list of elective courses and subjects for the Bachelor of Computer Applications (BCA) program for the year 2019. It details the courses offered in the 2nd, 4th, and 5th semesters of the program, noting that students must opt for either the E1 or E2 option listed for each semester. Courses include Fundamentals of Discrete Mathematics, Graph Theory and Combinatorics, Software Project Management, and Numerical Methods.

Uploaded by

Djsbs Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
84 views4 pages

N, 4athematics-Ll: Students To Opt Eilher or

The document provides a list of elective courses and subjects for the Bachelor of Computer Applications (BCA) program for the year 2019. It details the courses offered in the 2nd, 4th, and 5th semesters of the program, noting that students must opt for either the E1 or E2 option listed for each semester. Courses include Fundamentals of Discrete Mathematics, Graph Theory and Combinatorics, Software Project Management, and Numerical Methods.

Uploaded by

Djsbs Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

LIST OF ELECTIVE PAPERS IN BCA COURSE -2019

SEMESTER COURSE/SUBJECT

Fundamentals of Discrete Mathematics

N,4athematics-ll

:BCA-S2'10-E't Graph Theory & Combinatorics

2 4th OR
i
BCA-S210-E2 [,4athematics-lll

BCA-S304-E1 Software Project l\,4anagement

3 5th OR

BCA-S304-E2 Numerical l\,4ethods

Note : ln BCA 2nd, 4th and 5th Semesters, The students need to opt eilher El or E2 as elective.

. .'e59t tu (an*ze)
^'u'f
N,
.-)'
\

Bachelor of Computer Applications

Course Code Course Name LTPC


BCA-S110-E1 Fundamentals of Discrete Mathematics . 4 00 4
UNIT-I: INTRODUCTION TO BOOLEAN LOGIC

Statements and Notaiion. Connectivcs. Negation. Coniunction, Disjunction, Statemenl lbrnulas


and Trulh tables. Conditional and Bicorlditional. Tautologics. Contradictions, wFF. Equivalence
offormulae, Dualit! 1a\l. T\o state l)cvices and Statement Logic.
\ormal forms, Disjunctive Nomral ]:orms. Conjunctive Nornral forms

UNIT-II: SETS AND ELENTENTS


Sets and Elements. llqualit] of Sels. Subscts. Set operations. Venn Diagrams & Set operations,
Fundanrcntals products. Algcbra of Sets. Dualit,"-. Finite Sets, Counting Principles. Classes ol
Scts. Induction, S) mmetric Dif'f erence.

t,\IT-III: RELATTONS
I{elalions. Representatiorl Reldtions. Composilions of Relations. Tl_pes ol Relatiolls.
of
Equivalence Rclations, Partial Ordering Relation, F'unclions: Function, Mapping. Real valued'
Composition. One to One, Onto, Invenible. and the Cardiialiry ofa set.

UNIT-IV: (lILA.PHS
Basic Concepls: (lraphs. licidcncc and desrec. Isomorphism. Sub graphs and Union of graphs,
conncctedness. \\alks. Palhs and Circuits. Euler's Formula. IiLllcrian graph. Harriltonian graph'
Chromatic Graphs. Planer Craphs. iravelling salesman problem, Cornpletc. Regular and
Bipafiite graphs, Directcd Graphs

UNIT-V: TR.XES
Basio Concepts: 'i rees and their properties. Binary Trcc. l'raveNing Binary Tree. Complete and
Iixtcnded Binar-v'l'ree. Directed l'ree, Dcpth first search algorithm

TEXT BOOKS
l. J.P Trcmbla). R. \'lanohar. Discrcte \'la!henlatical Slrllclures with ,{pplication ol'
Compuler Soience. Tata NloCraw Ilill.
2. Seymour' I-ipschutz. Discrcte Mathematics, McCraw Hill.

REFEITXNCES
L Joe l. Iviotr. Abraham Kandel, Theodore P. Baker. Discretc N{athernatics lor Computcr
Scientists and Methcmaticians, Pl 11.
2. Narsingh Deo, Craph Theory. PHI
l. V.K. Balakrishnan. Graph Thcory, Tata McCrarv Hill.
Bachelor of Computer Applications

Course Code Course Name LTPC


BCA-S210-E1 Graph Theory and Combinatorics
a
4004
UNIT I : I,\TRODUCTION
Bricl Hislory of Graph Ihcoly Applicalion ol Cmph Finite and Infinite (;raphs_ l\,4atrix
representations, degree, operations on graphs, lsolated Vertcx. pendant Vertex and Null
Graph.

U\lT II : TliEES, CO\NECTIVTTY & PLANARITY


Spanning trees Fundamenral circLrits Spanning trees in a Vreightcd graph cu! sets
I\'opcftics of cut set All cu! sels fundamcntal circuits and cut sets . ionnectivitv and
separabilitl Net[,ork flous ]-lsonlorphism 2-lsomorphism -Combinational cnd r,Ieornctrir
araphs.

tr\IT III: IIATRICES. COI-OUl{t\C {ND DIRECTED CRApH


Chromatic number Chrontatic patitionin! Chromatic polrnomial Matching Covering
Four color problem Directed sraphs l lpes ol dirccted uraphs Digraphs and binar\ lclitions
D.r..teu prtl . .r tJ .un.r-ctco ti..

UNIT IV: PEIIN{UTATIONS & CONIBINAT'tONS


fundamcntal principles of counting pcrmutatjons and combinations Binomial thcorem
cornbinations with rcpetit;on Cornbinatorial numbers principlc of inclusion and exclusion
I)eranecn'rents Arransements \\,ith lorbiddcn positions.

IINIT \': (lE\ERATING FUNCTIO\S


(jcneratins tirnctions Partitions of inlegers Exponential generating functioll
Summation
operalor Rccurrence rclations l-irst order and second ordcr \on-hontogeneous recurrencc
relations Methodofgcnerating lunctions.

TEXT BOOKS:
l. Narsinsh Dco. Craph Theor\: \\rith ,{pplicatio| to Engineering and Computer
Scicnce".Prenticc Hall of India. 2003.
2. Grimaldi R.P. 'Disii-rere and Combinatorial Mathemalics: An Applicd Inlroduction,.,
AddisonNeslcl,. 1 99.1.

REFERENCES:
l. Clark J. and Holron D.A. ,{lirsr LookarCraph lheory". Allied publishers. 1995.
2. Mott J.L., Kandel A. and Baker T.P. Discrerc Nlathematics ibr Computer Scientists and
Mathcnlalicians",Prentice IIall of lndia. I996.
3. L iu C.l,.. "Elcments oI Discrete \,lathcmatics '. Nlc (;ra\\ Hill. 1985.
4. Rosen K.H., "Discrele Mathematics and Irs Applicarions',. Mc Grau Hi11.2007.
Bachelor of Computer Applications

Course Code Coursc \amc LTPC


BCA-S30,1-E1 Softrvarc Project Nlanagemcnl 3104
UNIT I
INTRODUCTION TO SOFTWARE PROJECT MANAGEN,IENT
:
Project Definition Contlact Nlaoagcment Activitics covcred By Soft$are Proiect
Management C)vervicw of Projcci Planning Stcp(ise Proiect Planning.

UNIT II : PROJECT EVALUATION


Stratcgic Asscssmcnt Technical Assessment Cost Benefit Anal)sis Cash Flow Iorecasting
Cos! Bene{it E!aluarion Techniques l{isk Evaluation.

UNIT lll : ACTIVITY I'LANNING


Objecli\es Schedule S.quencing and Scheduling Activities Net\\oik PlanrliDg
Project
\iodels For\ard Pass Back\ard Pass Acti!,it) Float Shorlening Project Durxlion -
Acli\it) on Auo\\ \et\\orks Risk Nlinagenlent Nature Of Risk Ilpes OlRisk \4anaging
l{isk Hazard lden!ification - Hazard ,\nal) sis - Risk Planning And Control.

UNIT IV : NIONITORING AND CONTROL


Crcating Framcwork Collccting Thc Data Visualizing Progress Cost Monitoring [arned
Value Prioritizing Monitoring Cctting Project Back To Targct Changc Control Maneging
Contracts lnlrodlrction l')pcs Ol Contract Stages ln Clontract Placcmcnt Typical Tenns
OfA Conlraci Contract Nlanagemenl - Acceplance.

\' : N'IA\AGIN(} PEOPLE AND ORGANIZING TEAMS


I-I:{IT
lntroduction Understanding Beha!ior Organizalional Behaviour A Background - Selectiig
Thc Right Person For l'he Job Instruclion In The Best Methods Motivation lhe Oldham
Hackrran Job flharactcristics Model Working In Groups Becoming -\ Team Decision
l\4aking Lcadership Organizational Structlrres - Stress -Health And Salltl- - Case Sludies.

TEXT BOOKS
l. Bob I lushes, NIike Cotterell. "SoitNare Project Management", 'l hird Edition, I ata Nlc(iraw
Hi .2004.
REFERENCtrS
L Ramesh, Gopalas\\anl), "Managing CIobal Projects", Tata McGra\r llill.200l.
2. I{oyce, "Soliuare Pro.ject Management". Pearson Education. 1999.
3. Jalote, "Soliware Project Menagemcnt in Practicc", Pcarson Education.2002.

You might also like