UNIVERSITY OF MADRAS

DEPARTMENT OF COMPUTER SCIENCE

[Link]. Computer Science Revised Course List and Syllabus
under Choice Based Credit System (CBCS)
TO TAKE EFFECT FROM THE ACADEMIC YEAR 2021-22
Programme: [Link]. Computer Science
Programme
Code: MSIG

Duration: 2 years
Programme • 1. The broad objective of the programme is to prepare students
Outcomes: for productive careers in academia and computing industry by
providing smooth environment for teaching and research in the
core and applied areas of the discipline.

• 2. The programme aims to provide an understanding of

advanced Computing and Communication Technologies.
• 3. To keep a balance between fundamental concepts, core areas
of computer science and specialized skills required to adapt to
the needs of the constantly evolving computing industry.
• 4. To conduct quality research in the emerging areas of
Computer Science

• 5. The syllabus is intent on providing a strong foundation in

theory along with a clear technology focus.
• 6. To learn and evaluate a range of computing technologies,
systems and application services.
• 7. To design, analyze, develop and evaluate high-end systems.

• 8. To undertake challenging projects and work as active

researchers.

• 9. To identify recent Research / Industry trends.

• 10. To equip the student with a basic knowledge of other

domains, disciplines and skills, a social and environmental
consciousness and a strong value base.
 Programme • 1 Implement the concept of theory and technology with classical
Specific and modern techniques for solving the complex problems in
Outcomes: Computer Science.
• 2 Be more curious towards learning new and emerging
technologies adapt quickly to changes.
• 3 Design, execute and evaluate computing projects in academia
and industries using appropriate technologies.
• 4 Know the contextual knowledge in computing science research
and communicate effectively with stakeholders with the society at
large for enhancing the quality of life.
• 5 Be honest in upholding the ethical principles and social
responsibilities along with socio-economic innovations.

List of Courses:
Semester Course Title of the Course Core/Ele Credits
Code ctive/
L-T-L-C
Soft
Skill
I MSI C421 Mathematics for Computer Science C 3-1-0-4

I MSI C422 Theory of Computation C 3-1-0-4

I MSI C423 Design and Analysis of Algorithms C 3-1-0-4

I MSI C424 Algorithms Lab C 0-0-1-1

II MSI C425 Computer Networks C 3-1-0-4

II MSI C426 Artificial Intelligence C 3-1-0-4

II MSI C427 Database Management Systems C 3-1-0-4

II MSI C428 DBMS Lab. C 0-0-2-2

III MSI C429 Machine Learning C 3-1-0-4

III MSI C430 Digital Image Processing C 3-1-0-4

III MSI C431 Data Analytics C 3-0-1-4

III MSI C432 Cryptography C 3-1-0-4

III MSI C433 Machine Learning and Image C 0-0-2-2

Processing lab
III UOMI 001 Internship-I 0-0-2-2

IV MSI C434 Project Work C 0-0-15-15

I/II/III MSI E406 Web based Application development E 3-0-0-3

I/II/III MSI E407 Object Oriented Analysis and Design E 3-0-0-3

I/II/III MSI E408 Mathematics for Computer Science E 3-0-0-3

I/II/III MSI E409 Programming in C E 3-0-0-3

Note – Number of Minimum Credits required for Core Courses is 60

Number of Minimum Credits required for Elective Courses is 21
Number of Minimum Credits required for Soft Skills is 8
Number of Minimum Credits required for Internship is 2

Method of Evaluation: ( Common pattern to be followed for all the courses )

Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4 University’s
& K6 K5 & K6 common
systems

Methods of assessment:
Recall (K1) - Simple definitions, MCQ, Recall steps, Concept definitions
Understand/ Comprehend (K2) - MCQ, True/False, Short essays, Concept explanations, Short
summary or overview
Application (K3) - Suggest idea/concept with examples, Suggest formulae, Solve problems,
Observe, Explain
Analyse (K4) - Problem-solving questions, Finish a procedure in many steps, Differentiate
between various ideas, Map knowledge
Evaluate (K5) - Longer essay/ Evaluation essay, Critique or justify with pros and cons
Create (K6) - Check knowledge in specific or offbeat situations, Discussion, Debating or
Presentations
MSIC421 Mathematics for Computer Science 3-1-0-4

Course • 1 Learn and recall allied level mathematics for application problems.
Outcomes
• 2 To understand the role of linear algebra and matrix in computer science
problem solving.
• 3 Learn and understand unit step function and Dirac delta function. To
study orthogonal functions and Fourier transforms and understand their
use in computational problems.
• 4 Learn the concepts of number theory for cryptography.
• 5 Critically analyze and implement programs for the methods studied
for a set of selected example problems..
Course Code MSIC421/Core

Title of the Mathematics for Computer Science

Course:
Credits: 3-1-0-4
Pre- Allied level Mathematics
requisites, if
any:
Course • 1 To review and recall the concepts of set theory and make the students
Objectives understand the importance of the concepts. (K1&K2)

K1 - Recall; • 2 Understand the concept of matrix and associated properties with

K2 - eigenvalues and eigenvectors. (K2&K5)
Understand;
K3 - Apply; • 3 Study further the properties of matrices with Gram-Schimdt process
K4 - Analyze; and its applications. (K3&K5)
K5 - Evaluate;
• 4 Understand and apply orthogonal functions, and Laplace and Fourier
K6 - Create
transforms. Further learn about number theoretic concepts for
cryptography (K2&K5)
• 5 Apply the concepts studied with certain selected examples and
compare, and analyze. (K4&K6)

Units
I Set theory: Operations on sets – Basic set identities – Relations and orderings – Functions -8 Hrs

II Linear algebra Part I: Linear vector spaces - Linear operators – vectors in n-dimensions – matrix
representation of vectors and operators in a basis – linear independence, dimension – inner
 product – Orthonormal basis –Eigenvalues and eigenfunctions of operators/matrices – Eigen
basis, Diagonalizing matrix – Quadratic forms – Complex matrices and forms - Hermitian and
Unitary operators/matrices. 15 Hrs
III Linear algebra Part II: Cayley-Hamilton Theorem - Gram-Schmidt process –Eigen values
using QR transformations – QR factorization - generalized eigenvectors –– singular value
decomposition and applications - pseudo inverse – least square approximations -Toeplitz
matrices and some applications. 10 Hrs
IV Laplace Transforms : Solution of linear differential equations with constant coefficients- – Unit
step function and Dirac delta function. Sturm-Liouville theory: Second order linear differential
equations . Strum-Liouville theory: Orthogonality of eigenfunctions – Illustration with
Legendre, Laguerre, Hermite, Chebyshev differential equations - expansion of polynomials.
Fourier Transforms: Fourier sine and cosine transforms – Fourier transform - convolution
theorem - Discrete Fourier transform and Fast Fourier transform. 15 Hrs
V Number Theory: Modular arithmetic - Fermat’s and Euler’s theorem – Testing for primality -
Chinese remainder theorem – Discrete logarithms – Groups – Rings – Fields - Finite fields –
GF(p) - Polynomial arithmetic – Finite fields of the form GF(2n). 12 Hrs

VI Implementation of methods/projects, performance measurement and comparison . 6 Hrs

Reading 1 [Link]
List
2 [Link]

3 [Link]
4 [Link]
Recomm 1. J P Tremblay and R Manohar, Discrete Mathematical Structures with Applications to
ended Computer Science, International Edition (McGraw-Hill, Singapore, 1987; Tata
Texts McGraw-Hill, New Delhi, 1997).
th
2. E Kreyszig, Advanced Engineering Mathematics, 10 Edition (Wiley, NY, 2011).
3. M D Greenberg, Advanced Engineering Mathematics, 2nd Edition, Prentice-Hall 1998.
4. R. Bronson, G. [Link], “Linear Algebra”, 2nd Ed., Academic Press, 2007.
5. R. Bronson, “Matrix Operation”, Schaum‟s Outline Series, 2nd Ed., McGraw Hill, 2011.
6. G. James, “Advanced Modern Engineering Mathematics”, 3rd edition, Pearson/Prentice
Hall, 2004.
7. P. V.O'Neil, “Advanced Engineering Mathematics” , 7th Ed., Cengage Learning, 2011.
8. W. Stallings, Cryptography and Network Security Principles and Practice, 7th
edition, Pearson Education, 2017.
9. D. R. Stinson and M. B. Paterson, Cryptography Theory and Practice, 4th
Edition, CRC Press 2019.
10. Hans Delfs , and Helmut Knebl, Introduction to Cryptography Principles and
Applications, 3rd Edition, 2015 Springer.
Course designed by Prof. P. Thangavel

