DEPARTMENT OF COMPUTER APPLICATIONS

CENTRE FOR OPEN AND DIGITAL EDUCATION

M.C.A (2 YEARS)
Online MODE

CURRICULUM and SYLLABUS

(Applicable for Students admitted from Academic Year 2023-25)

MASTER OF COMPUTER APPLICATIONS

DEPARTMENT OF COMPUTER APPLICATIONS

SCHOOL OF COMPUTING SCIENCES
HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE
 SEMESTER I
COURSE MATHEMATICS FOR COMPUTER
CREDITS 4
TITLE APPLICATIONS

COURSE COURSE
OMA0701 CF S-A-P-SS 12-64-0-44
CODE CATEGORY

35th ACM, LEARNING

Version 1.0 Approval Details BTL-3
06.08.2022 LEVEL

ASSESSMENT SCHEME

Seminar/
Periodical Surprise Test /
Assignments/ Attendance ESE
Assessment Quiz
Project

10% 10% 10% 70%

Mathematics is fundamental for all sort of computing technologies. The

course covers Fundamentals of Logic, Set Theory, and Theory of Integers,
Course
Relations and functions of graph representation and Random variables
Description
concepts. The data analysis is the base in all the field to do analytics. The
statistics required for data analysis is covered.

1. To gain insight on fundamentals of set theory and matrices for the

given problem.
2. To comprehend and implement the graph theory concept in optimizing
Course the real-life situation.
Objective 3. To demonstrate the application of discrete structures in different fields
of computer science.
4. To correlate & analyze the importance of statistics in different research
areas.
5. To implement the probability concept in data science.
Upon completion of this course, the students will be able to
1. Comprehend & apply the special property exhibited by the subset of
positive integers which enables to establish certain mathematical
formulas and theorems.
Course 2. Perceive the fundamental concepts of recurrence relations which is
Outcome discrete counterpart to ideas applied in ordinary differential
equations.
3. Analyze the concept of graphs & its properties that finds its
application in the area of Computer Science highly relevant from an
algorithmic & theoretical perspective.
4. Recall and evaluate the measures of the spread of data with variance,
standard deviation and range.
 5. Apply the mathematical formulation of an assignment problem &
analyze the computational procedure for deriving solutions.

Prerequisites: Probability and Statistics

CO, PO AND PSO MAPPING

PO PO- PO- PO- PO- PO- PO- PO- PO- PO PO- PO- PS PS PS
CO
-1 2 3 4 5 6 7 8 9 -10 11 12 O-1 O-2 O-3

CO
1 1 2 2 2 2 1 - - - - - 1 - -
-1

CO
1 2 2 1 1 2 2 - - - - - 1 2 -
-2

CO
1 2 2 2 2 3 3 - - - - - 1 2 2
-3

CO
2 1 2 2 1 2 2 - - - - - 2 2 1
-4

CO
1 2 2 1 2 2 2 - - - - - 2 2 2
-5

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: FUNDAMENTALS OF LOGIC, SET THEORY, AND THEORY OF INTEGERS

Basic Connectives and Truth Tables, Logic Equivalence: The Laws of Logic,
Logical Implication: Rules of Inference. Quantifiers and the Use of Quantifiers,
Definitions and the Proofs of Theorems.
Introduction, Sets and Subsets, Set Operations and the Laws of Set Theory,
Counting and Venn Diagrams. CO-1
The Well Ordering Principle: Mathematical Induction, Recursive Definitions, BTL-2
The Division Algorithm: Prime Numbers, The fundamental theorem of
Arithmetic
Suggested Readings:
Set Theory

MODULE 2: RELATIONS AND FUNCTIONS

Functions: Cartesian Products and Relations, Functions: Plain and One-to-One,
Onto Functions. The Pigeon-hole Principle, Function Composition and Inverse
Functions.
Relations: Properties of Relations, Computer Recognition: Zero-One Matrices
and Directed Graphs, Partial Orders: Hasse Diagrams, Equivalence Relations
and Partitions. CO-2

Recurrence Relations: Introduction, First Order Linear Recurrence Relation, BTL -3

The Second Order Linear Homogeneous Recurrence Relation with Constant
Coefficients.
Suggested Readings:

Relation and Function Operations

MODULE 3: RANDOM VARIABLES AND PROBABILITY DISTRIBUTION

Introduction to a random variable, Introduction to probability distribution,

