Kristu Jayanti: College

Curriculum for 2020 Bachelor of Computer Applications
00CS02
Kristu Jayanti College

AUTONOMOUS
Re-acer ditcd 'A' Grade by NAAC
Bengaluru ■
Affilintcd to Bcnga1uru North University
Bachelor of Computer Applications

Curriculum - 2020 Batch
Page 1 of 104
00CS02
CURRICULUM OWR\l'IBW
1. Programme Educational Objectives
PEOl: To empower the students with current trends in the domains of computation and
programming.
PEO2: To update the students with cross cutting technology, software tools and applications.
PEO3: To nurture the students with employability skills and professional ethics.
la. Pro_gramme Outcome
After the successful completion of three year Bachelor of Computer Applications programme, the graduate
will be able to:
POI: apply professional and social skills to cater to the needs of the industry, society and global
scientific community.
2b. Programme Specific Outcomes
After the successful completion of three year Bachelor of Computer Applications programme, the graduate
will be able to:
PSO 1: appraise the current trends of knowledge in domains of computational sciences
PSO2: apply professional skills to solve problems in global computer applications industry
PSO3: develop software to cater to the needs of the organisation, nation and region
'Specialization:
Discipline Specific Elective Courses offered during the V and VI Semester may lead to specialization in
Data Analytics.
3. Eligibility
A student should have passed 10 + 2 or equivalent academic stream.
4. Credits Distribution Table
A student has to earn a total of 144 credits for successful completion of the Bachelor of
Computer A.PPI'1cat10ns
. programme.
Course Course No of Total
Course Description Semester
Part Type Credits Courses Credits
AECC 1 : General English 3 4 12 I, II, III, IV
AECC2:MIL 3 2 6 I, II
I ABC
AECC 3: Environmental Science 2 1 2 II
SEC 2 1 2 IV
DSCC 4 17 68 I, II, III, IV,V,VI
DSCL 2 7 14 I, II, III, V
DSC 2 2 4 IV,V
II DSCP
4 1 4 VI
DSCI - - - -
DSCF - - - -
DSEC 4 4 16 V, VI
DSEL 2 4 8 V, VI
III EC DSEP - - - -
DSEI - - - -
GE 4 1 4 IV
LSE 2 1 2 IV
IV NCCC
EEC 2 I 2 V
Note:
► Students failing to earn two credits through LSE before the commencement of the fourth Semester will have reappear
status depicted in their fourth Semester marks card.
� I CIPAL
FACULTY OF SCIENCE Krisn, Ja'1anti o!lege Autonomous
l<RISTU JAYANTI COLLEGE AU{ONOMOUS K. Narayanapura, t<othtJnur PO
Bengaturu Page• 2560077
of 104
K. Narayanapura, Kothanur PO
Bengafuru • 560077
00CS02
► Students failing to earn two credits through EEC before the commencement of the fifth Semester will have
reappear status depicted in their fifth Semester marks card.
► Students failing to earn the respective credits in Part IV during their UG programme will not have pass status and
are not eligible for graduation.
5. Nature of Course
The courses offered for the UG programme fall under any one of the following four categories:
I. Core Course: A course, which should compulsorily be studied by a student. It can be:
• Discipline Specific Core Course (DSCC)
• Discipline Specific Core Practical (DSCL)
• Discipline Specific Core Project (DSCP)
• Discipline Specific Core Internship (DSCI)
• Discipline Specific Core Fieldwork (DSCF)
II. Elective Course: Generally a course which can be chosen from a pool of courses. It can be:
• Discipline Specific Elective Course (DSEC)
• Discipline Specific Elective Practical (DSEL)
• Discipline Specific Elective Project (DSEP)
• Discipline Specific Elective Internship (DSEI)
• Discipline Specific Elective Fieldwork (DSEF)
These elective courses are chosen generally from a pool of courses specific to the
discipline of study.
• Generic Elective (GE) Course: An elective course other than the main discipline of study
is called a Generic Elective. It is offered during the IV Semester for UG programmes
(Guidelines are given in Annexure IV).
III. Ability Enhancement Course (AEC)
The Ability Enhancement Course (AEC) is of too types:
• Ability Enhancement Compulsory Course (AECC):
They include
1. Environmental Science: The "Environmental Science" Ability Enhancement
Compulsory Course of the Under Graduate programme will be held in the following
schedule.
BAI B.Sc./ BCA - During second Semester.
B.Com./ BBA - During third Semester.
2. General English and English Communication
3. Modern Indian Language (MIL): The institution offers Kannada, Hindi and
Additional English under MIL.
• Skill Enhancement Course (SEC): SEC is value-based and/or skill-based and
aims for providing hands-on-training, competencies, skills, etc.
IV. Non-CGPA Credit Courses (NCCC):
These courses are co-curricular and extra-curricular activity based courses. It is mandatory that a
student earns four credits through NCCC. It comprises of
• Life Skills Education (LSE - Guidelines are given in Annexure II)
• Extra-curricular and Extension Activities (EEC - Guidelines are given in Annexure III)
Students earn two credits through LSE during the first Semester. In addition, all students should
take part in extension/ extra-curricular activities (NSS, NCC, Center for Social Activities and
specified extra-curricular activities) for earning two credits as part of EEC before completion of the
fourth Semester.
� R NCIPAL
HOD. ornputer Science . ollege Autonomous
Kristu Jayant1 College Autonornous FACULTY OF SCIENCE Kristu Ja'}an
PO
K. Nara,-zna�ura KRIS TU JAYMlTI COL L::s� AUTONOMOUS )(. Narny,u,ap\.!_ra, Kothanur
82riQt1lore - 560 077 K. t°i' <i :' . ..,..,.\,.i::i "�'.h2!HJr PO Bengtl!un.1 - 560077
Page 3 of 104
bt:i :J,i.11u - 5e�Q77

00CS02
. Eli ibili Conditions for End Semester Examinati n

. Admission procedures done and admission eligibility documents submitted on time.
• Minimum 85% attendance for each course .
• Applied for the End Semester Examination and paid the Examination Fee on time.
• No disciplinary complaints from the Class Animator/ HOD/ Dean/ COE/ Management.
NOTE:
Students who fail to apply for the End Semester Examination (by submitting the appropriate form
and paying examination fee on the scheduled dates given in the calendar) shall not be allowed to
appear for the examination and shall not be promoted to the subsequent Semester of the
programme.
ii. Academic Performance Evaluation

Students' academic performance is based on
a) Continuous Internal Evaluation (CIE)
b) End Semester/ Trimester Examination (ESE/ ETE)
a) Continuous Internal Evaluation (CIE)
• Perfom1ance in Mid Term Examination
• Assignment
• Attendance
• Record work/ Class work
Mid Term Examination
The examination will be held for two hours and the question paper will be of fifty marks. The
marks secured by the student shall be scaled down to the corresponding ·· CIE Term Exam
component mark.
Assignment
UG student has to submit one assignment per course in a Semester as per the schedule
announced in the Examination Calendar. Maximum marks for the assignment CIE component
depends on the credits allotted and the nature of the course.
Attendance
The attendance CIE component marks are awarded as per the data given below:
If attendance is in the range 95% - 100% assign 5 marks out of 5
Record work/ Class work
Record work/class work CIE component marks are awarded for practical courses and maximum
marks awarded depend on the credits allotted and the nature of the course (Refer Table Il for
details).
b) End Semester Examination (ESE)
The schedule for End Semester Examination is given in the Examination Calendar. The time table
of ESE will be notified three weeks before the examination (Guidelines for Question Paper pattern
are given in Annexure V).
. .
(
FACULTY OF SCIENCE Kristu Ja·ianti ollege Autonomous

HOO, De Co�put�r Scier,�e KRISTU JAYANTI COLLEGE AUTONOMO
Kristu Jayanti College Autono,11: u s
US K. Narayanapura, Kothanur PO
K. NarnyanJpurJ, Kolhanur PO Bengnluru • 560077
K. Narayan2pura Beilg:::luru - 560077
Banc2 ore - 56u 077
1 Page 4 of 104
00CS02
The duration and total marks of the examination will vary according to the nature of course and
credits allotted (Refer Table I for details).
Table I: Duration and Total Marks of the Examination according to the nature of course and credits allotted.
Course Credits Duration of ESE Total Marks

4 Credits (Theory) 3 Hours 70
3 Credits (Theory) 2½ Hours 50
2 Credits (Theory) 2 Hours 35
4 Credits (Practical) 4 Hours 70
2 Credits (Practical) 3 Hours 35
1 Credit (Practical) 2 Hours 20
Continuous Internal Evaluation (CIE) and End Semester Examination (ESE) Marks
distribution for students is given below in Table II.
Table II: Continuous Intemal Evaluation and End Semester Examination Marks distribution.
Continuous Internal Evaluation

_g
e�
'"'= (CIE) �
Q,)
rn ;.< I.
�
=
I. ,-...
� r.l r.l
=
rn
u
....
0
.....rn e� ..... Q,)
rn
� � I. 00
�E:!,
�
�i
=6Q,) Project
e=
CJ
= r:e �
Q,) Q,)
� �
0 �
u
= Review �
u r.l
I.
"O
e'"'
Q,) i.. 1:).1)
I.
-;
=
Q,) � Q,)
.....0
1:).1)
.....� •;;j Q,) 00 � I.
z < <t::
rn 1:).1)
"O
<
Q,) CJ .t).I)
�
I n �
�
r.l
3 15 - - 5 5 - 25 50 75
AECC - - - -
2 10 5 15 35 50
2 10 - - - 5 - 15 35 50
DSCC/DSEC 3 15 - - 5 5 - 25 50 75
4 15 - - 10 5 - 30 70 100
DSCL/ 1 - - - - - 5 5 20 25
DSEL 2 10 - - - - 5 15 35 50
I - 5 - - - - 5 20 25
DSCP/ 2 - 5 10 - - - 15 35 50
DSEP 4 - 15 15 - - - 30 70 100
6 - 25 25 - - - 50 100 150
DSCI 2 - - - - - - 15 35 50
GE-Theory 4 15 - - 10 5 - 30 70 100
GE - Practical 4 15 - - - 5 10 30 70 100
SEC-Theory 2 - - IO 5 - 15 35 50
2 IO - - - 5 15 35 50
:uC· - :::) �
SEC - Practical
(
'
�
� A
� � pG:;AL -
HOD, De omputer Scieri:8
Kr:'.:.:� Jaya!ltl Col:-:�e Autc,n,:,ri·: �5
FACULTY OF SCIENCE Kristu Ja·;anti College Autonomous
K. Nar;:;;?.n3;)L.ra
KRISTU JAYANTI COLLEGE AUTONOMOUS K. Narnyanapura, Kothanur PO
K. Narayan:ipurt1, Kothanur PO BengaluruPage- 5600 77
5 of 104
82.nr.:::'•�r,:; - 5G0 077
8eng:3luru - 560077
00CS02
Passing Criteria
*No minimum pass mark for CIE
* ESE (End Semester Examination) alone 35% (25 marks out of70/ 18 marks out of50)
*(ESE+ CIE) aggregate 40% (40 marks out of 100/ 30 marks out of75)
Pass Status for a Programme

The student must acquire the total number ofcredits allotted for the programme for achieving the degree.
The total credits include Academic credits and NCCC.
. SGPA CGPA and Gradin T=-a...b...le_____________________

The individual Semester marks card will have the marks, grade, total credits awarded and grade point
average details.
• Grade Point: It is a numerical weight allotted to each letter grade on a 10-point scale.
• Credit Point: It is the product ofgrade point and number ofcredits for a course.
• Semester Grade Point Average (SGPA): It is a measure ofperfonnance/ work done in a Semester.
It is ratio oftotal credit points secured by a student in various courses registered in a Semester and
the total course credits taken during that Semester. It is depicted in Semester marks card.
• SGPA (Semester Grade Point Average)
SGPA = I(Grade Point x Credit) / Total No. ofCredits
• CGPA (Cumulative Grade Point Average)
CGPA = I(Si x Ti) I ITi where Si denote the SGPA for the i th Semester and Ti denote the
Total Credits ofthe ith Semester, (value ofi can ranges from 1 to 6).
Table ill: Ten Point Grading Table
Grade Point Interpretation Table Result Interpretation Table

Grade
Percentage Grade Interpretation Percentage Class / Result
Point
90-100 0 10.00 Outstanding 80 & Above · Distinction
80-89 E 9.00 Excellent > 60 and< 80 First Class
70-79 A+ 8.00 Very Good > 50 and< 60 Second Class
60-69 A 7.00 Good ;::: 40 and< 50 Pass Class
50-59 B 6.00 Average Less than 40 /
Reappear
40-49 p 5.00 Pass Absent
Less than 40 F 0.00 Reappear
Absent AB 0.00 Reappear
9. Curriculum Enrichment
The major academic activities are as follows.
► Conference: National Conference organized by Computer Science Department. The students
gain a better understanding ofthe latest trends in computational science.
Jk
HOD, :�ter Science
ffh�
�AN
FACULTY OF SCIENCE
��(5;
��=> �
P�PAL
Kristu Ja·1anti College Auton
omous
anur PO
Knstu Jayanti College Au:.:.. ·: ":. � KRISTU JAYANTI COi LEGE AUTONOMOUS K. Narayanapura, Koth
K. Na:3y2'l:1;:iurJ K. Narayanapu;a, Kothanur PO Bengaluru - 560077
Page 6 of 104
83n,:::'_::·� _ :-3 ..· ,J. ?
1
Bengal:.iru · 560077
00CS02
► Orientation Programmes: Orientation is offered at the beginning of the programme. It

includes sessions as mentioned below:
• Jayantian Code of Conduct
• Introduction to the BCA Programme and Syllabus
• Soft Skills Training
• Basic Computing
• Basic Electronics
• Introduction to Programming
► Bridge Courses: Bridge courses are offered in order to cope up with the syllabus of the
programme. The following bridge courses are offered.
• Basic Mathematics
• Project Designing Tools
► Value Added Courses - To provide students with an understanding of the expectations of

industry and to improve the employability skills, the following courses are offered:
• Basic HTML and XML
• Advanced Excel
• PL/SQL & Database Connectivity
• ASP.NET
• Quantitative Aptitude and Numerical Ability
• Research Methodology
► Certificate Programmes:- A certificate is earned by a student upon completion of a course in

a particular subject, this helps to develop career competency in a subject. The students can take
any of the following courses:
• Infonnation Storage Management (Dell EMC)
• Salesforce Certification
• RPA(Robotic Process Automation)
• Google Analytics for beginners - Online course offer(?d by Google Analytics
Academy
• Advance Google analytics - Online course offered by Google Analytics Academy
• Java Programming - Online course offered by Oracle Academy
• Cyber Security - Online course offered by Palo Alto Networks
► Add on Courses:- It gives students an experiential opportunity to learn in real world context
and a platform to widen their knowledge. The following Add on Courses are offered:
• Cloud Computing Fundamentals
• Introduction to Data Science
• Basics of Python Programming
,k
12:=)
��
c;,
�CIP.0..L -
Auton om ous
HOD,,O ent of Computer &;eric� FACULTY OF SCIENCE Kristu Ja•;anti College
ur PO
Kristu Jayant, ColiE-ge .4.ut-:�,,::;•'.':�:i KRIS TU JAYANTI COLLEGE AUTONOMOUS K. Narnyanapura, Kothan
Bengaluru • 560077
K. Narayan.:J;)ur3 K. Narayanapura. Kothanur PO
82=-,c;�!,Jre - 560 Uri Beng::luru • 560077
Page 7 of 104
00CS02
► Co-Curricular Activities: Computer Academy organizes various activities to build

capabilities in students. The following are the Co-Curricular Activities.
• Synchronize: Intra Collegiate IT Fest
• Xactitude: Inter Collegiate IT Fest
• Galaxia: Science Exhibition
• Industrial Visit
• Guest Lecture
• Workshop/Seminar
• ACM W -Student Chapter Activities
► Skill Development Activities: The "Computer Academy" of the department offers provision
for the students to be a part of the different Technical Communities which aim at skill
development in the respective domain.
To address the contemporary requirement in the IT, the Technical Community has been
categorized into two levels; Common Interest Groups & Knowledge Kindle Groups. All
students should be a part of any one of the Technical Community.
Common Interest Groups Knowlede:e Kindle Groups

Coding and Debu!!!!ing Data Analvtics
IT Quiz Cloud Comouting
IT Manager Network Securitv
Electronics !OT-Internet of Things
Mathematics Machine Learning
Statistics IT Administration
Designing Virtualization
Event Management Contemoorarv Pro!rramming
► Jayantian Extension Services: Students are encouraged to participate and contribute in a

way to express their concern and solidarity towards the society by being part of the activities
organized by
• National Service Scheme (NSS)
• National Cadet Corps (NCC)
• Centre for Social Activities (CSA)
• Social Outreach Programme (SOP)
-��Ji:;1t-�
HOD, Depart -=n of Computer Scierice P CIPAL
FACULTY OF SCIENCE Kristu Ja•,antl College Autonomous
Kr1s!v Jayanti College Autoriomc,u5 KRIS TU JAYANTI COLLEGE AUTONOMOUS
K. t�aray2ria;:,ura K. Narnyanapura, Kothanur PO
P.·-·
-<'· ..•
.. : ,.,_ , - r.,,::
,.. ,-. p71 Bengaluru · 560077
·• " , 1
Page 8 of 104
00CS02
nnexure I
Implementation of Outcome Based Education - UG Programme
A systematic, meticulous and stringent mechanism of Outcome Based Education (OBE) is followed
with total focus on measurement of student perfonnance through outcomes. Due weightage is given for
graduate perfonnance in the realms of knowledge, skills and attitude in order to ensure holistic
development, the educational philosophy of the institution.
1. Definitions
1.1 Graduate Attributes
The level of understanding, knowledge comprehension, skill development, competencies, attitudinal
formation that the students of the institute have to imbibe during their education are tenned as Graduate
Attributes.
1.2 Programme Educational Objectives
The objectives that the students are expected to attain after the successful completion of the programme
are tenned as Programme Educational Objectives. PEOs are drawn from the vision and mission of the
institution. They highlight the academic and professional accomplishments expected to be achieved.
1.3 Programme Outcomes
Programme Outcomes (POs) are the quantified and measurable results that are expected to be achieved
by each and every student towards the end of the programme. In simple terms these are the graduate
attributes that the students are expected to attain at the completion of the programme.
1.4 Course Outcomes
Course Outcomes (COs) are the quantified and measurable results that are expected to be achieved by
each and every student on completion of each and every course. COs are specific to each and every
course in a program.
2. OBE Implementation Process
The OBE implementation comprises of the following process:
2.1 The OBE committee in consonance with IQAC ensures that the PEOs are in tandem with
the vision, mission and Universal Graduate Attributes.
2.2 The POs and COs are defined by the department guided by the respective Deans.
2.3 COs are framed using Bloom's Taxonomy specifying the different sub-domains of
learning. The departments implement the necessary teaching-learning process and skill
development activities for the fulfillment of these outcomes.
2.4 OBE system is reviewed during the annual feedback from stakeholders.
3. Mapping and Computation of Attainment Level
The implementation of OBE is complete with mapping and attainment level computation.
i) Course outcomes are mapped with programme outcomes. One CO is mapped with more
than one PO and vice versa.
ii) The department ensures that all the COs are sufficient to measure the attainment level of
POs.
iii) The attainment is measured at the programme and course level. Benchmarks are set for
PO and CO attainment.
iv) Attainment of course outcome is measured using two attainment indicators: CO
attainment indicator 1 and CO attainment indicator 2.
• CO attainment indicator 1 measures the attainment levels of outcomes of every course based on
the average scores of a batch of students across all the course outcomes of a particular course. It is
based on average marks secured by the students.
• CO attainment indicator 2 measures the attainment at course level based on the percentage of
students of a batch attaining the course outcomes across all the courses of a particular programme.
Ak �a:-�-_:_;
>
HOD. D�ter Scii:n�e � P CIPAL

Kristu Jayant1 College Au!o,,0,T·: ... s FACULTY OF SCIENCE Kristu Ja•,anti College Autonomous
K. Narayanapura KRISTU JAYANTI COLLEGE AUTONOMOUS K. Narayanapura, Kothanur PO
8<!::•::2.!ore - :60 077 K. Nara\1 :1napura, Kothanur PO Bcngalun.J Page
• 560077
9 of 104
Bengaluru - 560077
00CS02
3.1 Computation of CO Attainment for UG Programmes

Course Outcome Attainment Indicator 1 for UG programmes is shown in the given table.
Table 1: Course Outcome Attainment Indicator 1
Attainment Levels
Attainment Status
( Percentage of marks)
Level3 More than 55% Attained
Level 2 between 50% and 55% Attained
Level 1 Less than 50% Not Attained
Interpretation
Level3: Average score of above 55% in course outcomes of a particular course
Level 2: Average score of above 50% and upto 55% in course outcomes ofa particular course
Level 1: Average score of less than 50% in course outcomes of a particular course
Course Outcome Attainment Indicator 2 for UG programmes is shown in the given table.
Table 2: Course Outcome Attainment Indicator 2
Attainment Levels Attainment
(Percentage or students) Status
Level A More than 90% Attained
Level B More than 80% Attained
Level C More than 70% Attained
Level D More than 60% Attained
LevelE More than 50% Attained
LevelF Less than 50% Not Attained
Interpretation of CO Attainment Levels (UG):
Level A -More than 90% ofthe students have attained the COs of a particular course
Level B -More than 80% ofthe students have attained the COs ofa particular course
Level C -More than 70% ofthe students have attained the COs ofa particular course
Level D -More than 60% ofthe students have attained the COs of a particular course
LevelE-More than 50% ofthe students have attained the COs ofa particular course
LevelF - COs ofa particular course have not been attained
3.2 Computation of PO attainment of UG Programmes
PO attainment is measured as the average percentage ofmarks obtained by all the students across all the
courses ofthe programme that are mapped to a particular PO. The attainment of programme outcomes is
indicated at three levels. Table3 depicts the various levels ofPO attainment in UG programmes.
Table3: Levels ofPO Attammen . t ofUG Programmes
Attainment Levels
Attainment Status
( Percentage of marks)
Level3 More than 55% Attained
Level 2 between 50% and 55% Attained
Level 1 Less than 50% Not Attained
Interpretation ofPO Attainment Levels (UG):
Level3: Average score ofabove 55% in courses mapped to a particular PO.
Level 2: Average score ofabove 50% and upto 55% in courses mapped to a particular PO
Level 1: Average score of less than 50% in courses mapped to a particular PO
�\;- t.:=)�
HO�Compuler Scicn,:e 0 PRli� -
FAC!::!CE
Kns1u Jayant1 Coli2geAutono:nc ... s Kristu Jayanti College Autonomous
KRISTU JAYANTI COLLEGE AUTONOMOUS K. Narayanapura, Kothanur PO
K. Na rap':!�ur3
K. N;irny3n3purc1, Kothanur PO
e� r J;;'i:·e -5;:0 077 BengaluruPage- 10 of 104 7
56007
8;;ng:1luru - 560077
00CS02
Annexure 0
Life Skills Education - Guidelines
• All UG students should earn two NCCC credits by completing 30 hours of Life Skills Education
(LSE). Certification in Life Skills Education is mandatory and cannot be substituted by any other
course/ activity.
• The training on Life Skills Education is offered by the Centre for Life Skills Education of the
college.
• The course is scheduled at the beginning of the academic year as part of the Induction Programme.
For students who are unable to complete the LSE at the beginning of the programme due to
unavoidable circumstances, a special session is held during the month of November (during the
first Semester holidays).
• The credits earned through Life Skills Education shall be depicted in the fourth Semester marks
card.
• Students failing to earn the two credits through Life Skills Education before the commencement
of the second Semester have to register for the same and undergo LSE training before the
commencement of third Semester. Students failing to do so will have 'Reappear' status depicted
in their fourth Semester Marks Card.
• Students failing to earn the two credits for Life Skills Education during their UG programme will
not have 'Pass' Status and are not eligible for Graduation.
�/ �� ,__il .:.)
Ab ••
HOO. D partmf:nt of Comp1.;ter Scie1:e
�N
FACU LTY OF S" IENCE
Kri
� PRQ;IPAL
stlt Ja·,'
,._ �E AUTnNOMOUS K. Narayar,apura, K 0 thanur PO
-
ar.h· c o Hege Autonomous