Method of Evaluation:
 Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S M S M S L M L M
CO 2 S S L S S M L M L L
CO 3 S M S S S M L S M L
CO 4 S S S S S S M S L L
CO 5 M S S M M L S L L L
S-Strong M-Medium L-Low

MSIC422 Theory of Computation 3-1-0-4

Course Outcomes The main objectives of this course are to:

• To give an overview of the theoretical foundations of computer
science from the perspective of formal languages
• To illustrate finite state machines to solve problems in computing
• To explain the hierarchy of problems arising in the computer
sciences.
• To familiarize Regular grammars, context frees grammar.
Course Code MSIC422/Core

Title of the Theory of Computation

Course:
Credits: 3-1-0-4
Pre-requisites, if Students should know about the fundamentals of discrete mathematics,
any: data structures, and algorithms.
 Course • To understand the basic properties of formal languages and
Objectives grammars. (K1 & K2)
• Make grammars to produce strings from a specific language. (K2
K1 - Recall; K2 - & K3)
Understand; K3 - • To differentiate regular, context-free and recursively enumerable
Apply; K4 - languages. (K2 & K3)
Analyze; K5 - • To solve various problems of applying normal form techniques,
Evaluate; K6 - push down automata and Turing Machines. (K4 & K5)
Create
• To acquire concepts relating to the theory of computation and
computational models including decidability and
intractability.(K5 & K6)

Units
I Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite
Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite
Automata (NFA) – Finite Automata with Epsilon transitions. (12 Hrs)
II Regular Expression – FA and Regular Expressions – Proving languages not to be
regular – Closure properties of regular languages – Equivalence and minimization of
Automata. (12 Hrs)
III Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and
languages – Definition of the Pushdown automata – Languages of a Pushdown
Automata –Equivalence of Pushdown automata and CFG– Deterministic Pushdown
Automata. (15 Hrs)
IV Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL –
Turing Machines – Programming Techniques for TM. A language that is not
Recursively Enumerable (RE) – An undecidable problem RE – Undecidable
problems about Turing Machine – Post’s Correspondence Problem – The classes P
and NP. (16 Hrs)
Reading List 1. [Link]
2. [Link]
(Online) 3. [Link]

Recommende [Link] Linz, “An Introduction to Formal Languages and Automata”, Third
d Texts Edition ,Narosa, 2005
2. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata
Theory, Languages and Computations”, second Edition, Pearson Education,
2007.

Course designed by [Link]

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4 University’s
& K6 K5 & K6 common
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 L L L L L L L M L L
CO 2 M S L M S M M M S M
CO 3 M M M S M M S S M S
CO 4 M S M S S S M M S S
CO 5 S S M M M S S S S S
S-Strong M-Medium L-Low

MSIC423 Design and Analysis of Algorithms 3-1-0-4

Course Outcomes • Learn about simple problems and complexity of their solutions.
• To understand the role of algorithms in problem solving. Learn
and understand the asymptotic analysis of algorithms.
• Learn and analyze various algorithm design methods through
general principles and with select set of example problems.
• Conceptualize and use these methods to solve complex real world
problems particularly problems involved in industrial projects.
• 5 Critically analyze and compare the algorithms for a set of
selected example problems which are hard in nature with design
approaches like greedy, dynamic programming and branch and
bound etc.
Course Code MSIC423/Core

Title of the Design and Analysis of Algorithms

Course:
 Credits: 3-1-0-4
Pre-requisites, if Programming in any High level Programming Language and Data
any: Structures
Course • 1 To define the term Algorithm in the context of problem solving.
Objectives To make students understand the design and analysis process of
algorithms for simple problems. (K1&K2)
• 2 Understand various algorithm design methods, apply them for
problem solving and analyze the complexity for simple problems.
(K2&K3)
• 3 Study algorithm design methods for complex problems and
compare and analyze the complexity of approximate and exact
algorithms. (K3&K4)
• 4 Calculate and measure the performance of algorithms to
compare the results. Critically assess the performance. (K5&K6)
• 5 Differentiate the concepts studied with certain selected
examples and compare and generalize. (K5&K6)
▪
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
Units
I Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-
Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega
notation, Theta notation and Little oh notation, Probabilistic Analysis. 13 Hrs
II Disjoint Sets- disjoint set operations, union and find algorithms, Divide and conquer:
General method , applications - Binary search, Quick sort, Merge sort, Strassen’s matrix
multiplication. 12 Hrs

III Spanning trees, connected components and biconnected components. Greedy method:
General method, applications-Job sequencing with deadlines, knapsack problem, Minimum
cost spanning trees, Single source shortest path problem. 12 Hrs
IV Dynamic Programming: General method, applications-Matrix chain multiplication, 0/1
knapsack problem, All pairs shortest path problem, Travelling sales person problem.
Backtracking: General method, applications-n-queen problem, sum of subsets problem,
graph coloring, Hamiltonian cycles. 13 Hrs

V Branch and Bound: General method, applications - Travelling sales person problem, 0/1
knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution - Basic
concepts NP-Hard and NP-Complete problems. 10 Hrs

VI Algorithm implementation, performance measurement and comparison . 6 Hrs

Reading List 1 [Link]

2 [Link]
Recommende 1. Ellis Horowitz, Sartaj Sahni, S. Rajasekaran, “Fundamentals of Computer
d Texts Algorithms”, Second Edition, University Press, 2008.
2. Thomas [Link], Charles [Link], Ronald L. Rivest and Clifford
Stein,“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited,
2012
3. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures
andAlgorithms”, Pearson Education, Reprint 2006.
4. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1 & 3 Pearson
Education, 2009.
5. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer,
2008

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S M S M S L M L M
CO 2 S S L S S M L M L L
CO 3 S M S S S M L S M L
CO 4 S S S S S S M S L L
CO 5 M S S M M L S L L L
S-Strong M-Medium L-Low

MSIC424 Algorithms Lab 0-0-1-1

Course Outcomes • Learn about programming skills by implementing algorithms for
simple problems and measure the performance.
• To understand the asymptotic performance solutions simple
problems.
• Learn and analyze the implementation process of various
algorithm design methods.
• Conceptualize and use these methods to solve complex real world
problems particularly problems involved in simple industrial
projects and their implementation.
• 5 Critically analyze and compare the implementation methods
for various design approaches like greedy, dynamic programming
and branch and bound etc.
Course Code MSIC424/Core

Title of the Algorithms Lab.

