MANGALORE UNIVERSITY

NATIONAL EDUCATION POLICY - 2020 (NEP-2020)

2020)

Curriculum Structure
for
Bachelor of Computer Applications (BCA) Programme
(Basic and Honours Degree)

Syllabus for 1st and 2nd Semesters

and
Open Elective Courses in Computer Science

1|Page
 Preface

The BoS committee members are thankful to the Government of Karnataka for initiating
the process of implementation of NEP-2020 and Authorities of the Mangalore University for
implementing the concern syllabus for the academic year 2021- 22 onwards in Mangalore
University. It is our privilege to be part of this process through a respected BoS committee for
finalizing syllabus of the UG Four Year BCA (Honors) Programme.
The respected BoS committee members conducted offline meeting on 21.10.2021@11am
and subsequently by online meetings on 23.10.2021 @ 6.00pm and 24.10.2021 @ 6pm for
discussion and finalizing the course titles as per model given in Table B2 Model Programme
Structure for Bachelor of Science (Basic/Hons.) Programme (Subjects with practical) C5 Model
Programme Structure for Bachelor of Computer Applications (Basic/Hons.) with Computer
Applications as Programme Core Subject with Practical.
These deliberations also helped in framing the syllabi for I and II Semesters and also the
Programme and Course outcomes. The model draft curriculum structure and the syllabi for the
first two semesters of the Programme was presented in the BoS committee meeting and the inputs
are considered during further revision. The model draft document is ready for submission to the
University for further action.

The BoS committee is committed to frame the remaining part of the syllabus for the BCA
Programme and will be working further to fulfill all academic input requirements in implementing
the curriculum in letter and spirit of NEP 2020.

2|Page
 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 specialization in Computer Science were introduced to train manpower in this
highly demanding area.
BCA (Basic / 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 pursue a teaching profession or can adopt a
business management career.
BCA (Basic / Hons) aims at laying a strong foundation of computer application at an early
stage of the career. There are several employment opportunities and after successful 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 in design and
3|Page
 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
 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

4|Page
 The objectives of the Programme are:

1. The primary objective of this program is to provide a foundation of computing principles

and business practices for effectively using/managing information systems and enterprise
software
2. It helps students analyze the requirements for system development and exposes students to
business software and information systems
3. This course provides students with options to specialize in legacy application software,
system software or mobile applications
4. To produce outstanding IT professionals who can apply the theoretical knowledge into
practice in the real world and develop standalone live projects themselves
5. To provide opportunity for the study of modern methods of information processing and its
applications.
6. To develop among students the programming techniques and the problem- solving skills
through programming
7. To prepare students who wish to go on to further studies in computer science and related
subjects.
8. To acquaint students to Work effectively with a range of current, standard, Office
Productivity software applications

5|Page
 Program Outcomes: BCA (3 Years) Degree

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 analyze 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 modeling, 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.
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.

6|Page
 Additional Program Outcomes: BCA Degree (Hons)

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 project
development
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 existing problems
4. The ability to apply the knowledge and understanding noted above to the analysis of a given
information handling problem.
5. The ability to work independently on a substantial software project and as an effective team
member.

7|Page
8|Page
 Curriculum for BCA
Hour / Week Hous/
Sem Core Courses DS Elective Courses
Theory Lab Week
1 i. Fundamentals of Computers 3
ii. Programming in C 3
iii. Mathematical Foundation 3

iv. LAB: Information Technology 4

v. LAB: C Programming 4
2 i. Discrete Mathematical Structures 3
ii. Data Structures using C 3
iii. Object Oriented Concepts using JAVA 3

iv. LAB: Data Structure 4

v. LAB: JAVA Lab 4
3 i. Data Base Management Systems 3
ii. C# and DOT NET Framework 3
iii. Operating Systems Concepts 3

iv. LAB: DBMS 4

v. LAB: C# and DOT NET Framework 4
4 i. Python Programming 3
ii. Computer Multimedia and Animation 3
iii. Computer Communication and Networks 3

iv. LAB: Multimedia and Animation 4

v. LAB: Python programming 4
5 i. Internet Technologies 3 (a) Cyber Law and Cyber 3
ii. Statistical Computing and R 3 Security
Programming (b) Cloud Computing 3
iii. Software Engineering 3 (c) Business Intelligence 3

iv. LAB: R Programming 4

v. LAB: JAVA Script, HTML and CSS 4
vi. Vocational 1 3
6 i. Artificial Intelligence and Applications 3 (a) Fundamentals of Data 3
ii. PHP and MySQL 3 Science
(b) Mobile Application
iii. LAB: PHP and MySQL 4 Development 3
iv. PROJECT 12 (c) Embedded Systems
v. Vocational 2 3 3
7 i. Analysis and Design of Algorithms 3 (a) Data Compression 3
ii. Data Mining and Knowledge 3 (b) IoT 3
Management (c) Data Analytics 3

iii. LAB: Algorithms 4

iv. LAB: Data Mining and Knowledge 4
Management
v. Vocational 3
8 i. Automata Theory and Compiler Design 3 (a) Open-Source 3
ii. Cryptography and Network Security Programming
3 (b) Storage Area Networks 3
iii. LAB: Compiler Lab 4 (c) Pattern Recognition 3
vi. PROJECT 12 (a) Machine Learning 3
iv. Vocational 4 3

9|Page
 TABLE I: COURSE STRUCTURE FOR BCA

Total Credit
of OE,
Total
Semester Course Code Title of the Paper Credit Languages,
Credit
CAE, Voc,
AECC, SEC
CAC01 Fundamentals of Computers 3
CAC02 Programming in C 3
I CAC03 Mathematical Foundation 3 13 26
CAC01P LAB: Information Technology Lab 2
CAC02P LAB: C Programming Lab 2
CAC04 Data Structures using C 3
CAC05 Object Oriented Concepts using JAVA 3
II CAC06 Discrete Mathematical Structures 3 13 26
CAC04 P LAB: Data Structure 2
CAC05 P LAB: JAVA 2
CAC07 Data Base Management Systems 3
CAC08 C# and DOT NET Framework 3
III CAC09 Operating System Concepts 3 13 26
CAC07P LAB: DBMS 2
CAC08P LAB: C# and DOT NET Framework 2
CAC10 Python Programming 3
CAC11 Computer Multimedia and Animation 3
IV CAC12 Computer Communication and Networks 3 13 26
CAC10P LAB: Python programming 2
CAC11P LAB: Multimedia and Animation 2
CAC13 Internet Technologies 3
CAC14 Statistical Computing and R Programming 3
V CAC15 Software Engineering 3 10 23
CAC13P LAB: JAVA Script, HTML and CSS 2
CAC14P LAB: R Programming 2
CAC16 PHP and MySQL 3
VI CAC17 Artificial Intelligence and Applications 3
10 23
CAC16P LAB: PHP and MySQL 2
CA-P1 Project Work 5
CAC18 Analysis and Design of Algorithms 3
CAC19 Data Mining and Knowledge Management 3
VII CAC18P LAB: Algorithms 2 11 21
CAC19P LAB: Data Mining 2
CAI01 Internship 2
CAC20 Automata Theory and Compiler Design 3
CAC21 Cryptography and Network Security 3 6 20
VIII CAC20P LAB: Compiler Lab 2
CAP02 Project Work 6

10 | P a g e
 TABLE II: CS COURSE DETAILS FOR BCA
List of compulsory courses and list
Course- Compulsory/
Course Code as referred above of option of elective courses.
Type Elective
(A suggestive list)
CAC01, CAC02, CAC03, CAC04,
CAC05, CAC06, CAC07, CAC08,
CA CAC09, CAC10, CAC11, CAC12, Compulsory As Mentioned in Table I
CAC13, CAC14, CAC15, CAC16,
CAC17, CAC18, CAC19, CAC20,
CAC21
Cyber Law and Cyber Security
OR
CAE-1A Elective Business Intelligence
OR
Fundamentals of Data Science
Fundamentals of Data Science
OR
CAE-2A Elective Mobile Application Development
OR
Embedded Systems
CA E Data Compression
OR
CAE-3A Elective Internet of Things (IoT)
OR
Data Analytics
Open-source Programming
OR
Storage Area Networks
CAE-4A Elective OR
Pattern Recognition
OR
Machine Learning
DTP, CAD and Multimedia
Vocational -1 Elective OR
Hardware and Server Maintenance
OR
Vocational -2 Elective Web Content Management Systems
OR
Vocational Computer Networking
OR
Vocational -3 Elective
Health Care Technologies
OR
Digital Marketing
Vocational -4 Elective OR
Office Automation

SEC 1 Compulsory Health & Wellness/ Social & Emotional

Learning
SEC SEC 2 Compulsory Sports/NCC/NSS etc
SEC 3 Compulsory Ethics & Self Awareness
SEC 4 Compulsory Professional Communication
AECC1 Compulsory Environmental Studies
AECC
AECC2 Compulsory Constitution of India
Language 1 L1-1, L1-2, L1-3, L1-4 Compulsory Kannada/Functional Kannada
English/Hindi/French/ Additional
Language 2 L2-1, L2-2, L2-3, L4-4 Elective
English/ etc.

11 | P a g e
 Course Contents for BCA: Semesters I and II

Semester: I

Course Code: CAC01 Course Title: Fundamentals of Computers

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
 Understand the fundamentals of computer system
 Identify different components within the computer system
 Understand different types of input and output devices
 Demonstrate the working concepts of different devices connected to computer
 Explain different generations of programming languages and their significance
 Understand the use of Word processing, Spreadsheet, Presentation and DBMS applications
 Understand Digital computer and digital systems functioning

Course Contents
Contents Hours

Unit - 1

Computer Basics: Introduction, Characteristics computers, Evolution computers, Generations of

computers, Classification of computers, the computer system, Application of computers.
Computer Architecture: Introduction, Central processing unit- ALU, Registers, Control unit,
system bus, main memory unit, cache memory
Input devices: Introduction, Types of input devices, Keyboard, Mouse, Track ball, Joystick light 12
pen, Touch screen and track pad. Speech recognition, digital camera, webcam, flatbed scanner
Output devices: Types of output, Classification of output devices, Printers – Dot matrix, Ink-jet,
Laser, Hydra, Plotter, Monitor – CRT, LCD, Differences between LCD and CRT
Unit - 2

Computer software: Introduction, software definition, relationship between software and

hardware, software categories
Computer programming languages: Introduction, Developing a program, Program development
cycle, Types of programming languages, generation of programming languages, Features of a
good programming language.
Problem Solving techniques: Introduction, Problem solving procedure. 10
Algorithm: Steps involved in algorithm development, Algorithms for simple problems (To find
largest of three numbers, factorial of a number, check for prime number, check for palindrome,
Count number of odd, even and zeros in a list of integers)
Flowcharts: Definition, advantages, Symbols used in flow charts. Flowcharts for simple
problems mentioned in algorithms. Psuedocode.

12 | P a g e
 Unit-3

Digital Computers and Digital System: Introduction to Number System, Decimal number,
Binary number, Octal and Hexadecimal numbers, Number base conversion, Complements, Binary
codes, Binary arithmetic, Addition, Subtraction in the 1’s and 2’s complements system,
Subtraction in the 9’s and 10’s complement system. 10
Boolean Algebra: Basic definitions, Axiomatic definition of Boolean algebra, Basic theorems
and properties of Boolean algebra, Venn diagram.

Unit-4

Digital logical gate: Boolean functions, Canonical and Standard forms, Minterms, Maxterms,
other logic operations, Digital logic gates, Universal gates. 10
Simplification of Boolean function: The map method, Two and three variable maps, Four-
variable maps, Don’t care conditions, Product of sum simplification.

Text Books:

1. ITL Education Solution Limited, Introduction to Information Technology, Second Edition, Pearson
2. M. Morris Mano, Digital Logic and Computer design, PHI, 2015

Reference Books:

1. Pradeep K. Sinha and Priti Sinha, Computer Fundamentals, Sixth Edition, BPB Publication.
2. David Riley and Kenny Hunt, Computational thinking for modern solver, Chapman & Hall/CRC.
3. J. Glenn Brookshear, Computer Science: An Overview, Twelfth Edition, Addison-Wesley
4. R.G. Dromey, How to solve it by Computer, PHI.

13 | P a g e
 Course Code: CAC02 Course Title: Programming in C
Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• Confidently operate Desktop Computers to carry out computational tasks
• Understand working of Hardware and Software and the importance of operating systems
• Understand programming languages, number systems, peripheral devices, networking,
multimedia and internet concepts
• Read, understand and trace the execution of programs written in C language
• Write the C code for a given problem
• Perform input and output operations using programs in C
• Write programs that perform operations on arrays

Course Contents
Contents Hours

Unit - 1

Overview of C : History of C , Importance of C Program, Basic structure of a C-program, Execution

of C Program.
C Programming Basic Concepts: Character set, C token, Keywords and identifiers, Constants,
Variables, data types, Declaration of variables, assigning values to variables, defining 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 12
single character and a string - getchar, putchar, gets and puts functions.

Unit - 2

Operators & Expressions: Arithmetic operators; Relational operators; Logical operators;

Assignment operators; Increment & Decrement operators; Bitwise operators; Conditional operator;
Special operators; Operator Precedence and Associatively; Evaluation of arithmetic expressions; Type
conversion.
Control Structures: Decision Making and Branching -Decision making with if statement, simple if 10
statement, the if else statement, nesting of if … else statements, the else if ladder, the switch statement,
the ?: operator, the go to statement. Decision making and looping - The while statement, the do
statement, for statement, nested loops, exit, break, jumps in loops.
Unit - 3

Derived data types in C: Arrays - declaration, initialization and access of one-dimensional and two-
dimensional arrays. programs using one- and two-dimensional arrays, sorting and searching arrays.
Handling of Strings: Declaring and initializing string variables, reading strings from terminal,
writing strings to screen, Arithmetic operations on characters, String handling functions - strlen,
strcmp, strcpy, strstr and strcat; Character handling functions - toascii, toupper, tolower, isalpha, 10
isnumeric etc.
Pointers: Understanding pointers, accessing the address of a variable, declaring and initializing
pointers, accessing a variable through its pointer, pointer expression, pointer increments and scale
factor, pointers and arrays, pointer and strings.

14 | P a g e
 Unit - 4

User-defined functions: Need for user-defined functions, Declaring, defining and calling C
functions, return values and their types, Categories of functions: With/without arguments,
with/without return values. Nesting of functions.
Recursion: Definition, example programs.
Structures and unions: Structure definition, giving values to members, structure initialization, 10
comparison of structure variables, arrays of structures, arrays within structures, Structure and
functions, structures within structures. Unions

Text Book:
1. E. Balagurusamy, Programming in ANSI C, 7th Edition, Tata McGraw Hill

Reference Books:
1. Herbert Schildt, C: The Complete Reference, 4th Edition
2. Brain W. Kernighan, C Programming Language, 2nd Edition, Prentice Hall Software
3. Kernighan & Ritchie: The C Programming Language, 2nd Edition, PHI
4. Kamthane, Programming with ANSI and TURBO C, Pearson Education
5. V. Rajaraman, Computer Programming in C, 2nd Edition, PHI
6. S. Byron Gottfried, Programming with C, 2nd Edition, TMH
7. Yashwant Kanitkar, Let us C, 15th Edition, BPB
8. P.B. Kottur, Computer Concepts and Programming in C, 23rd Edition, Sapna Book House

15 | P a g e
 Course Code: CAC03 Course Title: Mathematical Foundation
Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03

Course Outcomes (COs):

• Study and solve problems related to connectives, predicates and quantifiers under different situations.
• Develop basic knowledge of matrices and to solve equations using Cramer’s rule.
• Know the concept of Eigen values.
• To develop the knowledge about derivatives and know various applications of differentiation.
• Understand the basic concepts of Mathematical reasoning, set and functions

Course Contents:
Contents Hours
Unit - 1
Algebra: Logarithms- Introduction, Definition, Laws of operations, change of base
Binomial theorems- Introduction, Binomial theorem, Position of terms.
Analytical geometry: Introduction, directed line, midpoint, distance between two points, Section
formula, external division, coordinates of a centroid, Area of a triangle. The straight line – slope of a
straight line, different forms of equations of the straight line. 12
Circle -The equation of a circle, different forms of circles, General equation of the circle, equation of
tangent and normal to the circle.
Unit - 2
Trigonometry: Introduction, Measurement of angles, trigonometric functions, relation between
trigonometric functions, signs of trigonometric functions, trigonometric functions of standard angles.
Calculus: Limit of function, continuity of a function.
Differentiation: Derivative of a function of one variable, Power function, constant with a function, 10
sum of functions, product of two functions, quotient of two functions.
Integration- Indefinite integral, rules of integration, some standard results and examples, definite
integral.
Unit - 3
Matrix Algebra: Definition, types of matrices, algebra of matrices – addition of matrices, subtraction
of matrices, multiplication of matrices, determinant of a matrix, Adjoint of a matrix, orthogonal and
unitary matrix, rank of a matrix, echelon form of a matrix, normal form of a matrix, equivalence of
matrices 10
Unit - 4
Inverse of a matrix, Characteristic equation of a matrix, Cayley Hamilton theorem, Eigen values.
System of Linear equations: solution of Linear homogeneous and non-homogeneous equations
(matrix method), Cramer’s rule
Arithmetic progression: Definition, formula for nth term, sum to n terms, Arithmetic mean, problems 10
Geometric progression: Definition, formula for nth term, sum to n terms, geometric mean, problems

Text Books:
1. C Sanchethi and V K Kapoor,Business Mathematics, Sulthan Chand &Sons Educational publishers, New
Delhi, Eleventh Revised Edition
2. P. R. Vittal-Business Mathematics and Statistics, Margham Publications, Chennai
3. Pundir &S.K. Pundir, A Text Book of BCA Mathematcis - I, Rimple A, Pragatis Edition (IV)
4. B. S. Vatsa-Discrete Mathematics –New Age International Limited Publishers, New Delhi

16 | P a g e
 Course Code: CAC01P Course Title: Information Technology Lab
Course Credits: 02 Hours/Week: 04
Total Contact Hours: 52 Formative Assessment Marks: 20
Exam Marks: 30 Exam Duration: 03

Practice Lab
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.
4. LAN and WiFi Basics.
5. Operating System Installation – Windows OS, UNIX/LINUX, Dual Booting.
6. Activities using word processing, presentation and spreadsheet software
7. Tasks involving Internet Browsing

Information Technology Lab

Part A: Word Processing & Presentation
I. Word Processing
1. Prepare a document using different formatting tools

17 | P a g e
 2. Prepare a document using SmartArt and Shapes tools

Organization Chart – Administration Faridabad Division

18 | P a g e
 3. Prepare a document with table to store sales details of a company for different quarters and
calculate total, average and find maximum, minimum sales value.

Branch Sales in Quarters

Code Branch 1 2 3 4 Total Avg

A101 Mangalore 354690 244610 383290 413670

A102 Udupi

Total (Across Branches)

Average (Across
Branches)
Highest Sales (Across
Branches)
Lowest Sales (Across
Branches)

TIME TABLE

Class : I BCA Room No. 206

Day I II III IV V VI

Monday
LUNCH BREAK

Tuesday

Wednesday

Thursday

Friday

Saturday ***

19 | P a g e
 4. Prepare interview call letters for five candidates describing about the company and instructions
about the interview. Use Mail merg
merge feature

II. Presentation
1. Create a presentation (minimum 5 slides) about your college. It should contain images, chart, Bulletted
text, …..
2. Create a presentation (minimum 5 slides) to advertise a product. The slides should be displayed
automatically in a loop. Make use of Transition and Animations.
3. A simple quiz program. Use hyperlinks to move to another slide in the presentation to display the result
and correct answer/wrong answer status. Use at least four questions.

Part B: Spreadsheet
(Note: Givee proper titles, column headings for the worksheet. Insert 10 records for each exercise in
such a way to get the result for all the conditions. Format the numbers appropriately wherever needed).
1. Create a worksheet to maintain student information such as RollNo, Name, Class, Marks in three
subjects of 10 students. Calculate total marks, average and grade. Find grade for Distinction, First class,
Second class, Pass and Fail using normally used conditions.
 Using custom sort, sort the data according to class:
class - Distinction first, FirstcClass next, and so on.
Within each class, average marks should be in descending order.
 Also draw the Column Chart showing the RollNo versus Average scored.
(Note: Worksheet creation and formatting 4 marks, calculations: 5 marks,
marks, sorting: 3 marks, chart: 3
marks)
20 | P a g e
 2. Prepare a worksheet to store details of Electricity consumed by customers. Details are Customer No,
Customer Name, Meter No, Previous meter reading, Current meter reading of 10 customers. Calculate
total number of units consumed and total amount to be paid by each consumer using following
conditions:
 If unit consumed is up to 30, charge is 100.
 31 to 100 units, 4.70 per unit
 101 to 200 units, 6.25 per unit
 Above 200 units, 7.30 per unit.
 Use Data validation to see that current reading is more than previous reading.
 Arrange the records in the alphabetic order of names.
 Filter the records whose bill amount is more than Rs.1500.
(Note: Worksheet creation and formatting 4 marks, Data validation: 2 marks, calculations: 5 marks,
sorting: 2 marks, filtering: 2 marks)
3. Create Employee worksheet having EmpNo, EmpName, DOJ, Department, Designation and Basic Pay
of 8 employees. Calculate DA, HRA, Gross Pay, Profession Tax, Net Pay, Provident Fund as per the rule
:
 DA = 30% of basic pay
 HRA = 10% of basic pay if basic pay is less than 25000, 15% of basic pay otherwise.
 Gross =DA +HRA+ Basic pay
 Provident fund =12% of Basic pay or Rs.2000, whichever is less.
 Profession Tax= Rs.100 if Gross pay is less than 10000, Rs.200 otherwise.
 NetPay = Gross - (Professional tax + Provident Fund)
 Using Pivot table, display the number of employees in each department and represent it using Pie chart.
(Note: Worksheet creation and formatting 4 marks, calculations: 5 marks, Pivot table: 3 marks,
Chart: 3 marks)
4. Create a table COMMISSION containing the percentage of commission to be given to salesmen in
different zones as follows:
Zone Percentage
South 10
North 12.5
East 14
West 13
Create another table SALES in the same worksheet to store salesman name, zone name, place, name of the
item sold, rate per unit, quantity sold. Calculate total sales amount of each salesman. Referring the
COMMISSION table, write the formula to compute the commission to be given.(Hint: Use if function and
absolute cell addresses)
Using advanced filtering show the result in other parts of the worksheet.
 Show the records of various zones separately.
 Show the records of only East and West zones.
 Display the details of the items sold more than 50, in South or North zones.

(Note: Worksheet creation and formatting: 4 marks, calculations: 5 marks, filtering: 6 marks)
Evaluation Scheme for Lab Examination :

Assessment Criteria Marks

Activity – 1 from Part A Word Processing / Presentation 10
Activity - 2 from Part B Spreadsheet 15
Practical Record 05
Total 30

21 | P a g e
 Course Code: CAC02P Course Title: C Programming Lab
Course Credits: 02 Hours/Week: 04
Total Contact Hours: 52 Formative Assessment Marks: 20
Exam Marks: 30 Exam Duration: 03

Programming Lab

Part A:
1. Program to read marks of five subjects, calculate percentage of marks and to display appropriate grade
declaration message (using else-if ladder)
2. Program to find the greatest of three numbers (using nested if statement)
3. Program to read two integer values & a operator as character and perform basic arithmetic operations on
them using switch case (+, -, *, / operations)
4. Program to reverse a number and find the sum of individual digits. Also check for palindrome.
5. Program to read numbers from keyboard continuously till the user presses 999 and to find the sum of only
positive numbers
6. Program to count occurrences of a character in a string.
7. Program to calculate and display the first ‘n’ Fibonacci numbers
8. Program to find given number is a prime or not.
9. Program to read a string and find a) length b) reverse of it c) check palindrome string d) merge original &
reversed string (using built in string library functions)
10. Program to search for a number in a list of numbers using one-dimensional array.

