Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

4 - 4
Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instruction for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire [Link] question should be objective, single line
answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus. Every unit shall have
two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of
the two questions in the unit. Individual questions may contain upto 5 sub-parts / [Link] Unit shall have a marks
weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard / level of the
questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log-tables / data – tables may be specified if required.
Course Objectives:
1: To understand Complex series methods.
2: To understand Complex analysis
3: To understand Fourier and Laplace methods
4: To understand how to solve specific formulated engineering problems using PDE methods.
Course Outcomes (CO):
CO1: Ability to use Complex series methods.
CO2: Ability to use Complex analysis to solve formulated engineering problems
CO3: Ability to use Fourier and Laplace methods to solve formulated engineering problems
CO4: Ability to solve specific formulated engineering problems using PDE methods.
Course Outcomes (CO to Programme Outcomes (PO) Mapping (scale 1: low, 2: Medium, 3: High
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 2 3 3 3 1 - - - - - 1 2
CO2 2 3 3 3 1 - - - - - 2 2
CO3 2 3 3 3 1 - - - - - 2 2
CO4 2 3 3 3 1 - - - - - 2 2
Unit I
Complex Analysis – I : Complex Numbers and Their Geometric Representation, Polar Form of Complex Numbers. Powers andRoots,
Derivative. Analytic Function, Cauchy–Riemann Equations. Laplace’s Equation, Exponential Function, Trigonometric and
Hyperbolic Functions. Euler’s Formula, de’Moivre’s theorem (without proof), Logarithm. General Power. Principal
[Link] and Zeros. Infinity,
Line Integral in the Complex Plane, Cauchy’s Integral Theorem, Cauchy’s Integral Formula, Derivatives of Analytic Functions,
Taylor and Maclaurin Series.
Unit II
Complex Analysis – II: Laurent Series, Residue Integration Method. Residue Integration of Real Integrals,
Geometry of Analytic Functions: Conformal Mapping, Linear Fractional Transformations (Möbius Transformations), Special
Linear Fractional Transformations, Conformal Mapping by Other Functions, Applications: Electrostatic Fields, Use of Conformal
Mapping. Modeling, Heat Problems, Fluid Flow. Poisson’s Integral Formula for Potentials
Unit III
Laplace Transforms: Definitions and existence (without proof), properties, First Shifting Theorem (s-Shifting), Transforms of
Derivatives and Integrals and ODEs, Unit Step Function (Heaviside Function).Second Shifting Theorem (t-Shifting), Short Impulses.
Dirac’s Delta Function. Partial Fractions, Convolution. Integral Equations, Differentiation and Integration ofTransforms. Solution
of ODEs with Variable Coefficients, Solution of Systems of ODEs. Inverse Laplace transform and its properties.
Fourier Analysis: Fourier Series, Arbitrary Period. Even and Odd Functions. Half-Range Expansions, Sturm–Liouville Problems.
Fourier Integral, Fourier Cosine and Sine Transforms, Fourier Transform. Usage of fourier analysis for solution of ODEs. Inverse
Fourier transform and its properties.

Unit IV
Partial Differential Equations (PDEs): Basic Concepts of PDEs. Modeling: Vibrating String, Wave Equation. Solution by Separating
Variables. Use of Fourier Series. D’Alembert’s Solution of the Wave Equation. Characteristics. Modeling: Heat Flow from a Body
in Space. Heat Equation:Solution by Fourier [Link] Two-Dimensional Heat Problems. Dirichlet Problem.
Heat Equation: Modeling Very Long [Link] by Fourier Integrals and Transforms. Modeling: Membrane, Two-Dimensional
Wave Equation. Rectangular Membrane. Laplacian in Polar Coordinates. Circular Membrane. Laplace’s Equation in Cylindrical and
Spherical Coordinates. Potential. Solution of PDEs by Laplace Transforms.
Textbooks:
1. Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley, 10th Ed., 2011.

References:

Applicable from Academic Session 2024-25 Page 31 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: AEC-213 / AEC 212 Paper: Engineering Economics L T/P C

Paper ID: 2 0 2
Prerequisite Paper:
Marking Scheme:
1. Teacher’s Continuous Evaluation: 40 marks
2. Term and Theory Examinations: 60 marks
Guidelines for Paper Setter(s):
1. There should be 9 questions in the term end examinations question paper.
2. The first question should be compulsory and cover the entire syllabus. This question should be objective, single
line answers or short answer type questions of total 20 marks.
3. Apart from question one which is compulsory, rest of the paper shall consist of four units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall
be asked to attempt only one of the two questions in the unit. Individual questions may contain up to five sub-
parts/sub-questions. Each unit shall have a marks weightage of 10.
4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of
the questions to be asked should be at the level of the prescribed text book.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required
Course Outcome (CO):
CO 1 Ability to understand economic analysis.
CO 2 Ability to understand and use cash flow method.
CO 3 Ability to determine economic life of an asset and replacement method
CO 4 Ability to do depreciation analysis and inflation adjustment
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 - 1 - - 1 2 3 - - - 3 1
CO2 - 1 - - 1 2 3 - - - 3 1
CO3 - 1 - - 1 2 3 - - - 3 1
CO4 - 1 - - 1 2 3 - - - 3 1

UNIT I
Introduction, Flow in an economy, Law of Supply and Demand, Concept of Engineering Economics, Elements of Cost,
Break-Even Analysis, P/V ratio, examples of simple economic analysis, Interest Formulas and Their Applications.

UNIT II
Present Worth Method of Comparison: Introduction, Revenue Dominated Cash Flow Diagram, Cost- Dominated
Cash Flow Diagram
Future Worth Method: Introduction, Revenue Dominated Cash Flow Diagram, Cost-Dominated Cash Flow Diagram
Annual Equivalent Method: Introduction, Revenue Dominated Cash Flow Diagram, Cost-Dominated Cash Flow
Diagram, Alternate approach.
Rate of Return Method.

UNIT III
Replacement and Maintenance Analysis: Introduction, Types, Determination of economic life of an asset,
replacement method.
Depreciation: Introduction and methods of depreciation (Straight line, Declining Balance, Sum of the Years Digit
method, Sinking fund method, Service output method). Evaluation of public alternative.

UNIT IV
Inflation Adjustment: Introduction, Procedure to adjust Inflation, Inflation Adjusted Economic Life of Machines.
Inventory Control and Methods, Make or buy decision, Project Management: Introduction,
Phases, CPM, Gantt/Time Chart, PERT. Value Analysis / Value Engineering

Textbooks:
1. R. Panneerselvam, Engineering Economics, 2nd ed. New Delhi, India: PHI Learning, 2013.
2. Chan S. Park, Fundamentals of Engineering Economics, 5th ed., Pearson, 2020.

Reference:
1. Leland T. Blank and Anthony J. Tarquin, Engineering Economy, 8th ed., McGraw-Hill, 2019.

Applicable from Academic Session 2024-25 Page 46 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: PC-202 Paper: Theory of Computation L T/P C

Paper ID: 4 0 4
Prerequisite Paper:
Marking Scheme:
1. Teacher’s Continuous Evaluation: 40 marks
2. Term and Theory Examinations: 60 marks
Instructions for paper setter
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective,
single line answers or short answer type questions of total 15 marks.
3. Apart from question one which is compulsory, rest of the paper shall consist of four units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall
be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-
parts/sub-questions. Each unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard
/ Level of the questions to be asked should be at the level of the prescribed text box.
5. The requirement of (scientific) calculators/log tables/data-tables may be specified if required.
Course Objectives:
1. To understand Automata (Deterministic and Non-Deterministic) and Language Theory
2. To understand Context Free Grammar (CFG), Parse Trees and Push Down Automata
3. To introduce the concepts of Turing Machines and Computability Theory
4. To understand Complexity Theory (NP-completeness NP-hardness) and Space complexity
Course Outcomes (CO)
CO 1 Ability to understand the design principles of abstract computational models such as Finite
Automata, Pushdown Automata, and Turing Machines.
CO 2 Ability to analyze the recognizability (decidability) of grammar (language) with specific
characteristics through these abstract models.
CO 3 Ability to analyze the computational complexity of problems to decide what makes some problems
computationally hard and others easy?
CO 4 Ability to deliberate the problems that that are solvable by machines and those that are unsolvable
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 3 2 2 2 - - - 2 1 - 3
CO 2 3 2 3 3 2 - - - 2 1 - 3
CO 3 3 3 2 2 2 - - - 2 1 - 3
CO 4 3 2 2 3 2 - - - 2 1 - 3

Unit-I
Automata and Language Theory: Chomsky Classification, Finite Automata, Deterministic Finite Automata (DFA),
Non-Deterministic Finite Automata (NFA), Regular Expressions, Equivalence of DFAs, NFAs and Regular Expressions,
Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression,
Arden Theorem, Closure properties of Regular grammar, Non-Regular Languages, Pumping Lemma, Minimization
of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem, Decision properties of Regular
Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and
Limitation of FA.

Unit-II
Context Free Languages: Context Free Grammar (CFG), Parse Trees, Ambiguity in Grammar, Ambiguous to
Unambiguous CFG, Parsing, LL(K) grammar, Simplification of CFGs: Elimination of Useless symbols, epsilon
productions, and unit productions from CFGs, Normal forms for CFGs: CNF and Greibach Normal Form (GNF), Push
Down Automata (deterministic and non-deterministic) (PDA), Equivalence of CFGs and PDAs, CFG to PDA and PDA
to CFG, two stack PDA, Pumping Lemma, Closure properties of CFLs, decision problems for CFLs.

Unit-III
Turing Machines and Computability Theory: Definition, design and extensions of Turing Machine, Equivalence of
various Turing Machine Formalisms, Church – Turing Thesis, Decidability, Halting Problem, Reducibility and its use
in proving undecidability, Rices theorem, Undecidability of Posts correspondence problem., Recursion Theorem and
its significance, Classification of languages: Recursive and Recursively Enumerable (r.e.) languages, existence of non-
recursively enumerable (non-r.e.) languages, informal proofs demonstrating unsolvability of certain computational

Applicable from Academic Session 2024-25 Page 49 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

problems.

Unit-IV
Computational Complexity Classes: Definition of class P as the consensus class of tractable problems, Classes NP,
co-NP, and their significance, Polynomial-time reductions and their role in complexity theory, NP-completeness and
NP-hardness with examples, Cook-Levin Theorem (including proof) and its implications, NP-complete problems in
different domains: Graph problems: Clique, Vertex Cover, Independent Set, Hamiltonian Cycle, number problem
(partition), set cover, Space Complexity: PSPACE and NPSPACE complexity classes, Savitch’s Theorem (with proof)
and its impact on space complexity, Probabilistic Computation and the BPP Class, Interactive Proof Systems and the
IP Class, Relativized Computation and the concept of oracles.

Textbook(s):
1. M. Sipser, Introduction to the Theory of Computation, Cengage Learning, 3rd ed., 2012.
2. J. Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Languages, and Computation, 3rd ed.,
Pearson, 2008.
References:
1. P. Linz, An Introduction to Formal Languages and Automata, 7th ed., Viva Books, 2022.
2.M. Mozgovoy, Algorithms, Languages, Automata, and Compilers, Jones and Bartlett, 2009.
3. D. Cohen, Introduction to Computer Theory, 2nd ed., Wiley, New York, 2007.
4. J. C. Martin, Introduction to Languages and the Theory of Computation, 4th ed., TMH, 2002.
5. K. L. Mishra and N. Chandrasekharan, Theory of Computer Science: Automata, Languages and Computation, PHI,
2006.
6. A. Benoit, Y. Robert, and F. Vivien, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis,
CRC Press, 2014.

Applicable from Academic Session 2024-25 Page 50 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: PC-204 Paper: Software Engineering L T/P C

Paper ID: 3 0 3
Prerequisite Paper:
Marking Scheme:
1. Teacher’s Continuous Evaluation: 40 marks
2. Term and Theory Examinations: 60 marks
Instructions for paper setter
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective,
single line answers or short answer type questions of total 15 marks.
3. Apart from question one which is compulsory, rest of the paper shall consist of four units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall
be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-
parts/sub-questions. Each unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard
/Level of the questions to be asked should be at the level of the prescribed text box.
Course Objectives:
1. To introduce the concepts of Software engineering, software processes and its models
2. To understand Software requirements analysis, SRS document, software metrics and system
modelling
3. To understand fundamentals of Software Design, Software Quality and software maintenance
4. To understand Software Testing and System Security
Course Outcomes (CO)
CO 1 Ability to understand and apply the core principles and practices of software engineering.
CO 2 Ability to design, develop, and maintain reliable and efficient software systems.
CO 3 Ability to create and implement effective test cases using a variety of software testing methodologies
CO 4 Ability to discover how to analyze and assess the software quality, evolutionary process and security.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 3 3 2 3 - - - 2 3 2 3
CO 2 3 3 3 3 3 - - - 2 3 3 3
CO 3 3 3 2 2 3 - - - 2 3 2 3
CO 4 3 3 2 3 3 - - - 2 3 2 3

UNIT - I
Introduction: Software Components, Software Characteristics, Software Crisis, Software processes and its models
(waterfall, incremental development, spiral model, re-use-oriented model, prototype),
An Introduction to Non-Traditional Software Development Process: Rational Unified Process, Rapid Application
Development. Process activities, Process improvement (CMM Levels), Software Reuse. Agile Development model,
plan driven vs agile model of development, agile methods and development techniques (user stories, refactoring,
test first development, pair programming, agile project management (SCRUM agile method).

UNIT - II
Requirement Engineering: Functional and non-functional requirements, requirement elicitation, use case
development, requirement analysis and validation, requirement review or requirement change, SRS
document. Size Estimation: Software Size, LOC and function point, cost and effort estimation, COCOMO, ISO
9001:2015 Certification, Halstead’s Metrics & Software Measurement Techniques, Reliability Metrics & Models, Risk
Management & Scheduling Techniques (PERT, Gantt Charts), CASE Tools for Requirement Engineering. System
modelling: Interaction models: Use case diagram, sequence diagrams, Structural models: class diagrams,
generalization, aggregation, Behavioural models: ER diagrams, Data flow diagrams, data dictionaries.

UNIT - III
Software Design: Architectural views and patterns, Modularity (cohesion and coupling), information hiding,
functional independence, function-oriented design, object-oriented design, SOA, SAAS, Design Patterns (Singleton,
Factory, Observer), UML Modelling (Class, Sequence, State Diagrams). Software Quality: McCall’s Quality Factors,
ISO 9126 Quality Factors, Quality Control, Quality Assurance, Software Reliability, Software Configuration
Management. Software Evolution: Evolution process, legacy system, Software maintenance: Maintenance
prediction, Software Maintenance Strategies (Corrective, Adaptive, Perfective, Preventive Maintenance), Re-
Engineering, Reverse Engineering, Refactoring.

Applicable from Academic Session 2024-25 Page 51 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

UNIT –IV
Software Testing: verification, validation, Development testing (unit testing, component testing, system testing,
Test Driven Development (TDD), Release Testing (Requirement based testing, scenario testing, performance
testing), User testing (alpha, beta and acceptance testing), Regression Testing, Stress Testing, Mutation Testing &
Fuzz Testing. System Security: Reliability engineering, reliability requirements (functional and non-functional) and
its measurement, safety engineering: safety critical systems, its requirement, security engineering and its
requirements, security guidelines.

Textbook(s):

1. I. Sommerville, Software Engineering, 10th ed. Pearson, 2018.

2. K. K. Aggarwal and Y. Singh, Software Engineering, 4th ed. New Delhi, India: New Age International Publishers,
2022.

References:

[1] P. Jalote, A Concise Introduction to Software Engineering. Springer, 2008.

[2] R. S. Pressman, Software Engineering: A Practitioner’s Approach, 8th ed. McGraw-Hill International Edition, 2010.
[3] C. Kaner, J. Falk, and N. Quoc, Testing Computer Software, 2nd ed. New York: Van Nostrand Reinhold, 1993.
[4] G. Aszic, Specification by Example. Manning Publications, 2011.
[5] K. Beck, Test-Driven Development By Example. Pearson Education.
[6] B. Beizer, Software System Testing and Quality Assurance. New York: Van Nostrand Reinhold, 1984.
[7] M. Cohn, Software Development Using Scrum: Succeeding with Agile. Pearson Education.

Applicable from Academic Session 2024-25 Page 52 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: PC 206 Paper: Computer Networks L T/P C

Paper ID: 4 0 4
Prerequisite Paper: None
Marking Scheme :
1. Teacher’s Continuous Evaluation : 40 marks
2. Term and Theory Examinations : 60 marks
Instructions for paper setter
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective,
single line answers or short answer type questions of total 15 marks.
3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall
be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-
parts/sub-questions. Each unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard
/level of the questions to be asked should be at the level of the prescribed text box.
5. The requirement of (scientific ) calculators/log tables/data-tables may be specified if required.
Course Objectives :
1. To introduce fundamentals of Data communication and Computer Networking
2. To impart Physical layer concepts and data link layer functions
3. To create awareness about data link control, channel access mechanisms and data link protocols
4. To understand Networking, addressing, routing protocols and transmission control protocol
Course Outcomes (CO) :
CO 1 Ability to understand the concepts of computer networks, OSI model and TCP/IP model.
CO 2 Ability to understand the Data link layer and Transport Layer concepts.
CO 3 Ability to understand the network layer function, routing protocols and application layer protocols.
CO 4 Ability to understand Network Security, QoS, and Network Management.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 3 3 2 2 - - - 3 2 2 3
CO 2 3 3 3 2 2 - - - 3 2 2 3
CO 3 3 3 3 2 2 - - - 3 2 2 3
CO 4 3 3 3 2 2 - - - 3 2 2 3

UNIT I
Overview, Types of computer networks: LAN, MAN, WAN, Wireless and Wired networks, broadcast and point-to-
point networks, Network topologies; protocol suites: TCP/IP and OSI, History, Standard.
Physical Layer and Transmission Media: Data and Signals, Digital Transmission, Analog Transmission, Bandwidth
utilization, Multiplexing : Frequency Division, Time Division, Wavelength Division, Transmission Media, Switching:
Circuit Switching, Message Switching, Packet Switching.

UNIT II
Data-Link Layer (Wired Networks): Introduction, DLC, Multiple Access Protocols, Wired LANS (Ethernet, others)
Data-Link Layer (Wireless Networks): Introduction, IEEE 802.11, Bluetooth, WiMAX, Cellular telephony, Satellite
Networks, Mobile IP.
Transport Layer: Protocols: simple, stop-and-wait, GBN, Selective repeat, Bidirectional protocols, Internet Transport
Layer protocols, UDP, TCP

UNIT III
Network Layer: Introduction, Addressing : Internet address, subnetting, IPv4, ICMPv4, Unicast Routing, Multicast
routing, IPV6, ICMPv6.
Application Layer: Application layer paradigm, Client-server paradigm, Standard Client Server Applications, P2P,
Socket Interface programming.

UNIT IV
Multimedia and QoS: Data types, streaming of audio/video, real-time interactive protocols, Quality of Service.
Network Management: Introduction, SNMP, ASN.1

Applicable from Academic Session 2024-25 Page 53 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Security: Introduction, Ciphers, Application layer security, transport layer security, network layer security,
packet filter firewall, proxy firewall. Programming: Socket programming.

Textbook(s):
1. B. A. Forouzan and F. Mosharraf, “Computer Networks: A Top-Down Approach”, TMH, 2012.
2. James F. Kurose and Keith W.,"Computer Networking: A Top-Down Approach", 7th Edition, Pearson Education,
2017.
References:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 5th Edition, Tata McGraw Hill, 2013.
2. Andrew S. Tanenbaum and David J. Wetherall, “Computer Networks”, 6th Edition, Pearson Education India 2021.
3. Larry L. Peterson and Bruce S. Davie, "Computer Networks: A Systems Approach", 6th Edition, Elsevier, 2021.
4. Jerry FitzGerald, Alan Dennis and Alexandra Durcikova, “Business Data Communications and Networking”, 14th
Edition, John Wiley & Sons, 2020.
5. William Stallings, "Data and Computer Communications", 10th Edition, Pearson Education, India, 2017.

Applicable from Academic Session 2024-25 Page 54 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: PC 208 Paper: Artificial Intelligence & Machine Learning L T/P C
Paper ID: 4 0 4
Prerequisite Paper:
Marking Scheme:
1. Teacher’s Continuous Evaluation: 40 marks
2. Term and Theory Examinations: 60 marks
Guidelines for Paper Setter(s):
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective,
single line answers or short answer type questions of total 20 marks.
3. Apart from question one which is compulsory, rest of the paper shall consist of four units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall
be asked to attempt only one of the two questions in the unit. Individual questions may contain up to five sub-
parts/sub-questions. Each unit shall have a marks weightage of 10.
4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level
of the questions to be asked should be at the level of the prescribed text book.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required
Course Outcome (CO):
CO 1 To introduce students to the fundamentals of Artificial Intelligence, focusing on intelligent agents,
problem-solving techniques, and search algorithms for effective decision-making.
CO 2 To familiarize students with various machine learning paradigms and emerging learning techniques
for data-driven decision making.
CO 3 To equip students with core supervised and unsupervised learning techniques, neural networks, and
model evaluation methods for building intelligent systems.
CO 4 To develop understanding of knowledge representation, logical reasoning, and probabilistic
inference with applications in AI-driven systems.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 3 2 2 1 2 2 1 - 2 2 3 3
CO2 3 3 2 2 2 - - - 2 2 2 3
CO3 3 3 2 3 2 - - - 2 2 2 3
CO4 3 3 2 3 2 - - - 2 2 2 3

Unit-1
Introduction to Artificial Intelligence: Definition and goals of Artificial Intelligence, History and evolution of AI,
Intelligent agents and environments, Problem-solving using AI techniques, Turing test and its significance. Problem
Solving and Search Algorithms: Problem formulation and state space representation; Uninformed search
algorithms: Breadth-First Search, Depth-First Search, Uniform-Cost Search; Informed search algorithms: A* Search,
Best-First Search; Heuristic functions and their properties; Constraint satisfaction problems and backtracking
algorithms
Unit-2
Introduction to Machine Learning: Paradigms of Machine Learning- Supervised learning, Unsupervised learning,
Semi-supervised learning, Active learning, Self-supervised learning, Transfer learning, Domain adaptation, Zero-
shot, One-shot and Few-shot learning; Federated learning.
Unit-3
Supervised learning: Decision trees, linear classifiers and kernels, linear regression; Naïve Bayes, k-Nearest
Neighbors; Unsupervised learning: Clustering and dimensionality reduction; Expectation Maximization,
Dimensionality Reduction. Introduction to neural networks and deep learning; Feature extraction and selection,
PCA, factor analysis, manifold learning; Evaluation metrics for machine learning models.
Unit-4
Knowledge Representation and Reasoning: Propositional and first-order logic; Knowledge representation using
semantic networks, frames, and ontologies; Resolution and inference in propositional logic; Bayesian networks and
probabilistic reasoning; Common-sense reasoning and expert systems. Applications &Research Topics: Application
in the field of web and data mining, text recognition, speech recognition.

Text Books
1. E. Rich, K. Knight, and S. B. Nair, Artificial Intelligence, 3rd ed. New York, NY, USA: McGraw-Hill, 2009.

Applicable from Academic Session 2024-25 Page 55 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Paper Code: PC 210 Paper: Web Technologies L T/P C

Paper ID: 3 0 3
Prerequisite Paper:
Marking Scheme:
1. Teacher’s Continuous Evaluation: 40 marks
2. Term and Theory Examinations: 60 marks
Guidelines for Paper Setter(s):
1. There should be 9 questions in the term end examinations question paper.
1. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type questions of total 20 marks.
2. Apart from question one which is compulsory, rest of the paper shall consist of four units as per the
syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However,
the student shall be asked to attempt only one of the two questions in the unit. Individual questions may
contain up to five sub-parts/sub-questions. Each unit shall have a marks weightage of 10.
3. The questions are to be framed keeping in view the learning objectives of course/paper. The standard
/level of the questions to be asked should be at the level of the prescribed text book.
4. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required
Course Outcome (CO):
CO 1 To equip students with foundational skills in HTML and CSS for structuring and styling web pages,
enabling them to build multi-page websites using best practices.
CO 2 To develop a strong understanding of JavaScript fundamentals, including functions, arrays, and
object-oriented programming, enabling students to write dynamic and interactive web applications.
CO 3 To enable students to build full-stack web applications by developing interactive front-end interfaces
using [Link] and implementing scalable back-end logic with [Link] and its core modules.
CO 4 To provide students with practical knowledge of database integration, authentication techniques,
and security measures essential for building secure and reliable web applications.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 3 2 2 1 2 2 1 - 2 2 3 3
CO2 3 3 2 2 2 - - - 2 2 2 3
CO3 3 3 2 3 2 - - - 2 2 2 3
CO4 3 3 2 3 2 - - - 2 2 2 3

Unit -1
HTML and CSS: HTML Vs HTML5, Basics of HTML, HTML Document Structure. Understand indentation and nesting
in HTML code. Learn to use HTML tags to structure headings, paragraphs. Creating unordered and ordered lists.
HTML Tables, Tables Attributes, Rows and Columns. Inserting Images, creating hyperlinks using anchor tags.
Introduction to Forms, The <FORM>, <INPUT> Tag Text input. Create multi-page websites. To Learn HTML best
practices. Introduction to cascading style sheets and its use, CSS selectors and properties. Types of CSS: inline,
internal and external CSS. CSS specificity and inheritance, the CSS Box Model, CSS positioning and display properties.
Font styling, CSS float and clear properties.

Unit-2
JavaScript: Overview and its uses, Basic syntax and data types, Operators and expressions, including arithmetic,
comparison, and logical operators, Control structures like if/else statements and loops (The for loop and while loop),
Function declaration and expression, Higher-order functions, including: Passing functions as arguments to other
functions, Returning functions from other functions. The map, filter, and reduce methods on arrays, Creating and
accessing arrays, Adding and removing elements from arrays, The slice method for slicing arrays, the concat method
for concatenating arrays, The indexOf and lastIndexOf methods for finding elements inarrays.
Object-oriented programming in JavaScript: Creating objects with object literals, Creating objects with constructor
functions and the new keyword, Creating objects with classes and the class keyword, Adding and accessing
properties and methods on objects, The this keyword and how it works in object methods, The super keyword for
accessing parent class methods and properties. Manipulating objects and arrays using methods and iteration,
including: The [Link] and [Link] methods.

Unit-3
[Link]: front-end development with React, Understand when and how to use React Components, Learn to pass

Applicable from Academic Session 2024-25 Page 57 of 113

 Handbook of [Link]. Part of [Link]. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus.

Props and work with them, write JSX and understand JSX syntax, the React DOM, State Management in React, React
Hooks, conditional rendering in React, Understand the difference between class and functional components.
[Link]: the components of back-end development, workingwith an MVC framework, Apply concepts like data
types, objects, methods, object-oriented programming, and classes in the context of back-end development. Server-
Side JavaScript, Using Node on the command line, NPM, JavaScript Build Processes, Event Loop and Emitters File
System Interaction, Modules, Native Node drivers.

Unit-4
DataBase: Working and connecting with Database, Persistent connection use RDBMS.
Authentication and Security: the need for authentication and keeping userdetails secure, Encryption and use
encryption to keep your database secure, implement Hashing and Salting with bcrypt, Using Sessions and Cookies
to persist user log in [Link] up local authentication from scratch. Implementing Passport to authenticate
users quickly and effectively. Understand and use environment variables to keep secret keyssecure, use OAuth 2.0
to log in users using Google.

Text Books
1. R. Connolly and R. Hoar, Fundamentals of Web Development, 3rd ed. Boston, MA, USA: Pearson, 2021.
2. T. A. Felke-Morris, Web Development and Design Foundations with HTML5, 10th ed. Hoboken, NJ, USA: Pearson,
2020.
3. A. Harris, HTML5 and CSS3 All-in-One For Dummies, 3rd ed. Hoboken, NJ, USA: Wiley, 2014.
4. D. Flanagan, JavaScript: The Definitive Guide: Master the World's Most-Used Programming Language, 7th ed.
Sebastopol, CA, USA: O'Reilly Media, 2020.

Reference Books
1. J. L. Rucker, An Introduction to Web Development: A Conceptual Approach. San Diego, CA, USA: Cognella
Academic Publishing, 2020.
2. J. Duckett, HTML and CSS: Design and Build Websites, 1st ed. Hoboken, NJ, USA: Wiley, 2011.
3. B. Frain, Responsive Web Design with HTML5 and CSS, 3rd ed. Birmingham, UK: Packt Publishing, 2020.
4. N. Chauhan, The Complete Front-End Interview Guide: Angular, [Link], React, [Link], [Link], and TypeScript,
Notion Press, 2025.

Applicable from Academic Session 2024-25 Page 58 of 113