BCA Syllabus 2019-22
BCA Syllabus 2019-22
1=ffi@fi,
"1
,**
%* W,Wffif
,,,. "n' M,
,ffi *r*.
"
E ru%?$YffiTffi *F AItAruE&gfiffi ffi &5Y, &lffiELISffi
Uffiffi &:AAffi ECEffiEPXTET}-&" SM&ME EIIISTITEJTE
[.8ffi ffi EPPffi$VTM AUT'UIU*M#US IftISTITT'TE
DETAILED SYLLABUS
&
SCHEME OF EXAMINATION
for
Senii':iter *I
Papt:-{gflq l)upcr Nanrc -tlrrrr
lMax Min
[Ce ttll 'CalcLrlus 0 132
BCA I 02 Irr lb-r matiorr Technology 2
Bi,\ i 0l lqpltq..
!qe1'net & E llA
B( \ iil4 Problcm soh'rlqg usilg l!l
BCA 105 _ ],PC Pa.t"g* __
Eq410q Brypi&qlrq'c'
Total
SetttL':lrtr - II
Pu1,r, i gtlr t't,1,*, ir,nii: Theory
lMax NIi"
l:nslrsh Ciranrmar
B( ob.jcct aj;i.;t.,1
"-(1.1 Pr.ograrnnting in
lctt
:iL', ?91 DBMS
lL- 206 Plagtical ln c++
!'qt:il 120 130 I
Senrc:;ti:r - III
P:rp, r' i odc l':rpt,r' \rurrt, Theorr lSessionaf Practical Total
ntax ttin lltax Min
\lin _!N{ar
\tar \tin
Bi A i0 i i)isc'eie Matner.r.ratios Ep pu z\) irr | iioO
BCA.\u2
BCA.\U2 Basic.Ner
\'isrral Basic.Ner _ 80 i32
80 B, IZOIZO t2 i t()()
BC.,\ \{)i lrrrrorlticriorr to
:-ill
Operating ]SO ISZ IZO
--l
,.Sy,s!en: _-r_ 1- i ] _l __L_ '-_-I i_ l
.u;_ lzo _lrz ,a
gcemlnqqiq4qor rq4qqqes
E!-A304
]so ]:z -}rt _l
sc.-r
M;i;i;;. "_
('ornputer G,'ophi.r pO& '" i'-
l:zlzo rz lsO
l20 ]" tl80 '"
['4O Xpq
_[p-o-
ii
sO
rorat _ -- l4oo f] l
Sertt,.lster - lV
I'api i'Cocle Papcr Nanre E*.1, ]qgsiql4| t.tqt4?l 'tot:rl
\tar i\lin Nai i\ti; \tar i\t
BCt.rltlt Nuir.,i"r,i H,lqtt g4r- lroo
!}.,.,i]\Jtlrttu.'d(.orltptttcrU032Euffifu0l r-,-
l
lAretriteclurei]]l
lAlehiteclure l l 12 lI lllIrl lr00 I
, gO
i
100
I
(olrti'ol . I
]
Proglrrlrning in
'Pnrcricll
Java 8_0_ i:l ,'g0 : '150
BC,\-1{}6 __ in Java ,_ tr _ if Z __ f0 ,100 |
qrcry b:
\G)
,) q/
Prestige Institute of Management, Gwalior - BCA session 20lg-zz
-
Setritslcr - \'
( orle l'rrper: \lrmt'
t-
Pulrt'r' 1-heory-' rssional Practical l-rtrt
EqA,!l,qlqelgqqlaiEq;atloni
Ul* -!4iq
p2
a=h,
iL
M:rx
@
BCA-502 ]Solwqre Engineerin
30
lr)
i l-- 100
!rylnlgLlllg
Ba.\itl-l ArtitlcialInreiligencean d Iju -lL
tl2
l
l
hoo
- -
Tmo
L\l)c]t \ stct)tS
B('-\i()4 Programming in Advance 80 11_ z0 12 100
.li.t rt
Note: Examination scheme will be as per Ordinance No. 60 of Jiwaji University Gwalior.
.^ \[
,!*r Vt ( -' '
E
<_-
v
'i'--.' Prestige Institute of Management, Gwalior
- BCA - Session Z0lg-22
PAPER CODE BCA - 101
Caleulus
Course Objective
The objective of this course is to familiaizethe students with core
concepts of calculus.
Learning Outcomes
1' l]nderstand the concept of limits, continuity and differentiability a function.
2' Analyze and evaluate rate of change at different points of given ofinterval using different
theorems.
3 ' Understand the concept of tangents, Normals,
curvature of a function and tracing of
CUIVCS.
4. u,derstand the integration of different types of functions.
5' Understand the application of integrals to determine
Quadrature, Rectification. Volumes
and srrrlaces.
Course Contents
UNIT.I
Review of concepts of ftLnction of one variable: Definition of a function.
Types of Functions.
Lirnits: definition, working rule for finding out the limit, fundamental p.op..ti".
of limits,
'Classification
probler.ns based on limits. Continuity: Definition, Points
of Discontinuiiy, of
Discontinuity, Problems based on Continuity & Discontinuity. Differentiability:
Condition
for Ditlerentiability and problems.
UNIT-II
Rolle's theorem,'First and Second Mean value theorems, Taylor's
theorem, Successive
diffbrentiation, Leibnitz Theorem, Taylor's & Maclaurin's series,
intermediate forms.
trNlT-m
Tangents. Normals, Curvature, Tests for Concavity and
Convexity, points of Inflexion,
Multiple Points, Tracing of curves in cartesian and ptlu. .o-ordinates.
U NIT-I V
Integration of rational and irrational algebraic functions and transcendental functions,
reduction fbrrnulae.
UNIT'-\,'
Delinite Integt'als. QuadratLrre. Rectification. Volurnes and surtaces
of solicis of revohttion.
Suggestecl Rcadings:
Main'Itrrt Bool<s
1. calc,lLrs-i b1'Dr. D.c. Agrawal, Shree Sai prakashan. Meerut
2. Dilfbrential calcr-ilus by Dr. Gorakh prasacl, pothishala pr,t. Ltd.
)-.
Rcf'erenrc ilooks
1. ('alcirlus *'irh Earlv Transcendental Functions
b1, .lames Stewar
e'r:1.
,)
L" ('alcrrlus Single and Multivariable
_). ('rrlt irlu:-Single var.iirhlc. Robert T.
*JT
/-r \--,
) I\-
Prestige Institute of Nlanagement, Gx'alior - BCA - Session 2019-22
Course Ob.jective
This course u'ilI enable tlte student to gain an understanding of the core concepts and
teu]rnolt,r:ics u lticlr constitrrte Information Technology.
Lcanring Outcomes
Able to articLtlate ancl clemonstrale a basic understanding of the findamental concepts of
lnfirrmati on'l-echnology
(lourse {lontents
TINI'I'.I
Clott't1-rt-ttcr S1'sterr Concept. Compr-rter System Characteristics, Types of Computers- Analog.
Digitai. lll brid.
General Purpose. Special Purpose Computers. Micro, Mini, Mainfiame.
Super f'omputers. A Simple model of a computer. Data Storage: Introduction, Memorv Cell.
Ph1'sical Devices used as N,lemory Cells, Random access Memory. Read only' Memorr.
Secontlai'r' N4ernor.v. Floppy' Disk Drive, Compact Disk Read onl1,, Mernorv (CDRO\{ t.
Arcltival N4ernory. Central Processing Unit: Introdr-rction. The Structure ol a Central
Processins lJnit. Speciflcation of a CPU, Interconnection of CPU lvith Memon' ancl IrO
LInits. i: nbedrlecl Processors.
r
UNI I'-il
I)ata Pt'rrccssin-e lJsir-rg a Clomputer. Data representation and codes. Decirnal. Binary. Octal
atttl Ilcratiecintal svstenr ancl inter conversion. ASCII Cocies and BCD numbers.
Input Ilu ices: Kevbo:rrcl" N'lor-Lse. 'frackball, Jo1'stick. Scanners. OMR. BCR. OCR. N.{lCR.
Digital ('atr.iera. Voice Recognition, Light Pen, Touch Screen. Output I)evices: lntrocluction.
Prinlers. .'\Lrclio output. Monitors - Characteristics and types of monitors.
TINIT-III
Colntrlutcr Sol'hvare: Introduction" Operating Systems - Functions. 1'vpes. Progran-uning
I-rLtrqrttiucs. a classilication o1'l)rogramming Languages. Interpreters. Contpilers. Appiication
Soliuarc \\irtrci Plocessins. Spreadsheet, Presentation Graphics. and Database Management
Svstenr.
fINTI-IV
Computer Nehvorks: hTtrocluction. Local Area Netu,ork (LAN). Appiications of LAN. Wide
Nciu'olk (WAN). hrtenret. Nanting Computers Connected to Internet, The Future of
,,\r'cir
Ittl.:tttcl l cchnologr'. Sttmc Internet Applications: Introcluctior-r. Il-n-itril. Infbrmation
13rousirrg Serrice. l'he \L/orlcl Wide Web. lnforn-ration I{etrier,'al fl'oin the \\/orld Wicle Web.
Otltei' I-acilities Prol'ided b1 Brorvsers. Privacy. Secr,rrity ancl Integrity of lnfbrrnation.
UNiT'.\/
\\rltat is - Desktop, Cluster. Grid and Cloud computing, why cloud cornputing, Challenges
anri opportLLnities. Three basic services of Cloud Computing - SAAS, PAAS. IAAS. Concept
rrl'ilis i-)atiL. I)if}'erence bctn'cen Big I)ata and Small Data. 3V charac'teristics Volume.
Viu'iclr. \"clticitr'. Dill-elcnt t1'pes o1'Big Data - Structrtred. sen-ri structureci and unstructured
Eig Data. What is Hadoop?
#- l-l''- W
Prestige Institute of Management, Gwalior - BCA - Session 2019-22
Suggcstetl lleadings:
\Y WU Y.e
k
\p
1_:
Prertige Institute of )Ianagement. Grr alior - BCA - Session 2019-22
Course Objective
Tlie oir-je ctir e of this colu'se to proruide the basic knowledge of Internet, E-mail. Protocol and
search cngine. To introduce the basic concept of Electronic Commerce and its use fbr general
ITITISS.
Leaming Outcomes
1. To unclerstand basic concept of Internet and its services.
2. fti conrpare variotts tSP and its services.
l. lo cleate Fl-rr-rzril accortttt errtd perltrrr-rl clifferent operatiotls.
.+. 'l o Lrnclcrstancl clil-l'ererrt protocols use fbr lnternet.
5. 'Io unclerstancl hor.r,to u,ork on browser and perfonn searching on search engines.
(r. 'l'g icltntil'r,anc1 clescribe tmiclue features of e-commerce technology arlcl discuss their
bLrsi n.'ss sigitificance.
1. i lnderstancling the importance of seculity. privac-v and ethical issues related to E-
(lrrnulcrce.
(loursc {lontcnts
UNIl'-l
Iltlocluctign ol Internet & E- Commerce: Internet & Its services , H/S & S/W retlujrcrllellts to
conltect to the internet. L.rtroduction of WWW, Web Sen er and Web Client. Ditlbrence
betu,ccn the rveb and the intemet. Internet Service Provider (ISP),Web publishing concepts.
Donrain nanrc re-{istration- space on host servel' for rvebsite.
I NI-|-II
Chogsing an Internet service Provider: Stability. Customer service, Pertbrmance. Pricing,
[srablis]tin!. an Intemet accounl. E- Mail Basics: Runuittg an E - Mail prograrn. Sending
rlail. ileariing mail- Repll,ing to nraii. Deleting ntails, Nervsgror-tps, mailir-rg Lists. Clliatting.
T]NI't -III
Data Tlansnrission Protctcols. client/Server Architecture & its Characteristics. FTP & its
-l'clnet
Llsirge. Cioncept, Remote Logging, Protocols, Terminal Emulation. Message board,
i,r.rili:r - Voicr: r:l:itl. iext chat. Wireless r\pplicalions Protocols.
UNI]'-[\,'
An lltroclLrction to Interuet Explorer: Starting Internet Explorer, A quick tour u'ith Internet
L\;rlorcr'. At thc Helnt in internet explorer, viewing various file types. Internet search Engine:
Wirar is seat'ch En-eine" Hou,clo search Errgines work. Types of search Engines.
IINIT-\'
Ilr.iel'hisror'1 of e-conl. Elements of e- cotn. Types. h-rtermediaries. and E- colnmerce"
Aci.,,aptuqcs ancl Disach,antages of e-com, E-commerce practices Vs traditional br-lsiness
pracrices. F.-Business: E-Br-rsiness Vs E-Commerce, EDI- Who use EDl. Origin. Benefits.
Nligration to open EDl-Approach, E-cotn with WWW/luternet. ; . i'; .'ir':. 'i' r'
..,ir.:r,,.i1,,, r'
.. .. . . -. t.:' .r
..1_,
.. :. :. :,.,1.,
,..,... EleCIfOlllC Communication
Electror_ric LOmIIlLIIllLraLIUll
.t ''\.',\'\ P( & nersolkinc. nets'oLk topology and contt-t-tt-rnication media. E-nrqil-, OSI and
\j:@>fu w )r--
Prestige Institute of )Ianagement, Gx'alior - BCA - Session 2019-22
r(-P if' ;,-rrrticlS. L.\\. \\'.\N. MAN, internetworking - Bridges ancl gateways. what is
\\ \\ \\ . \\ eb \rchitectLire. The Web and E- com. Electronic payment System: overview,
Eiectrortic ol digital cash . Electrorric checks - Benefits , Oniine credit based system, Debit
carci slnart Cards. :r:.;'-l i . ',. ., . , ':,. r'rrr:]:ri,li.ir.:, :,.,.,::1.;r-., :r.,ri ,,i.::r
,.;,,.:
,r:, , , : l.t,t'..,,:,, ',.,. ,,1,
',,..,,',:li i.....r.,
Suggested Readings:
Ref'crencc Reading
l. The Intei'net Book- Douglas Comer, Prentice Hall Publisher.
2. Interncl fttr everyone- AIexis Leon and Mathews Leon, Tech World Publisher.
3. illectronic Commerce (u\ Manager's Guide) b), Ravi Kolkata & Andrew B. Whinston.
Aclcl i so r; - \.\iesl ey' Professional
g%-
\ L W YP
=P
+P
---
Pt'e>tige Institute of ^\Ianagement. Gu alior - BCA - Session 20lg-22
Leanring Outcomes
After thc cornpletion of this course, the students will develop their ability to design. cler.,elop,
test anci clocuntent structurec'l programs in C language.
Coursc Contents
UNI'I'I
Pt'ogratrttrtittg l'undamentals: program concept, algorithms. f-low cllarls - symbols. rules fbr
rnaliirtg {'lolt' chart, types o1' flowchart. advantage & disadvantage, techniques of pr-oblem
soh'illg: progt'auming techniques - top down, bottom up. modular, structured - features.
tlet'its & clelrerits, pl:o-qramming logic- simple. branching. looping. Testing & clebugging &
tltcir Lrrols.
T]NIT Ii
Progl'aLlttting in c including f'eatures of 'c', c tokens, variables, identifiers. kernorcis- data
typcs. cottstants, operator and expression, operators: arithmetic, logical. relational,
corlclitiortal zrnd hit w-ise operators. precedence and associativity of operators. t,vpe con-u,ersion
itl erpt'cssion. basic input/output and library functions single character inputioutput i.e.
getch( ). gctchar|. Getchefi. pr-rtchar$,fbrmatted input output i.e. printfQ a1cl scanf0.
UNIl'IIX
Brartcitirtg constrttcts: Il statement. i1-.....else statement, nesting of if....eise statement. else if
ladcler" the 'l: operator. su,itch statement. compound staternent, loop controls: for" while, do-
\\'hiic lo()l)s. break. coutintre- goto slatement, array.s:what is array, c'leclaring initializing 1d.
2cl antl lti arrar. String: cleclaration. string functions
- strcat. strcpy. strcmp, strlen. strstr.
UNI'f I\/
Futictiitiis: catesories of functions Llser deflned and iibrary fr-rnction. recursion. function
arstrrllei)ts. retlrril values and nesting of function, calling of firnctions, scope ancl life of
variables - local and global rrariable, storage classes - auto, extern, static. pointers: operations
ot-t llointcrs. operators fbr pointers, pointers and function. array of pointers, pointer ancl
s1r'ings.
UNIT \'
Pt'eptoccssot' clirectives: #cleflne. detining functions like macros. include. conditional
conlpliiltititt dircctives. Structures: the concept of structure. initializing a structure, the
stl't-tctLli'c tag- dot operator. :irray of structure" structure and pointer" arro\,. operator and
tlcsiirtu o1' strttctut'e. Linions: initialization and use of it in a program. Commancl line
futu
lllg Ll lll C 1l i r)
Suggested lLeadings:
Prestige Institute of ]Ianagement, Gx'alior
- BCA - Session 20lg-22
\lrrin f crt Books
I i-:r u. C L.r \-ashuant Kanitkar. BpB publicatiuon
l. L i)r',rSmn.rntinc br Schaun-r's series
-1. Pr,.)!r.rlrnrinc in.{NSI C b1'BalgurLrslramv, Tata McGrau, Hill
Ref'erencr Ilooli.s
1. -f he spnt ol-Ci b.r Mulish Cooper, Jaico publ.
Y*
9:
\,# W O
&_@
j\-
! //-
\
l\----
Prestige Institute of \Ianagement, Gt alior - BC,{ - Session 2019-22
Le:rrling Outcomes
1. l lpon conrpletion of this coLlrse, the student will be able apply technical knowledge and
l.e rtirrn.t specific techrlical skills-
inch-iding:
applications
2. Solr e contmon bursitless ;rroblems using appropriate Information Technology
atlcl s)'stetlls.
3. Ic-lentitj,cltegories of proglams, system software and applications. Organize and worh
with f iles and folders.
4. Niivigate in r,vorcl processors and use menus and commands, 'hands-on' knowledge of
l\,lS-Excel. N4S-Power point, MS-Access etc.
5. Sttrclcr-rts cal become prgf-rcieut in creating documents and presentations with Otl-ice.
Course Contcnts
UNI'I-- I
MS \\/indolvs: [ntroduction to MS Windows, fbatures of Windows, various versions of
Winckxvs & its use. working u,ith Windows: My computer & Recycle Bin, Desktop, Icons
and \\,inrlorvs Erplorer. Screen Description & working styles of Windon's- Dialog Boxes &
To.lbar:;- r,r,orliing with Irilcs & Folders. Shortcr-rts & Aurtostarts. Accessories and Windor'vs
settllgs Lrsilg Ctintrol Panel. Start Button & Program Lists, Installing uer'r' Hardrvare &
So 11r.i'arc.
UNIT _ II
Basics of Worcl: creating Word documents, The Word w-indow, enteling text. editillg
l)oc1rptclt text: text. cop.ving and moving text. Applying text enhancemerlts: applf irlg Fot-its
'fext tbr clistinctive look. Aligning and Formatting:
ancl lir.rnr st1,lcs in Worc'I. highlighting
alignirg l'rrxt. Lrsing Inclcntation options. setting Line Spacing optior-rs. trsing Tabs. Cl'eating
List." Nriprbers and Sl,mbols: Numbering and Bullets. creating Special Characters.
Replacing ancl checking 1'ext: creating and applying fi'equently used Text, tjnding and
'l'ext. more about Spelling and Grammar, using the Thesaurus command. Getting
repLacing
ini,r lrrint: Lrsing Print Previeu,. changing Page Orientation and Paper Size. aligning Text
vcrtic:ailr'. selting Margins. Printing options.
UNI'i-- III
AC6ESS Concepts & Terrns: Database Tables, Relational Databases. Records, l'ields,
Clolrr-els & Ob.;ects. Qr-reries & Dynasets, Foluts. Reports. Properties. Wizards- Macros.
.\cccss l{cqr.rire6elts. Starting & Quitting Access, The Access Workspace & Too1. Views,
( r.iurilu I):rtabase & Tablcs ri'ith & u'ithor-rt Wizard. Field Name, Data T,vp:: & Properties' /
-,\.r. .- l. -r:,crinc Fitl.l:. Rcnanrinq Fields & their Ciaption. Resizing Fielcls" Fieczing W
:-'- 'U-// ",' Y \,;-2
Prestige lnstitute of )lanagement, Gn'alior - BCA - Session 2019-22
L..-.,r'.,-:. iriiirarr Ker Ficlcl & lndexing Fields. Form: Fom-r Wizard, Saving
& Modifying
F,,r.r-,-. j::Ierin,,& i-ciiting Data. Finding. Sorting & Displa-ving
Data. Queries & Dynasets'
L rc.r,i[: .t LL:inu Select Qireries. using Wild Cards in Queries'
Reformatting Dynasets'
[{t,ports: ('reating Repc',its. Previewing Reports, Printing Reports, Modifying' Saving'
Relationirl l):rtabases - Deflnition. fuipose, Creation, Viewing, Deleting'
E'xpressions,
\ lact'os.
UNIT - I\-
cre:rting Ilxcel worhsheets :Entering and Editing cell Entries.
The excel Application
Winclou. \\iorliboohs arncl Worksheets. Moving the Cell Pointer, Entering
Text and
Creating Formulas' Data
Nnlt$cr.s" Rer,isilg Text ancl Nr.tmbers. Working with Ngmbers:
Copying Cell
Valiclirti.rs. Forn-ratting nnnrbers. C'hanging Worksl-reet Layout: Moving and
(lontenrs" Naming a \\,''ol'ksheets. Selecting Worksheets, Cop-ving and Moving
\\'orl<shects" lnserting ancl Deleting Worksheets- Other Irormatting
Options: Conditional
Previeu'. Changing
Fonrratling. Aligning Text. Border and color. Printing in Excel: Print
Pagc Setup. Clhecking Worksheet Speiiing'
Ra,ges. ttsing Names. Pil'ot table, Creating Easl'-to-Understand Charts: Pie Charts ' Series
charts . clreating charts . Moving. Sizing. and Printing chart ob.iects '
Editing anci
[iNI'r - \'
Crcating po11,erpoint Prcsentations: Creating a Basic Presentation. Buildirlg
Presetltations'
\,lo,Jrt'r irrg Visr-rzrl E,lements . Formarting and Checking Text. Adding
Ob.iects. Applying
slides
Trarrsiti()its. Aninration [rf]'ects and Linking. Preparing handouts. Connecting
tl-rroLrglt hYper-link ancl actiou button, Taking the Show' on
the Road.
Suggested Readings:
Learning Outcomes
1. Unde'rstand the concept of the Partial derivative of a function and its applications
2. Understand to apply Beta and Gamma function to simplify integration
3. Understand and apply integration to calculate the area, rectification and volume of
different types of curve
4. Understand the concept of convergence of improper integrals
Course Contents
UNIT*I
Partial differentiation: Function of several variables, Limits, continuity and
difl'erentiability, Partial derivatives. Euler's Theorem, Mean value theorem & Taylor's
theorem for functions of two variables.
UNIT-II
Envelopes, Evoiutes, Maxima, Minima and saddle points of functions of two variables,
Lagrange's multiplier method
UNIT-III
Gamma and Beta functions and their properties, some imporlant deductions (duplication
formula)
UNIT-I V
Multiple integrals: Integration of functions of two & three variables, Double & triple
integrals, Change of order of Integration, Use of double and triple integrals in finding areas
and volumes.
U N IT-V
Improper Integrals: Convergence of improper integrals, Evaluation of convergent improper
inte-ur:als.
Suggested Readings:
Reference Books
1. Calculus with Early Transcendental Functions by James Stewart, Cengage Learning, 7th
ecl.
2. Calculus - Single and Multivariable by Hughes - Hallett, John-Wiley and Sons, 6th ed.
3. Calculus-Single variable by Robert T. Smith & Roland B. Minton, McGraw-Hill, 2nd
ed.
4. Caiculus- Volume 1 One-variable Calculus, with an Introduction to Linear Algebra by
==
pre.srige [nstitute
of ]Ianagernent, Gw alior _
Ea.-
Et
E'1
BCA _ Session 2019_22
r.
E-
i:
t I
PAPER CODE BCA - 202
Computer organization
F ---
Ff
Course objectir-e
The -coal .f this subject
to expiain the.theory und .o:::qt of computer
E. <--
ili lil;:;
or-eanization. rhe
E-t
E*
;X l. ;,:i I*T:!:;':,X ::* :**ti:f*1, o, *,,o, ci rc ui, &,heii r,,.,i on ur i ii.j,
E=-l
E-
E\
Learning Outcomes
:. I:I.:::",y
of Bootean Larv & their functionarity.
E\
E. \
3'
4'
L.ear to clesign and a,alyze
Str-rclent cie'elop knor'vledge
a logic circuit and build
using logic gates & universal
rol a"rglr"g r"gi. circuit: Gate.
E\
E\ s
canonicar algebraic equations,
minterms
;HIlll;:;#J:;;::,3:;,Til;;;"ffi;;,J.,nn
"
Boorean argebra anct rogic-fur"iir::;ot?;;proau.ts; J..-,rl ;i;, Karnau_eh map.
and poS (producr or sums).
and maxterms. Design
concept map.
E\
F\
6'
7 '
iJJl:::,tiH:l:",r.j.*" r*
Design rr-rip-Frop by using
u'itrr*.tic
i,p,t,".i"u,es
operation, Murtiplexer
&
Encoder for binarr.to
b1, mea,rs o,
UNIl'-I
F-
Ea
Ef
:?:Iiiili'ffi,'* Tffill,TiH'"; Tr"ft"flll,' ."q,. Gates: ANrr o*,Nor GA'ES and
LAr^,'s' L)emorgan's theorem, g""dr";r-uro
,rr."..ms,
Basic g""r.;,
Duality theorern,
'=
Fa
F-f
UNTT-II
H_
-, Dc-nr rril,rexer- BcD ro Decinrar
Decoder.::*'ruffJj,!fitl ?l:J;?:"
k-:'
F-r
Murtiprexer.
ru U]\IT-III
I Ilrsirrrc.i IJilrar.r Nunrher.s.
c'otrrpiirtrc,t, l's compliment.
Arithmetic
Addition, Subrractioj'a#;*ltude
ArithmeticCilctrit:uurraaa",,i,riiaa.,,suu-i*.Io.-ii1.uit,,,.:''::.-.:''..:,':.
Numbers, I's
il
.-,
il
H.-
E':-= -a
UNIT-IV
F-
E_:
UNI'r-\/
Serliconcluctor Memories:
Memor.y Addressing.
F.-
E,
DRAlvtS. SRAMS. Memory
C"ii;.' :,, , :, PROMS, EPROMS. RAMS.
( ottr cr'lur.. .AtoDandDtoA
F_-
F_- t\4a,'q:?
+: -p
Prestige Institute of Management, Gwalior * BCA - Session 2019-22
Suggcslctl Rcadings:
-f
M:rin crf Boohs
1. Digital Principles and applications - Malvino A.P. & Leech, TMH
2. Digital Llircuit and Design - S. Salivahanan & S. Arivazhagan.Vikas Publishing.
Rel'erence Books
1. Digitai Con'rputer Organization - Morris Mano , Pearson Publ.
t+,.)lZ '{b-:
\"rt ,/t/\'/'^
?l<riu "//
\Y L%
Prestige lnstitute of }lanagement, Grvalior - BCA - Session 2019-22
Le:rrning Outcomes
1. Srudents u,ili enhance their awareness of correct usage of English grammar in writing and
spealiiiig.
2. l,nclcrstancl atlci t-tsc r.1.I'illlllllar terminology .
i. ( onrltosc short narratir,e ;raragraphs to describe daily activities
1. Use linglish Lan-quzrge efl'ectivel1".
Coursc Contents
UNIl'-l
Seltelcc- its liincls. sgb.ject and preclicate. Parts o1'Speech- Noutt, Pronoun. Adiective. Verb
:rncl ,\clve t'ir in c'letail.
TINTT-II
Telses- Present. Past ancl Future (Indefinite, Continuous, Perfect & Perf-ect Continuous)
Conclitional Seltences, Secluence of Tenses, Agreement of the verb with the subject, Active
and Passive Voices. Direct and Indirect Narration.
t UNI1'-lI i
l.tses oi'lrllnitive, participles and Gerund. Articles. Punctuation and Preposition-
byiltling- lbrn-iing Nouns t}om Verbs/ Adjectives and vice versa, Prefixes and SLrftlxes.
Detcrrnilers one u,orcl sr,rbstitutions. Prepositional phrases, Anton.vrls. Synonyms,
Hon-ton1'uts.
trNI-J-t\1
l-he Str.Lrcture o1' Sentences- Clauses (subordinate
\\'orcl-
UNIT-\i
Translarion- liom Hindi to Engtish & Vice Versa. Writing a paragraph in about 100- 150
rvorcis on current National/International Events. Renowned Political Leaders, Sports
per.sonalities. Social workers. Thinkers. Scientists, Nobel Prize Winners etc.
Suggestctl Readings:
Rcf'ercnce Boohs
i. l'r'actical English Usage b,v Michael Swan. OUP. ELBS
-G.r-rro.
7. LIigS Schoollrnglish Composition by Wren & amp; Martin. Revised by N.D'V
I)r'asacla Rao. S.Chand & Co.
3" i-i.'iitg 1:nglish strltcture b;'' W.S' #6"
g
\"51-
Prestige Institute of \Ianagement, Gu alior - BCA - Session 2019-22
Learning C)utcomes
1. Irrplain rvhat constitutes an obiect-oriented approach to programming and identifl,'
polential benef-its of Ob.iect-oriented plogramming ovel other approaches.
2. Anal1,7s nnci decompose problem specifications fiom Obiect Oriented Perspectil'es
3. Aficr cornpletion of this coLrrse student willbe able to develop console application using
ob.iect oriented approach.
Course Contents
UNt',t--i
Introcir-rction. OOP langua-ues" characteristics ol OOP's languages, application of OOP's.
OOl'}'s pariicligm" concepts. ber-rellts of OOP's, disadvar"rtage of OOP's. Appiication of
OOP"s.. C.lasses & Obiects: Specifying a Class, Creating Obiects, Accessing Class merlbers.
Detinin-u menrber function, Outside Member Functions as inline, Accessing Member
Functions rvithin the class, Static data member, Access Specifiers: Private, Protected and
Pr-rblic N4crlibers. Passing ob.iects to function. Returning objects. Obiect assi-enment. l-his
po inlcr'.
UNI'T-I I
CoustrLrctor &
Destructor: Introduction, Constructor, Parameterized constructor, Multiple
constructor ir-r a class. Constructor with default argument, Copy constructor'. Default
Argument. [)estructor.
Arrar. Pointers. and ref'erences: Array of obiects. Pointers to ob.ject. . Pointer to class
nrenrbcrs. Rc[ercnces: Rclerence pararneter. Passing ref-erences to objects, Returning
relclencc. Inclependent ref-erence, 'l'he Dynamic Allocation operators. Ir-ritializing allocated
rlremor\ . Allocating Arra1. Allocating objects.
T]NI1'-III
Function & operator overloacling : Function overloading. Overloading constructor function
fincling tire ;rddress of an overloaded function, Operator Overloading: Creating a member
opcrator lirr"iction. Creating Prefix & Postfix fbrms of the increment & decrement operation,
Ovcrloacling the shorthancl operation (i.e. +:.-: etc). Operator overloading reslrictions.
Operator or,'crlotrding using 1r'iend function, Overloading Neu, & Delete, Overloading sonle
spccial opcrators. Overloacling [ ], ( ), -, comma operator, Overloading << and >> .
TINIT-I V
Inhcritance: Base class Access control. Inheritance & protected rnembers. Protected base
clerss inhelitance. Inheritin-g multiple base classes, Constructors. destructors & Inheritance.
\\,'iren constructor & destrr-rctor function are executed, Passing parameters to base class
constrlrctors. Ciranting access. Virtual base cl4sses .
\v/"\
VirtLrai liinctions & Po11,'nrorpliism: Vr:gzf/function. Pure Virtual
binJiirg .\ ,
Y
{""r, W }"-- 9'b-9
Prestige Institute of \Ianagement, Gn alior - BCA - Session 2019-22
L \IT-\
The C- - I O s1'stem basics: C++ streams, The basic stleam classes: Q++ predefined streams,
Folnratted LiO: Folmatting using the ios members, Using manipulators to format IlO,
Creatin-s )-or-ll o\\'n manipulators, -File Management: Introduction - File handling, File
structure. File handling function, File types, Streams, Text, Binary, File system basics, The
file pointer. Opening a file, Closing a file, Reading and Writing File.
Suggested Readings:
Ref'erence Books
1. C++ The complete reference by Herberl Schildt, TMH Publication.
2. The C++ Programming Language: S,pecial Edition by Bjarne Stroustrup, Addison-Wesley
\4ji fu >tu"'yw
(,Y
%
t Prcstige Institute of \Ianagement, Gn alior - BCA -
Tt'aching Ob.iectir e
litis of database architecture, database management systems, and
cpr-r;sc co\.c1's funclar-nentals
database- s\ stelrs. Priuciples and methodologies of database design, and techniques for
clatabase aplt I i catiott development.
Learning 0utcomes
Llltop con.ipletion of this coLrrse, participants will have gained knowledge of database system
concepts ancl the abilit,v to
1 . Llnclerstancl ltser requirements/views
I-.
fl
4. Devclop and refine the conceptual data model, including all entities, relationships,
L Coursc Contents
t trNI-i'-l
Databasc S-r,stems: lntrociucing the clatabase and DBMS, Files and File S.vstems. Problems
u,ith lriic S),stem and aclvantages of Database Management systems. Database Admir-ristrator
apcl his resltonsibilities. Pl'rysical and Logical data independence. fhree level Architecttu'e of
Databasc S),'stem: the extelnal level. conceptual level and the internal level.
il UNIT-II
Thc llelirrional Database Model: A logical view of Data, I(e-vs. lntegrity Rules. Relational Set
Opcratgrs"
'['he Data Dictionar,v and the system catalog" Relationships within the Relational
Dltabasc. Data Reclundanc.v revisited, Indexes. Codd's relational database rules. Entitl'
Relationship Model: fhe ER Model. Developing ER Diagram.
UNTT-I I I
Nonlalizatiot'r database tables: Database Tables and Norn'ralization. The need tbr
of
il
Nor.nraliz-ation. The Nornral tbrms and High level Normal Fot'ms. de-normalizatiou.
t]NI't'-IV
Il-elatiolal Algebra. Diftbler-rt types o1'Joins. Relational Query Language - Introdtlction to
SQt-: Data Deflnition Clomrnancls, Data Manipulation Commands, Select queries. Aclvanced
Selcct clueries. Vir"tual'fables. Joir-ring Database Tables.
LrN t't'-\'
Transactiitn N4anagement ancl Concurrency Control: What is transaction. Conrmitted and
Lurconrlritteci transactions. Plotection against crashes Backup, .Iournal. Audit trail.
Copcul.encv control. LLtegrity violation Concurreucy control with locking Methods,
Colcurrcpcl, control with time stamping methods. concurrency control with optimistic
methods. clatabase recoverv management.
Suggestctl Re:rdings:
Reference Books
1. An introcluction to Data Base Systems, C.J. Date, Narosa Publications, Sth edition
2. Database Principles, Programming and Performance, O'neil Patric and O'neil Elizabeth,
Nlargon Kar-rfilann Publishers Inc., 2nd ed.
3. Fundanrentals of Database Systems, pmasri Ramez and Navathe Shamkant B., Addison-
\,\ e:1c1. 6rh edition. /
'l ,/ ,/
N/ ? *,e.IY 61, V?"2 g?--*
/-/
(y Lfu
l\---
PAPER CODE BCA - 3OI
Discrete Mathematics
Teaching Objective
To understand the rore of 'Discrete Mathematicar
strucfures, in scientific computing and
Iogic development through practicar exercises
aspiring io u" successful in the world of
Computer Science.
Learning Outcomes
l' r\ble to iclentifi' propositio,s ancr no,-propositiors. construct the truth
table olaltr
co,-tl.roLlncl propositio, and use logicallv
^ Able to explain concept of equivalent ,trt.,r.,.,tr.
? set anJits operations.
l. I . expl.i, the differerrce between reration and functio, and thei
4. Able to clef ine Boorea, ar,eebras. expressions ancl functions; giver d ifferent t),pes.
algebraic representations
o l'tlre lirnction ing of logic gates
5 co'sr'ucr and s irnpr if)' the B_oor ean expressio, r.eprese,tin
g ci rcLr its.
6 l'o iciortif_r,diffbrent rva1,s of representing
a graph, path. c1,"cles. complernent
ola graph.
tlees altd its tvpes
1. []ndcrstand meaning anrl type of Matrix,
operations on rnatrix, rank ancl advance fbrrn
rl
atli x of
8. l.ealn ancl develop to solve svstem of linear
equations Lrsins rank.
flourse (lontcnts
UNIl'-I
lljil];;'t,]7.:
Clontradi*ion. ff,l,""T:"li11ll,i:i::: rruth tabres, rautologi and
t.ogical sLlulvalence,
r-\/rrLre'ivruLI\/tr' t'r'E;rLdr
AlgJra
equivalence, Algebra
^,r:ql"u,ol
of^connectives,
propositions.
propositi Set Theory: Set. Si,gleton set,
Firlite arrcl [,llrlite sets. Sr-rbsets, Prop"er subseti,
ality of sets, Union. Intersection
iiquarity Intersecrior.r and
se1 Morgan r,*':by-;;;;i.;ir.d;.J#",L.'[:',,'."."J,',::.,
Viorqln la',rs. ):::r:llil:,:11 fe De
"',ii:::l'::.':l Clartesizrn pr.ocluct of sets.
UNIT-II
Relations: Relation betr,r,een two sets, Bi
Equivare,ice rstaLlL'rl,
LYurv4rvrrt/s ;ffi;ilI""",'jji; ,'"11iil,.:rn:,
rerarion, Dqulvalence class, Partition of a set,T,,L,j*:#,*::"1j,::t.::liii:-11
Fundament*f th"oaam of equivalence
relation' composition of relations. Functions:
Function mapping, ona-^^a
nctron or rrannirio r\,4^^., .-.^., t-
One_one, Man_v_one. r,
into
anci o.nto nttil-r1tinus. Iclentitl, ntapping.
Constant nrappiing. Equality, of mappings.
nritpping. ( urnposition of rrappirrgs Inverse of a
uNn -il1
l'j',jiflil,.:,::t":::,::fl,l.ll:l :,id qi",p:,ties or Boorean argebra, a brier introduction ro the
ttl sirttrtlc rrrrr. [)iqi,,.nri,a -,"J r]^.^:...^ -..:
;,;i ffi ,;i:;i. J'ffi :il:T. Ji
i,x
graph
;iil;;,'J, ; JJ,';'#;'::? ::,3]
tiNt'l'-l \
Nlat.ic.s: lntr.clLrction. Expression of complex numbers
in the fbm of a matrix, De Vloivre,s
Equivalent matrices. properties of
1v*n
M,,,-
&"
F erlLli\1lcnL ntiirrices. SLrb-rratrir of a r-natrir. Rank and
cantrnical tbrnr. \orttial lbt'rr ola matrix.
UNIT-\'
Nullitl ola rnatrix. Ro* equivalence and
tt
non-s i n gu ar n'iatrix using Caley-Ham i lton theorern.
I
Suggestetl Readings
ilt PI II
4. Discrete Mathematics by.1.K. Sharma, Macrnillan Publishers
t
Rel'erence Books
l. L-.lements olDiscrete M:rthematics, C.L. Liu, McGraw-Hill Education
2. Di scrcte Nlathenratics. Ricl-rard Johnsonbaugh, Pearson Education.
3. Discrete Mathematical Structures, Kolman, Busby and Ross. Prentice-Hall India.
€
,4 k4%
+.,
tu
a
)_-
\,
,L
\^- Y (#ry
W
E(.
ilt
h--
H
F-.
F
P.\PER CODE BC \ - 3I}:
Visual Basic.\et
F
Course Ob jectir e
I-hi: e ,.Lil.: i. .ie signed ttr tlnr iliarize stLrdents ri ith the s\ lrta\ of VB.\ El'. desi-sn of x indou,s
lllrlrii..,,irrlr:. li,ttttcetir itr ri ith clatabases and design of * eb applications.
ttu
E{,
F-
Learning Outcomes
A1'ter conrpletion of this colrrse student u'ilI be able to develop desktop application using event
driven prourarrurirrg ancl ob.iect oriented approach.
Course (bntents
UNIT-I
to VB.NET, Event Driven Programming, NET as better" Programming Platform
Irrtroclrrctiun
EI\ N E]' I:r'anrer,r,ork, NET Architecture, CLR, The Just-ln-Tin-re Compiler, Garbage
E\
l=*
UNIT-IT
E\
r-[
Thc VL].NLT Language- Variables -Declaring variables, Data Type of Variables.Arrays.
R' Hartdlitrs attd I.lsing Interfaces. Coltrol f-lou, statements: conditional statemeltt, loop statenlent.
+- t.fNI't'-t II
VB.NFT IarruLrage Controls: Text Boxcs. Br"rttons. Labels. Checl< Boxes. and Radio Buttons.
#.
ilE\
List Borcs, ('orrbo Boxes. Picture Boxes, Scrollbars, Splitters. Timer, Menus, Built-in Dialogs
Inrage List..['ree Vieu,s. List Viervs, Toolbars, Status Bar and Progress bars, OpenFileDilo-e,
SaveFilel)ialog. Fort Dialog, Message box & Input box, Function creation.
IJNIT_ IY
Eq L-nclerst:rncling Delegates. Class L,ibrary'Overvierv. Creating a Class Library'. Worl<ing ri,ith the
C'lass Librarr, [Jnclerstanding BLrilt-ln Classes. Creating User-Defined Classes. Understandirrg
H\ ConstrLrclols zrncl Instance Valiables.. lntroduction to Error Types: Understanding Syntax E,rrors.
tu
E\
E*J
Llncielstartdins RLrntirne Errors and LIsing Exception Handling, Understanding Logical E,rrors
and Lising Breal< Points.
tE\
elJ
trNIl'-\/
Datatrasc hanciling Lrsing AI)O.NE'l': Introduction to ADO.NET. architectLrre of ADO.NET.
acccssing ancl nralripLrlating data using data providers ancl data sets. Con-rponents in data
proriclers: Lbnnections. Data adapters. Data Reader. Command, Data bindirr-g rvith controls Iike
E\
l!-J
I'ert []ores. List Boxes. Data grid etc. Navigating data source Data Grid Vierv, Data validation.
tH Suggestetl reaclings:
il
il
ft= L
:D
l. \lasterirrs VB. NET hr Erarrgelos Pctroutsos. BPB p9!lications
l. Iirtrorlrrctiolr tcr .NET. \\ rr|r publication
**U
{w*
,/
j\"
l;-'-
)
/
P \PER CODE BC \ - JI13
Introduction to Operating Sr stenr
Coursr Objr.ctir e
1 . Tir le lii'n the lirrrdan-ientals ol operatine s\ sterrrs
L Tir taitt kitorrledge on the basics of rnstruction e\ecLltion. processor re,qisters and how
a0Illl-1rlIlL-ltlS Ol S-\ Stent e rrntntLln Cate $ itli eaCh Other
L Io leat tr lite cotrcept o1'plocess anci hou OS manages processes ancl mernory
-1. -l o saill lirtori ledge about the urechanisms of OS tbr synchronizir,g processes and
rinderstanding various problents ol svnghronization
-l'o
-5. lc:rt'tr the concept of deadlocl<s and various algorithms fbr handling deadlocks
6. Ttl utrclerstaltd various n-lerrory mana,qenlent techniques implemented by OS
Learrring Outcomes
l. Altalvze the structltre of computer systenr and basic architectural components involvecl in
OS clcsign
2. Llnclerstancl the concept olprocess and various states in its life cycle
3 Attall'7s CPU scheduling algorithms and solve numericalproblems related to same
4. [:xplore the concepts of process synchronization and inter process communicatiolr
5. Urrclelstancl deadlocl<s zrnd techniques olhandling deadlocks
6. Expiore variotts algorithrns fbr memory allocation and memory management techniques
uNrl -l
CornpLtter Systetn Overvierv. Basic Corrponents of Computer Systern, Operating System
Set'r'iccs. l:ttnctions of Operating Svstem. Types of Operating Systems. Instruction E,xecution
C]),g1.. Interrupts &. Systern Calls, Interrupt processilrg. processor Register.s, llO
(lonr nru lt i ciition teclrniq Lres
T]NIT-II
Process Management: Concept of Process, Creation & Termination of Process. process
,'\ttribLrtes Process Control Block, Process State Models- Trvo State. Five State. ancl Seven
State. Cll.'t,l Scheduling: Scheduling Criteria, Schedr-rling Algorithms. Multiple processor
SchedLrl ing" Real-Tirne Scheduling.
UNIT-TII
Process Synchronization: The Critical Section Problem, Peterson's Solution, Semaphores,
cl lass cal Prob ems of Syn ghpsn ization, Monitors, Atorn ic Transactions.
i I
tiNIl'-lY
Dcadloclis: Sy'stem Model. Deadlocl< Characterization, Methods fbr Handling Deadlocl<s:
Deadlocli Preventiort. Dcacllock Avoidance. Deadlock Detection, Recovery from Deadlock.
Cunririneri apltroach to Deacllock.
\. >4"9y g-%-
L \ ^1"-
{ 1V--
[ \11'-\
\le.nrorr \lirn:rgement Strategies: N4emory Hierarchl'. Cache Memory' Sivapping' Loading
arcl Lipl,ipg. lrifbrrnation Protection. Memorv Allocation Techniques: Fixed partitioning,
clrnanric pnr.tirioning, Paging. Segrnentation, Segtnentatiotr lvith Paging, Virtual Memory,
Denrancl iraging. Perforrnance of Dernand Paging, Page Replacement, Page Replacement
Algorithrrs
Suggcstetl Readings:
Relerence Books:
l. Oper-ating Sl,stems Design ancl Implementation- Andreu' S. Tanenbaum. PHI Learning Pvt.
Ltcl.
2. 'flte t)esign of Unix Operating System- Maurice.l. Bach. Prentice Hall Publicatiorls.
3. L)per.atilg Systems: Three Easy Pieces- Remzi H. Arpaci-Dusseaum, Arpaci, Dusseau Books
.D
+_ !r v \#L' fu'x"'2W
l\-a
PAPER CODE BCA - 304
Communication Techniques
Course Objective
The course is designed to enable students to enhance ability to comprehension of spoken and
written English (and use English) required for effective communication in their professional
work.
Learning 0utcomes
I. Enhanccntent of EnLrlislt Conrrnunication Skills
2. i,i'l'ecLire oral presentation ri,ith the use olexterrral aids lihe OHP. slides, etc
3. l-earn to u,rite technical clocuments lihe reports. proposals.etc.
Course Contents
TJNIl'-I
Rclieri o1' Englislr Gramr-nar: Written anc] Spol<en Language; Common Errors in larrguage;
ion (pLrlpose. role. intportance
Punctrrlrt and use): OEDI Language Skills(t.istening. Speal<ing.
Rcailing. \\ r'iting).
UNIl'-II
Meatring u'hat vot-t rrleanr Listening: Effective and efficient listening in various sitr,rations
(discLrssitlts. lectures, news, seminars, speech, telephone calls etc.); Reading: PLrrpose;
CotrtPt'ehettsion: T:rctics arrcl strategies fbr good readirrg; Writing: Cuidelines fbr good rvriting;
t'arioLts l'ritinq stvles (Ciencral and Techrrical writing styles). COMMUNICATION SKiLl.S:
L.isterrins-DcllnitiorT. Process of Iistenirrg. Strategies fbr eftective listenine. Difl'erence berueen
Listoring anci I Ieiiring.
UNIT'-III
(loN'lNIl INICIA'I'ION (PLiRPOSE. ROLE. IMPORTANCE. ELEMENTS); EFFECTIVE AND
EFirlt'll-N-l C'OMMUNICATION; ROLE OF CONTENT. CONT'EXT AND LANGUACE:
SPOI(EN AND WRITTEN C]OMMLJNICATION: PRESENTATION AND DEI-IVERY: ROLE
OI'Si)L..AKEt{ AND AUDIENCE; S'|YLE AND BODY LANGUAGE.
Colturttnication- Deflnition. E,Iements" Process, Importance, Principle of Comrnunication,
Speeclr" Verbal and Non Verbal Comrnunication.
UNIl'.IV
Plaltrtirrs" orgirnization, presentation, participation, conduction and f'eedback of discLrssions.
meetillgs. setlinars etc; Efl-ective and efl-icient presentatiorr and discussion sl<ills; DiscLrssion and
Preserrtation sl<ills of conf-erences. meetings, seminars etc.
T NIT'-\
(ieneral attcl Jechrrical docLrmelrts(correspondence (applications, Ietters, resLrr-ues, CV). clrafts,
Pt'oPoslls" precis, reports. slnr'rmary, synopsis.),Use of Audio-Visual Aids: OHP, Stides. Charts,
Computers.
wgw-
L\JY $rt V
REFERENCE:
1". WREN &amP; MARTIN - GRAMMAR
7. BOOKS PRESCRIBED BY M.P. UCHAHA SHIKSHA ANUDAN AYOG ARE THE TEXT BOOKS
Xr*
w tu
w
\O
D
Z\€
(L
l)<--
P.\PER CODE BC.{ - 305
Contputer GraPhics & llultimedia
Course Ob.iectir e
The -goal otrthis colrse is to introduce the theor,v and practice o1'computer graphics. The course
rvill issirpic a ggocl bacl<groLrncl in progran-rrning in C or C++ arrd a backgroutld in mathematics
i,clLrcling tirniiiiarity rvitli the theory, ancl use of coordinate geometry and of linear algebra sr-rch
as rratrix rnLrlti pl icatiorr.
To urclcrstald the prirrciples of computer graphics requires not only study of the literature. but
experirreptal r,vorl< on a graphics system. Therefbre, as part of this course, the students will
clesig,-, and ipplerr-rerrt a subsiantial computer graphics program and
will generate some complex
iIlustrations vvith this sYstem.
Learnittg Outcomcs
l. []nclcirstarrcling the difltrent displal' device and their techtliqr're and use.
2. IJasic clescliptittn ot-various inpLrt device and their use'
3. 'l-o rrpclerstand the algoritftrn for diffbrent geometry object & develop the program using
Cl,'Cl++.
4. '[-o use the geometric transfbrmation & their category and solve through the exarnple.
5. -l'o Lrse ol'multimedia ob.ject and r-rnderstand the architecture of multimedia'
Course Clnntents
UNI'f.I
Basics of Graphics System. Applications, Display Devices: Video Displays.
- Rurt.r-S.urr Displays. Random Scan Displays. DVST. Flat-Panel Displays.
I,lrLrt De'ice-s: Ke1,[snrcls. Nlouse. Trach Ball ancl Space Ball. .loysticks. Digitizers. Image
Scanner'. l-oLtch Parrel. Light Pens, Voice S1'sterns E'tc'
UNI'I"II
[-ine clrau'iug algorithms: DDA Algorithm, ' Bresenham's
lipe Aigoritltpr. Bresenlram's Circle drau,ing algorithrn. Mid-Point Circle Algorithm.
Scan-lipe Poll,gon Iiill Atgorithm, lnside-OLrtside test, Bourrdary Filt algorithm,
Flood-l: ill algorithm. Pixel. Pixel addressing, Antialiasing.
TrNI.T-Ii I
Clippipu: I,oipt CIipping. Cohen-sutherland Line Clipping Algorithm, Line Clipping Ljsing Non
Rectanjirlar Clip Windows. Polygon Clipping, Text Ctipping.
TINIT.IV
fu,o-rlinrcnsional geornetric transfbrmation: Translation, Rotation, Scalillg, Reflection. Shear,
\latri.r represeptation and Homogeneous coordinates. Composite transformation: Translations.
Rr,trrlior)r. Scrrlitt-p. Gcltet'rtl Pir ot-Point Rotatiorr an;f Scaling-
L iL
P.{PER CODE BC.{ -.]05
Compurer Graphics & \Iultimedia
Course 0bjective
l-.e .-soal .i'this
coLrrse is to introduce the theorl'and practice
orcomputer graphics. T'e coLlrse
R'ill assLtille a goocl bacl<-sroLlncl in procramrning in
C or c-* and a backgrourd in rnathe,atics
i,clLrcli,g lamiliaritr ri'ith the theori'and use oicoordina,.
g"o,rri,ir, ;;;-;; i,;ear at_eebra such
as ntatri.r ntLrltipl ication.
To utlcierstand tl,e principles of computer graphics requires
not only stu<Jy of the literatLrre, but
experilrental rvork on a sraphics s5rstem. Therefore,
as part of this course, the students will
design ancl implenlent a sLrbstantial iomputer graphics
program and will generate some complex
illLrstratiorrs with this svstem.
Learning 0utcomes
I ' Ijrldcrstatlciing the
difl'ererrt displav clevice and their techlique and
use.
2. Basic cjescription of vari.r-rs irput crevice and their
use.
3' 'l-o utrclerstand the algorithrr for difrerent geometry ob.iect & develop the program Lrsing
C'/C'+ +.
4' use the geometric transfbrmation & their category and solve through tlre
'l-o
5' I o Ltse ol'nritltirredia ob-ject and understancl the architecture of multimeclia. example.
Course Contents
UNIT-I
Basics o1'Graphics System, Apprications, Dispray
Devices: video Disprays,
'. Raster-Scan Displays. Randorn Scan Displays. DVSi.
Flat-panel Displal,s.
Irtptrl Dcr"ices: Kevboarcls. Mouse, Track Ball and
-l-oLrch Space Bali, .toysticlts. Di-sitizers. Irnage
Scarrncr'. Panel. I_ight pens. Voice Systems E,tc.
UNIT-II
Lincdt.at,r,itrgal-eorithrrrs:DDAAlgorithm,::.
lirle ''\iqorithtn. Bresenhanr's circle rlrawing algorithm,
Micl-point Circle Algorit6rr.
Scan-line Poly'gon Irill Algorithm, Inside-ortri,i.
test, Bounclary liill algorith,,
Flooci-l:'ill algorith,. pixer. pixer addreising. Antiariasing,
TJNI'f -III
clippirg: Poi,r clippirg. cohen-Sutherrand Line cripping Argorithm,
Line Clipping Using Non
Rectangirlar- Cilip Windolvs. polygon Clipping, Text Ciipfing, ierr ilr;-1- {-l;*r^dinal*
LTNIl"IV
Tu'o-rjitrctlsional geolretric transformation: Translatior-r,
Rotation,
\'[atrir t'ePt'esentation anci Ilomogeneous coordinates. composite Scaling, Reflection, Shear,
Rr r1;11 i, )r:- \urli,u. cerre.ar r)ivot-poi,t
transfo.,iution,'il"rr,ri,"rr,
Rotatiorr aryL scarirrg.
(gPt'
F {&
UNIT-\-
Introduction to Multimedia: Review of Multimedia, Multimedia Applications, Multimedia
Systems Architecture, Multimedia Hardware, Multimedia Software, Representation and
Operations on Various Multimedia Data T1,pes: Text. Intages. Graphics. Video and Audio.
IntroclLrction to \iLrltimed ia ALrthorirlg.
Suggested lLe:rdings:
I L---
{*L
%
P\PER CODE BC.\ - ]01
\umerical \Iethods
F
Teachrng 0bjectire
Learning Outcomes
5. ,,\blc t3 urrclerstapd the concept concerning numerical dif]-erentiation and Integration 1br a
class olequidistant ancl trnequal arguments.
.l'o
6. learn ancl understancl nurnerical solution of ODE by techniques of lterative methods'
Corrrse flontents
UNIT - I
Compgtcr ,Arithrnetic, Flo:rting point number operations, Normalization and their conseqLlences,
irnrphasis 91 computationai Algorithrns, Numerical Errors, Iterative rnethods. Zeros of a single
trziuscrencle ntal equation ancl zeros of polynomials trsing Bisection, False positit)n,
Nervton-
Raphson and Secant methclcls, convergence of solr"rtions.
tNll - lT
Simuitrrri,-rgLrs lineal equations. Solution of simultaneous linear equations. Gauss eliminatiot-i
rletlrod t,itlt pivotirTg. CiaLrss--.lordan rnethoci. Jacobi's iteration rnethod and Gauss - Seidel
iteraticts siethocl, lll-conclititlned ecluations and reflnement of solutiot'ts.
UNIT - III
Dillercpce Operators and Interpolation: Definition of Forward, Backward. Shifting, Divided
di1'1er.e1ce, Central and Averaging Operators and their relationships, Newton's forward
clifl-ercpce. baclgvarci diff'erence and divided difference interpolation fbrmulae. Lagrange's
Interpolalion Iornrula.
uNIl'- l\/
Dilt'crentiatio n and Integration:
t
N u nrerical
\ Lrnrcrical Di1 tererrtiatiorr Lrsing Nervion's fbrward difference, backward differerrce and divided
cl i1'l ci'ene..: irrtcrltolation ol11ulae. General Quaclrature fbrmula. Newton Cote's integration.
1
Lirt i rrt lc. S inlpsott \ ()nc tlrirci attcl tltree - eiglrt rrne/
'l-rapc;'.oi
r)
'i-1-- a,Y
| ,/,/ \
UNIT - V
s% f'f
/ ','<"/t
- I
il L
,,/---
u-t
J-
1 t\,,Ii2s.!u
r'4
W--'
h.=
\Lrprericai Solirtiorr of Ordinarl Differential.equations b1'Er,rler's Method. ]\4odif-ied Euler's
-[ay
metht-rd. lor's series ntethod^ Picard's method, Runge Kutta, second order and fourth order
rrethods. Pred ictor-corrector rrethods.
Suggestetl lleadings:
Ilet'erencrr Books
x,'* w9-
l. NLtnretical N4cthods by B.S'Grewal. Khanna Publishers
f . f onrpLrter Oriented Numerical Methods by V.Rajararnan. PHI
3. Nurnerical Ana[,vsis by S.S.Sastry. PHI ,,
V b*ru
(
t
"I.-
)-"
P.{PER CODE BCA - {02
Advanced Computer Architecture
Course Ob.jcctive
'l-lte
course u'ill provide ltttderstanding of the architecture and organization
of computers and
techn ica I lrspects o[' conr puter clesign.
Learning Outcomes
All stirclcilts olcotl"lptttitlg shoulci acqLrire some unclerstanding anci appreciation o1'a
compLlter
s)'stelr's lirnctional components, their characteristics, their perfbrmance, ancl
their interactions.
Stuclents need to understand computer architecture in order to structure
a program so that it runs
rlorc e1'llcientll' on a real machine
(llurse (.ontcnts
UNIl'-I
StrLtctttl'c arld Fitnctiot.t, (-c'rt.nputer Interconnection Structure.
The Computer Svstenr. Sl,stem
IJLtses. Littnrpitler Functiot't. Fetch and E,xecution Cycle. Interrupts,
MLrltiple Interrupts 81,
lnterconrrectiorr And Br_rs Design, pCI BLrs.
UNtl'-tl
Cr)llli)LlIcr' \4ct.t-ttltv Svstetl. r\ncl Their Clharacteristics. Semi-Conductor
/ Main Memorv. Chip
Paciiagir! [:.rror L]orrectio,. Clache Memory,and It's Mapping.
UNIT'-III
Erternal verrory - Magnetic Disk organization, RAID, optical Memory.
cD- ROM, vRoM
Vlrurret i.' Ilrpc.
UNI'i--lV
inpLttr(.)tttllLtt [-.xtcrtl:rl De'uices. l/O MociLrle Prograrnrned I/O An<j Interrupt Driver" I/O InterrLrpt
Conti o Ilcr'.
[-rNt]--\'
Prost'atrrrrable Peripheral Interlace, DMA I/O Channels and External
Interface. Assembl'
I-ittrsttrtsc irrou.t'atrmitrg: Detailcd StLrcly of 8086/8088 Assembly '
Language tn.trr.tlon
Sel. I oolls rttttl Ii-lrnparisorrs. Condition and Procedure. Arithrnetic
Ofiera-tor Assemblv
Latrgtrrruc. lllLrstlatiorrs LJsing'i'1,pical Programs Lil<e: Table
Search. SubroLrtines.
Srnrbolic anci Nurrerical ManipLrlations and I/O
Suegested Readings:
w%_
L 1|
*-
(drtY \luY"s
L=
Reference Books:
1. The Intel Microprocessors Sth Edition by Barry B Brey
v a-z
\ Yy
lu__-
W- \y %
PAPER CODE BCA - {03
Data Structure using C++
Coui'sc 0b.iective
of different types of
T'he goal of:'this sLrbject is to ir.rtrocluce the theory and develop the atgorithm
data strucl-rre. Understanding the operation of different data structure and
implement in C**'
Explain use and application in real life fbr different data structure.
Learrting Outcomes
1. IJncler-stanc] how clata stftrctures map onto physical memorY.
2. SrLrcle'ts cle'elop knou,ledge of basic data structures for storage and retrieval of ordered and
or
ru,orclerecl clata. Data rtrr,.-tr,r., irrclude :arra)'s. linked lists, binary
trees' heaps. hash
ta h les.
3. SrLrclelts clevelop knorvled-9e of applications of data structures including
the abilit"v to
ir,plcr-pept atgorithms firr the creation. insertion. deletion, searching, and
sorting of each data
stl'LlctLl l'e.
4. (-(lntl)erc rlilferent implenretltations of the same or different data structure.
UNIT'-I
IrtroclLrcii., Data Structure, Array. Records, Stacks Introduction to Stack & Primitive
l'o
Application: Intix,
Operatiol 9p Stack, Stach iis an Abstract Data Type, Multiple Stack, Stacks
posr I,ix. I)re1lr ancl Recursion. Introcluction to Queues, Primitive Operations on the Queues,
(JLrcU.'ri: rrn.,\bstract Data l'),pe.Circular Queue. Deqltelte. Priorit-V Queue' Applications of
(]Lrcirt.
UNIT-I1
. Linked List& their type: linear. circLtlar & DoLrbly Iinkecj
list. Operatiorrs on various type of linked list. application of Linked list: Pol.vnomial
rnan ipr-rlat iott.
UNi'i'-l II
lrec. Licircrai & Birlar 1' Tree. Conversiorr of General to Biniiry Tree'
TraversalMethods.Inorder.Preorder&PostOrder,
t
of BinarY
'l'ree: ManipLrlation of Arithrnetic Expression'
Application
trNI'f-lv
(ii'a1tir & Tlieir Clategory & Represenl2lions' Traversing 1'echnique: Breadth First &
Cra1.',11;
Depth Iirst Search. Sparlnirlg Trees (St). .)
,Application of Clraphs: Pert & Related Techniques'
trNIT-V
. IntrodLtction to Sequential. Indexecl seqllential. Relative
& Direct iile organization. Searching : Search. Sortirrg: Cotlcept, selection sort.
BLrhble sorl trcrge Sort. Tree sort & Pa sort.
:L\r,./V)>"-,,, (,,qlo
Suggestccl Reirdings:
o 'a,&l
ff_ \ryJ-
(^L
P\PER CODE BC.\ - ](l-I
.\ccounting & \lanagement Control
CoLrrse Ob.jectire
l-he c,rLrrsc liiilis to cler.elol.r tirc student's abilil'to. u,itl.r the help ol scientitlc thc-olics lrncl
insi!.iri: rirtLr 1,.r'xc11c.l application. rrr.ralr,sc llranagcmcnt co1.)trol svstcms and thLls be able to take
ihe rc L'\:un i rieci s i ons r-cgalcl i n g organ i salional cicveloprlent.
I
l,earning flutcomes
,'\ttcr conil.rir-tion olthc cotu'se the str-rdent shor"rld be able to
2. describc nrodels and metlrocls lelating to reporting, oornmunication, decision making ancl
accountll-riIitv in the nranagenient control area.
.l al)i-al\.' nr{)drris anrl t.nethods of managcmcnt coltrol in diflerent areas.
.+. assL:ss iirl(l r:r'iticalh,reflect on difl'erent lnodels and methods in r.nanager-t-ter1t control.
Clourse Corrtents
UNIl--I
Vleaning ot' Irinancitrl Accounts. Imporlant concepts ol Accounts, t),pes of accounts, Rules of
.lounrai. !iinrp)e jcxrrnal entries. Clash Book - Types, Fonnat of Cash book. Balancrng of Cash
llook. l.tcir:cr'. ilosting of entries.
LtNl'f - H
'i-rill lirllncc.,,\djr-Lstrnent Entrics Itelating to Closrn-q Stock, Outstanding Expenscs, Plcpaid
i-.rpr-n-scs. Accr.uccl lncome. LJneamecl lncome, Deprecizrtion and Interests on Capital, Sirnple
irinal .,\ccoLrnts \\'ith l'he Abor.c Adjustrnents.
L\II_III
\'lcarrin,r anrl nccci oi'matcrial control, pr"rrchasing of rlaterials, inspection olmaterials, FIFO ancl
l-UrO nrctlioils of or-rtgoing nraterial. their advantages and limitations.
[]\t't tV
l)a1, \,'l'1s1s'" s Departt.nent, Pay Roll Accor-rnting, Methods of Payments olWages, and Overr,ierv
o1' C'oinpLrterjzecl Method For Payroll Pleparation.
LrNIl-- \'
\{cairing lintl scope of tlnancial rranagement. functions ol frnance, Ol-{ectives ol financial
lttaltagelltent. N,lathen.ratics of-I'tnance: Present value techniques. fund fl'om operations,
i n'tporIurrcr rt riscfilIness of staterlent.
\*: *
Suggested Readings:
tu
-pt)
--{t\
t id# L )---
\'Iain'l trt Ilool<s
-l-.S.
l. Ilrroii i.'ecPing [-i1' Grer.val
2. (lost ,\e courrting bv S.l(. Maheshwari
lLel'eren ce Ilooli.s
&Y*
=p Vb-
+ \#4'
P.\PER CODE BCA - ]05
Programming in Jar a
Course 0bjective
l. (i:tin Lnoul..-d-se aboLrt b:rsic Java language s),ntax and semantics to rvrite Java programs
ancl use concepts such iis variables. conditional and iterative execution methods etc.
2. [-jnclcrstand the fundarnerrtals of object-oriented programming in .lava. including defining
cllisses. objects, invokirrg methods etc and exception handling mechanisms
3. Understancl the principles of inheritance, pacl<ages and interfaces
4. Llrrdelstand horv Strings are treated and managed in Java
5. tJnderstancl exceptions and exception handling mechanisms in Java
6. i.earn tire nrLrlti threaded rroclel of Java
7. Lcaln LiUi programming using AWT and Swing and Event Handling
Learning Outcomes
1. Erplain and cletrne OOP principles in context to .lava and r'vrite basic Java programs
?.. lderrril.r thc irsage of collections fiamervorl< in.lava
3. Urrclelstnncl the basics of- String Handling in Java
4. Erpl:rin .[ava's exceptiorr handling nrechanism in cornparison to other programming
lanqirages
5. Analvze arrcl irnplement irrterfaces in Java
6. . Crcatc and manage packages
7 . Do,eiop rnr"rltithreaded applications using Java
8. L..tse tll cotnponents like rvindows. menus, buttons, checkboxes, text frelds. scrollbars and
scroiling lists, through AW'f & Sr,ving and apply event handling on these components
UNIl'- I
Introtluction to .Java: Versions o1' Java, Features of java. Cl++ V/s Java, Setting Lrp Java
euvir'onrricrrt. .larra virtual r-nachine. Clonstants & Variables. Declaration of Variables. Types of
-fypes
Variable:;. Scopc of Variablcs, Data in Java. Operators in.lava. Control Statemeltts in
.lava. .,\rr:r}'s: Cireating One Dirnensional & Two Dimensional Arrays
T]NI1'-I I
Ilasic concepts ol OOPS: OOPS terminology. Cllasses, Methods, Creating Instance & Class
Varilble:;. ,\ccessing Cllass \4ernbers. Constructors, Method Overloading. Inheritaltce and its
['r,pcs in .lava. N4ethod Ovcrriding. Final Variables. Methods and Classes. finalize ntethod,
Abstracr Vlethocls & Classes. Visibility ControI in Java. Interfaces: Defining lrtterlaces.
I mpIerrentin-9 and I nheritirrg interf-aces.
T:NIT-II I
(loncept of l'acktrge: In-bLrilt Pacl<ages. Using In-Built Packages. Creating LJser Deflned
Paciilscs. Accessinq a tlscr'-Deflnecl Package, Adding a Cllass to a Package. Worhing t'ith
Strings: Srring. StringBLrft'er. and StringBuilder. Collections Framervork: Set, List, Queue.
Maps
{r29 vL
1v U*)t'
d
trNIl -l\
Exception Hanclling in Jirva: Types of Exceptions in Java, Tr1'-Catch-Finally, Using Multiple
Catch Llloclts. Nestecl Try', Throw and Throrvs Keyr'vord'
Multithreading in Java: .lava TlTread Model, Life Cycle Of a Thread. Creating Threads,
Extercli,g lhrcad Class. Stopping & Blockirrg A Thread, Thread Exceptions. Thread Priority.
'l hreacl Si,,chronization. lntplententing Rr,rrrnable lnterf-ace. Inter'fliread Clommullication.
r.'Nlr \
lntroclucrion to GUI Programming in Java: AWT: Basic GUI Components of AWT'
Event
Hanillins. Java Sr.ving: Basic C,UICoinponents of Srving, Difference between AWT and Sr'r'ing
Suggcsted 1Leadings:
-fcxt Lloolis
'fata McCraw Hill Publicatiorrs
l. .lr\/a L'()ll')plete Ref-ereltce
2.. Prgsr.arur-ning In Java. E. Balaguruswamy. Tata McGraw Hill Publications
Rel'ercnce Books
l. Ileacl [irst.lava, Kathy Sierra & Bert Bates, O',Reilly Publications
2. .iava \/olume I & II - Pcarsoll Education
j. peter Norton f-iLricle -l-o.lava Programming. PeterNorton, Technredia Publication
3-
\p
i
i/
/\v
P\PER CODE BCA - 5OI
Dill'erential Eq uations
Teaching Ob.jective
TIte ob.iective of this colrrse is to strengthen the students in Diff-erential Equations.
Learning Outcomes
L. Understand the concept of differential equations of first order and of higher orders.
2. Understand concept of linear differential equations of higher order with constant
coeff icie nts.
3. Able to solve Simultaneous differential Equation of first order.
4. Understand formulation and classification of Partial Differential Equations.
5. To solve Linear and Non-Linear PDE of first order.
6. Understand the methods to solve linear PDE of higher order with constant coefficients
1. -fo solve Linear differential equations of second order.
B. Understand application of PDE which include solution of one dimensional Heat and Wave
uation.
Eq
9. Understand concept of PowerSeries and learn various methods to solve it.
10. Understand the concept of Bessel and Legendre functions and derive recurrence relations
for them.
Coursc (-ontents
UNIl'-I
Dillbrential Equations of First Order and First Degree: Homogeneous DifJbrential
Equatiotrs. Rec'lLrcible to Homogeneous Difl-erential Equations. Linear Diff.erential Equations,
Reducible to Linear Difl'erential Equations, Bernoulli's Equation, Exact Differerrtial Equations,
C-- han ge o 1' Variab [es.
Dill'erential Equations of First Order and Higher Degree: Ditferential EqLrations solvable fbr
p. soivatrle lbr 1,. solvable fbr x. Clairaut's EqLration.
UNI't'-rr
Fanrill' o1'Curves: L,inear Ditferential EqLrations of Higher order with constant coefficients.
Differerrtial IrqLrations redLrcible to l-inear Dif]'erential Equations rvith Constant Coefflcients.
Sinrtrltaneous cii11-elential eqLration of 1lrst order.
UNIl'-II I
Partial Difl'erential Equations: Definition and Formation. Partial Differentia[ equation of f.irst
orcler. I-agranee's trethod. standard fbrms, Charpit's method, Linear Partial Ditlbrentiat
EqLration of H igher order rvith Constant Coelficients.
TINIT_-IV
Litrear Llill-erential Fiqirations of second order, Apptication of Partial differential equation:
\'{cthocl ol'separation ol'r,ariables. Solution of One dimensional rvave equation and one
dinrensioliaI Iteat equation.
Lj* tuuL
L
q ^I-
%
I-,IIT-\"
Series Solution of Difl'erential Equations: Power series method, Bessel and Legendre functions
& Legendre tirnction.
ancl their properties. Recurrence relations fbr Bessel function
Suggestecl Readings:
Main'l'ert Books
1. Ordinary and partial differential equations by M. D. Raisinghania - S. Chand & Company
Ltd.
2. Higher Engineering Mathematics by B.S Grewal - Khanna Publishers
ILel-erence Books
1,. Advanced Engineering Mathematics by Erwin Kreyszig - Wiley
2. Differential equations by Shepley L. Ross - John Wiley & Sons, lnc
3. Elements of Partial Differential Equation by Snadden - Dover Publication
4. Differential Equations:An lntroduction to Modern Methods a1d Applications by Brannan
and Boyce- Wiley Publ.
r-D
fu N";'1
Ly :-f)
PAPER CODE BCA - 502
Software Engineering
Course Objective
Thc coLtrse ob.jectives o1'softu,are L,ngineering Progral'n are to produce graduates n'ho. within
thrcc r elrrs alicr gracluation. arc able to:
,A. tsc eutploy,ed irr indLrstry,, government, or entrepreneuriaI endeavors to dernorlstrate
profbssional acJvancement throllgh significant technical achievements and expanded leadership
responsibility';
B. Detrcrtstrate the abilitl, to rvorh effectively as a team member and/or leader in an ever-
charrging proltssional environment; and
Ci. Irrogrcss throLrgh advanced degree or certiflcate programs in compLrtil'tg. science. engirreering.
busincss. ancl other prof-essiolralll, related fields.
Learning Outcomes
At thc time o1'graduation, alI Software Engineering students will have demonstrated:
t. Hor,r, to apply the soltrvare engineering lifecycle by demorrstrating competence irt
cor.nurunicntiorr. planning. ar,alysis. design, constrltction, and deployment
l. ..\n abilitv to uork in one or rrore significant applicatiorl donrains
l. \\ior'l< us an individLral iincl as part of a mLrltidisciplinarv team to develop and cleliver clLralitl
so lln are
.+. I)einonstrate an understancling of and apply currenttheories, rlodels. and techlliclttes that
il
plovicle a basis lor the softrvare lif'ecycle
-). Demonstrate an abitity to use the techniques and tools necessary tbr engineering practice
Coursc Contents
tiNI't'- I
Irrrr',r,.ltreriorr: Evolving Role ot'Software, Software characteristics. Soltware Dcsigrring
Processes: Software Engineering. Software Process and Characteristics. Need of Softrvare
Developnrent Lifb Cycle Models, Waterfall, Prototype, Spiral Model, RAD Model;
UNIT. I I
Scilrrilirc Iieqirirellent Anall,sis and Specification: Requirernent Elicitation Techrrique:
lrrtelvieu - Forrr Arrall sis. St{S and its Characteristics. Sofirvare Pro.ject PlanrtirT g: Issues
involi,eci in Soltivare Estintatiorr, Size E,stirration lil<e lines of code and Frtnctiot't poittt rrethod,
Cost Estinration Model: COCOMO. Risk Management.
T]NI1'- IIi
Sottu,iire Pro.iect Managernent Process: Feasibility Study,,llroject Pla,nning, Pro}e.et F.xecuthn,
Pro.iect l'ernrination. Systerr Models: Data.flow models, Semantic data models,,Object models,
Inherirance models, Object aggregation, Service usage Inodels, Data Dictionaries. Basics
Softl,are Design: Design Process. Design Fundamentals, Softr,vare Design l-evels: Arcl,itectural
Design. Iligh Level design. detail design, Design Notations. Specification and Modularization,
Desigrr Structure Chart. Pseudo Codes. Flow chartsTCoupling and Cohesion lrleasures.
{4r
TJNIT.IV
)--'
%- qd/'
<Y
#ww
Desi.'cpSrilreuies: Function Oriented Design, Ob.iect Oriented Design. Basic concept of object-
orieptccl rnalrsis & Design. Traditional paradigm versus ob.fect oriented paradigm, software
clesigir approaches: Top-Doivn and Bottom-Up Design Otiect-oliented .design: Objecf
aggregation: Serviee Usage; Object Int ce .Design:::'Desigh evolution, Functio oriente'd
design: Data -f1ow design; StrLrctural Decomposition: Detailed design.
UNIT- V
Softr,r,are N4etrics: Softu,are lreasurerlents What & Why, Tohen Count, Halstead Softr'vare
'fypes of
Scierrce Nleasures, Design Metrics, software testing. Test cases. Software Maintenance:
softy,iire Vlairrtenance, Sofl,vare maintenance model, Concept of Software Re- engineering &
Softu,alc Reverse engineering- Definition, purposes and objectives. Introduction to IJML class
diagrarn ob-iect cliagram. use case diagram, sequence diagram. activity diagram. cot'nponent
diagnlnr. col laboration d iagrarl.
Suggestetl Re:rdings:
Ret'erence Books:
l. Softu,are Engineering- Shari Lawrence, Pfleeger. Pearson edu.
)-. LlnilLed soltu,are developrnent Process- Ivar Jacobson, Crady B, Pearson edu.
fu'k*
?---
PAPER CODE BCA - 503
Artificial Intelligence & Expert Systems
Course Objectir,e
The objective olthis colrrse is to introduce key concepts of artificial intelligence and application
areas. l'opics inclucle plarrrring. expert s)'stems, machine learning. genetic algorithms, and natural
languaue processing. Upon conrpletion of this course, students should be able to apply various
arti llcial i ntel l i gence techn icl Lres in developing intel l igent systems.
Learning Outcomes
StLrdents shoLrld undersand the concepts of Artificial Intelligence and Expert System Concepts.
Ilxanrine methods that have errerged fiorn both fields and proven to be of value in recognizing
pattenrs uncl making predictions frorn an application perspective.
Course Contents
UNIT- I
Introduction and applications of artiflcial intelligence, Problem solving : Defining the problern as
state space search. ProdLrction system, Problem characteristics, Problem system characteristics.
Sealch techniclues: Generate and test , Hill climbing, Best first search, A* algorithm. Problem
reclucLion. Expert s)'stem: Dcflnitiolr, Role of knou,ledge in expert system. Architecture of expert
sy'ste nr.
TINIl'- II
Irrpcrt s\istcm cievelopurent lif'e cycle: Problern selection. Prototlpe constluctiolr. Formalization.
lnrplernent.ation. Evaluation. Krroivledge acquisition: Knowledge engineer. Cognitive behavior.
Accpisition techniques. I(nou,ledge representation: Level of representation, Knorvledge
reprcserrtation schemes. Formal logic, Inf-erence Engine, Sematic net, Frame. Scripts.
IINI'I'- III
I)crccl,.tion: Sensing. Speech recosnition. Vision^ Action. Neural netvvorl<s: IntrodLrction.
f.onrparisorr o1'artitrcial neural nehvorl<s with biological neLrral rretr,rrorks. Learning irt rreural
netu,orks. Perceptrons, Bacl< propagation networks. application of neural netu,orks
UNIT- IV
Ftrz-2.,r'logic: Definition. Dif-fbrence betrveen Boolean and Fuzzy logtc. fuzzy subset. fuzzy
rrenrlrcrship lirnction. firzzv expert system, lnference process for fuzz"y expert systern. fuzzy
controller'.
UNIT- \'
Proaranrnring in Logic (PROLOC): lntroduction. Prolog variables, Using rules, lnput arrd Output
preclicales" Ir'ailand cut predicates. Recursion, Arithmetic operation, Compolrnd object. Dynarnic
L q4:q
t. David W. Rolston: PrirTciples of Artif-icial intelligence and Expert System Development,
\lcCrari Hill Book Ciorrpanl,
2. [.laine Rich" Kevin I(night: Artificial Intelligence. Tata McGraw Hill
-).
( arl l-o*,nsend: Introdirction to Tlrrbo Prolog, BPB
1. Stirrralions V. I(artalopoLrs: Understanding Neural Networl<s and Fuzz5, Logic. PHI
Refererrce Rooks
l. Darr W.Patterson, " Introduction to AI and ES", Pearson Educatiolt,2007
2. Petcr.lacksort," Introduction to Expert Systems". 3rd Edition, Pearson Education, 2007
3. Str-rart Rurssel. Peter Norvig "AI - A Modern Approach",2nd Edition, Pearson Edr:cation
).001.
,4
,1c-
,// 0\'9*
w\)-4--' $r1
,,q,tr! /i/
y -
=p
): >?"/'
.
V fu-,
.l
\,- Y,,
\
le---
P.\PER CODE BC.\ - 50]
Programming in Advance Jar-a
Course Objectir-e
l. I-earn to dilferentiate benieen static and dl,narnic n,eb applications
2. To ll.rle'stard the MVC. rrodel of buircring a u,eb application
3. 'l-o gcL an in-depth Lrndersranding of JDBC. Servlets. JSp and JavaBeans
4. -l'o Lttltierstand inte-urated developnrerrt envilclnment to create, deburg and 1ln web
a;rplications
Learning Outcomes
I . L.eartl to access databasc thror-rgh Java programs. using
Java Data Base Connectivity
(.rr)Ll(')
2. C.r'eate clynamic rveb pages. r_rsing Servlets and JSp
3. MIal<e a reusable software components Lrsing Java Bean
1. Desigrr (iLll based web applications that are able to interact with databases, using in-built
lianre n orl<s ol.lava
Course Contents
UNIT-I
Starting n'ith Web Applications in Java: Introduction to rveb applications. Benefits ol .uveb
applicatiorls- Web Architectut'e Models- Model I Architectr-rre, Model 2 ArchitectLrre.
Introduction to
M\i(' ,Architectlre: Model componelrt. view component, controller component.
UNIl -II
lntrodtrction to ,IDBC: Introducing JDBC, Communicating r,vith Database: Obtaining
Clotrtrectiotr. Clcatin-e .lDIlCl Statement Ob.iect. Types ol' SLtement Ob.iects:
Statement,
PrePat'ecl Stntetllent. Callablcr Statement, Executing SQL Statement, Closing
a Database
Clotltrectiort" C|eating DSN and Understanding Various JDBC Drivers; Creating fa6te
by Using
.lDB(1. Worl<ing With ResLrltSet Ob.iect.
IJN'I'I'-III
lntrotltrcfiott to Servlets: Need fbr Server Side Programming^ What is a Servlet^ Advantages
o1'rtsitrs Servlets- Underst:rnding the Servlet API. Generic Servlet Class, Servlet Lifb
ClyJe.
Servlet [(eclLrest. Redirection. Servlet Config, Servlet Context, Session Tracl<ing with
Servlets.
deplovine a Servlet Application
IINIT*IV
Introcluction to JSP: Understanding JSP..ISP Architecture, Advantages of JSp. isp Lif'e cycle,
.lSP ScIiPtirrs F.lemettts: ScriPtlet. Expression. Declaration; JSP Implicit Objects. Directive
Elernents:
I)agc. Irrciirde. iaglib. .lSP Actitrr lllenrents: Forlvard. useBean. InclLrde. setpropeftr,
& getproper.t_v. JSTL
UNI'I'-\'
Intrtttltrction to .IavaBe:rns: Concept of JavaBeans, Advantages of irsing JavaBeans.
p
Suggested Readings:
u#'
v
l\-=
x?
>---'
W
NIain Tt'rt Books
l. .lava ( ornplete Ref'ererrce - Tata McCraw Hill Publications
Rel'crertce lJooks
l. Ileacl First Java, Kathy Sierra & Bert Bates, Shroff Publishers
2. Heacl First Servlets &.lsP, Basham Bryan, O',Reilly Publications
3. Mastcring JavaBeans, Laurence Vanhelsuwe' Svbex [nc'
,/
,V,l \D-
A-
(L q#r\ Y Y >*r
I
\ -.
\
lY----
PAPER CODE BCA - 505
Oracle 8i
Coursc Objectir e
To cnhance the l<nou,led-ee and understanding of Database analysis and design. Enhance the
l<nou'lcclqe ol'the processes of Database Development and Adnrinistration using SQL. and
PI-iS(ll . lrsc the Relational model and horv it is supported by SQL and PL./SQL. Use the
PLTSQL codc construtcts of tF-l'l-lE,N-EI-.SE and LOOP types as uell as svntax and command
lutrctioits. Solve Databasc problems using Oracle 9i SQL and PL/SQL. This rvill inclLrde the use
ol Proceclures. F unctiorrs. Packages, and Triggers.
Learning 0utcomes
Stiiclcnt u ill get exposLlre to r,r,ork on databases using Oracle.
Corrrsc Contents
UNIT- I
RDBiVIS CIOMPONENTS Kernel, Data Dictionary, Client-Server Architecture, Oracle
Architecture. Oracle files and processes, Role of DBA
UNIT- II
Intt'oclLtction: SQL'FPlLts arrd SQL. Data types in Oracle. DDL Statements. Compr-rtatior-ls on
'['ablc Data. Oracle
Dual 'l'able. Oracle Functions. Data Constraints. Grouping Data fiorn Tables.
N4ani1;Lrlating Dates. Pattern rnatching, Range Searching. Study of the clauses: Union, Intersect,
MinLrs claLrse.
TiNII'- III
.loininq lvlLrltiple Tables (EclLri Joins),.loining a Table to itself (self .loins). sLrbclueries
Ct'eatirtg r'icrt's. Renamirt-9 the Column of a vier,v. Updation. Selectiorr. destroyirr-e vier,vs.
Pet'nrission on the ob.jects created by the user, GRANT statement. Ob-iect privileges.
Ref'erencing a table belorrging to another user. Revoking the permission given, Sequences.
Incler cs.
UNII-- IV
Datu ('ontrol Language (DCL), Data Security, Crant and Revoke, PL/SQL. Variables ancl type
decluratiotts. I-oop structure. PL/SQL Blocks, Cursor/ Cursor loops, Types of stored PL/SQL
Bloclts. E.rceptions
UNI'T- V
ProccclLrres & FLrnctior-ts - Concept. creation. execution. advantages. syntax, cleletion,
'l-riugers -
L.oncept. Lrse. horr, to appl1,, datatrase tr'rggers, ty'pe of triggers. syntax. deleting,
inrpolL. c\llort. /"-
Suggestcrl Reaclings:
EY N7'*-*
,/
Y
^/ -I__ k*P
/)
-',€t b#t
4--'----
lVInin Text Books
l. sQt .Pi /sQL The prograrrrri,rg- La,g. of oracle rvan Bal,ross - BpB
2 oniclc llatabase I2c The Conrprete Ref-erence (oracle piess) b1,Bob Br1,ra.
I(evin Lone\,- or.acre
Press
lLel'ercnce lioolis:
I . Olacle l)utabase l2c SQL
- .lason price - Oracle press
2. oracle Database 12c PLlSel- programming by Mclar-rghlin oracle press
-
(#ryt W
\r- /t
l=--
PAPER CODE BCA - 601
ProbabilitY & Statistics
Teaching Obiective
with basic concept of statistics that are
Thc ob.]eetive o1-tl,is coursc is to acquaint tl,e studerlts
Lrseiirl in decisiorr mahirlg problems'
Letrrning Outcomes
terms'
I Iinclelsttrnd the meaning and use of statistical
.
statistical measlrres to model situations'
2-. lJrclerstancl o,',o upf ty descriptive
linear regression analysis'
3. llnclerstand and appll'correlation and simple different types of situations'
4. Iirclerstarrcl ..,r,1 il;il probability clistribuiions ro rrodel estimation and
5. l,tnclersta,cl .,,.1 ;;;iy statisticalinference techniques (i,cluding statistical
l-rl,pothesi s testi n g)
Coul'se Contents
UNIT-I
Histogram' Frequency pol'vgo,s'
lntrorluctirin: lrrequetlcl, clistribution arld Frequetrc.v- charts'
Ogives' Measures of Central
FrctFrcircr eLlrVCS and LlLrmLrlatiVe fiecluetlc-V distribLrlion'
lrlean, geometric mean' harmonie' lllealr'
Tenrlencl,: ,\rithnretic meall. rveighted aritllmetic
Measures of Dispersion: Range' mean
meclian. nrode. cluartiles, deciles aird percentiles.
absolute and related dispersion'
deviation. ,.,r',i-int.. quartile range for quartile deviation,
coell rciertt o1' virriation.
uNlT-ll
types' relation betr'r'een moments'
Morncnts. Slielvuess and Kurtosis: MomentS Of various
moment generating functions' Elementary
Sltepparcl's correction, Skervness and kurtosis, oll total
probability'l'heory: Sar-,ple space, events, ciassical def.-inition of probabitity' theorems
events, rnutually exclusive events'
apd compound probabilitl,, independent and depeldent
mirthe rratica I exPectation'
IJNIl'-II I
cotlcepts and
probability' distributions. .basic
Probahilitv Distributions: Discrete and continuous
applicerions ol.Binorlial. Poissolr, Rectangular.
Exponential and Normal distributions'
UNIl'-iV
Least square fit' polynomial and curve
lLegressi,u ,ncl Correlation: Regression analysis'
Linear correlation, measures of correlation'
fitting. l.ine:rr and non-[inear t'egressiorr algorithms.
and partial correlation for three variables'
coefllcieitt of correlation. ratrl< correlation,"multipte
Suggestetl Readings:
fu h-d.
qY
v
t\
=r
4-,
--
PAPER CODE BCA. 602
Networking ConcePts
Clourse Oh.jective
l. BLrilcl an irpderstancling olthe fundamental concepts of computer rretworking.
2. Iran-riliarize the student rvith the basic taxonomy and terminology of the computer netrvorking
area.
3. Irrtrocluce the student to advanced networking concepts. preparing the student fbr entry
A clr,ancecl coLrrses i n corn puter networkin g.
4. .\llou,the stuclent to gain expertise in some specific areas of Iletworking such as the desigrr
tintl utliintenance of indiviclual netu'orks.
Learning Outcomes
Attcr copltltleting this tlte l<nowledge and ability to:
coLrrse the student must demonstrate
I . I rrclepepclentll,, understand basic computer network technology.
2. []lclerstarrcl and explain Data Communications System and its componellts.
3. ldcnti'i-r the difterelt t1'pes of netr'vork topologies and protocols'
4. Illuprerate the layers of the OSI rnodel and TCP/lP. Explain the functiorl(s) of each lal"er.
5. lcicptit-t, the clif'fbrerrt types of network devices and their functions lvithin a network
6. Llpdersrand arrcl bLrilding the sl<itls of subnetting and routing mechanisms.
i. Iramiliaritv rvith the basic protocols of computer networks. and hor,vthey can be r-rsed to assist
in n.-trrrlrl< design ar-rd irnplementation.
Course {.oltteltts
T]NIT- I
Datl (.gprr.nunication Systerr: Purpose, Components: Source. transmitter. transmission System,
receiver'" ancl clestirration. Data transmission: Frequency, Spectrum and Bandu'idth. Tirne-dornain
ancl ii'etlLrcncl' clomain Crtrrcepts. Retationstrip between data-rate and Bandr'vidth. .'
!l llr t Ir
UNIT. II
Apalgg apcl digital data transrnission. Data and signal. Analog and digital signaling of analog and
digital clata. N4oclem, rnoclr-rlation techniques, codec, digital transmitter etc. Trarrsmission
impaiirrcnts: attertr.raticln ancl attenuation distortion. delay distortion, noise.
UNI'l-- Iil
Inrr.orlucrion to Netlrorl<. OSI ref'erence rnodel. TCP/lP re['erence rnodel. Transmissiilrl Media:
Vlag;eric N4eclia. Tr,visted-Pziir cables, Baseband & Broadband Coaxial cables, Fiber Optics.
$rireless
'l Microwave Transtnission, . ::'-:.: 1" ',. :
t'ansmission: Radio Transrnission, 'lr"':.'
(y*o
* I
%'
ISDN: A I\,1: data linl< lar"er: sen,ices. fiaming. error control. error-detecting & correctinq codes.
Data linli protocols: stop-ancl-nait protoco[, sliding rvindou, protocol. HDLC: static & dynamic
chzurnel allocation in LANS & MANS. : i
UNIT-Y
MLrltiplc Access Protocols: ALOHA, CSMA/CD; IEEE standards 1002.3 and Ethernet, 1002.4:
Tokerr Bus; 1002.5: Token Ring. Bridges, Routers, Gateways, Routing Algorithrn, Congestion
control Algorithrn, Internetu,orking. The TCP/IP Protocol, IP Addressing, Subnets,
Suggestecl Readings:
M:rin'le.xt Books
I. ConrpLrtcr Netrvorl<s by A. 1'anenbaum. (Prentice Hall- pLrblisher).
2. Data Cornn.trrrication & Net\vorking by Forouzan. ( Mc Graw Hill PLrblisher)
Rel'erencer l]oolis
l. Data & Cornputer Con-rr.r-rr-rnications by W. Stallins
b*
D rk q#f'! W v
+
)_----
E-
ISDN: A I'\4; data link layer: services. framing, error control. error-detecting & correcting codes.
Data lipl< protgcols: stop-ar,d-wait protocol, sliding windor,v protoco[. HDLC; static & dynamic
channel allocaticlt in LANS & MANS. :
:
UNIl'-\/
NzlLrltiple Access Protocols: ALOHA, CSMA/CD; IEEE standards 1002.3 and Ethernet, 1002.4:
Tol<en Br-rs; 1002.5: Tol<en Ring. Briclges, Routers, Gateways, Routing Algorithm, Congestion
cont;ol Algorithn.r, Internetrvorking, The TCP/P Protoco[, IP Addressing, Subnets, :'
Suggested Re:rdings:
v*
lleti:rcnce lloolis
l. Data & i'otnpLttet'Cotrrmrttrications by W. Stallins. (PFll- Publish
p t#f'h W
9"'
1k
+
I---.
PAPER CODE BCA - 603
Introduction to Asp.net & C#
Course Objective
l. Understand the difference between desktop and dynamic web applications.
2. Understand the ASP.NET web application execution model.
i. Create and rnodify multi-page Web Form applications that involve and demonstrate features
such as flow control, the use of style sheets, state management, data access, data binding,
security. and data verification and validation.
Learning Outcomes
l. Stuclcrrts nill
able to desigrr ri,eb applications Ltsing ASP.NET
2. Students r,r,ill be able to use ASP.NET controls in web applications.
3. StLrclents u ill be able to debug and deploy ASP.NET web applications
Coursc (-orrtcnts
TINI'I - T
Proglarrn-ring in C#: Overvieu, of C#, C# environment, datatype, type conversion. variables,
cor.lstants. opcrators: Arithrnetic Operators , Relational Operators, Logical Operators, Bitrvise
Oper:itors. Assigrrrrent Operators, Misc Operators.. decision rnaking. loops, overview of oop's:
(encapsLrlation. irrheritance. polymorphism, abstraction), class. ob.iect, methods, inbuilt classes
antl nrctlrocls.
LrNl'l'- Il
Progranrnring in C#: Arrar,s. Collections, String. Structure. E,num. Operator Overloading.
Intcrltrccs. Preprocessor Directives. Namespace. Regular Expression:C--haracter escapes.
Charirctcr clnsses. Anchors. Cirouping constrllcts. QLrantil'iers. Backref-erence colrstrLlcts.
Altelnrifion constrLrcts. Substiturtions, Exception handling, F-ile llO : StreamReader,
Strcarr\\'r'itcr" StringReader'. StringWriter. C# AttribLrtes. C# Propefiies, C# Reflection.
trNn'- I tI
to ASP.Net: Overvierv of ASP.NET fiarnework. ASP.NET Application Lil'e Cycle,
Introcir-rctit'rn
page lil'e cvclc phases: Initialization. lnstantiation of the controls on the page. Restoration and
r-naintcrurnce ol'the state. Execution of the event handler codes. Page rendering. Ulrderstanding
ASP.NEl- Clorrtrols, Applications Web servers, installation of IIS. Web fonns. web fbrrn controls
-serve r controls. client controls. web forms & HTML.
UNIl'. IV
Pro.urarrnring in ASP.Net: Adding controls to a web fbrrn, Br-rttons. Text Box, Labels, Checkbox.
llaclio BLrttons. [-ist Box. etc. I{unnirrg a r.veb Application. creating a rnLrltitbnn web project.
Erurt Ilunrllirrg- Application ancl Session Events. Page ancl Control E,verrts. Master pages, Rich
controls. Ajar Controls Validation controls: RequiredFieldValidator, RangeValidator.
Conrl,.urc\,'r,rliilator. Regular[}pressiorrValidator. CustomValidator. ValidationSutnmary. States
ol'ASI'.).lcr : Vieu,State. Control State, Session State, Appf ication State.
UNIT- V
\---9
LD- \Y
q
tu
Ie'
>-"2
Datrlriisc citnneciiritr in \SP.\et: .\rcltitecture ol -\DO.\ET. Cottttected and Discollttected
Database. C reate Connection using ADO.NET Ob.iect \,Iodel. Connectiott Class. Cornmand
Class. DataAciapter Class. Dataset Class. Display' data on data bound Controls and Data Grid.
Database Acccssing on vveb applications: Data Binding concept lvith u,eb. creatirrg data grid,
Bindin-e starrdard r,veb server controls. Display data on u,eb fbrm using Data bound controls.
Suggested Readings:
Reference llooks
L Asp.Net Prograrnming With Visual C# And Sql sselin
tt"$rtt
Wft7^r- Wfu
=P
+
----'
\y
PAPER CODE BCA - 601
Sofhvare Testing
Course 0bjectir,e
The Objectile olthis collrse is to learn and apply basic skills needed to create and automate the test plan
of a softu,are project, to know holv to plan, develop, and execute an aLrtomated test plan. Students shor-rld
learn testing concepts, Test planning, Creating a test plan in Test Director , Breaking the test plan into
manageable colxponents , Designing test cases and test steps, Analyzing the test plan, understanding of
Ar-rtornatiorr testing. Creating a script throLrgh recording.
Learning f)utcomes
l. 'l'o be able to apply varioLls test processes and continuor-rs c1r-rality improvement
2. 'l'o be able to deflne the types of errors and far-rlt models
3. l-o be able to use methods of test generation from requirements
Course Contents
UNIT- I
Intlocluction: I'estin-e as an Engineering Activity. Testing as a process, testing axioms, basic
Delinitions Softrvare Testing PrirTciples, The Tester's Role in a software Developrnent
olganization. T'he Def'ect Repository and Test Design, Developer/Tester Support for Developing
a Delect Repository. Defect Prevention Strategies.
UNIT- II
Test ('asc Design :Test Case Design Strategies. Using Blacl< Box Approach to Test case design.
Ranclonr 1-esting. Requircnrents based testing. Boundarl'' Value Analysis, Decision tables.
EclLrivalcnce cl:rss partitioning. State-based testing. Cause-ef}-ect graphing. E,rror gLressing.
C'onrpati b i I itv'['esting.
T]NI1'- III
[-1sing \\ hite l]or App.roach to Test desigr,, Test Adequacl, Clriteria. static testing vs. structural
testing. cotle firnctional testing. Coverage and Control f'lor,r,'Graphs. Covering Code Logic, paths,
their lolc in \\ihite box Basecl Test Design, Evaluating Test AdeqLracy Criteria.
UNIT. IY
Levcls O1' I'esting:The Need fbr Levels of Testing, Unit Test. Unit Test planning, Designing the
L-lnit tests.-fhe Test harness. I{unning the unit tests and Recording results. Integration tests.
Designing integratiotr Tests. Integration Test Planning. scenario testing, Def-ect bash elirnination.
Svstenr 1-esting. Acceptzrnce testing. Perfbrmance testirrg, Regression testing, testing OO
sr sten.rs. testins the docurnentation.
t.NIl'- \1
IntrorlLiction to alltoltlatic testing & tools: Drarvbacl< of manual testirrg. Beneflts ol'automatic
te:1 itt.1. (lL'nrerit\ ol aut()r)retic testing. functional tgsting tools. Perfbrmance testing tools.
(Jrerr ieri ot'aLitomatic tool Q-l'P : histor\'. beneflts. at()nr). rnairr pa|ts ol'Q1 lr.
B-Ye
Suggesterl Readings:
Ref'erence Books:
l. Boris Beizer. Sofltrvare Testing Techniques, Second Edition, Dreamtech.
1. F-liiiccle [)ustin. Effective Softrvare Testing, First Edition. Pearson Educatiorr.
fl\'--* (N- ,/
WfiW
W
4.o I -.
' --
PAPER CODE BCA - 605
Mobile Application Development
Course Ob.jective
The soal ol'this sLrb.iect is to understancl the different types of comr-nand Lrse fbr different purpose
in LinLtx- Urrcjerstanding tlre rnobile application technologr usin-e Andr.oid and derelop the
mobile apps bl,Android Stlldio.
Lenrning Outcomes
I. To Lutclerstand Linux f-eatLrres & their Architecture.
2. Lrsc rrl'cliltererrt comnrarrcls (Related to Fires. Directorl,. Disl<. etc.).
3. C.orrplrisorr rif iVlobilc opcrating Sl,stem lil<e Android. IOS & Windows.
4. 'l'o Lttrclet'startd Androicl API level and difl-erent version. f'eatLrres and architecture.
5. l'o ol'Android Studio fbr developing mobile apps.
Lr_se
6 i\ndroicl components and use of Java and XML file fbr developing apps.
7. -flrere are rlrany srnall apps to develop and eiecr:te on real physical mobite.
Course Coutcnts
UNIT- I
Litrux irrtt'odttctioll and f'lle system - Basic Features. Advantages, lnstalling requirement. Basic
ArchitectLrre of Unix/Linux system, Kernel, Shell., Linux standard clirectoiies. Co,rmands
tbr
flles arlcl clirectories cd, ls, cp, md, rm, mkdir, rmdir, pwd, file. lrore. less, creating and viewing
files Lrsing cat. file conrparisorrs - cmp & comm, View flles, disk related commands.
TiNIT- II
,An iittrotlLtt:tiotl to Mobile Ciorr,puting- mobile Applicatiorr Programr-ning. Diflerent platfb,rs.
Operatirrr: s)/stcms-Al'chitecture and working of Anclroid, iOS u,-,d Windoivs pho,e, Comparison
o1' Atrclroicl" iOS and Winciovvs phone, Android Development E,nvironment -Advantages
and
FLrture ol'Anclroid Arrdroid Sofirvare Developrnent Kit
lirt' I t liP....
TiNII'- III
,\rrclt'oicl Soltu'are Developrnent Platfbrm - Unclerstanding Java SE and the Dalvil< Virtual
Maclrirlc- lhe Directorl StlttctLtre of an Android Project. Common Default Resources Folders,
-fhe
\ialLrcs Folder Leveraging Android XML, Screen Sizes. Lar-rnching your Application,
UNIT. IV
Android l--ranreworl< overvien,- The Foundation of oop: The ApK File. Android Application
cionrporcrrts" Android Activities: Defining the ul. Anclroid Services: Processing in the
Baci'qroLrnci. Broadcast Receivers: Announcements andr)*otifications.
=p
\
)) --
a- "t 'c
,LL
7ry
UNIT- V
views ancl Layouts, Buttons, Menus, and Dialogs, Graphics Resources in
Android Introducing
using Bitmap, PNG, JPEG
the Drawables, [mplementing Images, core Drawable Subclasses,
Events in Android'
and CIF Images in AndroiJ. Uanatmg UI Events-An Overview of UI
Listening for and Handling Events, Touchscreen Events, Keyboard
Events' Context Menus'
l'r'i.l.i: fri-::fi:;i::; it:'i':i i\*ii"niiii*n-
Controliing the I.ocus. 1.,,'.:,,:'.. lii,;: i.ra";a !:lr:llisae:tai",. W;:r'ii!n* -"#i ':
| ;,..;-:.1,.,,: .rr:;j1. ',t:,t:;'].:.i;ia: i,,.,li.ii t-liil,,:lrii:1 :l ,r','rti i:;. ii:ir':l-,iilll-l ' ''ri' "
i':'
Suggested Readings:
Rel'erence Books
1. Professional Windows 8 Programming: Application Development with C# and XML, Allen
Sanders and Kevin Ashley, Wrox Publication
.' 1,".,,1';-, ,.,,' ,1 r ::tlilli:rirr t--rt' P':arJ**p lii;i!:a:! tii?:7 ii*c'!' llli:l'li:: 'fri:l: '31:1i'
\#, tu
>ctw
(y
L.-