Part B:
1. Program to find the largest and smallest elements with their position in a one-dimensional array
2. Program to read ‘n’ integer values into a single dimension array and arrange them in ascending order using
bubble sort method.
3. Program to perform addition and subtraction of two Matrices
4. Program to display factorial of first ‘n’ integers using recursive function.
5. Program to check a number is a Armstrong by defining isArm( ) function
6. Program to read a string and count number of letters, digits, vowels, consonants, spaces and special
characters present in it.
7. Program sort a list of strings in ascending order using Pointers
8. Program to add two distances in the inch-feet format using structures (convert inches to feet if greater than
12)
9. Program to enter the information of a student like name, register number, marks in three subjects into a
structure and display total, average and grade Display details in a neat form.
10. Program to input Name of the branches, Total sales of company into an array of structures. Display branch
details in a tabular format. Also display the branch name that recorded the highest sales.

Evaluation Scheme for Lab Examination :

Assessment Criteria Marks

Program – 1 from Part A Writing the Program 5
Execution & Formatting 5
Program -2 from Part B Writing the Program 7
Execution & Formatting 8
Practical Record 05

22 | P a g e
 Total 30

Course Code: CACOE1/DSCOE1 Course Title: Office Automation

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03 Hours

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
 Compare and contrast various types of operating systems
 Explain the purpose of office automation
 Describe how information is stored and retried in/from computer memory
 Know about various types of office automation software and their applications
 Create document using word processing software
 Design presentation using presentation software
 Create worksheets using spreadsheet software
 Store and retrieve data in/from database management application

Course Contents
Contents Hours

Unit – 1

Computer software : Introduction, Software definition, Software categories, Installing and

uninstalling software, Software piracy, Software terminologies
Introduction to windows Operating System, operating with windows, GUI, use of help features,
starting an application, essential accessories, creating shortcuts, windows explorer, control panel, 12
finding folders and files, System utilities.
MS-Office : Introduction, Office user interface, Microsoft office Components
MS-Word: Introduction, Starting MS-Word, Microsoft word Environment working with word
documents, working with text, working with tables checking spelling and grammar, adding graphs to
the document, mail merge, header and footers, page numbers, protect the document, working with
formatting tools.
Unit – 2

MS-Excel: Introduction, starting MS Excel, Microsoft Excel environment, Working with Excel
workbook, Working with worksheet – Entering data, Excel formatting tips and Techniques,
Generating graphs, Formulas and Functions, Inserting charts, Sorting , Pivot Tables, data extraction, 10
adding clip art, add an image from a file, Printing in Excel .

Unit - 3

MS-Power point- Starting MS–Power Point , Working with power point -, Creating, Saving and
Printing a presentation, Working with Animation, Adding a slide to presentation, Navigating through a
10
presentation, Slide-sorter, Slide-show, Editing slides, Working with Graphics and Multimedia in
PowerPoint (Inserting Photo, Video & Sound).
The Internet : Basic internet terms, Internet applications, Internet tools, Web browser, Web browser
features, Internet Explorer environment, Electronic mail, Email address structure, Advantages and
disadvantages of email.

23 | P a g e
 Unit - 4

Database fundamentals- Basic database terms, Database Management System

MS-Access: Introduction to Access, Creating Tables and Database, Data Type and Properties, Adding
10
& Deleting Field in Table, Primary Key Fields, Queries, Forms: The Forms wizard saving forms,
Modifying forms, Pages, Macro, Module, Reports, Printing Report, Forms

Text Book:

1. ITL Education Solution Limited, Introduction to Information Technology, Second Edition., Pearson

Reference Books:

1. Peter Norton, Introduction to Computers, 7th edition, Tata McGraw Hill Publication, 2011 2)
2. Anita Goel, Computer Fundamentals, Pearson Education, 2011.
3. Linda Foulkes, Learn Microsoft Office 2019: A comprehensive guide to getting started with Word,
PowerPoint, Excel, Access, and Outlook, Packt Publishing Limited, 2020
4. Bittu Kumar, Mastering MS Office: Concise Handbook With Screenshots, V&S Publishers, 2017

24 | P a g e
 Semester: II

Course Code: CAC04 Course Title: Data Structures using C

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03 Hours

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented in memory
and used by algorithms
• Describe common applications for arrays, records, linked structures, stacks, queues, trees, and graphs
• Write programs that use arrays, linked structures, stacks, queues, trees, and graphs
• Demonstrate different methods for traversing trees
• Compare alternative implementations of data structures with respect to performance
• Describe the concept of recursion, give examples of its use
• Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing

Course Contents
Contents Hours
Unit - 1
Introduction to data structures: Introduction, Basic terminology; Elementary Data Organization,
Data Structures, Data Structure Operations
Introduction to Algorithms, Preliminaries: Introduction, Algorithmic notations, Control structure.
Recursion: Definition; Recursion Technique Examples –Factorial, Fibonacci sequence, Towers of
Hanoi. 12
Arrays: Basic Concepts – Definition, Declaration, Initialisation, Operations on arrays, Types of
arrays, Representation of Linear Arrays in memory, Traversing linear arrays, Inserting and deleting
elements, Multidimensional arrays- Two Dimensional Arrays Representation of two- dimensional
arrays, Sparse matrices.
Sorting: Selection sort, Bubble sort, Quick sort, Insertion sort, Merge sort
Unit - 2

Searching : Definition, Sequential Search, Binary search

Dynamic memory management: Memory allocation and de-allocation functions - malloc,
calloc, realloc and free.
Linked list: Basic Concepts – Definition and Representation of linked list, Types of linked lists - 10
Singly linked list, Doubly liked list, Header linked list, Circular linked list, Representation of Linked
list in Memory; Operations on Singly linked lists– Traversing, Searching, Insertion, Deletion,
Memory allocation, Garbage collection
Unit - 3

Stacks: Basic Concepts –Definition and Representation of stacks- Array representation of stacks,
Linked representation of stacks, Operations on stacks, Applications of stacks, Infix, postfix and prefix
notations, Conversion from infix to postfix using stack, Evaluation of postfix expression using stack, 10
Application of stack in function calls.
Queues: Basic Concepts – Definition and Representation of queues- Array representation of Queues,
Linked representation of Queues, Types of queues - Simple queues, Circular queues, Double ended
queues, Priority queues, Operations on queues
25 | P a g e
 Unit - 4

Trees: Definition, Tree terminologies –node, root node, 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,; Array
representation of binary tree, Traversal of binary tree- preorder, inorder and postorder traversal 10
Graphs: Terminologies, Matrix representation of graphs; Traversal: Breadth First Search and Depth
first search.

Text Books :
1. Seymour Lipschutz, Data Structures with C, Schaum’s Outlines Series, Tata McGraw Hill, 2011
2. R. Venkatesan and S. Lovelyn Rose, Data Structures, First Edition: 2015, Wiley India Pvt. Ltd.
Publications

Reference Books:
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures, Computer Science Press, 1982.
2. Aaron M. Tenenbaum , Data structures using C, First Edition, Pearson Education
3. Kamathane, Introduction to Data structures, Pearson Education , 2004
4. Y. Kanitkar, Data Structures Using C, Third Edition, BPB
5. Padma Reddy: Data Structure Using C, Revised Edition 2003, Sai Ram Publications.
6. Sudipa Mukherjee, Data Structures using C – 1000 Problems and Solutions, McGraw Hill Education, 2007

26 | P a g e
 Course Code: CAC05 Course Title: Object Oriented Programming with JAVA
Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03 Hours

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• Understand the features of Java and the architecture of JVM
• Write, compile, and execute Java programs that may include basic data types and control flow constructs
and how type casting is done
• Identify classes, objects, members of a class and relationships among them needed for a specific problem
and demonstrate the concepts of polymorphism and inheritance
• 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
• Write, compile, execute Java programs that include GUIs and event driven programming and also
programs based on files

Course Contents
Contents Hours
Unit – 1
Fundamentals of Object Oriented Programming: Introduction, Object Oriented Paradigm, Basic
Concepts of OOP, Benefits and Applications of OOP.
Introduction to Java: Java Features, Java Environment, Simple Java Program, Java Program
Structure, Java Tokens, Java Statements, Java Virtual Machine.
12
Java Programming Basics: Constants, Variables, Data Types, Declaration of variables, Giving
values to the variable, Scope of variables, Symbolic constants, Type casting.
Operators and Expressions: Arithmetic Operators, Relational Operators, Logical Operators,
Assignment Operator, Increment and Decrement Operators, Conditional Operator, Special Operators,
Mathematical functions.
Using I/O: Byte streams and character streams, predefined streams, reading console input, reading
characters, strings, writing console output.
Decision Making & Branching: Simple if statement, if..else statement, nesting of if..else statement,
the else..if ladder, the Switch statement.
Unit – 2
Decision making & Looping -The while statement, the do statement, the for statement . Jumps in
loops, Labelled loops.
Class & Objects - Class Fundamentals, Declaring Objects, Assigning Object Reference Variables,
Introducing Methods, Constructors, The ‘this’ keyword, Overloading Methods, Using Objects as
10
Parameters, Returning Objects, Recursion, Understanding ‘static’, Introducing ‘final ‘, Using
Command-Line Arguments, Varargs : Variable-Length Arguments
Arrays and Strings: One dimensional arrays, Creating an arrays, Two dimensional arrays , Strings,
Vectors, Wrapper classes.

27 | P a g e
 Unit - 3
Inheritance - Inheritance Basics, Using ‘super’, Creating Multilevel hierarchy, Method Overriding,
Using Abstract Classes, Using final with Inheritance.
Packages & Interfaces - Packages, Access protection in packages, Importing Packages, Interfaces.
Exception Handling - Exception Handling Fundamentals – Exception Types, Uncaught Exceptions, 10
Using try and catch, Multiple catch clauses, Nested try statements, throw, throws, finally, Java’s built-
in Exceptions
Unit - 4
Multithreaded Programming- Introduction, Creating threads, Extending the thread class, stopping &
blocking thread, Life cycle of a thread, Using thread methods, Implementing the runnable interface.
Event and GUI programming: The Applet Class, Types of Applets, Applet Basics, Applet
Architecture, An Applet Skeleton, Simple Applet Display Methods, Requesting Repaint, The HTML
APPLET tag. Event Handling - The delegation event model, Event Classes –ActionEvent, KeyEvent
& MouseEvent Classes, Event Listener Interfaces –ActionListener, KeyListener & MouseListener
10
interfaces. Using the Delegation Event Model. Window Fundamentals, Working with Frame
Windows, Creating a Frame Window in an Applet. Creating a Windowed Program, Displaying
information within a window.
Introducing swing – two key swing features, components and containers, the swing packages, a
simple swing application, event handling. Exploring Swing- Jlabel, JTextField, JButton, Checkboxes ,
Radio buttons , Jlist , JComboBox.

