Bachelor of Computer Applications

RANI CHANNAMMA UNIVERSITY, BELAGAVI
PROGRAM /COURSE STRUCTURE AND SYLLABUS

as per the Choice Based Credit System (CBCS)
designed in accordance with
Learning Outcomes-Based Curriculum Framework
(LOCF)
of National Education Policy (NEP) 2020
for
BACHELOR OF COMPUTER APPLICATIONS (BCA)
w.e.f.
Academic Year 2021-22 and onwards

Curriculum for BCA Program of RCUB as per NEP 2020 w.e.f. 2021-22
Board of Studies (UG) Committee (NEP-Bachelor of Computer Applications)
Bachelor of Computer Applications (BCA) Programme 2021-22
1 Prof. Dayanand G Savakar, RCU, Belagavi Chairman
Smt. Asmitha S Deshpande, , Gogte Commerce College,

2 Member
Belagavi.
3 Shri. AnandPatil, DMSM Society, BCA College, Belagavi Co-Opt Member
Shri. Prasad Khode, SKE Society, GSS, BCA College,

4 Co-Opt Member
Belagavi
Dr. Vijayalaxmi S Shigehalli Dr. Dayanad G Savakar

Dean of Science Faculty Chairman BoS(UG)
Rani Channamma University, Belagavi Department of Computer Science
RCU, Belagavi
Page 2 of 43
PREAMBLE
Computer Application (CA) has been evolving as an important branch of science and
technology in last two decade and it has carved out a space for itself like computer
science and engineering. Computer application spans theory and more application
and it requires thinking both in abstract terms and in concrete terms.The ever-
evolving discipline of computer application has strong connections to other

disciplines. Many problems in science, engineering, health care, business, and other
areas can be solved effectively with computers and its applications, but finding a
solution requires both computer science expertise and knowledge of the particular
application domain.Computer science has a wide range of specialties. These include
Computer Architecture, Software Systems, Graphics, Artificial Intelligence,

Mathematical and Statistical Analysis, Data Science, Computational Science, and
Software Engineering.
Universities and other HEIs introduced programmes of computer application.
Information Technology is growing rapidly. Increasing applications of computers in

almost all areas of human endeavour has led to vibrant industries with concurrent
rapid change in technology. Unlike other basic disciplines, developing core

competency in this discipline that can be reasonably stable becomes a challenge.In
India, it was initially introduced at the Master (postgraduate) level as MCA and
M.Tech. Later on, engineering programmes such as B.Tech and B.E in Computer
Science & Engineering and in Information Technology were introduced in various

engineering College/Institutions to cater to the growing demand for trained
engineering manpower in IT industries.Parallelly, BCA, BSc and MSc programmes with

specialisation in Computer Science were introduced to train manpower in this highly
demanding area.
BCA and BCA (Hons) are aimed at undergraduate level training facilitating multiple
career paths. Students so graduated, can take up postgraduate programmes in CS or

MCA leading to research as well as R&D, can be employable at IT industries, or can
Page 3 of 43
pursue a teaching profession or can adopt a business management career.BCA and
BCA (Hons) aims at laying a strong foundation of computer application at an early

stage of the career. There are several employment opportunities and aftersuccessful
completion of BCA, graduating students can fetch employment directly in companies

as programmer, Web Developer, Software Engineer, Network Administrator, Data
Scientist, or AI/ML personnel.

The Program outcomes in BCA are aimed at allowing flexibility and innovation
indesign and development of course content, in method of imparting training, in

teaching learning process and in assessment procedures of the learning outcomes.
The emphasis in BCA courses, in outcome-based curriculum framework, help

students learn solving problems, accomplishing IT tasks, and expressing creativity,
both individually and collaboratively. The proposed framework will help Students
learn programming techniques and the syntax of one or more programming
languages.
All students must, therefore, have access to a computer with a modern programming
language installed. The computer science framework does not prescribe a specific
language. The teacher and students will decide which modern programming
languages students will learn. More importantly, students will learn to adapt to
changes in programming languages and learn new languages as they are developed.
The present Curriculum Framework for BCA degrees is intended to facilitate the
students to achieve the following.
 To develop an understanding and knowledge of the basic theory of Computer

Science and Information Technology with good foundation on theory, systems
and applications such as algorithms, data structures, data handling, data

communication and computation
 To develop the ability to use this knowledge to analyse new situations in the
application domain
Page 4 of 43
 To acquire necessary and state-of-the-art skills to take up industry challenges.
The objectives and outcomes are carefully designed to suit to the above-
mentioned purpose.
 The ability to synthesize the acquired knowledge, understanding and experience

for a better and improved comprehension of the real-life problems
 To learn skills and tools like mathematics, statistics and electronics to find the
solution, interpret the results and make predictions for the future developments
 To formulate, to model, to design solutions, procedure and to use software

tools to solve real world problems and evaluate
Page 5 of 43
PROGRAM OUTCOMES:
By the end of the program the following outcomes will be achieved by the
students:
1. Discipline knowledge: Acquiring knowledge on basics of Computer Science

and ability to apply to design principles in the development of solutions for
problems of varying complexity
2. Problem Solving: Improved reasoning with strong mathematical ability to

Identify, formulate and analyse problems related to computer science and
exhibiting a sound knowledge on data structures and algorithms.

3. Design and Development of Solutions: Ability to design and development of
algorithmic solutions to real world problems and acquiring a minimum

knowledge on statistics and optimization problems. Establishing excellent skills
in applying various design strategies for solving complex problems.

4. Programming a Computer: Exhibiting strong skills required to program a
computer for various issues and problems of day-to-day applications with

thorough knowledge on programming languages of various levels.
5. Application Systems Knowledge: Possessing a sound knowledge on computer

application software and ability to design and develop app for applicative
problems.
6. Modern Tool Usage: Identify, select and use a modern scientific and IT tool or
technique for modelling, prediction, data analysis and solving problems in the
area of Computer Science and making them mobile based application software.
7. Communication: Must have a reasonably good communication knowledge

both in oral and writing.
8. Project Management: Practicing of existing projects and becoming

independent to launch own project by identifying a gap in solutions.
9. Ethics on Profession, Environment and Society: Exhibiting professional ethics

to maintain the integrality in a working environment and also have concern on
societal impacts due to computer-based solutions for problems.
Page 6 of 43
10. Lifelong Learning: Should become an independent learner. So, learn to learn
ability.
11. Motivation to take up Higher Studies: Inspiration to continue educations
towards advanced studies on Computer Science.
By the end of the program the students will be able to:
The Bachelor of Computer Application (BCA (Hons)) program enables students to
attain following additional attributes besides the afore-mentioned attributes, by the

time of graduation:
1. Apply standard Software Engineering practices and strategies in real -time