Course:
Credits: 0-0-1-1
Pre-requisites, if Programming in any High level Programming Language and Data
any: Structures
Course • 1 To define the term Algorithm in the context of problem solving.
Objectives To make students understand the design and analysis process of
algorithms for simple problems. (K1&K2)
• 2 Understand various algorithm design methods, apply them for
problem solving and analyze the complexity for simple problems.
(K2&K3)
• 3 Study algorithm design methods for complex problems and
compare and analyze the complexity of approximate and exact
algorithms. (K3&K4)
• 4 Calculate and measure the performance of algorithms to
compare the results. Critically assess the performance. (K5&K6)
• 5 Differentiate the concepts studied with certain selected
examples and compare and generalize. (K5&K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
Units
I Simple sorting algorithms – recursion: Towers of Hanoi, permutation generation - average
run time computation and comparison. 6 Hrs
II Repeated squaring for computing x and primality test. Mergesort and Hoare’s partition
n

algorithm and quick sort – tree of recursive calls. 6 Hrs

III Graphs – representation, breadth first search and depth first search with spanning trees, Bi-
connected components 6 Hrs
IV Greedy methods – general knapsack, minimum cost spanning tree, Dijkstra’s single source
shortest path algorithm – Dynamic Programming: 0/1 knapsack problem 6 Hrs

V Backtracking: N-queens problem, Sum of Subsets problem – Branch and bound: Job
 scheduling and 0/1 knapsack problem. 6 Hrs

VI Project design, implementation, and comparison. 6 Hrs

Reading List 1 [Link]

2 [Link]
Recommende 1. Ellis Horowitz, Sartaj Sahni, S. Rajasekaran, “Fundamentals of Computer
d Texts Algorithms”, Second Edition, University Press, 2008.
2. Thomas [Link], Charles [Link], Ronald L. Rivest and Clifford
Stein,“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited,
2012
3. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures
andAlgorithms”, Pearson Education, Reprint 2006.
4. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1 & 3 Pearson
Education, 2009.
5. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer,
2008

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S M S M S L M L M
CO 2 S S L S S M L M L L
CO 3 S M S S S M L S M L
CO 4 S S S S S S M S L L
CO 5 M S S M M L S L L L
S-Strong M-Medium L-Low
MSIC425 Computer Networks 3-1-0-4

Course Outcomes • Learn and understand the basic concepts of networking and its
applications. To understand well established layered
architectures in computer networks
• Understand the concepts of the transmission medium, modulation
and multiplexing techniques
• Learn and understand well established error detection and
correction codes and various protocols used in dealing with point
to point and broad cast communications systems data link layer.
• Comprehend the design issues and to assess the routing and
congestion control algorithms.
• 5 Enumerate the transport layer service, conceptualize the
internet transport protocols and the network security.
Course Code MSIC425/Core

Title of the Computer Networks

Course:
Credits: 3-1-0-4
Pre-requisites, if Fundamentals of digital computers and Data Structures and algorithms.
any:
Course • 1 To define the computer networks and identify the taxonomy of
Objectives computer networks in terms of its transmission technology and
scalability. Outline the features of the OSI and TCP/IP network
K1 - Recall;
architectures (K1 & K2)
K2 - Understand;
• 2 Critically understand and assess various transmission media
K3 - Apply;
and algorithms for modulation and multiplexing.
K4 - Analyze;
• 3 Understand , apply and analyze various algorithms used for
K5 - Evaluate;
error correction and detection and transmission protocols in point
K6 - Create
to point for broad cast communication systems. (K2, K3 & K4)
• 4 Understand and evaluate well known algorithms used for
routing packets and avoid congestion in complex internetworks.
(K3&K4)
• 5 Conceptually understand the protocols used in end to end
communication to establish, and release connection and segment
transmission to provide reliable service to applications. Create
sample protocols and evaluate the performance. (K2,K5 &K6)
 Units
I Introduction - Uses of networks - Network architectures - OSI and TCP/IP reference
model and services – Example Networks . 7 Hrs

II Physical layer - Transmission media - Guided and wireless – Digital Modulation and
multiplexing – Public switched Telephone network. 12 Hrs

III Data link layer Design issues - error detection and correction - elementary data link
protocols - sliding window protocols - Packet over SONET- ADSL. MAC sublayer
protocols. 14 Hrs

IV Network layer-design issues – Routing and congestion control algorithms, Quality of

service, internetworking - Network layer in the INTERNET. 12 Hrs

V Transport layer – transport service - Addressing, Establishing & Releasing a

connection, Multiplexing, Crash Recovery, Internet transport protocol TCP, Network
security-cryptography. 10 Hrs

VI Create sample protocols, and implement. 6 Hrs

Reading List 1 [Link]

2 [Link]
3. [Link]
4. [Link]
5. Linux Network Administrators Guide, [Link]

Recommende 1. A. S. Tanenbaum, N. Feamster and D.J. Wetherall, 2021, Computer

d Texts Networks, 6th Edition, Pearson Education.
2. D. Bertsekas and R. Gallagher, 1992, Data Networks, Prentice hall of India, New
Delhi.
3. L. L Peterson and B. S Davie, “Computer Networks – A Systems Approach”,
MK Publishers, Fifth Edition, 2012
4.J. F Kurose and K. W Ross, “Computer Networking – A Top Down Approach”,
Eigth Edition, Pearson Education, 2021.

Course designed by: Prof. P. Thangavel and Ms. S. Gaythri Devi (Guest Faculty)

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4 University’s
& K6 K5 & K6 common
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S M S M S L M L M

CO 2 S S L S S M L M L L

CO 3 S M S S S M L S M L

CO 4 S S S S S S M S L L

CO 5 M S S M M L S L L L

S-Strong M-Medium L-Low

MSI C426 Artificial Intelligence 3-1-0-4

Course Outcomes • The main objectives of this course are to:

• Understand a historical perspective of AI and its foundations.
• Describe the basic principles of AI toward problem solving,
inference, perception, knowledge representation, and learning.
• Recognize the applications of AI techniques in intelligent agents,
expert systems, artificial neural networks and other machine
learning models.
• Explore the current scope, potential, limitations, and implications
of intelligent systems.
Course Code MSIC426/ Core

Title of the Artificial Intelligence

Course:
Credits: 3-1-0-4
Pre-requisites, if Student should have the knowledge of Discrete Mathematics.
 any:

Course On the successful completion of the course, student will be able to:
Objectives
• Define Artificial intelligence and identify problems for AI.
Recall (K1) Characterize the search techniques to solve problems and
Understand/Com recognize the scope of classical search techniques(K1)
prehend (K2) • Apply basic principles of AI in solutions that require problem
Apply Knowledge solving, inference, perception, knowledge representation, and
(K3) learning. (K2 & K3)
Analyze and • Demonstrate handling of uncertain knowledge and reasoning in
Evaluate (K4 and probability theory. (K3)
K5) • Explain and Evaluate learning methods in AI (K4 & K5)
• Conceptualize an ability to share in discussions of AI, its current
Create (K6) scope and limitations, and societal implications. (K5 & K6)
Units
I Defining AI- Acting Humanly (Turing Test Approach)- Thinking
Humanly(Cognitive Modeling Approach)- Thinking Rationally (laws of
thought approach)- Acting Rationally(Rational Agent Approach)-
Foundations of Artificial Intelligence- History of AI- AI techniques-
Expert Systems. (12 hrs)
II Defining the problem as a State Space Search Strategies: Breadth – first
Search- Depth- first search- Depth limited search - Iterative Deepening
depth first search. (10 hrs)
III Hill Climbing- Simulated Annealing- Best First Search: OR Graphs-
Heuristic Functions- Branch & Bound, A* Algorithm- AND –OR
graphs- AO* Algorithm. (10 hrs)
IV Representations and mappings- Approaches to knowledge
Representation- Procedural versus Declarative knowledge- Predictive
Logic: Representing Simple facts- Instance and Isa relationships in
Logic- Proposition versus Predicate Logic- Computable Functions and
Predicates- not- Rules of Inferences and Resolution-not- Forward versus
Backward Reasoning- Logic Programming and Horn Clauses.
Evolutionary Algorithms - Population Based Search: Genetic
Algorithms, Ant Colony Optimization, Dynamic programming,
Traveling Salesman Problem. (16 hrs)
V Foundations for Connectionist Networks- Biological Inspiration-
Different Architectures and output functions: Feed forward- Feedback-
Recurrent Networks- step- Sigmoid and different functions. Markov
decision processes -MDPs, policy evaluation, value iteration,
 Reinforcement learning- Monte Carlo, SARSA, Q-learning -
Exploration/exploitation, function approximation (12 Hrs)
Reading List Online
1. [Link]
2. [Link]
3. [Link]
4. [Link]
5. [Link]
Recommended 1. Russell, Stuart, and Norvig, Peter. Artificial Intelligence:
Texts A Modern Approach. N.p., CreateSpace Independent
Publishing Platform, 2016.
2. Nilsson, Nils Johan, and Nilsson, Nils J. Artificial
Intelligence: a new synthesis. United Kingdom, Morgan
Kaufmann Publishers, 1998.
3. Khemani, Deepak. A First Course in Artificial
Intelligence. India, McGraw Hill Education (India), 2013.
4. Back, Thomas. Evolutionary Algorithms in Theory and
Practice: Evolution Strategies, Evolutionary
Programming, Genetic Algorithms. United
Kingdom, Oxford University Press, 1995.
5. Gen, Mitsuo, and Yu, Xinjie. Introduction to Evolutionary
Algorithms. United Kingdom, Springer London, 2010.
6. Reinforcement Learning. Croatia, InTech, 2008.
Course Designed by [Link]

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Mapping with Programme Outcomes:

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 L L L L L L L M L L
CO 2 M S L M S M M M S M

CO 3 M M M S M M S S M S

CO 4 M S M S S S M M S S

CO 5 S S M M M S S S S S

S-Strong M-Medium L-Low

MSIC427 Database Management Systems 3-1-0-4

Course Outcomes 1. Compare the manual file system with data base
systems
2. Design efficient database structures
Draft SQL queries for data access and manipulation
3. Recognize suitable storage structures
Evaluate query performances
4. Explain the transaction processing steps and
procedures
Understand the concurrency and recovery protocols
5. Demonstrate different server architectures and their
functionalities
Recall the concepts and apply in the given case study
Course I Core

Title of the MSIC427 Database Management Systems

Course:
Credits: 4
Pre-requisites, if Good understanding of basics of computers and its functionality
any:
Course 1. Enumerate the purpose of design data base systems
Objectives Identify the valid user defined requirements ( K2 &
K1)
2. describe usage of normal forms
Learn the SQL statements for querying the data base
designed ( K2 & K3)
3. Summarize the working of the file storage structure
using different methods
calculate query performances( K3 & K4)
4. Generalize the transaction processing steps and
 procedures
Conceptualize the concurrency and recovery
protocols( K5 & K4)
5. Compare and contrast different server architectures
and their functionalities
Conceive and critically assess the given case study(
K5 & K6)
Units
I Introduction to File and Database systems- Database system
structure – Data Models – Introduction to Network and
Hierarchical Models – Relational Model – Relational Algebra
and Calculus. E-R model – diagram, generalization,
specialization- Data base design - Informal design guidelines
for relational schemas; functional dependencies; normal forms
based on primary keys, general definitions of 2nd and 3rd
normal forms; Boyce-codd normalforms.,4NF,5NF

II SQL – Data definition- Queries in SQL- Updates- Views

– Integrity and Security – Relational Database design –
Record storage and Primary file organization- Secondary
storage Devices- Operations on Files- Heap File- Sorted
Files- Hashing Techniques – Index Structure for files –
Different types of Indexes- B-Tree - B+Tree .
III Query processing- query optimization - Transaction
Processing – Introduction- Need for Concurrency control-
Desirable properties of Transaction- Schedule and
Recoverability- Serializability and Schedules –
Concurrency Control – Types of Locks- Two Phases
locking- Deadlock- Time stamp based concurrency
control
IV Recovery Techniques – Concepts- Immediate Update-
Deferred Update - Shadow Paging- advanced recovery
techniques - concepts of Database System Architectures:
Centralized and Client-Server Architectures – Server
System Architectures – Parallel Systems- Distributed
Systems – Parallel Databases- case studies and their
analysis and design.
V MOOC courses on SQL tutorials, Data base concepts in
SWAYAM, NPTEL and other platforms
 Reading List • [Link]
(Print and
Online)

Recommended • Abraham Silberschatz, Henry F. Korth and S.

Texts Sudarshan- “Database System Concepts”, Fourth
Edition, McGraw-Hill, 2020.
• Ramez Elmasri and Shamkant B. Navathe,
“Fundamental Database Systems”, Third Edition,
Pearson Education, 2003.
• Raghu Ramakrishnan, “Database Management
System”, Tata McGraw-Hill Publishing Company,
2003.
Course Designed By: Dr. [Link]

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )

