MAR ATHANASIUS COLLEGE OF ENGINEERING

(Govt. Aided Autonomous Institution, Established in 1961)

Kothamangalam, Kerala, India - 686666

MCA
BRIDGE COURSE SYLLABUS - 2024

Department of Computer Applications

 Master of Computer Applications

Course Structure
Courses Duration
Mathematics & Statistics 20 Hours
Digital Fundamentals & Computer Architecture 20 Hours
Operating Systems 20 Hours
C Programming 28 Hours
Data Structures 32 Hours

End Course Examination Pattern

Assessment Duration Max. Marks
Theory 3 Hours 60
Practical 2 Hours 50

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 1

 Master of Computer Applications

Year of
L T P J S Credit
Introduction
M24CA1R 001 Bridge Course
22 0 8 0 30 Nil 2024

Preamble:
A bridge course serves as a crucial academic pathway designed to ease the transition into the
demanding and dynamic field of computer science. Tailored to address foundational knowledge gaps
and ensure a comprehensive understanding of core concepts, the bridge course acts as a bridge between
the students' prior educational background and the advanced requirements of the MCA program. It
typically covers essential topics such as Mathematics, Basics of Digital Fundamentals and Computer
Architecture, Operating systems, Basics of C Programming and Data Structures.

Prerequisite: Nil

Course Outcomes:
After completion of the course the student will be able to:

CO Cognitive
Course Outcomes
No. Knowledge Level
Understand and apply Single Variables Calculus, Linear Algebra,
CO 1 Apply
Combinatorics and Statistics in practical problems.
Understand the fundamental principles underlying digital
fundamentals including binary number system, conversion techniques
CO 2 and operations, facilitating effective representation and manipulation Understand
of digital data and also gain insight into the basic architecture of
computers.
Gain in depth knowledge of operating systems, covering GUI, CUI,
CO 3 application and system software, boot processes, and hardware Understand
components, as well as various OS functionalities and classifications.
Acquire fundamental programming skills essential for software
CO 4 development and mastering C as a foundational language, enables Apply
them to flexibly adapt to various technological domains.
Explore data structures and algorithms, emphasizing complexity
CO 5 categorization, Array, Stack, Queue, and Linked List operations, Apply
mastering Binary Tree traversal Sorting and Searching algorithms.

Assessment Pattern
An end course examination that covers the entire content of the bridge course will be conducted to assess
overall understanding and retention. The end course examination will have two parts – a written examination
and a practical examination. Written examination will be of 3 hours duration with maximum 60 marks and
practical examination will be of 2 hours duration with maximum 50 marks. The practical examination will
have two questions one moderate level question on problem solving using C and another one on Data
Structures. Class participation and attendance might be a factor in the evaluation process.

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 2

 Master of Computer Applications

Syllabus

Module 1: Mathematics and Statistics [20 Hours]