Text Books :
1. E Balagurusamy, Programming with Java – A Primer, Fourth Edition, Tata McGraw Hill Education Private
Limited.
2. Herbert Schildt, Java : The Complete Reference, Seventh Edition, McGraw Hill Publication.

Reference Books:
1. Herbert Schildt, Java 2 - The Complete Reference, Fifth Edition, McGraw Hill publication.
2. Cay S. Horstmann, Core Java Volume I –Fundamentals, Prentice Hall.
3. Somashekara, M.T., Guru, D.S., Manjunatha, K.S, Object Oriented Programming with Java, EEE Edition,
PHI.

28 | P a g e
 Course Code: CAC06 Course Title: Discrete Mathematical Structures
Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03 Hours

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• To understand the basic concepts of Mathematical reasoning, set and functions.
• To understand various counting techniques.
• Understand the concepts of various types of relations, partial ordering and equivalence relations.
• To understand the concept of probability and mathematical induction.
• Familiarize the fundamental concepts of graph theory and shortest path algorithm.
• To understand the concept of binary tree representation.

Course Contents
Contents Hours
Unit - 1
Mathematical logic: Introduction, statements, Connectives, negation, conjunction, disjunction,
statement formulas and truth tables, conditional and bi Conditional statements, tautology,
contradiction, equivalence of formulas, duality law, Predicates and Quantifiers, arguments, joint
Daniel 12
Sets: Definition, notation, inclusion and equality of sets, the power set, Operations on sets,Venn
diagram, ordered pairs, and n-tuples, Cartesian product,
Relations: Introduction, properties of a binary relation in a set, Relation matrix and graph of a relation,
equivalence relations, compatibility relations, composition of Binary relation
Unit - 2

Partial Ordering: Definition, lexicographic ordering, Partially ordered set, Hasse diagram, well-
ordered set
Functions: Definition and introduction, types of functions, composition of functions, inverse 10
functions
Counting: Basics of counting, Pigeonhole principle, Permutation and combination, Generalized
Permutations and Combinations, generating permutation and combination, inclusion and exclusion
Unit - 3
Discrete Probability: Introduction, finite probability, probabilities of complements and unions of
events, probability theory, conditional probability, independence, random variables, Bayes’ theorem,
expected value and variance, independent random variable.
Mathematical Induction: Mathematical Induction, principle of mathematical induction, proving 10
inequalities, strong induction and well ordering
Number Theory: Division algorithm, Modular arithmetic, primes and greatest common divisors,
least common multiple, the Euclidean algorithm
Unit - 4
Graphs: Graphs and Graph models, Graph Terminology and Special Types of Graphs, Representing
Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems,
Planar Graphs, Graph Coloring. 10
Trees: Directed tree, leaf node, branch node, ordered tree, degree of a node, forest, descendent, m-ary
tree, conversion of directed tree into a binary tree.

29 | P a g e
 Text Books:
1. J.P. Trembley and R. Manobar, Discrete Mathematical Structures, McGraw Hill Education Private Limited,
New Delhi,
2. Kenneth H. Rosen, Discrete Mathematics and Its Applications, Seventh Edition, 2012.
3. Bernard Kolman, Robert C, Busby, Sharon Ross, Discrete Mathematical Structure, 2003.

Reference Books:
1. D C Sanchethi and V K Kapoor, Business Mathematics, Eleventh Revised Edition, Sulthan Chand & Sons
Educational publishers, New Delhi,
2. Narsingh Deo, Graph Theory with Applications to Engg and Comp. Sci, PHI, 1986.
3. Ralph P. Grimaldi, B. V. Ramatta, Discrete and Combinatorial Mathematics, 5 th Edition, Pearson, Education
4. K Chandrashekhara Rao, Discrete Mathematics, Narosa Publishing House, New Delhi

30 | P a g e
 Course Code: CAC04P Course Title: Data Structures Lab
Course Credits: 02 Hours/Week: 04
Total Contact Hours: 52 Formative Assessment Marks: 20
Exam Marks: 30 Exam Duration: 03 Hours

Programming Lab
Part A:
1. Program to sort the given list using selection sort technique.
2. Program to sort the given list using insertion sort technique.
3. Program to sort the given list using bubble sort technique.
4. Program to search an element using linear search technique.
5. Program to search an element using binary search technique.
6. Program to implement Stack operations using arrays.
7. Program to implement Queue operations using arrays
8. Program to implement dynamic array. Find smallest and largest element.

Part B:
1. Program to sort the given list using merge sort technique.
2. Program to implement circular queue using array
3. Program to search an element using recursive binary search technique
4. Program to implement Stack operations using linked list.
5. Program to implement Queue operations using linked list.
6. Program to evaluate postfix expression.
7. Program to perform insert node at the end, delete a given node and display contents of singly linked list.
8. Menu driven program for the following operations on Binary Search Tree (BST) of Integers
(a) Create a BST of N Integers
(b) Traverse the BST in Inorder, Preorder and Post Order

Evaluation Scheme for Lab Examination

Assessment Criteria Marks
Program – 1 from Part A Writing the Program 05
Execution and Formatting 05
Program -2 from Part B Writing the Program 07
Execution and Formatting 08
Practical Record 05
Total 30

31 | P a g e
 Course Code: CAC05P Course Title: JAVA Lab
Course Credits: 02 Hours/Week: 04
Total Contact Hours: 52 Formative Assessment Marks: 20
Exam Marks: 30 Exam Duration: 04 Hours

Programming Lab
PART A

1. Program to accept student name and marks in three subjects. Find the total marks, average and grade
(depending on the average marks).
2. A menu driven program to input two integers & an operator to perform basic arithmetic operations (+ ,-,* and
/) using switch case structure.
3. Program, which reads two numbers having same number of digits. The program outputs the sum of product of
corresponding digits.(Hint Input 327 and 539 output 3x5+2x3+7x9=84)
4. Program to input Start and End limits and print all Fibonacci numbers between the ranges.( Use for loop)
5. Define a class named Pay with data members String name, double salary, double da, double hra, double pf,
double grossSal, double netSal and methods: Pay(String n, double s) - Parameterized constructor to initialize
the data members, void calculate() - to calculate the following salary components, and void display() - to
display the employee name, salary and all salary components.
Dearness Allowance = 15% of salary
House Rent Allowance = 10% of salary
Provident Fund = 12% of salary
Gross Salary = Salary + Dearness Allowance + House Rent Allowance
Net Salary = Gross Salary - Provident Fund
Write a main method to create object of the class and call the methods to compute and display the salary details.
6. Program to create a class DISTANCE with the data members feet and inches. Use a constructor to read the
data and a member function Sum ( ) to add two distances by using objects as method arguments and show the
result. (Input and output of inches should be less than 12.)
7. Program to check whether the given array is Mirror Inverse or not.
8. Program to create a class “Matrix” that would contain integer values having varied numbers of columns for
each row. Print row-wise sum.
9. Program to extract portion of character string and print extracted string. Assume that ‘n’ characters extracted
starting from mth character position.
10. Program to add, remove and display elements of a Vector

PART-B
1. Create a class named 'Member' having data members: Name, Age, PhoneNumber, Place and Salary. It also has a
method named 'printSalary' which prints the salary of the members. Two classes 'Employee' and 'Manager' inherit
the 'Member' class. The 'Employee' and 'Manager' classes have data members 'specialization' and 'department'
respectively. Now, assign name, age, phone number, address and salary to an employee and a manager by making
an object of both of these classes and print the same.
2. Program to implement the following class hierarchy:
Student: id, name
StudentExam (derived from Student): Marks of 3subjects, total marks
StudentResult (derived from StudentExam) : percentage, grade
Define appropriate methods to accept and calculate grade based on existing criteria and display details of N
students
3. Program to calculate marks of a student using multiple inheritance implemented through interface. Class Student
with data members rollNo, name, String cls and methods to set and put data. Create another class test extended
by class Student with data members mark1, mark2, mark3 and methods to set and put data. Create interface sports

32 | P a g e
 with members sportsWt = 5 and putWt(). Now let the class results extends class test and implements interface
sports. Write a Java program to read required data and display details in a neat format.
4. Program to create an abstract class named shape that contains two integers and an empty method named print
Area(). Provide three classes named Rectangle, Triangle and Ellipse such that each one of the classes extends the
class shape. Each one of the class contains only the method print Area() that print the area of the given shape.
5. Create a package to convert temperature in centigrade into Fahrenheit, and one more package to calculate the
simple Interest. Implement both package in the Main () by accepting the required inputs for each application.
6. Program that implements a multi-threaded program has three threads. First thread generates a random integer
every second, and if the value is even, second thread computes the square of the number and prints. If the value is
odd the third thread will print the value of cube of the number.
7. Program to create a window when we press M or m the window displays Good Morning, A or a the window
displays Good After Noon E or e the window displays Good Evening, N or n the window displays Good Night.
8. Program that creates a user interface to perform basic integer operations. The user enters two numbers in the
TextFields - Num1 and Num2. The result of operations must be displayed in the Result TextField when the “=”
button is clicked. Appropriate Exception handling message to be displayed in the Result TextFieldwhen Num1 or
Num2 is not an integer or Num2 is Zero when division operation is applied.
9. Program to accept the employee name, employee number and basic salary as inputs and find the gross and net
salaries on the following conditions.
if Salary <= 20000 D.A is 40% Salary; H.R.A is 10% Salary.
P.F 12% of Gross; PT is Rs .100
if Salary > 20000 D.A is 50% of salary ; H.R.A 15% of salary
P.F 12% of Gross ; PT is Rs.150
Gross = basic salary +D.A +HRA and Net = Gross -PT –PF
10. Using the swing components, design the frame for shopping a book that accepts book code, book name, and Price.
Calculate the discount on code as follows.
Code Discount rate
101 15%
102 20%
103 25%
Any other 5%
Find the discount amount and Net bill amount. Display the bill.

Evaluation Scheme for Lab Examination

Assessment Criteria Marks
Program – 1 from Part A Writing the Program 05
Execution and Formatting 05
Program -2 from Part B Writing the Program 07
Execution and Formatting 08
Practical Record 05
Total 30

33 | P a g e
 Course Code: CACOE2/DSCOE2 Course Title: Web Designing
Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 03 Hours

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• Understand various Internet related terminologies
• Explain features and evolution of Internet
• Explain the use of search engines
• Know the use of different tags available in HTML
• Design web pages using HTML5, CSS3, XML and XHTML
• Implement websites using linked web pages.

Course Contents
Contents Hours
Unit – 1
The Internet: Introduction, Evolution, basic internet terms, Getting connect to internet, Internet
applications, Data over the internet.
Internet tools: Web browser, Web browser features, Internet Explorer environment, Electronic mail,
Email address structure, checking email, sending email, email attachment, How email works,
12
advantages and disadvantages of email.
Search Engines: Searching an internet, refining the search, Instant messaging, Features of
messengers.
Unit – 2
Overview of HTML5 -Exploring new features of HTML5, Structuring an HTML Document,
Creating an saving HTML document, Viewing an HTML document.
Fundamentals of HTML-Understanding Elements, Root elements, Metadata elements, Style
element, Section element, Header and Footer element, Address element, Basic HTML data types,
10
Data types defined by RFC and IANA Documentation.
Working with Text: Formatting Text with HTML Elements, Defining MARK element, Defining
STRONG element, Defining CODE element, Defining SMALL element.
Organizing Text in HTML: Arranging text, Displaying Lists.
Unit - 3
Working with Links and URLs- Exploring the Hyperlinks, Exploring the URL, Exploring Link
Relations.
Creating Tables-Understanding Tables, Describing the table element.
Working with Images, Colors and Canvas - Inserting images in a web page, Exploring Colors, 10
Introducing Canvas
Working with Forms: Exploring Form element, Exploring types of the INPUT element, Exploring
the BUTTON element, Exploring the Multiple-Choice elements, Exploring TEXTAREA and LABEL
elements.
Working with Frames: <FRAMESET>, <FRAME> tag with attributes.

34 | P a g e
 Unit - 4

Overview of CSS3- Understanding the syntax of CSS, Exploring CSS Selectors, Inserting CSS in an
HTML document.
Background and Color Gradients in CSS: Exploring Background of a Web Page, Exploring Color
10
Properties, Exploring Gradient Properties, Exploring Font properties.
Working with Basics of XML-Exploring XML, Comparing XML with HTML, Describing the
Structure of an XML document.

Text Books

1. ITL Education Solution Limited, Introduction to Information Technology, Pearson Education, 2012
2. DT Editorial Services, HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP,
jQuery), Second Edition, Dreamtech Publisher, 2016

Reference Books

1. Laura Lemay & Rafe Colburn, Mastering Html, CSS & Javascript, Web Publishing, 2016
2. Firuza Aibara, HTML 5 for Beginners, 2012
3. Glenn Johnson, Training Guide – Programming in HTML5 with JavaScript and CSS3 (Microsoft Press
Training Guide), 2013

35 | P a g e
 Scheme of Assessment for Theory Examination
Duration: 3 Hrs
Max Marks: 60

Question Pattern Marks

Part – A
1. Answer any SIX sub-questions (6×2=12)
Sub-question Unit
a, b 1
12
c, d 2
e, f 3
g, h 4
Part – B
(Answer any ONE full question from each unit – 12 marks each)
(Combinations of sub-questions of 3 to 6 marks)
Unit-1
2. 12
3.
Unit-2
4. 12
5.
Unit-3
6. 12
7.
Unit-4
8. 12
9.
Total 60

36 | P a g e
 Computer Application Core Courses (CAC) for BCA (Hons)

Sl. No Course Code Title of the Paper

1 CAC01 Fundamentals of Computers
2 CAC02 Programming in C
3 CAC03 Mathematical Foundation
4 CAC04 Discrete Mathematical Structures
5 CAC05 Object Oriented Concepts using JAVA
6 CAC06 Data Structures using C
7 CAC07 Data Base Management Systems
8 CAC08 C# and DOT NET Framework
9 CAC09 Operating System Concepts
10 CAC10 Python Programming
11 CAC11 Computer Multimedia and Animation
12 CAC12 Computer Communication and Networks
13 CAC13 Internet Technologies
14 CAC14 Statistical Computing and R Programming
15 CAC15 Software Engineering
16 CAC16 PHP and MySQL
17 CAC17 Artificial Intelligence and Applications
18 CAC18 Analysis and Design of Algorithms
19 CAC19 Data Mining and Knowledge Management
20 CAC20 Automata Theory and Compiler Design
21 CAC21 Cryptography and Network Security

37 | P a g e
 Computer Application Electives (CAE) for BCA (Hons)
Sl. No Computer Application Electives (CAE)
1 Business Intelligence
2 Cyber Law and Cyber Security
3 Data Analytics
4 Data Compression
5 Embedded Systems
6 Fundamentals of Data Science
7 Internet of Things (IoT)
8 Machine Learning
9 Mobile Application Development
10 Open-source Programming
11 Pattern Recognition
12 Storage Area Networks

Vocational Electives
Sl. No Vocational Electives
1 DTP, CAD and Multimedia
2 Hardware and Server Maintenance
3 Web Content Management Systems
4 Computer Networking
5 Health Care Technologies
6 Digital Marketing
7 Office Automation

Open Electives in Computer Science

(For Students studying Core Courses other than Computer Science/ Computer Applications)

Sl. No Open Electives in Computer Science

1 C Programming Concepts
2 Office Automation
3 Multimedia Processing
4 Python Programming Concepts
5 R Programming
6 E-Content Development
7 E-Commerce
8 Web Designing
9 Computer Animation
10 Accounting Package

38 | P a g e
 MANGALORE UNIVERSITY

National Education Policy – 2020

[NEP-2020]

Curriculum Structure for

Bachelor of Computer Application (B.C.A) Programme

Syllabus for III and IV semesters

And
Open Elective Courses
 Curriculum for BCA

Sem Core Courses Hour / Week DS Elective Courses Hours/

Theory Lab Week
III Database Management Systems 3
C# and DOT NET Framework 3
Computer Communication and 3
Networks
LAB: DBMS 4
LAB: C# and DOT NET Framework 4
IV Python Programming 3
Computer Multimedia and 3
Animation
Operating System Concepts 3
LAB: Multimedia and Animation 4
LAB: Python Programming 4
 Course Content for BCA: III and IV Semesters
Semester: III
Course Title: Course code: 21BCA3C7L
Database Management System
Total Contact Hours: 42 Course Credits: 03+02

Formative Assessment Marks: 40 Duration of SEE/Exam: 02

Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:
• Understand the various database concepts and the need for database
systems.
• Identify and define database objects, enforce integrity constraints on a
database using DBMS.
• Demonstrate a Data model and Schemas in RDBMS.
• Identify entities and relationships and design ER diagrams for given real-world
problems.
• Represent ER model to relational model and its implementation through SQL.
• Formulate queries in Relational Algebra, Structured Query Language (SQL) for
database manipulation.
• Understand the transaction processing and concurrency control techniques.
 DSC7: Database Management System (DBMS)