Mapping with Programme Outcomes:

Map course outcomes for each course with programme outcomes (PO) in the 3-point scale
of Strong, Medium and Low

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S S M S S M M S L

CO 2 M S M M M S L L M L
CO 3 M M S M M S M L M L

CO 4 M M S M M M M S M L

CO 5 S S S S M S S S S S

S-Strong M-Medium L-Low

MSIC428 Database Management Systems Lab 0-0-2-2

Course Outcomes 1. Understand the usage of C# programming

2. Generalize data base connectivity procedure
3. Demonstrate SQL statements usage
4. Design simple applications with interactive queries
5. Develop simulated various real time applications
Course code MSIC428

Title of the Database Management Systems LAB

Course:
Credits: 2
Pre-requisites, if Good understanding of DBMS concepts and SQL queries
any:
Course 1. Identify the purpose of design data base systems (
Objectives K2 & K1)
2. describe the validity of user defined requirements
summarize the usage of normal forms ( K2 & K3)
3. Interpret the SQL statements and its results ( K3&
K4)
4. Summarize the working of the file storage structure
using different methods( K5 & K4)
5. Conceive and critically assess the real time data base
systems( K5 & K6)
Units
I Design of scientific calculator with memory- student
information system - employee payroll system - inventory
 control system - railway reservation/ cancellation system -
airline ticket and its operations - hospital management system -
library management system - bank loan operational system.

II MOOC courses on SQL tutorials, Data base concepts in

SWAYAM, NPTEL and other platforms
Reading List ● [Link]
(Print and
Online)
Recommended ● Abraham Silberschatz, Henry F. Korth and S. Sudarshan-
Texts “Database System Concepts”, Fourth Edition, McGraw-
Hill, 2020.
● Ramez Elmasri and Shamkant B. Navathe, “Fundamental
Database Systems”, Third Edition, Pearson Education,
2003.
● Raghu Ramakrishnan, “Database Management System”,
Tata McGraw-Hill Publishing Company, 2003.
Course Designed by : Dr. [Link]

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )

Methods of assessment:
Recall (K1) - Simple definitions, MCQ, Recall steps, Concept definitions
Understand/ Comprehend (K2) - MCQ, True/False, Short essays, Concept explanations, Short
summary or overview
Application (K3) - Suggest idea/concept with examples, Suggest formulae, Solve problems,
Observe, Explain
Analyse (K4) - Problem-solving questions, Finish a procedure in many steps, Differentiate
between various ideas, Map knowledge
Evaluate (K5) - Longer essay/ Evaluation essay, Critique or justify with pros and cons
Create (K6) - Check knowledge in specific or offbeat situations, Discussion, Debating or
Presentations

[Follow the same pattern for all courses]

Mapping with Programme Outcomes:

Map course outcomes for each course with programme outcomes (PO) in the 3-point scale
of Strong, Medium and Low
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S S M S S M M S S

CO 2 M S M M M S L S S S

CO 3 M M S M M S M S S S

CO 4 M M S M M M M S S S

CO 5 S S S S M S S S S S

S-Strong M-Medium L-Low

MSI C429 Machine Learning 3-1-0-4

Course Outcomes The main objectives of this course are to:

• To introduce the basic concepts and techniques of
Machine Learning.
• To understand regression methods, classification
methods, clustering methods.
• To Summarise with Dimensionality Reduction
Techniques.
• To introduce the concept of deep learning
techniques.
 Course Code MSI C429/Core

Title of the Machine Learning

Course:
Credits: 3-1-0-4

Pre-requisites, if Basic knowledge of programming, databases, files, and transactional

any: systems.
Course On the successful completion of the course, student will be able to:
Objectives
• Understand the basic concepts of Machine Learning and Deep
Recall (K1) learning. (K1 & K2)
• Identify the techniques suitable for a given problem. (K1 & K2)
Understand/Com
prehend (K2) • Study the problems using various machine learning and deep
learning techniques and implement the same using different
Apply Knowledge algorithms. (K2 & K3)
(K3) • Compare and differentiate different Dimensionality reduction
Analyze and techniques. (K4 & K5)
Evaluate (K4 and • Design application using machine and deep learning techniques
K5) which satisfies the industrial requirements.(K5 & K6)

Create(K6)
Units
I The Machine Learning Landscape - Types of Machine Learning Systems
- Main Challenges of Machine Learning - End-to-End Machine Learning
Project - Look at the Big Picture - Get the Data - Discover and Visualize
the Data to Gain Insights - Prepare the Data for Machine Learning
Algorithms - Select and Train a Model - Fine-Tune Your Model -
Launch, Monitor, and Maintain Your System. (12 Hrs)
II Tasks – Models – Features, Overfitting vs Under fitting. Bias Vs
Variance. Measuring Model Accuracy- Supervised Learning:
Classification – Binary classification and related tasks – Scoring and
ranking – class probability estimation – Multi-class classification - Naive
Bayes Regression, Multiple Regression Unsupervised Learning: –
Distance-based clustering – K-Means algorithm – Hierarchical
clustering. (12 Hrs)
III Decision trees – Ranking and probability estimation trees – tree learning
as variance reduction. Linear Models: The least-squares method–
 Support vector machines. Model ensembles: Bagging and random forests
