THE MAHATMA GANDHI UNIVERSITY

Bachelor in Computer Applications (Honours)

SYLLABUS

MGU-BCA (Honours)
(2024 Admission Onwards)

Faculty: Technology and Applied Sciences

Expert Committee: Computer Application (UG)

Programme: Bachelor in Computer Applications (Honours)

Mahatma Gandhi University

Priyadarshini Hills
Kottayam – 686560, Kerala, India

Page 1 of 21
 Contents

Sl.No Title

1 External Experts & Expert Committee

2 Scheme of First Semester BCA (Honours)

3 Semester 1 Course 1 Fundamentals of Programming Using C

4 Semester 1 Course 2 Digital Fundamentals

5 Semester 1 Course 3 Software Lab in C

6 Semester 1 Course 4 Discrete Mathematics

7 Semester 1 Course 5 Cyber Laws and Security

Page 2 of 21
 External Experts

Prof. (Dr.) Bindu V R, Professor and Head, School of Computer Sciences, Mahatma Gandhi
1
University, Kottayam

Prof. (Dr.) Sabu M K, Professor, Department of Computer Applications, Cochin University

2
of Science and Technology, Kochi

Members of the Expert Committee in Computer Application (UG)

Dr. Rajimol A, Associate Professor, Department of Computer Applications, Marian College

1
Kuttikkanam (Autonomous), Kuttikkanam (Chairperson UG Board)

Dr. Ajitha R S, Assistant Professor, Department of Computer Applications, NSS College,

2
Rajakumari
Mr. Bineesh Jose, Assistant Professor, Department of Computer Applications, Pavanatma
3
College, Murickassery

Dr. Reji K Kollinal, Assistant Professor, Department of Computer Applications, BPC

4
College, Piravom

Ms. Simi M, Associate Professor, Department of Computer Applications, SAS SNDP

5
Yogam College, Konni

Ms. Ambili M S, Assistant Professor, Department of Computer Science, Sree Sankara

6
Vidyapeetom College, Valayanchirangara

Ms. Bindhu Prabha, Associate Professor, Department of Computer Applications, SAS

7
SNDP Yogam College, Konni

Dr. Leena C Sekhar, Associate Professor, Department of Computer Applications, MES

8
College, Marampally

Dr. Juby George, Assistant Professor, Department of Computer Applications, Marian

9
College, Kuttikkanam

Dr. Sowmya M R, Assistant Professor, Department of Computer Science, Sree Sankara

10
College, Kalady

Mr. Biju Kumar S P, Assistant Professor, Department of Computer Applications, NSS

11
College Rajakumari, Idukki (Dist)

Page 3 of 21
 First Semester

Type of Hour
Hours
the Distribution
Course Code Title of the Course Credit /
Course /week
week
.
L T P O
MG1DSCBCA100 Fundamentals of DSC 4 4 4 0 0 0
Programming using C
MG1DSCBCA101 Digital Fundamentals DSC 4 4 4 0 0 0
MG1DSCBCA102 Software lab in C DSC 2 4 0 0 4 0
MG1DSCBCA103 Discrete Mathematics DSC 4 4 4 0 0 0
MG1MDCBCA100 Cyber Laws and MDC 3 3 3 0 0 0
Online Safety
AEC- ENGLISH AEC 1 3 3 3 0 0 0
AEC-OL AEC 2 3 3 3 0 0 0

Page 4 of 21
 Mahatma Gandhi University
Kottayam
Programme BCA (Honours)
Course Name Fundamentals of Programming Using C
Type of Course DSC
Course Code MG1DSCBCA100
Course Level 100
This course covers fundamental concepts in computer programming,
including algorithms, flowcharts, programming languages, control flow
Course
structures, arrays, and functions, emphasizing practical implementation
Summary
through a series of hands-on exercises. Students will gain proficiency in
solving problems using the C programming language.

Semester 1 Credits 4
Total Hours
Lecture Tutorial Practical Others
Learning
Course Details
Approach
4 0 0 0 60

Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Demonstrate basic programming concepts. U 1

Understand C Programming Basics such as Datatypes and

2 U 2
Variables, Different types of operators.

Devise C programs using the concept of Decision

3 An 2
statements and loop control statements.

Apply logic to use arrays and functions in C Programming

4 Language. A 1

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 5 of 21
COURSE CONTENT
Content for Classroom transactions (Units)

