Download as pdf or txt
Download as pdf or txt
You are on page 1of 32

M.G.S.

UNIVERSITY
BIKANER

SYLLABUS
SCHEME OF EXAMINATION AND
COURSES OF STUDY

FACULTY OF COMPUTER

BCA PART I EXAMINATION - 2017


BCA PART II EXAMINATION - 2018
BCA PART III EXAMINATION - 2019

‚Íÿ¸ ¬˝∑§Ê‡ÊŸ ◊ÁãŒ⁄U


ŒÊ™§¡Ë ⁄UÊ«∏ (Ÿ„UM§ ◊ʪ¸), ’Ë∑§ÊŸ⁄U z (⁄UÊ¡.)
2 / Syllabus / B.C.A.

NOTICE
1. The Ordiances Governing the examination in the Faculties of Arts,
Fine Arts, Social Sciences, Science, Commerce, Management,
Engineering, Education and Law are contained in separate book-
let. The students are advised to the same.
2. Changes in Statutes / Ordinances / Rules/ Regulations / Syllabus
and Books may from time to time, be made by amendment or
remaking, and a candidate shall, except in so far as the University
determines otherwise comply with any changes that applies to
years he has not completed at the time of change.
3. In each paper, 10 questions will be set, 2 questions from each
unit. Candidates have to answer five questions in all taking at
least one question from each unit.
4. The syllabus is given in both the languages i.e. Hindi & English,
if there is any discrepency, English version will be authentic.
5. The list of text books/ Recommended books/Reference Books
as approved by the various B.O.S. are printed along with the
English version only.
Note : The decision taken by the Academic Council shall be final.

lwpuk
1- dyk] bfrdyk] lkekftd foKku] foKku] okf.kT;] çcU/k vfHk;kfU=dh] f'k{kk ,oa fof/k
ladk; dh ijh{kkvksa ls lEc) v/;kns'k ¼vkMZusal½ i`Fkd iqfLrdkvksa esa ladfyr gSaA Nk=ksa
dks lykg nh tkrh gS fd mudksa ns[ksaA
2- le;≤ ij la'kks/ku ;k iqufuekZ.k dj vf/kfu;eksa] v/;kns'kksa] fu;eksa] fofu;eksa]
ikB~?;Øeksa o iqLrdksa esa ifjorZu dj vf/kfu;eks]a v/;kns'kks]a fu;eks]a fofu;eks]a ikB~;Øeksa o
iqLrdksa esa ifjorZu fd;k tk ldrk gS rFkk fdlh Hkh ifjorZu dks] Nk= dks ekuuk gksxk
tks ikB~?;Øe ds mu oxksZ~ ds fy, ykxw gks ftls ifjorZu ds le; iwjk ugha fd;k gks]
c'krsZ fd fo'ofo|ky; us vU;Fkk çdkj ls NwV u ns nh gksA
3- çR;sd ç'u&i= esa 9 ç'u gksaxsA ik¡p [k.Mksa esa ls çR;sd esa 3 ç'u gksaxsA Nk= dks 4 ç'uksa
ds mÙkj nsuk gksxkA ijUrq çR;sd [k.M esa ls ,d ç'u dk mÙkj vfuok;Zr% nsuk gksxkA
4- ikB~;Øe fgUnh ,oa vaxzsth nksuksa Hkk"kkvksa esa fn;k gqvk gSA ;fn dksbZ folaxfr çrhr gksrh
gS rks vaxzsth ikB~;Øe dks gh çkekf.kd ekuk tk;A
5- fofHkUu ikB~;Øe eaMyksa }kjk Loh—r ikB~;iqLrdksa] laLrqr iqLrdksa] lanHkZ iqLrdksa dh lwph
vaxzsth ikB~?;Øe esa miyC/k gSA
uksV % fo|k ifj"kn~ }kjk fy;s x;s fu.kZ; vfUre gksaxsA

© M.G.S. UNIVERSITY, BIKANER


Published by : SURYA PRAKASHAN MANDIR, BIKANER M. : 9829280717
For M.G.S. University, Bikaner
Syllabus / B.C.A. / 3

SCHEME OF EXAMINATION
The Number of paper and the maximum marks for each paper
together with the minimum marks required for a pass are shown against
each subject separately. It will be necessary for a candidate to pass in
the theory part as well as practical part of a subject/ paper, separately.
Award of Division to Successful candidates at the end of final year ex-
amination shall be as follow:
First Division 60% of the aggregate marks prescribed for
optional papers of part I, Part II and Part III
Examination, taken together (450 + 450 + 450
=1350). Marks Obtained in compulsory papers
will not be counted for award of Division.
Second Division 48%
Pass above 36%
Fail Below 36%
Admission rule to the course will be as par Government / University
policy declared from time to time.
Teaching and Examination scheme for
Bachelor in Computer Application
Part-I Exam. - 2017
Paper Name (Theory) Exam Max
Hrs. Marks
Complusory
Paper 1 General English 3 100
Paper 2 General Hindi 3 100
Paper 3 Environmenal Studies 2 100
Paper 4 Elementary Computer Application Theory 2 100
Optionl
BCA-101 Fundamental Mathematics for
Computer Application 3 50
BCA-102 Computer Fundamentals and
Office Automation 3 50
BCA-103 Interenet and Web Programming 3 50
BCA-104 Fundamentals of "C" Programming 3 50
BCA-105 Database Management System 3 50
BCA-106 Computer Architecture 3 50
Total of Theory 200
Paper Name (Practicals)
BCA-107 BCA 102 Lab 3 50
BCA-108 BCA 103 Lab 3 50
BCA-109 BCA 104 Lab 3 50
Total Practical 150
Grand Total (Theory+Practical) 450
4 / Syllabus / B.C.A.

Teaching and Examination scheme for


Bachelor in Computer Application
Part-II Exam. - 2018
Paper Name (Theory) Exam Max
Hrs. Marks
Optionl
BCA-201 Data Structure 3 50
BCA-202 OOPS With C++ 3 50
BCA-203 Computer Network 3 50
BCA-204 Operating System 3 50
BCA-205 Discrete Mathematics 3 50
BCA-206 Advanced Database Management
System 3 50
Total of Theory 300
Paper Name (Practicals)
BCA-207 BCA 201 Lab 3 50
BCA-208 BCA 204 Lab 3 50
BCA-209 BCA 204 & 206 Lab 3 50
Total Practical 150
Grand Total (Theory+Practical) 450
Teaching and Examination scheme for
Bachelor in Computer Application
Part-III Exam. - 2019
Paper Name (Theory) Exam Max
Hrs. Marks
Optionl
BCA-301 Object Oriented Software Engineering 3 50
BCA-302 Java Programming 3 50
BCA-303 Network Security 3 50
BCA-304 Advanced Web Programming 3 50
BCA-305 Computer Graphics 3 50
BCA-306 E-Commerce E-banking &
Cyber Security 3 50
Total of Theory 300
Paper Name (Practicals)
BCA-307 BCA 302 & 305 Lab 3 50
BCA-308 BCA 304 Lab 3 50
BCA-309 Project 3 50
Total Practical 150
Grand Total (Theory+Practical) 450
Syllabus / B.C.A. / 5

Note:
1. At least 3 hrs theory and 3 hrs practical stal should be assigned
per week for each paper.
2. Ten questions will be set in all papers taking two questions from
each unit. Students will have to attempt one question from each
unit.
3. Each practical exam is to be conducted by two examiners one
External and one Internal. External examiner should be senior
lecturer from jurisdiction of MGS University. External Examiner will
prepare question paper of Practical Examination. Students have to
perform exercise on computer. Exercise must be written in answer
books in proper documentation.
4. Marks distribution for Practical of 50 marks is as under
Part I and Part II Part III
Three Exercise of 5 marks each 15 marks 30 marks
(Logic 04, Execution 03, Documentation 03)
Viva-Voce 10 marks 10 marks
Laboratory Exercise File 5 marks 05 marks
Mini Project 20 marks -
4. The student has to select one of the topics given in the syllabus for
mini project
5. Marks distribution for Major Project of 50 marks is as under
a) Project Dissertation and Presentation 35 Marks
b) External Viva Voce 15 Marks