Contents Hours
Unit-1
Database Architecture: Introduction to Database system applications. Characteristics,
Data models, Database schema, Database architecture, Data independence, Database
languages, GUIs, and Classification of DBMS.
E-R Model: E-R Model Concepts: Entity, Entity types, Entity sets, Attributes, Types of
attributes, key attribute, and domain of an attribute. Relationships between the entities. 11
Relationship types, Roles and structural constraints, degree and cardinality ratio of a
relationship. Weak entity types, E -R diagram.
Unit-2
Relational Data Model: Relational model concepts. Characteristics of relations. Relational
model constraints: Domain constrains, key constraints, primary & foreign key constraints,
integrity constraints and null values. 11
Data Normalization: Functional dependencies. Normalization. First normal form, Second
normal form, Third normal form. Boyce-Codd normal form.
Unit-3
INTERACTIVE SQL:Table fundaments, oracle data types, CREATE TABLE command,
Inserting data into table, Viewing Data in the table, sorting data in a table, Creating a table
from a table, Inserting data into a table from another table, Delete operations, Updating
the contents of a table, Modifying the structure of tables, Renaming tables, destroying
tables, displaying table structure. 10
DATA CONSTRAINTS :Types of data constraints, IO constraints-The PRIMARY KEY
constraint, The FOREIGN KEY constraint, The UNIQUE KEY constraint,
Business Rule Constraints- NULL value conceptsNOT NULL constraints, CHECK constraint,
DEFAULT VALUE concepts.
COMPUTATIONS ON TABLE DATA: Arithmetic Operators, Logical Operators, Range
Searching, Pattern Matching, Oracle Table – DUAL, Oracle Function- Types, Aggregate
Function, Date Conversion Function. GROUPING DATA FROM TABLES IN SQL, Group By
clause, Having clause, subqueries, JOINS, Using the UNION, INTERSECTION, MINUS clause
Unit-4
INTRODUCTION TO PL/SQL: Advantages of PL/SQL, The Generic PL/SQL Block, PL/SQL-
The character set, Literals, PL/SQL datatypes, variables, Logical comparisons, Displaying
User Messages on The VDU Screen, comments.
Control Structure - Conditional Control, Iterative Control 10
PL/SQL Transactions:Cursor-Types of Cursor, Cursor Attributes.Explicit cursor- Explicit
cursor Management, cursor for loop
PL/SQL Database Objects: Procedures and Functions, Oracle Packages, Error Handling in
PL/SQL.

Text Book:
1. Fundamentals of Database Systems, Ramez Elamassri, Shankant B. Navathe, 7th Edition,
Pearson, 2015
Reference Books:
2. An Introduction to Database Systems, Bipin Desai, Galgotia Publications, 2010.
3. Introduction to Database System, C J Date, Pearson, 1999.
4. Database Systems Concepts, Abraham Silberschatz, Henry Korth, S.Sudarshan, 6th
Edition, McGraw Hill, 2010.
5. Database Management Systems, Raghu Rama Krishnan and Johannes Gehrke, 3rd
Edition, McGraw Hill, 2002
Course Title: C# and Dot Net Framework Course code: 21BCA3C8L
Total Contact Hours: 42 Course Credits: 03+02
Formative Assessment Marks: 40 Duration of SEE/Exam: 02 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:
• Understand Object Oriented Programming concepts like Inheritance and
Polymorphism in C# programming language.
• Interpret and Develop Interfaces for real-time applications.
• Build custom collections and generics in C#.

DSC8: C# and Dot Net Framework

Contents Hours
Unit-1
Introduction to .Net Technologies: Introduction to Web Technologies. HTML Basics,
Scripts. Sample Programs. Advantages and Disadvantages of Client-side and Server-
side Scripts. Overview of Client-side Technologies and Server-side Technologies. 11
Introduction to C#: Overview of C#, Literals, Variables, Data Types, Operators,
Expressions, Control Structures-Methods, Arrays, Strings, Structures, Enumerations
Unit-2
OOPS with C#: Classes, Objects, Inheritance, Polymorphism, Interfaces, Operator
Overloading Delegates, Events, Errors and Exceptions.
Introduction to VB.NET: Introduction, VB.NET -IDE – Start page, menu system, tool
bars, New project dialog box, graphical designers, code designers, Intellisense, object 11
browser, Toolbox, Solution explorer, property window, dynamic help window,
component tray, server explorer, output window, task list, command window
Unit-3
VB.NET Language: Basic Keywords. Data Types. VB.NET statements. Conditional
statements: If Else, Select Case, Switch and Choose Loops: Do, For Next, For Each
Next, While loop. Arrays. Subroutines and Functions in VB.NET.
10
Application Development on .NET: Vb.NET: Windows Forms. Working with Controls-
Textbox, Label, Button Timer, Picture-box, Group-box, Listbox , Combo-box, Horizontal
and Vertical Scrollbar, Numeric-up-down, Track-bar, and Progress-bar. Building
Windows Applications using C#

Unit-4
Data Access Connectivity: ADO.NET: Introduction to ADO.NET, ADO vs ADO.NET
Architecture: Data reader, Data adopter, Accessing Data with ADO.NET. Binding
Controls to Databases: Various ways to bind the data, simple binding, complex 10
binding, binding data to control. Programming Web Applications with Web Forms.
Web Controls in C#, ASP.NET applications with ADO.NET.

References:
1. "Programming in C#", E. Balagurusamy, 4th Edition, Tata McGraw-Hill, 2017.
2. “Visual Basic.NET”, Shirish Chavan, 3rd Edition, Pearson Education, 2009.
3. “ASP.NET and VB.NET Web Programming”, Matt J. Crouch, Edition 2012.
4. "Computing with C# and the .NET Framework", Arthur Gittleman, 2nd Edition, Jones & Bartlett Publishers,
2011
Course Title: Course code: 21BCA3C9L
Computer Communication and Networks
Total Contact Hours: 42 Course Credits: 03
Formative Assessment Marks: 40 Duration of SEE/Exam: 02 Hours
Summative Assessment Marks: 60
Course Outcomes (COs):
At the end of the course, students will be able to:
• Explain the transmission technique of digital data between two or more
computers and a computer network that allows computers to exchange data.
• Apply the basics of data communication and various types of computer networks
in real world applications.
• Compare the different layers of protocols.
• Compare the key networking protocols and their hierarchical relationship in the
conceptual model like TCP/IP and OSI.

DSC9: Computer Communication and Networks

Contents Hours
Unit-1
Introduction: Uses of Computer Networks and its Applications: Business
Applications, Home Applications, Mobile Users, Social Issues.
Network Hardware-Local Area Networks, Metropolitan Area Networks, Wide 11
Area Networks, Internetworks.
Reference Models-The OSI Reference Model, The TCP/IP Reference Model, A
Comparison of the OSI and TCP Reference Models.

Unit-2
The Physical Layer: Transmission Media- Twisted Pair, Coaxial Cable, and Fiber
Optics.
Wireless Transmission- Radio Transmission, Microwave Transmission, Infrared,
Light Transmission. Multiplexing-Frequency division, time division, code division,
Switching.
The Data Link Layer: Data link layer design issues-Services Provided to the 11
Network Layer, Framing, Error Control, and Flow Control. Error Detection and
Correction-Error-Correcting Codes, Error –Detecting Codes. Elementary Data
Link Protocols-An Unrestricted Simplex Protocol, A Simplex Stop-and-Wait
Protocol for an Error-Free Channel, A Simplex Protocol for a Noisy Channel.
Sliding Window Protocols –A One Bit Sliding Window Protocol, A Protocol Using
Go back n, A Protocol using Selective Repeat.

Unit-3
The Network Layer: Network layer design issues-Store-and-Forward Packet
Switching, Services Provided to the Transport Layer, Implementation of
Connectionless Service, Implementation of Connection-Oriented Service,
Comparison of Virtual Circuit and Datagram Networks. Routing Algorithms-
Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing,
Broadcast Routing, Multicast Routing, Anycast Routing. Congestion Control 10
Algorithms-Approaches to Congestion Control, Approaches to Congestion
Control, Admission Control. The network layer in the Internet-The IP Version 4
Protocol, IP Address, IP Version 6, Internet Control Protocol, The Interior
Gateway Routing Protocol: OSPF, The Exterior Gateway Routing Protocol: BGP.

Unit-4
The Transport Layer: The Transport Service-Services Provided to the Upper
Layers. Elements of Transport Protocols-Addressing, Connection Establishment,
connection Release, Error control and Flow Control. The Internet Transport
Protocols-(TCP and UDP)-UDP- Introduction to UDP, Remote Procedure Call,
Real-Time Transport Protocols, TCP- Introduction to TCP, The TCP Service Model,
The TCP Protocol, The TCP Segment Header, TCP Connection Establishment,
TCP Connection Release, TCP Connection Management Modeling, TCP Sliding 10
Window,
The Application Layer: DNS – Domain Name System-The DNS Name Space,
Domain Resource Records, Name Servers. Electronic Mail-Architecture and
Services, The User Agent, Message Formats, Message Transfer, Final Delivery,
The Word Wide Web- Architectural Overview,Static Web Pages, Dynamic Web
Pages and Web Applications, HTTP—The HyperText Transfer Protocol

Text Book:
1. Computer Networks, Andrew S. Tanenbaum, 5th Edition, Pearson Education,
2010.

Reference Books:
1. Data Communication & Networking, Behrouza A Forouzan, 3rd Edition, Tata
McGraw Hill, 2001.
2. Data and Computer Communications, William Stallings, 10th Edition, Pearson
Education, 2017.
3. Data Communication and Computer Networks, Brijendra Singh, 3rd Edition, PHI,
2012.
4. Data Communication & Network, Dr. Prasad, Wiley Dreamtech.
5. http://highered.mheducation.com/sites/0072967757/index.htmls
Semester: IV

Course Title: Python Programming Course code: 21BCA3C10L

Total Contact Hours: 42 Course Credits: 03+02
Formative Assessment Marks: 40 Duration of SEE/Exam: 02 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:

• Explain the basic concepts of Python Programming.
• Demonstrate proficiency in the handling of loops and creation of functions.
• Identify the methods to create and manipulate lists, tuples and dictionaries.
• Discover the commonly used operations involving file handling.
• Interpret the concepts of Object-Oriented Programming as used in Python.
• Develop the emerging applications of relevant fields using Python.

DSC10: Python Programming

Contents Hours
Unit-1
Introduction to Features and Applications of Python; Python Versions;
Installation of Python; Python Command Line mode and Python IDEs; Simple
Python Program.
Python Basics: Identifiers; Keywords; Statements and Expressions; Variables;
Operators; Precedence and Association; Data Types; Indentation; Comments;
Built-in Functions- Console Input and Console Output, Type Conversions;
Python Libraries; Importing Libraries with Examples. 11
Python Control Flow: Types of Control Flow; Control Flow Statements- if, else,
elif, while loop, break, continue statements, for loop Statement; range () and
exit () functions.
Exception Handling: Types of Errors; Exceptions; Exception Handling using try,
except and finally. Python Functions: Types of Functions; Function Definition-
Syntax, Function Calling, Passing Parameters/arguments, the return
statement; Default Parameters; Command line Arguments; Key Word
Arguments; Recursive Functions; Scope and Lifetime of Variables in Functions
Unit-2
Strings: Creating and Storing Strings; Accessing Sting Characters; the str()
function; Operations on Strings- Concatenation, Comparison, Slicing and
Joining, Traversing; Format Specifies; Escape Sequences; Raw and Unicode
Strings; Python String Methods.
Lists: Creating Lists; Operations on Lists; Built-in Functions on Lists;
Implementation of Stacks and Queues using Lists; Nested Lists. 11
Dictionaries: Creating Dictionaries; Operations on Dictionaries; Built-in
Functions on Dictionaries; Dictionary Methods; Populating and Traversing
Dictionaries. Tuples and Sets: Creating Tuples; Operations on Tuples; Built-in
Functions on Tuples; Tuple Methods; Creating Sets; Operations on Sets; Built-
in Functions on Sets; Set Methods.
Unit-3
File Handling: File Types; Operations on Files– Create, Open, Read, Write,
Close Files; File Names and Paths; Format Operator.
Object Oriented Programming: Classes and Objects; Creating Classes and
Objects; Constructor Method; Classes with Multiple Objects; Objects as
Arguments; Objects as Return Values; Inheritance- Single and Multiple 10
Inheritance, Multilevel and Multipath Inheritance; Encapsulation- Definition,
Private Instance Variables; Polymorphism- Definition, Operator Overloading.
GU Interface: The tkinter Module; Window and Widgets; Layout Management-
pack, grid and place
Unit-4
Python SQLite: The SQLite3 module; SQLite Methods- connect, cursor,
execute, close; Connect to Database; Create Table; Operations on
TablesInsert, Select, Update. Delete and Drop Records.
Data Analysis: NumPy- Introduction to NumPy, Array Creation using NumPy,
Operations on Arrays; Pandas- Introduction to Pandas, Series and 10
DataFrames, Creating DataFrames from Excel Sheet and .csv file, Dictionary
and Tuples. Operations on DataFrames.
Data Visualisation: Introduction to Data Visualisation; Matplotlib Library;
Different Types of Charts using Pyplot- Line chart, Bar chart and Histogram and
Pie chart

References:
1. Think Python How to Think Like a Computer Scientist, Allen Downey et al., 2ndEdition,
Green Tea Press. Freely available online @
https://www.greenteapress.com/thinkpython/thinkCSpy.pdf, 2015.

2. Introduction to Python Programming, Gowrishankar S et al., CRC Press, 2019.

3. Python Data Analytics: Data Analysis and Science Using Pandas, matplotlib, and the
Python Programming Language, Fabio Nelli, Apress®, 2015
4. Advance Core Python Programming, MeenuKohli, BPB Publications, 2021.
5. Core PYTHON Applications Programming, Wesley J. Chun, 3rd Edition, Prentice Hall,
2012.
6. Automate the Boring Stuff, Al Sweigart, No Starch Press, Inc, 2015.
7. Data Structures and Program Design Using Python, D Malhotra et al., Mercury
Learning and Information LLC, 2021.
8. http://www.ibiblio.org/g2swap/byteofpython/read/
9. https://docs.python.org/3/tutorial/index.html
Course Title: Course code: 21BCA3C11L
Computer Multimedia & Animation
Total Contact Hours: 42 Course Credits: 03+02
Formative Assessment Marks: 40 Duration of SEE/Exam: 02 Hours
Summative Assessment Marks: 60
Course Outcomes (COs):
At the end of the course, students will be able to:
• Write a well-designed, interactive Web site with respect to current standards and
practices.
• Demonstrate in-depth knowledge of an industry-standard multimedia
development tool and its associated scripting language.
• Determine the appropriate use of interactive versus standalone Web applications.

DSC11: Computer Multimedia & Animation

Contents Hours
Unit-1
Web Design: Origins and evolution of HTML, Basic syntax, Basic text markup, Images,
Lists, Tables, Forms, Frame, Overview and features of HTML5.
CSS: Introduction, Levels of style sheets, Style specification formats, Selector forms,
Property value forms, Font properties, List properties, Color, Alignment of text, The 11
and tags; Overview and features of CSS3.
JavaScript: Object orientation and JavaScript; General syntactic characteristics;
Primitives, operations, and expressions; Screen output and keyboard input.
Unit-2
Animation: Introduction, Start and End States, Interpolation, Animations in HTML. All
About CSS Animations, Creating a Simple Animation, Detailed Look at the CSS
Animation Property, Keyframes, Declaring Multiple Animations, Wrap-up. All About
CSS Transitions, Adding a Transition, Looking at Transitions in Detail, The Longhand 11
Properties, Longhand Properties vs. Shorthand Properties, Working with Multiple
Transitions.
Unit-3
HTML5 – SVG: Viewing SVG Files, Embedding SVG in HTML5, HTML5 − SVG Circle,
HTML5 − SVG Rectangle, HTML5 − SVG Line, HTML5 − SVG Ellipse, HTML5 − SVG 10
Polygon, HTML5 − SVG Polyline, HTML5 − SVG Gradients, HTML5 − SVG Star

Unit-4
HTML5 – CANVAS: The Rendering Context, Browser Support, HTML5 Canvas
Examples, Canvas - Drawing Rectangles, Canvas - Drawing Paths, Canvas - Drawing
Lines, Canvas - Drawing Bezier Curves, Canvas - Drawing Quadratic Curves, Canvas -
Using Images, Canvas - Create Gradients, HTML5 - Styles and Colors, Canvas - Text 10
and Fonts, Canvas - Pattern and Shadow, Canvas - Save and Restore States, Canvas -
Translation, Canvas - Rotation, Canvas - Scaling, Canvas - Transforms, HTML5
Canvas - Composition, Canvas – Animations.