Review of basic single variable calculus: Functions, Limit, Derivatives, Integrals.
Linear Algebra: Matrices -Special matrices, Transpose of a matrix, Operations on matrices – Addition,
Subtraction, Scalar multiplication, Determinant, Minor, Cofactor, Adjoint of a matrix, Inverse of a matrix,
Linear equation, Nonlinear equation, Row Echelon form, Rank of a matrix.
Combinatorics: Sum and Product Rules, Permutations, Combinations.
Measures of Dispersion: Range, Mean deviation, Quartile deviation, Standard deviation, Skewness,
Kurtosis, Moments.
Module 2: Digital Fundamentals and Computer Architecture [20 Hours]
Number Systems: Introduction, Decimal number systems, Binary number systems conversion, Octal
number system, Hexa decimal number systems conversion. Binary Arithmetic- Binary addition and Binary
Subtraction, Binary multiplication, Binary division. BCD codes and BCD arithmetic, Representation of
signed numbers, Floating point operations, Error detection and correction codes.
PC Architecture: Introduction, Components of Mother Board, Input output devices, Hard disk overview-
Disk Geometry, SSD. Secondary storage devices, CD family and DVD, Analog and digital signals,
Transmission impairments.
Module 3: Operating Systems [20 Hours]
Introduction to Operating Systems: Basic Hardware & Memory- Ram, Rom, CPU, Hard disk, Mother
Board, SMPS, Cache Memory, Virtual Memory, Registers, Buffers, GUI & CUI, Application S/W, System
S/W, Booting Process, BIOS, POST, Bootstrap loader, Kernel.
Functions of Operating System: Types of operating system- Batch, Multiprogramming, Multi-Tasking,
Multi-Processing, Real-Time.
Concept of a Process: Process States, Process Control Block, Context Switch, Thread, Multi-Thread. CPU
Scheduling criteria- CPU scheduling algorithms-FCFS, SJFS, SRTF, Round Robin, Priority Scheduling.
Module 4: Basics of Programming [28 Hours]
Overview of C: Constants, variables, and data types, managing input/ output, operators and expressions,
decision statements and loops, functions, single and multi-dimensional arrays, structure, union, files, and
pointers.
Module 5: Data Structures [32 Hours]
Introduction to Data Structures and Algorithms: Introduction, Classification, Algorithm. Arrays
Introduction, Insertion Algorithms, Deletion Algorithms. Stack - Introduction, Insertion Algorithms,
Deletion Algorithms. Queue - Introduction, Insertion Algorithm, Deletion Algorithm. Linked List -
Introduction, Singly Linked List, Doubly Linked List, Circular Linked List. Trees - Introduction &
Terminologies, Binary Tree - Introduction, Traversal. Sort - Bubble Sort, Selection Sort, Insertion Sort,
Merge Sort. Search - Linear Search, Binary Search. Graph - Introduction, Terminologies. Sets -
Introduction, Terminologies.
Implementation: Array Insertion, Array Deletion Stack operations, Queue Operations, Bubble sort.

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 3

 Master of Computer Applications

Reference Books:
1. Ian Jacques. Mathematics for Economics and Business. 9th ed. Pearson, 2019.
2. Swapan Kumar Chakraborty Bikash Kanti Sarkar “Discrete Mathematics”, Oxford
3. L. R. Potti “Probability and Statistics”, Yamuna Publications
4. Floyd, “Digital Fundamentals”, Pearson Education, 11th Edition (2021).
5. Hamacher, Vranesic & Zaky, “Computer Organization”,6th Edition(2012), McGrawHill.
6. Silberschatz, Galvin, Gagne "Operating System Principles”, Wiley, Seventh Edition (2006)
7. Tanenbaum, Andrew S, "Modern Operating Systems”, Prentice Hall India Learning Private Limited,
Third Edition (2009)
8. Brian Kernighan and Dennis Ritchie, “The C Programming Language”, Prentice Hall (1988).
9. Byron Gottfried, “Schaum's Outline of Programming with C”, McGraw-Hill Education, 2nd Edition
(1996).
10. Cormen T.H., Leiserson C.E, Rivest R.L. and Stein C, Introduction to Algorithms, Prentice Hall
India, New Delhi, 2004
11. D.Samantha, Classic Data structures, Prentice Hall India, New Delhi,2005

Course Contents and Lecture Schedule

Sl.No Mathematics and Statistics [20 Hours] No of hours

1 Functions 1
2 Limit 1
3 Derivatives 1
4 Integrals 1
5 Special matrices 1
6 Transpose of a matrix 1
7 Operations on matrices – Addition, Subtraction, Scalar multiplication 1
8 Determinant, Minor 1
9 Cofactor, Adjoint of a matrix 1
10 Inverse of a matrix 1
11 Linear equation, Nonlinear equation, Row Echelon form 1
12 Rank of a matrix 1
13 Sum and Product Rules 1
14 Permutations 1
15 Combinations 1
16 Range, Mean deviation 1
17 Quartile deviation 1
18 Standard deviation 1
19 Skewness 1
20 Kurtosis, Moments 1
Total Hours 20

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 4

 Master of Computer Applications

Sl No Digital fundamentals and Computer architecture [20 Hours] No of hours