software projectdevelopment
2. Design and develop computer programs/computer -based systems in the areas
related to AI, algorithms, networking, web design, cloud computing, IoT and
data analytics.
3. Acquaint with the contemporary trends in industrial/research settings and
thereby innovate novel solutions to existingproblems
4. The ability to apply the knowledge and understanding noted above to the
analysis of a given information handlingproblem.
5. The ability to work independently on a substantial software project and as an
effective teammember.
Page 7 of 43
PROGRAM STRUCTURE
Proposed Curricular and Credits Structure under Choice Based Credit System [CBCS] of BCA with Discipline Scheme for the Four Years Computer Application BCA
Undergraduate Honors Programmewith effect from 2021-22
SEMESTER-1
Teaching Duration
Marks
Category Course code Title of the Paper hours/week Credit of exams
IA SEE Total L T P (Hrs)
21BCA1L1LK1 Kannada
L-1 40 60 100 4 0 0 3 2
21BCA1L1LFK1 Functional Kannada
21BCA1L2LEN2 English
21BCA1L2LHI2 Hindi
L-2 21BCA1L2LSN2 Sanskrit 40 60 100 4 0 0 3 2
21BCA1L2LTE2 Telugu
21BCA1L2LUR2 Urdu
21BCA1C1L Programming in C 40 60 100 3 0 0 3 2
DSC1
21BCA1C1P C Programming Lab 25 25 50 0 0 3 2 3
21BCA1C2L Fundamentals of Computers 40 60 100 3 0 0 3 2
DSC2
21BCA1C2P Information Technology Lab 25 25 50 0 0 3 2 3
21BCA1C3LMF Mathematical Foundation*
DSC3 40 60 100 3 0 0 3 2
21BCA1C3LAC Accountancy*
OEC1 21BCA1O1CPL C Programming Concepts 40 60 100 3 0 0 3 2
SEC1 21BCA1S1FD Digital Fluency 25 25 50 1 0 2 2 2
VBC1 21BCA1V1PE1 Physical Education - Yoga 25 - 25 - - 2 1 -
VBC2 21BCA1V2HW Health & Wellness 25 - 25 - - 2 1 -
Semester
Total Marks 800 26
Credits
Page 8 of 43
SEMESTER-2
Teaching Duration
Marks
21BCA2L3LK2 Kannada
L-3 40 60 100 4 0 0 3 2
21BCA2L3FKL2 Functional Kannada
21BCA2L4EN2 English
21BCA2L4HI2 Hindi
L-4 21BCA2L4SN2 Sanskrit 40 60 100 4 0 0 3 2
21BSC2L4TE2 Telugu
21BCA2L4UR2 Urdu
21BCA2C4L Data Structures using C 40 60 100 3 0 0 3 2
DSC4
21BCA2C4P Data Structures Lab 25 25 50 0 0 3 2 3
Object Oriented Concepts using
21BCA2C5L 40 60 100 3 0 0 3 2
DSC5 Java
21BCA2C5P JAVA Lab 25 25 50 0 0 3 2 3
DSC6 21BCA2C6L Discrete Mathematics 40 60 100 3 0 0 3 2
OEC2 21BCA2O2MPL Web Designing 40 60 100 3 0 0 3 2
AECC1 21BCA2AE1L Environmental Studies 20 30 50 1 0 2 2 2
VBC3 21BCA2V3PE2 Physical Education – Sports 25 - 25 - - 2 1 -
VBC4 21BCA2V4NC1 NCC/NSS/R&R(S&G) / Cultural 25 - 25 - - 2 1 -
Total Marks 800 Sem Credits 26
Exit option with Certificate in Computer Applications (with the completion of courses I year
1600 52
equivalent to a minimum of 48 credits) Credits
Page 9 of 43
SEMESTER-3
Teaching Duration
Marks
21BCA3L5LK3 Kannada
L-5 40 60 100 4 0 0 3 2
21BCA3L6EN3 English
21BCA3L6HI3 Hindi
21BSC3L6TE3 Telugu
21BCA3L6UR3 Urdu
21BCA3C7L Database Management System 40 60 100 3 0 0 3 2
DSC7
21BCA3C7P DBMS Lab 25 25 50 0 0 3 2 3
21BCA3C8L C# and .Net Framework 40 60 100 3 0 0 3 2
DSC8
21BCA3C8P C# and .Net Framework Lab 25 25 50 0 0 3 2 3
Computer Communication and
DSC9 21BCA3C9L 40 60 100 3 0 0 3 2
Networks
OEC3 21BCA3O3RPL E-Commerce 40 60 100 3 0 0 3 2
SEC2 21BCA3SE2AI Artificial Intelligence 25 25 50 1 0 2 2 2
Semester
Total Marks 800 26
Credits
Page 10 of 43
SEMESTER-4
Teaching Duration
Marks
21BCA4L7LK4 Kannada
L-7 40 60 100 4 0 0 3 2
21BCA4L8EN4 English
21BCA4L8HI4 Hindi
21BSC4L8TE4 Telugu
21BCA4L8UR4 Urdu
21BCA4C10L Python Programming 40 60 100 3 0 0 3 2
DSC10
21BCA4C10P Python Programming Lab 25 25 50 0 0 3 2 3
21BCA4C11L Multimedia & Animation 40 60 100 3 0 0 3 2
DSC11
21BCA4C11P Multimedia & Animation Lab 25 25 50 0 0 3 2 3
DSC12 21BCA4C12L Operating System Concepts 40 60 100 3 0 0 3 2
OEC4 21BCA4O4ECL Multimedia & Animation 40 60 100 3 0 0 3 2
AECC2 21BCA4AE2CIL Constitution of India 20 30 50 1 0 2 2 2
Semester
Total Marks 800 26
Credits
Exit option with Diploma in Computer Applications (with the completion of courses equivalent II year
3200 104
to a minimum of 96 credits) Credits
Page 11 of 43
SEMESTER-5
Teaching Duration
Marks
21BCA5C13L Internet Technologies 40 60 100 3 0 0 3 2
DSC13
21BCA5C13P Internet Technology Laboratory 25 25 50 0 0 3 2 3
Statistical Computing and R
21BCA5C14L 40 60 100 3 0 0 3 2
DSC14 Programming
21BCA5C14P R Programming Lab 25 25 50 0 0 3 2 3
DSC15 21BCA5C15L Software Engineering 40 60 100 3 0 0 3 2
21BCA5DE1AL Information Security & Cryptography
DSE1 21BCA5DE1BL Cloud Computing 40 60 100 3 0 0 3 2
21BCA5DE1CL Business Intelligence
21BCA5VC1AL Unix & Shell Programming
VC1 40 60 100 3 0 0 3 2
21BCA5VC1BL Web Content Management
SEC3 21BCA5SE3L Cyber Security 25 25 50 1 0 2 2 2
Semester
Total Marks 700 23
Credits
Page 12 of 43
SEMESTER-6
Teaching Duration
Marks
21BCA6C16L PHP and MySQL 40 60 100 3 0 0 3 2
DSC16
21BCA6C16P PHP and MySQL LAB 25 25 50 0 0 3 2 3
DSC17 21BCA6C17L Artificial Intelligence and Applications 40 60 100 3 0 0 3 2
DSC18 21BCA6C18P Project Work 50 100 150 0 0 10 5 3
INT 21BCA6INT1 Internship 50 - 50 - 2 -
21BCA6DE2AL Fundamentals of Data Science
DSE2 21BCA6DE2BL Mobile Application Development 40 60 100 3 0 0 3 2
21BCA6DE2CL Embedded Systems
21BCA6VC2AL Health Care Technologies
VC2 40 60 100 3 0 0 3 2
21BCA6VC2BL Digital Marketing
SEC4 21BCA6SE4L Professional Communication 25 25 50 1 0 2 2 2
Semester
Total Marks 750 25
Credits
Total Credits
Exit Option with Bachelor of Computer Applications Degree, BCA Degree (with completion of
4650 for BCA 152
courses equivalent to a minimum of 140 credits)
Program
Page 13 of 43
Concept Note, Abbreviation Explanation and Coding:
Concept Note:
1. CBCS is a mode of learning in higher education which facilitates a student to have some freedom in selecting his/her own
choices, across various disciplines for completing a UG/PG program.
2. A credit is a unit of study of a fixed duration. For the purpose of computation of workload as per UGC norms the following is
mechanism be adopted in the university:
One credit (01) = One Theory Lecture (L) period of one (1) hour.
One credit (01) = One Tutorial (T) period of one (1) hour.
One credit (01) = One practical (P) period of two (2) hours.
3. Course: paper/subject associated with AECC, DSC, DSEC, SEC, VBC, OEC, VC, IC, MIL.
4. Wherever there is a practical there will be no tutorial and vice-versa

