BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCA " Year

VEER BAHADUR SINGH PURVANCHAL UNIVERSITY,

JAUNPUR

1987

Pafsact

EVALUATION SCHEME & SYLLABUS

(First Year)

for
Bachelor of Computer Applications
BCA
(Under Graduate Three Year Course in Computer Application)

As per
NEP 2020
(Effective from the Session: 2025-26)

To tal 19ps
Page1
BACHELOR OFCOMPUTER APPLICATIONS (Three Year Course) BCA I" Year
BCA First Year Evaluation Scheme, 2025-26
SEMESTER-I

Subject Periods Sessional Total Credit

[Link]. Subject Name ESE
Code LT P CT TA Total
Fundamentals of 3 20 10 30 70 100 4
1. NBC101
Computer 70 100
2. NBC 102 Mathematical Foundation 3 20 30
10 30 70 100
3 NBC 103 Problem Solving Using C 3 20
3
Communication Skills 3 0 20 30 70 100
4. NBC 104
3 20 0 30 70 100 3
5 NBC 105 Environment and Ecology
NBC 151
Problem Solving Using C 3 30 20 50 50 J00 2
Lab
Communication Skills Lab 3 30 20 50 50 100
7 NBC 152
15 3 6 250 450 700 22
Total

L/T/P: Lecture/Tutorial/Practical
CT:Class Test TA: Teacher Assessment

SEMESTER-II

Periods Sessional
Subject ESE Total Credit
[Link]. Subject Name LT CT TA Total
Code
20 30 70 100
1. NBC 201 DigitalElectronics 3
20 10 30 70 100
2. NBC 202 Discrete Mathematics
20 10 30 70 100
3 NBC 203 Data Structure
Professional 20 10 30 70 100 3
4. NBC 204 3 0
Communication
0 20 10 30 70 I00
5 NBC205 Information Systems
0 3 30 20 50 50 100
6 NBC 251 Data Structure Lab
Professional 30 20 50 s0 100
0
7 NBC 252 Communication Lab
0 3 100
NVA251 Sports / Yoga* 450 700 22
15 3 9 250
Total

L/T/P: Lecture/Tutorial/Practical
CT: Class Test TA: Teacher Assessment

*Non-credit Course

Page2
BACHELOROF COMPUTER APPLJCATIONS Three Year ('ourse) BCA 0st Year
BCA
FIRST YEAR SYLLABUS
SEMESTER-I
BBC101: FUNDAMENTALS OF COMPUTER
Course Outcome CO) Bloom's Knowlcdge Level (KL)
At the end of course. the student will be able to understand
CO 1 Undastad the basics of computer systemand itsfntiona units Ki, Kz
CO 2 Examine menory hierarchy, cache meory and PU merory K2
interaction.
CO3 Anayzedfferent urrber systes and aply compute aithmetc. K, K4
CO4| Undestandthe concepts of operating systems and computer networks. K:
CO5 Undestard the basics of intemet andmultimedia. Ki. K2
DETAILEDSYLLABUS
Unit Topic Proposed
Lecture
Computer: Intoduction, Chaacteistics, Limitaions Gnratons ad 08
Classification.
Hardware: Introdution, Input deices keyboard, MICR, OMR, ba
cocdereae etc.,Outpt devices -visua display unit pi ntes, plottes et.
Software: Introduction, Types- ystem ad plicatin.
Memory Unit: Introdrtion, Hiearcthy. Primay Merory. Secondary 08

mmory,Cache meory,Virtual merory.

Secondary Storage Devices: lIntrodction, Magneic dsk, Magtic t¡e
Opical disks, Fash menory etc.
Computer Languages: Introduction, Compile. Intepreter ard
Asserbler.
III Computer Codes: Introduction, Binay, Deciml, Octa, Hexadecie, 08
4-bit BCD, 8-bit BCD, ASCl codes.
Conversion of Numbers: Binary to decimal, Decimal to binary, Binary
to octal, Octal to binary, Binary to hexadecimal, etc.
Binary Arithmetic: Addion, Subtation Mutiplicaion, Division
Coplemerts of binay nurbes5.
Operating System: Definition, Functions, Types, Classification,
Irtroductiand comand basad and GUI baed opering system
Windows Operating System: Inttoduction, Elerents Use of mus
Tools and Camends.
Computer Networks- Intraduction Types - LAN, WAN and MAN,
Topologs, Daa communication.
Internet: Overview, Architectre, Histary. Functioning Apdications
Basic Services of Internet: WW. Email, FTP, Tenet, Gopher. Search
ngnes, News gop, Cha rOoms, etc.
Multimedia: Overvew, Components, Software tools, Appicions
Trarstnfromconvertiond mÍato dgta meia
Suggested Readings:
1 SinhaP.K. ardsinha P.. Computer Fundamwnals", BPB Publicatios.
2 Balagurusany E, Fundanentals of Compuiers", Tata MeGraw Hil.
3. Rajaraman V., "Fundanntas of Computers", PHL

Page 3
BACHELOROF COMPUTER APPLICATIONS (Three Year Course) BCA Ist Year
4. Leon A. and Leon M.. "ntroduction to Computers", V1kas Publ1sh1ng House.
5. Norton P., "ntmduetion to Computers". Mciraw Hill Education.
6. Gocl A.. "Conputer Fundanentals". Pearson.
7. UZ.N. and Drew M.S.. "Fundamentals of Multmeda". Pearson Fducaton,