Module Units Course description Hrs CO No.

Problem Solving Life Cycle – Understanding the Problem

Statement, Analysing the problem,
Planning Program design using Hierarchy charts, Top-
down approach, Bottom-up approach.
1.1 6 1
Understanding basic Problem-Solving Tools: Algorithms:
Definition & its attributes, Flowchart: Definition & its
attributes, symbols, Statements: Input-Output, Decision-
1 Making &Looping, Module representation
Introduction to Programming: Computer program.
Classification of computer languages: machine, assembly
1.2 and high-level languages, Language translators 4 1
(Assembler, Compiler, Interpreter), Linker, Testing and
debugging,
Types of errors- Syntax errors, Logical errors and Runtime
1.3 2 1
errors.
C Character Set, Delimiters, Types of Tokens, C
2.1 Keywords, Identifiers, Constants, Variables, Rules for 2 2
defining variables,
Data types, C data types, Declaring and initialization of
2.2 variables, Type modifiers, Type conversion, Operators 5 2
2 and Expressions-
Properties of operators, Priority of operators, Comma and
2.3 conditional operator, Arithmetic operators, Relational 3 2
operators,

Assignment operators and expressions, Logical

2.4 4 2
Operators, Bitwise operators.

3 Input and Output in C – Formatted functions,

3.1 5 3
unformatted functions, commonly used library functions,
Decision Statements If, if-else, nested if-else, if-else-if
3.2 ladder, break, continue, goto, switch, nested switch, 6 3
switch case and nested if.

Loop control- for loops, nested for loops, while loops, do

3.3 6 3
while loop.

4 Array, initialization, array terminology, characteristics of

4.1 5 4
an array, one dimensional array and operations,

Page 6 of 21
 Two dimensional arrays and operations. Strings and
4.2 standard functions, Introduction to pointers. 6 4
Basics of a function, function definition, return statement,
Types of functions, call by value and reference. Recursion
- Rules for recursive function, Advantages and
disadvantages of recursion. Storage class, Structure and
4.3 6 4
union, Features of structures, Declaration and
initialization of structures, typedef, enumerated data
types, Union.

5 Teacher Specific Module

Classroom Procedure (Mode of transaction)

Teaching
and Learning • Use of ICT tools in conjunction with traditional classroom teaching
methods
Approach
• Interactive sessions
• Class discussions

MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

Assessment
Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments
3. Quiz
B. Semester End Examination

ESE for Theory: Written Test (70 Marks, 2 Hrs)

Part A: Very Short Answer Questions (Answer all) - (10*2=20 Marks)

Part B: Short Answer Questions (5 out of 7 Questions) - (5*6=30 Marks)

Part C: Essay Questions (2 out of 3 Questions) - (2*10=20 Marks)

Page 7 of 21
REFERENCES
1. Balagurusamy, E. (2019), “Programming in ANSI C” (8th ed.), Tata McGraw Hill.
2. Hanly J. R. and Koffman E. B. (2007), “Problem Solving and Program Design in C” (7th ed.),
Pearson Education.
SUGGESTED READINGS
1. Gottfried, B. S. (2018). “Programming with C" (4th ed.). Schaum’s Outline Series, TMH.
2. Pradeep K. Sinha and Priti Sinha (2004), “Computer Fundamentals -Concepts, Systems &
Applications”, 8th Edition, BPB Publications.

Page 8 of 21
 Mahatma Gandhi University
Kottayam
Programme BCA (Honours)

Course Name Digital Fundamentals

Type of Course DSC

Course Code MG1DSCBCA101

Course Level 100

Course Summary This course covers the fundamentals of digital electronics, including
number systems, Boolean algebra, logic gates, combinational logic
circuits, and sequential logic circuits. Students gain a comprehensive
understanding of digital logic design principles and their applications
Through theoretical concepts and practical examples.

Semester 1 Credits 4 Total

Course Details Learning Lecture Tutorial Practical Others Hours
Approach
4 0 0 0 60

Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Demonstrate comprehension of number systems. U,A 2

Analyse working of logic gates, solve expressions using laws
2 An,A 1,2
of Boolean algebra.
Illustrate the combinational logic circuits using
3 U,An 1,3
multiplexers, demultiplexers and other circuits

4 Design sequential circuits using flip flops and registers An,A 1,2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 9 of 21
COURSE CONTENT
Content for Classroom transactions (Units)