5. Vocational course is a course that enables individual to acquire skills set that are required for a particular job.
6. Internship is a designated activity that carries some credits involving more than 25 days of working in an organization (either
in same organization or outside) under the guidance of an identified mentor. Internship shall be an integral part of the
curriculum.
7. OEC: For non- Computer Science students. Computer Science students have to opt for OEC from departments other than
their disciplines
Abbreviation Explanations:
1. AECC: Ability Enhancement Compulsory Course.

2. DSC: Discipline Specific Core Course.
3. DSEC: Discipline Specific Elective Course.
Page 14 of 43
4. SEC: Skill Enhancement Course.

5. VBC: Value Based Course.
6. OEC: Open/Generic Elective Course
7. VC: Vocational Course.

8. IC: Internship Course
9. L1: Language One

10. L2: MIL
11. L= Lecture; T= Tutorial; P=Practical.

12. MIL= Modern Indian Language; English or Hindi or Telugu or Sanskrit or Urdu
Program Coding:
1. Code 21: Year of Implementation
2. Code BCA: BCA Program under the faculty of Applied Science of the University
3. Code 1: First Semester of the Program, (2 to 6 represent higher semesters)
4. Code A: AECC, (C for DSC, S for SEC, V for VBC and O for OEC)
5. Code 1: First “AECC” Course in semester, similarly in remaining semester for such other courses
6. Code LK: Language Kannada, FK for Functional Kannada, similarly Language English, Language Hindi, Language Sanskrit,
&Language Urdu
7. Code 1: Course in that semester.
Page 15 of 43
COURSE-WISE SYLLABUS
Semester I
Year I Course Code: 21BCA1C2L Credits 03
Sem. I Hours 40
Course Title: Fundamentals of Computers
Course Pre- NA
requisites, if
any:
Formative Summative Assessment Marks: 60 Duration of
Assessment ESA: 02 hrs.
Marks: 40
Course At the end of the course the student should be able to:
Outcomes 1. Create an awareness of computers its classification and anatomy
2. Understand Number systems , Computer Languages and the steps
for problem solving
3. Understand the fundamentals of operating systems and basic
commands
4. Understand basic concepts of DBMS and Internet
Unit No. Course Content Hours
Fundamentals of Computers: Introduction to 10
Computers - Computer Definition, Characteristics of
Computers, Evolution and Generations of
Computers, Basic Organisation of a Digital Computer;
Functions & Components of a Computer, Central
Unit I
Processing Unit, Microprocessor, Storage units, Input
and output Devices. How CPU and memory
works.Classification of Digital Computer Systems:
Microcomputers, Minicomputers, Mainframes, Super
computers
Number Systems – different types, conversion from 10
one number system to another; Computer Codes –
BCD, Gray Code, ASCII; Boolean Algebra – Boolean
Operators with Truth Tables; Computer Languages -
Unit II
Machine Level, Assembly Level & High Level
Languages, Translator Programs – Assembler,
Interpreter and Compiler; Planning a Computer
Program – Algorithm and Flowchart with Examples.
Operating System Fundamentals: Operating 10
Systems: Introduction, Functions of an operating
Unit III
System, Classification of Operating Systems, System
programs, Application programs, Utilities, The Unix
Page 16 of 43
Operating System, Basic Commands (cal, date, bc,

echo, who, ls, pwd, cd, mkdir, rmdir), Commands to
work with file (cat, cp, rm, mv, file, wc, head, tail)
Introduction to Database Management Systems: 10
Database, DBMS, Why Database -File system vs
DBMS, Database applications, Database users,
Introduction to SQL, Classification of SQL-DDL, DML,
Unit IV DCLInternet Basics: Introduction, Features of
Internet, Internet application, Services of Internet,
Logical and physical addresses, Internet Service
Providers, Domain Name System.Web Basics:
Introduction to web, web browsers, http/https, URL.
Print 1. Pradeep K. Sinha and PritiSinha: Computer Fundamentals
Resources (Sixth Edition), BPB Publication
2. David Riley and Kenny Hunt, Computational thinking for
modern solver, Chapman &Hall/CRC,
3. J. Glenn Brook shear,” Computer Science: An Overview”,
Addision-Wesley, Twelth Edition,
4. R.G. Dromey, “How to solve it by Computer”, PHI,
Page 17 of 43
Year I Course Code: 21BCA1C2P Credits 02

Sem. I Hours 40
Course Title: Information Technology
Lab
Course Pre- NA
requisites, if
any:
Formative Summative Assessment Marks: 25 Duration of ESA: 02hrs.
Assessment
Marks: 25
Part A: Hardware
1. Identification of the peripherals of a computer, components
in a CPU and their functions.
2. Assembling and disassembling the system hardware
components of personal computer.
3. Basic Computer Hardware Trouble shooting.
5. LAN and WiFi Basics.
6. Operating System Installation – Windows OS, UNIX/LINUX,
Dual Booting.
7. Installation and Uninstallation of Software – Office Tools,
Utility Software (like Anti-Virus, System Maintenance tools);
Application Software - Like Photo/Image Editors, Audio
Recorders/Editors, Video Editors …); Freeware, Shareware,
Payware and Trialware; Internet Browsers, Programming
IDEs,
8. System Configuration – BIOS Settings, Registry Editor, MS
Config, Task Manager, System Maintenance, Third-party
System Maintenance Tools (Similar to CCleaner and Jv16
PowerTools)
Part B: Software
1. Activities using Word Processor Software
2. Activities using Spreadsheets Software
3. Activities using Presentation Software
4. Activities involving Multimedia Editing (Images, Video,
Audio)
5. Tasks involving Internet Browsing
6. Flow charts: Installation and using of flowgarithms software
for different arithmetic tasks like sum, average, product,
difference, quotient and remainder of given numbers,
calculate area of Shapes (Square, Rectangle, Circle and
Triangle), arrays and recursion.
Page 18 of 43
Note: Use any open source software to execute the above