Kristu Jayanti College A u to�;oT,,.ic.'i KRIS TU JAYANTI CO LLc , hanur"' PO 77
K. Narayanapura K. NarayanJpura, Ko1 Sengaluru • 5600
8a1102lvre - 560 077 Beng::iluru • 560077
Page 11 of 104
00CS02
nnexure ID
Extra-Curricular and Extension Credits (EEC)
• All UG students under the Autonomous system should earn two credits as Extra-curricular and
Extension Credits (EEC) during the first four Semesters of the UG Programme.
• The credits earned shall be depicted in the fifth Semester marks card.
• Students who do not earn the two EEC credits within first three Semesters have to register for
the Add-on courses offered by the respective department and attend the 1)ame in order to earn the
two credits by the fourth Semester of the UG programme.
• Students failing to acquire two EEC credits by the end of fourth Semester shall have
Reappear status depicted in their fifth Semester MarksCard.
• Students failing to achieve the two EEC credits during their UG programme shall not have 'Pass'
status and are not eligible for award of graduation certificate.
Guidelines for Award of E EC Credits
EEC Credits can be earned by the following means:
1. Student Participation in Literary and Cultural Activities
A total of two credits shall be awarded to a student during the Semesters I- IV if he/she fulfills
any one of the below mentioned criteria/ requirements and upon producing the relevant
documents to the Controller ofExaminations.
• Representing the College/ University and winning any of the Literary/ Cultural
competitions at the South Zone Inter-University Youth Festival or National Youth Festival
as an individual/ member of the winning team duly certified by the AIU/ hosting University
and acknowledged by the Principal of the college. Hereby the Institution acknowledges the
effort and time put in by the student in view of preparation and qualifying at the University
level for zonal and National level competitions.
• Representing the College and win�ing any of the Literary/ Cultural competitions at the
University Level as an individual/ member of the winning team duly certified by the
hosting University and acknowledged by the Principal of the college. The student should
have won the 1st or 2nd Prize.
• Participation with regularity and due discipline in Training sessions (Choir/ Theatre/
Dance/ Music) organized by the college with full attendance of 30 hours during one
Semester that will be equivalent to 1 credit. Therefore, a student has to complete 60
hours of training in a span of 2 Semesters to earn 2 credits. The attendance record shall
be duly approved by the Staff in- charge and certified by the Principal.
• Participation with regularity and due discipline in Musical Instrument Certification
Course organized by the college, such as Guitar Certificate Course, with full attendance of
30 hours during one Semester and pass in respective practical and theory examination.
The same shall be duly certified by the Staff in-charge and the Principal.
• Any other activity undertaken by students, found to be significantly worthy, to he considered
as unique/ exemplary in nature decided by the Principal and Vice-principal..
2. Sports Achievement
a) First/ Second position at the University Tournament/ Athletic Meet conducted by the
University or First/ Second/ Third position in the Zonal/ National Level Tournament/
Athletic Meet conducted at the Inter University level).
b) Students who are regular (minimum 85 % of attendance in each Semester) in the training
sessions organized by the college for any two Semesters (within first three Semesters) in
Sports and Games events.
HOD.
Ak
�Lier 5-�·-:··.:,�
Knstu Ja>a�,. Co'''=·?'=;.,_'.: ·. ,·: .;;
FACULTY OF SCIENCE Kristu Ja·1anti College Autonomous
KRISTU JAYANTI COLLEGE AUTONOMOUS K. Narnyanapura, Kothanur PO
K. l·�ara, ,,,·.::.;--_ '?! K. NarayanJpura. Kothanur PO Bengaluru • 560077
82 r ,:2.':·e- �:: 077 Beng:Jluru - 560077
Page 12 of 104
00CS02
3. Membership in Jayantian Extension Services(JES)-NCC /NSS I CSA and being a n active

member of the same during the first four Semesters of the UG Programme, fulfilling the
regulations laid down by the respective Unit /Association.
3.1 NCC - Norms for earning EEC
► Students who does not have any NCC Certification before joining our
college: These cadets are awarded the two EEC Credits if they satisfy the
following conditions:
a) Cadets achieve the eligibility criteria to appearNCC 'B' Certification Examination.
b) After passing 'B' Certification Examination cadets should continue in theNCC until
NCC 'C' Certification Examination. If a cadet fails to achieve the eligibility to appear
for NCC 'C' Certification Examination his/ her EEC Credits are liable for
cancellation.
► Students who already have NCC 'B' Certification before joining our college,
these cadets are awarded the two EEC Credits if they satisfy the eligibility criteria
to appear NCC 'C' Certification Examination.
3.2 NSS-Norms for earning EEC
• Criteria for students attending the camp
A student should have 50% attendance in the other regular NSS activities if
he is taking up at least one special camp in 2 years.
• Criteria for students not attending the camp
A student should have 80 % attendance in NSS regular activities.
3.3 Centre for Socia/Activities (CSA)-Normsfor earning EEC
A volunteer
• Should be part of the CSA for a minimum of first four Semesters of the UG
programme.
• Should attend minimum thirty hours duration of activities organized by the
CSA.
4. Add-on courses
Students who attend add on course with not less than 85% attendance and
completed/ passed the respective courses are eligible for two EEC credits. Add- on
courses include:
a. CIMA Course (for B BA students).
b. Company Secretary and Chartered Accountancy Course.
c. ACCA Course (for B.Com. ACCA students).
d. Civil Service Examination Training Course.
e. Dhakshina Bharat Hindi Prachara Sabha Examination Training Centre.
f. Foreign Language Course.
g. Specific Add-on courses offered by the respective department.
h. Online Courses (suggested by the department).
i. Training programmes or workshops offered/organized by the college for
enhancing skills in areas such as Theatre, Guitar, Choir, Dance.
Ab FA�NCE
K'..�ment o'f Com�uter Sc1e;1�\STU JAYANTI COLLEGE AUTO
HOO_
S.u Jayant1 Col/F-ge A·u 1,n- NOMOUS
�a::-��- p CIPAL
Kristu Ja·ianti College Autonom
K. Narayanapura, Kotha nu r
ous
PO
11
u ,v,, --� sengalun.1 • 560077
' ra, Koth,rnur PO
K. tfarayanaou
C")-
K ",�3ra y --.·1"'lL''3
8::,,"c?'•;re � .s{c1 077 Beng3luru - 560077 Page 13 of 104
00CS02
nnexure IV
Generic Elective
The students have the freedom to choose among the different courses offered by other departments during
the fourth Semester of their UG programme. The Choice Based Credit Course comes under the category
namely "Generic Elective". It can be Theory (GE) or Practical (GE) in nature.
Course Code Course Title Offered by

COM304A41 Basics of Accounting Department of Commerce
COM304A42 Basics of Investment Management Department of Commerce
COM304A43 Fundamentals of Stock Market Department of Commerce
COT304A41 Airport Ground Handling and Cabin Crew Service Depa11ment of Commerce
COT304A42 Tourism and Hospitality Marketing Department of Commerce
UMG304A41 Corporate Communication Department of Management
UMG304A42 Fundamentals of Management Department of Management
UMG304A43 Introduction to Banking Department of Management
CSC304A41 lnfonnation Storage Concepts and Practices Department of Computer Science
CSC304A42 IT for Managers Department of Computer Science
CSC3L4A41 Data Management using Excel Department of Computer Science
CSC3L4A42 Interactive Web Designing Department of Computer Science
CSC3L4A43 Project Management Tools Department of Computer Science
STS3L4A41 Basic Statistical Ability using MS Excel and SPSS Department of Computer Science
STS304A41 Operations Research Fundamentals for Business Department of Computer Science
UMT304A41 Mathematical Reasoning Department of Computer Science
ELE304A41 Communication Media Technologies Department of Computer Science
LSC304A41 Food and Nutrition Department of Life Science
LSC304A42 Introductory Microbioloirv Department of Life Science
ENG304A41 English for Competitive Examinations Deanery of Humanities
JOR304A41 Fundamentals of Photography Deanery of Humanities
PSY304A41 Personality Development Deanery of Humanities
PSY304A42 Psycholo2:v and Life Deanery of Humanities
POL304A41 Introduction to Gandhian Studies Deanery of Humanities
POL304A42 Principles of Political Science Deanery of Humanities
HIS304A41 Indian Cultural Heritage Deanery of Humanities
lk ��1C==>- PR,IPAL -
HOO, Oe�er Sci!:nC� FACULTY OF SCIENCE Kristu Ja·1anti College Autonomous
-Ktistu Jayanti College Autc�:. :· - :.;� KRISTU JAYAtHI COLLEGE AUTONOMOUS K. Narnyariapura, Kothanur PO
K. Naray:r,s:,.-:i K. N;ir::iyanapura. Kothanur PO Bcnq;i!uru - 550077
8::rp_'::
1
:,�e - :�.:·Ji/ Bengaiuru • 560077
Page 14 of 104
00CS02
AnnexureV --------------------------------
Question Paper Pattern
4 Credits Course (Theory)

Total Marks: 70 Duration: 3 Hours
Section A: 7 Questions out of 10, each carrying 2 marks (7 X 2 = 14)
Section B: 4 Questions out of 6, each carrying 5 marks (4 X 5 = 20)
Section C: 3 Questions out of 5, each carrying 12 marks (3 X 12 = 36)

Total Marks: 50 Duration: 2½ Hours
Section C: 3 Questions out of 5, each carrying 10 marks (3x10=30)

Total Marks: 35 Duration: 2 Hours
�lt,=:) -
k
HOD, Department of Computer Scie,ce
,Kristu Jayant, CollegeAu1,:,�..:'";': .. s
�
FACULTY Or S
KRISiU JA'!'ANil COLLEGE
ur :l,
vlE NCE
K
AU
o!n '
an
T ON
ur
OM
PO
OU S Kr
PR! C PAL
ist\l Ja·,anti Co ge Auton
K. Narayanapura; Koth,1riu
7
omous
r PO
K. Naray2:1��•cifJ K. Nar:iyan:.1p Bengaluru - 56007
Bcir":::!l,1re - S·:·J 077 r.c p lu ru • 56 00?7
Bc
Page 15 of 104
00CS02
Programme Matrix: Bachelor of Computer Applications [2020 Batch]
I I Semester
I
Course
Course Programme Major Code Total Hrs.I Components Total Max Marks
Course Title
Type Hours Week Credits
PC Y Course Code L T p CIE ESE Total
MIL I Any ONE to be Opted)
AECC 00CS02 18 AEN103All Additional English I 45 3 2 I - 3 25 50 75
AECC 00CS02 19 HIN103B11 Hindi I 45 3 2 1 - 3 25 50 75
AECC 00CS02 19 KAN103B11 Kannada I 45 3 2 1 - 3 • 25 50 75
Compulsory Courses
AECC 00CS02 18 ENG103All English I 45 3 2 1 - 3 25 50 75
DSCC 00CS02 18 BCA204Al1 Basic Electronics 60 4 3 1 - 4 30 70 100
DSCC 00CS02 18 BCA204Al2 Programming in C 60 4 3 1 - 4 30 70 100
Computing and Programming
DSCC 00CS02 18 BCA204Al3
Fundamentals I 60 I 4 I 3 I 1 I - I 4 I 30 I 10 I 100
DSCL 00CS02 18 BCA2L2Al1 Electronics Practical 60 4 - - 2 2 15 35 50
DSCL 00CS02 18 BCA2L2A12 Programming in C Practical 60 4 - - 2 2 15 35 50
Total 22 170 380 550
Jk .
HOD, Department of Cbmputer Science
Knstu Jayanll College Autonomous
�
FACULTY OF SCIENCE
KRtSTU JAYANTI COLLEGE AUTON0M0U�
�:�
)(,istu Ja·,1anti College Autonomo
tna nur PO
us
. .
It Narayanapura, Kothanur PO K. Narayanapura, Ko
K. Narayanapura Sengaluru - 560077
Banqalore - 560 077 Bengaluru - 560077
Page 16 of 104
00CS02
I II Semester I
Course
C ourse Programme Major Code Total Hrs./ Components Total Max l\hlrks
Course Title
Type Hours Week Credits
PC Y Course Code L T P CIE ESE Total
MIL I Any ONE to be Opted]
AECC 00CS02 18 AEN103A21 Additional English II 45 3 2 1 - 3 25 50 75
AECC 00CS02 19 HIN103B21 Hindi II 45 3 2 1 - 3 25 50 75
AECC 00CS02 19 KAN103B21 Kannada II 45 3 2 1 - 3 25 50 75
Compulsory Courses
AECC 00CS02 18 ENG103A21 English II 45 3 2 1 - 3 25 50 75
AECC 00CS02 18 NES102A01 Environmental Science 30 2 - 2 - 2 15 35 50
DSCC 00CS02 18 BCA204A21 Data Structures 60 4 3 1 - 4 30 70 100
DSCC 00CS02 18 BCA204A22 Programming in Java 60 4 3 1 - 4 30 70 100
DSCC 00CS02 18 BCA204A23
Mathematical Foundation in
Computer Applications I 60 I 4 I 3 I 1 I - I 4 I 30 I 10 I 100
DSCL 00CS02 18 BCA2L2A21 Data Structures Practical 2 15 35 50
DSCL O0CS02 18 BCA2L2A22 Programming in Java Practical 2 15 35 50
Total 24 185 415 600
Ak
HOO. �lcr S(i12 ·.::::
�
FACULTY OF SCIENCE _:: __,,PAI� �-��
KRISTU JAYANTI COLLEGE AUTONOMOUS Kristu Ja·,anti College Auton
�
Kristu Jayanli College Aulonornu(;:i K. Narayanapura, K omous

K. NarayanapurJ, Kothanur PO ottmnur PO
K Narayanapura
Bengaluru - 560077 Bengaturu - ssoon
Banaalore - 560 077 /'
Page 17 of 104
00CS02
Im Semester
I
Course
Course Programme Ma_jor Code Total Hrs./ Components Tot.al M,t, !\larks
Course Title
Type Hours Weel, Credits
PC V Coun.e Code L T p CIE ESE Total
AECC 00CS02 18 ENG103A31 English III 45 3 2 1 - 3 25 50 75
DSCC 00CS02 18 BCA204A3 l Visual Programming 60 4 3 1 - 4 30 70 100
DSCC 00CS02 18 BCA204A32 Database Management System 60 4 3 1 - 4 30 70 100
DSCC I 00CS02 18 BCA204A33 I UNIX/LINUX

Operating System Concepts and
60 4 3 1 - 4 30 I 10 I 100
DSCC j 00CS02 18 BCA204A34 I Probability and Statistics 60 4 3 1 - 4 30 I 10 I 100

DSCL j 00CS02 18 BCA2L2A31 I Visual Programming Practical 60 4 - - 2 2 15 I 35 I 50
I
DSCL 00CS02 18 BCA2L2A32
Practical
I
Data�ase Management System
2 15 35 50
Total 23 175 400 575
tiOD. frepartment of Computer Scieni.:11

f(ristu Jay2nt1 College Autonomous
FACULTY OF SCIENCE
KRISTU JAYANTI COLLE
GE AUTONOMOUS
I(. Narayanapura, Ko
thanur PO
�tt:�-�-
Kristu Ja·1anti College Autonomous
K. Narayanapura
Bengaluru • 560 077 Bengaluru - 560077
Banaalore - 560 Oll , "
Page 18 of 104
00CS02
I IV Semester __________ ___ I

Course
Course Programme Major Code Total Hrs./ Total Max Marks
Course Title Components
Type Hours Wecl< Credits
PC Y Course Code L T p CIE ESE Totnl
AECC 00CS02 18 ENG103A41 English IV 45 3 2 1 - 3 25 50 75
DSCC 00CS02 18 BCA204A41 Software Engineering 60 4 3 1 - 4 30 70 100
DSCC I O0CS02 18 BCA204A42 I DataMmmg

Concep�s of Data Warehouse and
_ I 60 I 4 I 3 I 1 I - I 4 I 30 I 10 I 100
Data Communication and -
DSCC 00CS02 18 BCA204A43 60 4 3 1 4 30 70 100
Networks
DSCP 00CS02 18 BCA2P2A41 Software Engineering Project 60 - - - 2 2 15 35 50
GE As per Annexure IV 60 4 3 1 - 4 30 70 100
SEC 00CS02 18 SSP4L2A01 Soft Skills Practices 60 4 - - 2 2 15 35 50
NCCC 00CS02 18 LSE5A2A41 Life Skills Education - - - - - 2
Total 25 175 400 I 575
Ji.:=>-
FACULTY OF SCIENCE
HOD, [Jepartment of Computer Sci�:ic� KRISTU JAYANTI COLLEGE
AUTONOMOU� Xristu J;1•-1ant, Ccifiege Autonomous
Kri:;tu Jr1y,rnt1 College Autonomous K. Narayanapura, Kothanu
r PO_ K. Narayaoapura, Kotnanur PO
K. Narr1yanapura
Bengaluru - 560077.,, Bengaluru - 560077
Banaalore - 560 077
Page 19 of 104
00CS02
Programme Matrix: Bachelor of Computer Applications (2020 Batch]
I V Semester
I
Course
Programme Major Code Total Hrs.I Components Total !\fa X [\,fa rk.�
Course Type Course Title
Hours Weck Credits
PC Y Cour!lc Code L T p CIE ESE Total
DSCC 00CS02 18 BCA204A51 Web Programming Using PHP 60 4 3 1 - 4 30 70 100
DSCC 00CS02 18 BCA204A52 Computer Architecture 60 4 3 1 - 4 30 70 100
Web Programming Using PHP - -
DSCL 00CS02 18 BCA2L2A5 l 60 4 2 2 15 35 50
Practical
DSCP 00CS02 18 BCA2P2A51 Enterprise Computing Project 60 - - - 2 2 15 35 50
DSEC 00CS02 18 BCAA04A51 Computer Graphics 60 4 3 1 - 4 30 70 100
DSEL 00CS02 18 BCAAL2A51 Computer Graphics Practical 60 4 - - 2 2 15 35 50
Elective
Group• DSEC 00CS02 18 BCAB04A51 Cloud Computing Concepts 60 4 3 1 - 4 30 70 100
Cloud Computing Concepts - -
DSEL 00CS02 18 BCABL2A51 Practical
60 4 2 2 15 35 50
Ut.-cthc OSEC 00CS02 18 BCAC04A51 Big Data Analytics 60 4 3 1 - 4 30 70 100
Ciroup� for
Stud.:111s \\ h,l DSEL 00CS02 18 BCACL2A51 Data Analytics Using R Practical 60 4 - - 2 2 15 35 50
haJ optcJ for DSEC 00CS02 18 BCAD04A51 NoSQL Database Concepts 60 4 3 1 - 4 30 70 100
Data
,\n:11) tics DSEL 00CS02 18 BCADL2A51 NoSQL Database Practical 60 4 - - 2 2 15 35 50
NCCC 00CS02 18 EEC5A2A51 EEC as per Annexure ill - - - - - 2
Total 26 180 420 600
* Not applicable for students who had opted for Data Analytics
k
r,uo. Department of Compt.,!€:1 3cienCt
Knstu Jayanr, College Autonomous
�
FACULTY OF SCIENCE
KRISTU JAYANTI COLLEGE AUTONOMOUS
�-�
PAI��
"M
Kristu Ja'{anH College Autonomous

T
K. Narayanapura K. Narayanapura, Kothanur Page
'-Sanaalore - 560 011 It Narayanapura, Kothanur PO PO20 of 104
.. � Bengaluru - 560071 Bengaluru - 560077
00CS02
00CS02 18 BCA204A62 Artificial Intelligence 60 4 3 1 - 4 30 70 100

00CS02 18 BCA2P4A61 Project 120 - - - 4 4 30 70 100
00CS02 18 BCAA04A61 Mobile Application 60 4 3 1 - 4 30 70 100
00CS02 18 BCAAL2A61 Mobile Application Practical 60 4 - - 2 2 15 35 50
00CS02 18 BCAB04A61 Multimedia Tools and Application 60 4 3 1 - 4 30 70 100
00CS02 18 BCABL2A6l
I
Multimedia Tools and Application
_ 60 4 - - 2 2 15 35 50
Practical
I
00CS02 18 BCAC04A61 Big Data Analytics Using Python 60 4 3 1 - 4 30 70 100
00CS02 18 BCACL2A6 l I
Big �ata Analytics Using Python
Practical
60 4 - - 2 2 15 35 50
00CS02 18 BCAD04A61 Data Visualization Techniques 60 4 3 1 - 4 30 70 100
00CS02 18 BCADL2A61 Data Visualization Practical 60 4 - - 2 2 15 35 50
Total 24 180 420 600
* Not applicable for students who had opted for Data Analytics
Ak
_,_---
�
HOD. Dep�r Scienc:: FACULTY OF SCIENCE �:�_;_L��--
Kristu Jayant, College Autonomous KRISTU JAYANTI COLLEGE AUlONOMOUS l<ristu Ja•,1anU c�::;utonomous
K. Narayanapura
It Narayanapurri, Kothanur PO K. Narnyanapura, t<othanur PO
8;inat1lore - 560 077
Benunluru - 560077 Benr,1a1uru - 560077
Page 21 of 104
00CS02
I Semester
Page 22 of 104
00CS02 18 AEN103A11
AEN103All: ADDITIONAL ENGLISH I
Credits: 3 Hours: 45
Co,irse Objectives:
··�- T'cdntroduce the learners to new ideas, topical issues and new styles of writing.
• To initiate debates, discussions and new thinking in the •grey areas'.
Course Outcomes:
After successful completion of the course, the student will be able to:
• describe and differentiate between ballads and sonnets
• analyze critically the writing style of prose writers
• develop interest to appreciate one act plays
• apply the rules of punctuation to write concisely
• demonstrate proficiency in creating leaflets and brochures
Unit 1: Prose & Poetry 25 hrs

0. Henry: The Last Leaf; Adil Jussawalla- Sea Breeze, Bombay; W B Yeats: The Ballad of Fr.
Gilligan; Richard Rive; TheBench; Catherine Mansf-ieldi-The-Cup ef-'Fea; Rabindranath-Tagore:
Gitanjali 50; EM Forster: The Engiish Character; Nizzim Ezekiel: The Night of the Scorpion; Clare
& Frank Gault; Young Pele, Soccer Player; William Hazlitt: Malthus and Liberties of the Poor
Unit 2: One Act Play 10 hrs

J B Priestley: Mother's Day
Unit 3: Writing Skills lOhrs

Leaflet & Brochure; Invitation; Response to Visuals; One Word Substitute; Punctuation
References:
Cosby, Bill. (1986) Fatherhood. New York: Doubleday.
Murphy, Raymond. (1998) Intermediate English Grammar. New York: New York Publisher.
Sullivan, Nancy M. (2015) Essential Grammar: for today's writers, students and Teachers. New
York, New York: Routledge.
Tagore, Rabindranath. (1952) Collected Poems and Plays ofRabindranath Tagore. United
States: Macmillan Publishing.
Wren & Martin. (2001) English Grammar & Composition. New York: New York Publisher.
FACULTY OF HUMMJITIES
Verified By : . ;Ji""'"' s MM tl6M1 KRISTU JAYANTI COLLEGE AUTONOMOUS
Name
K. Narayanapura. Kothanur PO
Signature � Benga!uru · 560017
Page 23 of 104
00CS02 19 HIN103B11
HIN103B11: IDNDI I
Course Objectives:
q'd"di+I
qSf ��ll"
• ��mr�q;r�
e � <'Im clllcfi:{Ojiqii;i � qSf �
Course Outcomes:
��
� QliNsl>+I '$ mmr,:r '$ � � -q � � ffllJd qSf � ....
• ��mr fumm cfiT ��m <m" � cfiT �
• � if .fl1ii1�cfi mmf" cfiT � m cfiT m.:r
• "'3.,11rlii:'tcfi �ll� if q�'{uh-11
• mr fumm � � � � G(lG 'l-11ii1�q5 � cfiT m.:r �
• ��ifqftll�
Unitl 35 hrs
Prose: Devanaagari Gadhya Sankalan
Edited by Dept. of Hindi
�mr�
Unit2 5 hrs
Letter Writing & Scientific and literary Translation terminology:
Aavedan, Puchtach, Aadesh, Sandarbha and Bhugtan, Hindi Typing
q";lclltl$H, �� : �, �' �T, �. �
� � -qcj" .fl1fe;�q5 lll�l'flli:I
Unit3 5 hrs
Grammar: Vikaari Shabda- Sanja, Sarvanam, Visheshan and Kriya
�: �. �. fullflfUT � �
Reference Books:
• Kahani Nayi Kahani Namvar Sinha Lokbharati Prakashan Ilahabad.2012
• Hindi Kahani Ka Vikas Madhuresh Sumit Prakashan2016
• Anuvad Abhyas- Hindi Niband- Lakshmi Hindi Vidhyalay-Guntur2017
• Nirala Aur Unka Rag Virag Ashok Prakashan Nayi Dilli 2007
• Vyavaharik Hindi- Dr. Dilipsinghvi Himalaya Publication 2008
• Abinavvyavharik Hindi- Sri.Paramanand Gupta, Himalaya Publication 2010
• Bharat Ke Prasiddha Vaijnanik, Rajkamal Publication, Delhi 2014
• � �-"if.!lZTT1f fRUT-wewTW/iffR, W�-2013.
• '<it/tlltJfl!qj ffi'Q- !l4/tJWqi!
.:,
�-Fc/ElrfclmW!iTfR, ��-2014.
.:,
• �&J/¢?07 rrerr�-"it.wr��-�eR'WPTfR, �H/576/le-2014.
-----if"JCI\
k
N
Verified By : FACUL OF HUMANITIES
Name KRISTU JAYANTI COLLEGE AUTONOMOUS
Signature @:§--_'_ K. Narnyan3i: 1 1•:1 \(0lhanur PO
Page 24 of 104
00CS02 19 KAN103B11
KAN103Bll: KANNADA I
l:l�®ci ero�eltrlw...
• '5Kti.� NC)OOieif� l:ll:JQ ��dci SiGJ,r'IV m� 'ZiJe)�'5 �e:>,sr'>V e:3m>e3:l�f"
• NClro�,s �uadr'lv�ccr NCle3e�'5 �e:>,sr'I�� m�ccrrua�cG)l:J�
l:)�QD .µe,�,.-u...
l:l�®ci z.irae�OD ccro�d l:l�,seper'l'l.'0:
• �C'Jedci& S1 NClro�,sci e3,s0Cl,s�e.5e.3e �Gtle3dJ
• NC)��'5 ��ccr� m� �e&Sccr�e:>,sr'lv e::iiccrm>e3drcle'5ccr �ooe3dJ
• 1'JC)�eC'cl
v
�o�Oe)�ODl'il,« l:Je3c)cG)&SdJ
• '5Kti.� 'ZiJeJe!;jc")<Beme3��d 'ZiJe}e!Sr'IWcloali ffi..lclee,� �Gtle3dJ
�" lOhrs
1. 23�11 '5Kti.&oi>NN�®,s- e3e.5icr�ddJ
2. �ced'5e-no1'JC)cid230C>e:>
. �
llhrs
1. (R)0'2JdJ 2Joci�--Qc>,se3c\1.lad:) masciee:3
2. edae-a� - eJciJdor'I
12hrs
1. NC)�0)'2Sc)C'c)O)-Z;:31cre:3ci'5Q
2. E.:9c;)�N '2Sc>icredci-�e.�o.ed.
deIDa! id�!! 12hrs
1. '5Kti.�e;3e C'J�Qe3:le-2:3oilciel:l 0C>cfb e,1'JC)d
2. a.rciee.3 �c::::b'l.'0r'I� 23ta:rne3 �e:>� --(R). NCllie� 5'3r'ld
iOOc>iilJdf"a! zjoqtrlw:
1. ciee31'5JcldJ m�ciee:3 (2015) w�'5Q, �cio2Jar'l'l.'0, �z;lC'Je:3 23or'IVJc>dJ.
2. NCllie� cflrld (2017) �,cv€
"' ,J
�e::ma
•
: l:l� drcle'5ci �e3drcle'5"3., ��
• 2.X>u6',
,J
23or'IVJc>dJ.
'cl"
3. �e.�o. e::lde3JSG3oil,s �oe::mci'5dJ (2016) ciz_C'cl'5NCleeJ'5ci?.dC'Jedciuae3,s ��dr'l'l.'0,�z;lccre:3 ��C'S,
2.3or'i�.
sAA\/�ldA � . .s ·
DEAN
FACULn Of HUMANITIES
Verified By: ·..'.])r·
Name •
S
� KRISTU JAYANTI COLLEGE AUTONOMOU
· K. N:nav�n:1�ura. Kothanur PO
SI. gnature ·
Be-ngaluru · 56fl 07 7
Page 25 of 104
00CS02 18 ENG103A11
ENG103All: ENGLISH I
Course Objectives:
• To attune young minds to concerns and issues which have a broad and wide scope of
use and application to life.
• To cut across the history of creative expression in focusing primarily on the core
values that govern human lives.
Course Outcomes:
• demonstrate ability to identify nuances of prose and poetry
• develop the skill to appreciate prose and poetry
• state the basic concepts of grammar and its usage
• develop communicative skills and become competent users of English in real life
situations
Oscar Wilde: The Selfish Giant; Jawaharlal Nehru: At Harrow and Cambridge; R. K. Narayan:
Sweets for Angels; Bhisham Sahni: The Boss Came to Dinner; Rabindranath Tagore: The
Postmaster; John Milton: On His Blindness; Oliver Goldsmith: The Village Schoolmaster; William
Wordsworth: The Solitary Reaper; P.B.Shelley: Ozymandias; John Keats: La Belle Dame Sans
Merci.
Unit 2: Grammar 10 hrs

Articles; Active and Passive Voices; Tenses; Do-Forms; Use ofNegatives; Prepositions; Subject
Verb Agreement; Vocabulary
Unit 3: Communication Skills 10 hrs

Understanding Communication; Greeting and Introducing; Making Requests; Asking for and
Giving Permission; Offering Help; Giving Instructions and directions.
References:
Coe, Norman, Harrison, Mark and Paterson, Ken. (2015) Oxford Practice Grammar: Basic.
Cambridge: Cambridge University Press.
Chaudhari, Bhagwat Ratan. (2015) Indian Writing in English. India: Ishika Publications.
Glendinning, Eric H. and Holmstrom, Beverly. (2008) Study Reading: A Course in Reading Skills for
Academic Purposes. New Delhi: CUP.
Murphy, Raymond. (1998) Intermediate English Grammar. New York, New York: Publisher.
Langan, John. (1996) College Writing Skills. New York, New York: McGraw Hills.
Sharma, Sharmila. (2018) Effective Communication Skills. Bengaluru, Kamataka: Book Enclave.
Wren & Martin. (2001) English Grammar & Composition. New York, New York: Publisher.
Verified By : EAN
Name FA LTY OF HUMANITIES
Signature K. Narayanapura. Kotnanur PO
Bengaluru · 560077
Page 26 of 104
00CS02 18 BCA204A11
BCA204All: BASIC ELECTRONICS
Course Objective:
• To familiarize with the fundamental concepts of electronics and its application.
Course Outcomes:
• analyze analog electronic circuits using network theorems
• demonstrate the working and concept of solid state electronics
• explain the fundamental concepts of basic gates, universal gates, combinational and sequential
circuits
Unit 1: Introduction to Network Theorems & AC Fundamentals 12 hrs

Network theorems- Ohm's law, Kirchhotrs law: Statement and explanation. Mesh/loop analysis and
node voltage method, Numerical problems. Delta/star and star/delta transformation. Superposition
theorem, Thevenini's theorem, Norton's theorem: statement, Stepsto-apply the theorem and-problems
for-one voltage source. Maximum power transfer theorem: statement, expression for maximum power
delivered.
AC fundamentals- Representation of AC sine wave, :frequency, time-period, rms value, average value
(No derivation, only mention)
Unit 2: Semiconductor Devices 12 hrs

Introduction-Atomic structure, energy level, energy bands diagram in solids.
Semiconductor-Properties, crystal structure, Effect of temperature on intrinsic semiconductor, Doping,
donor, acceptor impurities, n-type and p-type semiconductor.
Semiconductor devices- PN junction diode, formation of PN junction, biasing of PN junction under
forward and reverse biasing, breakdown in PN junction: avalanche and zener break down.V-1
characteristics.
Rectifier- Half wave: Circuit, working, wave forms and expression for ripple factor and efficiency (no
derivation), advantages and disadvantages. Full wave: Circuit, working, wave forms and expression for
ripple factor and efficiency (no derivation), advantages and disadvantages. Bridge wave rectifier:
Circuit, working, wave forms and expression for ripple factor and efficiency (no derivation),
advantages and disadvantages.
Digital ICs- Classifications, features.
Unit 3: Introduction to Digital Electronics 12 hrs

Introduction-Comparison with analog systems, Need and advantages of digital systems, Noise and
error corrections. Logic gates: AND, OR, NOT, NAND, XOR, NOR: Assembly with discrete
components, Definition, pin diagram, truth table and timing diagram.
Demorgan's theorem-Statements, proof using truth tables. Simplification of Boolean expressions
using Boolean laws. Definition of product term, sum term, minterm, maxterms, SOP, standard SOP,
POS and Standard POS, Conversion of Boolean expression to standard SOP and standard POS forms.
Karnaugh maps-Definitions, for 2, 3, and 4 variables, grouping of cells, redundant groups and don't
care conditions; Simplification of3 and 4 variable Boolean expression using K-maps (SOP only).
Unit 4: Combinational Circuits 12 hrs

Half Adder- Symbol, truth table, working; using logic circuit using basic gates and universal gates.
Full Adder-Symbol, truth table, work�ng; using logic circuit using basic gates and universal gates.
Verified By :
Name ; f;-. Gj o 'f %a\'l')OJ
O AN
Signature
-Q� FACULTY OF SCIENCE
KRISTU JAYANTI COLLEGE AUTONOMOU�
K. Narayanapura, Kothanur
Page 27 of 104 PO
Bengaluru - 560077
00CS02 18 BCA204A11
Half Subtractor-Symbol, truth table, working; using logic circuit using basic gates and universal
gates.
Full Subtractor-Symbol, truth table, working; using logic circuit using basic gates and universal gates.
Adder-Subtractor- Logic circuit, pin diagram IC 7483, IC 7486: Parallel adder: 4 bit parallel binary
adder, BCD adder, IC 7483.
Two Bit Comparator-Symbol, logic circuit using XOR and basic gates, truth table.
Encoder-Decimal to BCD priority encoder.
Decoder-2:4 using AND gates, 3:8 using NANO gates, BCD to Decimal decoder and BCD to 7
segment decoder.
Multiplexer- 4: 1 Symbol, logic circuit using basic gates, truth table.
Demultiplexer- 1:4 Symbol, logic circuit using basic gates, truth table.
Unit 5: Sequential Circuits 12 hrs

Flip-flop-Introduction, definition, difference between latch and flip-flop, Qualitative study oflevel and
edge triggering. RS latch/unclocked- symbol and truth table. RS flip-flop using NAND gate, symbol,
truth table and timing diagram. D flip-flop: logic symbol, J-K flip-flop: symbol, truth table, realization
of JK flip-flop using NANO gates, working and timing diagram. Race around condition, preset and
clear inputs, pin diagram ofIC 74112.T flip-flop: logic symbol, JK flip-flop as a T flip-flop, truth table
and timing diagram. Master-slave flip-flop: logic circuit, truth table and timing diagram. Pin diagrams
oflC 7473, IC 7476.
Registers-Definition, types ofregisters: SISO, SIPO,PISO andPIPO (block diagram representation for
each), truth table, timing diagram and speed comparison.
Text Books:
B. Basavaraj. (2002).Fundamentals ofElectronics(revised ed).,OmkarPublications.
Jain RP. (2002). Modern Digital Electronics (2nd ed.). TMHPublishing Company Limited.
Kharate, GK (2010). Digital Electronics Fundamentals, Oxford University press.
R.S. Sedha. (2005). Text book ofApplied Electronics. (1st ed.). S. Chand and Co, Ltd.
References:
Chattopadhyay, Rakshit, Saha, Par.(2000). Fundamentals of Electronics (2nd ed.). New Age
International.
Grob, Bernord. (2002). Basic Electronics I (81h ed.).TMH.
Malvino, Albert Paul and Brown, Jerald A. (2009).Digital Computer Electronics (3rd ed.). Tata
McGraw HillPublishing co Ltd.
Rangnekar, Saroj. (2001). Digital Electronics(l st ed.). !STE.
Verified By :
Name : ,f;-. Ljo 'f 'lhoroA..J 4!:
FACULTY OF SCIENCE
Signature -0 � KAISTU JAYANTI COL

LEGE AUTONOMOUS
K. Narayanapura, kot
hanur PO
eengaluru - 56007l
Page 28 of 104
00CS02 18 BCA204A12
BCA204A12: PROGRAMMING IN C
Course Objective:
• To familiarize with the concepts of structured programming using C language.
Course Outcomes:
• design flowchart and algorithms for C program
• construct sequential, iterative problems and input/output operations on text files
• differentiate between decision control structures and loop control structures
• distinguish between data representation through arrays, functions, function using pointers,
structures and unions
Unit 1: Introduction 18 hrs

Problem solving using computers; Concept of flowcharts and algorithms.
Basic programming concepts- Algorithm; Flowchart; Modular and structured programming.
Overview of C - Introduction; Importance of C; Sample C programs; Basic structure of a C program;
Programming style; Executing a C program.
Constants, Variables and Data types - C tokens; Keywords and identifiers; Constants; variables; Data
types; Declaration of variables; Assigning values to variables; Defining symbolic constants.
Input and Output: Input and output statement; Reading a character; Writing characters; Formatted
input and output statement.
Unit 2: C Operators & Control Structures 12 hrs

Operators and Expression -Arithmetic, relational, logical, assignment, increment, decrement,
conditional, bitwise, special operators and some computational problems; Type conversion in
expressions; Operator precedence and associativity; Mathematical functions.
Decision making, Branching and Looping - IF statement-Simple IF statement, The IF-ELSE
statement, Nesting of IF-ELSE statements, The ELSE-IF ladder; The switch statement; Ternary
operator; The GOTO statement; The WIBLE statement; The DO-WIBLE statement; The FOR
statement; Jumps in loops.
Unit 3: Arrays and Functions 12 hrs

Arrays - One dimensional array, two dimensional arrays and multi-dimensional arrays; initializing
arrays.
Handling of character strings - Declaring and initializing string variables; Reading string from
terminal; Writing string to screen; Arithmetic operations on characters; Putting strings together;
Comparison of two strings; String handling functions.
Functions - Need for user defined functions; Multifunctional program; Form of C function; Return
values and their types; Calling a function; Category of functions; Handling of non-integer functions;
Nesting of functions; Recursion; Functions with arrays.
Unit 4: Structures and Unions 10 hrs

Structures- Structure definition; Giving values to members; Structure initialization; Comparison of
structure variables; Array as structure; Array within structure; Unions.
Verified By : ·. r . L,'J. 0 � � ru �
Name -t"'Y FACULTY OF SCIENCE
Signature . � K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 29 of 104
00CS02 18 BCA204A12
Unit 5: Pointers and Files 08 hrs

Pointers - Understanding pointers; Accessing the address of variables; Declaring and initializing
pointers; Accessing a variable through its pointer.
Files -Types of file access; Types of files; File operations; Input and output operations on files.
Text Books:
Balagurusamy.E.Programming in ANSI .(ih ed.). Tata McGraw Hill.
Kamthane Ashok.(2003).Programming with ANSI and Turbo C.Pearson Education.
References:
ByronGottfried.S (2000).Programming with C. Tata McGraw HiJl.
Deitel & Deitel.(2001).C How to Program.Addisson Wesley.
Kanetkar Yashavant. Let Us C. New Delhi :BPB Publication.
Kernighan Brian, Ritchie Dennis(1988).The C Programming Language. PrenticeHall.
Rajaraman.V. (2000). Programming in C.PHI (BEE).
Steve Oualline(2010).Practical C Progrrunming.O'reilly.
Stephen G. Kochan(2005).Programming in C.Pearson
�
Verified By : FACULTY OF SCIENCE
Name : h· Lgo q, "Thorn"-..& KRISTU JAYANTI COLLEGE AUTONOMOUS
Signature
·Q� Bengaluru • 560077
Page 30 of 104
00CS02 18 BCA204A13
BCA204A13: COMPUTING AND PROGRAMMING FUNDAMENTALS
Course Objective:
• To understand computational thinking and programming processes, the fundamental approach
to solve the real world problems.
Course Outcomes:
• prepare pseudo code, flowchart, algorithm and control structures for computational problems
• distinguish software and programming paradigms
• analyze computing paradigms with case study
Unit 1: Programming Process 12 hrs

Developing a program, program development cycle; Introduction to Algorithms, Characteristics,
writing an algorithm; Flowchart, Symbols, guidelines for preparing flowchart, benefits of flowcharts,
limitations of flowcharts; Pseudocode, Pseudocode guidelines, benefits of pseudocode, limitations of
pseudocode; program control structures.
Unit 2: Programming Paradigms 12 hrs

Unstructured programming, Structured programming, Object oriented programming, characteristics of
a good program. Types of programming languages; Machine language, Assembly language; procedural
language, Natural programming language, Visual programming language, graphical programming
language, scripting language, Hypertext Markup language, Extensible Markup language. Program
Translation: Program translation hierarchy; compiler, Interpreter, linker, loader; Features of a good
programming language.
Unit 3: Software Paradigms 14 hrs

Definition, relationship between software and hardware, categories of software: system software,
application software; System software; operating systems, device drivers and system utilities;
Application Software: mathematical software packages, statistical software packages, Enterprise
software packages, Editor Packages, Database Software packages; Desktop publishing software;
Software piracy and terminologies.
Unit 4: Computing Paradigms 12 hrs

Introduction to Client server computing; basics of distributed computing, Introduction to Grid
computing, parallel computing, cloud computing, Mobile computing; Difference between various
computing paradigms and functionalities; Introduction to soft computing, applications and scope;
Future computing techniques.
Unit 5: Case Study 10 hrs

Case study on modem data storage and accessing concepts; case study on modem scripting languages;
case study on IT Industry [Technology and business platforms]; case study on open source technology;
Verified By :
Name . rr. Lu�D 1' �
FACULTY OF SCIENCE
Signature
(;')�· It Narayanapura, Kethanur PO
Page 31 of 104
00CS02 18 BCA204A13
References:
B. Muthukumaran (2010). Information Technology for Management, Oxford Higher Education.
Dr. Michael Arock, (2014). Fundaments of programming with C. Yes Dee publishing. ITL
Education solution Limited. Introduction to Information Technology. Pearson.
R.G.Saha Anannya Saha. Computer Fundamentals, Himalaya Publication House.
V.Rajaraman, Neeharika Adabala (2015).Fundamentals o/Computers, (61h ed.). PHI Leaming Private
Limited.
Online Resources:
http:/lblogs.msdn.com/b/vasudevk/archive/2009/02/06/different-types-of-computing-grid-cloud-utility
distributed-and-cluster-computing.aspx.
EAN
FACULTY QF SCIENCE
verified Bey: : �- Ujo � KRISTU JAYANTI COLLEGE AUTONOMOUS
Nam K. Naravanapura, Kothanur PO
!5engaluru - 560077
Signature ·Q�
Page 32 of 104
00CS02 18 BCA2L2A11
BCA2L2All: ELECTRONICS PRACTICAL
Course Objective:
• To familiarize with the fundamental concepts ofelectronics and its application.
Course Outcomes:
After successful completion ofthe course, the student will be able to:
• build the circuit with basic logic gates and universal gates
• design flip-flops, combinational and sequential circuits using logic gates
1. Study ofLogic gates- AND,OR,NOT,NAND,NOR XOR(using respective IC's)

2. Realization ofAND, OR and NOT gates using Universal gates.
3. Design and Realization ofHalfadder/Subtractor using NANO gates.
4. Design and Realization ofFull adder using logic gates.
5. Design and Realization of4 bit adder/Subtractor using IC 7483.
6. Design and Realization ofBCD Adder using IC 7483.
7. Realization ofR-S flips flop using NA.ND gates ..
8. Realization ofJ-K flips flop using IC 7400 and7410.
9. Realization ofT and D flip flop using IC 7400.
10. Realization of2:4 Decoder.
11. Implementation ofSISO shift registers using flip flops (IC 7474).
12. Implementation ofSIPO shift registers using flip flops (IC 7474).
13. Implementation ofPISO shift registers using flip flops (IC 7474).
14. Implementation ofPIPO shift registers using flip flops (IC 7474).
Note: List ofPractical experiments (at least 10 experiments to be conducted)
Evaluation Criteria
Criteria Marks
Writing 2 experiments 10
( Procedure, truth table)
Construction and Conducting 1 15
experiment.
Output and Result 05
Viva Voce 05
Total Marks 35
�
Verified By: : �· UJO q>
FACULTY OF SCIENCE
Name l(RISTU JAYANTI COLLEGE AUTONOMOU
S
K. Naravanapura, l<othanur PO
Signature
G\� Bengaluru - 560077
Page 33 of 104
00CS02 18 BCA2L2A12
BCA2L2Al2: PROGRAMMING IN C PRACTICAL
Course Objective:
• To familiarize with the concepts of structured programming using C language.
Course Outcomes:
• trace sequential, decision making and iterative C programs
• design user defined data types and functions in C language
1. Write a C program to generate and print first N Fibonacci numbers.

2. Write a C program to find the GCD and LCM of two integer numbers.
3. Write a C program that reverses given integer number and checks whether the number is
palindrome or not.
4. Write a C program to find whether a given number is prime number or not.
5. Write a C program to read a string and check whether it is palindrome or not without using
built-in function.
6. Write a C program to find the factorial of a number using function.
7. Write a C program to find if a character is alphabetic or numeric or special character.
8. Write a C program to compute the sum of even numbers and the sum of odd numbers using
function.
9. Write a C program to accept a sentence and convert all lowercase characters to uppercase and
vice-versa.
10. Write a C program to find the largest and second largest ofN numbers.
11. Write a C program to find the roots of the given quadratic equation using switch case.
12. Write a C program to input numbers and to find mean variance and standard deviation.
13. Write a C program to accept different goods with the number, price and date of purchase and
display them using structure.
14. Write a C program to fmd the length of a string without using built-in function.
15. Write a C program to read two matrices and perform addition and subtraction of two matrices.
16. Write a C program to find the trace and normal of a square matrix using function.
17. Write a C program to copy one string to another using pointer.
18. Write a C program to count the number of vowels, consonants, digits, special characters,
whitespace in a given string.
19. Write a C program to create file for storing details ofN students. Student record should contain
Roll No, Name and marks secured in two subjects. Copy the contents of the above created file
to another file.
20. Write a C program to sort an array of strings.
Evaluation Criteria
Criteria Marks
Writing any two programs from the given three 7.5 x2 = 15
questions
Executing the written two programs. 7.5 x 2=15
Viva Voce 5
Total 35
�
Verified By: DEAN
Name FACULTY OF SCIENCE
Signature K. Narayanapura, Kothanur PO
Ben1aturu • of
Page 34 560077
104
00CS02
II Semester
Page 35 of 104
00CS02 18 AEN103A21
AEN103A21: ADDITIONAL ENGLISH II
Course Objectives:
• To provide the young learners an introduction to new ideas and issues that bear
relevance to our life today.
• To give the students an opportunity to develop values that will help them adapt to
the changing world.
Course Outcomes:
• explain the meaning of select poetry, prose, and drama of writers from India, England,
Chile, France, Nigeria, and Canada by placing the texts in the cultural context
• analyze the issues of race, problems faced by fisher community and women, futility of
war, societal fabrications, Nazism, religion, spirituality, partition, and the political
tensions in professional field
• relate and frame opinions on racial issues, war, struggles of women and the
marginalized community
• interpret film text 'Life is beautiful' and learn the historical background of the reign of
Hitler and the injustices in concentration camps
• solve questions on idioms, super ordinates, and hyponyms
William Cowper: On the Receipt of My Mother's picture; Christina Rossetti: Three Enemies;
Anatole France: Our Lady's Juggler; Leonard Cohen: The Tower of Songs; Hassan Manto: The Dog
ofTitwal; Wole Soyinka: Telephone Conversation; Pablo Neruda: To the Foot from its Child; Akka
Mahadevi: Have Maya for Mother-in-law; Jerome Weidman: The Night I Met Einstein; Somerset
Maugham: The Verger

M. Sajitha: Matsyagandhi
Unit 3: Writing Skill 10 hrs

Superordinate and Hyponyms; Idioms; Film Text: Life is Beautiful
References:
Agrawal. KA. (2018) Indian Writing in English. Chennai : Atlantic Publications.
Datta, Nandan. (2007) The Life ofR.K. Narayan. California: California Literary
Review.
Murphy, Raymond. (1998) Intermediate English Grammar. New York: New York Publisher.
Parija, Kapileshwar. (2001) Short stories ofR.K. Narayan: themes and conventions. India:
Renaissance Publications.
Wren & Martin. (2001) English Grammar & Composition. New York: New York Publisher.
EAN
Verified By FACULTY OF HUMANITIES
Name
Signature K. Narayanapura. Koth.anur PO
Bengaluru · 560077
Page 36 of 104
00CS02 19 HIN103B21
HIN103B21: HINDI II
Course Objectives:
�<lil'��v
• � �. � qiT&f � Im � qiT �
• ,!_.llfl;�<f>Hl � a,i11f.:i¢l q;,- � � 3rR" 'lll"IT <m:tWI" q;,- �
Course Outcomes:
��<lft�
� q1aust>+1 � a� � � � if f.n.l � m'1f?f <l>T � ....
• <f>T&f � � ,E,Mlaicilqj � <m" � � �
• qj'f&f �� m ct,- �
• qiT&f if � PcR.rm qiT 'iefQi<f>'1
• qj'f&f � ffl qiT <mil�
• 6Qjqj�ftilqj 'lll"IT qiT � � �
Unit 1 35 hrs
Collection of Poems: Devanaagari Kaavya Sankalan
�qj'f&f�
Unit 2 5 hrs
Hindi ke Pramukh Sahityakar and Scientists & Translation Tenninology:
Tulsidas, Ramkumar Varma, Premchand, APJ AbdulKalam and Vikram Sarabhai
,!_.lifl;�i:fiH 3rR" a�1f.lcpf q;,- �: $'1«1�1«, �l+l".!1+lH q"+i'f, �'�qi"�� cpffi1l, Pcrw+i" �
3rR" «��<f> � � lt"f"iGT <l>T � I
Unit 3 5 hrs
Grammar: Avikaari Shabda-Kriya visheshan, Sambandha soochak,
Samuchchaya bodhak and Vismayaadi bodhak
'&frqR'Vf: � �Tai:f: fmm �:tl'fOT, �.....t11"et1 :qcstnllli:fi" 3fu- P<lfli:q1�cst1Wfi
==..+
Reference Books:
• c/J/'114.fl ��-'if.�!ll?/\if#f6 �WW�T 3lllclTc'f,JT�'fffffW!fffFFf"'�- 2011
• �- �Jffllq� - �WPT�Ff. rf/�-2010.
• �-N�qTff- �Wfff!lFf, rf/ �-2ooa.
• � C<ffcfRT1T rren r.r-rr- \57.m � ffl'tmft� � �cr11s16/1c:-2014.
• � 'ffT?- \57. Wffitim? �- � Wlffrn, ii<'/1616/IC:-2008
• Hindi Kahani Ka Vikas Madhuresh Sumit Prakashan2016
• Anuvad Abhyas- Hindi Niband- Lakshmi Hindi Vidhyalay-Guntur2017
• Samajik Nibhand-Prof.Rajeshvar Prasad Chaturvedi Upkar Prakashan 2012
• Nirala Aur Unka Rag Virag Ashok Prakashan Nayi Dilli 2007
• Vyavaharik Hindi- Dr. Dilipsinghvi Himalaya Publication 2008
• Abinavvyavharik Hindi- Sri.Paramanand Gupta, Himalaya Publication 2010
Verified By : EAN
Name s RfoE.PH-(+(.Z. P- P _:1 FACULTY OF HUMANITIES
Signature . �---- K. Narayanapura. Kothanur PO
BenDaluru · 560017
Page 37 of 104
00CS02 19 KAN103B21
KAN103B21: KANNADA II
l)�o:Dd fJU�e��---
• rl�d NCJ&:l�rf:l�ccr t:i::x:;:i NCJ��rl e3Jcle)eli""lv �Qf" ��a:bJ�r;:i)
• �&:,�el iB'crcldi""lv�ccr m>'a3-amb e3.fcle)eli""lv� edrnie3:l�f"��?::D
l)�ojJ �e,��...
l:JeZoin::::l 2.ir.ie�oil ccro�d t:Ji'.;Jclipf"i""IW:
• rl�a �&:i�el�ccr e;IB� e3:>&�o�ioil t:i�di;'ij ��a:bJ�rn
• e::brnica 'crcle3..,i""lve,ccr
� M
�ord �rl e3:>Jcmie3:>J�oil t:J�e�i;'ij
M
�oo�rn
�
• im)eJrJi""lve,ccr
M
edardd �caf"K3oil cmccrm>�dr.)erJccr �,l'Vclw�rn
., �
ci::>d�e �:;).)� r:J.ci::>./ r:J.ci::>�./?:JMi.)
�il 12 hrs
1. im) ��e®- ��®e3��t:JJ
2. e3:Jo5E)Qet:J �rl�ii
0
---aci. �ccrcd.rcloil'crcloeS�
3. �dr.ie®0e>� cd.rcledf"e)-a- 'a3cCTe::icim>�oilca
Q ...,,
�?.)�
11 hrs
1. e3:l..J- t:Je. Ne0e>rnie3:loilel
2. �e3:>f �et:JNci e....oa accr - �. e)oie�
�e&l� .3�il 10 hrs
1. ZJcle3e, rdordOt)� e3:l�
-"
�eaccrm>'a3-aeoil- e3:>J�eda6��a
' ,,>
2. rd�,ci
�
eSv-accre,M �oeSeaa6---aci.
O
wrv6. �'crclm>e3fo'
12 hrs
l. rl.raci
v �edN ,,:j
- t'bi3oe::b
i5ml.:Odf"� ljoq1rl�:
I. e!l@e. ffid. e.3. e:ir.Je� (2017) �oeSeqa6 e;IBd�, rd� wu6 ffi<lrv6, eSoi""l�rn.
2. a:ie3oe::b (2015) l:Je3eld'crclo�ii�cmlcd.,erocioildt:i
v ,,:j
ed'crcl�ccr.
v
�,cd.rclrn.
"
3. rje. 'a3�oerfcld (2019) 'a3cdedcif\e0e>o'a3e, rd� wu6 ffi<lrv6, eSoi""l�rn.
4. ��®e3��t:JJ (2018) ii�w a:bwt:iii �� e3:ldci rlccr� rde3:>1j �&:i�el rdocme.3 1- 'crc)�el'
rl�de::b'1,rl ��'crcld, eSoi""l�rn.
DEAN
Verifi��!Y: FACULTY OF HUMANITIES
: Dv· _5t\(2..ve811A B·.S� K�ISTU JAYANTI COLLEGE AUTONOMOUS
ll. Narayanar,ura. Kot'hanur PO
Signature . �� B&ngaluru · 56ri077
Page 38 of 104
00CS02 18 ENG103A21
ENG103A21: ENGLISH II
Course Objectives:
• To develop the ability to get student's ideas across clearly to an audience, both
in speech and in writing.
• To help students develop important practical skills.
Course Outcomes:
• discuss the use of animal imagery and hypersensitive characters in the twentieth
century writings
• describe poetic style and its devices in the English verses of theVictorian Age
• analyze poems and sonnets regarding existentialist and metaphysical themes
• discover and implement new strategies of grammar in speaking English language
• integrate the prominence of media and the elements of advertising by creating
media awareness
Unit 1: Prose &-Poetry 25 hrs
James Grower Thurber: Snapshot of a Dog; Anita Desai: A Devoted Son; Max Schulman: Love is a
Fallacy; Pearl S. Buck: The Refugee; Robert Browning: Incident of the French Camp; Robert
Bridges: A Passer By; D H Lawrence: Snake; William Shakespeare: Sonnet 94; Robert Frost:
Stopping by Woods on a Snowy Evening; J B Priestley: Travel by Train; EV Lucas: Tight Corners.
Unit 2: Grammar 10 hrs

Conjunctions; Question Tags; Comparatives and Superlatives; Direct and Indirect Speech.
Unit 3: Media Awareness 10 hrs

Kinds of News; Who and Which News gets Prominence?; Who Controls the News?;
Elements of Advertising; Use of blog.
References:
Emden, Joan Van and Palgrave, Lucinda Becker. (2003) Effective Communication for Arts and
Humanities Students. New York, New York: Macmillan.
Glendinning, Eric H. and Holmstrom, Beverly. (2008) Study Reading: A Course in Reading Skills for
Academic Purposes. New Delhi: CUP.
Wren & Martin. (2001) English Grammar & Composition. New York, New York: Publisher. Yee Lin
Ho, Elaine. (2010) Anita Desai. Chennai, TN: Atlantic Publications.
DEAN
Verified By: FA LTY OF HUMANITIES
K. Narayanapura. Kothanur PO
Signature Bengaluru · 560017
Page 39 of 104
00CS02 18 NES102A01
NES102A01: ENVIRONMENTAL SCIENCE
Course Objectives:
• To understand the various aspects of Environment.
• To harness the concern for the environment and its resources.
• To comprehend the correlation between human population, social issues with that of environment.
Course Outcomes:
• understand the concept ofEnvironment and ecosystems.
• gain knowledge on various components controlling the stability of ecosystem.
• understand the Policies and laws pertaining to the welfare of life forms.
Unit 1: Introduction to environmental studies 2 hrs

Multidisciplinary nature of environmental studies;
Scope and importance; Concept of sustainability and sustainable development
Unit 2: Ecosystems 5 hrs

Definition of an ecosystem; Structure and function of ecosystem; Energy flow in an ecosystem: food
chains, food webs and ecological succession. Case studies of the following ecosystems:
a) Forest ecosystem
b) Grassland ecosystem
c) Desert ecosystem
d) Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Unit 3: Natural Resources: Renewable and Non---renewable Resources 5 hrs

Land resources and land use change; Land degradation, soil erosion and desertification.
Deforestation: Causes and impacts due to mining, dam building on environment, forests,
biodiversity and tribal populations.
Water: Use and over---exploitation of surface and ground water, floods, droughts, conflicts over
water (international & inter---state).
Energy resources: Renewable and non-renewable energy sources, use of alternate energy sources,
growing energy needs, case studies.
Unit 4: Biodiversity and Conservation 5 hrs

Levels of biological diversity : genetic, species and ecosystem diversity; Biogeographic zones oflndia;
Biodiversity patterns and global biodiversity hot spots
India as a mega---biodiversity nation; Endangered and endemic species oflndia
Threats to biodiversity : Habitat loss, poaching of wildlife, man---wildlife conflicts, biological
invasions; Conservation of biodiversity: In situ and Ex situ conservation of biodiversity.
Ecosystem and biodiversity services: Ecological, economic, social, ethical, aesthetic and
Informational value.
Unit 5: Environmental Pollution 4 hrs

• Environmental pollution : types, causes, effects and controls; Air, water, soil and noise
pollution
• Nuclear hazards and human health risks
• Solid waste management: Control measures of urban and industrial waste.
• Pollution case studies.
Unit 6: Environmental Policies & Practices 4 hrs

• Climate change, global warming, ozone layer depletion, acid rain and impacts on human
communities and agriculture
• Environment Laws: Environment Protection Act; Air (Prevention & Control of Pollution) Act;
Water (Prevention and control of Pollution) e Protection Act· Forest Conservation Act.
F
FACULTY OF SCIENCE
\J'��J �
L,p
Page 40 of 104
KRISTU JAYANTI cot 1.r.c£ Au1 m�� Mous �£L ,-
-w
,
f0 <':r'
n:ipur. Ko\h:i1111r , 0
K N�HJVJ
00CS02 18 NES102A01
International agreements: Montreal and Kyoto protocols and Convention on Biological Diversity
(CBD).
• Nature reserves, tribal populations and rights, and human wildlife conflicts in Indian context
Unit 7: Human Communities and the Environment 5 hrs
• Human population growth: Impacts on environment, human health and welfare.
• Resettlement and rehabilitation of project affected persons; case studies.
• Disaster management: floods, earthquake, cyclones and landslides.
• Environmental movements: Chipko, Silent valley, Bishnois of Rajasthan.
• Environmental ethics: Role of Indian and other religions and cultures in environmental
conservation.
Suggested Readings:
Carson, R. 2002. Silent Spring. Houghton Mifllin Harcourt.
Gleeson, B. and Low, N. (eds.) 1999.Global Ethics and Environment, London, Routledge.
Gleick, P. H. 1993. Water in Crisis. Pacific Institute for Studies in Dev., Environment
& Security. Stockholm Env. Institute, Oxford Univ. Press.
Groom, Martha J., Gary K. Meffe, and Carl Ronald Carroll.Principles of Conservation
Biology. Sunderland: Sinauer Associates, 2006.
Grumbine, R. Edward, and Pandit, M.K. 2013. Threats from India's Himalaya dams. Science,
339: 36---37.
Mccully, P. 1996. Rivers no more: the environmental effects ofdams(pp. 29---64). Zed Books.
McNeill, John R. 20 0 0 . Something New Under the Sun: An Environmental History of the
Twentieth Century.
Odum, E.P., Odum, H.T. & Andrews, J. l 971.Fundamentals of Ecology. Philadelphia: Saunders.
Rao, M.N. & Datta, A.K. 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd.
Raven, P.H., Hassenzahl, D.M. & Berg, L.R. 2012.Environment. 8th edition. John Wiley & Sons.
Rosencranz, A., Divan, S., & Noble, M. L. 2001. Environmental law and policy in India. Tripathi
1992.
Sengupta, R. 2003. Ecology and economics: An approach to sustainable development. OUP.
Singh, J.S., Singh, S.P. and Gupta, S.R. 2014. Ecology, Environmental Science and Conservation. S.
Chand Publishing, New Delhi.
Sodhi, N.S., Gibson, L. & Raven, P.H. (eds). 2013. Conservation Biology: Voices from the Tropics.
John Wiley & Sons.
Thapar, V. 1998. Land of the Tiger: A Natural History of the Indian Subcontinent.
Warren, C. E. 1971. Biology and Water Pollution Control. WB Saunders.
Wilson, E. 0. 2006.The Creation: An appeal to save life on earth. New York: Norton.
World Commission on Environment and Development. 1987.0ur Common Future. Oxford
University Press.
Gadgil, M., & Guha, R.1993. This Fissured Land: An Ecological History of India. Univ. of
California Press.
Pepper, I.L., Gerba, C.P. & Brusseau, M.L. 2011. Environmental and Pollution Science. Academic
Press.
k
FACULTY OF SCIENCE 1MOUS
LLEGE f\UT0��
KRISTU JAYANTI CO Koth::inur u
K N,H311;\t13\HH<l,
I
0011
. Be�galuru . 56
Page 41 of 104
00CS02 18 BCA204A21
BCA204A21: DATA STRUCTURES
Course Objective:
• To inculcate knowledge on implementing Data Structure concepts using C programming
language.
Course Outcomes:
• explain data structures, dynamic memory management and usage of pointer variables
• differentiate operations associated with arrays, linked lists, stacks, queues and trees
• design recursive procedures, sorting and searching algorithms for data structure applications
Unit 1: Introduction to Data Structures 14 hrs

Introduction - Definition; Classification of data structures, primitive and non-primitive; Operations on
data structures.
Pointers - Definition; Accessing the address of a variable; Declaring and initializing pointers;
Accessing a variable through its pointer.
Dynamic Memory Allocation - Define static and dynamic memory allocation; Memory allocation
functions, malloc, calloc, free and realloc.
Recursion - Definition; Types; Recursion in C; Writing recursive programs, Binomial coefficient,
Fibonacci series, GCD, Towers of Hanoi.
Unit 2: Searching and Sorting 12 hrs

Searching - Basic searching techniques: Sequential search, Binary search - Iterative and recursive
methods; Comparison between sequential and binary search.
Sorting - Definition; Different types, Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort,
Heap sort.
Unit 3: Stack and Queue 10 hrs

Stack - Definition; Array representation of stack; Operations on stack; Polish notation; Reverse Polish
notation; Applications of stack, Conversion of an infix arithmetic expression to postfix, Evaluation of
postfix expression.
Queue - Definition; Array representation of queue; Types of queue, Simple queue, Circular queue,
Double ended queue, Priority queue, Operations on all types of queues.
Unit 4: Linked List 12 hrs

Definition; Components of linked list; Representation of linked list; Advantages and disadvantages of
linked list; Types of linked list: Singly linked list, Doubly linked list, Circular linked list, Circular
doubly linked list; Operations on singly linked list: creation, insertion, deletion, search and display.
Unit 5: Tree 12 hrs

Tree - Definition, Tree, Binary tree, Complete binary tree, Binary search tree, Heap; Tree
terminology, Root, Node, Degree of a node ,Degree of a tree, Terminal nodes, Non terminal nodes,
Siblings, Level, Edge, Path, Depth, Parent node, Ancestors of a node. Binary tree: Array and linked
representation of binary tree; Creation of binary tree; Traversal of binary tree: Preorder, Inorder,
Postorder; Variations of binary tree: Binary search tree(BSn; Heap: Insertion and deletion of a node.
�
Verified By : .. h-· u,)o '\"' �oW)'.U FACULTY OF SCIENCE
Name KRIS TU JAYANTI CQLLEGE AUTONOMOUS
Q�
Signature Bengaluru - 560077
Page 42 of 104
00CS02 18 BCA204A21
Text Books:
Kamthane Ashok.(2009).Introduction to Data Structures in C. (1 st ed.). Pearson.
Langsam Yedidyah, Augenstein J Moshe,Tenenbaum M Aaron.(2010).Data Structures Using C and
C++(2°d ed.). New Delhi : Pill Learning Private Ltd.
Lipschutz Seymour.(2010). Data Structures with C(I st ed.).New Delhi :Tata McGraw-Hill Education
References:
Balagurusamy .E.(2013). Data Structures Using C(I st ed.). New Delhi:McGraw Hill Education.
Horowitz Ellis, Sahni Sartaj, Freed Anderson Susan.(2008).Data Structures Using C(2nd ed.).
Universities Press.
Gilberg F Richard ,Forouzan A Behrouz. (2007). Data Structures : A Pseudocode Approach with C(2°d
ed.). Cengage Learning.
Kanetkar Yashavant.(2010). Data Structures Through C(2"d ed.). New Delhi :BPB Publication.
Kanetkar P Yeshwant.(2009).Understanding Pointers in C (4th ed.). New Delhi: BPB Publications.
Tremblay Paul Jean,Sorenson Paul.(2001). An Introduction to Data Structures with Application
(2nd ed.).New Delhi:Tata McGraw - Hill Education.
verified Bey: : f;.-. Luo 'P �or()(U

FACULTY OF SCIENCE
Na m KRISTU JAYANTI COLLEGE AUTONOMOUS
Signature
.Q� Bengaluru - 560077
Page 43 of 104
00CS02 18 BCA204A22
BCA204A22: PROGRAMMING IN JAVA
Course Objective:
• To inculcate knowledge on the architecture-neutral nature of Java and the concepts of Object
Oriented programming.
Course Outcomes:
• compare Procedural and Object-oriented Programming Paradigms
• construct windows and frame based GUI applications using control fundamentals
• construct windows and A WT based applications using control fundamentals
Unit 1: Introduction to Java and Features of Java 10 hrs

History; Evolution of Java; How Java changed internet; Fundamentals of object-Oriented
programming; Basic concepts of object-oriented programming; Benefits of object-oriented
programming; Features of Java; How Java differs from C and C++; Overview of Java; Simple Java
program; Structure; Java development kit (JDK); Java interpreter; Java virtual machine. Data types;
Variable; Type conversion and casting; Operators and expressions; Programming structure; Operators
and expressions; Decision-making and branching: If; If.. Else; Nested If; Switch;?: Operator; Looping:
While; Do; For - Jumps In Loops - Labeled loops; Array - Types of arrays; String handling.
Unit 2: Classes Inheritance Packages & Interfaces 16 hrs

Classes - Class fundamentals; Methods; Naming conventions; Declaring objects; Access specifiers;
Final; Static; Abstract. Native. Volatile; Synchronized. Constructors; Command line arguments; this
keyword; Garbage collection; finalize method; Overloading methods.
Inheritance - Single; Multilevel inheritance; Method overriding-Dynamic method dispatch; Abstract
classes ,Usage of super; Abstract; Final keywords.
Interfaces-Defining an interface; Implementing interfaces; Variables in interfaces; Extending
interfaces; Implementing interface.
Package - Define package; CLASS PATH; Access protection; Importing packages. Lang-Package -
Wrapper classes; Util package:-Date; Calendar; Random; IO packages:-File input stream and Output
stream.
Unit 3: Exception Handling Multithreading 10 hrs

Exception Handling - Fundamental of exception; Exception types; Using try & catch; Multiple catch;
Nested try; Throw; Finally; Built-in exception; User-defined exception.
Multithreading-Thread fundamentals; Priorities; Creating thread using thread class and runnable
interface.
Unit 4: Applets & Event Handling 10 hrs

Applet- Basics; Applet architecture; Applet life cycle; Applet display methods; Repaint; Status
window; Passing parameters to applets; Getdocumentbase(); Getcodebase(); Applet context and
showdocument().
Verified By : : h· Lljo 1' '1hov-niiu �

Signature
·Ob KRISTU JAYANTI COLLEGE AUTONOMOUS
Bengaluru - 560077
Page 44 of 104
00CS02 18 BCA204A22
Event Handling - Event handling mechanisms; Delegation event model; Event classes; Sources of
events; Event listener interfaces; Handling mouse and keyboard events; Adapter classes; Inner classes.
Unit S: AWT & AWT Controls 14 hrs

AWT-AWT classes; Window fundamentals; Working with frame windows; Creating a frame window
in an applet; Creating a windowed program; Displaying information within a window.
AWT Controls-Layout managers and menus - Control fundamentals; Labels; Buttons; Check boxes;
Check box group; Choice control; Lists; Scroll bar; Text field; Text area; Layout managers; Menu bars
and Menus; Dialog boxes; File dialog; Handling events by extending AWT components.
Introducing Swing - Origins; Features; MVC connection; Components & containers; Simple swing
application; Swing applet.
Java 1/0 Classes - File; Stream classes; Byte streams; Character streams.
Text Books:
Balagurusamy. E. Programming with JAVA a Primer. New Delhi: Tata McGraw- Hill Publishing
Company Limited.
Herbert Schildt. The Complete Reference- Java (7th ed.).New Delhi: Tata McGraw-Hill Publishing
Company Limited.
References:
Daniel Liang Y.(2007). Introduction to JAVA Programming (6th ed.). Pearson Education.
Deitel and Deitel. Java Programming. Prentice Hall.
Debasish Jana. (2005).Java and Object-Oriented Programming Paradigm, Pill.
John Hubbard R. Programming With Java( 2°d ed.). TMH.
Kathy Sierra. Head First Java. (2°ded.).O'Reilly Media.
NageswaraRao. R. (2008).CORE JAVA An Integrated Approach. Dream tech Press.
�
DEAN
Verified ·By :
N a me : �. LUo r> �ornc:L.$ FACULTY Of SCIENCE
KRISTU JAYANTI COLLEGE AUTONO
MOUS
Signature .Q� I<.. Narayanapura, Kothanur PO

lengaluru • 560077
Page 45 of 104
00CS02 18 BCA204A23
BCA204A23: MATHEMATICAL FOUNDATION IN COMPUTER APPLICATIONS
Course Objective:
• To acquire basic knowledge of various mathematical concepts related to computer
programming.
Course Outcomes:
• solve system of equations in three variables using Cramer's rule and matrix method
• evaluate inverse of a matrix using fonnula and Cayley Hamilton theorem
• explain algebraic structures, vector dot product, cross product, scalar triple product and vector
triple product
• use the equations of line and plane
• evaluate derivative and integral
Unit 1: Matrices 10 hrs

Review of fundamentals: Definition of matrix, order of a matrix, types of matrices, algebra of matrices;
Detenninant: Value of determinant of order 2x2 and 3x3,Minors, cofactors, adjoint and inverse of a
matrix; Solutions of systems of linear equations in two and three variables: Cramer's rule and matrix
method; Eigen values and Eigen vectors: definition and problems (no theorems) for matrices of order
2x2;Cayley-Hamilton theorem (only statement); Verification of Cayley Hamilton theorem (only2x2
matrices);Inverse of a matrix using Cayley-Hamilton theorem.
Unit 2: Algebraic Structures & Vectors 15 hrs

Binary operations: definition of group, properties (only statements), problems, finite and infinite
groups, subgroups, theorems (no proofs), problems.
Vectors: Definition of vectors and scalars; vector addition; dot and cross product; projection of a vector
on another(no geometric meaning); area of a parallelogram; area of a triangle; scalar triple product;
volume of parallelepiped; Co planarity of three vectors; vector triple product.
Unit 3: Analytical Geometry 12 hrs

Definition of vector r; magnitude; problems; distance between two points; direction cosines; direction
ratios; angle between two lines; angle between two vectors; angles of a triangle; angle between
diagonals of a cube.
Equation of a line, condition for lines to be parallel and perpendicular, point of intersection of lines;
equation of a plane, reflection of a point on a line and on a plane.
Unit 4: Differential Calculus 08 hrs

Derivatives: Standard derivatives, product rule, quotient rule, chain rule, second order derivatives, nth
derivative of some standard functions.
Verified By : Ljo � %orno..J

Name : ,f¥. �
FACULTY OF SCIENCE
.(;l,)s
KRISTU JAYANTI COLLEG
Signature E AUTONOMOUS
K. Narayana,ura, Koth
anur PO
Ben�aluru . 560077
Page 46 of 104
00CS02 18 BCA204A23
Unit 5: Integral Calculus 15 hrs

Standard Integrals; Integration by substitution; Integration by partial fractions; Integrals of the type
, J (p: q) ctx, Integration by parts; Definite integrals(without properties).
tx +
c
J
2
ax +bx+c ax +bx+c
Text Books:
Ranganath, G.K.(2013).A Text for BCA Mathematics.Delhi:S.Chand.
References:
Herstein, I.N. Topics in Algebra(2nd ed.). Wiley Eastern Limited.
Sharma, J K (2011).Discrete Mathematics(3n1 ed). New Delhi: Macmillan Publishers India ltd.
Shantinarayan, S. Differential Calculus Delhi: S.Chand.
Shantinarayan, S. Integral Calculus, Delhi: S.Chand.
Shantinarayan, S. Elements of Analytical Solid Geometry.Delhi: S.Chand.
�
FACULTY OF SCIENCE
Bengaluru - 560077
Page 47 of 104
00CS02 18 BCA2L2A21
BCA2L2A21: DATA STRUCTURES PRACTICAL
Course Objective:
• To inculcate knowledge on implementing Data Structure concepts using C programming
language.
Course Outcomes:
• write programs explaining the data structures operations
• develop programs for searching and sorting techniques
• execute recursive functions for tower ofHanoi, binomial coefficient and GCD
1. Write a C program to fmd the Binomial coefficient using recursion.

2. Write a C program to simulate the working ofTowers ofHanoi problem for N disks, print the
moves taken by the problem using recursion.
3. Write a C program to find the greatest common divisor oftwo numbers using recursion.
4. Write a C program to search for the greatest and smallest element in an array of integers using
sequential search.
5. Write a C program to search for an element in an array using Binary search.
6. Write a C program to sort a list ofN elements using Bubble sort technique.
7. Write a C program to sort a list ofN elements ofinteger type using Selection sort technique.
8. Write a C program to sort a list ofN elements using Merge sort technique.
9. Write a C program to sort a list ofN elements ofinteger type using Quick sort technique.
10. Write a C program to demonstrate the working of a stack using an array. The elements ofthe
stack may be integers. Operations to be supported are I.PUSH, 2.POP, 3.DISPLAY. The
program should print appropriate messages for stack overflow, underflow. Use separate
functions to detect these cases.
11. Write a C program to convert and print a given valid fully parenthesized infix arithmetic
expression to postfix expression.
12. Write a C program to simulate the working of linear queue using an array. Provide the
operations QINSERT, QDELETE and QDISPLAY. Check the queue status for empty and
full.
13. Write a C program to simulate the working of a circular queue using an array. Provide the
operations CQINSERT, CQDELETE and CQDISPLAY. Check the circular queue status for
empty and full.
14. Write a C program to implement the operations ofa linear queue using linked list.
15. Write a C program to evaluate a postfix expression.
16. The preorder and inorder traversals ofa Binary search tree are given below:
Inorder: 5, 10, 15, 20, 30, 40 Preorder: 20, 10, 5, 15, 40, 30
Write a program that can generate the postorder traversal ofthe Binary search tree.
17. Using dynamic memory allocation, construct a Binary search tree of integers. Write C
functions to do the following:
Given a Key, Perform a search in Binary search tree. If it is found display Key found else
insert the Key in the Binary search tree.
While constructing the Binary search tree do not add any duplicate.
Display the tree using all the traversal methods.
Verified By : �
Name : f'r, LJo 1' %ov-ntU
FACULTY OF SCIENCE
.Qf
�RISTU JAYANTI COLLEGE AUTONOMOUS
Signature It Narayanapura, Kothanur PO
�engaluruPage
· 560077
48 of 104
00CS02 18 BCA2L2A21
18. Write a C program to sort a list of N elements of integer type using Heap sort technique.
19. Using dynamic variables and pointers, write a C program to create and implement the listed
operations in a singly linked list. Each node has the fields Roll Number (Integer) and Name
(Character String) .The Operations to be supported are:
(a). LINSERT() - Inserting a node(front of the list and after a node) and LDISPLAY() -
displaying all the nodes in the linked list.
(b). LSEARCH() - Searching a node based on Roll number and LDELETE{) - deleting a node
based on Roll number.
20. Using dynamic variables and pointers, Write a C program to create and implement the listed
operations in a doubly linked list. Each node has the fields Roll Number (Integer) and Name
(Character String) .The Operations to be supported are:
(a). DLINSERT() - Inserting a node(front of the list and after a node) and DLSEARCH() -
searching a node in the list based on roll number.
(b). DLDELETE() - Deleting the node based on Roll number and DLDISPLAY() - displaying
all the nodes in the list.
For programs 19 and 20, for evaluation, the student is expected to write and execute any one of
the options amongst (a) and (b).
Evaluation Criteria
Criteria Marks
Writing any two programs from the given 7.5x2=15
three questions
Executing the written two programs. 7.5x2=15
Viva Voce 5
Total 35
�
FACULTY OF SCIENCE
Verified By:
Name : f;-. -LUo 1' 1toN">a..i KRISTU JAYANTI COllEGE AUTON
OMOUS
-Q__b
Signatur� Bengaluru - 560077
Page 49 of 104
00CS02 18 BCA2L2A22
BCA2L2A22: PROGRAMMING IN JAVA PRACTICAL

Course Objective:
• To inculcate knowledge on the architecture-neutral nature of Java and the concepts of Object
Oriented programming.
Course Outcomes:
• build sequential, decision making and iterative Java programs
• design GUI based applications using applets and frames
1. Write a program to display all prime numbers between a given range.
2. Write a program to implement at least six String methods.
3. Write a program to display a multiplication table.
4. Write a program to insert element in existing array.
5. Write a program to demonstrate the usage of super and this keyword.
6. Write a program to find area of geometrical figures using method overloading.
7. Write a program to execute any Windows95 application (Like notepad calculator etc.).
8. Write a program to find out total memory, free memory and free memory after executing
garbage collector (gc ()).
9. Write a program to copy a file to another file usingjava.io package classes. Get the file names
at run time and if the target file exists then ask confirmation for overwriting and take necessary
actions.
10. Write a program to list files in the current working directory depending upon a given pattern.
11. Write a program to create object for TreeSet and Stack and implement all its methods.
12. Write ajava program to implement Exception Handling.
13. Write ajava program to create an Interface and implement it in a class.
14. Write a java program to create a class by extending the Thread class and use the methods of
Thread class to change name, priority of the current Thread and display the same.
15. Create a text field that allows only numeric value and in specified length.
16. Write a program to implement mouse events in an applet.
17. Create a Frame and checkbox group with five checkboxes, with label as Red, Green, Blue,
Yellow and White. At runtime change the background color of the frame with appropriate
selection of the checkbox.
18. Create a Frame with three Scrolls and change the background color of the frame using RGB
function with values of scrolls.
19. Write a program to display a frame with a button. The caption of the button should be "Change
Color". For every click of the button, the background color of the frame should change
randomly.
20. Write an applet that displays the current time. This applet should also change its color after
every 2 seconds.
Evaluation Criteria
Criteria Marks
Writing any two programs from the given 7.5 x 2=15
three Questions
Executing the written two programs. 7.5 x 2=15
Viva Voce 5
Total 35
Verified By :
Name f;..-. Lu\,� 1tom� �
FACULTY OF SCIENCE
G�
Kl'IISTU JAYANTI COLLEG
Signature E AUTONOMOUS
It Narayanapura, Koth
anur PO
Page 50 of 104
00CS02
III Semester
Page 51 of 104
00CS02 18 ENG103A31
ENG103A31: ENGLISH III
Course Objectives:
• To develop student's proficiency in the language and develop their communication
skills.
• To equip learners with skills for self-learning.
Course Outcomes:
• state the problems of a man and the significance of parental affection in real life
• review the historical background of true events in Roman history
• extrapolate the reflections on the lives of writers in literary genres
• interpret the significance of English literature in the forms of movies and serials in
media
• formulate the structure of oral and written presentations and develop speaking skills

Maya Angelou: Life Doesn't Frighten Me; Francis Bacon: Of Parents and Children; Rabindranath
Tagore: Kabuliwala; Munshi Premchand: The Shroud;William Shakespeare: Julius Caesar (Act ill,
Scene II); Rupert Brooke: The Great Lover; Aldous Huxley: Pleasures; A J Cronin: The Turning Point
of My Life; Keki N Daruwalla: Pestilence in Nineteenth-Century Calcutta;WW Gibson: The Stone.
Unit 2: Play 15 hrs

Agatha Christie: And Then ThereWere None.
Unit 3: Writing Skills 7 hrs

Presentation skills & paper presentation; Note Taking; LetterWriting; Comprehension; Letters
to the Editor.
References:
Bevington, David. (2002) Shakespeare. Oxford: Blackwell.
Chakravarty, Radha. (2013) Novelist Tagore. New York, New York: Routledge Publications.
Lupton, Mary Jane. (1998) Maya Angelou: A Critical Companion.Westport, Connecticut: Greenwood
Press.
r
Verified By:
---DJ
FA ULTY OF HUMANITIES
K. Narayanapura. Korhanur PO
Signature
Bengaluru · 560017
Page 52 of 104
00CS02 18 BCA204A31
BCA204A31: VISUAL PROGRAMMING

Course Objective:
• To design and develop Windows-based applications using Visual Basic.NET programs that
meet viable programming standards.
Course Outcomes:
• design graphical user interface using multiple fonns, modules, menus and VB.Net controls
• analyze VB.Net controls to resolve defects and revise existing code
• integrate connectivity between user interface and the database
Unit 1: Getting Started with Visual Basic 12 hrs
Introduction-Introduction to Visual programming; Arithmetic Operators, Data type, Statements,
Control Statements, Loops, Arrays, Structures, Val and Structure functions, Creating Visual studio
Applications, Saving Visual Basic Application.
Object Oriented Programming - : Basic Principles of Object Oriented Programming, Member Access
Modifiers, Define Class, Creating Objects, Constructors, Inheritance, Abstract Classes, Interfaces,
Polymorphism
Unit 2: VB.NET Essentials I 14 hrs
Windows Forms: Introduction to the windows fonns, Setting the title Bar Text, Minimizing and
Maximizing a fonn, Setting initial position of a fonn, Working with multiple fonns, Creating adding
controls to a fonn, Setting controls Tab order, Naming Controls, Setting Properties at design time,
Setting properties at run time.
Visual Basic Controls: Creating a message box, Creating a Input box, Creating MDI Applications,
Creating Dialog box, Commenting the code, Label, Text Box, Button, Combo Box and List Box
Controls: Label Control, Button Control, Combo Box Control.
Unit 3: VB.NET Essentials II 10 hrs
Progress Bar Control, Timer Control, Checkbox, radio button, and group box controls: Checkbox
control, Radio button control, List Box Control, Panel, Picture Box, Tree View Control
Unit 4: Menus, Dialog boxes and Exception Handling 12 hrs
Project Menus, built-in dialog boxes :Menus, Folder Browser
Dialog Control, Open File Dialog Control Save File Dialog Control, Font File Dialog Control, Color
File Dialog Control, Print Document Control.
Mouse Events and Keyboard Events: Mouse Events, Keyboard Events , Handling Errors and
Exceptions: Errors, Exceptions.
Unit 5: Working with Databases: 12 hrs
Accessing data using ADO.NET
What are Databases?, Basic SQL statements, Working with ADO.NET, Overview of ADO.NET
objects, Data Grid View, Control, Accessing data using server explorer, Creating a new data
connection, Accessing data using Data Adapters and Datasets, Previewing data from Data Adapters,
Connecting to a SQL server database.
Text Books:
Vikas Gupta Comdex .NET 4.5 programming Course Kit.
Kogent Solutions Inc.,".NET 4.5 Programming", Black Book, Dream Tech.
References:
XueBai, Michael Ekedah (2006). "The Web Warrior Guide to Web Programming", Thomson .
Bill Sheldon, BillyHollis, RobWindsor, DavidMcCarter, Todd Herman. "Professional Visual Basic
2012 and .NET 4. 5 Programming" (1 st ed.).
Verified
· By: : h-· LJo 'P OEN
Name FACULTY QF SCIENCE
·Q�·
KRIStU JAYANTI COLLEGE AUTONOMOUS
Signature
K. Naravanapura, Kethanur PO
Bengaluru
Page •53560077
of 104
00CS02 18 BCA204A32
BCA204A32: DATABASE MANAGEMENT SYSTEM
Course Objective:
• To introduce the basic database concepts and functioning of Database Management System
with associated tools and techniques.
Course Outcomes:
• explain the concepts of relational data model, Normalization, database design and relational
algebra
• construct ER model for data tables and formulating SQL queries on data
• illustrate data retrieval and hashing techniques
Unit 1: Introduction to Database Management System 9 hrs

Introduction - Database and database users; Characteristics ofthe database approach; Different people
behind DBMS; Implications of database approach; Advantages of using DBMS; When not to use
DBMS.
Database System Concepts and Architecture - Data models; Schemas and instances; DBMS
architecture and data independence; Database languages and interfaces; The database system
environment; Classification ofDBMS.
Unit 2: Data Modeling and Record Storage 10 hrs

Data Modeling Using the ER Model - High level conceptual data models for DB design with an
example; Entity types; Entity sets; Attributes; Keys; ER model concepts; Notation for ER diagrams;
Proper naming ofschema constructs; Relationship types ofdegree higher than two.
Record Storage and Primary File Organization - Hardware description of disk devices-Track,
Sector, Disk block or pages; Buffering of blocks; Placing file records on disk; Operations on files; File
ofunordered records (Heap files); Files ofordered records (Sorted files); Hashing techniques.
Unit 3: Normalization and Relational Data Model 15 hrs

Functional Dependencies and Normalization for Relational Databases - Informal design guidelines
for relational DB schema; Functional dependencies; Normal forms based on primary keys; General
definitions - First normal form, Second normal form and Third normal forms, Boyce-Codd normal
form.
Relational Data Model - Relational model concepts; Relational constraints and relational database
schemas; Defining relations; Update operations and dealing with constraint violations.
Relational Algebra - Basic relational algebra operations; Additional relational operations; Examples of
queries in the relational algebra; Relational database design using ER-to- relational mapping; ER-to
relational mapping algorithm.
Unit 4: Relational Database Language 15 hrs

SQL - Data definition in SQL; Queries in SQL-Insert, Delete and Update statements in SQL; Views in
SQL; Specifying general constraints as assertions; Specifying domain and indexes; Additional features
ofSQL.
Verified By: �
Name
FACULTY OF SCIENCE
Signature KRISTU JAYANTI COLLEGE AUTONOMOUS
8engaluru - 560077
Page 54 of 104
00CS02 18 BCA204A32
Unit 5: Transaction Processing Concepts 11 hrs

Transaction Processing - Introduction; Transaction and system concepts; Desirable properties of
transaction; Schedules and recoverability; Serializability of schedules; Transaction support in SQL.
Concurrency Control Techniques - Locking techniques for concurrency control; Concurrency control
based on time stamp ordering; Optimistic concurrency control techniques.
Text Books:
Elmasri & Navathe.(2003).Fundamentals of Database Systems. Pearson Education.
Scott Ulman. Orac/e9i PLISQL programming.Tata McGraw-Hill.
References:
C.J.Date.Introduction to Database Systems. (6th ed.)AddisionWesley.
Das Gupta,Pranab Kumar(2009).Database Management System, Oracle SQL and PLISQL.PID
Leaming.
Hector Garcia-Molina,Jeffiey D. Ullman,JenniferWidom(2006).Database Systems: The Complete Book
. Pearson.
Ivan Bayross(2008).The Programming Languages of0racle.(3rd ed.).BPB Publications.
Patrick O'Neil (2002).Data Base Principles; Programming & Performance.(2nd ed.). Academic Press.
Raghu Ramakrishnan, Johannes Gehrke.Database Management Systems.(3rd ed.). Kindle Edition.
Silberschataz, Korth,Sudarshan. Database System Concepts. McGrawHill.
Sundarraman.Orac/e 9i Programming A Primer.(l st ed.) Pearson Education.
Verified By : �
N am e FACULTY OF SCIENCE
Sio0nature K. Narayanapura, Kothanur PO
Page 55 of 104
00CS02 18 BCA204A33
BCA204A33: OPERATING SYSTEM CONCEPTS AND UNIX I LINUX
Course Objective:
• To acquire the fundamental knowledge of the operating system architecture, components and
various operations performed by the operating system.
Course Outcomes:
• compare batch, time sharing, real time and distributed operating systems
• explain system calls and services, virtual machines, file access and file allocation methods
• demonstrate CPU scheduling, disk scheduling, page replacement algorithms and process
synchronization
• analyze the critical section problems, deadlocks and storage management
• design Shell Scripts using Unix tools and utility commands
Unit 1: Introduction to Operating Systems 7 hrs

What is an operating system?; History of OS; Simple Batch Systems; Multi programmed Batched
Systems; Time-Sharing Systems; Distributed Systems and Real-Time Systems; Operating System
Structures; Services; System Calls; System Programs and Virtual Machines.
Unit 2: Process and Storage Management 20 hrs

Process Management: Process Concept; Process Control Block; Process Scheduling; CPU Scheduling
- Basic Concepts; Scheduling Algorithms - FIFO; RR; SJF; Multi-level; Multi-level feedback. Process
Synchronization and deadlocks: The Critical Section Problem; Synchronization hardware; Semaphores;
Classical problems; Deadlock: System model; Characterization; Deadlock prevention; Avoidance and
Detection; Recovery from deadlock; combined approach to deadlock handling.
Storage Management: Basic Concepts; Logical and Physical Address Space; Swapping; Contiguous
Allocation; Paging; Segmentation; Virtual Memory - Demand Paging; Page Replacement Algorithms;
Allocation of Frames; Thrashing and Demand Segmentation.
Unit 3: File and 1/0 System 10 hrs

File Concept; Access Methods; Directory Structure; Protection; File system Structure; Allocation
Methods; Free-Space Management.
Overview of VO systems; VO interface; Secondary storage structure -Disk Structure; Disk Scheduling.
Unit 4: Unix/ Linux Operating System 13 hrs

Unix File System, Tools & Utilities and Process Management
History; Features; Architecture; File system: Boot Block; super block; inode table; data block; storing
and accessing files; directory and file related commands.
Special Tools and Utilities: Filters process; pipe and pipeline; process control; FORK; EXIT; WAIT
& EXEC system call; Unix system calls and Library functions.
Process Management: Process state; data structure of a process; user vis kernel mode; context of a
process; background processes; process scheduling; process terminating and examining commands.
Verified By: • F I ,, �
Name • To· � o FACULTY OF SCIENCE
KRISTU JAYANTI COL
·Qb
LEGE AUTONOMOUS
Signature K. Narayanapura, Kot
hanur PO
Ben,aluru • 560077
Page 56 of 104
00CS02 18 BCA204A33
Unit S: System Administration and Shell Programming 10 hrs

User & supervisor privileges & facilities; accessing the file system; security issues Secondary storage
management
Shell Programming: C Shells; shell variables; parameter shell commands; if; while; until; for; break;
continue and simple programs. Unix System Communication Introduction: write; read; wall; mail
commands.
Text Books:
Stallings Williams.(2005). Operating Systems, (2nd ed.), Prentice Hall.
Silberschartz Abraham, Galvin Baer Peter. (2000). Operating System Concepts. (51h & 6th edition), John
Wiley & Sons.
Sumitabha Das. UNIX Concepts and Applications. (41h ed.), Tata McGraw-Hill Education.
References:
Forouzan Behrouz, A. and Gilberg Richard, F. (2003). UNIX and Shell Programming, Brooks/Cole
Thomson Learning.
Sobell Mark, G. (1994). UNIX System V: Practical Guide. Addison-Wesley Professional.
Godbole Achyut, S .(2005). Operating Systems with case studies in UNIX, (2nd ed.), Tata McGraw-Hill
Education.
Milo, (2014). Unix and Linux System Administration and Shell Programming, OSData Publications.
Raymond Eric, S. (2009). The art of UNIX programming, Pearson Education.
Kernighan, B. W. and Robert, B. (1984). The UNIXProgramming Environment. Prentice Hall.
Gandhi Meeta, Shetty Tilak and Shah Rajiv. (1992). Vijay Mukhi's the 'C' Odyssey: UNIX - the Open
boundless C", Tech Publications.
Milenkovic Milan. (2001). Operating Systems Concepts and Design. (2nd ed.), Tata McGraw Hill
Education.
�
FACULTY OF SCIENCE
Page 57 of 104
00CS02 18 BCA204A34
BCA204A34: PROBABILITY AND STATISTICS

Course Objective:
• To introduce statistical tools for univariate and bivariate data analysis.
Course Outcomes:
• analyze univariate data using measures of central tendency, measures of dispersion and
skewness
• evaluate bivariate data set using correlation and linear regression
• apply addition and multiplication probability law
• discriminate probability distributions as discrete -binomial, poisson; and continuous- normal
• relate test of significance for means, difference of mean, proportions, difference of proportions,
chi-square test for independences of attributes and goodness of fit
Unit 1: Univariate Data Analysis 18 hrs
Need for quantifying data; Quantitative and qualitative data; Frequency distributions- discrete and
continuous; Histogram, Frequency curve, Cumulative frequency curve; Measures of central tendency -
Mean, median and mode; Measures of dispersion - quartile deviation, standard deviation, coefficient of
variation; Skewness -Karl Pearson and Bowley's formula; Kurtosis(definition).
Unit 2: Bivariate Data Analysis 12 hrs
Correlation and regression -Definition, Explanation of concepts, Karl Pearson and Spearman's rank
correlation; Curve Fitting - Linear and quadratic.
Unit 3: Probability 10 hrs
Basic concepts- Trail, Sample space, Event, Types of events; Definitions of probability; Addition and
multiplication rules of probability; Conditional probability; Baye's theorem; Random variables;
Expectation.
Unit 4: Probability Distribution 8 hrs
Discrete: Binomial, Poisons, -mean and variance (without proof) and problems. Continuous:
Exponential, Normal -Mean and variance (without proof) and problems.
Unit 5: Inferential Statistics 12 hrs
Definition of nuU, Alternate, Simple and composite hypothesis; Level of significance; Type I and type
II errors; Testing equality of single and two means (large samples), Single and two proportions;
Independence of attributes.
Text Books:
Seema Sarnbargi-itagi. (2001 ). A Text Book ofProbability and Statistics.(! st ed. ).Himalaya Publishing House.
References:
Gupta, S.C. (20I 4)Fundamentals ofStatistics. (ihed.).Himalaya Publishing House.
Gupta, S.P. (2006). Statistical Methods. (4tti ed.). S. Chand.
Mann, et. al. (2012)An Introduction to Probability and Statistics. (i1id ed.). Wiley India
Ravi Kumar, Hema .(1998). A Text Book ofStatistics. (2nded). United Pub.
Sharma, K.V.S. (2002).Statistics made Simple Do it yourselfon PC. Prentice Hall of India Pvt. Ltd.
Sooryanarayana, B. Probability andStatistics.(2008). S. Chand.
Spieger, M.R (1980). Theory and Problems ofProbability and Statistics. London: Schaum's Outline Series,
McGraw Hill.
Verified By : �
Name : .f; · LlJ� 'f> '1ton') � DEAN
FACULTY OF SCIENCE
.QL_
KRISTU JAYANTI C8LLEGE
Signature AUTONOMOUS
K. Naravanapura, Kothanur
PO
8engaluru - 5i0077
Page 58 of 104
00CS02 18 BCA2L2A31
BCA2L2A31: VISUAL PROGRAMMING PRACTICAL
Course Objective:
• To design and develop Windows-based applications using Visual Basic.NET programs that
meet viable programming standards.
Course Outcomes:
• create VB.Net programs using logical altematives,variables,constants,forms and multiple array
techniques
• manage connectivity between user interface and the database
1. Develop an application for arithmetic, relational and logical operators

2. Develop an application for switch cases
3. Develop a Vb.net application for run time polymorphism
4. Develop an application for compile time polymorphism
5. Develop an application for interfaces
6. Develop an application for abstract classes
7. Develop an application for facilitating purchase order which will look like as shown below.
..
··-�·�· +c--.y•"'!.-- -··
Purchase of car
c ...
�.'t.•JH ' - ,.__, •.--• ''»- _,, .ill·-- • ..-'-...--- ...._.
--
__.,....
( ·- - )
�
DEAN
FACULTY OF SCIENCE
Verified By : � KRIS TU JAYANTI COLLEGE AUTONOMOUS
Name : � Uj o 'P �O\'Y)�
Signature
-Qb
Page 59 of 104
00CS02 18 BCA2L2A31
·-
-·
L-J 1 ...
10. Develop an application which is useful for calculating insurance.

11. Develop an application which is similar to a login fonn using progress bar control.
12. Develop an application to display the file selected by the user in a web browser control.
13. Develop an application using font dialog control.
14. Develop an application for color dialog control.
15. Develop an application for tree view control in vb.net.
16. Develop an application for exception handling.
17. Develop an application which is similar to a notepad using menus.
18. Develop an application to read items from the database using data reader.
19. Develop an application to insert an item from database.
20. Develop an application to delete an item from database.
Evaluation Criteria
Criteria Marks
Writing any two programs from the given 7.5 x 2 = 15
three questions
Executing the written two programs. 7.5 x 2 = 15
Viva Voce 5
Total 35
Verified By : �
Name : f-r, �·o :P 1hom"-d
Signature •
Q J,, -:: FACULTY OF SCIENCE
K"ISTU JAYANTI COLLEGE AUTONOM
K. Narayanapura, l<othanur PO
OUS
:.-----
Bengaluru - 560077
Page 60 of 104
00CS02 18 BCA2L2A32
BCA2L2A32: DATABASE MANAGEMENT SYSTEM PRACTICAL
Course Objective:
• To introduce the basic database concepts and functioning of Database Management System
with associated tools and techniques.
Course Outcomes:
• manage primary and foreign key constraints in the database
• execute PL/SQL program to insert and retrieve data from database
1. Student Details Database

The student details database has a table with the following attributes.
STUDENT (RegNo: number; Name: text; DOB: date; Marks: number)
a) Remove the existing attribute marks from the table.
b) Change the data type of regno from integer to string.
c) Add a new attribute PhoneNo to the existing table.
d) Enter 5 tuples into the table.
e) Display all the tuples in student table.
f) Display all the students who were born in 1980s.
g) Display all the students in alphabetical order of their names.
2. Library Database
A library database has a table with the following attributes:
LIBRARY (flookld: number; Title: text; Author: text; Publisher: text; Year_Pub: number; Price:
number (6, 2))
a) Enter 5 tuples into the table.
b) Display the different publishers from the list.
c) Arrange the tuples in the alphabetical order of book titles.
d) List details of all the books whose price ranges between Rs. 100.00 and Rs.300.00.
e) Display all the authors under a specific publisher.
3. Employee Salary Database

The salary database of an organization has a table with the following attributes:
EMPSALARY (EmpCode : number; EmpName : text; DOB: date; Dept : text; Salary number(l 0,2) )
a) Enter 5 tuples into the table.
b) Display the number of employees working in each department.
c) Find the sum of the salaries of all employees.
d) Find the sum and average of the salaries of employees of a particular department.
e) Find the highest salary that an employee draws.
f) Find the least salary that an employee draws.
g) Find the total salary for each department.
h) Increase the salary of those employees working for the computer department by Rs. 1000.
i) Display all employees increasing order of their age for a specific department.
Verified By : p
Name : '!'¥"' L�10 'f "lho'rY)s..J FACULTY OF SCIENCE
Signature • G)fa KRISTU JAYANTI COLLEGE AUTONOMOUS

Bengaluru - 560077
Page 61 of 104
00CS02 18 BCA2L2A32
4. Inventory Database
An inventory database has the following tables
ITEM (ItemCode : number; ItemName : text; Price : number(l 0,2) )
PURCHASE (ltemCode : number; Quantity : number)
a) Create the tables with the above attributes.
b) Enter S - 7 tuples into the tables.
c) List the items purchased.
d)Display the total items purchased(listing must have the columns: ItemCode,
ItemNrune,TotalQuantity)
e) List the items which are not purchased by anyone.
5. Bank Customer Database

A bank customer database has two tables CUSTOMER and ACCOUNT.
CUSTOMER (CustNo: number; CustName: text; City: text; AccNo: number; Balance: number( 10,2))
ACCOUNT (AccNo: number; AccType: text; Branch: text; AccStatus: text; ChequeFacility: text)
a) Create the above tables and specify the primary and foreign keys.
b) Enter S - 8 tuples for each relation.
c) List the customers from "Bangalore" who have cheque facility.
d) List all the customers whose balance is greater than 30000.00 and have an active account.
e) Find the current outstanding balance amount of branch "Malleswaram".
6. Insurance Database
Consider the Insurance database given below. The priinary keys are underlined and the data types are
specified.
PERSON (Driverld: text; Name: text; Address: text)
CAR (RegNo: text; Model: text; Year: number)
OWNS (Driverld: text; RegNo: text)
ACCIDENT (ReportNo: number; AccDate: Date; Location: text)
PARTICIPATED (Driverld: text; RegNo: text; ReportNo: number; Dmg_Amt: number(l0,2))
a) Create the above tables by specifying the primary and foreign keys.
b) Enter atleast five tuples for each relation.
c) Update the damage amount for each car accident.
d) Add a new accident to the database.
e) Find the total number of people who owned cars that were involved in accidents in the year 2002.
f) Find the number of accidents in which cars belonging to a specific model were involved.
g) Display the owners and their car details.
7. Order Processing Database

Consider the following relations for an order processing database application in a company.
CUSTOMER(Custld: number; CustName: text; City: text)
CUSTORDER(OrderNo: number; OrderDate: date; Custld: number; OrderAmount: number)
ITEM (ItemNo : number; ItemName: text; UnitPrice number(l 0,2));
ORDER_ITEM (OrderNo: number; ItemNo: number; OrdltemQty : number)
WAREHOUSE (WarehouseNo: number; City: text)
"""
Verified By: ':• �·
r �o
, ,, o
FACULTY OF SCIENCE
T ·Ai'
1noh"lCU
Name K. N-irayanapura, Kothanur PO
Signature ; Qft 8engaluru - 560077
Page 62 of 104
00CS02 18 BCA2L2A32
SHIPMENT (OrderNo: number; WarehouseNo: number; ShipDate: date)

a) Create the above tables by properly specifying the primary keys and the foreign keys.
c) Produce a listing: CustName; no_of_orders;avg_order_amt; where the middle attribute is the total
average order amount for that customer.
d) List the order_no for orders that were shipped from all the warehouses that the company has in a
specific way.
e) Demonstrate the delete of itemno 10 from the ITEM table and make that field null in the
ORDER ITEM table.
f) List all the items ordered by a particular customer.
8. Student Enrollment Database

Consider the following database of students enrollment in courses and books adopted for each course.
STUDENT (RegNo : number; Name : text; Major : text; BDate :date)
COURSE (CourseNo : number; CourseName: text; Departmentt: text)
ENROLL (RegNo: number; CourseNo: number; Semester: number; TotalMarks: number)
TEXTBOOK (Bk ISBN: number; BookTitle: text; Publisher:text; Author: text)
BOOK_ADOPTION (CourseNo: number; Bk ISBN: number)
a) Create the above tables by specifying the primary keys and the foreign keys.
c) Insert a new text book to the database and make this book be adopted by some department.
d) List the students who have been enrolled.
e) List the students who have registered but not enrolled.
f) List the books which have been adopted.
g) List any department that has all its adopted books published by a specific publisher.
h) Illustrate inner join ; outer join by joining student and enroll table.
9. Movie Database
A movie database has a table with the following attributes:
MOVIE (title: text, year: number, length: number, incolour: text, studioname: text, producer: text)
MOVIESTAR (starname: text,address: text, gender : char, birthdate : date)
STARSIN (movietitle: text, movieyear ; number, stamame ; text)
MOVIEEXECUTIVE (starname:text, address : text, networth : number)
STUDIO (studioname: text,address ; text)
c) Find the address of MGM Studios.
d) Find Julia Roberts birth date.
e) Find all the stars that appear in a movie made in 1980 or a movie with "life" in the title.
f) Find all the executives worth $100000.
g) Find all the stars who are either a male or live in "Miami". (Miami as part of their address).
10. Student-Faculty Allotment Database

Consider the following relations:
Student (snum: integer, sname: text, major: text, level: text, age: integer)
Class (name: text. meets_at: text. room: text, fid: integer)
Enrolled (snum: integer, cname: text)
Verified By: :
Name .f;.-. L:Jo (f> 'W, O\'Y) � �
FACULTY OF SCIENCE
KRISTU JAYANTI COLLEGE AUTO
Signature
.Q_b NOMO
K. Naravanapura, Kothanur PO US
Bengaluru - 560077
Page 63 of 104
00CS02 18 BCA2L2A32
Faculty (fid: integer, fuame: text, deptid: integer)

c) Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof. Ram.
d) Find the names of all classes that either meet in room R128 or have five or more Students enrolled.
e) Find the names of all students who are enrolled in two classes that meet at the same time.
f) Find the names of faculty members who teach in every room in which some class is taught.
g) Find the names of faculty members for whom the combined enrollment of the courses that they teach
is less than five.
11. Write a program to multiply two numbers by prompting for values from the user. Then the result
should be display as "The multiplication of5 and 10 is50" (if5 and 10 were supplied by the user).
12. Display the name, salary and job of the employee MARTIN of the emp table in the format
MARTIN is working as SALESMAN and earning a salary of 1250
using a PL/SQL block.
13. Write a PL/SQL code to retrieve the employee name, join_date, and designation from employee
database of an employee whose number is input by the user.
Note:
1) Any fully fledged DBMS (like Oracle and SQL server) package may be used.
2) The primary key for the table is underlined.
Evaluation Criteria
Criteria Marks
Writing any two programs from the given 7.5 x2 = 15
three questions
Executing the written two programs. 7.5 x2 = 15
Viva Voce 5
Total 35
�
Verified By : DEAN
Name : h"'· L��o f '1ho� FACULTY Of SCIENCE
Sisnature
.Q_j3 K. Narayanapura, Kothanur PO
Ben�aluru • 560077
Page 64 of 104
00CS02
IV Semester
Page 65 of 104
00CS02 18 ENG103A41
ENG103A41: ENGLISH IV
Course Objectives:
• To develop student's proficiency in the language and develop their communication
skills.
• To equip learners with skills for self-learning.
Course Outcomes:
• recognize, define, and identify poetic terms and genres
• examine novels analytically and interpretively, to identify literary elements of plot,
character, setting, tone, point of view, theme, style, symbol, metaphor, and image
• analyze the characters and themes of one act plays
• acquire vital employability skills and employment opportunities with in-depth
knowledge of CV, cover letter, report writing and paragraph writing

Martin Luther King Jr.: I Have a Dream; Khalil Gibran: Song of the Rain; Anonymous: India's
Heroes; Premchand: The Child; Elinor Wylie: The Eagle and the Mole; Nissim Ezekiel: Urban.

Stanley Houghton: The Dear Departed
Unit 3: Novel 15 hrs

R K Narayan: The Bachelor of Arts
Unit 4: Writing Skills 7 hrs

Curriculum Vitae and Cover Letter; Kinds of Paragraph Writing; Report Writing; Dialogue Writing;
Story Writing
References:
Jaico. (2015) Greatest Works ofKahlil Gibran. India: Jaico Publishing House.
Mendelsohn, Daniel. (2008) "The Two Oscar Wildes" How Beautiful It Is and How Easily It Can Be
Broken: Essays By Daniel Mendelsohn. New York: Harper Collins.
Murphy, Raymond. (1998) Intermediate English Grammar. New York, New York: Publisher.
Singh, Krishna Kant. (2017) Social Perspectives in R K Narayan 's Novels. Bengaluru, Karnataka:
Book Enclave.
Verified By: AN
Name FAC Y OF HUMANITIES
Signature K. Narayanapura. Ko!'hanur PO
Bengaluru · 56001'7
Page 66 of 104
00CS02 18 BCA204A41
BCA204A41: SOFTWARE ENGINEERING
Course Objective:
• To provide a quality and systematic approach to the design, development, operation, and
maintenance of a software system.
Course Outcomes:
• analyze software components and process models in software development life cycle
• prepare the plan, design, schedule and assessing the risks in project management
• categorize software metrics, testing and maintenance of a project
Unit 1: The Product and Process 4 hrs

Evolution of software; Characteristics of software; Software applications; Components of software;
Software myths; Software problems; Software reuse; Risk Management: Overview of risk
management. Risk management; Process visibility; Professional responsibility.
Unit 2: The Process 10 hrs

D e f i n i t i o n of software engineering; Software engineering models: Waterfall model, Prototyping
model, Spiral model, agile methodology: Definition, Development, Life-cycle.
Unit 3: Project Management and Planning 24 hrs

Management spectrum : People, Product, Process ,Project; Metrics-Measures; Metrics and indicators;
Types of metrics-Size oriented, Function-oriented metrics, Metrics for software quality; Resources
Human, hardware, Software resources; Software project estimation-Decomposition technique, LOC
based estimation, Empirical estimation; COCOMO model;: types; Project scheduling-Work tasks,
Time line charts and CPM; Software quality assurance; Quality; Formal technical review and software
reliability; Software requirement specification(SRS).
Unit 4: Analysis Modeling and Design Principles 12 hrs

Analysis Modeling- Data modeling; Data flow diagram (DFD); structured analysis.
Design Concepts and Principles-Design process; Design principles; Design concepts and effective
modular design; Design steps; Data design; Object oriented design; Function oriented design; Interface
design and procedural design.
Unit 5: Software Testing and Maintenance 10 hrs

Software Testing - The testing process; Test planning & strategies; Types of testing: Unit
testing; Integration testing; System testing; Acceptance testing; Black box and White box testing and
static verification.
Maintenance- Types of maintenance; Enhancing maintainability during development.
Verified By: �
Name : h' LUo l %oVYXU FACULTY OF SCIENCE
Signature
·QJ:- K. Narayanapura, Kothanur PO
Page 67 of 104
00CS02 18 BCA204A41
Text Books:
Ian Sommerville. (2002). Software Engineering(6th ed.). Pearson Education, Asia.
Roger S Pressman. Software Engineering - A practitioner's Approach. (51h ed.).Mc Graw Hill
International Edition.
M. Cohn, "Succeeding with Agile: Software Development Using Scrum", 2009.
K. Schwaber and M. Beedle, "Agile Software Development with Scrum ", 2002
References:
James F Peters and WitoldPedryez.(2000).So/tware Engineering - An Engineering Approach. New
Delhi: John Wiley and Sons.
Jon Fairclough. (1996). Software Engineering. Prentice Hall Press.
Pankaj Jalote.(1995). An Integrated Approach to Software Engineering. Narosa Publications.
Richard Fairley. Software Engineering Concepts. Tata McGraw Hill Edition.
Verified By :
�
N a me : h· Ujo ? FACULTY OF SCIENCE
�
%oh')o...1 KRISTU JAYANTI COLLEGE AUTONOMOUS
Q
Signature Bengaluru · 560077
Page 68 of 104
00CS02 18 BCA204A42
BCA204A42: CONCEPTS OF DATA WAREHOUSE AND DATA MINING
Course Objectives:
• To introduce the concept of data mining with in detail coverage of basic tasks, metrics, issues,
and implication. Core topics like classification, clustering and association rules are exhaustively
dealt with.
• To introduce the concept of data warehousing with special emphasis on architecture and design.
Course Outcomes:
After successful completion of the course, the student wilJ be able to:
• explain data warehouse architecture and data mining functionalities
• design data warehouse with dimensional modelling and applying OLAP operations on
datacubes
• compare association, classification, clustering and prediction techniques in data mining
Unit 1: Introduction and Data Warehousing 12 hrs

In troduction, Data Warehouse, Multidimensional Data Modei, Data Warehouse Architecture,
Implementation, Further Development, Data Warehousing to Data Mining, Data Mining
Functionalities, Classification of Data Mining systems, Data Mining Task Primitives, Integration of a
Data Mining System with a Database or a Data Warehouse System, Major issues in Data Mining.
Unit 2: Data Preprocessing

c and Architecture Des ription 12 hrs
Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept
Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces,
Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons,
Descriptive Statistical Measures, Data Warehouse and OLAP Technology for Data Mining, Data
Warehouse Architecture, Data Warehouse Implementation, Further Development of Data Cube
Technology.
Unit 3: Association Rules 12 hrs

Introduction, Association Rule Mining, Market Basket Analysis, Mining Frequent Itemsets with
Candidate Generation: Apriori Algorithm, Steps of Apriori Algorithm, Limitations of Apriori
Algorithm, Frequent -Pattern Tree(FP-Tree)FP-growth Alogirthm, Advantages of Association Rule
Mining, Disadvantages of Association Rule Mining.
Unit 4: Classification 12 hrs

Introduction to Classification and Prediction, Working of Classification, Classification Vs Prediction,
Data preparation for Classification and Prediction, Classification by decision tree, Tree pruning,
Introduction to Bayes Theorem for classification, working of naves bayes classifier, Decision Tree
Induction - Bayesian Classification, Rule Based Classification , Classification by Back propagation,
Support Vector Machines, Associative Classification - Lazy Learners.
Verified By :
h-· L�� f' 1h,�
�
Name : FACULTY OF SCIENCE
Signature / G)� KRISTU JAYANTI COLLEGE AUT

ONO
K. Narayanapura, Kothanur POMOUS
8engaluru • 560077
Page 69 of 104
00CS02 18 BCA204A42
Unit 5: Clustering 12 hrs

Cluster Analysis -Types of Data, Categorization of Major Clustering Methods, K-means- Partitioning
Methods - Hierarchical Methods, Density-Based Methods, Grid Based Methods. Model-Based
Clustering Methods - Clustering High Dimensional Data, Constraint Based Cluster Analysis, Outlier
Analysis, Data Mining Applications.
Text Books:
Aggarwal, Charu C (2015). Data Mining, Springer International Publishing.
Pujari A K, Data Mining Techniques, (3rd Ed). Universities Press India Pvt Ltd-Hyderabad.
Arnn K Pujari (2006). Data Mining Techniques, (2nd Ed). Universities Press.
References:
Pang-Ning Tan, Michael Steinbach, Vipin Kumar. (2016). Introduction to Data Mining, Pearson
Education.
Gupta G.K. (2014). Introduction to Data Mining with Case Studies, (3rd Ed) Prentice Hall India
Learning Private Limited.
Margaret H.Dunham. (2004). Data Mining: Introductory and Advanced Topics, Pearson Education.
Jiawei Han & Micheline Kamber. (2015). Data Mining- Concepts and Techniques, (2°d Ed). Morgan
Kaufmann Publishers, Elsevier.
Micheline Kamber, Jain Pei, Jiawei Han. (2011). Data Mining: Concepts and Techniques, (3rd Ed).
Elsevier.
Verified By : �
Name : ,F",, · Lj O <p �Ort)a..!
FACULTY OF SCIENCE
Signature
-Q� It Narayanapura, Kothanur PO
Sengaluru • 560077
Page 70 of 104
00CS02 18 BCA204A43
BCA204A43: DATA COMMUNICATION AND NETWORKS
Course Objective:
• To focus on the fundamentals of data communication network and to inculcate knowledge on
the data transfer techniques in the layered architecture.
Course Outcomes:
• classify network technologies and protocols using OSI reference model and TCP/IP model
• analyze network devices, topologies and IEEE 802.1 to 802.11 standards
• apply error detection and correction of transmitted data using forward error correction
techniques
• formulate the solution for routing and congestion problems using routing algorithms
Unit 1: Basic Network Architecture 8 hrs

Network Goals ; Network Types; Network topologies: Message, Packet and Circuit switching,
Architecture, Services-Layered Architecture: OSI Reference Model, TCP/IP Model, Comparison: OSI
and TCP /IP model.
Unit 2: Digital Transmission & Physical Layer 12 hrs

Chapter 1: Digital Transmission:
Basic properties of digital transmission systems - Fundamentals of digital transmission: Nyquist
signaling rate, Shannon channel capacity, Line coding, Types of Encoding, ASK, FSK, PSK, Modems:
Modulation & demodulation
Chapter 2: Transmission Media:
Transmission Media-Twisted pair, Coaxial cable, Optical fiber, Satellite communication networks; -
Introduction to wireless transmission-Satellite communication
Unit 3: Data Link Layer 20 hrs

Chapter 1: Medium Access Control Sublayer
Introduction to Mac layer-Multiple Access protocols-Types of MAC protocols: Random Access
Protocols-ALOHA, CSMA, CSMA/CD, CSMA/CA Controlled Access Protocols:-Reservation,
Polling, Token passing, Channelization Protocols.
Chapter 2: LAN And IEEE Standards
IEEE 802.2 Ethernet -IEEE 802.3; Ethernet addressing; Ethernet Topology; Token Bus- IEEE 802.4;
Token ring-IEEE 802.5; Wireless LAN-IEEE 802.11; Bridges, FDDI
Chapter 3: Logical Link Layer
Logical Link Layer-Error Control & Flow Control; Error Control ; Types of Errors; Error Detection:
Parity check method ; Checksum method; Cyclic redundancy check method (CRC)-Error correcting
methods: Automatic repeat request method (ARQ), Forward error correction method (FEC), Flow
Control Methods.
Unit 4: Transport Layer & Network Layer 14 hrs

Function of Network Layer; Packet Switching concepts; Connection oriented Vs connectionless
services; Peer to peer Protocol ; Point to Point Protocols; Datagram - Virtual Circuit; Routing
concepts; Routing Tables: Non-Adaptive or static routing, Adaptive Algorithms ;User datagram
protocol (UDP) ;Transmission control protocol (TCP) ; Congestion control.

Name I\RISTU JAYANTI COLLEGE AUTONOMOUS
IC Narayanapura, Kothanur PO
Signature BengaluruPage
- 560077
71 of 104
00CS02 18 BCA204A43
Unit 5: Session Layer, Presentation Layer & Application Layer 6 hrs

Session & Presentation Layer functions -Protocols; Remote Procedure Call, TELNET-Remote Login
Access, Network Virtual Terminal; Application layer protocols -Simple Mail transfer Protocol, File
transfer Protocol, Hyper Text Transfer protocol, World Wide Web, Domain Name server TCP/IP
utilities :PING,TRACEROUTE,IPCONFIG,NETSTAT.
Text Books:
William Stallings. Data & Computer Communication. Maxwell Macmillan International Edition.
Andrew Tanenbaum. (2009). Computer Networks (4th ed.). Prentice Hall oflndia.
References:
B.A.Forouzan. Data Communication and Networking. (2nd ed.). Tata McGraw Hill.
Peterson. (2008). Computer Networks. Tata McGraw Hill.
Robertazzi. (2000). Computer Networks and Systems, Springer.
., FACULTY OF SCIENCE
Verified By: :. h'· UJ'o KRISTU JAYANTI COLLEGE AUTONOMOUS
Name 'P 1hor()Ou K. Narayanapura, Kothanur PO
-G�
Bengaluru - 560077
Signature
Page 72 of 104
00CS02 18 BCA2P2A41
BCA2P2A41: SOFTWARE ENGINEERING PROJECT
Course Objective:
• To provide a quality and systematic approach to the design, development, operation and
maintenance of a software system.
Course Outcomes:
• design project development phases using waterfall, prototyping, spiral and agile model
• manage the workflow of the project using gantt chart
Guidelines:
• Students have to develop a project using VB.NET as frontend with service database as backend.
• The Project should be developed individually or in teams consisting of not more than two
members. The project should be genuine and original in nature and should not be copied from
anywhere else.
• Each member in the team should submit an individual project report.
• Project should have been completed on or before the second review.
• The progress of the project is monitored through the project observation by the faculty guide on
weekly basis.
• The Continuous Internal Evaluation (CIE) mark is based on the project reviews conducted
during the course of the project work.
• To develop a quality software product, a student has to follow the following phases and submit
a report consisting of these to the concerned faculty guide within the specified duration. The
various phases are:
1. Initiation phase: The objective of this phase is to examine the feasibility of the project. This
phase includes:
o Why this project?
o Is it feasible?
o What is the outcome of this project?
2. Design phase: Design phase includes Table structure, ER-diagram, DFDs, Gantt chart and
Input/output form designs which should not be changed in the later stage of the project.
3. Development phase: In this phase, the complete program code (well intended) with comments
and description should be developed. It also includes complete error handling and proper
validation based on the project requirement.
4. Testing and Implementation phase: Test case designs are to be included separately for Unit
testing, Integration testing and System testing.
Verified By:
Name : r-y. L�fo t 1ho\'Y1a.&
FACULTY OF SCIENCE
KRIS TU JAYANTI COLLEGE AUTONOMOUS
Signature
·Q_b K. Narayanapura, Kothanur PO
Page 73 of 104
00CS02 18 BCA2P2A41
Evaluation Criteria
Total (CIE+ESE) = 15+35
Continuous Internal Evaluation [CIEJ: Project Review I+ Project Review II: 5+10
Project Review I: Synopsis+ Project Content+ Project Designing
Synopsis: 1 Mark
Project Content: 2 Marks
Project Designing: 2 Marks
Project Review Il: Project Report + Working Demo
Project Report: 7 Marks
Working Demo: 3 Marks
End Semester Examination [ESE): Viva+ Demonstration: 10+25
�
., FACULTY OF SCIENCE
Verified By:
.
Name : h-· lf.fo rp '1he, h'b..:f KRISTU JAYANTI COLLEGE AUTONOMOUS

.Q_b
Bengaluru - 560077
Signature
Page 74 of 104
00CS02 18 SSP4L2A01
SSP4L2A01: SOFT SKILLS PRACTICES
Course Objective:
• To enhance the personality of the student and empower them with soft skills through a practical
approach.
Course Outcomes:
• build verbal/oral communication, leadership and listening skills
• perform group discussion, presentations and personal interview
Unit 1: The Self-Concept 10 hrs

What is attitude; the process of attitude formation; you are the chief architecture of yourself; Self
management techniques.
Unit 2: Believe in Yourself 12 hrs

Self-image and self-esteem; Building self-confidence; Environment we mix with; How to build self
image; Meaning and definition of personality.
Unit 3: Personal Planning and Success Attitude 12 hrs

Prioritizing; creating the master plan; Active positive visualization and positive attitude; How to build a
successful attitude; Spot analysis.
Unit 4: Self-Motivation and Communication 14 hrs

Levels of motivation; Power of irresistible enthusiasm; Etiquettes and manners in a group; Public
speaking; Oral and written communication; Body language; Importance of listening and responding;
Tips for technical writing.
Unit 5: Leadership as a Process 12 hrs

Coordination while working in a team; Leadership styles; Leader and team player; Management of
conflict; Profiles of great and successful personalities; Role of career planning in personality
development; How to face personal interviews and group discussions.
Guidelines
All the topics to be worked out practically by
• Conducting Personal Interviews.
• Giving Presentation On A Technical Topic Based On The Curriculum.
• Conducting Group Discussions.
References:
Dharam Prakash.(2010).17 Steps to Excellence.Better Yourself Books.
Fr.Anthony D'Souza.(2011).Leadership,Better Yourself Books.
Hurlock,Elizabeth B.(2003).Personality Development.TMH.
Richard Denny.(2000) .Succeed For Yourself.Kogan Page India.
Verified By:
Name : .fy. L{)b ? 'Th FACULTY OF SCIENCE
-0�·
l)W)d,.J
KAIS TU JAYANTI COLLEGE AUTO
NOMO
K. Narayanapura, Kothanur PO US
Signature
Page 75 of 104
00CS02
V Semester
Page 76 of 104
00CS02 18 BCA204A51
BCA204A51: WEB PROGRAMMING USING PHP

Course Objective:
• To help the students to understand the real life web development and become a web developer
using latest tools and trending technologies of current and future.
Course Outcomes:
• illustrate the installation, configuration of XAMPP and parsing PHP code
• create webpage using conditional statement, looping constructs, array, string, math and array
built-in functions
• apply cookies and session management in PHP web page
• demonstrate connectivity of PHP webpage with MySQL database
Unit 1: Introduction to PHP 10 hrs
Installation of PHP and MySQL; PHP configuration in HS & Apache web server; Features of PHP;
Writing PHP; How PHP code is parsed; Embedding PHP and HfML; Executing PHP and viewing in
browser; Data types; Operators; PHP variables: Static and global variables; Comments in PHP.
Unit 2: Control Structures 12 hrs
Condition statements: If...Else, Switch,? Operator; Loops: While, break statement, continue,
do...while, for, foreach, exit, die, return; Arrays in PHP.
Unit 3: Working With Data 14 hrs
FORM and INPUT elements; Validating the user input; Passing variables: Between pages, through
GET, through POST, through REQUEST; Built-in functions - String Functions: chr, ord, strtolower,
strtoupper, strlen, ltrim, rtrim, substr, strcmp; Math Functions: abs, ceil, floor, round, fmod, min, max,
pow, sqrt, rand; Array Functions: count, list, in_array, current, next, previous, end, each, sort, rsort;
User Defined Functions.
Unit 4: Sessions and cookies 12 hrs
Concept of session: Starting session, modifying session variables, unregistering and deleting session
variable; Concept of cookies.
Unit 5: Introduction ofMySQL 12 hrs
Types of tables in MySQL; Query in MySQL: Select, insert, update, delete, truncate, alias, order by;
Database connectivity of PHP with MySQL.
Text Books:
Leon Atkinson. Core PHP Programming. Pearson publishers.
Stever Holzner. The Complete Reference. PHY McGraw Hill.
Christopher Scollo, Harish Rawat, Deepak Thomas. Beginning PHP 5.0 Database. Wrox Press.
Ashok Appu. PHP-A beginners. Wiley.
References:
Bible Tim Converse, Joyce Park, Clark Morgan. PHP 5.0 and MySql. John Wiley & Sons.
Steve Suehring. MySQL Bible. John Wiley &Sons.
Joyce Park and Clark Morgan. PHP 5 and Mysql Tim converse. Bible Wiley.
Matt Doyle. Beginning PHP 5.3. Wrox Publication.
DEAN
Verified By: FACULTY OF SCIENCE
Name h-· l�' o 1' 'fhort)O.J KRIS TU JAYANTI COLLEGE AUTONOMOUS
Signature
G>· Bengaluru - 560077
Page 77 of 104
00CS02 18 BCA204A52
BCA204A52: COMPUTER ARCHITECTURE

Course Objective:
• To inculcate knowledge of the basic structure and operation of a digital computer and to
familiarize with the different ways of communicating with I/0 devices and standard I/0
interfaces.
Course Outcomes:
• design computational process using arithmetic, logic and shift operators
• summarize the concepts of parallel processing, pipelining and inter-processor communication
• classify the memory organization techniques and methods of data transfer between memory and
I/0 device
• compare the performance of architectural schemes and address design issues
based on speed, technology, cost and performance
Unit 1: Computer Organization and Design 12 hrs
Instruction codes - Stored program organization; Computer registers; Computer instruction; Instruction
cycle-Fetch and decodes; Input output and interrupt- I/0 instructions; Program interrupt; Design of
basic computer.
Unit 2: Central Processing Unit 12 hrs

Introduction; General register organization; Stack organization- Register stack; Memory stack;
Instruction format; Addressing modes; Data transfer and manipulation- Data transfer instructions and
data manipulation instructions; Program control- Status bit conditions.
Unit 3: Input/ Output Organization 12 hrs
Peripheral devices; I/0 interface-I/0 bus and interface modules; I/0 Vs. Memory bus; Asynchronous
data transfer; Programmed I/0 interrupt; Interrupt initiated I/0; Priority interrupt; Direct memory
access.
Unit 4: Parallel Processing 12 hrs
Parallelism in uniprocessor system; Parallel computer structures; Pipeline computers; Array computers;
Multiprocessor systems.
Unit 5: Architectural Classification 12 hrs
Multiplicity of instruction - Data streams; Serial versus parallel processing; Parallelism versus
Pipelining.
Text Books:
Morris Mano. M. Computer System Architecture.( 3 rd ed.). PHI Publications.
Kai Hwang, Faye A. Briggs. Computer Architecture & Parallel Processing. McGraw-Hill.
References:
Carl Hamacher, Zvonko Vranesic, Safwat Zaky(2002).Computer Organization.(5 1h ed.).Tata McGraw
Hill.
Hayes. John. P. Computer Architecture and Organization.(3rd ed). Tata McGraw-Hill
Pal Chaudhary P. Computer Organization and Design. New Delhi: Prentice Hall.
Stalling, Williams. Computer Organization AndArchitecture.( 4th ed). Prentice Hall.
Verified By:
Name �
FACULTY OF SCIENCE
Signature KRISTU JAYANTI COLLEGE AUTONOMOUS
Bengaluru - 5fi0077
Page 78 of 104
00CS02 18 BCA2L2A51
BCA2L2A51: WEB PROGRAMMING USING PHP PRACTICAL
Course Objective:
• To help the students to understand the real life web development and become a web developer
using latest tools and trending technologies of current and future.
Course Outcomes:
• design PHP program using control structures and string functions
• manage PHP webpage connectivity with cookies and MySQL database
1 . Write a PHP program to print whether current year is leap year or not.
2. Write a PHP program to print whether given number is odd or even.
3. Write a PHP program to make the sum of first100 odd numbers.
4. Write a PHP program to print first 10 Fibonacci numbers.
5. Write a PHP program that will compare two stings whether they are same or not.
6. Write a PHP program that will convert a string into lowercase string and uppercase string.
7. Write a PHP program to find a position of a given character into given string.
8. Write a PHP program to replace one string using another string.
9. Write a PHP program to reverse an array.
10 . Write a PHP program to find out maximum and minimum number.
11 . Write a PHP program to create file with youmame. txt and write few lines about you into it.
12. Write a PHP program to develop E-mail registration form and store all the submitted data in
database table.
I 3. Write a PHP program that keeps track of how many times a visitor has loaded the page.
14. Write a PHP program to read customer information like Cust_no, Cust_name, Item_purchased
and Mob_no. from Customer table and display all these information in table format on output
screen.
15. Write a PHP program for editing and deleting a particular record from database.
16. Write a PHP program to display Good Morning I Good Afternoon I Good Evening message
according to current time.
17. Write a PHP program to demonstrate any 5 date functions.
18. Write a PHP program to load a simple xml file.
19. Write a PHP program to give authentication for registered users with database connectivity.
20. Write a PHP program to store images in table.
Evaluation Criteria
Criteria Marks
three questions
Viva Voce 5
Total 35
Verified By :
Name : h" · L�o f �OW)l\d
FACULTY OF SCIENCE
Signature .Ql_ KRIS TU JAYANTI COLLEGE AUTONOMOUS
Bengaluru - 560077
Page 79 of 104
00CS02 18 BCA2P2A51
BCA2P2A51: ENTERPRISE COMPUTING PROJECT

Course Objective:
• To help the students identify web based problem and develop a solution for the same using
latest tools and technologies of current and future.
Course Outcomes:
• design web-based application using ASP.Net framework
• manage connectivity of web-based application with SQL Server
Guidelines:
• Students have to develop a project using ASP .NET as frontend with any external database as
backend.
• Project should be developed individually or in teams consisting of not more than two members.
The project should be genuine and original in nature and should not be copied from anywhere
else.
• Each member in the team should submit an individual project report.
• The progress of the project is monitored through the project manual by the faculty guide on
weekly basis.
• The Continuous Internal Evaluation (CIE) mark is based on the project reviews conducted
during the course of the project work.
• A report consisting of various phases has to be submitted by the student to the concerned
faculty guide within the specified duration. It includes:
I. Initiation phase: The objective of this phase is to examine the feasibility of the project. This
phase includes:
a. Why this project? b. Is it feasible? c. What is the outcome of this project?
2. Design phase: Design phase includes Table structure, ER-diagram, DFDs, Activity chart, Gantt
chart, Architecture design and Input/output form designs which should not be changed in the
later stage of the project.
3. Development phase: In this phase, the complete program code (well intended) with comments
and description should be developed. It also includes complete error handling and proper
validation based on the project requirement.
Evaluation Criteria
Total (CIE+ESE) = 15+35
Continuous Internal Evaluation [CIE): Project Review I+ Project Review II: 5+ 10
Project Review I: Synopsis+ Project Content+ Project Designing
Synopsis: 1 Mark
Project Review II: Project Report+ Working Demo
End Semester Examination [ESE): Viva+ Demonstration: 10+25
Verified By:
Name ; h-· Gj1� f 1hoW)(U
Signature .Qfa FACULTY Qf SCIENCE

K. Narayanapura, kothanur PO
Btngaluru • 560077
Page 80 of 104
00CS02 18 BCAA04A51
BCAA04A51: COMPUTER GRAPHICS
Course Objective:
• To have a thorough knowledge of primitive drawing algorithms, two-dimensional
transformation; Clipping, filling and 3-D graphics.
Course Outcomes:
• demonstrate ODA, Bresenham's algorithms and Geometric transformations
• explain raster and random scan techniques in 2D and projection in 30 graphics
• design graphics project using OpenGL API and C graphics library functions
Unit 1: Graphics Systems 12 hrs

Application of computer graphics; Graphic software; Video display devices- Raster scan and random
scan displays; CRT functioning - Factors affecting CRT; Raster scan system; Color CRT monitors -
Display processor with raster system; Raster co-ordinate system; Color mapping - Instruction set and
raster system applications; Essential C Graphics Library functions-initgraph, Detectgraph, DETECT
Macro, putpixel, outtextxy, getmaxx, getmaxy, setcolor, line, setfillstyle, pieslice, rectangle, line, itoa,
Bar3D, closegraph.
Unit 2: Output Primitives 12 hrs

Line Drawing Methods- DDA and Bresenham; Line attributes; Circle drawing methods - Direct and
midpoint circle drawing; Ellipse drawing - Bresenham's ellipse algorithm; Area filling - Scan line
area filling and character attributes;
Unit 3: 20-Transformation 12 hrs

Geometric transformation; Translation; Rotation; Scaling; Reflection and shear matrix representations;
Homogeneous co-ordinates - Composite transformation - Raster methods for geometric
transformations; Window and viewport; Clipping & classifications - Point clipping, Line clipping, Text
clipping, Polygon clipping, Curve clipping; Line clipping techniques - Cohen Sutherland line clipping
algorithm, Midpoint subdivision algorithm; Area clipping - Sutherland and Hodgman polygon clipping
algorithm.
Unit 4: 30 Graphics 12 hrs

3D-Coordinate system; 3D-Display techniques; 3D-Transformations - Projection transformations,
Orthogonal projections, Oblique parallel projections, Perspective projections; Polygon surfaces;
Octrees; Hidden surface removal; Depth buffer and scan line method introduction; Functions for
segmenting; Display file; Segment attributes; Display file compilation.
Unit 5: Graphical Input Techniques 12 hrs

Positioning techniques; Grid; Constraints; Dynamic manipulation; Gravity field; Rubber band;
Selection technique; Menu; Pointing and selection by naming; Keyboard; Mouse; Joystick; Touch
panels; Track ball; Tablet; Data glove; Digitizers; Voice systems.
Verified By: �
Name : h· L�"o f> FACULTY OF SCIENCE
·Gfi
Signature K. Narayanapura, Kothanur PO
Page 81 of 104
00CS02 18 BCAA04A51
OpenGL Implementation-Introduction to OpenGL; Basic OpenGL syntax; Display; Window

management using GLUT; Geometric Primitives; Viewing graphics objects in a GLUT display
window; Basic OpenGL geometric transformation functions-glTranslate, glRotate, glScale; OpenGL
interactive input device functions - Mouse function, Keyboard Function; OpenGL menu functions.
Text Books:
Donald Hearn & M. Pauline Baker. (2013).Computer Graphics OpenGL (3rded.). Pearson.
Donald Hearn & M. Pauline Baker. (2012).Computer Graphics C Version (2nded.). Pearson.
Sumit Chauhan. (2011).lntroduction to Computer Graphics (1 sted.).Himalaya Publishing House.
References:
Edward Angel.(2013).Interactive Computer Graphics A Top-Down Approach Using OpenGL(5 th ed.).
Pearson.
James D. Foley, Andries Van Dam, Steven K. Feiner& F Hughes John.(2013).Computer Graphics
Principles & Practice in C (2nded.).Pearson.
Roger T. Stevens. (1993). Graphics Programming in C. BPB Publications.
Steven Harrington. (1987). Computer Graphics A Programming Approach. (2nded.).lntemational
Edition.McGraw-Hill Publications.
Tom McReynolds, David Blythe. (2005.). Advanced Graphics Programming Using OpenGL. Elsevier
Publications.
William M. Newman & Robert F. Sproull.(1997).Jnteractive Computer Graphics.Tata McGrawHill.
YeshwantKanetkar.(1998).Graphics Under C (1 51ed.).BPB Publications.
f ACULTY Of SCIENCE
OMOUS
KRIS TU JAYANTI COLLEGE AUTON
!engaluru • 560077
Page 82 of 104
00CS02 18 BCAAL2A51
BCAAL2A51: COMPUTER GRAPHICS PRACTICAL
Course Objective:
• To have a thorough knowledge of primitive drawing algorithms, two-dimensional
transformation; Clipping, filling and3-D graphics.
Course Outcomes:
• develop C program using DDA, Bresenham's algorithms and pie chart
• design openGL programs for Sierpinski Gasket, animation and menu driven graphics package
1. Write a C program to implement DDA line drawing algorithm.

2. Write a C program to implement Bresenham's line drawing algorithm.
3. Write a C program to implement DDA circle drawing algorithm.
4. Write a C program to implement Bresenham's circle drawing algorithm.
5. Write a C program to animate Indian national flag.
6. Write a C program for drawing a Pie chart depicting the election result of 4 parties.
7. Write a C program for drawing a vertical histogram depicting the production of cars in a
manufacturing company for four different years.
8. Write a C program for implementing the2-D transformations.
9. Write a C program to implement Cohen Sutherland line clipping algorithm.
10. Write a C program to implement midpoint sub division method of line clipping.
11. Write an OpenGL program for drawing a wireframe sphere.
12. Write an OpenGL program for implementing2-D transformations.
13. Write an OpenGL program for drawing Sierpinski Gasket.
14. Write an OpenGL program for implementing animation.
15. Write an OpenGL program for implementing menu driven graphics package.
Evaluation Criteria
Criteria Marks
Writing any two programs from the given 5x2 = 10
three questions
Executing the written two programs. 7.5x2 = 15
Viva Voce 5
Total 35
Verified By:
Name f:t.. G'j'o f' �o'rv')a,., FACULTY OF SCIENCE
US
KRISTU JAYANTI COLLEGE AUTONOMO
Signature
Q_k K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 83 of 104
00CS02 18 BCAB04A51
BCAB04A51: CLOUD COMPUTING CONCEPTS
Course Objectives:
• To provides the comprehensive and in-depth knowledge of Cloud Computing concepts,
technologies, architecture and applications.
• To introduce research in Cloud Computing fundamental issues, technologies, applications and
implementations.
Course Outcomes:
• compare distributed, grid and cloud computing based on objectives, architecture, characteristics
and benefits
• assess cloud computing services and deployment models
• illustrate database ,compute , queuing , application ,security, deployment and management
services by cloud service providers
• create cloud based applications using service oriented architecture, model view controller and
cloud component model
Unit 1: Introduction to Cloud Computing 10 hrs

Definition; Cloud computing vs. Distributed computing, Utility computing, Characteristics of Cloud
Computing, Cloud Services, Cloud Deployment models, Benefits: Flexibility, Scalability, Capital
Investment, Portability, Dependability; Cloud-based Services; cloud Service Providers: Salesforce.com,
Facebook, Amazon, IBM, Microsoft, Yahoo, Google, Oracle.
Unit 2: Cloud Concepts and Technologies 12 hrs

Virtualization; Data centre; Load balancing; Scalability and Elasticity; Deployment; Replication;
Monitoring; Software Defined Networking; Network Function Virtualization; Identity and Access
Management; Service Level Agreement; Billing.
Unit 3: Cloud Senrices and Platforms 15 hrs

Compute Services: Amazon EC2, Google Compute Engine, Windows Azure Virtual Machine; Storage
Services: Amazon S3, Google Cloud Storage, Windows Azure Storage; Database Services: Amazon
DynamoDB, Google Cloud SQL, Windows Azure SQL Datastore; Application Services: Queuing
Services, Email Services, Notification Services; Deployment and Management Services: Amazon
Elastic Beanstalk, Amazon Cloud Formation; Identity and Access Management Services: Amazon and
Identity and Access Management, Windows Azure Active Directory.
Unit 4: Cloud Security 12 hrs

Introduction; CSA Cloud Security Architecture; Authentication: Single Sign-on (SSO); Authorization;
Identity and Access Management; Data Security: Securing Data at Rest, Securing Data at Motion; Key
Management; Auditing.
Unit 5: Cloud Applications 11 hrs

Design Considerations for Cloud Applications; Cloud Application Design Methodologies: Service
Oriented Architecture; Cloud component model, Model View Controller; A Case Study Illustrating
Potential Changes in the IT Profession Caused by Cloud Computing.
FACULTY OF SCIENCE
Verified By: KRISTU JAYANTI COLLEGE AUTONOMOUS
Name : h'""· GJo 1' 'lhoY'f')� K. Narayanapura, Kothanu, PO
Bengaluru - 560077
Signature Q0 Page 84 of 104
00CS02 18 BCAB04A51
Text Books:
Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing: Principles and
Paradigms, Wile, 2011.
ThomasErJ, Ricardo Puttini, Zaigham Mahmood, "Cloud Computing: Concepts, Technology &
Architecture". (]st Ed). Prentice Hall.
Arshdeep Bagha, Vijay Madiseeti, Cloud Computing: A Hands-on Approach, Universities Press.
References:
Mr. Ray J Rafaels, "Cloud Computing: From Beginning to End''. CreateSpace Independent Publishing
Platform.
Anthony Vincent, "Essentials ofCloud Computing and Security". (1 st Ed). Tejas Publication.
Tim Mather, "Cloud Security and Privacy". O'Reilly.
Rajiv Chopra, "Cloud Computing: An Introduction". Mercury Learning & Information.
Nayan B. Ruparelia, "Cloud Computing".Mit Press Essential Knowledge
�
FACULH Qf SCIENCE
Verified By: AUTONOMOUS
N am e : b- Ljo? KRISTU JAVAHTI COLLEGE
K. Narayanapura, Kothanur
PO
Signature
·Glk-
Page 85 of 104
00CS02 18 BCABL2A51
BCABL2A51: CLOUD COMPUTING CONCEPTS PRACTICAL
Course Objective:
• To provides the comprehensive and in-depth knowledge of Cloud Computing concepts,
technologies, architecture and applications.
Course Outcomes:
• manage virtual machines using cloud web services
• design applications for warehouse, upload documents and host static website in cloud
1. Implementation of any one Cloud Computing Architecture.

2. Creating and running virtual machines on VMware.
3. Implementation of Infrastructure as a Service, Installing OpenStack and use it as Infrastructure
as a Service [Quanta Plus /Aptana /Kompozer].
4. Installation and understanding features of ownCloud as Saas.
5. Installing and using identity management feature of OpenStack (Implementation of identity
management).
6. Write a program for web feed[PHP, HTML].
7. Implementation of Single-Sing-On (SSO), openID.
8. Installing and using security feature of ownCloud.
9. Installing and using Administrative features of ownCloud (User Management in Cloud).
I 0. Case study on Amazon EC2.
[Amazon Elastic Compute Cloud is a central part of Amazon.com cloud computing platform,
Amazon Web Services. EC2 allows users to rent virtual computers on which to run their own
computer applications)
Evaluation Criteria
Criteria Marks
three questions
Viva Voce 5
Total 35
:
Verified Bey
�
Narn : f"y. Ltia 1' FACULTY OF SCIENCE

kRISTU JAYANTI COLLEGE AUTONOMOUS
Signature .Q� K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 86 of 104
00CS02 18 BCAC04A51
BCAC04A51: BIG DATA ANALYTICS

Course Objectives:
• To apply analytical techniques to clearly communicate analytic insights and reframe a business
challenges.
• To deploy a structured lifecycle approach to data science and big data analytics projects.
Course Outcomes:
• explain the applicative aspects of big data
• analyze large scale analytical tools to solve big data problems
• create big data models to gather, manage and query the data sets using data mining techniques
Unit 1: Introduction to Big data analytics 10 hrs
Big Data Overview - Definition big Data, characteristics and consideration; unstructured Big Data
fuelling big data analytics, Analyst perspective on data repository; State of practice in analytics, the
data scientist - current Analytical architecture, Business Intelligence vs data science; Data analytics life
cycle - case study.
Unit 2: Review of Basic Data Analytics methods using R 08 hrs
R - Using R GUI, Getting data into R, Basic R operations, basic statistics; Analysing and exploring the
data; Statistics for model building and evaluating.
Unit 3: Text Analysis 08 hrs
Definition used in text analysis, key tasks, representation and features of documents and corpus, use of
regular expressing in parsing text; Metrics used, Challenges in text Analytics.
Unit 4: Advanced analytics Theory and Methods 20 hrs
K-means Clustering - The Algorithm, determining the optimum value of K, to evaluate the
effectiveness of the method use cases; Association Rules - Apriori algorithm, support and confidence
parameters, lift and leverage; Navie Bayesian Classifier - use cases, evaluating the effectiveness of the
method and advantages and disadvantages using classifier; Decision Tree - algorithm, use cases,
Entropy, information gain, classifier methods and condition in which they are best suited.
Unit 5: Advanced Analytics Technology and Tools 14 hrs
Analytics for Unstructured data (MapReduce and Hadoop); The Hadoop Ecosystem; In-database
analytics-SQL Essentials; Advanced SQL and MADlib for In-database analytics.
Text Books:
EMC. (2013). Data Science and Big Data Analytics Student Guide, Education Services. Publication EMC
Corporation.
EMC Education Seivices. Data Science & Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data. Wiley Library.
Radha Shankarmani, M. Vijayalakshmi.(2016). Big Data Analytics, (2nd Ed). Wiley.
References:
Big Data. (2011). The nextfrontierfor innovation, completion and productivity. McKinsey.
Kudyba Davenport (2014). Big Data, Mining, andAnalytics, Auerbach Publications.
Margaret H.Dunham. (2004). Data Mining: Introductory and Advanced Topics, Pearson Education.
Sam Anahory, Dennis Murry. (2003). Data Warehousing in the real world, Pearson Education.
Michael Minelli, Jim Stogdill, Ambiga Dhiraj, Michele Chambers. (2013). Big Data Big Analytics: Emerging
Business Intelligence and Analytic Trendsfor Today's Businesses. Wiley.
�
Verified By: : ,hr, Ujo 'f FACULTY Of SCIENCE
Name
.Q�· K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 87 of 104
00CS02 18 BCACL2A51
BCACL2A51: DATA ANALYTICS USING R PRACTICAL

Course Objective:
• To apply analytical techniques to clearly communicate analytic insights and reframe a business
challenges.
Course Outcomes:
• create boxplot, bar chart, pie chart ,histogram, ogives, scatter plot
• formulate discrete and continuous frequency distribution tables
• calibrate correlation and regression statistical analysis
• develop test of significance for means, difference of mean, proportions, difference of
proportions, chi-square test for goodness of fit and independence of attribute
 Basics of R command
 Data visualization techniques-I
Bar chart, Pie chart, Box plot
 Data visualization techniques-II
Scatter plot, Stem and leaves, Histogram, Polygon, Ogives
 Measures of Central Tendencies and measures ofDispersion Mean, Median, Mode, Range,
Standard Deviation, Quartile Deviation
 Matrix construction and arithmetic
 Construction of frequency distribution D ( iscrete and continuous)
 Correlation
 Linear regression
 Multiple regression
 Logistic regression
 Probability distributions
 Testing of hypothesis -!
Parametric tests: Single mean, Equality of mean, Single proportion, Equality of proportion
 Testing of hypothesis-II
Non parametric tests: Run test, Sign test, Wilcoxon signed rank test, Mann- Whitney U test,
Kolmogorov-Smimov test, Chi square test for goodness of fit and independence of attributes.
 ANOVA
One way, Two way
Problems from all the assignments to be given by the course teacher
Eg: [A psychologist estimates the I.Q. of 60 children. The values are as follows:
103, 98, 87, 85, 67, 96, 115, 109, 127, 103, 95, 123, 94, 88, 102, 76, 73, 80, 84, 102,
115, 93, 76, 81, 132, 90, 119, 84, 97, 120, 114, 101, 153, 98, 99, 105, 110, 107, 110, 128,
89, 112, 118, 101, 122, 146, 96, 109, 72, 97, 94, 94, 79, 79, 100, 54, 102, 89, 43, 111
Find all the measures of central tendencies and measures of dispersion](Assignment 4)
Evaluation Criteria
Criteria Marks
three questions
Viva V oce 5
Total 35
Verified By :
Signature
Bengaluru - 560077
Page 88 of 104
00CS02 18 BCAD04A51
BCAD04A51: NOSQL DATABASE CONCEPTS
Course Objectives:
• To encompass a wide variety ofdifferent database technologies that was developed in response
to the demands.
• To build a modem applications and understand and use columnar and distributed database with
understand and use columnar and distributed database patterns.
Course Outcomes:
• compare graph, key-value pairs, document-oriented and column-oriented NoSQL databases
• explain the architecture, define objects, load data, query data and performance ofMongoDB
• evaluate competency in NoSQL and relational database query
Unit 1: Introduction to NoSQL Databases 10 hrs
Introduction to NoSQL Databases: What is a NoSQL database? Limitations of Relational databases,
advantages ofNoSQL, Types ofNoSQL database; RDBMS Vs NoSQL.
Unit 2: Introduction to MongoDB 10 hrs
History of MongoDB; Features of MongoDB; Mapping Relational Databases to MongoDB; Table vs
Collection; install and Configure MongoDB for Windows; MongoDB Configuration.
Unit 3: Working with MongoDB 10 hrs
MongoDB: Create Database; Drop Database, Create Collection, Drop Collection, Insert Document,
Query Document, Update Document, Delete Document; MongoDB Projection, MongoDB limitO and
skip().
Unit 4: Sorting and Indexing techniques 15 hrs
MongoDB sort() method; The ensurelndex() Method; The aggregate() Method; What is Replication?
How Replication Works in MongoDB; Replica Set Features, Set Up a Replica Set, Add Members to
Replica Set.
Unit 5: Advanced Concepts 15 hrs
Sharding in MongoDB; Java Integration in MongoDB; Data insertion in MongoDB; Data Updation in
MongoDB; Retrieve data in MongoDB; Delete data in MongoDB.
Text Books:
Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts, (6th Ed).
McGrawHill.
Guy Harrison. (2015). Next Generation Databases, Apress.
Adam Fowler. (2015). NoSQLfor Dummies, Wiley.
References:
Eric Redmond, Jim R Wilson. (2012). Seven Databases in Seven Weeks, LLC.
Dan Sullivan. (2015). NoSQLfor Mere Mortals, Addison-Wesley.
Adam Fowler. (2015). NoSQLfor Dummies, John Wiley & Sons.
Gaurav Vaish. (2013). NoSQL Starter, Packt Publishing.
Dayley. (2015). NoSQL with MongoDB in 24 Hours, Sams Teach Yourself, (151 Ed). PEARSON
Verified By: �
E. AUTONOMOUS
KRISTU JIWMHI COLLEG
Si£.::,mature It Narayanapura, Kot
hanur pO
eengaturu - 560077
Page 89 of 104
00CS02 18 BCADL2A51
BCADL2AS1: NOSQL DATABASE PRACTICAL
Course Objectives:
• To encompass a wide variety of different database technologies that was developed in response
to the demands.
• To build a modern applications and understand and use columnar and distributed database with
understand and use columnar and distributed database patterns.
Course Outcomes:
• formulate RDBMS queries with NoSQL databases
• create structures for advance queries using NoSQL database
1. Write a program to connect database, you need to specify the database name, if the database
doesn't exist then MongoDB creates it automatically .
2. Write a program to create a collection, createCollectionO method.
3. Write a program to insert a document into MongoDB,.
4. Write a program to list all the collections in a database.
5. Write a MongoDB query to display the fields restaurant_id, name, borough and zip code, but
exclude the field _id for all the documents in the collection restaurant.
6. Write a MongoDB query to fmd the restaurant Id, name, borough and cuisine for those
restaurants which contain 'Wil' as first three letters for its name.
7. Write a program to create collections for student data and to display the student_Id in ascending
order.
8. Write a program to create collections for student data and to display the student_Name in
descending order.
9. Write a MongoDB query to find the student data that achieved a score, more than 80 but less
than 100.
10. Write a program to set up a replica set and to add members for the same.
11. Write a program to establish a connection between Java and MongoDB.
12. Write a program to create a document in Collection User with fields name and description.
13. Write a program for updating the data in MongoDB.
14. Write a program for retrieving the data in MongoDB.
15. Write a program for deleting the data in MongoDB.
Evaluation Criteria
Criteria Marks
three questions
Viva Voce 5
Total 35
Verified Bey : : h. �J'o

�
'f' 1\rioW'>� F•CULTY OF SCIENCE
Nam KRIS TU JAYANTI COLLEGE AUTONOMOUS
Signature -Q� K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 90 of 104
00CS02
VI Semester
Page 91 of 104
00CS02 18 BCA204A61
BCA204A61: DESIGN AND ANALYSIS OF ALGORITHMS

Course Objective:
• To develop the analytical skills in students, to enable them to design algorithms for various
applications and analyze the same.
Course Outcomes:
After successful completion of the course, the student wil1 be able to:
• design space and time efficient algorithms
• analyze time complexity for searching and sorting algorithms
• evaluate optimization problems using greedy method and dynamic programming techniques
• compare traversal techniques for trees and graphs
• create state space trees using backtracking
Definition of algorithm; Characteristics; Different control structures; Writing structured programs;
Analysis of algorithm; asymptotic notations and Basic efficiency classes.
Unit 2: Divide and Conquer Method 12 hrs
General method; Binary search; Finding maximum & minimum; Merge sort; Quick sort.
Unit 3: Greedy Method 12 hrs
General method; Knapsack problem; 0/1 Knapsack problem; Job sequencing with deadline; Minimum
cost spanning tree; Single source shortest path.
Unit 4: Dynamic Programming 12 hrs
General method ;Introduction to graphs; Definition; Types; Terms related to graph; Multi stage graphs;
All pairs shortest path; 0/1 knapsack; The travelling sales person problem; Flow shop scheduling.
Unit 5: Basic Traversal & Search Techniques 12 hrs
Search & traversal techniques for trees; Search & traversal techniques for graphs; Introduction to NP
hard and NP-completeness.
Backtracking - General method; 4-queens problem; The 8-queens problem; Sum of subsets problem;
Graph coloring problem; Hamiltonian problem.
Text Books:
Aho Ullman & Hopkraft .Design & Analysis OfAlgorithms .(1sted.).Dorling kindersley
Ellis Horowitz Sartaj Sahni & Sanguthevar Rajasekaran.(2007).Fundamentals Of Computer
Algorithms. Silicon Press.
A. M. Padma Reddy (2010). "Design and Analysis of Algorithms". Revised Edition: Sri Nandi
Publications.
References:
A.A. Patambekar. (2011 ).Design & Analysis ofAlgorithm. Technical Publishers.
M.H.Alsuwaiyel.(1999).Algorithms: Design Techniques and Analysis. World Scientific Publications.
Sara Base, Allen Van Gelder.(1999).Computer Algorithms Introduction to Design and Analysis (3rd
ed.). Addison Wesley Publishing Company
T.H.Cormen, C.E.Leiserson, R.L.Rivest, C.Stein.(2003). Introduction to Algorithms(2°d ed.).Prentice
Hall of India Pvt. Ltd.
V.V.Miniswamy. (2009). Design and Analysis of Algorithms.I. K. International Pvt Ltd.
Verified By:
Name : H· L1jo 1>
�
FACULTY Of SCIENCE
AUTONOMOUS
KRISTU JAYANTI COLLEGE
Signature ·Q� It Narayanapura. Kothan
iengaluru • 560077
ur PO
Page 92 of 104
00CS02 18 BCA204A62
BCA204A62: ARTIFICIAL INTELLIGENCE

Course Objective:
• To have a basic understanding of some of the more advanced topics of AI such as learning,
natural language processing, agents and robotics, expert systems, and planning.
Course Outcomes:
After successful completion of the course, the student wiIJ be able to:
• evaluate heuristic, best first, mean end analysis, game playing and minimize search techniques
• illustrate functional predicates,conditional,list and array using Lisp,syntax and semantics of
knowledge based systems
• explain Natural Language processing methods, Neural network architecture and expert system
Importance of AI; Properties of internal representation; Heuristic search techniques. Best first search;
mean and end analysis; Game Playing; Minimize search procedure; Alpha beta cutoffs.
Unit 2: Knowledge 14 hrs

Definition and importance of Knowledge; Knowledge - based systems. Representation of knowledge
propositional logic - syntax and semantics for PL; FOPL; properties of well-formed formulas;
representations using rules. Representations using structured knowledge; associative networks; syntax
and semantics; graphs; frames; conceptual dependencies and scripts.
Unit 3: Natural Language Processing 12 hrs
Introduction; levels of knowledge used in language understanding; grammars and languages, basic
parsing techniques - top down; bottom - up parsing; deterministic and no deterministic parsers;
example of a simple parser; RTN.
Unit 4: LISP 06 hrs
Introduction; syntax and numeric functions; basic list manipulation functions; functions predicates and
conditionals; input; output and local variables; property lists and arrays.
Unit 5: Neural Networks & Expert Systems 14 hrs
Neural Networks: Definition, Models of Neurons, Neural Networks viewed as directed graphs; Network
Architectures.
Expert Systems: Characteristics, features of expert systems; applications and importance of expert
system.
Text Books:
Dan W. Patterson.(2013). Introduction to Artificial Intelligence and Expert Systems, PHI.
C.S.Krishnamoorthy and S.Ranjeev.(1996). Artificial Intelligence and Expert Systems for Engineers,
CRC press, Inc.
Patrick. H.Winston, Berthold Klaus Paul Horn.(2008). LISP, Pearson Education.
References:
E. Charnaik and D.McDermott.(2012). Introduction to artificial Intelligence, Pearson Education.
E. Rich and K. Knight. (2013 ). Artificial Intelligence, Tata McGraw Hill.
Nils J. Nilson. (2002). Principles ofArtificial Intelligence, Narosa Publishing Co.
S. Russell and P. Norvig.(2007). Artificial Intelligence A Modern Approach, (2nd ed).
Dan W. Patterson.(1996). Artificial Neural Networks: Theory and Applications, PHI.
Verified By : : h'·
Name �Jo 1' N
FACULTY OF SCIENCE
KRIS TU JAYANTI COLLEGE AUTONO
-Q�
Signature MOUS
Bengaluru Page 93 of 104
- 560077
00CS02 18 BCA2P4A61
BCA2P4A61: PROJECT
Course Objective:
• To apply knowledge for implementing pilot ideas into real life working software projects
through testing within stipulated period of time.
Course Outcomes:
• design application software using programming languages
• manage connectivity between front end and back end application
Guidelines:
• Students have to develop a project using any advanced technology as frontend with any external
database as backend. They are encouraged to develop their project benefiting both public/private
and research organizations.
• Project should be developed individually or in teams consisting of not more than two members. It
should be large enough to justify as a BCA final semester project. The project should be genuine
and original in nature and should not be copied from anywhere else.
• Each member in the team must submit an individual project report.
• The progress of the project is monitored through the project manual by the faculty guide on weekly
basis.
• The Continuous Internal Evaluation (CIE) marks are based on the project reviews conducted during
the course of the project work.
• To develop a quality software product, a student has to follow the following phases and submit a
report consisting of these to the concerned faculty guide within the specified duration. The various
phases are:
1. Initiation phase: The objective of this phase is to examine the feasibility of the project. This phase
includes:
a. Why this project?
b. Is it feasible?
c. What is the outcome of this project?
2. Design phase: Design phase includes Table structure, ER-diagram, DFDs, Activity chart, Gantt
chart, Architecture design and Input/output form designs which should not be changed in the later
stage of the project.
3. Development phase: In this phase, the complete program code (well intended) with comments and
description should be developed. It also includes complete error handling and proper validation
based on the project requirement.
Evaluation Criteria
Total (CIE+ESE) = 3o+70
Continuous Internal Evaluation [CIE]: Project Review I + Project Review II: 15+15
Project Review I: Synopsis + Project Content+ Project Designing
Synopsis: 5 Mark
Project Review II: Project Report+ Working Demo
End Semester Examination [ESE): Viva+ Demonstration: 20+5 0
Verified By :
Name : h-· UJb 'P %orr)t\J
FACULTY IF SCIENCE
Signature
·Q__l: KRISTU JAYANTI COLLEGE AUTONOMOUS
eengaluru - 560077
Page 94 of 104
00CS02 18 BCAA04A61
BCAA04A61: MOBILE APPLICATION

Course Objective:
• To develop the tool in the Android development environment and to use the major components
of Android API set to develop their own apps.
Course Outcomes:
• demonstrate the principles of Android and windows operating System
• explain techniques of using android software development tools
• develop android programs and deploy on virtual mobile device
Unit 1: Overview 12 hrs
Background about mobile technologies; Different mobile technologies: Android, Windows, IOS, Black
Berry, Series 40, Bada; Benefits and drawbacks of smartphone programming; Android: Overview,
Evolution, Features, Stack overview; Linux kernel; Native libraries; App framework; Apps; SDK:
Overview, platforms; Tools.
Unit 2: Get Started with Android 12 hrs
Get to know Eclipse: Build, Install, Run the application in the emulator or device, Project structure.
Designing User interface - Designing by declaration; Creating the opening screen; Using alternate
resources; Implementing an About Box; Applying a theme; Adding a menu; Adding settings;
Debugging with log messages; Debugging with debugger.
Unit 3: Exploring 2D graphics and Multimedia 12 hrs
Learning the basics; Adding graphics to existing apps; Handling input, Learn to change the final
improvements; Playing audio; Playing video; Adding sound to existing app; Storing local data;
Reading/writing local data; Accessing the internal file system; Accessing SD card.
Unit 4: Location and Sensing 12 hrs
SMS Messaging; Displaying MAPS location Data; Monitoring and tracking a location.
Putting SQL to work: Introducing SQLite; In and Out of SQLite; Hello database; Data binding; Using
content provider; Implementing content provider.
Unit 5: Introduction to Windows Phone Programming 12 hrs
Windows 8 GUI development; Windows 8 software development tools; .Net 4.5 features Windows
Phone platform overview; Multitasking windows; Interacting from background; Local data, Working
with sensors, tools and phone emulator; Debugging and performance; What's new in Windows phone
8; App-to-App communication; Lock screen background; Lock screen badges; Tiles; Tiles templates;
Tiles update; Final touch before deploying and testing in emulators.
Text Books:
Grant Allen. (2012) . Beginning Android 4. Apress.
Wei-Meng Lee. (2012). Beginning Android 4 Applications Development. John Wiley & sons, Inc.
References:
Charles Petzold. (2010). Programming Windows Phone. Microsoft Press. India.
Ed Burnette. (2009).He/lo, Android: Introducing Google's Mobile Development Platform. Pragmatic.
Bookshelf. ISBN-13: 978-1934356173.
Jerome (J.F) DiMarzio. (2010). Android -A programmer's Guide. TataMcgraw Hill.
Wallace B. Mcclure, Nathan Blevins, John J.Croft IV, Jonathan Dick and Chris Hardy. (2012).
Professional Android Programming with Mono for Android and .NET IC#. Wiley India Pvt, Ltd.
Zigurd Mednieks, Laird Domin, G.Blake Meike, and Maumi Nakamura. (2012). Programming
Android. O'Reilly. Shroff Publishers. India
�
verified By : FACULTY OF SCIENCE
Name
KRISTU JAYANTI ceLLEGE AUTONOMOUS
s,gnature K. Narayanapura,
PageKothanur
95 of 104 PO
Bengaluru - 560077
00CS02 18 BCAAL2A61
BCAAL2A61: MOBILE APPLICATION PRACTICAL
Course Objective:
• To develop the tool in the Android development environment and to use the major components
of Android API set to develop �heir own apps.
Course Outcomes:
• create GUI applications using built in widgets and components
• customize android applications with layouts and rich interactive interface
1. Creating "Hello world" Application.

2. Creating an Application that displays message based on the screen orientation.
3. Create an application that displays custom designed Opening Screen.
4. Create menu in Application.
5. Play an audio, based on the user event.
6. Read/ write the Local data.
7. Create an android program for addition of 2 no's using edit view control and button.
8. Create an android program for demonstrating the usage of a progress bar for downloading
music.
9. Create a Tiles based application using an android IDE.
10. Create an android program to Develop Search application.
11. Create an android program to draw a circle.
12. Create an android program for different type of animation from the menu and the selected
animation.
13. Android program to demonstrate the usage of activity life cycle.
14. Android Program to Demonstrate Touch Listener.
I 5. Java Android Program to Demonstrate Implicit Intent.
Note: All the exercises are to be developed using ANDROID SDK tools.
Evaluation Criteria
Criteria Marks
Writing any two programs from the
given three programs. 7.5 x 2 = 15
Viva Voce �
Total �5
FACULTY Of SCIENCE
Verified By :
Name : M-· Ujo KRISTU JAYANTI COLLEGE AUTONOMOUS
I<.. Narayanapura, Kothanur PO
-Q_}0
Signature
Page 96 of 104
00CS02 18 BCAB04A61
BCAB04A61: MULTIMEDIA TOOLS AND APPLICATION
Course Objective:
• To understand the relevance and underlying infrastructure of the multimedia systems,
multimedia technologies and multimedia standards.
Course Outcomes:
• classify the usage of multimedia elements and editing tools
• interpret lossy and loseless compression algorithms for text and image
• apply image, audio, video, animation capturing, processing and rendering
• techniques in multimedia environment
• develop multimedia projects using authoring tools
Unit 1: Introduction to Multimedia System 12 hrs

Introduction to multimedia system: Multimedia elements; multimedia tools; multimedia applications;
system architecture; evolving technologies-defining objects for multimedia systems: text, images,
animation, audio, video; multimedia data interface standards; File format standards:
TIFF,RTF,MIDI,JPEG,AVI; introduction to multimedia database.
Unit 2: Images and Animation 12 hrs

Image capturing techniques : Image scanners , Digital Camera ; Basics of animation; use of animation
in multimedia; types of animation; Keyframes and Tweening; Computer Assisted Animation;
Creating movement ;Principles of Animation; 3D animation; Rendering Algorithm: Ray casting
algorithm , Shading Algorithm, Ray tracing Algorithm.
Unit 3: Sound and Video 12 hrs

Sound: Sound and its attributes: Acoustics, sound waves, characteristics of sound waves, musical note
and pitch; Elements of Audio systems; Audio Mixer; Digital Audio; Synthesizers; Musical instrumental
and Digital Interface (MIDI).
Video: Introduction; Video Capturing techniques: Monochrome video camera, color video camera;
Video Signal Formats; video standards: NTSC, PAL, SECAM, HDTV.
Unit 4: Compression Techniques 12 hrs

Need for data compression: compression standards, Text Compression-Huffman and LZW coding,
Lossy and Non -Lossy compression for Images, Lossy compression for photograph and video; Binary
Image compression schemes; Video Image Compression algorithm; Audio Compression algorithm.
Unit S: Authoring Tools And Multimedia Project 12 hrs

Authoring Tools and Multimedia Project Multimedia authoring tools: Types of tools : Card and page
based authoring tools, Icon based authoring tools, Time based authoring tools; Planning and
distribution of a multimedia project; Multimedia development team and required skills; Stages in
designing and producing multimedia products for CD; Testing of product; Distribution of multimedia
product; Various formats of CD's and DVD's.
�
: FACULTY OF SCIENCE OMOUS
verified Bey • h· u\J·O q=> 'lhoY'(")a..J E AUTON
KRISTU JAYANTI COLLEGKothanur PO
Nam
K Narayanapura,
• � . Sengaluru - 560077
Signature
Page 97 of 104
00CS02 18 BCAB04A61
Multimedia Project: Multimedia project plan; Multimedia project team; Multimedia Project design and
development; Different phases of multimedia project; Examples of multimedia projects.
Text Books:
Unit 1 & 2: Multimedia Systems Design Prabhat K.Andleigh ,Kiran Thakrar PHI Publications 2011.
Unit 3 & 4 : Principles of Multimedia Ranjan Parekh Tata McGraw Hill Publications 2009.
Unit 5: Tay Vaughan. Multimedia: Making It Work. Tata McGraw Hill. (8th edition)
References:
T.M.Savage , K.E Vogel An Introduction to Multimedia (2nd ed.)
David Hillman.Multimedia-Technology and Applications. Delhi : Galgotia Publications. James E
Shuman. Multimedia In Action.Vikas Publishing House.
Judith Jeffcoate. (1998). Multimedia in Practice Technology and Applications. PHI. Parag Havaldar
and Gerard Mediont (2009).Multimedia Systems: Algorithms, Standards, and Industry Practices.
PaperBack.
FACULTY OF SCIENCE
Verified By : KRISTU JAYANTI COLLEGE AUTONOMOUS
Name : h"· Ljo 1' 1toMtU K. Narayanapura, Kothanur PO
Bengaluru - 560077
Signature
.Q�
Page 98 of 104
00CS02 18 BCABL2A61
BCABL2A61: MULTIMEDIA TOOLS AND APPLICATION PRACTICAL
Course Objective:
• To understand the relevance and underlying infrastructure of the multimedia systems,
multimedia technologies and multimedia standards.
Course Outcomes:
• customize brochures, banners, invitations and newsletters using photoshop, corel draw and
publisher
• manage audio and video tracks using AN editing tools
• develop multimedia projects using authoring tools
1. Create a Natural Scenery using Photoshop.

2. Create Plastic Surgery for the Face Using Photoshop.
3. Create See-through text using Photoshop.
4. Create a Web Page of displaying event hrochure using Photoshop.
5. Create a picture in the existing image background in Corel Draw.
6. Create a 3D text in Corel Draw.
7. Design a business card for a company embed photo in it using Core Draw.
8. Design a banner for a marriage function using Corel Draw.
9. Create an advertisement for a Textile company in Corel Draw.
10. Animate Plane Flying in the Clouds using Photoshop/Flash.
11. Preproduction & Presentation Graphics: Create a 7-10 slide presentation in your favorite
presentation graphics application. (Power point is suggested).
12. Desktop Publishing: Create a 2-page desktop-published "newsletter," possibly using your
"What is Multimedia?" text. Include graphics.
13. Multimedia Sound: Create 2 soundtracks and 2 EFX sounds for a previous project.
14. Digital Video: Use video capture to digitize your video shoot to another video source to create
short production (15-45 seconds).
15. Create three basic Web pages using Dreamweaver I flash or other authoring package or write
bare HTML if you are able; pages must be linked and must include at least one graphic per
page.
16. Production Planning and Design: Create a proposal of project. Include summary, flowchart,
element and resource lists.
Evaluation Criteria
Criteria !Marks
Writing any two programs from the
given three programs. r7.5 x 2 = 15
Viva Voce 5
Total 35
�
Verified By : FACULTY Of SCIENCE
fy. UJ'o � NOMOU�
KRIS TU JAYANTI COLLEGE AUTO
'1bh')dl.R
Name
K. Narayanapura, Kethanur PO
Signature
Q_b· Page-99560
Bentaluru 077
of 104
00CS02 18 BCAC04A61
BCAC04A61: BIG DATA ANALYTICS USING PYTHON
Course Objective:
• To introduce the basic Python programming language and Python tools to work productively
with data.
Course Outcomes:
• design python programs using string, lists, dictionaries, and tuples and set data types
• apply the object oriented concepts, functions and file handling in python programs
• select numpy,pandas and mathplotlib packages to analyze and visualize the data
Unit 1: Introduction to Python 12 hrs

Basics of Python - Introducing the python interpreter; Using the Interactive Prompt; Running Files
with command lines; IDLE Basics; Using IDLE; Other IDEs.
Python's Core Data types; Numbers; Strings; Lists; Dictionaries; Tuples; Numeric type basics;
Numeric literals; Built-in Numeric tools; P)1hon Expression operators; Variables and Basic
expressions; Taking input and displaying output; Adding comments.
Strings - Basic operations; Indexing and Slicing; String Methods; Lists in Action - Basic List
operations; List Iteration and Comprehensions; Indexing, Slicing and Matrixes; Dictionaries - Basic
Dictionary operations; Changing Dictionary in-place; More Dictionary methods; Tuples - Tuples in
Action.
Unit 2: Decision making and Functions 12 hrs

Control flow statements; if statement; General format; Basic examples; if else statement; while loops;
for loops; break, continue, pass and the Loop else; use of compound expression in conditional and
looping construct.
Functions - Grouping code under a name, Coding functions, def statements. Python Scope Basics
Scope rules; Name resolution: The LEGB rule; Scope example. Argument-passing basics- Arguments
and Shared references.
Unit 3: Object Oriented Programming using Python 12 hrs

Creating a class, the class statement; General form, Example; Methods; Inheritance; Operator
overloading; Static and Class Methods;
Exception Handling: Errors in a python program, Default Exception Handler, Catching Exceptions;
Raising Exceptions; User-Defined Exceptions. The try/except/else statement, the assert statement
Modules and packages: Creating modules and packages, Module Usage; The import statement; the
from statement; the from * statement; Package import basics; Package import example.
Unit 4: File Handling in Python 12 hrs

Data File : Types of data file-text and binary, opening and closing files, openO,closeQ,access
modes(output,input,default),file object,access_modes, reading and writing a file Read(), readlineO,
readlinesO, writeQ, writelines(). File positions (seek (), tell()), renaming and deleting a file, flush().
Implementation of basic file operations on text and binary file in Python.
Verified By: : �· Ujo 'P �ornAJ

Na me �
Signature .Q_b FACULTY Of SCIENCE

KRISTU JAYANTI COLLEGE AU
TONOMOUS
It Narayanapura, Kothanur
PO
Bengaluru • 56 00 77
Page 100 of 104
00CS02 18 BCAC04A61
Unit 5: Data Science packages using Python 12 hrs

Introduction to Numpy; Creating ndarrays; Data types for ndarrays; Operations between Arrays and
Scalars; Basic Indexing and Slicing; Introduction to pandas Data structures; Series, Data Frame, Index
Objects; A brief matplotlib API primer; Figures and Subpots; Colors; Markers, and Line styles; Ticks,
Labels and Legends; Plotting functions in Pandas; Line plots, Bar plots, Histograms and Density plots;
Scatter plots; Python Visualization Tool Ecosystem.
Text Books:
Balagurusamy. E, (2016). Introduction to computing and problem solving using Python. McGraw Hill
Education Private Ltd.
Wes McKineey. (2013). Python for Data Analysis.(! st Edition). O'Reilly
Mark Lutz. (2009). Learning Python. (41h Edition). O'Reilly.
References:
Mark Guzdial, Barbara Ericson (2015). Introduction to computing and programming in Python.
Pearson Education
Kenneth Lambert.A (2012). Fundamentals of Python. Cengage Learning Pvt Ltd
Paul Barry (2016). Headfirst Python. O'Reilly·
John Stewart.M (2014), Python for Scientists. Cambridge University Press
�
FACULTY OF SCIENCE
Verified By : : f;-. GJ o 1' '1hor<>� KRISTU JAYANTI COLLEGE �UTONOMOUS
Name K. Narayanapura, Kothanur PO
Signature .Qfi Bengaluru - 560077
Page 101 of 104

00CS02 18 BCACL2A61
BCACL2A61: BIG DATA ANALYTICS USING PYTHON PRACTICAL
Course Objective:
• To introduce the basic Python programming language and Python tools to work productively
with data.
Course Outcomes:
• adopt object oriented concepts, user defined data types, functions and data science concepts in
python
• develop python programs using sequential, decision making and iterative constructs
l . Write a Python program to implement at least ten String methods.

2. Write a Python program using Sieve of Eratosthenes method for computing primes upto a
specified number(use List class).
3. Write a Python program to merge two Python Dictionaries, sum all the items in the merged
Dictionary and print the Dictionary in the table format.
4. Write a program in Python to fmd the GCD of two numbers.
5. Write a Python program to display Pascal's triangle of 'n' rows.
6. Write a Python program to check whether a number is a perfect square.
7. Write a Python program to demonstrate the different types of constructors.
8. Write a Python program to demonstrate Exception handling.
9. Write a Python program to demonstrate different types of inheritance.
10. Write a Python program to create a text file and copy it into another file.
11. Write a Python program to encrypt and decrypt a file.
12. Write a Python program to create a text file and search whether a string is present in the file.
13. Write a Python program to find common values between two arrays and to get unique elements
of an array(Use NumPy).
14. Write a Python program to add, subtract, multiple and divide two Pandas Series.
15. Write a Python program to create and display a DataFrame from a specified dictionary data
which has the index labels. Also write a program to iterate over rows in a DataFrame.
Evaluation Criteria
Criteria Marks
three questions
Viva Voce 5
Total 35

Name : .f'1S" · L]o 'f 1hor().Y KRISTU JAYANTI COLLEGE AUTONOMOUS
·0�
It Narayanapura, Kothanur PO
Signature Bengaluru - 560077
Page 102 of 104

00CS02 18 BCAD04A61
BCAD04A61: DATA VISUALIZATION TECHNIQUES

Course Objective:
• To understand the methodologies used to visualize large data sets involved in the process of
data visualization and to get a brief insight about Tableau.
Course Outcomes:
• illustrate stories and dashboards from datasets and extract the insights of data
• construct data visualization using charts, histogram and box plots
• analyze datasets visually using Tableau
Exploiting the digital age, visualization as a discovery tool, the bedrock of visualization knowledge,
Defining data visualization, visualization skills, the data visualization methodology, Visualization
design objectives.
Unit 2: Purpose and Key Factors 10 hrs
Clarifying the purpose of the project, establishing intent: the visualization's function and the
visualization's tone, Key factors surrounding a visualization project, the "eight hats" of data
visualization design.
Unit 3: Editorial focus demonstration 10 hrs
The importance of editorial focus, Preparing and familiarizing with data, Refining editorial focus,
Using visual analysis to find stories, An example of finding and telling stories.
Unit 4: Data Visualization options and visualization methods 15 hrs
Data visualization design choices, the visualization anatomy: Data representation and the data
presentation, Creating interactivity, Data visualization methods - Tables, Graphics, charts, Histograms,
Frequency distribution, Relative frequency measures of central tendency and dispersion; Box Plot;
Descriptive Statistics.
Unit 5: Introduction to Tableau 15 hrs
Connecting to text files, Connecting to Excel files, Connecting to Access databases, Understanding
dimensions and measures, Changing data types, Applying filters, Merging multiple data sources,
Creating tables, Creating bar graphs, Creating pie charts, Creating line charts, Creating box plots,
Showing aggregate measures, Showing the top N items.
Text Books:
Andy Kirk. (2012). Data Visualization: A successful design process by, PACKT publishing enterprise.
Ashutosh Nandeshwar. (2013). Tableau Data Visualization Cookbook, PACKT publishing enterprise.
Jos Dirksen. (2017). Expert Data Visualization, PACKT Publishing Limited.
References:
Ben Fry. (2007). Visualizing Data, O"Reilly Media, Inc.,
Greg Conti.(2007). Security Data Visualization: Graphical Techniques for Network Analysis, No
Starch Press Inc.
Scott Murray. (2013). Interactive data visualization for the web, O" Reilly Media, Inc.,
Jen Stirrup, Ashutosh Nandeshwar , Ashley Ohmann, Tableau: Creating Interactive Data
Visualizations , Matt. Packt Publishing Limited.
Daniel Weiskopf, Gpu-based Interactive Visualization Techniques, Springer-Verlag
Verified By : : ,h-. Gjo � "\ho� FACULTY OF SCIENCE

Name I\RIS TU JAYANTI COLLEGE AUTONOMOUS
Signature
Q_b- Bengaluru - 560077
Page 103 of 104
00CS02 18 BCADL2A61
BCADL2A61: DATA VISUALIZATION PRACTICAL
Course Objective:
• To understand the methodologies used to visualize large data sets involved in the process of
data visualization and to get a brief insight about Tableau.
Course Outcomes:
• design dashboards and stories for datasets
• formulate data visualization for pivot table ,bubble chart, box plot and guage using Qlikview
1. Create a chart for Box and Whisker Plot in Qlikview.

2. Create a Magic Quadrant Chart in Qlikview.
3. Create a Heatmap using colormix wizard in Qlikview.
4. Write a Data Visualization for making it visual appealing in Qlikview.
5. Create a Guage chart in Qlikview dashboard in Data Visualization.
6. Create a set reference with the base value in Qlikview.
7. Create a Mini charts for the new way of showing the trend chart or bar chart in just a cell of a
metric in Qlikview.
8. Create a Pivot tables regularly used in metric for management reporting using Qlikview.
9. Create a Straight Table to show the regular metrics for business users in Qlikview.
10. Create a Funnel chart which is basically used to show the pipeline related activities in Qlikview.
11. Create a scatter or Bubble chart to visualize complex business scenario in a very efficient
manner in today's modern dashboard in Qlikview.
12. Create Mekko Chart and stack bar chart to show the difference in stack categories with the
increased or decreased width using Qlikview.
13. Create Boxplot chart to show the stock analysis using Qlikview.
14. Create a waterfall chart to show how the series of values affecting an initial value using
QHkview.
15. Create a step line chart to show the actual movement from the last data point to the current data
point using Qlikview.
Evaluation Criteria
Criteria Marks
three questions
Viva Voce 5
Total 35
Verified By : AN
Name �· ujo f �&{)a,&
FACULTY OF SCIENCE
Signature
Q£-- K. Narayanapura, Kothanur PO
Bengaluru - 560077
Page 104 of 104

Kristu Jayanti: College

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Kristu Jayanti: College

Uploaded by

Copyright:

Available Formats

Curriculum for 2020 Bachelor of Computer Applications

Kristu Jayanti College

Bachelor of Computer Applications

bt:i :J,i.11u - 5e�Q77

. Eli ibili Conditions for End Semester Examinati n

ii. Academic Performance Evaluation

FACULTY OF SCIENCE Kristu Ja·ianti ollege Autonomous

Course Credits Duration of ESE Total Marks

Continuous Internal Evaluation

Pass Status for a Programme

. SGPA CGPA and Gradin T=-a...b...le_____________________

Table ill: Ten Point Grading Table

Grade Point Interpretation Table Result Interpretation Table

► Orientation Programmes: Orientation is offered at the beginning of the programme. It

► Value Added Courses - To provide students with an understanding of the expectations of

► Certificate Programmes:- A certificate is earned by a student upon completion of a course in

► Co-Curricular Activities: Computer Academy organizes various activities to build

Common Interest Groups Knowlede:e Kindle Groups

► Jayantian Extension Services: Students are encouraged to participate and contribute in a

HOD. D�ter Scii:n�e � P CIPAL

3.1 Computation of CO Attainment for UG Programmes

ar.h· c o Hege Autonomous

3. Membership in Jayantian Extension Services(JES)-NCC /NSS I CSA and being a n active

Course Code Course Title Offered by

4 Credits Course (Theory)

3 Credits Course (Theory)

2 Credits Course (Theory)

Programme Matrix: Bachelor of Computer Applications [2020 Batch]

Kristu Jayanli College Aulonornu(;:i K. Narayanapura, K omous

DSCC I 00CS02 18 BCA204A33 I UNIX/LINUX

DSCC j 00CS02 18 BCA204A34 I Probability and Statistics 60 4 3 1 - 4 30 I 10 I 100

tiOD. frepartment of Computer Scieni.:11

I IV Semester __________ ___ I

DSCC I O0CS02 18 BCA204A42 I DataMmmg

Programme Matrix: Bachelor of Computer Applications (2020 Batch]

Kristu Ja'{anH College Autonomous

Programme Matrix: Bachelor of Computer Applications [2020 Batch]

00CS02 18 BCA204A62 Artificial Intelligence 60 4 3 1 - 4 30 70 100

AEN103All: ADDITIONAL ENGLISH I

Unit 1: Prose & Poetry 25 hrs

Unit 2: One Act Play 10 hrs

Unit 3: Writing Skills lOhrs

• �&J/¢?07 rrerr�-"it.wr��-�eR'WPTfR, �H/576/le-2014.

Unit 2: Grammar 10 hrs

Unit 3: Communication Skills 10 hrs

BCA204All: BASIC ELECTRONICS

Unit 1: Introduction to Network Theorems & AC Fundamentals 12 hrs

Unit 2: Semiconductor Devices 12 hrs

Unit 3: Introduction to Digital Electronics 12 hrs

Unit 4: Combinational Circuits 12 hrs

Unit 5: Sequential Circuits 12 hrs

Signature -0 � KAISTU JAYANTI COL

Unit 1: Introduction 18 hrs

Unit 2: C Operators & Control Structures 12 hrs

Unit 3: Arrays and Functions 12 hrs

Unit 4: Structures and Unions 10 hrs

Unit 5: Pointers and Files 08 hrs

BCA204A13: COMPUTING AND PROGRAMMING FUNDAMENTALS

Unit 1: Programming Process 12 hrs

Unit 2: Programming Paradigms 12 hrs

Unit 3: Software Paradigms 14 hrs

Unit 4: Computing Paradigms 12 hrs

Unit 5: Case Study 10 hrs

I IV Semester ________ _ I