– Boosting – Mapping the ensemble landscape. Machine Learning
experiments: What to measure – How to measure it – How to interpret
[Link]: Kinds of features – Feature transformations – Feature
construction and selection. (12 Hrs)
IV The perceptron - Neural Network - Linear Vs Nonlinear Models. How
Neural Network Works? -Architecture Neural Network, Deep Neural
Network -Gradient Descent -Cost Function -Derivatives-Computation
graph-Derivatives with a Computation Graph-Logistic Regression
Gradient Descent-Vectorization-Explanation of logistic regression cost
function-Explanation for Vectorized Implementation -Activation
functions-Derivatives of activation-Backpropagation-Random
Initialization. (12 Hrs)
V Hyper parameter tuning, Regularization and Optimization ,Forward
Propagation in a DNN -Getting your matrix dimensions right-Building
blocks of deep neural networks-Forward and Backward Propagation-
Parameters vs Hyper parameters-Train / Dev / Test - Bias / Variance-
Regularization -Why regularization reduces over fitting - Dropout
Regularization - Understanding Dropout -Other regularization methods -
Normalizing inputs -Vanishing / Exploding gradient-Weight
Initialization for Deep Networks -Numerical approximation of gradient-
Gradient checking . Train a logistic regression using Neural Network.
(12 Hrs.)
Reading List 1. [Link]
2. [Link]
(Online)
3. [Link]
4. [Link]
Recommended 1. Flach, P, “Machine Learning: The Art and Science of Algorithms that
Texts Make Sense of Data”, Cambridge University Press, 2012
2. AurélienGéron, “Hands-On Machine Learning with Scikit-Learn and
TensorFlow: Concepts, Tools, and Techniques to Build Intelligent
Systems”, First Edition, 2017 (Chapters 1 and 2)
3. Neural Networks and Deep Learning from Deep Learning
Specialization:[Link]
4. Improving Deep Neural Networks: Hyper parameter tuning,
Regularization and Optimization from Deep Learning
Specialization:[Link]

Course Designed by [Link]

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Mapping with Programme Outcomes:

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 L L L L L L L M L L

CO 2 M S L M S M M M S M

CO 3 M M M S M M S S M S

CO 4 M S M S S S M M S S

CO 5 S S M M M S S S S S

S-Strong M-Medium L-Low

MSI C430 DIGITAL IMAGE PROCESSING 3-1-0-4

Course Outcomes • Learn about the Basic concepts of Image representation and processing
techniques.
• Understand the various Image processing techniques such as Color
Transformation, Image Enhancement, compression and Filtering.
• Visualize the processed images and differentiate the spatial and
frequency domain to transform the idea into real world entity.
• Familiarize the use of Software tools like MATLAB, C++, Python or
java software.
• Understand how image is represented and apply the operations on images
to develop the real time applications.
Course I Core
Course Code MSI C430
Title of the DIGITAL IMAGE PROCESSING
Course:
Credits: L-T-P-C 3-1-0-4
 Pre-requisites Students should know any one programming basics of C++, Python or java,
Computer Graphics to study the 2D and 3D Array Representation.
Course The main objectives of this course are to:
Objectives • Study the fundamental components of image processing and machine
learning techniques. (K1 & K2)
• Understand the Programming Software’s and apply the project. (K1 &
K2)
• Know the in-depth knowledge of implementing the imaging concepts.
(K3 & K4)
• Understand the Image processing techniques (K2 & K3)
• To apply the concepts in real time applications (medical images, video
images etc). (K5 & K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
UNITS
Unit I INTRODUCTION OF IMAGE PROCESSING 12 hours
Introduction – The origin - Fundamental steps components - Image Sampling and Quantization –
Some basic relationship between pixels – Linear and nonlinear operations. Image Enhancement in
spatial domain – Some Basic Gray level transformation – Histogram processing- Enhancement using
Arithmetic Logic operations – Basics of spatial filtering – smoothing – sharpening – Image
Enhancement in frequency domain
Unit II COLOR IMAGE PROCESSING 11 hours
Color Image processing – color models – pseudo color Image processing – Smoothing – Sharpening –
Color transformation - Color segmentation
Unit III IMAGE COMPRESSION 12 hours
Wavelets – Multi resolution Processing – Image compression models – Lossy compression – Image
Compression standards.
Unit IV IMAGE SEGMENTATION 10 hours
Image segmentation – Edge Linking – Boundary Detection – Thresholding – Region Based
segmentation by morphological watersheds
Unit V CASE STUDIES 15 hours
Implement a Complete Project with reference to syllabus and online content-Team wise.
Total Lecture hours 60 hours
Reading List 1. R. C. Gonzalez and R. E. Woods, Digital image processing, 3/e. PH, 2007.
Recommended 1. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson, 1989
Texts
Related Online Contents [MOOC, SWAYAM, NPTEL, Websites etc.]
1. [Link]
2. [Link]
3. [Link]
4. [Link]
5. [Link]
Course Designed By: [Link]. Chithra
Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10
CO 1 M S M S M S M M L S
CO 2 S S L S S M L M S S
CO 3 S M S L S M L S S S
CO 4 S S S S S S M S M L
CO 5 S S S S L S M S S L
*S-Strong M-Medium L-Low

MSIC431 Data Analytics 3-0-1-4

Course Outcomes 1. Differentiate data mining, data analysis and data

analytics
2. Design efficient analytics procedures
Draft framework of analytics for given user
requirements
3. Recognize suitable classifier and cluster methods for
large data
Evaluate analytics results performances
4. Explain the data integrity and data security
Understand the analytical model design
 5. Demonstrate analytical methods with python
programming
Recall the concepts and apply in the given case study

Course I Core

Title of the MSIC431 Data Analytics

Course:
Credits: 4
Pre-requisites, if Good understanding of basics of computers and its functionality
any:
Course 1. Enumerate the types of data analytics models ( K2 &
Objectives K1)
2. Identify the valid data preprocessing techniques( K2 &
K1)
3. describe usage and implementation of various
classifiers( K2 & K3)
4. Learn the varied clustering techniques ( K2 & K3)
5. Summarize social network analytics( K3 & K4)
6. calculate analytics result performances( K3 & K4)
7. Generalize the model processing steps and procedures(
K5 & K4)
8. Conceptualize the descriptive, prescriptive analytics(
K5 & K4)
9. Compare and contrast explorative and predictive ( K5
& K6)analytics
10. Conceive and critically assess the given case study(
K5 & K6)
Units
I Basic nomenclature - Analytics process model - Analytics
model requirements - Types of data sources – Sampling - types
of data elements - Visual Data Exploration and Exploratory
Statistical Analysis - Missing Values - Outlier Detection and
Treatment - Standardizing Data – Categorization - weights of
evidence coding - Variable selection -Segmentation.
 II Predictive Analytics: Target Definition - Linear
Regression - Logistic Regression - Decision Trees -
Neural Networks - Support Vector machines - Ensemble
Methods - Multiclass Classification Techniques -
Evaluating Predictive Models.
III Descriptive Analytics: Association Rules - Sequence
Rules - Segmentation. Survival Analysis: Survival
Analysis Measurements - Parametric Survival Analysis.
IV Social Network Analytics: Social Network Definitions -
Social Network Metrics - Social Network Learning -
Relational Neighbor Classifier - Probabilistic Relational
Neighbor Classifier -Relational logistic Regression -
Collective Inference. Benchmarking - Data Quality -
Software – Privacy - Model Design and Documentation -
Corporate Governance. Example applications: Credit
Risk Modeling - Fraud Detection - Recommender
Systems - Web Analytics. Case study – data analytics
methodologies implementation using R and open source
data set.
V MOOC courses on NOSQL tutorials, Data analytics
concepts in SWAYAM, NPTEL and other platforms
Reading List ● [Link]
(Print and
● [Link]
Online)
● [Link]

Recommended ● Bart Baesens, 2014, Analytics in a Big Data World: The

Texts Essential Guide to Data Science and Its applications,
Wiley India Private Limited
● Michael Minelli, Michele Chambers, 2013, Big Data, Big
Analytics: Emerging Business Intelligence and Analytic
Trends for Today’s Businesses, Wiley CIO
● Stephan Kudyba, 2014, Big Data, Mining and Analytics:
Components of Strategic Decision Making, CRC Press.
Course Designed by : Dr. B. LAVANYA

Method of Evaluation:
 Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )

Mapping with Programme Outcomes:

Map course outcomes for each course with programme outcomes (PO) in the 3-point scale
of Strong, Medium and Low

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S S M S S M M S L

CO 2 M S M M M S L L M L

CO 3 M M S M M S M L M L

CO 4 M M S M M M M S M L

CO 5 S S S S M S S S S S

S-Strong M-Medium L-Low

MSIC432 Cryptography 3-1-0-4

Course Outcomes 1 Learn about classical cryptography methods.
2 To understand the role of symmetric key algorithms in security.
3 Learn and understand the use asymmetric algorithms through
general principles.
4 Understand secure hash algorithms, authentication codes and key
distribution schemes.
5 To apply the protocols for network security such as web security,
email security etc.
Course Code MSIC432/Core

Title of the Cryptography

Course:
Credits: 3-1-0-4
Pre-requisites, if Programming, Design of Analysis of Algorithms and Discrete
any: Mathematics, Computer Networks
Course • 1 To understand the role of modern cryptography network
Objectives security. To make students understand the classical and modern
cryptographic algorithms. Recall basic concepts of number
theory. (K1&K2)
• 2 Understand various symmetric key algorithms, and analyze
the complexity for these methods. Study and understand block
ciphers and stream ciphers (K2&K3)
• 3 Learn the principles behind asymmetric key algorithms.
Understand various such algorithms. (K3&K4)
• 4 Learn and understand secure hash algorithms and
authentication codes. (K5&K6)
• 5 Apply these algorithms for digital signature, key management
and authentication with applications to network security.
(K5&K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 – Create
Units
I Introduction - Classical encryption techniques – Block ciphers and DES – Review of
Number theory: Fermat’s and Euler’s theorem – Testing for primality - Chinese remainder
theorem –Polynomial arithmetic – Finite fields of the form GF(2n) - Discrete logarithms. 14
Hrs
II Introduction to AES - Block ciphers – Multiple encryption, triple DES, Stream ciphers –10
Hrs

III Public key cryptosystems - RSA algorithm - Diff – Hellman key exchange – Elgamal
cryptographic system – Elliptic curve cryptography. 12 Hrs
IV Hash functions - Hash functions based on cipher block chaining - Secure Hash algorithms
(SHA) – SHA-3 - Message authentication codes – Authentication functions - Message
 authentication codes (MAC) . 14 Hrs

V Introduction to Digital signatures, authentication, and key management. Web security –

email security. 10 Hrs

VI Sample implementations of algorithms. 6 Hrs

Reading List • 1 [Link] 106/105/106105031/

• 2 [Link]
• 3. Shaffi Goldwasser and Mihir Bellare, Lecture Notes on
Cryptography, Available in [Link]
• 4. Youtube lectures of Prof. Christof Paar
Recommende 1. Stallings, W., Cryptography and Network Security Principles and
d Texts Practice, sixth edition, Pearson Education, 2017.
2. Hoffstein J., Pipher J., Silverman J.H., An Introduction to Mathematical
Crptography, Springer, 2008.
3. D. R. Stinson and M. B. Paterson, Cryptography Theory and Practice, 4th
Edition, CRC Press 2019
4. Hans Delfs , and Helmut Knebl, Introduction to Cryptography Principles
and Applications, 3rd Edition, 2015 Springer.
5. C. Paar and J Pelzl, Understanding Cryptography, Springer, 2010

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)

Mapping with Programme Outcomes:

 PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 S S M S M S L M L M
CO 2 S S L S S M L M L L
CO 3 S M S S S M M S M L
CO 4 S S S S S S M S L L
CO 5 M S S M M L S L L L
S-Strong M-Medium L-Low

MSI C433 MACHINE LEARNING AND IMAGE PROCESSING LAB 0-0-2-2

• Learn about the Basic concepts of Image representation and Machine

Learning Tools and Applications.
• Understand the Machine learning platform: Python Scipy and Machine Learning
Library: scikit-learn in Python, Tenserflow2.0 /Keras
• Understand the concepts of Data Preprocessing, Supervised learning and
Course Outcomes Unsupervised learning techniques.
• Familiarize and implement the use of Machine Learning Digital Image
Processing algorithms.
• Understand how image is represented and apply the operations on images to
develop the real time applications.
Course I Core
Course Code MSI C433
Title of the MACHINE LEARNING AND IMAGE PROCESSING LAB
Course:
Credits: L-T-P-C 0-0-2-2
Pre-requisites Students should learn the Java or Python or MAT lab
The main objectives of this course are to:
• Study the fundamental components of image processing and machine
learning techniques. (K1 & K2)
Course • Understand the Programming Software’s and apply the project. (K1 & K2)
Objectives • Know the in depth knowledge of implementing the imaging concepts and
Machine learning algorithms. (K3 & K4)
 • Understand the Image processing, Preprocessing, Supervised and
Unsupervised learning algorithms. (K2 & K3)
• To apply the concepts in real time applications (medical images, video
images etc.). (K5 & K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
UNITS
Machine Learning Tools and Applications: 10 hours
Machine learning platform: Python Scipy.
Machine Learning Library: scikit-learn in Python, Tenserflow2.0
/Keras
1. Data Preprocessing:
a. Data Cleaning
b. Data Transformation
c. Data Reduction
Machine d. Feature extraction
Learning 2. Supervised learning:
a. Decision tree classification
b. Classification using Support Vector
Machines
c. Regression, Multiple Regression
d. Classification using Multilayer perceptron
3. Unsupervised learning:
a. K-Means clustering
b. Hierarchical clustering
Word2Vec
1 Train House Price Prediction Advanced Problem from Kaggle 10 hours
2. Implement a Classification Neural Network /Logistic
Mini Project
Regression from Scratch without using any framework except
Python and numpy
Digital Image Digital Image Processing: Basic image manipulation – reading, 10 hours
Processing writing, quantization, sub sampling - Basic Intensity
transformation - Histogram Processing-Filtering in spatial
domain-2D FFT and smoothing filters-Image coding using
transformations with Image compression algorithms-Color image
Enhancement with spatial sharpening.
Total hours 30 hours
Reading List 1. R. C. Gonzalez and R. E. Woods, Digital image processing, 3/e. PH, 2007.
2. Flach, P, “Machine Learning: The Art and Science of Algorithms that Make
Sense of Data”, Cambridge University Press, 2012
3. Aurélien Géron, “Hands-On Machine Learning with Scikit-Learn and
TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems”,
First Edition, 2017 (Chapters 1 and 2)
Recommended 1. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson, 1989
Texts 2. John D. Kelleher, Brian Mac Namee, Aoife D'Arcy, “Fundamentals of Machine
Learning for Predictive Data Analytics: Algorithms, Worked Examples, and
 Case Studies”, The MIT Press, First Edition, 2012

3. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT

Press, 2012
4. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Third
Edition, 2014
5. Tom Mitchell, "Machine Learning", McGraw-Hill, 1997
Related Online Contents [MOOC, SWAYAM, NPTEL, Websites etc.]
1. [Link]
2. [Link]
3. [Link]
4. [Link]
5. [Link]
Course Designed By: [Link]. Chithra and Dr.M. Sornam

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems
Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)
Mapping with Programme Outcomes:

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10
CO 1 S S S M M M M M M L
CO 2 S S S S S S S M M M
CO 3 S S S S S S S M M M
CO 4 S S S S S S S M M S
CO 5 S S S M M M M M M L
*S-Strong M-Medium L-Low
MSI C434 PROJECT WORK 0-0-15-15