assignments.
Reference:
1. Computational Thinking for the Modern Problem Solver, By Riley DD, Hunt K.A
CRC press, 2014
2. Ferragina P, Luccio F. Computational Thinking: First Algorithms, Then Code.
Springer
Web References:
http://www.flowgorithm.org/documentation/
Evaluation Scheme for Information Technology Lab Examination
Assessment Criteria Marks

Activity – 1 from Write up on the 3
Part A activity/ task
Demonstration of 07
the activity/ task
Activity-2 from Write up on the 3
Part B activity/ task
Demonstration of 07
the activity/ task
Viva Voice based on Lab Activities 05
Total 25
Page 19 of 43
Year I Course Code:21BCA1C1L Credits 03

Sem. I Hours 40
Course Title: Programming in C
Course Pre- NA
requisites, if
any
Formative Summative Assessment Marks: 60 Duration of ESA: 02
Assessment hrs.
Marks: 40
Outcomes 1. Read, understand and trace the execution of programs written in
C language
2. Apply programming control structures for a given problem to
create C code
3. Understand derived datatypes and develop C code using arrays/
strings
4. Understand user defined functions and datatypes to develop C
code
Introduction to C Programming: Overview of C; History 10
and Features of C; Structure of a C Program with
Examples; Creating and Executing a C Program;
Compilation process in C.C Programming Basic
Concepts: C Character Set; C tokens - keywords,
identifiers, constants, and variables; Data types;
Unit I Declaration & initialization of variables; Symbolic
constants.Input and output with C: Formatted I/O
functions - printf and scanf, control stings and escape
sequences, output specifications with printf functions;
Unformatted I/O functions to read and display single
character and a string - getchar, putchar, gets and puts
functions.
C Operators & Expressions: Arithmetic operators; 10
Relational operators; Logical operators; Assignment
operators; Increment & Decrement operators; Bitwise
operators; Conditional operator; Special operators;
Operator Precedence and Associatively; Evaluation of
Unit II arithmetic expressions; Type conversion.Control
Structures: Decision making Statements - Simple if,
if_else, nested if_else, else_if ladder, Switch Case, goto,
break & continue statements; Looping.
Statements - Entry controlled and exit controlled
statements, while, do-while, for loops, Nested loops.
Page 20 of 43
Derived data types in C: Arrays: One Dimensional arrays 08

- Declaration, Initialization and Memory representation;
Two Dimensional arrays - Declaration, Initialization and
Unit III Memory representation.Strings: Declaring & Initializing
string variables; String handling functions - strlen, strcmp,
strcpy and strcat; Character handling functions - toascii,
toupper, tolower, isalpha, isnumeric etc.
User Defined Functions: Need for user defined 12
functions; Format of C user defined functions;
Components of user defined functions - return type,
name, parameter list, function body, return statement and
function call; Categories of user defined functions - With
and without parameters and return type.User defined
Unit IV
data types: Structures - Structure Definition, Advantages
of Structure, declaring structure variables, accessing
structure members, Structure members initialization,
comparing structure variables, Array of Structures; Unions
- Union definition; difference between Structures and
Unions.
Recommended Learning Resources
Print 1. C: The Complete Reference, By Herbert Schildt.
Resources 2. C Programming Language, By Brain W. Kernighan
3. Kernighan & Ritchie: The C Programming Language (PHI)
4. P. K. Sinha&PritiSinha: Computer Fundamentals (BPB)
5. E. Balaguruswamy: Programming in ANSI C(TMH)
6. Kamthane: Programming with ANSI and TURBO C (Pearson
Education)
7. V. Rajaraman: Programming in C (PHI –EEE)
8. S. Byron Gottfried: Programming with C(TMH)
9. YashwantKanitkar: Let us C
10. P.B. Kottur: Programming in C (Sapna Book House)
Page 21 of 43

Sem. I Hours 40
Course Title: Lab: C Programming
Course Pre- NA
requisites, if any:
Formative Summative Assessment Marks: 25 Duration of ESA: 02 hrs.
Assessment
Marks: 25
Part A:
1. Program to read radius of a circle and to find area and
circumference
2. Program to read three numbers and find the biggest of
three
3. Program to demonstrate library functions in math.h
4. Program to generate the factorial of a given number
5. Program to generate n fibonacii sequence
6. Program to read a number, find the sum of the digits,
reverse the number and check it for palindrome
7. Program to read numbers from keyboard continuously
till the user presses 999 and to find the sum of only
positive numbers
8. Program to read percentage of marks and to display
appropriate message (demonstration of switch Case
statement)
9. Program to find the roots of quadratic equation
(Demonstration of else-if ladder)
10. Program to read marks scored by a students and find
the average of marks
11. Program to remove Duplicate Element in a single
dimensional Array
Part B:
1. Program to Swap Two Numbers
2. Program to read a string and to find the number of
alphabets, digits, vowels, consonants, spaces and special
characters.
3. Program to Reverse a string without using built in
function
4. Program to find the length of a string without using built
in function
5. Program to demonstrate string functions.
6. Program to read, display and to find the trace of a
square matrix
Page 22 of 43
7. Program to perform addition and subtraction of

Matrices
8. Program to read, display and multiply two m x n
matrices using functions
9. Program to check a number for prime by defining
isprime( ) function
10. Program to demonstrate student structure to read &
display records of n students.
11. Program to demonstrate the difference between
structure & union.
Note: Student has to execute a minimum of 10 programs in each part to complete
the Lab course
Evaluation Scheme for Lab Examination

Program – 1 from Part A Writing the Program 03
Execution and Formatting 07
Program -2 from Part B Writing the Program 03
Viva Voice 05
Total 25
Page 23 of 43
Year I Course Code: 21BCA1C3LMF Credits 03