1 Introduction to number systems 1
2 Decimal number systems, Binary number systems conversion 1
3 Octal number system, Hexa decimal number systems conversion 1
4 Binary addition and Binary Subtraction 1
5 Binary multiplication, Binary division 2
6 BCD codes and BCD arithmetic 2
7 Representation of signed numbers 1
8 Floating point operations 2
9 Error detection and correction codes. 2
10 Introduction to computers, Overview of PC architecture 1
11 Components of Mother Board 2
12 Input output devices 1
13 Hard disk overview, Disk Geometry, SSD 1
14 Secondary storage devices, CD family and DVD 1
15 Analog and digital signals, Transmission impairments 1
Total Hours 20

Sl No Operating Systems [20 Hours] No of hours

1 Basic Hardware & Memory- Ram, Rom, CPU, Hard Disk. 1
2 Mother Board, SMPS, Cache Memory. 1
3 Virtual Memory, Registers, Buffers. 1
4 Introduction to OS - GUI & CUI, application S/W, System S/W. 1
5 Booting Process, BIOS, POST. 1
6 Bootstrap loader, Kernel. 1
7 Functions of Operating System. 2
Batch Processing, Multiprogramming, Multi-Tasking, Multi-Processing,
8 1
Real Time.
9 Concept of a Process, Process States. 2
10 Process Control Block, Context Switch. 1
11 Thread, Multi-thread. 1
12 CPU Scheduling Criteria, CPU Scheduling Algorithms. 1
13 CPU Scheduling Algorithms-FCFS. 2
14 CPU Scheduling Algorithms-SJFS. 1
15 CPU Scheduling Algorithms- SRTF. 1

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 5

 Master of Computer Applications

16 CPU Scheduling algorithms- Round Robin. 1

17 CPU Scheduling algorithms- Priority Scheduling. 1
Total Hours 20

Sl No Basics of Programming -Theory Portions [8 Hours] No of hours

Overview of C: constants, variables and data types, managing input/ output,
1 1
operators and expressions
2 Decision Statements and Loops 1
3 Functions, recursive functions 1
4 Single dimensional arrays 1
5 Two dimensional arrays 1
6 Structure and Union 1
7 Pointers and array manipulations 1
8 Files 1
Total Hours 8

Sl No Basics of Programming -List of Experiments [20 Hours Lab] No of hours

1 Write basic C programs using command line arguments. 2
2 Write programs that implement decision statements like if-else and switch. 2
3 Write programs that employ looping constructs and nested loops. 2
4 Write programs that use functions to implement a specific task. 2
5 Write programs that use functions with recursive statements. 2
6 Write programs that manipulate single dimensional arrays. 2
7 Write programs that use two-dimensional arrays. 2
8 Write programs using structures and union. 2
9 Write programs that include pointers with arrays. 2
10 Write programs using files. 2
Total Hours 20

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 6

 Master of Computer Applications

Sl.No Data Structures - Theory Portions [20 Hours] No of hours

1 Introduction to Data structures and algorithms. 1
2 Classification of Data structures. 1
3 Arrays-Introduction. 1
4 Array-Insertion Algorithms. 1
5 Array-Deletion Algorithms. 1
6 Stack-Introduction, Insertion Algorithms. 1
7 Stack-Deletion algorithms. 1
8 Queue- Introduction, Insertion Algorithm. 1
9 Queue- Deletion Algorithm. 1
10 Linked List- Introduction, Singly Linked List 1
11 Doubly Linked List 1
12 Circular Linked List. 1
13 Trees-Introduction & Terminologies 1
14 Binary tree-introduction 1
15 Binary Tree -Traversal 1
16 Bubble Sort, Selection Sort 1
17 Insertion sort, Merge sort 1
18 Linear Search, Binary search 1
19 Graph-Introduction, Terminologies 1
20 Sets- Introduction, Terminologies 1
Total Hours 20

Sl.No Data Structures - List of Experiments [12 Hours Lab] No of hours

1 Write a Menu Driven Program to perform Array Insertion algorithm. 2
2 Write a Menu Driven Program to perform Array Deletion algorithm 2
3 Write a Menu Driven Program to perform Stack operations 2
4 Write a Menu Driven Program to Perform Queue Operations 2
5 Write a Menu Driven Program to perform Bubble sort and Selection Sort 2
6 Write a Menu Driven Program to perform Binary Search & Linear Search 2
Total Hours 12

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 7

 Master of Computer Applications