Discrete probability distributions, Continuous probability distributions, mean,
variance and covariance of random variables. Binomial and normal
distribution, Exponential distribution with mean and variables.
Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs, CO-3
Isomorphic Graphs, Paths and Circuits, Eularian Graphs, Hamiltonian Graphs,
BTL-3
City-Route Puzzle, Seating Arrangement Problem, Travelling - Salesman
Problem.
Suggested Readings:
Application of Matrix representation of Graphs, minimum spanning tree

MODULE 4: INTRODUCTION TO DATA ANALYSIS

Introduction to contingency table, frequency and cross table, graphs,

histogram and frequency polygon, importance of histogram, unidimensional
and multidimensional graphical representation of data pictogram, bar chart,
staked bar chart, pie chart, percentage bar chart, column chart, stem and leaf
plot of the grouped data.
Descriptive Statistics: Mean: Arithmetic, Geometric and Harmonic means,
mathematical relationship among different means, median for raw data and CO-4
grouped data, mode for raw data and grouped data, relationship among BTL-3
mean, median and mode, descriptive Statistics standard deviation, variance,
coefficient of variation.
Quartiles, Quartile deviation and mean deviation. Fitting of straight line,
parabola (least square method), correlation-Karl Pearsons Correlation
coefficient, Spearman’sns rank correlation co-efficient, regression, two
regression lines, regression coefficients.
Suggested Readings:
Correlation evaluation metrics

MODULE 5: TRANSPORTATION AND ASSIGNMENT PROBLEM

Introduction to linear programming, Transportation Problem: Introduction,

special features of transportation type problem, basic feasible solution,
North-West corner method, Matrix method, Vogel’s Approximation method,
Optimality test.
CO-5
Assignment Problem: Mathematical formulation of an assignment problem,
BTL-3
solution, computational procedure, modified problems.
Suggested Readings:
Hungarian Algorithm for Assignment Problems Solving

TEXT BOOKS

Lipschutz, S., & Lipson, M. L. (2022). Schaum's outline of discrete mathematics.

1.
McGraw-Hill Education.

2. J. K. Sharma. (2014), Business statistics, 4th edition, Vikas publishers.

REFERENCE BOOKS

Taha, H. A. (2011). Operations research: an introduction (Vol. 790). Upper Saddle

1.
River, NJ, USA: Pearson/Prentice Hall.

E BOOKS
1. https://courses.csail.mit.edu/6.042/spring17/mcs.pdf

MOOC
1. https://www.coursera.org/learn/mathematics-for-computer-science

2. https://www.coursera.org/learn/discrete-mathematics

COURSE ADVANCED DATA STRUCTURES AND

CREDITS 4
TITLE ALGORITHMS

COURSE COURSE
OCB0701 PC S-A-P-SS 12-64-0-44
CODE CATEGORY

Approval 35th ACM, LEARNING

Version 1.0 BTL-3
Details 06.08.2022 LEVEL

ASSESSMENT SCHEME
 Seminar/
Periodical Surprise Test /
Assignments/ Attendance ESE
Assessment Quiz
Project

10% 10% 10% 70%

The course covers analysis and design of fundamental data structures and
engages learners to use data structures as tools to algorithmically design
efficient computer programs that will cope with the complexity of actual
Course applications.
Description The course focuses on basic and essential topics in data structures, including
array-based lists, linked lists, skip lists, hash tables, recursion, binary trees,
scapegoat trees, red–black trees, heaps, sorting algorithms, graphs, and
binary tree.

1. To learn the basic techniques of algorithm analysis.

2. To demonstrate several searching and sorting algorithms.
Course 3. To implement linear and non-linear data structures.
Objective 4. To demonstrate various tree and graph traversal algorithms.
5. To analyse and choose appropriate data structure to solve problems in
real world.
Upon completion of this course, the students will be able to
1. Explain the basic of data structure.
Course
2. Solve problems using trees.
Outcome
3. Implement the sorting.
4. Implement and develop graphs.
5. Implement and develop algorithms.
Prerequisites: Nil

CO, PO AND PSO MAPPING

PO PO- PO- PO- PO- PO- PO- PO- PO- PO PO- PO- PS PS PS
CO
-1 2 3 4 5 6 7 8 9 -10 11 12 O-1 O-2 O-3

CO
1 2 2 - 1 1 2 - - - - - 1 1 -
-1