Sem. I Hours 40
Course Title: Mathematical
Foundation
Course Pre- NA
requisites, if any
Formative Summative Assessment Duration of ESA: 02 hrs.
Assessment Marks:: 60
Marks: 40
Outcomes 1. Study and solve problems related to connectives,
predicates and quantifiers under different situations.
2. Develop basic knowledge of matrices and to solve equations
using Cramer‟srule.
3. Know the concept of Eigenvalues.
4. To develop the knowledge about derivatives and
know various applications of differentiation.
5. Understand the basic concepts of Mathematical reasoning, set
and functions
Basic concepts of set theory: Mathematical 10
logic introduction statementsConnectives-
negation, Conjunction, disjunctionstatement
Unit I formulas and truth tables- conditional and bi
Conditional statements- tautology
contradiction- equivalence of formulas-duality
law-Predicates and Quantifiers, Arguments.
Operations on sets: power set- Venn diagram 10
Unit II Cartesian product-relations - functions- types of
functions - composition of functions.
Matrix algebra: Introduction-Types of matrices- 12
matrix operations- transpose of a matrix -
determinant of matrix - inverse of a matrix-
Unit III
Cramer‟s rule. Matrix: finding rank of a matrix -
normal form-echelon form Cayley Hamilton
theorem-Eigen values
Differential calculus: Functions and limits - 08
Simple Differentiation of Algebraic Functions –
Unit IV
Evaluation of First and Second Order Derivatives
– Maxima and Minima
Page 24 of 43
Print Resources 1. P. R. Vittal-Business Mathematics and Statistics, Margham

Publications, Chennai
B. S. Vatsa-Discrete Mathematics –New Age International Limited
Publishers, New Delhi
Page 25 of 43
Year I Course Code: 21BCA1C3LAC Credits 03

Sem. I Hours 40
Course Title: Accountancy
Course Pre- NA
requisites, if
any
Formative Summative Assessment Marks: 60 Duration of ESA: 02
Assessment hrs.
Marks: 40
Outcomes
1. Study and understand Accounting, systems of Book, Branches of
accounting advantage and limitations
2. Know the concept of accounting, financial accounting process and
Journalization
3. Maintenance different account book and reconciliations
4. Preparations of different bills, and trial balance.
Introduction: History and Development of Accounting, 08
Meaning, Objectives and functions of Accounting, Book
Unit I keeping V/s Accounting, Users of accounting data, systems of
book keeping and accounting, branches of accounting,
advantages and limitations of accounting
Accounting Concepts and Convention: Meaning, need and 10
classification, accounting standards meaning, need and
classification of Indian accounting standards. Accounting
Unit II principles V/s accounting standard.Financial Accounting
Process: Classification of accounting transactions and
accounts, rules of debit and credit as per Double Entry
System. Journalization and Ledger posting.
Preparation of Different Subsidiary Books: Purchase Day 10
book Sales Day Book, Purchase Returns Day Book, Sales
Unit III Returns Day Book, Cash Book. Bank Reconciliation Statement:
Meaning, Causes of Difference, Advantages, Preparation of
Bank Reconciliation Statements.
Account Procedure: Honor of the Bill, Dishonor of the Dill, 12
Endorsement, Discounting, Renewal, Bill for collection,
Retirement of the Bill, Accommodation Bills, Bill Receivable
Book and Payable Book. Preparation of Trial Balance:
Unit IV
Rectification of errors and Journal Proper.Preparation of
Final Accounts: Meaning, need and classification, Preparation
of Manufacturing, Trading, Profit and loss account and
Balance – Sheet of sale- traders and partnership firms.
Page 26 of 43
Print Reference Books:

Resources 1. S. Ramesh, B.S. Chandrashekar, A Text Book of
Accountancy.
2. V.A. Patil and J.S. Korlahalli, Book – keeping and accounting,
(R. Chand and Co.Delhi).
3. R.S.Singhal, Principles of
Accountancy,(NageenPrakashpvt.Lit.Meerut).
4. M.B.Kadkol, Book–Keeping and Accountancy,
(RenukaPrakashan, Hubil)
5. Vithal, Sharma: Accounting for Management, Macmillan
Publishers, Mumbai.
6. B B.S. Raman, Accountancy, (United Publishers, Mangalore).
7. Tulsian, Accounting and Financial Management – I:Financial
Accounting – Person Education
Page 27 of 43
OPEN-ELECTIVE SYLLABUS :
Year I Course Code: 21BCA1O1CPL Credits 03
Course Title: C programming Concepts
Sem. Hours 40
Course Pre- NA
requisites, if
any
Assessment ESA:..32hrs.
Marks: 40
Outcomes 1. Read, understand and trace the execution of programs written in
C language
2. Apply programming control structures for a given problem to
create C code
3. Understand derived datyes and develop C code using arrays/
strings
4. Understand user defined functions and datatypes to
develop C code
Introduction to C Programming: Overview of C; 10
History and Features of C; Structure of a C Program
with Examples; Creating and Executing a C Program;
Compilation process in C. C Programming Basic
Concepts: C Character Set; C tokens - keywords,
identifiers, constants, and variables; Data types;
Unit I Declaration & initialization of variables; Symbolic
constants. Input and output with C: Formatted I/O
functions - printfandscanf, control stings and escape
sequences, output specifications with
printffunctions; Unformatted I/O functions to read
and display single character and a string - getchar,
putchar, gets and puts functions C
Operators & Expressions: Arithmetic operators; 10
Relational operators; Logical operators; Assignment
operators; Increment & Decrement operators; Bitwise
operators; Conditional operator; Special operators;
Operator Precedence and Associatively; Evaluation of
Unit II
arithmetic expressions; Type conversion. Control
Structures: Decision making Statements - Simple if,
if_else, nested if_else, else_if ladder, Switch Case,
goto, break &continue statements;Looping
Statements - Entry controlled and exit controlled
Page 28 of 43
statements, while, do-while, for loops, Nested loops.
10
Derived data types in C: Arrays: One Dimensional
arrays - Declaration, Initialization and Memory
representation; Two Dimensional arrays -
Declaration, Initialization and Memory
Unit III representation.Strings: Declaring & Initializing
string variables; String handling functions - strlen,
strcmp, strcpy and strcat; Character handling
functions - toascii, toupper, tolower, isalpha,
isnumericetc
10
User Defined Functions: Need for user defined
functions; Format of C user defined functions;
Components of user defined functions - return type,
Unit IV name, parameter list, function body, return
statement and function call; Categories of user
defined functions - With and without parameters
and return type.
Recommended Leaning Resources