Course Outcomes • Learn about the Basic concepts of necessary software to implement
selected project.
• Understand and design Software development life cycle.
• Apply the various software domains with database
• Analysis the project modules and create the framework.
• Perform Project related test and maintain software documents.
Course I Core
Course Code MSI C434
Title of the PROJECT WORK
Course:
Credits: L-T-P-C 0-0-15-15
Pre-requisites Students should know the software Engineering, software applications, tools and
database.
Course The main objectives of this course are to:
Objectives • To develop real time applications with directions of corporate companies.
(K1 & K2)
• Understand the Core topics (K1 & K2)
• Develop the commercial or scientific applications. (K3 & K4)
• To equip the students with real time exposure in order to make them
employable. (K2 & K3)
• Deploy the real time project as full stack developer. (K5 & K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
PROJECT WORK 18 weeks
Each student will do a project work in an industry or in the department with an external guide in the
industry and an internal guide in the department. The guides will periodically monitor the progress.
Course Designed By: All Faculty

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )
 PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10
CO 1 M S M S M S M M L S
CO 2 S S L S S M L M S S
CO 3 S M S L S M L S S S
CO 4 S S S S S S M S M L
CO 5 S S S S L S M S S L
*S-Strong M-Medium L-Low

MSI E406 Web based Application Development 3-0-0-3

Course • Generalize the various concept of hyper text markup language of the World wide
Outcomes: web
• Describe the various concept of extended markup language
• Understand the fundamentals of C# concepts and sample programming
• Obtain the fundamentals of [Link] and sample programming
• Summarise the fundamentals of DTHTML and Java script and sample
programming
Course 2: Elective
Title of the Web Based Application Development
Course:
Course MSIE406
Code:
Credits: L T P C
3 0 1 4
Pre- Student should know the fundamentals about internet, www, concept of web pages
requisites, if
any:
Course Students were able to
Objectives • Identify the Accessibility of variables and its scope of operations in .NET
Recall - K1 framework (K1)
Understand/ • Describe the HTML Control classes, Web Control Classes and its Events (K1,K2)
Comprehend • Employ the Validation Controls in developing a web based programs.
- K2 (K1,K3&K5)
Apply • Analyse the User Controls and Views for the Data Access in web pages (K5,K6).
Knowledge - • Critically access the Error Handing & Exception Handling (K4,K6)
K3 • Conceive the Data controls formatting, Selecting and editing in web based
Analyze and application. Theorise the Authentication and Authorization of Web events.
Evaluate - (K3,K4 & K6)
K4 and K5
Create -
K6
 UNITS
UNIT -I OVERVIEW OF [Link]
The .NET framework – The C# Language: Data types – Declaring variables- Scope and Accessibility-
Variable operations- Object Based manipulation- Conditional Structures- Loop Structures- Methods.
Types, Objects and Namespaces : The Basics about Classes- Value types and Reference types-
Understanding name spaces and assemblies - Advanced class programming.
UNIT-II DEVELOPING [Link] APPLICATIONS
The Anatomy of a Web Form – Writing Code - Visual Studio Debugging. Web Form Fundamentals: The
Anatomy of an [Link] Application - Introducing Server Controls - HTML Control Classes - The Page
Class - Application Events - [Link] Configuration. Web Controls: Web Control Classes - List
Controls - Web Control Events and AutoPostBack - A Simple Web Page.
UNIT-III ERROR HANDLING, LOGGING, AND TRACING
Error Handling, Logging, and Tracing: Common Errors - Exception Handling - Handling Exceptions -
Throwing Your Own Exceptions - Logging Exceptions - Page Tracing. State Management: View State -
Transferring Information Between Pages – Cookies - Session State - Session State Configuration -
Application State. Validation: Understanding Validation - The Validation Controls.
UNIT-IV RICH CONTROLS
The Calendar - The AdRotator - Pages with Multiple Views - User Controls and Graphics - User Controls
- Dynamic Graphics . Website Navigation: Site Maps - URL Mapping and Routing - The SiteMapPath
Control - The TreeView Control - The Menu Control. [Link] Fundamentals: The Data Provider
Model - Direct Data Access - Disconnected Data Access.

UNIT V DATA BINDING

Single-Value Data Binding - Repeated-Value Data Binding - Data Source Controls - The Data Controls:
The GridView - Formatting the GridView - Selecting a GridView Row - Editing with the GridView -
Sorting and Paging the GridView - Using GridView Templates - The DetailsView and FormView –
XML: The XML Classes - XML Validation - XML Display and Transforms. Website Security: Security
Fundamentals - Understanding Security - Authentication and Authorization - Forms Authentication -
Windows Authentication.
Reading List(Print and Online)

• Matthew MacDonald, "Beginning [Link] 4 in C# 2010", Apress 2010.

• [Link] Babu,”Web Technology”,2014
• Related online contents available at MOOC, SWAYAM,NPTEL, Websites etc.
• [Link]
• [Link]
Recommended Texts
• Crouch Matt J, “[Link] and [Link] Web Programming”, Addison Wesley 2002.
• Mathew Mac Donald, “[Link] Complete Reference”, TMH 2005
• J. Liberty, D. Hurwitz, “Programming [Link]”, Third Edition, O’REILLY, 2006.

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
K1, K2, K4 & K5 K1, K2, K4 & K6 K1, K2 ,K4, K5 & University
 K6 Norm

Methods of assessment:
Recall (k1), Understand / Comprehend (K2), Application (K3), Analyses (K4), Evaluate(K5),
Create(K6)

Mapping with Programme Outcomes:

Map course outcomes for each course with programme outcomes(PO) in the 3-point scale of Strong,
Medium and Low

Mapping with Programmers outcomes*

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10
CO1 M S M S M S L M L L
CO2 S S L S S S M L M M
CO3 L M S L M M S L S M
CO4 S M L M L L M M M S
CO5 M S S S S S M L M S
S-Strong M-Medium L-Low

MSI E407 Object Oriented Analysis and Design 3-0-0-3

Course Outcomes • Learn about the Basic concepts of Life cycle models.
• Understand the Use-case models to design diagrams.
• Familiarize the use of Rational Rose Software to develop the diagrams.
• Apply the tools to develop and test the real time design applications.
• Create the UML Diagrams
Course I ELECTIVE K1 & K2
Course Code MSI E407
Title of the Object Oriented Analysis and Design
Course:
Credits: L-T-P-C 3-0-0-3
Pre-requisites Students should know about the Object-oriented programming concepts of C++
or java and UML diagrams.
Course The main objectives of this course are to:
Objectives • Study the Life cycle Models with framework. (K1 & K2)
 • Know the in-depth knowledge of UML diagrams. (K2 &K3)
• Understand the UML Diagrams to apply real time Use cases to implement
real time projects. (K4 & K5)
• To apply the concepts in business environment. (K5 & K6)
• Create the UML designs to develop applications. (K5 & K6)
K1 - Recall; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate; K6 - Create
UNITS
Unit I LIFE CYCLE MODELS 10 hours
System Development - Object Basics - Development Life Cycle - Methodologies - Patterns -
Frameworks - Unified Approach - UML.
Unit II USE-CASE MODELS 10 hours
Use-Case Models - Object Analysis - Object relations - Attributes - Methods – Class and Object
responsibilities - Case Studies.
Unit III DESIGN PROCESSES 10 hours
Design Processes - Design Axioms - Class Design - Object Storage - Object Interoperability - Case
Studies.
Unit IV USER INTERFACE DESIGN 5 hours
Understanding how to search/Google bookmarking and Going to a specific website- Copy and paste
Internet content into your word file and emails- Understanding social media platforms such as Face
book- & Many more learn with best practices.
Unit V TESTING 5 hours
Quality Assurance Tests - Testing Strategies - Object orientation on testing - Test Cases - test Plans -
Continuous testing - Debugging Principles - System Usability - Measuring User Satisfaction - Case
Studies.
Unit V CASE STUDIES 5 hours
Design and Implement a Complete Project with reference to UML syllabus and online content-Team
wise.
Total Lecture hours 45 hours
Related Online Contents [MOOC, SWAYAM, NPTEL, Websites etc.]
1. [Link]
2. [Link]
Course Designed By: [Link]. Chithra

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
choice from each
 each 5 marks ) each 5 marks ) unit -- each 10
marks )

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10
CO 1 M S M S M S M M L S
CO 2 S S L S S M L M S S
CO 3 S M S S S M L S S S
CO 4 S S S S S S M S S S
CO 5 M S M S M S M M L S
*S-Strong M-Medium L-Low