BBC102: MATHEMATICAL FOUNDATION

Course Outcome (CO) Bloom's Knowledge Level (KL)
At the end of course,the student will be able to understand
CO 1 Describeandinterpretthe concept of deteminants admatices. Kz, K3
CO2 Undestand the concept of linear equtions. K2
CO 3 Describe differertiation nd its uses. K3, K4
CO4 Understand the concepts of differenial equation, integration and their K3, K4
ses.
CO 5 Devdop an understanding on concepts of LaplaceTransfom and Gragh K), Kz
theory.
DETAIILED SYLLABUS
Cnit Topic Proposed
Lecture
Definition, Minors, Cofactors, Properties of 08
Determinants:
Deteminarts.
Matrices: Definition, Types of Matrices, Operations on Matices
Algebra of Marices, Determinant of a Square Matix, Elemertary
trasfomations, Invese of a Square Matrix, Rank of a Marix, ,Row -
reduced Echdon form Gausiar/Gauss]ordan limination.
Linear Algebraic system: Linea dependence nd Independerce of 08
vectors, Def nition of a Vector in 2and 3 Dimensions. Consistency of
linear system of equations and their soluton, Characterisic equation,
Eigervalues Eigenvectors Cayley-Hamiton Theorem, Rank & Nulity.
Linear transfomations
Derivative,
Differential Calculus: Differentiation and derivatives:
08
II (Chain rule),
Basic laws of derivative, Successive differentiation
derivatives, Eulcr's thcorcm for
Leibnitz's Theorem, Partia
hompgeneousfunctions, Jacobian
Differentíal Equations: Linr diffeertial eqations of n order
with 08

constant coeficients, Complementary functions and particular integras.

Gama
Integral Caleulus: Integral, Integration by pats, Bea and
functions: definition ad propeties.
Ladace
Laplace Transform: Ladace transfom Existece theorenm shifting
transforn of derivatives and integrals. First shifing and second
theorems, Unit Step function, Convolution theorem
Introduction to Graph Theory: Graphs, Paths, Cycles,
Euler and
Matrix.
Harilton graphs, Connetivity, Adjacency marix, Incidence
Planar graphs.
Suggested Readings:
1 Srang G. "Caleulus", Wellesley Cambricge Press. Calculus with an
2. Apostol T.M., *Clculus, Volume 1: OneVaiable
Introduction to Linar Algebra", Wiley India.
3. Jan M.K. d lyegar S.R.K, "Conputational methods for Partial

Page 4
BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCA Ist Year

D1tterential Equatons", New Age International Publ1shers.

4. Shama G.C. and Shama 1)S. "Engineering Mathematics": CBS
Publishers.
5. Dhami H.S.,"DiferentialCalculus, New Agelntentiona Publishers.
6. Dass H.K. and Vema R. "btroduction to Engincering Mathematics
Volume I". S. Chand Publishing.
7. Dass H.K nd Vema R. "Introduction to Engincering Mathematics
Volume I", [Link] Publishing.
8 Bali N.P, and Goyal M. "ATextbook of EngineeDng Mathematics Serester
I", University Science Press.
9. Bali N.P. and Goyal M. "ATextbook of Engincering Mathematics Semester
II", University Science Press.

BBC103: PROBLEM SOLVING USING C

Course Outcome ( CO) Bloom's Knowledge Level (KL)
At the end of course,the student wil be able to understand
CO 1 Describe the functiona components and fundamerta concepts of adgitad K;, K
Compute systeminduing number systes.
CO 2 Construct flowchart and write algorithms for solving basic problems. K2, K;
CO 3 Write programs thatncoporate5eo van ables opeators nd K K;
expressions dong ith data types.,
CO 4 Write simple progrars using the basc elements like contol staements K, K,
functions, aaysard strings
CO5 Write advanced programs using the concepts of pointes, stuctues, unions K2, Ks
adenumeated cata types.
CO6 Appy pre-processor directives and bsic file haxdli ng nd gphhs K, K3
operations in advanced programng.
DETAILED SYLLABUS
Unit Topic Proposed
Lecture
Basics of progranmming: Approache to problem soving, Use of high levl
programring language for systermatic developmert of progras, Conceot of
algorithmand flowchart, Concept ndrodeof structured programing.
Basics of C: History of C, Salient features of C, Structure of C Program,
Compiling CProgram Link and RunCProgranm Chracter set, Tokers,
Keywords, Identifies, Constnts Vaiables, Instructions, Data types,
Standard Input/tut, Operators adepressions.
Conditional Program Execution: if, ifelse, and nested ifelse statements, 08
Switch satemets, Resricions on Switch vaues, Use of brek and defauit
with swtch, Compartson of switch and t-etse.
Loops and Iteration:for, while and do-while loops, Muttiple loop variables,
Nested loops, Assignment oprators, brek and coniue sttemert.
Functions: Introduction, Iypes, Declaation of a Functon, Function cdis,
Deiningtunctions, Functon Pototypes, Passing arguments to aunction
Reum vaues and ther types Writing muitifuntion program
Calling function by vdue, Recursve functions.
Arrays: Aray notaon ad rareertation, Decdanng onedmersiond aray. 08
Iniblizing arays, ACcessing aray elements Manipulating aray elerents
Arays of unknown vaying 9ze, I wo-dimensona arays,