CO
Module Units Course description Hrs
No.
Number Systems, Introduction – Base or radix, Non-positional
and Positional number system, Popular number systems
1.1 (Decimal, Binary, Octal and Hexadecimal), Conversion-From 8 1
1 one number system to another, Concept of binary addition and
subtraction, 1’s Complement, 2’s complement.
1.2 BCD numbers- concept and 8421 additions 2 1

2.1 Logic gates- AND, OR, NOT, NAND, NOR, XOR and XNOR. 5 2
Truth tables and graphical representation.

2.2 Basic laws of Boolean Algebra, Simplification of Expressions, 5 2

DeMorgan’s theorems,

2.3 Dual expressions, Canonical expressions. Minterms and 4

2 Maxterms, SOP and POS expressions

2.4 Simplification of expressions using K-MAP (up to 4 variables) 5 2

2.5 Representation of simplified expressions using NAND/NOR 4 2

Gates, Don’t care conditions

3.1 Combinational Logic Circuits: Adders-Half adder, Full adder 7 3

3 3.2 5 3
Encoders, Decoders (Diagram and working principle)

3.3 Multiplexers, Demultiplexers (Diagram and working principle) 5 3

Sequential Logic Circuits: Flip flops- RS, JK, T, D, Triggering
4 4.1 of flip flops, Concept of Registers 10 4

5 Teacher specific content

Classroom Procedure (Mode of transaction)

Teaching and Learning
Approach • ICT enabled Lectures
• Interactive sessions
• Class discussions

Page 10 of 21
 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Quiz
3. Assignments
B. Semester End Examination