CO
2 2 2 1 2 1 2 1 1 - - - 1 2 -
-2

CO
1 2 2 2 2 1 3 1 1 - - - 1 2 -
-3

CO
2 2 2 2 3 2 2 2 2 - - - 3 3 2
-4
CO
1 2 3 1 3 2 3 - - - - - 3 3 2
-5

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: INTRODUCTION TO ALGORITHMS AND DATA STRUCTURE

Problem solving concepts, Algorithms, Characteristics, measures of

algorithm, Space and time complexity, Data structure basics, ADT.
CO-1
Suggested Readings:
BTL-2
Complexity Notations: Omega and Theta Notations

MODULE 2: LISTS, STACKS and QUEUES

Introduction to Arrays, Representation of Linear Arrays in Memory,

Dynamically allocated arrays. Traversing, inserting, deleting, searching, and
sorting of arrays. Multidimensional Arrays, Polynomials and Sparse Matrices.
List and related operations, Singly and Doubly linked list, Operations on list,
CO-2
Stack, Queue, Applications of Stack and Queue.
BTL-2
Suggested Readings:
Circular Linked List

MODULE 3: TREES

Preliminaries, Binary Trees, Array and linked Representation of Binary

Trees, Binary Search Trees, AVL Trees, Tree Traversals, Hashing, Hash
Function, Hash families Separate Chaining, Open addressing. CO-3

Suggested Readings: BTL-3

B Tree and B+Tree

MODULE 4: SEARCHING AND SORTING

Linear Search, Binary Search, Jump Search and Interpolation Search.

Insertion Sort, Shells sort, Heap sort– Merge sort–Quick sort– External
Sorting-Topological Sort. CO-4

Suggested Readings: BTL-3

Radix Sort, Address Calculation Sort. Searching

MODULE 5: GRAPHS
Graph basics, Representations, Traversals (DFS & BFS), Applications of
Traversal Techniques, Graph connectivity, shortest path. CO-5

Suggested Readings: BTL-3

● Graph and File permission management

TEXT BOOKS

1. Peter Brass (2019) Advanced Data Structures, Cambridge University Press.

2. Rance D. Neclase (2016) Data Structures and Algorithms in Python, Wiley Publication.

REFERENCE BOOKS

E. Horowitz, S. Sahni and Dinesh Mehta, (2009) Fundamentals of Data structures in

1.
C++, University Press.

Mark Allen Weiss (2007) "Data Structures and Algorithm Analysis in C, Third Edition,
2.
Pearson Education, Asia.

Goodrich Michael T,( 2016) Data Structures and Algorithms in Python, Wiley
3.
publication.

E BOOKS

https://doc.lagout.org/Others/Data%20Structures/Advanced%20Data%20Structure
1.
s%20%5BBrass%202008-09-08%5D.pdf

MOOC
1. https://www.mooc-list.com/tags/advanced-data-structures

COURSE TITLE SOFTWARE ENGINEERING CREDITS 4

COURSE
COURSE CODE OCB0702 PC S-A-P-SS 9-64-3-44
CATEGORY

Approval 35th ACM, LEARNING

Version 1.0 BTL-4
Details 06.08.2022 LEVEL

ASSESSMENT SCHEME

Seminar/
Periodical Surprise Test /
Assignments/ Attendance ESE
Assessment Quiz
Project

10% 10% 10% 70%

Course Software engineering is defined as a process of analyzing user

Description requirements. The design work fixes the requirement as per the
functional flow the same will be tested during the system test. The
 implementation is to carry out the design. The final process of software
engineering is testing and implementation. The course covers all these
engineering process in detail.

1. To identify, formulate, and solve complex engineering problems by

applying principles
2. To apply engineering design to produce solutions that meet
specified needs
Course
3. To function effectively on a team whose members together provide
Objective leadership, create a collaborative and inclusive environment,
4. To develop and conduct appropriate experimentation, analyze and
interpret data.
5. To acquire and apply new knowledge as needed, using appropriate
learning strategies.
Upon completion of this course, the students will be able to
1. Understand the Software Engineering Process and Evaluation
techniques.
2. Plan and manage requirements at each stage of the software develop
Course the models.
Outcome 3. Learn about the design activity planning and behavior management
principles.
4. Develop skills to manage the various strategic phases involving testing
techniques and various test methods.
5. Deliver successful software projects that support organization‘s
strategic and agile process improvement.
Prerequisites: Software Engineering Techniques