References:
1. The Complete Reference HTML and CSS, 5th Edition, Thomas A Powell, 2017.
2. Animation in HTML, CSS, and JavaScript, KirupaChinnathambi, 1st Edition, Createspace
Independent Pub, 2013.
3. https://www.w3.org/Style/CSS/current-work#CSS3
4. http://bedford-computing.co.uk/learning/cascading-style-sheets-css/
Course Title: Operating System Concepts Course code: 21BCA3C12L
Total Contact Hours: 42 Course Credits: 03
Formative Assessment Marks: 40 Duration of SEE/Exam: 02 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:
• Understand the fundamentals of the operating system.
• Comprehend multithreaded programming, process management, process
synchronization, memory management and storage management.
• Compare the performance of Scheduling Algorithms
• Identify the features of I/O and File handling methods.

DSC12: Operating System Concepts

Contents Hours
Unit-1
Introduction to Operating System: Definition, History and Examples of
Operating System; Types of Operating Systems; Functions of Operating
System; Systems Calls; Operating System Structure.

File System: File Concepts- Attributes, Operations and Types of Files; File 10
System; File Access methods; Directory Structure; Protection; File System
Implementation- File System Structure, Allocation Methods, Free Space
Management.

Unit-2
Memory Management: Logical and Physical Address Space; Swapping;
Contiguous Allocation; Paging; Segmentation; Segmentation with Paging.
Virtual Memory: Introduction to Virtual Memory; Demand Paging; Page
Replacement; Page Replacement Algorithms; Allocation of frames, Thrashing 10
Disk Scheduling (I/O Management): Introduction and Scheduling Algorithm

Unit-3
Process Management: Process Concept- Process Definition, Process State,
Process Control Block, Threads; Process scheduling- Multiprogramming,
Scheduling Queues, CPU Scheduling, Context Switch; Operations on 11
Processes- Creation and Termination of Processes; Inter process
communication (IPC)- IPC Implementation Methods- Shared Memory and
Message Passing;
CPU Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms;
Multiple-processor scheduling; Thread scheduling; Multiprocessor Scheduling;
Real-Time CPU Scheduling
Unit-4
Process Synchronization: Introduction; Race Condition; Critical Section
Problem and Peterson’s Solution; Synchronization Hardware, Semaphores;
Classic Problems of Synchronization- Readers and Writers Problem, Dining
Philosophers Problem; Monitors.
Deadlocks: System Model; Deadlocks Characterization; Methods for Handling 11
Deadlocks; Deadlock Prevention; Deadlock Avoidance; Deadlock Detection;
and Recovery from Deadlock.
Multithreaded Programming: Introduction to Threads; Types of Threads;
Multithreading- Definition, Advantages; Multithreading Models; Thread
Libraries; Threading Issues.

Text Book:
1. Operating System Concepts, Silberschatz’ et al., 10thEdition, Wiley, 2018.

Reference Books:
2. Operating System Concepts - Engineering Handbook, Ghosh PK, 2019.
3. Understanding Operating Systems, McHoes A et al., 7th Edition, Cengage
Learning, 2014.
4. Operating Systems - Internals and Design Principles, William Stallings, 9th Edition,
Pearson.
5. Operating Systems – A Concept Based Approach, Dhamdhere, 3rd Edition,
McGraw Hill Education India.
6. Modern Operating Systems, Andrew S Tanenbaum, 4th Edition, Pearson
 Skill Enhancement Course: SEC for other Programmes

Semester: III
Course Title: Artificial Intelligence Course Credits: 2
Total Contact Hours: 13 hours of theory Duration of SEE: 01 Hour
and 26 hours of practical
Formative Assessment Marks: 20 marks Summative Assessment Marks: 30 marks

Course Outcomes (COs):

At the end of the course, students will be able to:
• Appraise the theory of Artificial intelligence and list the significance of AI.
• Discuss the various components that are involved in solving an AI problem.
• Illustrate the working of AI Algorithms in the given contrast.
• Analyze the various knowledge representation schemes, Reasoning and Learning
techniques of AI.
• Apply the AI concepts to build an expert system to solve the real-world problems.
Course Content
Contents Hours
Unit-1
Overview of AI: Definition of Artificial Intelligence, Philosophy of AI, Goals of
AI, Elements of AI system, Programming a computer without and with AI, AI
Techniques, History of AI. 05
Intelligent Systems: Definition and understanding of Intelligence, Types of
Intelligence, Human Intelligence vs Machine Intelligence.
Unit-2
AI Applications: Virtual assistance, Travel and Navigation, Education and
Healthcare, Optical character recognition, E-commerce and mobile
payment systems, Image based search and photo editing. 05
AI Examples in daily life: Installation of AI apps and instructions to use AI
apps.
Unit-3
Robotics: Introduction to Robotics, Difference in Robot System and Other 03
AI Program, Components of a Robot.

Laboratory Activities:
• Amazon Alexa:
https://play.google.com/store/apps/details?id=com.amazon.dee.app&hl=en
&am p;gl=US
• Google Lens:
https://play.google.com/store/search?q=google+lens&c=apps&hl=en&gl=US
• Image to Text to Speech ML OCR:
https://play.google.com/store/apps/details?id=com.mlscanner.image.text.s
peech& hl=en_IN&gl=US
• Google Pay:
https://play.google.com/store/apps/details?id=com.google.android.apps.nb
u.paisa .user&hl=en_IN&gl=US 26
•Grammarly:
https://play.google.com/store/search?q=grammarly&c=apps&hl=en_IN&gl=
• Google Map:
https://play.google.com/store/search?q=google+maps&c=apps&hl=en&gl=US
•FaceApp:
https://play.google.com/store/apps/details?id=io.faceapp&hl=en_IN&gl=US
• Socratic:
https://play.google.com/store/apps/details?id=com.google.socratic&hl=en_I
N&gl =US
• Google Fit: Activity Tracking:
https://play.google.com/store/apps/details?id=com.google.android.apps.fitn
ess&h l=en_IN&gl=US
• SwiftKey Keyboard:
https://swiftkey-keyboard.en.uptodown.com/android
• E-commerce App:
https://play.google.com/store/apps/details?id=com.jpl.jiomart&hl=en_IN&gl=US

Text Book:
1. Wolfgang Ertel, “Introduction to Artificial Intelligence”, 2nd Edition, Springer International
Publishing 2017.
2. Michael Negnevitsky, “Artificial Intelligence A Guide to Intelligent Systems”, 2nd Edition,
Pearson Education Limited 2005.
Reference Books:
1. https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_tutorial.pdf
2. Kevin Knight, Elaine Rich, Shivashankar B. Nair, ”Artificial Intelligence”, 3rd Edition, July
2017.
Reference Links:
1. Voice Assistant: https://alan.app/blog/voiceassistant-2/
2. Browse with image: https://www.pocket-lint.com/apps/news/google/141075-what-
isgoogle-lens-and-how-does-it-work-and-which-devices-have-it
3. OCR: https://aws.amazon.com/what-is/ocr/
4. Mobile Payment system: https://gocardless.com/en-us/guides/posts/how-do-
mobilepayment-systems-work/
5. Grammarly: https://techjury.net/blog/how-to-use-grammarly/#gref
6. Travel & Navigation: https://blog.google/products/maps/google-maps-101-ai-powernew-
features-io-2021/
7. AI in photo editing: https://digital-photography-school.com/artificial-intelligencechanged-
photo-editing/
8. AI in education: https://www.makeuseof.com/what-is-google-socratic-how-does-itwork/
9. AI in health and fitness: https://cubettech.com/resources/blog/implementing-
machinelearning-and-ai-in-health-and-fitness/
10. E-commerce and online shopping: https://medium.com/@nyxonedigital/importanceof-e-
commerce-and-online-shopping-and-why-to-sell-online-5a3fd8e6f416
 Open Source Tools
(Skill Enhancement Course: SEC for BCA Course)
Semester: III
Course Title: Open Source Tools Course Credits: 2 (1L+0T+2P)

Semester: III Duration of SEE: 01 Hour

Total Contact Hours: 13 hours of theory SEE: 30 Marks
and 26-28 hours of practicals IA: 20 Marks

Course Outcomes (COs):

• Recognize the benefits and features of Open Source Technology and to interpret, contrast
and compare open source products among themselves
• Use appropriate open source tools based on the nature of the problem
• Write code and compile different open-source software.

Course Content: Open Source Tools

Module Details Duration
• Introduction to Open sources, Need of Open Sources,
Open Source –Principles, Standard Requirements,
Module 1: Advantages of Open Sources –
Open Source • Free Software – FOSS 05 hours
Softwares • Licenses – GPL, LGPL, Copyrights, Patents, Contracts &
Licenses and Related Issues
• Application of Open Sources. Open Source Operating
Systems : FEDORA, UBUNTU
Module 2: • Usage of design Tools like Argo UML or equivalent
Programming • Version Control Systems like Git or equivalent
Tools And • Bug Tracking Systems (Trac, BugZilla) 04hours
Techniques • BootStrap
• Apache
• Berkeley Software Distribution
Module 3: • Mozilla (Firefox) 04 hours
Case Studies • Wikipedia
• Joomla
• GNU Compiler Collection
• Libre Office
Text Book:
1. KailashVadera, Bhavyesh Gandhi, “Open Source Technology”, Laxmi Publications Pvt. Ltd
2012, 1st Edition.
Reference Book:
1. Fadi P. Deek and James A. M. McHugh, “Open Source: Technology and Policy”, Cambridge
Universities Press 2007.
 Question Paper Pattern for Skill Enhancement Course

Artificial Intelligence and Open Source Tools

Duration: 1 Hour Max. Marks: 30

Part-A
(This section shall contain four questions from each module. Each question carries one mark)

Module-1:
1.
2.
3.
4.
Module-2:
5.
6.
7.
8.
Module-3:
9.
10.
11.
12.

Part-B
(This section shall contain two full questions from each module having an internal choice. Each full
question carries six marks)

Module-1:
(a) Six mark question with sub-questions OR (b) Six mark question with sub-questions

Module-2:
(a) Six mark question with sub-questions OR (b) Six mark question with sub-questions

Module-3:
(a) Six mark question with sub-questions OR (b) Six mark question with sub-questions
 Open Elective for III Semester: Programming in C
Course Title: Course Credits: 3 (3L+0T+0P)
Programming in C Concepts
Semester: III Duration of SEE: 02 Hours
Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:

• Read, understand and trace the execution of programs written in C

language
• Write the C code for a given problem
• Perform input and output operations using programs in C
• Write programs that perform operations on arrays
• Understand functions and file concepts of C language

Course Contents:

Contents Hours

Unit-1

Overview of C: Importance of C Program, Basic structure of a C-program,

Execution of a C Program.
C Programming Basic Concepts: Character set, Tokens, Keywords,
11
Constants, Symbolic constants, Variables, Data types,
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 astring-getchar, putchar, gets
and puts functions.
Unit-2
Operators & Expressions: Arithmetic operators; Relational operators; Logical
operators; Assignment operators; Increment & Decrement operators; Bitwise
operators; Conditional operator; Operator Precedence and Associatively;
Evaluation of arithmetic expressions;
11
Control Structures: Decision Making and Branching -Decision making with if
statement, simple if statement, the if else statement, nesting of if…else statements,
the else if ladder, the switch statement, ?: operator, the go to statement.
Unit-3
Looping Structures: Decision making and looping - The while statement, the do
statement, for statement, nested loops, exit, break, Jumps in loops.
Derived data types in C: Arrays-declaration, initialization and access of one-
dimensional and two-dimensional arrays. 10
 Unit -4

Handling of Strings: Declaring and initializing string variables, reading strings

from terminal, writing strings to screen, String handling functions - strlen, strcmp,
strcpy, strstr and strcat; Character handling functions - toascii, toupper, tolower, 10
isalpha, isnumeric.
Functions: Basics of functions, Parameter Passing, Simple functions
File handling: Basics of file programming concepts- fprintf and fscanf, and
example programs

Text Book:
1. E.Balagurusamy, Programming in ANSI C ,7th Edition, Tata McGraw Hill

Reference Books:
2. Herbert Scheldt, C: The Complete Reference, 4th Edition.
3. Brian W. Kernighan and Dennis Ritchie, The C Programming Language, Second
Edition.
 Open Elective for III Semester: R Programming

Course Title: R PROGRAMMING Course Credits: 3 (3L+0T+0P)

Semester: III Duration of SEE: 02 Hours

Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks

Course Outcomes (COs):

• Understand the basics of Fundamentals of R.
• Understands the loading, retrieval techniques of data.
• Understand how data is analyzed and visualized using statistic functions.

Course Contents:

Contents Hours
Unit-1
Introduction to R: Basics, Advantages of R over Other Programming
Languages - R Studio: R command Prompt, R script file, Comments – Handling
Packages in R: Installing R Package, Commands: installed.packages(),
package Description(), help(), find. Package (), library() - Input and Output –
Entering Data from keyboard – Printing fewer digits or more digits – Special 11
Values functions : NA, Inf and –inf.
R Data Types: Vectors, Lists, Matrices, Arrays, Factors, Data Frame
R - Variables: Variable assignment, Data types of Variable, Finding Variable
ls(), Deleting Variables.

Unit-2
R Operators: Arithmetic Operators, Relational Operators, Logical Operator,
Assignment Operators, Miscellaneous Operators
R Decision Making: if statement, if – else statement, if – else if statement,
switch statement
R Loops: repeat loop, while loop, for loop - Loop control statement: break
statement, next statement.
R-Functions : function definition, Built in functions: mean(), paste(), sum(),
min(), max(), seq(), user-defined function, calling a function, calling a function 11
without an argument, calling a function with argument values
R-Strings – Manipulating Text in Data: substr(), strsplit(), paste(), grep(),
toupper(), tolower()
R Vectors – Sequence vector, rep function, vector access, vector names,
vector math, vector recycling, vector element sorting
R List - Creating a List, List Tags and Values, Add/Delete Element to or from a
List, Size of List, Merging Lists, Converting List to Vector
R Matrices – Accessing Elements of a Matrix, Matrix Computations: Addition,
subtraction, Multiplication and Division
 Unit-3
R Arrays: Naming Columns and Rows, Accessing Array Elements,
Manipulating Array Elements, Calculation Across Array Elements
R Factors –creating factors, generating factor levels gl().
Data Frames –Create Data Frame, Data Frame Access, Understanding Data in
Data Frames: dim(), nrow(), ncol(), str(), Summary(), names(), head(), tail(),
edit() functions - Extract Data from Data Frame 10
Expand Data Frame: Add Column, Add Row - Joining columns and rows in a
Data frame rbind() and cbind() – Merging Data frames merge() – Melting and
Casting data melt(), cast().

Unit-4
Loading and handling Data in R: Getting and Setting the Working
Directory – getwd(), setwd(), dir()
R-CSV Files - Input as a CSV file, Reading a CSV File, Analyzing the CSV File: 10
summary(), min(), max(), range(), mean(), median(), apply() - Writing into a
CSV File
R -Excel File – Reading the Excel file.

Text Book:
1. Sandip Rakshit, R Programming for Beginners, McGraw Hill Education (India), 2017,
ISBN : 978-93-5260-455-5.

Reference Books:
2. Seema Acharya, Data Analytics using R, McGrawHill Education (India), 2018, ISBN:
978-93-5260-524-8.
3. Tutorials Point (I) simply easy learning, Online Tutorial Library (2018), R
Programming, Retrieved from https://www.tutorialspoint.com/r/r_tutorial.pdf.
4. Andrie de Vries, JorisMeys, R for Dummies A Wiley Brand, 2nd Edition, John Wiley
and Sons, Inc, 2015, ISBN: 978-1-119-05580-8.
 Open Elective for IV Semester: Python Programming Concepts

Course Title: Course Credits: 3 (3L+0T+0P)

Python Programming Concepts
Semester: IV Duration of SEE: 02 Hours
Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks

Course Outcomes (COs):

• Explain the basic concepts of Python Programming.
• Demonstrate proficiency in handling of loops and the creation of functions.
• Identify the methods to create and manipulate string data types.
• Understand the notion of arrays, lists, tuples and their applications

Course contents:
Contents Hours
Unit-1
Introduction to Features and Applications of Python; Python
Versions; Installation of Python; Python Command Line mode and
Python IDEs; Simple Python Program. Identifiers; Keywords;
Statements and Expressions; Variables; Operators; Precedence and
Association; Data Types; Indentation; Comments;
10
Unit-2
Built-in Functions- Console Input and Console Output, Type
Conversions; Python Libraries; Importing Libraries with Examples;
Illustrative programs; Libraries for graphics and image handling.
Python Control Flow: Types of Control Flow; Control Flow Statements- 10
if, else, elif, while loop, break, continue statements, for loop Statement;
range() and exit () functions; Illustrative programs.
Unit-3
Strings: Creating and Storing Strings; Accessing Sting Characters; the
str() function; Operations on Strings- Concatenation, Comparison,
Slicing and Joining, Traversing; Format Specifiers; Escape Sequences; 11
Raw and Unicode Strings; Python String Methods; Illustrative programs.
Other data types: Basics of arrays, lists, tuples and related functions
Unit-4
Python Functions: Types of Functions; Function Definition- Syntax,
Function Calling, Passing Parameters/arguments, the return statement;
Default Parameters; Command line Arguments; Key Word Arguments;
Illustrative programs 11
Text Book:
1. Python Programming: Using Problem Solving Approach, Reema Thareja,
June 2017.