ESE for Theory: 70 Marks; Written Test (2 Hrs)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (5 out of 7 Questions) -
(5*6=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES
1. M Morris Mano. Digital Logic and Computer Design (4th Edition). Prentice Hall.
2. A. Anand Kumar (2018). Fundamentals of Digital Circuits (4th Edition). PHI Learning Pvt.
Ltd.

SUGGESTED READINGS
1. Thomas C Bartee- Digital computer Fundamentals, Sixth Edition, TATA McGraw Hill
Edition
2. Thomas L Floyd- Digital Fundamentals, Ninth edition, PEARSON Prentice Hall.
3. Malvino & Leach- Digital Principles and Applications, Sixth Edition, Tata McGraw Hill, 2006

Page 11 of 21
 Mahatma Gandhi University
Kottayam
Programme BCA (Honours)

Course Name Software Lab in C

Type of
DSC
Course
Course Code MG1DSCBCA102

Course Level 100

This course covers problem solving using C Programming, Practical
Course Implementation of Problems using different types of C statements such as
Summary control flow structures, loop control structures, arrays, and functions. Students
will gain proficiency in solving problems using the C programming language.

Semester First Credits 2

Total
Lecture Tutorial Practical Others Hours
Course
Learning Approach
Details
0 0 4 0 60
Pre-
requisites, if
any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

Develop programs to solve various problems using

1 different types of C statements such as control flow A 1
structures, loop control structures, arrays, and functions.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 12 of 21
COURSE CONTENT
Content for Lab Sessions (Units)

Module Units Course description Hrs CO No.

Programs to understand the use of 3 1

1.1
Datatypes and variables.
1
Programs to use different Operators 5 1
1.2
and Type Conversions

Programs to Apply Input and Output in

2.1 7 1
C, understand Library functions

Program to implement Control

2 2.2 10 1
structures in C

Programs to Implement Loop Control

2.3 10 1
Structures in C

Programs to Implement Arrays: One-

3 3.1 dimensional and Two-dimensional 10 1
Arrays
Program to implement problems using
4 4.1 Functions, Recursion and different 15 1
parameter Passing Methods.

5 Teacher Specific Module 1

Classroom Procedure (Mode of transaction)

Teaching
• Practical Lab Sessions
and Learning
Approach • Discussions

MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

Assessment CCA for Practical: 30 Marks
Types
1. Written tests
2. Lab Assessment
3. Viva
4. Record

Page 13 of 21
 B. Semester End Examination

ESE for Practical: 70 Marks (2.5 Hrs)

Lab Examination Test: 70 Marks

1. First Program: 20 Marks

2. Second Program: 30 Marks

3. Viva Voce: 10 Marks

4. Record: 10 Marks

REFERENCES
1. Balagurusamy, E. (2019), “Programming in ANSI C” (8th ed.), Tata McGraw Hill.
2. Hanly J. R. and Koffman E. B. (2007), “Problem Solving and Program Design in C” (7th
ed.), Pearson Education.
SUGGESTED READINGS
1. Gottfried, B. S. (2018). “Programming with C" (4th ed.). Schaum’s Outline Series, TMH.
2. Pradeep K. Sinha and Priti Sinha (2004), “Computer Fundamentals -Concepts, Systems &
Applications”, 8th Edition, BPB Publications.

Page 14 of 21
 Mahatma Gandhi University

Kottayam

Programme BCA (Honours)

Course Name Discrete Mathematics

Type of Course DSC

Course Code MG1DSCBCA103

Course Level 100

Course Summary This course introduces basic concepts of Set Theory, Logic, Relations,
functions and Matrices. The Basic ideas of Sets and Propositional Logic
are further expanded. Mathematical Significance of Relations and
functions are explained. Various mathematical manipulations involved
in Matrices are properly illustrated. Students acquire skills in applying
concepts in Propositional Logic and Relations in different branches of
computer science.

Semester 1 Credits 4 Total

Hours
Course Details Learning Lecture Tutorial Practical Others
Approach
4 0 0 0 60

Pre-requisites, if Nil
any

COURSE OUTCOMES (CO)

CO No. Expected Course Outcome Learning PO

Domains * No

1 Understand Concepts of Set Theory U 1

2 Evaluate problems on Set theory. E 2

3 Understand Propositional Logic. U 2

4 Identify and Apply Propositional Logic. A 3

5 Evaluate problems using Truth tables and Logical E 3

operators.

6 Understand And Analyse different types and properties of An 2

Relations, functions and Equivalence Relations.

7 Understand concepts of Matrix and Matrix Operators. U 2

Page 15 of 21
 8 Evaluate the Inverse of a Matrix and solution of a system E 2
of Non homogeneous Equations
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transactions (Units)

Module Units Course description Hrs CO No.

Logic and Proofs

1.1 Propositional Logic (1.1 of Text 1) 5 3
1
1.2 Propositional Equivalences (1.2 of Text 1) 5 4

1.3 Rules of Inferences for Propositional Logic 5 5

(Relevant portions of 1.5 of Text 1)

Set Theory
2.1 Sets (2. 1 of Text 1) 4 1
2
2.2 Set operations. (2. 2 of Text 1) 4 2

2.3 Functions ( 2. 3 of Text 1) 4 6

Relations
3. 1 Relations and their Properties ( 7. 1 of Text 1) 6 6
3
3. 2 Representing relations (7.3 of Text 1) 6 6

3. 3 Equivalence relations (7.5 of Text 1) 5 6

Matrices

Definition and different types of Matrices,

4. 1 Symmetric and Skew Symmetric Matrices 3 7
(2.5 of Text 2)
4
Matrix operations, Determinant, Matrix inverse
4. 2 8 7&8
(2.6 , Relevant portions of 2.7 of Text 2)

Solution of a system of Non homogeneous

4.3 equations by Matrix method and Cramer's rule 5 8
(Relevant portions of 2.7, 2.10 of Text 2)

Page 16 of 21
 5 Teacher Specific Module

Teaching and Classroom Procedure (Mode of transaction)

Learning
Approach Brainstorming lectures, Explicit teaching, Active Cooperative learning

Assessment MODE OF ASSESSMENT

Types
A Continuous Comprehensive Assessment (CCA) (30 marks)

1. Quiz / MCQ
2. Assignment
3. Tests
4. Tutorial

End Semester Evaluation (ESE) 70 marks

Question Pattern
[Maximum Time 2 Hours, Maximum Marks 70]

Part A Part B Part C

Module Total
B 2 Marks 6 Marks 10 Marks

I 2 2 2 6
II 2 2 1 5

III 2 2 1 5

IV 2 2 2 6

Total no of questions 8 8 6 22

Number of questions
5 5 3 13
to be answered

Total Marks 10 30 30 70

REFERENCES

1. Kenneth. H. Rosen - Discrete Mathematics and its applications, 6th edition

2. B.S Grewal - Higher Engineering Mathematics, 40th Edition, Khanna Publications

SUGGESTED READINGS

1. Erwin Kreyszig - Advanced Engineering Mathematics, Wiley, India.

2. S.S Sastry - Engineering Mathematics Volume 1, 4th edition PHI.

Page 17 of 21
 Mahatma Gandhi University
Kottayam
Programme BCA (Honours)

Course Name Cyber Laws and Security

Type of Course MDC

Course Code MG1MDCBCA100

Course Level 100

Course Summary This comprehensive course on Cyber Laws and Security is designed to
provide participants with a thorough understanding of cyber laws,
including the IT Act, data protection, and regulations related to
cybercrimes, cyberbullying, and harassment, along with internet
security practices. It also provides a foundational understanding of
cryptography, cyber forensics, and ethical hacking principles to
enhance knowledge in securing digital information and systems.

Semester 1 Credits 3 Total Hours

Course Details Learning Lecture Tutorial Practical Others

Approach
3 0 0 0 45

Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome Domains *
No. No

1 Describe cyber laws, IT Act, data protection and various

cybercrimes. U 1
2 Analyze and apply security measures during online transactions
An 1
and financial activities.
3 Illustrate basic cryptographic techniques and importance of
cyber forensic. U 2
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 18 of 21
COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.
Cyber Laws, IT Act and Cyber Crimes
Introduction to Cyber laws: Definition and Scope, Key
1.1 2 1
legal concepts in cyberspace.
IT Act: Overview of the IT Act 2000, Offenses and
1.2 penalties under the IT Act, Amendments and evolving 4 1
landscape.

Data Protection and Privacy Laws : Principles of Data

1.3 3 1
1 Protection, Privacy laws and regulations.
Cyber Crimes: Types of Cybercrimes, Hacking and
1.4 unauthorized access, Identity theft and cyber fraud. 4 1

Cyber Bullying and Harassment: Definition and Forms

1.5 of Cyber Bullying, Legal Perspective on Cyberbullying.
4 1

1.6 Harassment Laws and social media, Reporting and

preventing cyberbullying. 3 1
Online Security
Introduction to Internet Security: Overview of
2.1 Internet Security, Importance of Online Safety. 2 2

Passwords and Authentication: Importance of Strong

2 2.2 Password, Multi Factor Authentication (MFA). 2 2

Secure Browsing Practices: Recognizing and Avoiding

2.3 phishing Attacks, Identifying Secure Websites (HTTPS). 3 2

Social Media Security: Privacy settings on Social media

2.4 platforms, Secure sharing information. 2 2

Online Transaction and Financial Security: Secure online

2.5 shopping, Banking and Financial Security, Payment 2 2
Card safety.

Introduction to Cryptography and Cyber Forensics

3 Security Concepts: Introduction, The need for security,

3.1 3 3
Principles of security, Types of Security attacks

Page 19 of 21
 Cryptography Concepts and Techniques: Introduction, plain
3.2 text and cipher text, substitution techniques, transposition 4 3
techniques,
Encryption and decryption, symmetric and asymmetric key
3.3 cryptography 3 3

Introduction to Cyber forensics - Definition and importance

of cyber forensics, Types of cybercrime -hacking, phishing,
3.4 identity theft, etc., The role of forensics in investigating 4 3
cybercrime. Introduction to Ethical Hacking.

4 Teacher Specific Content

Classroom Procedure (Mode of transaction)

Teaching and
Learning Approach
Lectures, Discussions, Case Analysis

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
3. MCQ
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)

Page 20 of 21
REFERENCES:

1. Vakul Sharma, “Information Technology Law and Practice”, 3rd ed. 2011, Universal
Law Pub., New Delhi.

2. Adv. Prashant Mali, “Cyber Law & Cyber Crimes”, Snow White Publications Pvt.
Ltd, 2nd ed. 2015.

3. Michael Cross , “Social Media Security: Leveraging Social Networking While

Mitigating Risk”, Elsevier, 2014.

4. William Stallings & Lawrie Brown “ Computer Security – Principles and Practice”
3rd ed., Pearson Pub., 2017.

5. William Stallings, Cryptography and Network Security Principles and Practice,

4/e,Pearson Ed.

6. Cyber Forensics - Concepts and Approaches, Ravi Kumar & B Jain,2006, icfai
university press

SUGGESTED READINGS:
1. “Cyber Law in India” by Pavan Duggal
2. “Cyber Security: A Practitioner’s Guide” by Eric Cole
3. “Principles of Intellectual Property” by Stephen M McJohn
4. “The Indian Cyber Law” by Sandeep Agrawal

Page 21 of 21