CO, PO AND PSO MAPPING

PO PO- PO- PO- PO- PO- PO- PO- PO- PO PO- PO- PS PS PS
CO
-1 2 3 4 5 6 7 8 9 -10 11 12 O-1 O-2 O-3

CO
2 2 2 3 1 2 1 - - - - - 1 1 1
-1

CO
2 2 3 3 1 2 1 1 1 - 2 - 2 2 1
-2

CO
3 3 3 3 1 2 1 3 2 - 2 - 2 3 2
-3

CO
1 1 2 2 3 2 2 3 - - 3 2 3 3 3
-4

CO
1 1 3 3 3 2 2 3 3 3 3 3 3 3 3
-5

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: SOFTWARE PROCESS

Process models – Defining a Framework Activity, Process Patterns, Process

Assessment and improvement - Prescriptive Process Models – Specialized
process models- The Unified Process – Personal and Team Process models –
Process Technology – Product and Process.
CO-1
Practical Component
BTL-2
1. Practicing the different types of case tools such as Rational Rose / other
Open Source for all the phases of Software development life cycle.
Suggested Readings:
Process Models

MODULE 2: UNDERSTANDING REQUIREMENTS

Requirements Engineering – Eliciting requirements – Developing use cases

– Building the requirement model – Negotiating and validating requirements
–Scenario Based Modelling – UML Models – Data modelling concepts – Class
based modelling – Patterns for Requirement modelling.
Practical Component CO-2
1. Source code generators BTL-3
2. Apply the following to typical application problems:
a. Project Planning
b. Software Requirement Analysis
Suggested Readings:
UML creation

MODULE 3: DESIGN CONCEPTS

Design Process – Design concepts – Software Architecture – Architectural

Styles and Design – Assessing alternative architectural designs –
architectural Mapping Using Data Flow – Component Level Design –
Designing Class Based Components – Component level design for Web Apps
– Designing Traditional Components – User Interface Design.
Practical Component CO-3

1. Apply the following to typical application problems: BTL-3

a. Software Design
b. Data Modeling & Implementation
2. Software Estimation
Suggested Readings:
Architectural Mapping

MODULE 4: SOFTWARE TESTING STRATEGIES

Strategic approach for software testing – Test Strategies for Conventional
Software – OO Software and testing – Validation testing – System Testing –
The art of debugging – Internal and External views of testing – Basis path
testing – White Box testing – Control structure testing – Block Box Testing –
Model based Testing – Patterns for Software Testing.
Practical Component
CO-4
1. Software Testing
A possible set of applications may be the following: BTL-4

a. Create a dictionary.
b. Telephone directory.
c. Inventory System.
Suggested Readings:
Testing types

MODULE 5: AGILE METHODOLOGY AND SOFTWARE PROCESS IMPROVEMENT

What is agility – Agility and cost of change – What is an agile process –

Extreme programming – Agile Process models – Tool set for the agile process
– Software Process Improvement – SPI Process – CMMI – People of CMM –
SPI Framework – SPI Return on Investment – SPI Trends.
Practical Component
1. Software Quality Checking
CO-5
A possible set of applications may be the following:
BTL-4
a. Library System
b. Student Marks Analyzing System
c. Text Editor.
Suggested Readings:
CMMI

TEXT BOOKS

Roger S Pressman (2019) Software Engineering, Tata McGraw- Hill

1.
Publications, 8th Edition.

REFERENCE BOOKS

1. I. Sommerville (2011) Software Engineering , 5th Edition : Addision Wesley.

2. F. Fleeger (2011) Software Engineering, Pearson.

K.K. Agarwal and Yogesh Singh (2012) Software Engineering, New Age
3.
International Publisher, 3rd Edition, Reprint.
 Pankaj Jalote (2005) An Integrated Approach to Software Engineering, 3 rd
4.
Edition, Narosa Publishing House.

E BOOKS
1. http://www.ddegjust.ac.in/studymaterial/mca-3/ms-12.pdf

MOOC
1. https://www.coursera.org/courses?query=software%20engineering

OBJECT ORIENTED PROGRAMMING USING

COURSE TITLE CREDITS 4
JAVA

COURSE
COURSE CODE OCB0703 PC S-A-P-SS 9-64-3-44
CATEGORY