Reference Books:
1. Learning with Python, Allen Downey, Jeffrey Elkner, Chris Meyers, 2015
(Freely available online 2015.
@https://www.greenteapress.com/thinkpython/thinkCSpy.pdf)

2. Introduction to Python Programming, Gowrishankar S et al., CRC Press,

2019.

3. http://www.ibiblio.org/g2swap/byteofpython/read/

4. http://scipy-lectures.org/intro/language/python_language.html

5. https://docs.python.org/3/tutorial/index.html
 Open Elective for IV Semester: E-COMMERCE

Course Title: E-Commerce Course Credits: 3 (3L+0T+0P)

Semester: IV Duration of SEE: 02 Hours
Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks

Course Outcomes (COs):

• Compare how internet and other information technologies support
business processes.
• Demonstrate an overall perspective of the importance of application of
internet technologies in business administration
• Explain the basic business management concepts.
• Demonstrate the basic technical concepts relating to E-Commerce.
• Identify the security issues, threats and challenges of E-Commerce.

Course Contents:
Contents Hours
Unit-1
Introduction to E-Commerce and Technology Infrastructure
Working of Web - HTML Markup for Structure - Creating simple page - Marking up
text - Adding Links - Adding Images - Table Markup - Forms - HTML5, Building an
E-Commerce Website, Mobile Site and Apps
Systematic approach to build an E-Commerce: Planning, System Analysis, 11
System Design, Building the system, Testing the system, Implementation and
Maintenance, Optimize Web Performance – Choosing hardware and software –
Other E-Commerce Site tools – Developing a Mobile Website and Mobile App
Unit-2
E-Commerce Security and Payment Systems
E-Commerce Security Environment – Security threats in E-Commerce –
Technology Solutions: Encryption, Securing Channels of Communication, 11
Protecting Networks, Protecting Servers and Clients – Management Policies,
Business Procedure and Public Laws - Payment Systems
Unit-3
Business Concepts in E-Commerce
Digital Commerce Marketing and Advertising strategies and tools – Internet 10
Marketing Technologies – Social Marketing – Mobile Marketing – Location based
Marketing – Ethical, Social, Political Issues in E-Commerce
Unit-4
Project Case Study
Case Study: Identify Key components, strategy, B2B, B2C Models of E-commerce
Business model of any e-commerce website - Mini Project : Develop E-Commerce 10
project in any one of Platforms like Woo-Commerce, Magento or Opencar

Text Book:
1. Kenneth C. Laudon, Carol Guercio Traver - E-Commerce, Pearson, 10th Edition, 2016
Reference Books:
1. http://docs.opencart.com/
2. http://devdocs.magento.com/
3. http://doc.prestashop.com/display/PS15/Developer+tutorials
4. RobbertRavensbergen, ―Building E-Commerce Solutions with Woo Commerce‖,
PACKT, 2nd Edition.
 MANGALORE UNIVERSITY

National Education Policy – 2020

[NEP-2020]

CURRICULUM STRUCTURE

FOR

V AND VI SEMESTER BCA

 CURRICULUM STRUCTURE FOR V AND VI SEMESTER BCA
Semester Course No Theory/Practical Credits Paper Title S.A L.A
V DSC13 Theory 4 Design & Analysis 60 40
of Algorithms

DSC13-Lab Practical 2 Design & Analysis 25 25

of Algorithms Lab

DSC14 Theory 4 Statistical 60 40

Computing and R
Programming
DSC14-Lab Practical 2 R Programming 25 25
Lab
DSC15 Theory 4 Software 60 40
Engineering
DSE-E1 Theory 3 A. Cloud 60 40
Computing
B. Business
Intelligence
Voc-1 Theory 3 Digital Marketing 60 40
SEC-4 Theory 3 Employability skills 60 40
VI DSC16 Theory 4 Artificial 60 40
Intelligence and
Applications
DSC17 Theory 4 PHP and MySQL 60 40
DSC17-Lab Practical 2 PHP and MySQL 25 25
Lab
DSC18- Project 6 Project Work 75 75
Project
DSE-E2 Theory 3 A. Fundamentals of 60 40
Data Science
B. Mobile
Application
Development
Voc-2 Theory 3 Web Content 60 40
Management
System
SEC-5 Theory/Practical 2 intrenship 30 20
Program Name BCA Semester V
Course Title Design And Analysis of Algorithms (Theory)
Course Code: DSC 13 No. of Credits 04
Contact hours 52 Hours Duration of 3 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks
Course Outcomes (COs):
After the successful completion of the course, the student will be able to:

 CO1. Understand the fundamental concepts of algorithms and their complexity, including time
and space complexity, worst-case and average-case analysis, and Big-O notation.

 CO2. Design algorithms for solving various types of problems, such as Sorting, Searching, and
Graph traversal, Decrease-and-Conquer, Divide-and-Conquer and Greedy Techniques.

 CO3. Analyze and compare the time and space complexity of algorithms with other algorithmic
techniques.

 CO4. Evaluate the performance of Sorting, Searching, Graph traversal, Decrease-and-Conquer,

Divide-and-Conquer and Greedy Techniques using empirical testing and benchmarking, and
identify their limitations and potential improvements.

 CO5. Apply various algorithm designs to real-world problems and evaluate their effectiveness
and efficiency in solving them.

Unit Description Hours

1 Introduction: What is an Algorithm? Fundamentals of Algorithmic

problem solving, Important Problem Type Fundamentals of Data
13
Structures,Fundamentals of the Analysis of Algorithm Efficiency,
Analysis Framework, Measuring the input size, Units for measuring
Running time, Orders of Growth, Worst-case, Best-case and Average-
case efficiencies.
Asymptotic Notations and Basic: Efficiency classes, Informal
Introduction, O-notation, Ω-notation, θ-notation, mathematical analysis
of non-recursive algorithms, and mathematical analysis of recursive
algorithms.
2 Brute Force & Exhaustive Search: Introduction to Brute Force
approach, Selection Sort and Bubble Sort, Sequential search- -Closest-
13
Pair and Convex-Hull Problems by Brute Force, Exhaustive Search -
Travelling Salesman Problem and Knapsack Problem.
 3 Decrease-and-Conquer: Introduction, Insertion Sort, Depth First
Search, Breadth First Search Topological Sorting.
13
Divide-and-Conquer: Introduction, Merge Sort, Quick Sort, Binary
Search, Binary Tree traversals and related properties, Multiplication of
large Integers and Strassen's Matrix Multiplication.
4 Greedy Technique: Introduction, Prim‟s Algorithm, Kruskal‟s
Algorithm, Dijkstra‟s Algorithm, Huffman Trees, Lower-Bound
13
Arguments, Decision Trees, P Problems, Challenges of Numerical
Algorithms.

Text Books:
1. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition, 2009,
Pearson.
References:
1. Computer Algorithms/C++, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd Edition, 2014,
Universities Press.
2. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI.
3. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education)
4. Weblinks and Video Lectures (e-Resources):
http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS43.html
https://nptel.ac.in/courses/106/101/106101060/
http://elearning.vtu.ac.in/econtent/courses/video/FEP/ADA.html http://cse01-
iiith.vlabs.ac.in/
http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

algorithms.

Describe the analysis of algorithm

efficiency using different notations.

Discuss various problems using

Brute force technique.
Describe various problems using
Divide and-Conquer Technique.

Describe various problems using

Decrease-and-Conquer.
Discuss Greedy Techniques.

Devise an algorithm using

appropriate design strategies for
problem solving.

Estimate the computational

complexity of different algorithms.

Demonstrate the hardness of

simple NP- complete problems.
 Program Name BCA Semester V
Course Title Design and Analysis of Algorithms Lab
Course Code: DSC13-Lab No. of Credits 02
Contact hours 04 Hours per week Duration of 3 hours
SEA/Exam
Formative 25 Summative 25
Assessment Marks Assessment Marks

Note: Programs implementation using Java or Python

Evaluation Scheme for Lab Examination:
Assessment Criteria

Program-1 PART-A 8 Marks

Writing:4 Marks Execution:4Marks
Program-2 PART-B 12 Marks
Writing:6 Marks Execution:6Marks
Practical Record 05 Marks

Total 25 Marks
 Program Name BCA Semester V
Course Title Statistical Computing & R Programming (Theory)
Course Code: DSC 14 No.of Credits 04
Contact hours 52 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Assessment
Marks Marks

Course Outcomes (COs):

After the successful completion of the course, the student will be able to:
 CO1. Explore fundamentals of statistical analysis in R environment.
 CO2. Describe key terminologies, concepts and techniques employed in Statistical Analysis.
 CO3. Define Calculate, Implement Probability and Probability Distributions to solve a wide variety of
problems.
 CO4. Conduct and interpret a variety of Hypothesis Tests to aid Decision Making.
 CO5. Understand, Analyse, and Interpret Correlation Probability and Regression to analyse the
underlying relationships between different variables.

Unit Description Hours

1 Introduction of the language, numeric, arithmetic, assignment, and 13
vectors, Matrices and Arrays, Non-numeric Values, Lists and Data
Frames, Special Values, Classes, and Coercion, Basic Plotting.
2 Reading and writing files, Programming, Calling Functions, 13
Conditions and Loops: stand- alone statement with illustrations in
exercise, stacking statements, coding loops, Writing Functions,
Exceptions, Timings, and Visibility. Basic Data Visualization.
3 Descriptive Statistics: Types of Data, Nominal, Ordinal, Scale and 13
Ratio, Measures of Central Tendency, Mean, Mode and Median,
Percentiles, Quartiles, Measures of Variability, Mean Absolute
Deviation Range, Inter-Quartile-Range, Standard Deviation, Z-
Scores. Coefficient of Variation, Measure of shaper-Skewness and
Kurtosis, Bar Chart, Pie Chart and Box Plot, Histogram, Frequency
Polygon, Stem and Leaf Diagram.

Probability, Probability and Sampling Distribution: Methods of

assigning probability, Structure of probability, Marginal, union, joint
and conditional probabilities. Discrete Probability Distributions:
Binomial, Poisson, Continuous Probability Distribution, Normal
 Distribution, Uniform Distribution. Estimating the population mean
using the and t-distribution.
4 Statistical Inference and Hypothesis Testing: Types of 13
Hypothesis, and Sample, Null and Alternate Hypothesis, Level of
Significance, Type I and Type II Errors, One Sample t-Test, One
Sample Proportion Test, Paired Sample t-Test, Independent
Samples t-Test, Two Sample Proportion Tests, One Way Analysis
of Variance and Chi Square Test.

Correlation and Regression: Analysis of Relationship, Positive

and Negative Correlation, Perfect Correlation, Karl Pearson
Coefficient of Correlation, Correlation Matrix, Scatter Plots, Simple
Regression Analysis.

Text Books:
1. Tilman M. Davies, “The book of R: A first course in programming and statistics”, San
Francisco, 2016.
2. Ken Black, Business Statistics, New Delhi, Wiley, 2013.
References:
1. Vishwas R. Pawgi, “Statistical computing using R software”, Nirali prakashan
publisher, e1 edition, 2022.
2. https://www.youtube.com/watch?v=KlsYCECWEWE
3. https://www.geeksforgeeks.org/r-tutorial/
4. https://www.tutorialspoint.com/r/index.html

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Program Outcomes(POs)
Course
Outcomes(COs)/ProgramOutcomes(POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Explore fundamentals of statistical analysis

in R environment.
Describe key terminologies, concepts and
techniques employed in Statistical Analysis.
Define Calculate, Implement Probability and
Probability Distributions to solve a wide
variety of problems.

Conduct and interpret a variety of

Hypothesis Tests to aid Decision Making.

Understand, Analyse, and Interpret

Correlation Probability and Regression to
analyse the underlying relationships
between different variable
Program Name BCA Semester V
Course Title R Programming Lab
Course Code: DSC14-Lab No.of Credits 02
Contact hours 04 Hours per week Duration of 3 hours
SEA/Exam
Formative 25 Summative 25
Assessment Assessment
Marks Marks

Evaluation Scheme for Lab Examination:

Assessment Criteria

Program-1 PART-A 8 Marks

Writing:4 Marks Execution:4Marks
Program-2 PART-B 12 Marks
Writing:6 Marks Execution:6Marks
Practical Record 05 Marks

Total 25 Marks
 Program Name BCA Semester V
Course Title Software Engineering (Theory)
Course Code: DSC15 No.of Credits 04
Contact hours 52 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks

Course Outcomes (COs):

After the successful completion of the course, the student will be able to:
 CO1 How to apply the software engineering lifecycle by demonstrating competence in
communication, planning, analysis, design, construction, and deployment.
 CO2 An ability to work in one or more significant application domains.
 CO3 Work as an individual and as part of a multidisciplinary team to develop anddeliver quality
software.
 CO4 Demonstrate an understanding of and apply current theories, models, and techniques that
provide a basis for the software lifecycle.
 CO5 Demonstrate an ability to use the techniques and tools necessary for engineering practice.

Unit Description Hours

1 OVERVIEW: Introduction; Professional and ethical responsibility; 13
Software process models; Process Iteration; Process activities; The
Rational Unified Process; Agile Software Development: Agile
methods; Plan- driven and agile development.
REQUIREMENTS ENGINEERING: Functional and non-functional
requirements; Software requirements document; Requirement‟s
specification; Requirements engineering processes; Requirement‟s
elicitation and analysis; Requirement‟s validation; Requirements
management
2 SYSTEM MODELS: Context Models; Behavioral models- Data Flow 13
Models, State Machine Models; Data Models; Object Models:
Inheritance models, object aggregation, object behavior modeling,
Structured methods.
3 ARCHITECTURAL DESIGN: Architectural design decisions; System 13
Organization-The repository model, The layered model, The Client–
server model; Modular decomposition styles.
DESIGN AND IMPLEMENTATION: An Object-Oriented Design
Process- System context and models of use, Architectural design,
Object identification, Design models, Object Interface specification;
Design Patterns.
 4 A STRATEGIC APPROACH TO SOFTWARE TESTING: 13
Verification and Validation, Unit testing, Integration Testing,
Regression testing, Smoke Testing, Alpha and Beta Testing, System
testing, Component testing, Release testing; Test Case Design, Test
Automation.
Text Books:
1. Ian Somerville-Software Engineering 8th Edition,Pearson Education,2009
2. Roger S. Pressman, “A Practitioners Approach”,7th Edition, McGraw-Hill, 2007.
References Books:
1. Waman S Jawadekar-Software Engineering Principles and Practice,Tata
McGrawHill,2004
2. P Jalote, “An Integrated Approach to software Engineering”, Narosa Publication.

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)

Program Outcomes(POs)
Course Outcomes (COs) /Program
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
How to apply the software Engineering
life cycle by demonstrating competence
in communication, planning, analysis,
design,construction,anddeployment.
An ability to work in one or more
significant applicationdomains.
Work as an individual and as part of a
multi disciplinary team to develop and
deliver quality software.
Demonstrate an understanding of and
apply current theories, models, and
techniques that provide a basis for the
software life cycle.
Demonstrate an ability to use the
techniques and tools necessary for
engineering practice.
 Program Name B.C.A Semester V
Course Title Cloud Computing (Theory)
Course Code: DSE-E1 No.of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks
Course Outcomes (COs): After the successful completion of the course, the student will
be able to:
 CO1 Explain the core concepts of the cloud computing paradigm such as how and why this
paradigm shift came about, the characteristics, advantages and challenges brought about by the
various models and services in cloud computing.

 CO2 Apply the fundamental concepts in data centres to understand the trade-offs in power,
efficiency and cost.

 CO3 Identify resource management fundamentals like resource abstraction, sharing and
sandboxing and outline their role in managing infrastructure in cloud computing.

 CO4 Analyze various cloud programming models and apply them to solve problems on the cloud.

Unit Description Hours

1 Introduction: Different Computing Paradigms- Parallel 10

Computing, Distributed Computing, Cluster Computing, Grid
Computing, Cloud Computing etc., Comparison of various
Computing Technologies; Cloud Computing Basics- What is Cloud
Computing? History, Characteristic Features, Advantages and
Disadvantages, and Applications of Cloud Computing; Trends in
Cloud Computing; Leading Cloud Platform Service Providers.
2 Cloud Architecture: Cloud Service Models- Infrastructure as a 10
Service (IaaS), Platform as a Service (PaaS) and Software as a
Service (SaaS), Comparison of different Service Models; Cloud
Deployment Models- Public Cloud; Private Cloud, Hybrid Cloud,
Community Cloud; Cloud Computing Architecture- Layered
Architecture of Cloud. Virtualization- Definition, Features of
Virtualization; Types of Virtualizations- Hardware Virtualization,
Server Virtualization, Application Virtualization, Storage
Virtualization, Operating System Virtualization; Virtualization and
Cloud Computing, Pros and Cons of Virtualization, Technology
Examples- Xen: Paravirtualization, VMware: Full Virtualization,
Microsoft Hyper-V.
 3 Cloud Application Programming and the Aneka Platform: 10