1- lkekU; fgUnh
le; 3 ?k.Vs mÙkh.kk±d % 36 iw.kkZad & 100
bdkbZ & 1
lkfgR; [k.M &
¼d½ x| Hkkx %& fu/kkZfjr jpuk,¡ %&
1- Hkkjro"kZ dh mUufr dSls gks ldrh gS & HkkjrsUnq
2- esjk thou & izsepUn
3- etnwjh vkSj izse & iw.kZ flag
4- Hkkjrh; laLÑfr dh nsua & gtkjh izlkn f}osnh
5- lksuk & egknsoh oekZ ¼js[kkfp=½
6- jk"Vªfirk egkRek xka/kh & eqfDrcks/k
7- lokyksa dh uksd ij & eksgu jkds'k
8- xfnZ'k ds fnu & xqy'ksj vgen [kku ^'kkuh*
9- fuUnk jl & gfj'kadj ijlkbZa ¼O;aX;½
10- usrk ugha ukxfjd pkfg, & jke/kkjh flag fnudj
11- vkt Hkh [kjs gSa rkykc & vuqie feJ
bdkbZ & 2
¼[k½ i| Hkkx %& fu/kkZfjr jpuk,¡ %&
6 / Syllabus / B.C.A.

1- v;ks/;kflag mik/;k; ^gfjvkS/k* & deZohj


2- eSfFkyh'kj.k xqIr & Hkwyksd dk xkSjo ¼Hkkjr&Hkkjrh½
¼Hkwyksd dk xkSjo----vkt Hkh dqN [kM+s gSAa ½
lans'k ;gk¡ eSa ugha LoxZ dk yk;k ¼lkdsr&vkBoka lxZ½
¼fut j{kk dk vf/kdkj----------mPp Qy tSlkA½
3- lw;ZdkUr f=ikBh ^fujkyk* & rksM+rh iRFkj
4- t;'kadj izlkn & v:.k ;g e/kqe; ns'k gekjk]
¼pUnzxqIr ls½
gekjk I;kjk Hkkjro"kZ
¼LdUnxqIr ls½
5- lqHknzk dqekjh pkSgku & >k¡lh dh jkuh
6- gfjoa'kjk; cPpu & iFk dh igpku
7- f'ko eaxy flag lqeu & ifjp; ¼fgYyksy ls½
8- dsnkj ukFk vxzoky & tc&tc eSaus mldks ns[kk] ;g
/kjrh ml fdlku dh
9- ukxktquZ & izsr dk c;ku
10- Hkokuh izlkn feJ & xhrQjks'k
11- rkjkizdk'k tks'kh & vk js vk ckny
12- ljy fo'kkjn & ;gh ,d nnZ] vuqHkwfr lq[k] ,d
vuqHkwfr] ifjokj ds pkj fp= ¼[kkeks'kh
ds jax ls½
bdkbZ & 3
1- la{ksi.k
2- yksdksfDr] eqgkojs
3- 'kq)hdj.k
¼d½ 'kCn 'kq)hdj.k
¼[k½ okD; 'kq)hdj.k
bdkbZ & 4
ikfjHkkf"kd 'kCn
'kCn ;qXe
iYyou
i= ¼izk:i½
bdkbZ & 5
fucU/k&fdlh Hkh fo"k; ij ikap fucU/k iwNs tk;saxs ftuesa ls ,d djuk gksxkA 10

ijh{kdksa ds fy, funsZ'k %&


1- iz'u i= bdkb;ksa esa foHkDr gksA
2- izR;sd bdkbZ ls funsZ'kkuqlkj O;k[;kRed ,oa vkykspukRed iz'u iwNs tk,¡A
3- izR;sd bdkbZ ls O;k[;kRed ,oa vkykspukRed iz'uksa dks fujUrj Øe ls iwNk
tk,A
4- ikB~;Øe esa dqN u dqN cnyko gksrk jgrk gS] vr% ijh{kd iwoZorhZ iz'u i=
Syllabus / B.C.A. / 7

dks izek.k u ekusaA


foLr`r vad foHkktu
bdkbZ & 1
¼v½ pkj O;k[;k,¡ iwNh tk;saxh ftuesa ls nks O;k[;k,¡ djuh gksaxhA
'kCn lhek & 150 vad&6 6x2¾12
¼c½ pkj vkykspukRed iz'u iwNs tk;saxs ftuesa ls nks iz'u djus gksaxsA
'kCn lhek & 250 vad&7 7x2¾14
bdkbZ & 2
¼v½ pkj O;k[;k,¡ iwNh tk;saxh ftuesa ls nks O;k[;k,¡ djuh gksaxhA
'kCn lhek & 150 vad&6 6x2¾12
¼c½ pkj vkykspukRed iz'u iwNs tk;saxs ftuesa ls nks iz'u djus gksaxsA
'kCn lhek & 250 vad&7 7x2¾14
bdkbZ & 3
¼v½ la{ksi.k 5
¼c½ yksdksfDr o eqgkojs 5
¼l½ 'kqf)dj.k %&
¼d½ 'kCn 'kqf)dj.k 5
¼[k½ okD; 'kfq)dj.k 5

bdkbZ & 4
¼v½ ikfjHkkf"kd 'kCn 4
¼c½ 'kCn ;qXe 4
¼l½ iYyou 5
¼n½ i= ¼izk:i½ 5
bdkbZ & 5
fucU/k&fdlh Hkh fo"k; ij ik¡p fucU/k iwNs tk;saxs ftuesa ls ,d djuk gksxkA 10
izkjfEHkd fgUnh
¼lkekU; fgUnh ds LFkku ij dsoy vfgUnh Hkk"kh {ks=ksa ls vk;s gq, fo|kfFkZ;ksa ds fy,½
le; & 3 ?k.Vs mÙkh.kkZad & 36 iw.kkZad & 100
ikB~;Øe %&
1- x| laxzg
¼d½ thouh & izsepUn % yegh esa tUe ,oa vfUre chekjh & ve`rjk;
¼dye dk flikgh ls½
¼[k½ vkRedFkk & viuh [kcj % ikaM;s cspu 'kekZ ^mxz* ¼^viuh [kcj* ls½
¼x½ ;k=k lkfgR; & 'kkfUrfudsru esa % jkgqy lkaÑR;k;u ¼^esjh thou
;k=k* ls½
¼?k½ x| dkO; & x|&dkO; v"Vd % fo;ksxh gfj ¼J)k d.k ls½
¼M+½ gkL;&O;aX;&,dyO; us xq# dks vaxwBk fn[kk;k% gfj'kadj
ijlkbZ¼lnkpkj dk rkcht ls½
¼p½ laLej.k & rhl cjl dk lkFkh&jkefoykl 'kekZ % ve`ryky ukxj
¼ftuds lkFk ft;k ls½
¼N½ js[kkfp= & fxYyw % egknsoh oekZ ¼^esjk ifjokj* ls½
8 / Syllabus / B.C.A.

¼t½ xks”Bh izlax&^foospuk*&okf"kZdksRlo % foospd ¼^ek/;e*] fnl-]66 ls½


¼>½ Mk;jh & izokl dh Mk;jh & dqN fof'k"V iUus % gfjoa'kjk; cPpu
¼izokl dh Mk;jh ls½
¼¥½ fVIi.kh & gkf'k, ij dqN uksV~l % xtkuu ek/ko eqfDrcks/k ¼,d
lkfgfR;d dh Mk;jh ls½
¼V½ HksaVokrkZ & Jh ckyÑ".k 'kekZ ^uohu* % iùflag 'kekZ ^deys'k* ¼eSa
buls feyk ls½
¼B½ i= & iùflag 'kekZ ds i= % la- cukjlhnkl prqoZsnh ¼ikjlukFk flag]
fo;ksxh gfj] cukjlh nkl prqonZs h] gfj'kadj 'kekZ] ia- Jhjke 'kekZ ,oa ukFkwjke
'kekZ ^'kadj* ds uke½
2- O;kdj.k % 'kCn fopkj] okD; foU;kl] okD; [k.M] in Øe dk Kku rFkk
buesa gksus okyh lkekU; =qfV;ksa dk Kku
3- ¼d½ eqgkojs ,oa yksdksfDr;ksa dk iz;ksx] okD;ksa esa fjDr LFkkuksa dh iwfrZ] leku
fn[kus okys 'kCnksa dk vFkZ] Hksn vFkok okD;ksa esa iz;ksx
¼[k½ i= ys[ku vFkok fucU/k
vad foHkktu %&
iqLrdksa ij vk/kkfjr 50 vad ¼20$15$15 ds rhu iz'u½
O;kdj.k ls lEcfU/kr 20 vad ¼5$5$5$5 ds pkj iz'u laKk] loZuke
fØ;k vkSj fo'ks"k.k laca/kh½
jpuk ls lEcfU/kr ¼d½ eqgkojs ,oa yksdksfDr;ka vkfn 10 vad
¼[k½ i= ys[ku 10 vad
¼x½ fucU/k 10 vad

GENERAL ENGLISH
M.M. 100 Duration : 3 hrs. Min. Marks 36
A. Grammar [10 Marks]
w Determiners
w Tenses and Concord
w Auxiliaries
w Prepositions
w Basic Sentence Patterns
B. Transformations [10 Marks]
w Active to Passive Voice
w Simple to Compound / Complex
w Declarative into Negative/ Interrogative
w Direct to Indirect Speech
C.Comprehension [50Marks]
w Comprehension of an Unseen Passage[10 Marks]
w Comprehension (from the following Texts): Comprehension based
Questions of 10 Marks will be asked from Prose, Short Stories, One
Act Play and Poetry each [40 Marks]
Prose
w A.P.J. Abdul Kalam: The Power of Prayer
w Martin Luther King: I have a Dream
Syllabus / B.C.A. / 9

w Albert Einstein: The World as I see it


Short Stories
w Leo Tolstoy: The Three Questions
w Ruskin Bond: A Face in the Darkness
One Act Play
w Cedric Mount: The Never Never Nest
Poetry
w R.N. Tagore : Heaven of Freedom
w John Donne : Death be not Proud
w Swami Vivekanand : Kali the Mother
Prescribed Textbook: Impressions: An Approach to English ed. by
Kamlesh S. Bhatt (Trinity)
D. Written Composition [30 Marks]
w Precis Writing [5 Marks]
w Paragraph Writing [10 Marks]
w Letter Writing(Formal and Informal)[5 Marks]
w Report Writing[10 Marks]
Suggested Readings:
Murphy, Raymond: Intermediate English Grammar ( CUP)
Huddleston, Rodney: English Grammar: An Outline (CUP)
Greenbaum, Sidney: The Oxford English Grammar (OUP)
HISTORY OF INDIAN CILIVISATION
(In lieu of compulsory subject of General Hindi an Foreign Students)
Min. pass Marks 36 Duration 3 hrs Max. Marks 100
One paper 1½ Hrs. Duration
(A) Outline of Historical Development : Indus Valley and the Aryans.
Rise of Empires-Mauryas and Gupta. Impact of Islam. The Rajput
and Akbar. The British Impact. The National Movement Gandhi and
Nehru.
(B) Social life and Cultural Heritage : Family, Caste, Education, Buddhism
and Jainism, Bhakti Movement. Literary and Art Heritage, Epics
Kalidas, Tulsida, Tagore, Sanchi Ajanta Temple Architeture, Mughal
Architecture. Rajput and Mughal Painting.
2. ELEMENTARY COMPUTER APPLICATIONS
Theory : Max. Marks: 60 Min. Passing Marks: 22
Duration: 3 Hours Practical: Max Marks 40 Minimum Marks : 15
Time: 3 Hours
Note:
Introduction to Information Technology, Generation of Computers, Types
of computers: Micro, Mini, Mainframe, Super,
Architecture of Computer System: CPU, ALU Primary Memory: RAM,
ROM, Cache memory, Secondary Memories, Input/Output device,
Pointing device.
Number System (binary, octal, decimal and hexadecimal) and their
conversions, Logic gates, Languages: machine, assembly and high level
languages including 3GL, 4GL,
Concept of Operating System, need and types of operating systems:
batch, single user, multiprocessing, and time sharing, introduction to
Windows.
10 / Syllabus / B.C.A.

Internet: Concept, email services, www, web browsers, search engines,


simple programs in HTML, type of HTML document, documents
structures: element, type and character formatting, tables, frames and
forms, Stylisheet
Computer Networking: Type of networks, LAN, MAN and WAN, concept
of topology, bridges, routers, gateways, modems, ISDN leased lines,
teleconferencing and videoconferencing.
E-Commerce: Concept of e-commerce, benefits and growth of e-
commerce, e-commerce categories, e-Governance, EDI, electronic funds
transfer on EDI networks Electronic payment system.
References:
1. Computer Fundamental By P.K. Sinha (BPB Publications)
2. Computer Made Easy For Beginners (in Hindi) By Niranjan
Bansal, Jayshri Saraogi
3. IT Tools and Applications By Satish Jain, Shashank Jain, Dr.
Madhulika Jain (BPB Publication).
4. Rapidex computer Course, Vikas Gupta, Pustak Mahal.
3. ENVIRONMENTAL STUDIES
Note.
1. The marks secured in this paper shall not be counted in awarding
the division to a candidate.
2. The candidate have to clear compulsory paper in three years.
3. Non appearing or absent in the examination of compulsory paper will
be counted a chance.
The syllables and scheme of examination is as under:
Compulsory in 1st year for all streams at undergraduate level
SCHEME OF EXAMINATION
Time 2 hrs. Max. Marks 100 Min. Pass marks 36
1. The paper will be of 100 marks.
2. There will be no practical/Field work, instead student should be aware
of ecology of local area; the question related to field work of local
area can be asked by paper setter.
3. There will be 100 questions in the paper of multiple choice, each
question of 1 mark.
4. There will be no negative marking in the assessment.
Core Module syllabus for Environmental Studies for Under
Graduate Courses of All Branches of Higher Education
Unit-1 : The multidisciplinary nature of environmental studies.
- Definition scope and awareness.
- Need for public awareness.
Unit-2 : Natural Resources :
- Renewable and non-renewable resources
- Natural resources and associated problems.
- Forest resources.
- Use and over-exploitation.
- Deforestation.
- Timber exploitation.
- Mining
Syllabus / B.C.A. / 11

- Dams and their effects on forests and tribal people.


- Water resources.
- Use and over utilization of surface and ground water.
- Floods
- Drought
- Conflicts over water
- Dams benefits and problems.
- Mineral resources.
- Use and exploitation.
- Environmental effects of extracting and using mineral resources.
- Food resources.
- World food problems.
- Changes caused by agriculture and overgrazing.
- Effects of modern agriculture.
- Fertilizer, pesticide problems.
- Water logging.
- Salinity
Energy resources :
- Growing energy needs.
- Renewable and non-renewable energy resources.
- Use of alternate energy resources.
Land resources :
- Land as a resource.
- Land degradation.
- Man induced land slides.
- Soil erosion & desertification.
Role of an individual in conservation of natural resources. Equitable
use of resources for sustainable system.
Unit-3 : Ecosystem:
- Concept of an ecosystem.
- Structure and function of an ecosystem.
- Producers, consumers and decomposers.
- Energy flow in the ecosystem.
- Ecological succession.
- Food chains, food webs and ecological pyramids.
- Introduction types, characteristic features, structure and function
of the following ecosystems.
- Forest ecosystem.
- Grassland ecosystem
- Desert ecosystem.
- Aquatic ecosystems (ponds, streams, lakes, rivers, oceans
estuaries).
Unit-4 : Biodiversity and its conservation:
- Introduction, definition and diversity at genetic, species and
ecosystem level.
- Biogeographically classification of India.
- Value of biodiversity, consumptive use productive use, social,
ethical, aesthetic and option values.
12 / Syllabus / B.C.A.

- Biodiversity at global, national & local levels.


- India as a mega-diversity nation.
- Hot-spots of biodiversity.
- Threats to biodiversity - habital loss poaching of wild life, man-wild
life conflicts.
- Endangered and endemic species of India.
- Conservation of biodiversity – In situ and Ex-situ conservation of
biodiversity.
Unit-5 : Environmental Pollution :
- Definition, causes, effect and control measures of
- Air pollution.
- Water pollution
- Soil pollution.
- Marine pollution
- Noise pollution
- Thermal pollution
- Nuclear hazards.
- Solid waste management : Causes, effects and control measures
of urban industrial wastes.
- Role of an individual in prevention of pollution.
- Disaster management : Flood, earthquake, cyclone and land
slides.
Unit-6 : Social issues and the environment :
- From unsustainable to sustainable development
- Urban problems related to energy.
- Water conservation, rain water harvesting, water shed manage-
ment.
- Settlement and rehabilitation of people, its problem of concerns.
- Environmental ethics-issues and possible solutions. Ozone layer
depletion, nuclear accidents.
- Wasteland reclamation.
- Consumerism and waste products.
- Environmental protection Act.
i. Air ( ) prevention and control of pollution Act
ii. Wild life protection Act
iii. Forest conservation Act.
- Issues involved in enforcement of environmental legislation.
- Public awareness.
Unit-7 : Human Population and the Environment :
- Population growth, variation among nations.
- Population explosion-Family welfare programme.
- Environment and Human health.
- Human rights.
- Value education.
- HIV/AIDS
- Women & child welfare.
- Role of information technology in environment and human health.
Syllabus / B.C.A. / 13

Field Work
- Visit to a local area to document environmental assets-river/forest/
grassland/ hill/ mountain.
- Visit to local polluted site- Urban/rural/industrial/agricultural.
- Study of common plants, insects. Birds.
- Study of simple ecosystem-Pond, river, hill slope etc.
Books recommended :
1 i;kZoj.k v/;;u & oekZ] xSuk] [k.Msyoky] jkor
2 i;kZoj.k foKku & ih-lh- f=osnh] xfjek xqIrk
3 i;kZoj.k v/;;u & lqjs’k vkesrk] f’kizk Hkkj}kt
4 Environmental studies - Pratap Singh, N.S. Rathore, A.N. Mathur
5 i;kZoj.k v/;;u & ckdjs] ckdjs ok/kok
6 i;kZoj.k v/;;u & eukst ;kno] vuwiek ;kno
Land resources :
Duration: 3 Hours MM: 50
BCA-101: Fundamental Mathematics
for Computer Application
UNIT I
Matrices: Basic Definitions, Matrix Operations - Transpose, Adjoint
And Inverse of a Matrix, Determinates of Matrix, Some Special Matrix
Definitions - Orthogonal, Hermetian, Skew Hermetian, Unitary, Rank
of a Matrix, Elementary Transformations, Homogeneous System of
Equations, Solution of Linear Equation Using Matrices as
Determinates by Cramer's Rule.
Unit II
Limit, Continuity, Differentiability, Differentiation - The Derivative, Higher
Derivatives of Second and Third Order, Application of Differentiation
Maxima and Minima.
Unit III
Integration: Theory of the Integral, Properties of the Definite Integral,
Methods of Integration By Substitution, By Parts, By Partial
Fractions,
Unit IV
Co-Ordinates System: Rectangular Co-Ordinates in a Plane, Distance
Between Two Points, Rectangular Co-Ordinates in Space, Elementary
Co-Ordinate Geometry, The Straight Line, General equation of a Circle,
Standard equation of a Circle.
Unit V
Vectors and Solid Geometry-Concept of Vector, Addition and
Subtraction of a Vector, Resolution of a Vector, Scalar or Dot Product
of two Vector, Vector or Cross Product of two Vectors, Equation of
Lines and Planes.
14 / Syllabus / B.C.A.

References:
1. Mathematics for Class XI NCERT
2. Mathematics for Class XII NCERT
3. Mathematics Volume I By R.D. Sharma (DanpatRai
Publication)
4. Mathematics Volume II By R.D. Sharma (DanpatRai
Publication)
Duration: 3 Hours MM: 50
BCA-102: Computer Fundamentals and Office Automation
Unit I
Historical Evolution of Computers, Characteristics, Classification and
Application of Computer, Block diagram, Basic Components of
Computer System: Central Processing Unit, Memory Unit,
Microprocessor; Various I/O Devices their Functions and
Characteristics; Types of Memory (Primary & Secondary);
Classifications of Printers; Interconnecting the Units of a Computer,
Assembly and Disassembly of PC and its various Parts, Specification
of a desktop and Laptop currently available in the market
(Specifications of processor, motherboard, memory, interface &
capacity of HDD & DVD drives, I/O ports etc); Startup Process
(Booting), BIOS Setup and its various setting, Trouble shooting for
basic computer failures.
Unit II
Need & Types of Software: System & Application software;
Programming Languages: Machine, Assembly, High Level, 4GLs,
Assemblers, Compilers and Interpreter; Objectives of Operating
System, Concept of CUI & GUI, Installation of Windows operating
System, Installation of Printer and Other Software Packages such
as Ms Office etc. Backup and Restore Operations. Features of
Windows; Various versions of Windows, Desktop, Explorer, Searching,
Recycle Bin, Settings using Control Panel, System Tools, Disk
cleanup, defragmentation, scanning for virus, Windows Accessories.
Unit III
Features of Word Processor: Create, edit, store, print documents,
Navigation of documents, cut, copy & paste, Find & replace, Different
Page Views and layouts, Alignment, formatting features, Tabs &
Indents, Inserting tables, pictures, hyperlinks, Spell checking, Macros,
Mail merge, Template, Wizards, Overview of Index and Tables.
Importing and exporting to and from various formats.
Unit IV
Features of Spreadsheet: Concept of worksheet, workbook, creating,
saving and editing a workbook, Inserting, deleting Worksheets,
Navigation in worksheets; Working with Formula & Functions
Syllabus / B.C.A. / 15

(Financial, Database, Maths, Trigonometric, Statistical etc), Cell


referencing, Format Feature, Alignment, Character styles, Date
Format; Previewing & Printing a worksheet; Goal Seeks, Pivot Table,
Creating Charts. Types of Charts, their merits and demerits; Database
in worksheet, Data organization- what-if analysis, Macro, linking and
embedding.
Unit V
Database concepts using Access, Creating Tables, Data Types,
Entering Data, Table Design, Indexing, Importing Data, Operators
and expressions, expression builder, various functions of access,
Creating Queries, Setting Relationship using Wizards, Creating
Forms, Controls and components of form, Master table and
transaction table. Join property, various join options available in
access, Creating & Printing Reports.
Power Point Presentation Package: Creating Presentation, Setting
backgrounds, layouts, Customizing, Formatting a presentation,
Adding Graphics and effects to the presentation.
References:
1. Computer Fundamental By P.K. Sinha (BPB Publications)
2. IT Tools and Applications BySatish Jain, Shashank Jain, Dr.
Madhulika Jain (BPB Publication).
3. Upgrading and Repairing PCs By Scott and Mueller, Techmedia,
New Delhi
4. Rapidex MS Office By Vikas Gupta (PustakMahal)
5. Fundamentals of Computers By Balagurusamy E, Tata McGraw-
Hill
6. Teach yourself Access. Sieglel, BPB
Duration: 3 Hours MM: 50
BCA-103: Internet and Web Programming
Unit I
Internet: Introduction to Internet, Internet Application, Internet
Protocol, TCP/IP, Getting Information on Internet, Internet Services
Provider (ISP), Addressing in Internet, Domain Names, Portals;
Electronic Mail, Advantages, How it's Works?, Anatomy of an e-mail
Message, basic of sending and receiving, E-mail Protocol, Content
of an E-mail message, Finding an E-mail Address, attachments to
E-mail. Mailing List- Subscribing, Unsubscribing, Reading and
replying, Spamming.
Unit II
PHP: Versions of PHP, Installation of PHP, Php.ini basics. Testing
Installation.Building Blocks of PHP: Variables, data types, Operators
& Expressions, Constants, Switching, Flow, Loops, Code Blocks
and Browser Output. Functions: Meaning, Calling, Defining a function.
16 / Syllabus / B.C.A.

Return value from user defined function. Testing for existence of


function. Arrays: What are arrays, Creating arrays, Array related
functions.
Unit III
Working with String, Date & Time: Formatting String with PHP, Using
Date and time Functions with PHP, Other String, Date/time Functions.
Forms: Creating simple input Form. Accessing Form input with user
defined arrays, HTML and PHP Code on a single page.
Unit IV
Cookies: Introducing Cookies, Setting Cookies, Deleting Cookies with
PHP, Session Function overview, Starting Session, Working with
Session Variables, Destroying Sessions and Unsettling variables.
Introduction to MySQL, Connecting to MySQL with PHP, Working
with MySQL Data.
Unit V
Cyber Security: Definition, cybercrime and information security,
classification of cybercrime, cybercriminals, phishing, password
cracking, keyloggers, DoS and DoS attacks, SQL Injection, Cyber
Law, The Indian IT Act, Digital Signatures and IT Act, Cyber security
and organizational implications, Cyber crisis management.
Cybercrime and Punishment, Cyberlaw Technology and Students:
Indian Scenario.
References:
1. Internet and Web Page Designing By V.K Jain (BPB)
2. Teach Yourself PHP, MYSQL &Apache ByMeloni, Pearson
Education.
3. Open Source Development with LAMP: Using Linux, Apache,
MySQL, Perl & PHP By James Lee, Pearson Education.
4. PHP: A Beginner's Guide ByVaswani, Vikram Tata Mc-Graw
Hill.
5. Cyber Security By Nina Godbole, SunitBelapure, Wiley India,
New Delhi
Duration: 3 Hours MM: 50
BCA-104 Fundamentals of 'C' Programming
Unit I
Basic concepts of programming, Characteristic, Implementation of
Algorithm, Flow Chart Symbol, Benefit and Limitations, Decision
Table, Pseudo Code. Programming Techniques: Top down, Bottom
up, Modular, Structured, Features, Merits, Demerits and their
Comparative study.
Unit II
Structure of C Program; Character Set, Tokens, Variable, Constant,
Data Types, Expressions, Operator, Precedence and Associativity of
Syllabus / B.C.A. / 17

operators, Type Conversions. Console Input-Output functions. Control


Flow: Statements and Blocks, Branching statements and Labels.
Unit III
Loop Structure: while, do while, for; Modular programming: Type of
Function, Declaration and definition, Function call, Parameter
passing, Nesting of function, Recursion, Scope of variables, Storage
classes.
Unit IV
Arrays: Declaration and use of Array, Array manipulation; Searching,
Insertion, Deletion of an element, Strings as array of characters,
Standard library string functions. Pointer: Definition, declaration,
Initialization; Accessing a variable and address of a variable, Pointer
expressions, arithmetic; Pointers and Function Arguments, Pointers
and Arrays, Dynamic memory allocation.
Unit-V
Structure, Union: Declaration and use. Programs to show the use of
structure, union.Nested Structure, Array of Structures; Concept of
Files, Text File, Binary File, Functions for File Handling; Basic Input/
Output operations on files. File Name as Command Line Argument.
References:
1. ANSI C By Balagurusamy (Tata McGrew Hill)
2. Programming with C By Byron Gottfried (Tata McGRAW HILL)
3. Working with C By YashvantKanetkar (BPB)
4. C Programming Language By Kernighan (Prentice Hall of India)
5. C Programming By R.B. Patel (Khanna Publication)
6. Let us C By YashwantKanetkar (BPB Publication)
Duration: 3 Hours MM: 50
BCA-105 Database Management System
Unit I
Introduction to DBMS: DBMS an Overview, Purpose of Database
System, Advantages of DBMS, Characteristics of Database Approach,
Data Abstraction, Levels of Abstraction, Data Models, Overview of
Network, Hierarchical, and Relational Model, Instances and Schema,
Data Independence, Architecture of DBMS, Application Programmers
and Database Administrators their function.
Unit II
Entity Relationship Model: Entity sets, attributes and keys. Tuples,
Domains, Relation and Relationship sets, Role and Structural
Constraints, Weak and Strong entity types; Entity-Relationship
Diagram, Design of an E-R Database Schema, Features of E-R Model,
Specialization and Generalization. Relational Model: Introduction to
Relational Model, Integrity constraints over relations, Enforcing Data
18 / Syllabus / B.C.A.

Integrity, Relational Data, Logical Database Design, E-R model to


Relational Model.
Unit III
Relational Algebra and Relational Calculus: Operations on Relational
Algebra, Operations on Relational Calculus, Tuple Relational Calculus,
Domain Relational Calculus.
Unit IV
Database Design: Database Design Process, Relational database
design, Relational Schema, Anomalies in a database; Functional
Dependencies: Types of functional dependencies, Closure, Canonical
Cover, Lossless Decomposition, Dependency Preservation;
Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.
Unit V
Introduction to SQL, Data Types, Operators, Components of SQL:
DDL, DML, DCL, DQL; Commands: Create, Alter, Drop, Truncate,
Insert, Update, Delete, Grant, Revoke, Commit, Savepoint, Rollback;
Basic SQL Queries, Union, Intersect and Except, Nested Queries.
References:
1. Database Management System By A. Silberschatz, Henry
F.Korth, S. Sudershan(McGraw-Hill)
2. An Introduction to Database Syatem By C.J. Date(Addision
Wesley)
3. Fundamentals of Database Systems By Elmsari and
Navathe(Addision Wesley)
4. Principals of Database Systems By J.D. Ullman(Galgotia
Publications)
5. SQL, PL/SQL By Ivan Bayross, BPB
Duration: 3 Hours MM: 50
BCA-106 Computer Architecture
Unit I
Data Representation: Data Types and Number Systems,
Complements, Binary Arithmetic, Fixed-Point Representation,
Floating Point Representation, BCD, Excess-3 Codes, Gray Code,
ASCII Codes, Unicode, Error Detection and Correcting Codes. Digital
Logic Circuits: Logic Gates, Universal Gates, Boolean Algebra.

Unit II
Map Specification; Combinational & Sequential Circuits, Half Adder
& Full Adder, Multiplexer, Demultiplexer, Encoder, Decoder, Flip-flops:
RS, D, JK & T Flip-flops, Binary Counters; Introduction to
Microprocessors and Microcontrollers: Elements of 8085
microprocessor.
Syllabus / B.C.A. / 19

Unit III
Central Processing Unit: General Register Organization, Stack
Organization, Instruction Formats, Program Control, RISC, CISC;
Addressing Mode, Data Transfer and Manipulation Basic Computer
Organization and Design: Instruction Codes, Computer Registers,
Computer Instructions, Timing and Control, Instruction Cycle, MRI.
Unit IV
Input Output Organization: Peripheral Devices, I/O Interface,
Asynchronous, Data Transfer, Modes of Data Transfer, Priority
Interrupt, Direct Memory Access, Input-Output Processor; Serial
Communication.
Unit V
Memory Organization: Classification of Semiconductor memory, Main
Memory, Auxiliary Memory, Associative Memory, Buffer, Cache
Memory, Virtual Memory. Introduction to basic computer
Programming: Assembly Language, Assembler.
References:
1. Computer System architecture By M.Morris Mano (Prentice
Hall)
2. Digital Computer Electronics By Malvino Leach, Jerald A.
Brown(McGraw Hill)
3. Digital Computer Fundamentals By Thomas C. Batree (McGraw
Hill)
BCA 107 Computer Fundamentals and Office Automation
1. Design a websity for your teacher profile.
2. Video search library.
3. Books Database search by Author Name or Accessior No.
4. General electricity bill of a customer online by fitcing previous
metareading from database and current reading rull be enthred
costomers using textbox.
5. Help from for job application.
BCA 108Internet and web Programming (Mini Project)
BCA 109 C Programming (Mini Project)
1. Design Hangman game.
2. Design calendar application.
3. Design student record system.
4. Design bus reservation system.
5. Design mathematical matrices operator (i.e. addition,
subtraction, multiplication, transpose, reverse and forward
diagonal etc.)
20 / Syllabus / B.C.A.

Teaching and Examination scheme for


Bachelor in Computer Application
Part-II Exam. - 2018
Duration: 3 Hours MM: 50
BCA-201 Data Structure
Unit I
Primitive and Composite Data Types, Time and Space Complexity of
Algorithms, Stack and Primitive Operation on Stack.Applications-
Infix, Postfix, Prefix and Recursion. Queues, Primitive Operations on
Queues, Circular Queue, De Queue and Priority Queue.
Unit II
Basic Operation on Linked List, Circular Linked List, Doubly Linked
List, Linked Representation of Stack and Queue, Application of Linked
List.
Unit III
Trees: Basic Terminology, Binary Trees, Tree Representation as Array
and Linked List, Basic Operation on Binary Tree, Traversal of Binary
Tree - In Order, Preorder, Post Order, Application of Binary Tree,
Threaded Binary Tree, B-Tree and Height Balance Tree.
Unit IV
Sequential Search, Binary Search, Insertion Sort, Selection Sort,
Quick Sort, Bubble Sort, Heap Sort, Comparison of Sorting Methods.
Unit V
Hash Table, Collision Resolution Techniques. Introduction to Graphs,
Definition, Terminology, Directed, Undirected, Weighted Graph,
Representation of Graphs, Graph Traversal - Depth First and Breadth
First, Spanning Trees, Minimum Spanning Trees, Shortest Path
Algorithm.
References:
1. Expert Data Strutcture with 'C' By R.B Patel (Khana Book
Publishing Co.(P))
2. Data structure By Lipschutz (Tata McGraw Hill)
3. Data Structure By YashvantKanitkar (BPB)
4. An Introduction to Data Structures with Applications, By Jean-
Paul tremblay, Paul G.Sarerson (Tata McGraw Hill)
5. Data Structure Using C and C++ By Yedidyahlangsam, Moshe
J.Augenstein, Arora M. Tenenbaum (Prentice- Hall India)
Duration: 3 Hours MM: 50
BCA-202 OOPS With C++
Unit I
Object oriented programming, introduction to C++ classes; Classes
and objects- classes, structure and classes, union and classes. Inline
function, scope resolution operator, static class members- static data
Syllabus / B.C.A. / 21

member, static member function, Arrays, pointers, references and


dynamic allocation; Array of objects, passing objects to function,
returning objects, object assignment, friend function and friend class.
Unit II
Constructor and destructor: Parameterized constructor, multiple
constructors in a class, Constructor with default argument, copy
constructor, Dynamic constructor, Destructor. Function and operator
overloading: definition, overloading unary and binary operator,
overloading binary operator using friend, manipulation of strings using
operators, Type conversion.

Unit III
Inheritance: Defining derived class, single inheritance, multilevel
inheritance, multiple inheritance, hierarchical inheritance, hybrid
inheritance, Pointers to object, this pointer, pointer to derived class;
Virtual function, pure virtual function, virtual base class, abstract base
class, constructor in derived class, nesting of classes, templates.
Unit IV
The C++ I/O system, basics of C++ streams, the basic stream
classes: C++ predefined streams, formatted console I/O operations
using the ios members, setting and clearing format tags, an overloaded
form to setf (), examining the formatted flags, setting all flags, using
width(), precision() and fill(); Using manipulators to format I/O, creating
your own manipulators.
Unit V
File I/O- files stream classes, opening and closing a file, reading and
writing text files, binary files I/O- Get() and Put(), Read() and write(),
More get() function, peek() and Putback(), flash(), random access,
obtaining the current file position, I/O status- customized I/O files.
References:
1. Object Oriented programming with C++ By E. Balagurusamy
(Tata McGraw Hill)
2. C++ The Complete Reference By Herbert Sehildt (Tata McGraw
Hill)
3. Object Oriented Programming with C++ By Schaum Series (Tata
McGraw Hill)
Duration: 3 Hours MM: 50
BCA-203 Computer Networks
UNIT I
Need and advantages of networks, Network topology, transmission
mode, Network categories: LAN, MAN & WAN, Network Protocols,
Hardware and Software Protocols, Digital and Analog signal, encoding
22 / Syllabus / B.C.A.

and modulating: digital to digital, analog to digital, digital to analog,


analog to analog.
Unit II
Transmission media: - guided & unguided media, Guided Media: -
Twisted Pair, Coaxial cable, optical fiber. Unguided Media: - Radio
frequency Allocation, Propagation of Radio Waves, Terrestrial
Microwaves, satellite Communication. Transmission media
performance and properties, comparative study. Transmission
Impairments: Attenuation, Distortion & Noise, Switching: - Circuit,
Packet and Message Switching.
Unit III
OSI and IEEE 802 Model, Ethernet: - Working, Principle, 10 & 100
Mbps Ethernet, Token Ring, FDDI, Comparison, Data Link Control: -
Flow control: Stop and Wait, Sliding Window. Error control: Automatic
Repeat Request (ARQ), Stop and Wait ARQ, Sliding window ARQ,
Data link control protocol: Asynchronous, synchronous, bit oriented
and character oriented.
Unit IV
Transport layer: Duties of transport layer, connection, the OSI transport
protocol, Network Technologies: - Fiber channel, ATM, SONET:
Physical configuration, SONET Layers, SONET Frames and
Applications. Network connectivity: - Hubs, Repeaters, Bridges,
Multiplexer. Internet connectivity: - Router, Gateway, CSUs/DSUs.
Modem: Transmission Rate and Modem Standards.
Unit V
Internet:- Overview of TCP/IP, IP addressing, Subnetting, Masking,
IPV6, Comparison of IPV4 & IPV6, Network Security:- Privacy,
Authentication, Integrity & Non- Repudiation, Firewall:- Benefit & type
of firewall, Cellular Telephony- Frequency Reuse Principle,
Transmission, Receiving, Handoff, Roaming, first generation, Second
generation, Third generation.
References:
1. MCSE: Networking Essentials study guide By James Chellis
(BPB)
2. Data Communications and Networking By BehrouzaForouzon
(Tata McGraw Hill Edition 2004)
3. Data and Computer Communications by William Stallings,
Pearson Education
Duration: 3 Hours MM: 50
BCA-204Operating Systems
Unit I
Introduction to Operating System: Time-Sharing, Parallel, Distributed,
Real Time Systems. System Calls, System Programs, Process
Syllabus / B.C.A. / 23

Concepts, Process Scheduling, Scheduling Criteria, Scheduling


Algorithms.
Unit II
Dead Lock: Characteristics, Method for Handling Dead Locks,
Prevention, Avoidance, Detection and Recovery, Memory
Management- Swapping, Paging- Page replace algorithm, Virtual
Memory. Concurrency control.
Unit III
Disk Structures, Disk Scheduling, Disk Management, Disk Security,
Distributed System Structures- Network Operating System, Distributed
Operating System.
Unit IV
UNIX/LINUX: Introduction File System, File and Directory Structure,
Inode and Block Storage. UNIX/LINUX commands, File Permission,
File Related Commands, Shell and Kernel. Process- Init, Getty and
Login Process, Killing, Changing Priority. Partitioning the Hard drive
for Linux, Installing the Linux system. System administration:
Managing user accounts-adding & deleting users, changing
permissions and ownerships, Creating and managing groups,
modifying group attributes.
Unit V
Creating and mounting file system, checking and monitoring system
performance file security & Permissions, becoming super user using
su. Getting system information with uname, host name. Backup and
restore files, installing and removing packages with yum rpm
command. VI Editor. Shell Script: Variables, File Name Expansions,
Shell Commands, Looping and Making Decisions.
References:
1. Operating system principals By Abraham Silverschatz, Peter
baer Galvin (john wiley and sons incorporation)
2. Operating system concepts and design By Milan MilenKovic
(Tata Mcgraw Hill)
3. Teach yourself unix By Kevin Reichard, Eric F Johnson (BPB)
4. Using unix By Philip Laplante (Jaico Publishing House)
5. Unix concept By YashwantKanetkar (BPB Publication)
Duration: 3 Hours MM: 50
BCA-205 Discrete Mathematics
UNIT I
Statements (Propositions), Logical Operations, Truth Table,
Tautologies, Contradiction, Logical Equivalence, Algebra of
Propositions, Conditional and bi-conditional Statement, Argument,
Logical Implication, Propositional Functions, Quantifiers, Negation
of Quantifiers Statements, Normal Forms.
24 / Syllabus / B.C.A.

Unit II
Integers: Properties of integers, order and inequalities, Absolute value,
Mathematical Induction, Division Algorithm, Divisibility, Primes,
Greatest Common Divisor(GCD),Euclidean Algorithm, Fundamental
Theorem of Arithmetic, congruence Relation.
Unit III
Set Theory: Sets and elements, Universal and empty set, subset,
finite and infinite sets, power sets, partitions. Class of sets, Venn
diagram, set operations, Algebra of sets, Duality Relations-
Composition of relations, Type of Relation, closure Properties,
Equivalence Relations, Partial Ordering Relation.
Unit IV
Boolean Algebra, Introduction, Basic Definition, Duality, Basic
Theorems, Boolean Algebra as Lattices, Representation Theorem,
Sum-Of-Products Form For Sets and for Boolean Algebra, Logic Gates
and Circuits, Truth Table.
Unit V
Graph Theory, Graphs and Multi Graphs, Sub Graphs, Isomorphic
and Homeomorphism Graphs, Paths, Connectivity, Various Type of
Graphs, Graph Coloring, Representation of Graph in Computer
Memory, Shortest Path Algorithm, Graph Traversal Algorithm (Depth
First Search, Breadth First Search).
References:
1. Discrete Mathematics Schaum's Series By Seymour LipSchutz,
Marc Lipson (Tata McGraw Hill)
2. Discrete Mathematics ByVinay Kumar (BPB).
3. Discrete Mathematical Structure By Dr. K.C.Jain, Dr. M.L.
Rawat.
Duration: 3 Hours MM: 50
BCA-206 Advance Database Management System
UNIT I
File Organization, Indexing and Hashing: Overview of the file
organization, techniques, Secondary Storage Devices, Operations in
files, Heap files, and Sorted files. Indexing and Hashing- Basic
Concepts: Static Hashing, Dynamic Hashing, and Extendable
Hashing. Ordered Indices, Types of single level ordered index, Other
types of Indexes. Multi-Level Indexes: B-tree Index Files, B+ - Tree
Index Files, Bitmap Index, Hash Index, RAID technology, Buffer
Management.
Unit II
Recovery: Reliability, Transactions, Reflecting, Update to the
Database and Recovery. Buffer Management, Virtual Memory and
Recovery, Disaster Recovery.
Syllabus / B.C.A. / 25

Concurrency Management: Serializability, Concurrency Control,


Locking Scheme, Dead Lock and its Resolution, Atomicity,
Concurrency and Recovery. Database Security and Integrity: Security
and Integrity Threats, Defense Mechanism.
Unit III
Introduction to PL/SQL, Advantages, Character Set, Data Types,
Control Structure, Transaction, Cursor, Locks, Error Handling,
Procedure and Functions, Triggers, granting and revoking permissions,
packages.
Unit IV
Distributed Database Management System: Components, Levels of
Data and Process Distribution, Transparency Features, Data
Fragmentation, Data Replication; Client Server Systems: Principals
Components, ODBC, ADO, JDBC, and JSQL overview; Concept of
Object Oriented Database Management System: Complex Data
Types, Structured Types and Inheritance in SQL, Array and Multiset
types in SQL, Object Identify and Reference types in SQL.
Unit V
Data Mining and Data Warehousing: Decision Support System, Data
Analysis and OLAP, Type of OLAP Servers, Data Warehouse
Architecture: Concept of Multidimensional Data Model, 3-Tier Data
Warehouse Architecture, Data Mining.
References:
1. Database System Concepts By Korth, Siterschatz, Sudarshan
(McGraw Hill)
2. An Introduction to Database Systems By Bipin C. Desai
(Galgotia Publication)
3. SQL, PL/SQL Programming By Ivan Bayross (BPB)
4. Commercial Application Development using Oracle Developer
2000 By Ivan Bayross (BPB)
BCA 207Data Structures (Mini Project)
1. Graphical representation of Bubble sort.
2. Addition of polynomials.
3. Linked representation of Stack.
4. Graphical representation of Linked List Insertion.
5. Implement DFS Algorithm.
BCA 208OOPS With C++ (Mini Project)
BCA 209 Operating System ADMS
1. Design Student Dabase using structures.
2. Graphical representation Binary Search
3. Multiprecall INter cover.
4. Hierachised Representat of y our family
5. Design Markeshut using manipulation.
26 / Syllabus / B.C.A.

Teaching and Examination scheme for


Bachelor in Computer Application
Part-III Exam. - 2019
Duration: 3 Hours MM: 100
BCA-301 Object Oriented Software Engineering
Unit I
Software Engineering: Software Engineering Problem and
approach.Software Process: Process Characteristics, Software
Process Model- Linear Sequential Model, Prototyping Model, Spiral
Model. Software Quality: McCall's Quality Factors.Software
Requirement Analysis and Specification (SRS): Need, Characteristics
and Components.
Unit II
Planning a Software Project:Cost estimation, COCOMO Model,
Project Monitoring Plan, and Risk Management.Function-Oriented
Design:Design Principles, Module level concepts- Cohesion and
Coupling, Design notations and specifications, Verification, Metrics.
Unit III
Object Oriented Design: Concepts, Design Notation and Specification,
Design methodology, metrics.
Unit IV
UML: An overview of UML- UML notations, UML Class diagrams-
association, multiplicity, generalization, aggregation, interfaces.
Unit - V
Debugging Process: Information Gathering, Fault Isolation, Fault
Confirmation, Documentation, Fixing fault isolation.Testing: Testing
Fundamental, Functional Testing (Black Box), Structural Testing
(White Box), Alpha And Beta Testing, Testing Object Oriented
Programs, Testing Process: Comparison of Different Testing, Level
of Testing. Project management for special classes of software
projects: Using CASE tools, CBSE.
Reference:
1. Software Engineering: A Practitioner's Approach by Roger S.
Pressman(McGraw Hill)
2. An Integrated Approach to Software Engineering By
PankajJalote, (Narosa Publishing House)
3. Object-Oriented SoftwareEngineering: Practical Software
Development using UML and Java By Timothy C. Lethbridge,
Robert Laganière (McGraw Hill)
4. Object-Oriented Software EngineeringUsing UML, Patterns, and
Java By Bernd Bruegge& Allen H. Dutoit(Prentice Hall)
Syllabus / B.C.A. / 27

Duration: 3 Hours MM: 50


BCA-302 Java Programming
UNIT I
C++ v/s Java, Java, Internet and www, Java Support System, Java
Environment, Java Virtual Machine, Java Program Structure, Tokens,
Constant and Variables, Data Types, Scope of Variables, Type
Casting, Operators and Expression; Conditional Statements and Loop
Statements.
Unit II
Defining a Class, Adding Variables and Methods, Creating Objects,
Accessing Class Members, Constructors, Method Overloading, Static
Member, Nesting of Methods, Inheritance: Extending a Class,
Overriding Methods, Final Variables and Methods, Abstract Methods
and Classes, Visibility Control.
Unit III
Arrays: One Dimensional and Two Dimensional, Strings, Vectors,
Wrapper Classes, Defining Interface, Extending Interface,
Implementing Interface, Accessing Interface Variables, System
Packages, Adding a Class to a Package, Using System Package,
Adding a Class Into Packages, Hiding Class.
Unit IV
Creating Threads, Extending the Threads Class, Stopping and
Blocking a Thread, Life Cycle Of a Thread, Using Thread Methods,
Thread Exceptions, Thread Priority, Synchronization, Implementing
the Runable Interface; Local and Remote Applets V/s. Applications,
Applet Life Cycle, Applet Tag, Adding Applet to HTML File; Passing
Parameters to Applets, Getting Input From User.
Unit V
AWT: AWT Classes, Working With Frame Windows, Working With
Graphics, Working With Color, Adding and Removing Controls,
Responding to Controls: Labels, Buttons, Checkbox, Checkbox Group,
Choice Control, Lists, Scroll Bars, Text Field, Text Area. Menus,
Dialog Box Handling Events;Swings: Icons and Labels, Text Field,
Buttons, Combo box; JDBC: Class Methods, JDBC Components,
Driver, Connectivity to Database, Processing Result and Interfaces.
References:
1. The Complete reference Java 2 By Patrick Naughton, Herbert
Schildt (Tata McGraw Hill)
2. Programming in JAVA By E. Balagurusamy (TMH)
3. JAVA 2 programming Black Book By Steven Holzner et al.
(Dreamtech Press)
28 / Syllabus / B.C.A.

Duration: 3 Hours MM: 50


BCA-303 Network Security
UNIT I
Introduction to security attacks, need for security, security
approaches, principals of security, types of attacks, Introduction to
cryptography, Plain text and Cipher text, Substitution techniques,
Transportation techniques, Encryption and decryption, Steganography,
Key range and key size, possible type of attacks.
UNIT II
Symmetric Key: Introduction, Symmetric key cryptography and the
problem of key distribution, Algorithm types and modes, data
encryption standards (DES), International data Encryption Algorithm
(IDEA), Advanced Encryption Standard (AES).
UNIT III
Asymmetric Key: Introduction, Asymmetric key operation, the RSA
algorithm, Comparison between Symmetric and Asymmetric key
cryptography, Digital signatures: Introduction, Message digest: idea
and requirement, digital signature techniques.
UNIT IV
Digital certificates, private key management, the PKI model, public
Key Cryptography Standards,(PKCS), Internet Security protocols:
Secure socket layer(SSL), Secure Hypertext Transfer
protocol(SHTTP), Time Stamping Protocol(TSP), Secure Electronic
transaction(SET), SSl versus SET, 3-D Secure protocol, Electronic
money, Email Security.
UNIT V
User Authentication Mechanisms: Authentication basics, Passwords,
Authentication Tokens, Certificate based Authentication, Biometric
Authentication, and Kerberos. Cryptographic solution using JAVA,
Cryptographic solution using Microsoft and .NET, Cryptographic
Toolkits, Security and operating systems. Network Security: Brief
Introduction to TCP/IP, Firewalls, IP Security, Virtual Private Networks
(VPN), Intrusion.
Reference:
1. M.A. Miller, Data and Network Communications, Thomosn
Learning.
2. Behrouz A Foruzan, Data Communication and Networking Tata
McGraw Hill.
3. Cryptographic & N/W security: Principles & Practices by Stalling,
Prentice Hall.
4. Cryptographic & N/W security by AtulKahate, Tata McGraw Hill.
5. Network Security Essentials: Applications & standards by
Stalling, Pearson Education Asia, 2003.

Duration: 3 Hours MM: 50


BCA-304 Advanced Web Programming
Unit I
Syllabus / B.C.A. / 29

Basic of the .net framework: .net Architecture, managed code,


assemblies, clr, execution of assemblies code, il, jit, net framework
class library, common type system, common language specification,
interoperability with unmanaged code. Overview C#, similarities and
differences from JAVA, Structure of C# program. Language features-
Type system, boxing and Unboxing, flow controls.
Unit II
C#: Classes, Properties, Indexers, Constructors, Inheritance,
Interfaces, Serialization, Delegates, Reflection.
Unit III
Overview of ASP.NET framework; Understanding ASP.NET Controls,
Applications Web servers, Installation of IIS. Web forms, web form
controls -server controls, client controls, web forms and HTML, Adding
controls to a web form, Buttons, Text Box, Labels, Checkbox, Radio
Buttons, List Box etc. Running a web Application, creating a multiform
web project.
Unit IV
Form Validation: Client Side Validation, Server Side Validation,
Validation Controls- Required Field, Compare, Range. Calendar
Control, Ad Rotator Control, State Management-View State, Session
State, Application State.
Unit V
Architecture Of ADO.NET, Connected and Disconnected Database,
Create Connection Using ADO.NET Object Model, Connection Class,
Command Class, DataReader Class, Data adapter Class, Dataset
Class. Display Data on Bound Controls and Gridview. Database
Accessing on Web Applications: Insert records in database, delete
and update records from database, Display a particular record and
all records on web form.
References:
1. ASP.NET 2.0 Black Book By RudrakshBatra, CharulShukla
(Dream Tech Press)
2. ASP. NET Bible By MridulaParihar and et al. (Hungry Minds,
New York)
3. Beginning C # By Karli Watson (Wrox)
4. C# By Joseph Mayo (Techmedia)
Duration: 3 Hours MM: 50
BCA-305 Computer Graphics
Unit I
Introduction to Computer Graphics: Definition, Application Areas of
Computer Graphics, Graphical User Interface (GUI), Cathode Ray
Tubes, Random Scan Displays, Raster Scan Displays (With
Introduction to Flickering, Interlacing. American Standard Video), Color
CRT Monitors, Flat Panel Displays (Plasma Panels, Liquid Crystal
Displays, Electroluminescent Displays), Graphics Software (GKS,
PHIGS), Color Models (RGB, CMY, HSV, YIQ).
30 / Syllabus / B.C.A.

Unit II
Raster Graphics Algorithms: Line Drawing Algorithms (DDA,
Bresenham's algorithm), Circle and Ellipse Drawing Algorithms, Filling
(Scan-Line Polygon fill Algorithm, Inside Outside Tests, Boundary
Fill and Flood Fill Algorithm).
Unit III
Transformations and Projections: 2-D transformations (Translation,
Rotation, Scaling, Reflection, shearing), Homogeneous Coordinate
Representation.
Unit IV
3-D transformations(Translation, Rotation, Scaling), Projections-
Parallel Projections, Perspective Projections, Bezier Curves, B-Spline
Curves.
Unit V
Two Dimensional Clipping and Visible Surface Detection Methods:
Viewing Pipeline, WINDOW and Viewport, Line Clipping (Cohen
Sutherland), Polygon Clipping(Sutherland Hodgement) Sutherland
Cohen Sub Division Algorithm, Cyrus-Beck Algorithm, Classification
of Visible Surface Detection Algorithm, Backface Algorithm, Depth
Sorting Method, Depth Buffer Method, Area Subdivision Method.
References
1. Computer Graphics By Hearn and Baker (Prentice Hall India)
2. Introduction to computer Graphics By Krihsnamurthy N (Tata
McGraw Hill Edition)
3. Theory and problems of Computer Graphics (Schaum's Outline)
By Zhigang X. and Plastock Ra. (Tata McGraw Hill).
Duration: 3 Hours MM: 50
BCA-306E-Commerce, E- Banking and Cyber Security
Unit I
E-Commerce: Benefits of E-Commerce, Impact of E-Commerce, E-
Commerce v/s Traditional Commerce, Classification of E- Commerce:
B2B, B2C, C2B, C2C; Applications of E-Commerce Technologies,
Framework of E-Commerce, E-Commerce: Securing Network
Transaction: Transaction Security, Cryptology, Cryptographic
Algorithms, Authentication Protocols, Security Protocols of Web
Commerce.
Unit II
Electronic Payment System: Introduction to Payment Systems,
Online Payment Systems, Pre-Paid Electronic Payment Systems,
Post-Paid Electronic Payment Systems; Digital Token, Smart Cards,
Credit cards, Electronic funds transfer, Risks in Electronic Payment
System, Security issues on electronic payment system, Solutions
to security issues.
Unit III
Electronic data interchange (EDI), EDI: the nuts and bolts, EDI and
Business Inter-organisational; Mobile Commerce: Introduction,
Benefits of mobile commerce. E-banking: Definition, Transaction
Syllabus / B.C.A. / 31

websites components, E-Banking support services, Wireless Banking.


E-Banking Risk: Transaction/Operation Risk, Credit Risk, Liquidity/
Internet Risk, Price Risk, Strategic Risk, Reputation Risk;
Unit IV
Cyber Crime: Definition, Cybercrime and Information
security;Classification of cybercrime: E-Mail Spoofing, Spamming,
Cyber defamation, Forgery, Hacking, Online Frauds, Pornographic
Offenses, Software Piracy, E-Mail Bombing/Mail Bombs, Computer
Network Intrusions, Password Sniffing, Identity Theft, Frauds in
Mobile; Password Cracking, Keyloggers, DoS and DDoS Attacks.
Unit V
Cyberlaw: The Indian Context, The Indian IT Act, Amendments to the
Indian IT Act, Cybercrime and Punishment, Cyberlaw, Technology
and Students: Indian Scenario. Background of Cyberforensics, Digital
Forensics Science.The Need for Computer Forensics, Cyberforensics
and Digital Evidance, Forensics Analysis of Email, Security/Privacy
Threats.
References:-
1. Developing E-Commerce Systems by Jim A. Carter PHI.
2. E-Commerce new vistas for business by T.N. Chandra, R.K.
Suri, SanjivVerma, DhanpatRai& Co.
3. Mark O' Neill "Web Services Security", McGraw Hill.
4. Nixon Brian "Teach yourself E-Banking", SAMS.
5. E-Banking: Global Perspective by Vivek Gupta, Edition June
2000, ICFAI Univer Press.
BCA-309 PROJECT
Practical Training and Project Work:
1. Project Work may be done individually or in groups in case of
bigger projects. However if project is done in group each student
must be given a responsibility for a distinct module and care should
be taken to monitor the individual student.
2. Project Work can be carried out in the college or outside with
prior permission of college.
3. The Student must submit a synopsis of the project report to the
college for approval. The Project guide can accept the project or
suggest modification for resubmission. Only on acceptance of draft
project report the student should make the final copies.
Submission Copy:
The Student should submit spiral bound copy of the project report.
Format of the Project:
(a) Paper:
The Report shall be typed on White Paper of A4 size.
(b) Final Submission:
The Report to be submitted must be original.
(c) Typing:
Font:- Times New Roman
Heading:- 16 pt., Bold
Subheading:- 14 pt, Bold
32 / Syllabus / B.C.A.

Content:- 12 pt.
Line Spacing:- 1.5 line.
Typing Side :-One Side
Font Color:- Black.
(d) Margins:
The typing must be done in the following margin:
Left : 0.75"
Right: 0.75"
Top: 1"
Bottom: 1"
Left Gutter: 0.5"
(e) Binding:
The report shall be Spiral Bound.
(f) Title Cover:
The Title cover should contain the following details:
Top: Project Title in block capitals of 16pt.
Centre: Name of project developer's and Guide name.
Bottom: Name of the university, Year of submission all in block
capitals of 14pt letters on separate lines with proper spacing
and centering.
(g) Blank sheets:
At the beginning and end of the report, two white blank papers
should be provided, one for the Purpose of Binding and other
to be left blank.
(h) Content:
I). Acknowledgement
II). Institute/College/Organization certificate where the project
is being developed.
III). Table of contents
IV). A brief overview of project
V). Profiles of problem assigned
VI). Study of Existing System
VII). System Requirement
VIII). Project plan
o Team Structure
o Development Schedule
o Programming language and Development Tools
IX). Requirement Specification
X). Design
o Detailed DFD's and Structure Diagram
o Data structure, Database and File Specification
X). Project Legacy
o Current Status of project
o Remaining Areas of concern
o Technical and Managerial Lessons Learnt
o Future Recommendations
XI). Nomenclature and Abbreviations.
XII). Bibliography
XIII). Source Code.

You might also like