MSIE408 Mathematics for Computer Science 3-0-0-3

Course ● 1 Learn and recall allied level mathematics for application problems.
Outcomes
● 2 To understand the role of linear algebra and matrix in computer science
problem solving.
● 3 Learn and understand unit step function and Dirac delta function. To
study orthogonal functions and Fourier transforms and understand their
use in computational problems.
● 4 Learn the concepts of number theory for cryptography.
● 5 Critically analyze and implement programs for the methods studied
for a set of selected example problems..
Course Code MSIC421/Core

Title of the Mathematics for Computer Science

Course:
Credits: 3-1-0-4
Pre- Allied level Mathematics
requisites, if
any:
 Course ● 1 To review and recall the concepts of set theory and make the students
Objectives understand the importance of the concepts. (K1&K2)

K1 - Recall; ● 2 Understand the concept of matrix and associated properties with

K2 - eigenvalues and eigenvectors. (K2&K5)
Understand;
● 3 Study further the properties of matrices with Gram-Schimdt process
K3 - Apply;
K4 - Analyze; and its applications. (K3&K5)
K5 - Evaluate; ● 4 Understand and apply orthogonal functions, and Laplace and Fourier
K6 - Create transforms. Further learn about number theoretic concepts for
cryptography (K2&K5)
● 5 Apply the concepts studied with certain selected examples and compare,
and analyze. (K4&K6)

Units
I Set theory: Operations on sets – Basic set identities – Relations and orderings – Functions -6 Hrs

II Linear algebra Part I: Linear vector spaces - Linear operators – vectors in n-dimensions – matrix
representation of vectors and operators in a basis – linear independence, dimension – inner
product – Orthonormal basis –Eigenvalues and eigenfunctions of operators/matrices – Eigen
basis, Diagonalizing matrix – Quadratic forms – Complex matrices and forms - Hermitian and
Unitary operators/matrices. 12 Hrs
III Linear algebra Part II: Cayley-Hamilton Theorem - Gram-Schmidt process –Eigen values
using QR transformations – QR factorization - generalized eigenvectors –– singular value
decomposition and applications - pseudo inverse – least square approximations -Toeplitz
matrices and some applications. 10 Hrs
IV Laplace Transforms : Solution of linear differential equations with constant coefficients- – Unit
step function and Dirac delta function. Sturm-Liouville theory: Second order linear differential
equations . Strum-Liouville theory: Orthogonality of eigenfunctions – Illustration with
Legendre, Laguerre, Hermite, Chebyshev differential equations - expansion of polynomials.
Fourier Transforms: Fourier sine and cosine transforms – Fourier transform - convolution
theorem - Discrete Fourier transform and Fast Fourier transform. 12 Hrs
V Number Theory: Modular arithmetic - Fermat’s and Euler’s theorem – Testing for primality -
Chinese remainder theorem – Discrete logarithms – Groups – Rings – Fields - Finite fields –
GF(p) - Polynomial arithmetic – Finite fields of the form GF(2n). 8 Hrs

VI Implementation of methods/projects, performance measurement and comparison . 6 Hrs

Reading ● 1 [Link]
List
● 2 [Link]

● 3 [Link]
● 4 [Link]
Recomm 5. J P Tremblay and R Manohar, Discrete Mathematical Structures with Applications to
ended Computer Science, International Edition (McGraw-Hill, Singapore, 1987; Tata
Texts McGraw-Hill, New Delhi, 1997).
th
6. E Kreyszig, Advanced Engineering Mathematics, 10 Edition (Wiley, NY, 2011).
7. M D Greenberg, Advanced Engineering Mathematics, 2nd Edition, Prentice-Hall 1998.
8. R. Bronson, G. [Link], “Linear Algebra”, 2nd Ed., Academic Press, 2007.
5. R. Bronson, “Matrix Operation”, Schaum‟s Outline Series, 2nd Ed., McGraw Hill, 2011.
6. G. James, “Advanced Modern Engineering Mathematics”, 3rd edition, Pearson/Prentice
Hall, 2004.
7. P. V.O'Neil, “Advanced Engineering Mathematics” , 7th Ed., Cengage Learning, 2011.
8. W. Stallings, Cryptography and Network Security Principles and Practice, 7th
edition, Pearson Education, 2017.
9. D. R. Stinson and M. B. Paterson, Cryptography Theory and Practice, 4th
Edition, CRC Press 2019.
10. Hans Delfs , and Helmut Knebl, Introduction to Cryptography Principles and
Applications, 3rd Edition, 2015 Springer.
Course designed by Prof. P. Thangavel

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20 20 60 100 As per
University’s
K1, K2, K4 &K5 K1, K2, K3, K4 K1, K2, K3, K4
common
& K6 K5 & K6
systems

Methods of assessment: (As per common pattern.) Recall (K1), Understand/ Comprehend
(K2), Application (K3), Analyse (K4), Evaluate (K5), Create (K6)

Mapping with Programme Outcomes:

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S M S M S L M L M
CO 2 S S L S S M L M L L
CO 3 S M S S S M L S M L
CO 4 S S S S S S M S L L
CO 5 M S S M M L S L L L
S-Strong M-Medium L-Low

MSI E409 Programming in C 3-0-0-3

Course Outcomes 1. Compare procedure and object oriented programming

2. Learn the designcomponents of computer and its
architecture
Explain the C programming syntax and semantics to
code
3. Understand the various functionalities available in C
programming
Demonstrate different data types, and data structures
in C
4. Recognize and select necessary input, output functions
for specific usage
Recognize suitable types of called functions
5. Designdifferent methods for output presentation
Recall the concepts and apply in the given case study
Course I Elective

Title of the MSIE409 Programming in C

Course:
Credits: 3
Pre-requisites, if Good understanding of basics of computers and its functionality
any:
Course 1. Enumerate the purpose of varied data types in C
Objectives Identify the valid user defined requirements and
suggest the respective input, output and memory
functions ( K1 & K2)
2. describeusage of pointers and struct usage
Learn the varied methods for file operations( K3 &
K4)
3. Summarize the data structure using C( K5 & K4)
4. Implementation of the functions and procedures in C (
K5 & K6)
5. Conceptualize the exceptions in C( K5 & K6)
Conceive and critically assess the given case study
Units
I Getting started with C- Constants and Variables - Data types
and sizes - Storage classes – Operators – Expressions - C
instructions – Input / Output functions - Decision Control
structures - Case control structure - Loop control structure—
Arrays - Strings

II Functions - Passing values between functions - Function

declaration - Structures and Unions - Bit wise operations
–Pointers - Pointers and Arrays
III Pointers and function - Pointers and Structures - Dynamic
memory allocation- File management - Creating , Processing ,
Opening and Closing a File , Command line Arguments.

IV MOOC courses on fundamentals of computing,

programming in C in SWAYAM, NPTEL and other
platforms
Reading List ● [Link]
(Print and onlinecourses&query_computed=1
Online)
● [Link]
programming
 Recommended • E. Balagurusamy, “Programming in ANSI-C”, TMH, 5/e, 2012
Texts • Sinha P., Sinha P., “Foundation of Computing”, BPB Publication, 1st
Edition,2003
• Rajaraman V., “Computer Fundamentals” – ISBN 0B- 87692-387-2,
5/e, 2010

Course designed by : Dr. B. LAVANYA

Method of Evaluation:
Sessional I Sessional II End Semester Total Grade
Examination
20- (Section A 20- (Section A 60- (Section A K1- 100 As per
K1-5 – answer all K1-5 – answer all 5 – answer all – UNOM
- each1 mark & - each1 mark & each 2 mark & guidelines
Section B K2, K3, Section B K2, K3, Section B K2, K3,
K4, K5 – any 3/5 K4, K5 – any 3/5 K4, K5 – internal
each 5 marks ) each 5 marks ) choice from each
unit -- each 10
marks )

Mapping with Programme Outcomes:

Map course outcomes for each course with programme outcomes (PO) in the 3-point scale
of Strong, Medium and Low
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10

CO 1 M S S M S S M M S L

CO 2 M S M M M S L L S S

CO 3 M M S M M S M L S S

CO 4 M M S M M M M S S S

CO 5 S S S S M S S S S S

S-Strong M-Medium L-Low