Approval 35th ACM, LEARNING

Version 1.0 BTL-4
Details 06.08.2022 LEVEL

ASSESSMENT SCHEME

Seminar/
Periodical Surprise Test /
Assignments/ Attendance ESE
Assessment Quiz
Project

10% 10% 10% 70%

The course deals about object-oriented programming concepts, overview

of java features of Java and benefits of OOPS concepts. Object-oriented
programming (OOP) is at the core of Java. In fact, all Java programs are to
Course
at least some extent object-oriented. OOP is so integral to Java that it is
Description
best to understand its basic principles before you begin writing even
simple Java programs. Therefore, this module begins with a discussion of
the theoretical aspects of OOP.

1. To learn about OOPS concepts.

Course 2. To learn about Java fundamentals.
Objective 3. To learn about Classes and Objects with simple programs.
4. To learn about Networking, I/O packages with simple programs.
5. To implement real time problems using OOPS concepts.
Upon completion of this course, the students will be able to
Course 1. Solve real world problems using OOP techniques.
Outcome 2. Solve problems using java collection framework and I/O classes.
3. Implement Interfaces and Packages.
4. Develop multithreaded applications with synchronization.
 5. Develop applets for web applications and able to design GUI based
application.
Prerequisites: Object Oriented Programming Basics.

CO, PO AND PSO MAPPING

PO PO- PO- PO- PO- PO- PO- PO- PO- PO PO- PO- PS PS PS
CO
-1 2 3 4 5 6 7 8 9 -10 11 12 O-1 O-2 O-3

CO
1 1 1 2 2 2 2 3 2 3 1 3 1 1 -
-1

CO
1 1 1 1 2 1 2 3 2 3 1 2 2 - -
-2

CO
1 1 1 2 2 2 2 3 2 2 3 2 2 3 -
-3

CO
1 2 2 2 2 2 2 3 2 3 3 1 2 3 -
-4

CO
1 1 1 2 2 2 2 3 2 1 3 1 3 3 2
-5

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: INTRODUCTION TO JAVA

Classes and Instances- Class Hierarchies- Inheritance - Method binding-

Overriding and Exceptions- Overview of Java - -Data types - Variables and
Arrays - operators- expressions- control statements- Introducing classes-
Methods and Classes- String handling- Inheritance concept- Inheritance
basics- Member access- Constructors- Inheritance and its types- Object class-
forms of inheritance- specialization- specification- construction- extension- CO-1
limitation- combination- benefits of inheritance- costs of inheritance.
BTL-3
Practical Component:
Write the program to implement grade sheet using Inheritance in JAVA
Suggested Readings:
Features of OOPS

MODULE 2: PACKAGES, INTERFACES AND I/O STREAMS

Defining a Package- CLASSPATH- Access protection- importing packages.
Interfaces- defining an interface- implementing interfaces- Nested
interfaces- applying interfaces- variables in interfaces and extending
interfaces. Introduction to Stream - Introduction to NIO- - Stream Classes -
Files - Buffers - Character Arrays - Print Writer Class - Stream Tokenizer Class-
Implementing the Serializable Interface - Console Class- Printing with the
Formatter Class - Scanning Input with the Scanner class. CO-2

Practical Component: BTL-4

Write the program to implement string manipulation using Interfaces and

Packages in JAVA
Suggested Readings:
Stream Interfaces in JAVA

MODULE 3: EXCEPTION HANDLING AND MULTITHREADING

Fundamentals of exception handling- Exception types- Termination models-

Uncaught exceptions- using try and catch- multiple catch clauses- nested try
statements- throw- throws and finally- built- in exceptions- creating own
exception sub classes. Threading :Differences between thread-based
multitasking and process-based multitasking- Java thread model- creating
threads- thread priorities- synchronizing threads- inter thread
communication. CO-3

BTL-4
Practical Component:
Write the program to display number series using Multithreading in JAVA
Suggested Readings:
Multitasking using Threads

MODULE 4: NETWORKING WITH JAVA.NET

Introduction to Networking - Networking Enhancements in Java SE 8- Client-

Server Networking- Proxy Servers- Domain Name Service- Understanding
Networking Interfaces and Classes in the java.net Package- Internet
Addressing- Understanding Sockets in Java- Understanding the URL Class-
Understanding the URI Class- Working with Datagrams. CO-4