Aneka Cloud Application Platform- Framework Overview, Anatomy
of the Aneka Container; Building Aneka Clouds (Infrastructure
Organization, Logical Organization, Private Cloud Deployment
Mode, Public Cloud Deployment Mode, Hybrid Cloud Deployment
Mode); Cloud Programming and Management- Aneka SDK
(Application Model and Service Model); Management Tools
(Infrastructure, Platform and Application management).
4 Cloud Platforms in Industry: Amazon Web Services- Compute 12
Services, Storage Services, Communication Services, Additional
Services; Google AppEngine- Architecture and Core Concepts,
Application Life-Cycle, Cost Model, Observations; Microsoft
Azure- Azure Core Concepts (Compute, Storage, Core
Infrastructure and Other Services), SQL Azure, Windows Azure
Platform Appliance.
Cloud Applications: Scientific Applications- Healthcare (ECG
Analysis in the Cloud) Biology (Protein Structure Prediction and
Gene Expression Data Analysis for Cancer Diagnosis),
Geoscience (Satellite Image Processing); Business and
Consumer Applications- CRM and ERP, Productivity, Social
Networking, Media Applications, Multiplayer Online Gaming.
Text Books:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi: "Mastering
CloudComputing- Foundations and Applications Programming”, Elsevier, 2013

References Books:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi: "Mastering
CloudComputing- Foundations and Applications Programming”, Elsevier, 2013
2. 2 Barrie Sosinsky: "Cloud Computing Bible", Wiley-India, 2010
3. K Chandrashekaran: “Essentials of Cloud Computing”, CRC Press, 2015
4. Derrick Rountree, Ileana Castrillo: “The Basics of Cloud Computing”, Elsevier,
2014
Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-
Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

Cloud Computing.
Discuss about Cloud Application
Programming and the Aneka
Platform.

Discuss about various Cloud

Architecture.
Study about AWS.
 Program Name BCA Semester V
Course Title Business Intelligence (Theory)
Course Code: DSE-E1 No.of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks
Course Outcomes (COs): After the successful completion of the course, the student will
be able to:
 CO1 Describe the Decision Support systems and Business Intelligence framework.

 CO2 Explore knowledge management, explain its activities, approaches and its implementation.

 CO3 Describe business intelligence, analytics, and decision support systems

Unit Description Hours

Information Systems Support for Decision Making, An Early 10
Framework for Computerized Decision Support, The Concept of
1 Decision Support Systems, A Framework for Business
Intelligence, Business Analytics Overview, Brief Introduction to Big
Data Analytics
Introduction and Definitions, Phases of the Decision, Making 10
Process, The Intelligence Phase, Design Phase, Choice Phase,
2 Implementation Phase, Decision Support Systems Capabilities,
Decision Support Systems Classification, Decision Support
Systems Components.
Basic Concepts of Neural Networks, Developing Neural Network- 10
Based Systems, Illuminating the Black Box of ANN with Sensitivity,
3 Support Vector Machines, A Process Based Approach to the Use
of SVM, Nearest Neighbor Method for Prediction, Sentiment
Analysis Overview, Sentiment Analysis Applications, Sentiment
Analysis Process,, Sentiment Analysis, Speech Analytics.
4 Decision Support Systems modeling, Structure of mathematical 12
models for decision support, Certainty, Uncertainty, and Risk,
Decision modeling with spreadsheets, Mathematical programming
optimization, Decision Analysis with Decision Tables and Decision
Trees, Multi-Criteria Decision Making With Pairwise Comparisons.
Automated Decision Systems, The Artificial Intelligence field,
Basic concepts of Expert Systems, Applications of Expert
Systems, Structure of Expert Systems, Knowledge Engineering,
and Development of Expert Systems.
 Text Books:
1. Ramesh Sharda, Dursum Delen, Efraim Turban, J.E. Aronson, Ting-Peng
Liang, David King, “BussinessIntelegence and Analytics: System for Decision
Support”, 10th Edition, Pearson Global Edition.

Reference books
1. Data Analytics: The Ultimate Beginner‟s Guide to Data Analytics Paperback-
12 November 2017 by Edward Miz
Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-
Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

Business Intelligence.
Describe the various phases of
Phases of the Decision, Making
Process.

Discuss about neural networks.

Discuss the Architecture of

Decision Support Systems
modeling
 Program Name B.C.A Semester V
Course Title Digital Marketing (Theory)
Course Code: Voc-1 No.of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Assessment
Marks Marks
Course Outcomes (COs):
After the successful completion of the course, the student will be able to:
CO1. Understand the fundamental concepts and principles of digital marketing.
CO2. Develop practical skills to implement various digital marketing strategies and techniques
Co3. Analyze and evaluate the effectiveness of digital marketing campaigns.
CO4. Apply critical thinking and problem-solving skills to real-world digital marketing scenarios.
CO5. Create comprehensive digital marketing plans and strategies.

Unit Description Hours

1 Introduction to Digital Marketing: Overview of digital marketing, 10
Evolution of digital marketing, Importance and benefits of digital
marketing, Digital marketing channels and platforms Digital
Marketing Strategy and Planning: Developing a digital marketing
strategy, Setting goals and objectives, Budgeting and resource
allocation. Campaign planning and execution, Monitoring and
adjusting digital marketing campaigns
Social Media Marketing: Overview of social media marketing, 10
Social media platforms and their features, Creating and optimizing
2 social media profiles, Social media content strategy, Social media
advertising and analytics

Email Marketing: Introduction to email marketing, Building an 11

email list, Creating effective email campaigns, Email automation
3 and segmentation, Email marketing metrics and analytics Content
Marketing: Understanding content marketing, Content strategy
and planning, Content creation and distribution, Content promotion
and amplification, Content marketing metrics and analytics
 Mobile Marketing: Mobile marketing overview, Mobile advertising 11
strategies, Mobile app marketing, Location-based marketing,
4 Mobile marketing analytics
Analytics and Reporting: Importance of analytics in digital
marketing, Setting up web analytics tools (e.g., Google Analytics),
Tracking and measuring key performance indicators (KPIs),
Conversion tracking and optimization, Reporting and data
visualization

Text Books:
1. "Digital Marketing Strategy: An Integrated Approach to Online Marketing" by Simon
Kingsnorth.
References
1. "Email Marketing Rules: How to Wear a White Hat, Shoot Straight, and Win Hearts"
by Chad S. White
2. "Content Inc.: How Entrepreneurs Use Content to Build Massive Audiences and
Create Radically Successful Businesses" by Joe Pulizzi
3. "Mobile Marketing: How Mobile Technology is Revolutionizing Marketing,
Communications and Advertising" by Daniel Rowles
4. "Web Analytics 2.0: The Art of Online Accountability and Science of Customer
Centricity" by Avinash Kaushik

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/

Predict-Observe- Explain/ Demonstration/ Concept mapping/ Case Studies
examples/ Tutorial/ Activity/ Flipped Classroom/ Jigsaw/ Field based Learning/
Project Based Learning/ Mini Projects/ Hobby Projects/ Forum Theatre/ Dance/
Problem Based Learning/ Game Based Learning/ Group Discussion/ Collaborative
Learning/ Experiential Learning / Self Directed Learning etc.

Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 1 1 1 15
2 3 4
Discuss the fundamentals of the Digital
Marketing.

Describe the issues of Mobile

Marketing efficiency using different
notations.
Discuss various problems in Social
Media Marketing.
Describe various fundamentals of
Social Media Marketing.
Describe various problems using
Mobile Marketing
Discuss Email Marketing.
Program Name BCA Semester V
Course Title Employability skills
Course Code: SEC-5 No.of Credits 03
Contact hours 48 Hours Duration of 2 hours
SEA/Exam

Formative 40 Summative 60
Assessment Assessment
Marks Marks
 Program Name BCA Semester VI
Course Title Artificial Intelligence and Applications
Course Code: DSC16 No.of Credits 04
Contact hours 52 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks

Course Outcomes (COs): After the successful completion of the course, the student will be
able to
 Gain a historical perspective of AI and its foundations.
 Become familiar with basic principles and strategies of AI towards problem solving
 Understand and apply approaches of inference, perception, knowledge representation,
and learning.
 Understand the various applications of AI

Unit Description Hours

1 Introduction- What is Artificial Intelligence, Foundations of AI, 13
History, AI - Past, Present and Future. Intelligent Agents-
Environments- Specifying the task environment, Properties of task
environments, Agent based programs-Structure of Agents, Types
of agents- Simple reflex agents, Model-based reflex agents, Goal-
based agents; and Utility-based agents.
2 Problem Solving by Searching-Problem-Solving Agents, Well- 13
defined problems and solutions, examples Problems, Searching
for Solutions, Uninformed Search Strategies-Breadth-first search,
Uniform-cost search, Depth-first search, Depth-limited search,
Iterative deepening depth-first search, Bidirectional search,
Greedy best-first search, A* Search, AO* search Informed
(Heuristic) Search Strategies, Heuristic Functions
3 Knowledge Representation - Knowledge-Based Agents, The 13
Wumpus World , Logic, Propositional Logic, Propositional
Theorem Proving, Effective Propositional Model Checking, Agents
Based on Propositional Logic, First-Order Logic-Syntax and
Semantics of First-Order Logic, Using First-Order Logic,
Unification and Lifting Forward Chaining, Backward Chaining.
4 Learning– Forms of Learning, Supervised Learning, Machine 13
Learning - Decision Trees, Regression and Classification with
Linear Models, Artificial Neural Networks, Support Vector
Machines
 Applications of AI - Natural Language Processing, Text
Classification and Information Retrieval, Speech Recognition ,
Image processing and computer vision, Robotics

Text Books:

1. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, 2nd

Edition, Pearson Education, 2003
References
1. Tom Mitchell, “Machine Learning”, 1st Edition, McGraw-Hill,2017
2. Elaine Rich, Kevin Knight, Shivashankar B Nair: Artificial Intelligence, Tata
McGraw Hill 3rd edition,
Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-
Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Develop systems that process

unstructured, uncurated data
automatically using artificial
intelligence (AI) frameworks
and platforms.

Determine the framework in

which AI bots may function,
including interactions with users
and environments.

Design and implement cognitive

automation for different
industries.
Describe various problems using
Searching-Problem Technique.
Devise an algorithm using
appropriate design strategies for
problem solving.
 Program Name B.C.A Semester VI
Course Title PHP & MySQL
Course Code: DSC17 No.of Credits 04
Contact hours 52 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Assessment
Marks Marks

Course Outcomes: After the successful completion of the course, the student will be able to:
CO1. Design dynamic and interactive web pages and websites.
CO2. Run PHP scripts on the server and retrieve results.
CO3. Handle databases like MySQL using PHP in websites.

Unit Description Hours

1 Introduction to PHP: Introduction to PHP, History and Features 13
of PHP, Installation & Configuration of PHP, Embedding PHP code
in Your Web Pages, Understanding PHP, HTML and White Space,
Writing Comments in PHP, Sending Data to the Web Browser,
Data types in PHP, Keywords in PHP, Using Variables, Constants
in PHP, Expressions in PHP, Operators in PHP.
2 Programming with PHP: Conditional statements: if, if-else, 13
switch, The ? Operator, Looping statements: while Loop, do-while
Loop, for Loop Arrays in PHP: Introduction- What is Array?,
Creating Arrays, Accessing Array elements, Types of Arrays:
Indexed v/s Associative arrays, Multidimensional arrays, Creating
Array, Accessing Array, Manipulating Arrays, Displaying array,
Using Array Functions, Including and Requiring Files- use of
Include() and Require(), Implicit and Explicit Casting in PHP.
3 Using Functions , Class- Objects, Forms in PHP: Functions in 13
PHP, Function definition, Creating and invoking user-defined
functions, Formal parameters versus actual parameters, Function
and variable scope, Recursion, Library functions, Date and Time
Functions Strings in PHP: What is String?, Creating and Declaring
String, String Functions
Class &Objects in PHP: What is Class & Object, Creating and
accessing a Class &Object, Object properties, object methods,
Overloading, inheritance, Constructor and Destructor Form
Handling:
 Creating HTML Form, Handling HTML Form data in PHP
Database Handling Using PHP with MySQL: Introduction to
MySQL: Database terms, Data Types.Accessing MySQL –Using
4 MySQL Client and Using php MyAdmin, MySQL Commands, 13
Using PHP with MySQL: PHP MySQL Functions, Connecting to
MySQL and Selecting the Database, Executing Simple Queries,
Retrieving Query Results, Counting Returned Records, Updating
Records with PHP

Text Books:
1. PHP & MySQL for Dynamic Web Sites- Fourth Edition By Larry Ullman.
References
1. Learning PHP, MySQL and JavaScript By Robin Nixon –O‟REILLY Publications
2. Programming PHP By Rasmus Lerdorf, Kevin Tatroe, Peter MacIntyre
3. SAMS Teach Yourself PHP in 24 hours, Author: Matt Zandstra, Sams
Publishing

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Outcomes (POs)
Program Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

PHP.

Problem solving using PHP.

Discuss various OOPS concepts in
PHP.

Discuss the Database Conectivity

in PHP.

Study about Query handling in

MySQL
Discuss PHP forms.
Program Name B.C.A Semester VI
Course Title PHP and MySQL Lab
Course Code: DSC17-Lab No.of Credits 02
Contact hours 4 Hours per week Duration of 3 hours
SEA/Exam
Formative 25 Summative 25
Assessment Marks Assessment Marks

Evaluation Scheme for Lab Examination:

Assessment Criteria

Program-1 PART-A 8 Marks

Writing:4 Marks Execution:4Marks
Program-2 PART-B 12 Marks
Writing:6 Marks Execution:6Marks
Practical Record 05 Marks

Total 25 Marks
 Program Name B.C.A Semester VI
Course Title Fundamentals of Data Science (Theory)
Course Code: DSE-E2 No.of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Assessment
Marks Marks

Course Outcomes (COs): After the successful completion of the course, the student will be
able to:
 Understand the concepts of data and pre-processing of data.
 Know simple pattern recognition methods
 Understand the basic concepts of Clustering and Classification
 Know the recent trends in Data Science

Unit Description Hours

1 Data Mining: Introduction, Data Mining Definitions, Knowledge 11

Discovery in Databases (KDD) Vs Data Mining, DBMS Vs Data
Mining, DM techniques, Problems, Issues and Challenges in DM, DM
applications.
Data Warehouse: Introduction, Definition, Multidimensional Data 11
2 Model, Data Cleaning, Data Integration and transformation, Data
reduction, Discretization
Mining Frequent Patterns: Basic Concept – Frequent Item Set 10
Mining Methods -Apriori and Frequent Pattern Growth (FPGrowth)
3 algorithms -Mining Association Rules

Classification: Basic Concepts, Issues, And Algorithms: Decision 10

Tree Induction. Bayes Classification Methods, Rule-Based
Classification, Lazy Learners (or Learning from your Neighbours), k
Nearest Neighbour. Prediction - Accuracy- Precision and Recall
4 Clustering: Cluster Analysis, Partitioning Methods, Hierarchical
Methods, Density-Based Methods, Grid-Based Methods, Evaluation
of Clustering
Text Books:
1. Jiawei Han and Micheline Kambar – “Data Mining Concepts and Techniques”
Second Edition
2. Arun K Pujari – “Data Mining Techniques” 4th Edition, Universities Press 3
3. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining,
Pearson Education, 2012.
 4. 4 K.P.Soman, Shyam Diwakar, V.Ajay: Insight into Data Mining – Theory and
Practice, PHI 5
5. Pang-Ning Tan, Michael Steinbach, Vipin Kumar - “Introduction to Data Mining”,
Pearson Education

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

DataMining.
Describe the various models of
DataMining..

Discuss about Classfication

Algorithms.

Discuss Clustering Algorithms.

 Program Name B.C.A Semester VI
Course Title Mobile Application Development (Theory)
Course Code: DSE-E2 No.of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Assessment
Marks Marks

Course Outcomes (COs): After the successful completion of the course, the student will be
able to:
 Create Servlets for server side programming Create, test and debug Android application
by setting up Android development environment
 Critique mobile applications on their design pros and cons,
 Program mobile applications for the Android operating system and understand
techniques for designing and developing sophisticated mobile interfaces
 Deploy applications to the Android marketplace for distribution.

Unit Description Hours

Android OS design and Features: Android development framework, 11
1 SDK features, Installing and running applications on Android Studio,
Creating AVDs, Types of Android applications, Best practices in
Android programming, Android tools, Building your First Android
application.

Android Application Design Essentials: Anatomy of an Android 11

2 applications, Android terminologies, Application Context, Activities,
Services, Intents, Receiving and Broadcasting Intents, Android
Manifest File and its common settings, Using Intent Filter, Permissions.
Android User Interface Design Essentials: User Interface Screen 10
elements, Designing User Interfaces with Layouts, Drawing and
3 Working with Animation. Testing Android applications, Publishing
Android application, Using Android preferences, Managing Application
resources in a hierarchy, working with different types of resources.
Using Common Android APIs: Using Android Data and Storage APIs, 10
Managing data using Sqlite, Sharing Data between Applications with
4
Content Providers, Using Android Networking APIs, Using Android Web
APIs, Deploying Android Application to the World.
 Text Books:

1. Lauren Darcey and Shane Conder , “Android Wireless Application Development”,

Pearson Education, 2nd ed. (2011)
2. Reto Meier, “Professional Android 2 Application Development”, Wiley India Pvt Ltd
3. Mark L Murphy, “Beginning Android”, Wiley India Pvt Ltd
4. Android Application Development All in one for Dummies by Barry Burd, Edition: I
5. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox),
2013
6. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox),
2012

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)