Resources 1. C: The Complete Reference, By HerbertSchildt.
2. C Programming Language, By Brain W.Kernighan
3. Kernighan & Ritchie: The C Programming Language(PHI)
4. E. Balaguruswamy: Programming in ANSI C(TMH)
5. Kamthane: Programming with ANSI and TURBO C
(PearsonEducation)
6. V. Rajaraman: Programming in C (PHI –EEE)
7. S. Byron Gottfried: Programming with C(TMH)
8. YashwantKanitkar: Let usC
9. P.B. Kottur: Programming in C (SapnaBookHouse)
Page 29 of 43
Semester II
Sem. II Hours 40
Course Title:Data Structures using C
Course Pre- Knowledge of Programming
requisites, if
any
Marks: 40
Outcomes
1. Understand the classification of data structures and dynamic
memory allocation
2. Understand the difference between iteration and recursion and
apply recursive definition for problem solving
3. Understand and evaluate the applications of stacks and queues
4. Understand and evaluate the applications of linked
lists and tree
Introduction to data structures: Definition; Types of 08
data structures - Primitive & Non-primitive, Linear
and Non-linear; Operations on data structures.
Dynamic memory allocation: Static & Dynamic
memory allocation; Memory allocation and de-
Unit I allocation functions - malloc, calloc, realloc and
free.Pointers in C: Understanding pointers -
Declaring and initializing pointers, accessing address
and value of variables using pointers; Pointers and
Arrays; Pointer Arithmetic; Advantages and
disadvantages of using pointers;
Recursion: Definition; Types of recursions; Recursion 10
Technique Examples - GCD, Binomial coefficient nCr,
Towers of Hanoi; Comparison between iterative and
recursive functions.Sorting and Searching: Arrays as
abstract data types, Representation of linear arrays in
Unit II
memory, Traversing linear arrays; Inserting and
deleting elements; Sorting – Selection sort, Bubble
sort, Quick sort, Selection sort, Insertion sort;
Searching - Sequential Search, Binary search; Iterative
and Recursive searching
Page 30 of 43
Stacks: Basic Concepts – Definition and 10

Representation of stacks; Operations on stacks –
Push, Pop; Applications of stacks; Infix, postfix and
prefix notations; Conversion from infix to postfix
using stack; Evaluation of postfix expression using
Unit III
stack; Application of stack in function calls.Queues:
Basic Concepts – Definition and Representation of
queues; Types of queues, - Simple queues, Circular
queues, Double ended queues, Priority queues;
Operations on Simple queues;
Linked list: Basic Concepts – Definition and 12
Representation of linked list, Types of linked lists -
Singly linked list, Doubly linked list, Circular linked list
Doubly Circular Linked list; Representation of Linked
list in Memory;Operations on Singly linked lists –
Traversing, Searching, Insertion, Deletion;Trees:
Definition; Tree terminologies –node, root node,
Unit IV parent node, ancestors of a node, siblings, terminal &
non-terminal nodes, degree of a node, level, edge,
path, depth;
Binary tree: Type of binary trees - strict binary tree,
complete binary tree, binary search tree and heap
tree; Array representation of binary tree. Traversal of
binary tree; preorder, in order and post order
traversal.
Print 1. Ellis Horowitz and SartajSahni: Fundamentals of Data

Resources Structures
2. Tanenbaum: Data structures using C (Pearson Education)
3. Kamathane: Introduction to Data structures (Pearson
Education)
4. Y. Kanitkar: Data Structures Using C(BPB)
5. Kottur: Data Structure Using C
6. Padma Reddy: Data Structure Using C
Page 31 of 43

Sem. II Hours 40
Course Title: Lab: Data
Structures
Course Pre-requisites, Knowledge of Programming
if any:
Formative Assessment Summative Assessment Marks: Duration of ESA: 02 hrs.
Marks: 25 25
Part A:
1. Program to find GCD using recursive function
2. Program to generate binomial coefficient using recursive
function.
3. Program to generate n Fibonacci numbers using
recursive function.
4. Program to implement Towers of Hanoi using recursion.
5. Program to implement dynamic array, find smallest and
largest element of the array.
6. Program to read the names of cities and arrange them
alphabetically.
7. Program to sort the given list using selection sort
technique.
8. Program to sort the given list using bubble sort
technique.
9. Program to sort the given list using insertion sort
technique.
Part B:
1. Program to sort the given list using quick sort technique.
2. Program to sort the given list using merge sort
technique.
3. Program to search an element using linear search
technique.
4. Program to search an element using binary search
technique.
5. Program to implement Stack.
6. Program to convert an infix expression to postfix.
7. Program to implement simple queue.
8. Program to implement linear linked list.
9. Program to display in-order traversal of a binary tree.
Page 32 of 43

Sem. II Hours 40
Course Title: Object Oriented Programming with
JAVA
requisites, if
any
Marks: 30
Outcomes 1. Understand the features of Java and the architecture of JVM
2. Write, compile, and execute Java programs that may include
basic data types and control flow constructs and how type
casting is done
3. Identify classes, objects, members of a class and relationships
among them needed for a specific problem and demonstrate
the concepts of polymorphism and inheritance
4. The students will be able to demonstrate programs based on
interfaces and threads and explain the benefits of JAVA‟s
Exceptional handling mechanism compared to other
Programming Language
5. Write, compile, execute Java programs that include GUIs and
event driven programming and also programs based on files
Introduction to Java: OOPs concepts, Basics of Java 12
programming, Data types, Variables, Operators,
Control structures including selection, Looping,
Arrays in java. Objects and Classes: Basics of objects
Unit I
and classes in java, Methods and objects,Instance of
operator, Visibility modifiers, Method Overloading,
Constructors, Static Members, Inbuilt classes like
String, Character, String Buffer, this reference.
Inheritance and Polymorphism: Inheritance in java, 08
Super and sub class, Types of inheritance, Overriding,
Unit II Polymorphism, Dynamic binding, Abstract class,
Interface in java, Packages in java - defining and
importing user defined packages.
Event and GUI programming: Event handling in 10
Unit III java, Event types, Mouse and key events, GUI Basics,
Panels, Frames, Layout Managers: Flow Layout,
Page 33 of 43
Border Layout, Grid Layout, GUI components like

Buttons, Check Boxes, Radio Buttons, Labels,
TextFields, Text Areas, Combo Boxes, Lists, Windows,
Menus.
Multithreading in java: Thread life cycle and 10
methods, Runnable interface, Thread priorities,
Exception handling mechanism with try catch-finally,
Unit IV
Introduction to JavaBeans.I/O programming: Java
Input Output: Java IO package, File, Byte/Character
Stream, File reader / writer

Resources 1. Java, By E Balagurusamy – A Primer, Fourth Edition, Tata
McGraw Hill Education Private Limited.
2. Core Java Volume I – Fundamentals, By Cay S. Horstmann,
PrenticeHall
3. Object Oriented Programming with Java : Somashekara, M.T.,
Guru, D.S., Manjunatha,K.S
4. Java 2 - The Complete Reference – McGraw Hillpublication.
5. Java - The Complete Reference, 7th Edition, By Herbert
Schildt– McGraw Hill publication.
Page 34 of 43

Sem. II Hours 40
Course Title: Lab: JAVA
requisites, if
any:
Formative Summative Assessment Marks: 25 Duration of ESA: 02 hrs.
Assessment
Marks: 25
Practice Labs
1. Program to print the following triangle of numbers
1
12
123
1234
12345
2. Program to simple java application, to print the message,
“Welcome to java”
3. Program to display the month of a year. Months of the year
should be held in an array.
4. Program to find the area of rectangle.
5. program to demonstrate a division by zero exception
6. Program to create a user defined exception say Pay Out of
Bounds.
Part A: Programming Lab – Java Fundamentals – OOPS in