CO Assessment Questions

Course Outcome 1
1. Differentiate f(x)=(2x2+1)2.
2. Find the inverse of A and show that AA-1 is an identity matrix.

3. A box contains 4 red balls, 5 green balls, and 6 white balls. A ball is drawn at random from the box.
Find the probability that the ball is (a) Green (b) White (c) Blue.
Course Outcome 2
1. Convert the Decimal number (59.85)10 in to Binary.
2. Perform BCD arithmetic (a) 99+99 (b) 153-149.
3. Description about the Input Output devices.
Course Outcome 3
1. Explain the booting process of an Operating System.
2. Explain different states of process with a neat diagram
3. Explain FCFS CPU Scheduling Algorithm.
Course Outcome 4
1. Implement a C program to determine the grade of a student based on their percentage score, using
a given grading criteria.
2. Create a recursive C function to calculate the sum of digits of a given integer.
3. Implement a C program to calculate the sum of elements in each column of a matrix.
Course Outcome 5
1. What is data structure and explain its classification?
2. Describe Binary Tree and explain its different traversals.
3. Compare Binary search and Linear Search.

Model Question Paper

QP CODE:__________ Pages:__

Reg No.: ____________ Name:_________

MAR ATH ANASIUS COLLEGE OF ENGINEERING (AUTONOMOUS )

KOTHAMANGALAM
Bridge Course Examination

Max. Marks: 60 Time: 3 Hours

▪ This question paper has Four Sections.
▪ Each section contains Two Parts – Part A and Part B.
▪ In Part A there are 3 questions of 3 marks each (all questions are to be answered).
▪ In Part B there are 2 questions of 6 marks each (one question is to be answered).

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 8

 Master of Computer Applications

SECTION 1: Mathematics and Statistics [15 Marks]

PART A (3 x 3 = 9 Marks)

1. Differentiate f(x)=(2x2+1)2.
2. Find the inverse of A and show that AA-1 is an identity matrix.

3. A box contains 4 red balls, 5 green balls, and 6 white balls. A ball is drawn at random from thebox.
Find the probability that the ball is: (a) Green (b) White (c) Blue.

PART B (1 x 6 = 6 Marks)
1 2
4. Find the eigen value and eigen vectors for the matrix, A = [ ]
5 4
OR
5. (a) Patricia has to choose 5 marbles from 12 marbles. In how many ways can she choosethem?
(3 Marks)
(b) In how many ways can we arrange the letters in the word TEETH? (3 Marks)

SECTION 2: Digital Fundamentals & Computer Architecture (15 Marks)

PART A (3 x 3 = 9 Marks)
1. Convert the Decimal number (59.85)10 in to Binary.

2. Perform the following binary arithmetic operations:

(a) 83-16 (b) 115/5 c. 101000*101000

3. Perform BCD arithmetic: (a) 99+99 (b) 153-149.

PART B (1 x 6 = 6 Marks)
4. Detailed description about the components of Mother board.
OR
5. What are transmission impairments. How it will affect in Analog signals.

SECTION 3: Operating Systems (15 Marks)

PART A (3 x 3 = 9 Marks)
1. Differentiate process and program.
2. What is a process control block?

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 9

 Master of Computer Applications

3. Define Deadlocks.

PART B (1 x 6 = 6 Marks)
4. How interrupts are managed by operating system? Explain.

OR

5. MOVE AX, 21H

MOVE X, 21H
ADD AX, BX
MOVE 80H, AX
END
Consider the above statement as a process. Write the state of the process, when each instruction is
executed.

SECTION 4 – C Programming & Data Structures (15 Marks)

PART A (3 x 3 = 9 Marks)

1. Differentiate actual arguments and formal arguments.

2. List the applications of stack.
3. Write an algorithm for queue insertion.

PART B (1 x 6 = 6 Marks)
4. Explain the deletion procedure of Binary Search Tree with examples.

OR
5. Explain the implementation of ID and 2D arrays?

Mar Athanasius College of Engineering (Autonomous), Kothamangalam 10