Practical Component: BTL-4

Write the program to implement console chat using Client –Server
Networking
Suggested Readings:
Java networking classes and interfaces

MODULE 5: COLLECTION FRAMEWORK AND FUNCTIONAL PROGRAMMING

Collections overview- Collection Interfaces- The Collection classes- Array List-

Linked List- Hash Set- Tree Set- Priority Queue- Array Deque. Accessing a
Collection via an Iterator- Using an Iterator- The For-Each alternative-
Map Interfaces and Classes- Comparators- Collection algorithms- Arrays- The
Legacy Classes and Interfaces- Dictionary- Hash table- Properties- Stack-
Vector More Utility classes- String Tokenizer- Bit Set- Date- Calendar-
Random- Formatter- Scanner. CO-5

Practical Component: BTL-3

Functional Programming, Pure functional programming- No State,

Immutable variables, recursion over looping.
Suggested Readings:
Functional Programming in JAVA script

TEXT BOOKS

Herbert Schildt (2019) Java The complete reference, 11th edition, McGraw
1.
Hill Education (India) Pvt. Ltd.

T. Budd (2000) Understanding Object-Oriented Programming with Java,

2.
updated edition, Pearson Education.

REFERENCE BOOKS

J. Nino and F.A. Hosch (2008) An Introduction to programming and OO

1.
design using Java, John Wiley & sons.

S. Malhotra, S. Chudhary (2013) Programming in Java, 2nd edition, Oxford

2.
Univ. Press.

E BOOKS
1. https://bookboon.com/en/java-programming-language-ebooks
MOOC
1. https://www.coursera.org/courses?query=java
 COURSE
DATA COMMUNICATION AND NETWORKING CREDITS 4
TITLE

COURSE COURSE
OCB0704 PC S-A-P-SS 12-64-0-44
CODE CATEGORY

Approval 35th ACM, LEARNING

Version 1.0 BTL-3
Details 06.08.2022 LEVEL

ASSESSMENT SCHEME

Seminar/
Periodical Surprise Test /
Assignments/ Attendance ESE
Assessment Quiz
Project

10% 10% 10% 70%

The course focuses on network models with various protocols in each layer
of model. The functionality of Physical layer, Transport layer and Network
Course
layers are covered. The network is applicable for wireless medium also. The
Description
standards and models being followed in wireless networking also covered
in this course.

1. To perceive the relevance of data communication and network

fundamentals in current times.
2. To build a strong foundation of networks concepts on Signals,
Transmission Media, Errors in data communications and their
Course correction, networks classes and devices.
3. To gain insight on network architectures, protocols and standards.
Objective
4. To establish in-depth knowledge of transfer of data, categories of
network & different topology.
5. To develop a strong foundation of network technologies from the
physical layer to application layer.

Upon completion of this course, the students will be able to

1. Gain insight on the basics of computer networks, Comprehend the
functioning of various layers of OSI Model & TCP/IP model.
2. Understand the functionality of Physical Layer and its relevance in data
Course transmission.
3. Apply different Error detection and Error correction methods during
Outcome
data transmission and analyze the functions of data link layer.
4. Identify the relevance of different techniques that supports bandwidth
optimization and analyze the various IEEE 802 Standards of Wired and
Wireless LAN.
5. Evaluate the purpose of Network Layer & its importance in packet
transmission using routing algorithms.
Prerequisites: Basics of Networking
CO, PO AND PSO MAPPING

PO PO- PO- PO- PO- PO- PO- PO- PO- PO PO- PO- PS PS PS
CO
-1 2 3 4 5 6 7 8 9 -10 11 12 O-1 O-2 O-3

CO
1 1 2 2 1 1 2 1 2 - - - 1 - -
-1

CO
1 1 1 2 1 2 1 2 - - - 1 1 1
-2

CO
1 1 2 2 2 2 2 1 2 - 1 - 1 2 -
-3

CO
2 2 2 2 2 1 3 1 2 - - - 1 2 2
-4

CO
2 2 2 2 2 2 3 2 2 1 - 1 2 2 2
-5

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: NETWORK FUNDAMENTALS

Introduction, Components of Data Communication- Network Devices - Types

of Connection – Topology - Categories of Networks - Interconnection of
Networks - Applications of Networks, Protocols and Standards. Networks
Models : Layered Tasks, The OSI model, Layers in the OSI Model, TCP/IP CO-1
Protocol suite, Address in TCP/IP, TCP vs UDP BTL-3
Suggested Readings:
Data Flow in Network