JAVA
1. Program to assign two integer values to X and Y. Using the „if‟
statement the output of the program should display a
message whether X is greater than Y.
2. Program to list the factorial of the numbers 1 to 10. To
calculate the factorial value, use while loop. (Hint: Fact of 4 =
4*3*2*1)
3. Program to find the area and circumference of the circle by
accepting the radius from the user.
4. Program to add two integers and two float numbers. When
no arguments are supplied, give a default value to calculate
the sum. Use function overloading.
5. Program to perform mathematical operations. Create a class
called AddSub with methods to add and subtract. Create
another class called MulDiv that extends from AddSub class
Page 35 of 43
to use the member data of the super class. MulDiv should

have methods to multiply and divide A main function should
access the methods and perform the mathematical
operations.
6. Program with class variable that is available for all instances
of a class. Use static variable declaration. Observe the
changes that occur in the object‟s member variable values.
7. Program to create a student class with following attributes;
Enrollment No: Name, Mark of sub1, Mark of sub2, mark of
sub3, Total Marks. Total of the three marks must be
calculated only when the student passes in all three subjects.
The passing mark for each subject is 50. If a candidate fails in
any one of the subjects his total mark must be declared as
zero. Using this condition write a constructor for this class.
Write separate functions for accepting and displaying student
details. In the main method create an array of three student
objects and display the details.
8. Write a program to demonstrate multiple inheritance and use
of Implementing Interfaces
9. Illustrate creation of thread by
a) Extending Thread class. b) Implementing Runnable
Interfaces
10. Write a program to demonstrate multiple inheritance and
use of iimplementing Interfaces.
11. Create a package „BCA‟ in your current working directory.
a. Create a class student in the above package with the
following attributes: Name, age, gender. Include appropriate
constructor and a method for displaying the details.
b. Import above package and access the member variables
and function contained in a package.
PART B: Exception Handling & GUI Programming
1. Program to catch Negative Array Size Exception. This
exception is caused when the array size is initialized to
negative values.
2. Program to demonstrate exception handling with try, catch
and finally.
3. Program which create and displays a message on the window
4. Program to draw several shapes in the created window
5. Programto create a 4×4 grid and fills it in with 15 buttons,
each
1. labeled with its index.
Page 36 of 43
6. Program which creates a frame with two buttons father and

mother. When we click the father button the name of the
father, his age and designation must appear. When we click
mother button similar details of mother also appear.
7. Create a frame which displays your personal details with
respect to a button click
8. Program to create a window with TextFields and Buttons. The
"ADD" button adds the two integers and display the result.
The "CLEAR" button shall clear all the text fields.
9. Program to create a window, when we press M or m, the
window displays “good morning”, A or a, the window
display‟s Good Afternoon” , E or e, the window displays
“good morning”, N or n, the window displays “good
morning”
10. Demonstrate the various mouse handling events using
suitable example.
11. Program to create menu bar and pull-down menus.
Note: Student has to execute a minimum of 10 programs in each part to complete
the Lab course
Evaluation Scheme for Data Structures and Java Lab Examination

Program – 1 from Part A Writing the Program 03
Program -2 from Part B Writing the Program 03
Viva Voice 05
Total 25
Page 37 of 43

Sem. II Hours 40
Course Title: Discrete Mathematics
Course Pre- NA
requisites, if
any
Marks: 40
Course 1. At the end of the course the student should be able to:
Outcomes 2. To understand the basic concepts of Mathematical reasoning,
set and functions.
3. To understand various counting techniques and principle of
inclusion and exclusions.
4. Understand the concepts of various types of relations, partial
ordering and
5. Equivalence relations.
6. Apply the concepts of generating functions to solve the
recurrence relations.
7. Familiarize the fundamental concepts of graph theory and
shortest path algorithm
The Foundations: Logic and proofs: Propositional 10
Logic, Applications of Propositional Logic, Propositional
Equivalences, Predicates and Quantifiers, Nested
Quantifiers, Rules of Inference, Introduction to Proofs,
Unit I
Proof Methods and Strategy.Basic Structures: Sets,
Functions, Sequences, Sums, and Matrices: Sets, set
operations, Functions, Sequences and Summations,
matrices.
Counting: Basics of counting, Pigeonhole principle, 10
Permutation and combination, Binomial Coefficient and
Combination, Generating Permutation and
Combination.
Unit II Advanced Counting Techniques: Applications of
Recurrence Relations, Solving Linear Recurrence,
Relations, Divide and Conquer Algorithms and
Recurrence Relations, Generating functions, Inclusion-
Exclusion, Applications of Inclusion-exclusion.
Induction and Recursion: Mathematical Induction, 12
Unit III Strong Induction and Well- Ordering, Recursive
Definitions and Structural Induction, Recursive
Page 38 of 43
Algorithms, Program Corrections.

Relation: Properties of relation, Composition of
relation, Closer operation on relation, Equivalence
relation and partition. Operation on relation,
Representing relation.
Graphs: Graphs and Graph models, Graph Terminology 08
and Special Types of Graphs, Representing Graphs and
Unit IV Graph Isomorphism, Connectivity, Euler and Hamilton
Paths, Shortest-Path Problems, Planar Graphs, Graph
Coloring..

Resources 1. Discrete Mathematics and Its Applications, Kenneth H.
Rosen: Seventh Edition, 2012.
2. Discrete Mathematical Structure, Bernard Kolman, Robert C,
Busby, Sharon Ross, 2003.
3. Graph Theory with Applications to Engg and Comp. Sci:
Narsingh Deo-PHI1986.
4. Discrete and Combinatorial Mathematics Ralph P. Grimaldi,
B. V. Ramatta, Pearson, Education, 5Edition.
5. Discrete Mathematical Structures, Trembley and Manobar.
Page 39 of 43
Year I Course Code: 21BCA2O2MPL Credits 03

Course Title: Web Designing
Sem. Hours 40
Course Pre- NA
requisites, if
any
Assessment ESA:..02 hrs.
Marks: 40
Outcomes 1. Understand the History of Internet and web Designing tools
2. Understand Markup Languages and stylesheet
3. Implement Scripting
4. Appreciate website creation
Histroy of Internet, The World Wide Web, Web Browser, 10
Web Server, URL, Working of Web, Web Page, Types of
Web Pages, Web Content, Websites, Home Pages,
Unit I Building Website, Website building tools; Web graphics
design, basic tips for graphics design, to web
programming: what is web programming? , web
programming languages.
Introduction to XHTML- Basic Syntax, Standard 10
structure, Basic text markup, Images, Hypertext, Links,
Lists, Tables, Forms-
<form>,<input>,<label>,<select>,<textarea> tags
Unit II and action buttons(submit and reset).CSS-
Introduction, Levels of style sheets, Selector forms,
Property value forms, Font properties, List properties,
Color, Alignment of text, The box model, Background
images, The <span> and <div>tags.
JavaScript: Object orientation and JavaScript; General 10
syntactic characteristics; Primitives, operations, and
expressions; Screen output and keyboard input;
Unit III
Control statements; Object creation and modification;
Arrays; Functions; Constructor; Pattern matching using
regular expressions; Errorsin scripts; Examples.
Introduction to XML, Syntax of XML , XML document 10
structure, Displaying raw XML documents, Displaying
Unit IV
XML documents with CSS,XSLT Stylesheets and
Displaying XML documents with XSLT.
Page 40 of 43
Web Design: Concepts of effective web design, Web