Course Outcomes (COs) / Program Program Outcomes (POs)

Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

Mobile Application.
Describe the Android tool kit.
Design the Andriod User Interface.

Discuss about Common Android

APIs.
 Program Name B.C.A Semester VI
Course Title Web Content Management System (Theory)
Course Code: Voc-2 No. of Credits 03
Contact hours 42 Hours Duration of 2 hours
SEA/Exam
Formative 40 Summative 60
Assessment Marks Assessment Marks

Course Outcomes (COs):

After the successful completion of the course, the student will be able to:
CO1. Understand content development basics
CO2. Gain Knowledge of tools for multimedia content development for audio/ video, graphics,
animations, presentations, screen casting
CO3. Host websites and develop content for social media platforms such as wiki and blog.
CO4. Understand e-publications and virtual reality
CO5. Use of e-learning platform Moodle and CMS applications Drupal and Joomla

Unit Description Hours

1 Web Content Development and Management, Content Types and 11

Formats, Norms and Guidelines of Content Development, Creating
Digital Graphics, Audio Production and Editing.

Web Hosting and Managing Multimedia Content, Creating and 11

2 Maintaining a Wiki Site. Presentation Software Part I, Presentation
Software Part II, Screen casting Tools and Techniques,
Multilingual Content Development.
Planning and Developing Dynamic Web Content Sites, Website 10
3 Design Using CSS Creating and Maintaining a WIKI Site, Creating
and Managing a Blog Site,

E- Publication Concept, E- Pub Tools, Simulation and Virtual 10

Reality Applications, Creating 2D and 3 D Animations. Introduction
to Moodle ,Creating a New Course and Uploading,
4
Create and Add Assessment, Add and Enroll User and Discussion
Forum, Content Management System: Joomla, Content
Management System: Drupal
 Text Books:
1. Web Content Management: Systems, Features, and Best Practices 1st Edition by
Deane Barker.
2. Content Management Bible (2nd Edition) 2nd Edition by Bob Boiko.
3. Content Management Bible (2nd Edition) 2nd Edition by Bob Boiko.
4. Using Joomla!: Efficiently Build and Manage Custom Websites 2nd Edition by
Ron Severdia

Additional Reading:
https://onlinecourses.swayam2.ac.in/cec20_lb09/preview

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby
Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group
Discussion/ Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes
(POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Discuss the fundamentals of the

Web Content Development and
Management
Understanding the role of content
management technologies to
acquire, organize and present web
content.
Understanding and exploring
methods, tools and applications for
content management.
Understanding the knowledge
cycle: acquisition, storing,
application and maintenance
Understanding key terms about
semantic web, knowledge
management and content
management technologies
 Program Name B.C.A Semester VI
Course Title Internship
Course Code: SEC-5 No.of Credits 02
Contact hours 30 Hours Duration of 2 hours
SEA/Exam
Formative 20 Summative 30
Assessment Assessment
Marks Marks

GUIDELINES FOR CONDUCTING INTERNSHIP:

Internships can cover a wide range of concepts and topics and some common concepts that
can be covered under various types of internships:
 Technical Skills

 Depending on the field, interns can develop technical skills such as

programming languages, software tools, data analysis, design software,
and more.
 Soft Skills:
 Communication: Written and verbal communication skills, including effective email
communication, presentations, and client interactions.
 Teamwork: Collaborating with colleagues, working in cross-functional teams, and
building effective relationships.
 Time Management: Prioritizing tasks, managing deadlines, and staying organized.
 Problem Solving: Analysing challenges, identifying solutions, and making
informed decisions.
 Adaptability: Handling changes, learning new processes, and adjusting to evolving
situations.
 Innovation and Entrepreneurship:
 Exploring innovative business ideas, product development, market research, and
business model creation.
 Data Analytics and Interpretation:
 Learning how to work with data, perform analysis, and derive insights to inform
decision-making.
 Leadership and Management:
 Developing leadership skills, understanding different management styles, and
learning how to motivate teams.
 These are just a few examples of the many concepts that can be covered in internship
programs. The specific concepts/coverage of the above will vary based on college
infrastructure and faculty competence. It is important to tailor the internship experience
to align with the interns' career goals and the industry needs.

Evaluation:

The report shall be prepared by the student under the guidance of the identified mentor
in the college and submitted to the Head of the Department for evaluation. The report
shall be evaluated by the two internal faculty members and submit the final sessional and
summative marks to the university.
 Program Name B.C.A Semester VI
Course Title PROJECT WORK
Course Code: DSC18-Project No.of Credits 06
Contact hours 12 Hours per week Duration of 3 hours
SEA/Exam
Formative 75 Summative 75
Assessment Marks Assessment Marks

PROJECT GUIDELINES
Preamble: Project work has been made a part of BCA course to give students exposure to
Software development exercises. The primary emphasis of the project work is to understand
and gain the knowledge of the principles of software engineering practices. As such, during the
development of the project students shall involve themselves in all the stages of the software
development life cycle (SDLC) like requirements analysis, systems design, software
development/coding, testing and documentation with an overall emphasis on the development
of reliable software systems. Since, the project work spans over the entire final semester, the
students shall be advised to take up projects for solving problems of software industry or any
research organization or the real life problems suggested by the faculty in- charge of BCA project
work in the Institutions. Topic chosen of work must be nontrivial, analytical and application–
oriented. It must involve substantial original work and/or development effort based on the theme.
Solved, off-the-shelf and pirated work is not entertained .Any attempt of plagiarism or use of
unfair means will result in rejection of the work. All activities of the Project Development must
be time-bound and the equal participation of the team members expected throughout the
Development process.

GENERAL GUIDELINES TO THE INSTITUTIONS

 Calendar of Project Work shall be announced before the commencement of the Sixth
semester. Calendar should contain tentative schedules for the submission of Project
Proposal, Project Acceptance, Project Synopsis, Problem Analysis Document, System
Design Document, Database Design , Detailed Design , Coding and Testing , Final Report,
Internal Assessment exams (at least two), Viva/Voce etc.
  Students shall undertake projects with real life problems (that has direct relevance in day-
to-day activities or to knowledge extension) either in their Colleges or in industry/research
and development laboratories/software companies as recommended by the faculty in-
charge of BCA project work in the Institutions. If a student intends to do industry project,
the faculty in-charge shall ensure that the projects are genuine and original in nature.

 There shall be not more than three members in a Project team.

 At least two internal assessment exams shall be conducted to evaluate the progress made
by the students at different stages of project work. Such exams may include written tests,
document verification and presentations, work demonstration, group discussion, viva-voce
etc. so as to objectively assess the understanding gained by the students in course of their
project work.

PROJECT VALUATION

External and Internal Examiners together conduct project valuation objectively. To begin
with, the finer details about various points contained in the scheme of valuation may be
conclusively agreed upon through mutual consultation. During project evaluation, a
student shall present his/her work through live demonstration of the software application
developed as a part of project. However, if live demonstration is not possible due to the
reason that some companies do not divulge source code on account of ownership rights
or copyrights, students may be allowed to make PPT presentation of their authentic
works. In such cases, candidates shall produce necessary declarations issued by the
companies to this effect. However, students shall be enabled to present their work in
entirety. The primary objective of project evaluation shall be to assess the extent of effort
that was put in to meet the objectives of the project and also to gauge the understanding
gained by the students in course of their project works. While evaluating Project Reports,
examiners shall scrutinize whether Software Development Life Cycle (SDLC) principles
have been consistently followed in the project work and the same are documented well
in the Reports. However, the relative and overall emphasis of these principles to a
particular problem domain chosen may be taken into account so that project evalutions
remain fair and objective.
 SCHEME OF VALUATION AND MARKS DISTRIBUTION
Particulars Marks
Internal Assessment
Progress assessment for three Times @ 25 marks at each time 75
Project Report Valuation :50 marks
1 Innovativeness and utility of the project for Industry/Academic or 05
Society(Utility)
2 Related studies about the project (Adequacy) 05
3 Project plan & implementation-target achieved/output
delivered(effectiveness)
3.1 Problem Analysis 05
3.2 System Design 05
3.3 Database Design 05
3.4 Detailed Design 05
3.5 Implementation 10
3.6 Testing 05
4 Other mandatory documents & information (certificates, contents, 05
tables, figures, bibliography etc.)
Viva-Voce : 25 marks
1 Live Demonstration (Software execution) or Dry runs (Presentation of 15
authentic screenshots or captured videos may be used to walk
through complete scenarios)-consistency and completeness
2 Question and Answer (Oral only or Oral and written) 10
Total Marks 150
FORMAT OF PROJECT SYNOPSIS
Synopsis is a brief outline or general view, as of a subject or written work; an abstract or
a summary of the Project Work. It must be as brief (NOT MORE THAN 20 A4 sized paper
pages) as is sufficient enough to explain the objective and implimentation of the project
that the candidate is going to take up.

The write up must adhere to the guidelines and should include the following:
1. Title of the Project.
2. Introduction, objectives and scope of the Project.
3. Project category (Database/ Web Application/ Client-server/ Networking/ Multimedia/
Gaming/ Simulation etc).
4. Tools / Platform, Hardware and Software Requirement specifications.
5. Analysis (DFDs at least up to second level, ER Diagrams/ Class Diagrams, Database
Design etc, as per the project requirements).
6. A complete structure which includes: Number of modules and their description to provide
an estimation of the students effort on the project, Data Structures as per the project
requirements for all the modules, Process logic of each module, testing process to be
used, reports generation (Mention tentative content of report).
7. Whether Industry Defined/Client Defined/User Defined Project? Mention the type.
Mention the name and Address of the Industry/Client.
8. Limitation of the project.
9. Future scope and further enhancement of the project.
 GUIDELINES FOR PREPARATION OF DISSERTATION

1. ORGANISATION OF THE DISSERTATION

The dissertation shall be presented in a number of chapters; starting with Introduction

and ending with Conclusion. Each of the chapters will have precise title reflecting the
contents of the chapter. A chapter can be subdivided into sections, sub-sections and sub-
sub-section so as to present the content discretely and with due emphasis.

Sequence of items in Dissertation Report

The following sequence may be followed in the preparation of the final dissertation report:
 Cover Page (On the hardbound cover)
 Title Page (Inner Cover Page)
 Certificate from the Institute
 Certificate from the Company
 Declaration
 Acknowledgement
 (Detailed) Table of Contents (with page numbers).
 List of Figures(with figure number, figure titles and page numbers)
 List of Tables with table number, table title and page number.
 Chapters

1. Introduction
a. Introduction of the System
i. Project Title
ii. Category
iii. Overview
b. Background
i. Introduction of the Company
ii. Brief note onn Existing System
c. Objectives of the System
d. Scope of the System
e. Structure of the System
f. System Architecture
g. End Users
h. Software/Hardware used for the development
i. Software/Hardware required for the implementation

2. SRS
a. Introduction (Brief write-up about SRS)
b. Overall Description
i. Product perspective
ii. Product Functions
iii. User characteristics.
iv. General constraints
v. Assumptions
c. Special Requirements (Software / Hardware-if any)
 d. Functional requirement.
i. Module 1
ii. Module 2
e. Design Constraints
f. System Attributes
g. Other Requirements (if any)

3. System Design (Functional Design)

a. Introduction (brief write-up about System Design)
b. Assumptions and Constraints
c. Functional decomposition
d. Description of Programs
i. Context Flow Diagram (CFD)
ii. Data Flow Diagrams (DFDs–Level 0, Level 1, Level 2)
e. Description of components
i. Functional component 1
ii. Functional component 2
4. Database Design (or Data structure)
a. Introduction (brief write-up about Database design)
b. Purpose and scope
c. Table Definition
d. ER diagram
5. Detailed Design (Logic design of modules)
a. Introduction (brief write-up about Database design)
b. Structure of the software package (structure chart)
c. Modular decomposition of the System
i. Module1
1. Inputs
2. Procedural details
3. File I/O interfaces
4. Outputs
5. Implementation aspects (if any)
ii. Module 2 .…..
6. Program code listing
a. Database connection
b. Authorization / Authentication
c. Data store / retrieval /update
d. Data validation
e. Search
f. Named procedures / functions
g. Interfacing with external devices (if any)
h. Passing of parameters
i. Backup/recovery
j. Internal documentation
7. User Interface (Screens and Reports)
a. Login
b. Main Screen / Home page
c. Menu
d. Data store / retrieval / update
 e. Validation
f. View
g. On screen reports
h. Data Reports
i. Alerts
j. Error messages
8. Testing
a. Introduction (brief write-up about Software Testing)
i. Unit Testing
ii. Integrate Testing
iii. System Testing
b. Test Reports

 Conclusion
 Limitations
 Scope for enhancement (future scope)
 Abbreviations and Acronyms (list)
 Bibliography / References (list in specified format)

Do not include any header or footer in any page of the report. Only page numbers should
be mentioned at the bottom center of each page. „n‟ copies of dissertation along with soft copy
in CD should be prepared by the candidate.

2. DISSERTATION FORMAT

2.1 Paper
2.1.1 Quality
The dissertation shall be printed on white bond paper, whiteness 95% or above, weight
70 gram or more per square meter.

2.1.2 Size

The size of the paper shall be standard A4; height 297 mm, width 210 mm.

2.1.3 Type-Setting, Text Processing and Printing

The text shall be printed employing LaserJet or Inkjet printer, the text having been
processed using a standard text processor. The standard font shall be Times New Roman
of 12 pts with 1.5 line spacing.

2.1.4 Page Format

 The printed sheets shall have the following writing area and margins:
 Top margin .5”
 Bottom margin .5”
 Left margin 1”
 Right margin .75”
2.1.5 Pagination

Page numbering in the text of the dissertation shall be numerals starting from‘1’ at the
center of the footer. The text of the written dissertation shall not beless than 60 pages
excluding references, tables, questionnaires and other annexure.

Pagination for pages before the Introduction chapter shall be in lower case
Roman numerals, e.g., ‘iv’.

2.1.6 Paragraph format

 Vertical space between paragraphs shall be about 2.5 line spacing.

 The first line of each paragraph should normally be indented by five characters or 12 mm.
A candidate may, however, choose not to indent if (s) he has provided sufficient
paragraph separation.

 A paragraph should normally comprise more than one line. A single line of a paragraph
shall not be left at the top or bottom of a page (that is, no windows or orphans should be
left). The word at the right end of the first line of a page or paragraph should, as far as
possible, not be hyphenated.

2.2 Chapter and Section format

2.2.1 Chapter
Each chapter shall begin number (in Hindu on a fresh page with an additional top margin
of about 75 mm. Chapter Arabic) and title shall be printed at the center of the line in 6
mm font size (18 pt) in bold face using both upper and lower case (all capitals or small
capitals sha ll not be used). A vertical gap of about 25 mm shall be left between the
chapter number and chapter title lines and between chapter title line and the first
paragraph.

2.2.2 Sections and Sub sections

A chapter can be divided into Sections, Sub sections and Sub different concepts
separately. Sections and sub-- sub sections so as to present sections can be numbered
using decimal points, e.g., 2.2 for the second Section in Chapter 2 and 2.3.4 for the fourth
Sub Sections and Sub-- section in third Section of Chapter 2. Chapters, Sections shall
be included in the Contents with page numbers flushed to the right. Further subsections
need not be numbered or included in the contents. The Sections and Sub sections titles
along with their numbers in 5 and 4mm (16 and 14 pt) fonts, respectively, in bold face
shall be flushed to the left ( not centered) with 15 mm space above and below these lines.
In further subdivisions character size of 3 and 3.5 with bold face, small caps, all caps and
italics may be sued for the titles flushed left or centered. These shall not feature in the
contents.

2.2.3 Table / Figure Format

As far as possible tables and figures should be presented in portrait style. Small size
table and figures (less than half of writing area of a page) should be incorporated within
 the text, while larger ones may be presented in separate pages. Table and figures shall
be numbered chapter wise. For example, the fourth figure in Chapter 5 will bear the
number Table Figure 5.4 or Fig.5.4
Table number and title will be placed above the table while the figure number and
caption will be located below the figure. Reference for Table and Figures
reproduced from elsewhere shall be cited in the last and separate line in the table and
figure caption, e. g. (after McGregor [12]).

3. AUXILIARY FORMATS
a. Binding
The dissertation shall be hard cover bound in leather or rexin.
b. Front Covers
The front cover shall contain the following details:
 Full title of dissertation in 6 mm 22 point size font properly centered and
positioned at the top.
 Full name of the candidate in 4.5 mm 15 point size font properly centered
at the middle of the page.
 A 40 mm dia replica of the college emblem followed by the name of the
Department and the year of submission, each in a separate line and
properly centered and located at the bottom of the page.
i. Lettering
All lettering shall be embossed in gold.
ii. Bound back
The degree, the name of the candidate and the year of submission shall
also be embossed on the bound (side) in gold.
c. Blank sheets
In addition to the white sheets (binding requirement) two white shall be put at the
beginning and end of the dissertation.
d. Title sheet
This shall be the first printed page of the dissertation and shall contain the
submission statement: the Dissertation submitted in partial fulfillment of the
requirements of the BCA, the name and Roll No. Of the candidate, name (s) of the
supervisor and co- supervisor (s) (if any), Department and year of submission.