MODULE 2: PHYSICAL LAYER

Introduction: Analog and Digital Data, Analog and Digital Signals, Periodic
Analog Signals, Transmission Impairment, Data Rate limits, Performance.
Transmission Modes: Parallel and Serial Transmission; Serial Communication:
Synchronous communication & Asynchronous Communication. Digital CO-2
Transmission: Digital to Digital conversion, Digital to Analog conversion,
BTL-3
Analog to Digital conversion.
Suggested Reading:
Frequency Modulation and Phase Modulation

MODULE 3: DATA LINK LAYER, DATA LINK CONTROL AND ERROR DETECTION AND
CORRECTION
Introduction: Types of Error, Redundancy, Detection versus Correction; Block
Coding: Error Detection, Error Correction, Hamming Code; Cyclic Codes: CRC
and Checksum.
Data Link Control: Design Issues, Framing, Flow and Error Control, Noiseless
Channels, Noisy Channels, HDLC; Point to Point Protocol: Framing, Transition CO-3
phases and Multilink PPP; Media Access Control (MAC layer): Random Access:
BTL-3
ALOHA, CSMA, CSMA/CD & CSMA/CA; Controlled Access: Reservation, Polling
and Token Passing Channelization: FDMA, TDMA, CDMA.
Suggested Reading:
Protocol in Data Link Layer

MODULE 4: WIRED AND WIRELESS LAN

Bandwidth Utilization Bandwidth: Speed vs Bandwidth; Multiplexing:

Frequency Division, Wavelength Division and Time Division Multiplexing;
Spread Spectrum: Frequency Hopping Spread Spectrum and Direct Sequence
Spread Spectrum; Transmission Media.
Wired LANs Ethernet: IEEE Standards, Standard Ethernet, Fast Ethernet, CO-4
Gigabit Ethernet and 10 Gigabit Ethernet; Wireless LANs: Introduction, IEEE
BTL-3
802.11, & Bluetooth, Zigbee Technology; Categories of Connecting devices,
Virtual LANs; Other wireless Network: Cellular Telephony.
Suggested Reading:
Switching Techniques

MODULE 5: NETWORK LAYER

Logical Addressing: IPv4 Addresses (Classful and Classless Addressing),

Network Address Translation (NAT), IPv6 Addresses.
Internet Protocol (IP): Internetworking, IPv4 and IPv6; Address Mapping:
Logical to Physical Address (ARP), Physical to Logical Address (RARP, BOOTP
and DHCP).
Inside a Router: Input Processing, Switching, Output Processing, Where Does
Queuing Occur? Routing control plane, Understanding of Unicast, Multicast CO-5
and Broadcast; Routing Algorithms: The Link-State (LS) Routing Algorithm,
BTL-3
The Distance-Vector.
(DV) Routing Algorithm; Overview of Intra-AS Routing in the Internet: OSPF
and Inter/AS Routing: BGP; ICMP.
Suggested Reading:
Data Flow between Network and Transport Layer, Bridge between different
Network Topologies
TEXT BOOKS

Larry L. Peterson & Bruce S. Davie (2021) Computer Networks – A systems

1.
Approach, Sixth Edition, Harcourt Asia / Morgan Kaufmann.

Forouzan (2017) Data Communication and Networking Fifth Edition, Harcourt

2.
Asia / Morgan Kaufmann.

REFERENCE BOOKS

Andrew S.Tannenbaum David J. Wetherall (2011) Computer Networks, Fifth

1.
Edition, Pearson Education.

John Cowley (2010) Communications and Networking: An Introduction, Springer

2.
Indian Reprint.

Achyut S Godbole,AtulHahate (2011) Data Communications and Networks,

3.
second edition, Tata McGraw-Hill Education Pvt. Ltd

William Stallings (2011) “Data and Computer Communications”, Nineth Edition,

4.
Prentice Hall.

E BOOKS
https://books.google.co.in/books?id=p7B2BAAAQBAJ&printsec=frontcover&s
1.
ource=gbs_ge_summary_r&cad=0#v=onepage&q&f=false

2. http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf

MOOC
1. https://www.classcentral.com/subject/computer-networking

2 https://www.coursera.org/courses?query=computer%20network