Page 5
BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCAIst Year

Mutidimensional arays.
Pointers: Introdurtion, Chractei stics,* and & opertors, Pointe type
dedaration ad asignmert, Pointe aithmetiC, Call by reterence Passing
pointers to functons, artayot ponters, Pointers to functions, Pointer to pOnter,
Aray of pointers.
Strings: Introdution, Initilizing trings. Accessng tring dements. Array of
strings, Passing strings to functions, String functions.
Structure: Inttodxtion, Initi dizing defining nd ceclaring trudt°e, (08
Accesng merbes, Operatons on indiidua merbes, Uperabons on
structures, Strctre within structure Aray of structure, Pointes to struct°e.
Union: Introdktion, Delaing union, Usaye of unions, Operations on nion.
Enungated data types
Storage classes: Intocdction, Types- atomatic, rejste, staic and
extenal.
Searching and Sorting: 98
Intoducton to seaching and sorting, Linear search, Binay search,
Selection sort, Bubble sort.
Dynamic Memory Allocation: Introduction, Libray functions malloc,
calloc, realoc and free.
File Handling: Basics, File types, File operations, File pointer, File opening
modes, File handlirg functions, File handling through command line
aqurent, Record l/O in files.
Suggested Readings:
1 Kantkar Y. Lct us C". BPB Publications.
2 Balagusamy E. "Progran1nming with ANSI-C". Tata Meiraw Hill.
3. Harly J.R. and Koffmen E.B. "Problem Sotving and Program Design in C". Pearson
Education.
4. Gottried B.S.. "Programm1ng wnh C Languagr. Sehaum Serws. Tata Mciraw Hill.
5. Goval K. K. and Pandey H.M.. Troubie Free C", University Science Press.
6. Kermighan and Richie, C Programming". Prentice Hall of India.
7. Forouzan BA. and Gilbeg R.F. "A Structured Programming Approach UsingC, Cengage
Leaming.
8. Goyal K. K. Sharnna M. K. and Thapliyal M. P. "Concept of Coniputer and
Programnning", University Scienee Press.

BBC104: COMMUNICATION SKILLS

Course Outcome(CO) Bloom's Knowledge LeveB (KL)
Atthe end of course . the student will be able to understand
CO 1 Undestand the basic concepts of commnication ad make aware of K:
technical issues related tocommunication.
CO 2 Andyze theimportanceof effective comruncation. K, Ki
CO3 Deveop intepesond nd lexleship skills. K4
CO 4 Implenent presentation ardinteractionskiilsfor groupdiscusson, debate K4, Ks
and interviews.
CO 5 Devdop effetive speaking and writng skills. K4

DETAIILED SYLLABUS
Unit Topic Proposed

Page 6
BACHELOR OF COMPUTER APPLICATIONS (Three Sear COurse) BCA Ist Year
Lecture
Commuricion skills: Introdurtion, Definiti on, Importance f
Conmunication, Communication prOcess source, Me55aje, encoding. (8
channel, Decoding, Receiver, Feedback, Bariers to Communication, word
choice, vOcabulary buikding.
Elements of Commurication, Introduction to oral corTTuricion,
Conficdence, clarty, and fluency, verbal and Nonverbal communication. 8

E
Pardingistic fetures, proxerics, chroneTiCs.
Intepesond Courication SkilIs, Teem work, Empthy, Emotiond
intdligeces,Epathy and listening skills, Time Manajement, Atttuck
Responsibility, Lexdeship qulities-integrity, vaueS, Trust, Self (08
Confidece dcourage speed reacing, problem solving ard trouble
shooting
Presentaion and Inteacton Skills: speech civery, Group discu6sIons
objective and methods, debate and cisCussions, Publk speaking
Audience analysis proach and style Inteviews Types, Focus x
objectives.
Speding Skills: Meaning. Elements Importance and type of speaking
skills, Writing Skills- Clarity in writing, Principles of effective writing. 08

Orel presentation.
Suggested Reading:
1. Raan M, and Shama S. Tcchnical (ommunicat1on", 0xtord Univers1ty Press.
2. MehraP.."Busincss Communicationfor Managers". Pcarson.
3. Wallace H.R.. "PersonalityDevelopment for Life and Work", Cengage India PL LW.
4. Pfeiffer W.S. "Public Spcaking. Willian" Pearson.

BBCI05: ENVIRONMENT AND ECOLOGY

Course Qutcone (CO) Bloon's Knowledge Levcl (KL)
At the endof course , the student will he able to understand
processes that sustan life, and K:
CO1 Gain in-depth knowlecje on natural
goven economy.
K3
CO 2 Estimate and Predict the ConseqUences of human actions on the webof
life, global economyandquality of human Iife. K4
CO 3 Devdop critica thinking for shaping strategies (cientific, social,
economic and legal) for environmental protection and conservation of
biodiversity, social equity and sustainable development. K3
CO4 Acquire values and attitudes towards undestanding complex
ervironmental economic social challenges, and participate actively in
solving curent environmental problems and preventing the futre ones. K3
CO5 Adopt sustänability s a practiceinlife, society and indstry.
DETAIILED [Link]
Unit Topic Proposed
Lecture
Environment: Defintion, Types of Environment, Components of 08

ironmert, Segmerts of enMIOnmert, Scope and inportanc Need for

Public Awaeness.

Page 7
BACHELOROF COMPUTER APPLICATIONS (Three Year Course) BCAIst Year

Ecosystem: Definition, Types of ecosystem, Strture of ecosysten, Food

Chain, Food Web, Ecoogical pyramid. Balance Ecosysterm.
Effects of Humen Activities such s Food, Shete, Housng Agriculture
Ind1sty,Mining, Tranportation, Economic and Socia seE urityon
Enviromert. Environmenta Impat AssessTEt Sustainabie
Developert
Natural Resources: Introduction, Clssficion.
Water Resources; Avälaility. soures and Qudity Aspacts Water Bome
and Wate Induced Diseses, Fluoride and Arsenic Problers in Drinking
Water.
Mineral Resources: Mateid Cycles; Catbon, Nitrogen nd Suph°
ydes.
Energy Resources: Conventional and Non-conventional Sources of
Energy.
Forest Resources: Avalabil ity, Depletion of Forests, Environment impat
of forest depletion on society.
Pollution and their Effects: Public Health Aspects of Environmental. 08
Water Pollution, Air Pollution,Soil Pollution, Noise Pollution, Solid waste
management
IV Current Environmental Issues of Importance: Gkobal Waming, Green
House Effects, Cimate Change Acid Rain, OzZone Laye Fomaion ad
Depleion, Population GrowthandAutampbile polluion, Buming of paky
Suaw.
Environmental Protection: Environmenta Protetion Act 1986 08
Initiaivs by Noniovernmental Organizations (NGOs).
Human Population and the Environment: Population growth,
Environmental Education, Women Education.
Suggested Readings:
L Dave. Katewa and Singh. "Textbook of Environment and Ecolog". Cengagc
Leaming Inda Pvt Ltd
2. Deswal S. "Environmental Studies" Dhanpat Rai & Co.
3. AhHuwai aV.K.. Env1ronmental Stud1es TERIPress. New Delh.
4. Rajgopalan R.. "Environmcntal Studies", Oxford University Press.
5. Singh and Malviva, "Environment & Ecologv", Acme Learning.

BBC151: PROBLEM SOLVING USINGCLAB

Bloom's
Course Quteome (CO)
Knowledge
Level (KLI

At the end of course, the student will be able to

COl Write, compile debug and eeCute progras in a C programng K3

envronment

Page 8
BACHELOR OF COMPUTER APPLICATIONS (Three Year ('ourse) BCAIst Year

CO2 Write pograms that incoporate Lse of variables, operators and K3

expressions aong with data types.
CO3 Write rograms for solving problems involving use of decision conto K3
structures nd loopS.

CO4 Write programs tht invol ve the LBe of arays strctures ad usa
K3
defined functions.
COS Write prOgrams usnggraphics and file handing opeations. K3

1 Program to implemert concitiona statererts in C language

2. Programto implement swtth-case staerert in Clarguage
3. Programto implemert looping constructs in ClagLege
4. Programto pafom bsic inputoutput opeatiors in Clanguage
5. Program to implemert Se defi nad functans in C lagLage
6 Program to implement recursive functions in Clanguage.
7. Programto implerent one dimersiond aays in Clagaage
8 Program to implement two-dimensional arrays in Clanguage.
9. Program to pefom vaios opeations on twodi mensiond atays in Claguage
10. Programto implement multi-dimersiona arays in C lagage
11 Program to implement sting manipuation fundions in Clanguage.
12. Program to implerent sructure in C langage
13. ProgramtoimpleTert union in Clagage
14. Programto patom file hancdling opeaions in Clanguage
15. Programtopartomm gaphicaloperations in Claguage
Note: The Instructor may add/delete/modify experiments, wherever he/she feels in a
justified manner.

BBCI52: COMMUNICATION SKILLS ILAB

Course Outcomne (CO) Bloom's

Knowledge
Level tKL)

At the end of course, the student will be able to

Understanding of basics of listening and wrting. K:

CO1
Aware about use of reading Newspaper, joumas and magaanes K3
CO2
Develop skalis to face interviews, group discussion, debate and K+
CO3
Confterences.

Page 9
BACHEILOR OF COMPUTER APPLICATIONS (Three Year ('ourse> BCAIst Year
1 Listen and take notes of lecture, Listen ad wite appropriate works, talks on
Computers and technology.
2. Sefintroduction, Rale Play of cdebrities/ poli tici ans famoLs personalities, shaing
meorable indderts
3. Group Discusson
4, Debate and Extempore.
5. News Paper reaing Jauma reing Magazine radng
6. Face to face communication.
7. Intervievingtechniques.
|Note: The Instructor may add/delete/modify esperiments, wherever he/she feeis in a justified
manner.

Page 10
 APPLICATIONS(Three Year C'ourse)BA Ist l'ear
BACHELOR OF COMPUTER

BCA
FIRST YEAR SYLLABUS

SEMESTER-IJ
BBC201: DIGITAL ELECTRONICS
Bloom's Knowledge Level (KL)
Course Outcome ( CO)
he able to understand
Atthe end of course , the student will K3
complements ad Binay
CO 1 Appy concepts of Digital Binay System
Codes. K
adlogic gaes.
CO 2 Apply theconcepts of Boolean Algebra K2, K.
CO 3 Undestand and implementation of gaes. K+
circuits.
CO 4 Andyze andDesign of Combinationa logic K, K.
circuits with ther pdications
COS Anlysis and design sequential logic and synchronaLs
Impleert the design procedure of synchronaus
sequential circuits.

DETAILED SYLLABUS
Proposed
Unit Topic
Lecture
08
systems, Binary Numbers,
Binary Systems: Digital computers and Digital numbers, Compdeets,
N°nbe Base conversion, Octal & Hexa decimal
Binary codes. 08
II Boolean Algebra and Logic Gates:
Basic definitions, Axiomatic
Canonical
theorens and Properties, Boolean Functions,
definition, Basic
Logic Gates.
ad StandadFom5, Othe Logic Opeations, Di gitd
mehod two,three four, 08
Simplificationof Boolean Functions: The Map
ad Sum of Products
five and six variable maps, Product of Sums
implementation, Other two-level
simplification, NAND and NOR metiod,
The Tabulation
implementations. Don't-Care concitions,
Detenination ad lection of Primelmplicants
Subtactors, Code
Combinational ILogic: Design proced1re Addrs,
conversion, Andysis procedre, Multileve NAND
and NOR Circuits,
ExdusveOR and Equvalencefunctions, Binay Paralle
Adder, Deima
Adde, Magnitucecompaata, Decockes, Multiplexes.
Flip-Flops, Triggering of 08
Sequential Logic. Registers and Counters:
Reduction and
Flip-Flops, Analysis of Cocked Sequential ircuits, State
Assgment, Flipflop Excitation Tables, Design procetre Design of
Counters, Design with State Equations, Registers, Shift Registers, Ripple
Counters, Synchronous Counters, Tming Sequences.
Suggested Readings:
1 Mano M. "Digital Logic and Computer Design". Pearson.
2. Mano,M. "Digita! Design". Prentiee-Hall of Inda
and Micro-compuers, Dhanpat Rai Publicats.
3. Gaur R.K.. "Digital Elevtronics
Education.
4. Jain R.P. "Modem Digital Eiectronics", MeGraw-Hill Appicatons". MiaHill
5. Malvipo A.P. and Leach D.P,"Digtal Prnciples and
Educaian.
6. Rajaranan V. and Radhakrishana T.. "An ntroduci0n to DigitalComputer Design
PrenticeHallndaPvt Ltd

Page 11
BACHELOR OF COMPUTERAPPLICATIONS Three Year Course) BCA Ist Tear

7. GllN.S. and DiNt JB, "D1gtal Des1gn &Computer Organnzat1on". Lvers1ty Science
Press

BBC202: DISCRETE MATHEMATICS

Course Outcome ( (O) Bloom's Knowledge Level (KL)
Atthe end of course , the student will be able to understand
CO1 Use mathemtica ad logica notation to define and fomlly reson Ki, K,
about basic discrete strxtures such as Sets, Relations and Functons
CO2 Apdy mathemetical ayuments using logical connetives and quantifiers K2, K3
to check the validity of an agumert through truth tables ad propcsitonal
and predicate logic
CO 3 ldatty and prove propaties of Algeorac Sructures like Groups Rings K. Ka
and Fields
CO4 Fomulate ndsolve recurences and recursive funcions K, Ka
CO5 Apply the concet of combinaton cs to solve basic problers in discrete K, K,
mahemtics

DETAILED SYLLABU
Unit Topic Proposed
Lecture
Set Theory: Definition of sets, Venn DiagraE, proofs of some gensal 08

0dentities on sets.
Relation: Definition, types of relation, composition of relations, Pictorial
representation of relation, equivalence relation, partial ordering relation.
Function: Defnition, type of functions, one to one, into and onto function,
iverse function, composition of funcions, recursively defined funcions.
Mathematical Induction: Piano's axionns. Mathenatical Induction
Disrete Numeric Functions and Generating functions, Simpke Recurrence
relaion with constant cofficints, Linear recurence relation without
Constant coefficients.
Algebraic Structures: Propeties, Semi group, Moroid, Group Abdin
Permutation
group, Properties of group, Subgroup, Cyclic group, Cosets,
groups, Homomorphism Isomophismand Automophismof groups. logical
IV Propositional Logic: Preposition, First order logic, Basic
opeations Tatdogies Contradictiors, Algebra of Propostion, Logical
impliction, Logical equvalence Nomral foms, Inference Theory,
Predicates and quantifiers.
Ordered set, Hasse
Posets, Hasse Diagram and Lattices: Introduction,
ddagamdf patially ordered sE, Isomophic ardered set, Well ordered
st.,
Propeties of Lattices ad complerented lattices.
Suggested Readings:
1 Trertayj.P. and Manohar R. Discrete Matlhematical Structures with Application
lo Computer Science",Tata MeGraw Hill.
2. LipschZ S. ad Lipson M. "Discrete Mathenaics", Tata MeGaw Hill.
3. RosenK.H., "D1serete Matlhematics andits Applicalons", Tata McGraw Hill.
[Link] S.K. "A Textbook of Discrete Mathematics", S. Chand Pubhshng.
[Link]).K., "Discrete Mathenatics', Trinity Press.
Page 12
BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCA Ist 'ear

6 Gupta S.B. "DIscrcte Mathematcs and Structures". C'nns ersity Science Press.

BBC203: DATA STRUCTURE

Course Outeome ( CO) Bloom's Knowledge Level (KL)
At the end of course ,the student will be able to understand
CO 1 Desaribe howarays, linked lists, stacks, queUES, trees, and graphs ae
Ki, K2
represented in memory, used by the dgori thms and their common
applications.
CO 2 Discuss the computationd efficiengy of the sorting ard searching K2
algorithms. K3
CO 3 mplementation of Trees and Grahs and pefom various operations on
these data stucture.
CO 4 Undestanding the conceptof recursion, application of reCursion and its K4
implementation and remowalof recursion.
Ks, Ks
CO5 dentify the alternabve implenertationsof datastructures with respect to
is perfomance toO sove a real world problem.

DETAILED SYLLABUS

Topic Proposed
Unit
Lecture
Introduction: Basic Terminology, Elementary Data Organizaton,
Data
taeoff
Sructure opeaions, Algorithm Complxity ad Time Spaxe Singe nd
Arays: Aray Definition, Representation nd Andysis,
Muticimesional Aays, Charater Stingin C, Chaacter string opeation,
Representation
Ordered List, Sparse Matrices, and Vetors. Stadks: Aray
& Pop, Aay
ad Implementationof stack, Operations on Stacks: PushStack, Opeations
Represettion of Stack, Linked Representation of
Associated with Staks,Apdicaiors of stak:Convasion of l nfix
to Prefix
expression using stack.
and Postfix Expressions, Evaluation of postfiX Problem,
Tower of Hanoi
Recursion: Recursive definiion and processes,
tail recursion, renmoval of recursion.
implemertation of quaes, 08
Queues: Aray dlinked representation and Circula quaue
Opeations on QueLKe Crete, Add, Delete Fuiland Empty.
Representation ad
Deque and Priority QueLe Linked list
Implerenttion of Singy Linked Lists Two-way Heede
List, Travesing
ad Undeflow, Insertion and
ad Seehing of Linked List, Oveflow dobly
ddetion Algorithms,
ddetion tofrom Linked Lists Insetion nd addtion,
representation ad
linked list, Linked List in Aray, Polynamia
Generalized linked list.
tree representation, 08
III Trees: Basic teminology, Binary Trees, Binary Extended Binary Trees.
algebraic Expressions, Complete Binary Tree.
trees, Travesing Binay trees,
Aray dLinked Representation of Binay Binary trees, Hufman
Threaded Binay trees. Trversing Threaded
Sequential seach, binary seacth,
algorithm Searching ad Hashing: Collision
Hash Functions,
Comparison and analysis, Hash Table,
Resoluion Srategies, Hash Tabe Iplementdion.

Page 13
BACHELOROF (OMPUTER APPLICATIONS (Three Year (ourse) BCA Ist Year

Sorttng:Insetion Sort, Butble [Link] Sort, Two Way Mrge Sort,

Hep Sort, Sorting on Diffeent Keys. Binay Search Tree (BST):
Introduction, Insation and Deletion in BST, Corplexity of Search
Algarithm PahLnth AVL Trees, B-trees,
Multi-qraphs,
Graphs: Temindogy & Representations, Graphs &
08

Di rected Grahs, SeqLential Representtions of Grahs, AdjacencyMinimum

Matrices Traversd, ConnectedComponet ad Spanning Trees,Media File
Cost Spanning Trees. File Structures: Physica Storaje
Organization, Organization of records into Blocks, Sequential Files,
B+Treeindex
Indeing and Hashing, Primry indices, Seconcay indices,
Files, B Tree index Files, Indexing nd Hashing Conmpaisors.
Suggested Readings:
Structures using Cand (--.
1 Langsam Y., Augenstin M. and Tarnenbaum A.. "Data
Pearson Eduction Asia
2. HorOwiz E., Sahni S. and Mehta D., "Fundanmentals
of Data Structures in ((--".
Golgotha Book Source, New Delhi.
International.
3. Lipchitz S.. "Data Structures", Me-Graw Hil Structures and Analys1s of
4. Goyd K. K., Shara Sundeep & Gupta Atul. *Data
[Link] Hanillo).
Appl1cations". Tata
5. Tremblay ).P., Sores P.G. "An Introduction to Data Structures with
Mc-Graw Hill Intemational.
6. Salaria R.S.. Data Structures. Khanna Publishing Housc
Unversity Press.
7. Been A.M.. "Datastructures viaC++", Oxford
Weiss W. "Data Structures and Algorithn1 Analvsis in Ct", Pearson Education.
8 Publishing House.
Khamna
9. Patel R.B.. *Expert Dala Struetures with C",

BBC204: PROFESSIONAL COMMUNICATION

Course Qutconme ( CO) Bloom's Knowledge Level (KL)
be able to understand
At the end of cOurse , the student will Ki,K3
Communication skills.
CO1 Exhibit aequteTechricl and MasS K:
cevelopment
CO 2 Understand parts of spech and paragaph and witng skils. K3, Ks
CO 3 Demonstate effective discusson, presertation K4
and listning skils.
CO4|Devdop intepersond communication speaking projects; be schooled in K4
public
CO5 Develop contidence andclarty in presentations.
preparation andresearch skils for oral
DETAILEDSYLLABUS
Topic
Proposed
Unit Lecture
Disinction beween Gnrd And
Technica Caommnicaion: feetures
Technica Cammunicaion; Languagesatool
of commurications; Leves
Organizaional, Mas comurication;
of comunication: Intepersona, Upward, LateralHarizontal (Peer
Theflow of communiation: Downward, Comunication; Baries to
techrical
group): Importace of
Communication.
Synonyms and Antonyms;
Wars ad Phrases: Word fonation, 08
Hoophones; Selet vocabulary of about
500-1000 New Worcs; coret

Page 14
 (Three Year Course) BCA Ist Year
BACHELOR OF COMPUTER APPLICATIONS

Articles; Infinitives;
Usage all Parts of Speech; Modas: Concard:
Sertence Canstruction:
Trarsfametion of sertences; Reuisstes f
inductive, Decdutive,
Paragraph Devdapmet Tecmiques ad Methocs-
Sptia ,Linear, Chrorological tc.
Lettes: Job
Principles, Sdes & Credt letters; Clm ard Adjustment
Structure, Style
Appication ad Resumes. Rorts Types; Si grificace
& Writing of Reparts
Techrica Proposal;Pats; Types;Witingof Proposa;Sigrificace
Negotiation skills. Dimensions of
Nunces nd Modes of Delivey; Body Lanquaje
Pardinguistic
Speech Syllable; Accent Pitch Rhythm Intonation;
Types; Team
features of voice intepesona communication: Definition;
work: Attitude Way to improve Attitucde Listening Skills: Types;
Mehocs for imprOving Listening Skills.
emphasis on
Following essays from the prescribed text book with
Mechanics of writing.
() Humenistic and ScientificApproaches to Human Activity by Moohy
E. Prior
( )The Language of Literaure and Science by A. Huxley
(iii) Man nd Nature by J. Bronowski
(iv) Science and Survival by Barry Commoner
(1) The Mothe of the Sciences by AJ. Bahm
Suggested Readings:
Press.
l [Link] ChandaL. mprove vour Writing". Oxford L'niv. Univ. Press.
Oxford
2. Singh R.P., Functional skills in Language and Literature", PHI
"Communication Skills for Engineers and Scientists.
3. Sharma S..
Leaming Pvt. Ltd.
4. Shamma R.C. and Mohan K. "Business Correspondence and Report Writung.
TMH.
Banncrji- Macmillan
5. Mohan K. "Dcveloping Communicationskills", Mecra
IndaLtd

BBC205: INFORMATION SYSTEMS

Course Outcome ( CO) Bloom's Knowledge Level (KL)
At the endof course , the student will be able to understand
CO 1 Undastand the concepts of infomation systems and its types. Kz
K3
CO2 Andyze the basic structure of management infomnation system and its
relevance to infomaion systems.
CO3 Know the concets of planningand contol in an organizaion. Kz, K3
CO 4| Describevaious busness appdications of information techrologies. K2
CO5|Apply the concepts of information technology and maragement related K4
to CRM nd SCM.

DETAILED SYLLABUS
Unit Tople Proposed
Lecture

Page 15S
BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCA Ist Year

Foundation of Informatlon Systems: Intoduction to informetion

(08

system in business, fundamentals of infomaton systerns, soving

business probles with infomation systerms, Types of infomnation
systens, Effectiveness and efficiency criteria in infomation system.
An overview of Management Information Systems: Definition of a
08

managemert infomation system MIS versus Data processing, MIS &

Decision Support Systems, Concept of an MIS, Struct°e of a
Managemert infomation system
Concepts of planning & control: Concept of organizational planning, 8
The Planing Process, C¡mputationa SLpport for planing,
Characteristics of control process, The nature of control in an
organization.
Business applications of information technologv: Internet 6 letronic 08
comere, Intanet Extraned &&Enteprise Sol utions, Infommration System
for Business Opeatons Information System for Mnageial Decision
Support Infomation Systemfor Srategic Acvartage
(08
Managing Information Technology: Enterprise && globa maragemert,
Security &Ethical chall enges,Planning & Implerenting changes, CRM,
SCM.
Suggested Readings:
L o'Bricn., Makas G.M., and Behl R."Management lntormation System".
McGrawhillEducation.
2. Gordon B.D. and Margrethe H.0.. "Management Information Svstenn", TMH.
3. O'Brian. "ntroduction to Infornnation System", McGrawh1lI.
4. Murdick, "Information System for Modern Management". PHI.
5. Jawadekar W.S. and Dubey S.S.. "Managemenn Intoration System". McGrawhill.
6. Jain Sarika, "information System". PPM.
7. Kelkar S.A. "nfomationSystems - A concise Study, PHI.

BBC252: PROFESSIONAL CcOMMUNICATION LAB

Course Outcone (CO) Bloom's
Knowiedge
Level kKL)

Atthe end of course, the student willbe able to

CO1 Develop the ability to work as a team merber asan integral activity in K3
the workplace.

CO2 Increase corfidence in ther ability to real, compreherd, organize, and K4

retan witten information. Improve reeding fluency.
Write cohrent speach outines that deronstrate thar ability to use
CO3 organizationd fomts mth a speitic pupose Deliver etective Ks, K6
speeches that ae consi stert with and appropriate for the adience and
purpose.

Page 16
BACHELOR OF COMPUTER APPLICATIONS (Three Year Course) BCA Ist Year

CO4
Develop proper istening skils, artkulate and enunciate worcs and K:
sentences clearty and efficlently.

COS Show confidence anxi claríty in public speaking projects; be schoolecd ir Ks

preparaton and research skls for oral presentations.
Inteacive and Commiricaive Practica with ephasis on Oral PresentationSpoker
Camunication bsed onintenationa Phoneic Alphabets (|.PA).

LIST OF PRACTICALS

1 Group Discusson: Practical asal on Acc°teand Current Gramattal Pattems.

2.
Conversational skills for Interviews rcr sutable Professora Commuricaion Ld
condtionswith emphsis onKinesics.
3 Comrication Sklls for Seminas/ConferencesWorkshops with emphais
Pardinguistics/Kinesics.
4. Presentation Skillsof Techrica PaperProject Reports/Professional Reports basedonprope
Sress ardintonation Mehnis.
5. Offidal /Pubdic Speaking based on Rhytmic Pattems.
6. Theme Presentation Ke-Note resentation based on CoTet arqurentai
methodologjes.
7. Indvidal Speech Deli very/Conferenes with skillsto defendIntejetiors/Quizzes
8. Argumentative SkillsRdlelay Presentaion with Sress andIntoration.
9. Comprehensions Ski lis based on Reedng ard Listening Practicd on amodd Aucio-isud
Usage.

Note: The Instructor mav add/delete/modify experiments, wherever he/she feels in ajustified
manner.

BVA251:SPORTS AND YOGA

Objective of the Course:

To maintain enta and physica wellness Lpright ad eveop aility in
thestudents to cope up with the stress arising in the life.

To create spaxe in the curiculum to rurt°e the potential of the stutants in

sports/gameslyoga et.
To introdke aractice oriented introcuctory course on the subject More
ivol ved / advanced course may come up in sutsequert years of stucy.

Page 17
BACHELOR OF COMPUTER APPLICATIONS Three Year Course) BCA Ist Year

Svllabus Guidelnes

Part A: Sports/Games
Some fom of Athletics would be compulsory for all stucents, unless restricted due
to medcal /physical reasons. In addition to this, stuckent hs toopt for at least one game
out of the remaini ng mentioned blow.
Afair theoretical knowecge and a resontble amount of fild / site practice of the
chosen games wll be essential.

1. Athletics Compulsory
2. Volleyball
3. Basketball
4. Handball
5. Foottball
6. Badminton
7. Kabadd
8. Khokho
9. Table tennis
[Link]

Part B: Yoga
a. Introduction of Yoga
Introduction of Yoga Origin of Yoga Aims nd Objective of Y
oga Patanjali
Yoga darshan, Hth yoga, GherancaSamhita Kam yoga, Gyan yoga
Practices
b. Asanas, Pranavam and Meditation reguations of Asans ad
Meaning of Asans, Objective of Asans, rules and
Prarayams, Types of Yogasana
Supine posture, Prone posture,
Yogic postures: Standing Posture, Sitting posture,
baancing Postures, Pranayam according to Patanjai
and Hah Yog Meditaon
Mudras
C. Science of Yoga
medtation, stress mnagemert
Physi ological ffects of Asans Paranayama and
and Pesonali ty Deve opment
and yoga, Menta health and yoga practice, Health
GeneralGuidelines

the TimeTaleforthe activites

1. Institutes mst aEsign minimumof threepeiods in
of Sports/oga
amnimm of five choices of the
2. Institutes must provide fild/facility and ofer
GamesSpots.
instructor l yoga teRcher to mantor the
3. Institutes are reqired to provi de ports
students.

Page 18
BACHELOR OF COMPUTER APPLICATONS (TIhree Year Course) BCA Ist Year

4. Sucdent must be macde famillar with the teminologies, rules/regulations,

dimension marking of the play flelvarea and general knowleckge of nationa/
intemational level factsfigures related to the chosen game.

Assessment:

The Institute must assign coorcinator/ abjet teacher for the subjet, for every batchvgoup
activities ard keep
of the students, who would be responsible for coordinating the reqúred
watch on the levcl of studcnt's particpalion n the chosen gane.
Coordinatormentor would be responsible for the award of the sessional marks based upon
following components.
1. Leve of undestanding and general awareness (20 %)
2 Involvements in the Practice Sessions (50 %)

3. Reguaity, Sinceity and Discipline (20%)

/State level / National
4. Participation in University level / District level (10 %)
Level eerts

Page 19