design issues including Browser, Bandwidth and Cache,
Display resolution, Look and Feel of the Website, Page
Layout and linking, User centric design, Sitemap,
Planning and publishing website, Designing effective
navigation
Recommended Leaning Resources

Resources 1. Robert W. Sebestra, “Programming the World Wide Web”, 7th
Edition /4th edition Addison Wesley Publication,2013.
2. Developing Web Applications, Ralph Moseley and M. T.
Savaliya, Wiley-India
3. Web Technologies, Black Book, dreamtech Press
4. HTML 5, Black Book, dreamtech Press
5. Web Design, Joel Sklar, Cengage Learning
6. Developing Web Applications in PHP and AJAX, Harwani,
McGrawHill
7. Internet and World Wide Web How to program, P.J. Deitel&
H.M. Deitel, Pearson
Page 41 of 43
Question Paper Pattern:
RANI CHANNAMMA UNIVERSITY

Department of Computer Science
Bachelor of Computer Applications
Sub: Code: Maximum Marks: 60
a. Answer any Six Questions from Question 1 b. Answer any
Three each Questions from Question 2,3,4 and 5
Q.No.1. Answer any Six Questions ( Atlest Two question from 2X6=12
Each Unit)
a.
b.
c.
d,
e.
f.
g.
h.
Q.No.2. (Should cover Entire Unit-I ) 4X3=12
a.
b.
c.
d.
Q.No.3. (Should cover Entire Unit-II ) 4X3=12
a.
b.
c.
d.
Q.No.4. (Should cover Entire Unit-III ) 4X3=12
a.
b.
c.
d.
Q.No.5. (Should cover Entire Unit-IV) 4X3=12
a.
b.
c.
d.
Page 42 of 43
ASSESSMENT METHODS
Evaluation Scheme for Internal Assessment:
Theory:
Assessment Criteria 40 marks

1 Internal Assessment Test for30 marks 1 hr after 8 weeks and 2nd
st
30
Internal Assessment Test for 30 marks 1 hr after 15 weeks . Average
of two tests should be considered.
Assignment 10
Total 40

st
1 Internal Assessment Test for20 marks 1/2 hr after 8 weeks and 20
2nd Internal Assessment Test for 20 marks 1/2 hr after 15 weeks.
Average of two tests should be considered.
Assignment 05
Total 25
Practical:

Semester End Internal Assessment Test for 20 marks 2 hrs 20
Journal (Practical Record) 05
Total 25
Page 43 of 43

Bachelor of Computer Applications

Uploaded by

Copyright:

Available Formats

Bachelor of Computer Applications

Uploaded by

Document Information

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

Bachelor of Computer Applications

Uploaded by

Copyright:

Available Formats

RANI CHANNAMMA UNIVERSITY, BELAGAVI

PROGRAM /COURSE STRUCTURE AND SYLLABUS

Academic Year 2021-22 and onwards

Board of Studies (UG) Committee (NEP-Bachelor of Computer Applications)

Bachelor of Computer Applications (BCA) Programme 2021-22

1 Prof. Dayanand G Savakar, RCU, Belagavi Chairman

Smt. Asmitha S Deshpande, , Gogte Commerce College,

3 Shri. AnandPatil, DMSM Society, BCA College, Belagavi Co-Opt Member

Shri. Prasad Khode, SKE Society, GSS, BCA College,

Dr. Vijayalaxmi S Shigehalli Dr. Dayanad G Savakar

evolving discipline of computer application has strong connections to other

application domain.Computer science has a wide range of specialties. These include

Computer Architecture, Software Systems, Graphics, Artificial Intelligence,

Information Technology is growing rapidly. Increasing applications of computers in

rapid change in technology. Unlike other basic disciplines, developing core

Science & Engineering and in Information Technology were introduced in various

engineering manpower in IT industries.Parallelly, BCA, BSc and MSc programmes with

career paths. Students so graduated, can take up postgraduate programmes in CS or

pursue a teaching profession or can adopt a business management career.BCA and

BCA (Hons) aims at laying a strong foundation of computer application at an early

completion of BCA, graduating students can fetch employment directly in companies

Scientist, or AI/ML personnel.

indesign and development of course content, in method of imparting training, in

The emphasis in BCA courses, in outcome-based curriculum framework, help

 To develop an understanding and knowledge of the basic theory of Computer

and applications such as algorithms, data structures, data handling, data

 To acquire necessary and state-of-the-art skills to take up industry challenges.

 The ability to synthesize the acquired knowledge, understanding and experience

 To formulate, to model, to design solutions, procedure and to use software

1. Discipline knowledge: Acquiring knowledge on basics of Computer Science

problems of varying complexity

2. Problem Solving: Improved reasoning with strong mathematical ability to

exhibiting a sound knowledge on data structures and algorithms.

algorithmic solutions to real world problems and acquiring a minimum

in applying various design strategies for solving complex problems.

computer for various issues and problems of day-to-day applications with

5. Application Systems Knowledge: Possessing a sound knowledge on computer

7. Communication: Must have a reasonably good communication knowledge

8. Project Management: Practicing of existing projects and becoming

9. Ethics on Profession, Environment and Society: Exhibiting professional ethics

towards advanced studies on Computer Science.

By the end of the program the students will be able to:

The Bachelor of Computer Application (BCA (Hons)) program enables students to

attain following additional attributes besides the afore-mentioned attributes, by the

1. Apply standard Software Engineering practices and strategies in real -time

Concept Note, Abbreviation Explanation and Coding:

4. Wherever there is a practical there will be no tutorial and vice-versa

1. AECC: Ability Enhancement Compulsory Course.

4. SEC: Skill Enhancement Course.

7. VC: Vocational Course.

9. L1: Language One

11. L= Lecture; T= Tutorial; P=Practical.

7. Code 1: Course in that semester.

Operating System, Basic Commands (cal, date, bc,

Year I Course Code: 21BCA1C2P Credits 02

Note: Use any open source software to execute the above

Evaluation Scheme for Information Technology Lab Examination

Assessment Criteria Marks

Year I Course Code:21BCA1C1L Credits 03

Derived data types in C: Arrays: One Dimensional arrays 08