HIMACHAL PRADESH TECHNICAL

UNIVERSITY HAMIRPUR

Syllabus & Examination Scheme

for

B. Tech.
CSE, AIML, AIDS

3rd and 4th Semester

As per National Education Policy (NEP)-2020

(w.e.f. the Academic Year 2024-2025)

 Semester-III
Evaluation Scheme (Marks)
Sr. Subject Internal
Category Subject Title L T P/D Credits Subject
No. Code Assessment ESE
Total
(IA)
Theory:
Probability Theory and
1 BS MAFC-311 Statistics 3 1 0 4 40 60 100
Data Structure and
2 PC CSPC-311 3 1 0 4 40 60 100
Algorithms
3 PC CSPC-312 Python Programming 2 0 0 2 40 60 100
Computer Organization
4 PC CSPC-313 3 1 0 4 40 60 100
and Architecture
5 PC ECEPC-312 Digital System Design 3 0 0 3 40 60 100
6 HS IKS-311 Indian Knowledge System 2 0 0 2 40 60 100
7 HS HS-311 Engineering Economics 2 0 0 2 40 60 100
Labs:
Data Structure and
1 PC CSPC-311P 0 0 2 1 30 20 50
Algorithms Lab
2 PC CSPC-312P Python Programming Lab 0 0 2 1 30 20 50
3 PC ECEPC-312P Digital System Design Lab 0 0 2 1 30 20 50
Total 18 03 06 24 850

Semester-IV
Evaluation Scheme (Marks)
Subject Internal
S. No. Category Subject Title L T P/D Credits Subject
Code Assessment ESE
Total
(IA)
Theory:
1 PC CSPC-411 Discrete Mathematics 3 0 0 3 40 60 100
2 PC CSPC-412 Operating System 3 1 0 4 40 60 100
CSPC-413 Design and Analysis 3 1 0 4
3 PC 40 60 100
of Algorithm
Artificial Intelligence in
4 PC CSPC-414 3 0 0 3 40 60 100
Engineering
Database Management
5 PC CSPC-415 3 1 0 4 40 60 100
System
Microcontrollers
6 PC ECEPC-412 3 0 0 3 40 60 100
Labs:
1 PC CSPC-413P DAA Lab 0 0 2 1 30 20 50
2 PC CSPC-414P AI Lab 0 0 2 1 30 20 50
3 PC CSPC-415P DBMS Lab 0 0 2 1 30 20 50

Total 18 03 06 24 700
UG Diploma Exit Option
1 EE CSEE-417P Internship-I 8weeks/ 2months 6 30 20 50
nd
Exit Option (as per NEP): Regular students (not applicable for lateral entry student) can exercise exit option after 2 Year for
which he/she will be awarded UG diploma provided they secure an additional 6 credits through summer internships/
apprenticeship for two months/8 weeks after 4 th Semester. The concerned student has to apply for UG diploma exit option at the
time of filling up of end semester examination of 4 th Semester. The evaluation of such candidates shall be done by the concerned
department of Institution after the successful completion of internship by the candidate.
 Semester-V
Evaluation Scheme (Marks)
Internal
S. No. Category Subject Code Subject Title L T P/D Credits Subject
Assessment ESE
Total
(IA)
Theory:
1 FC CSPC-511 Computer Networks 3 1 0 4 40 60 100
2 PC CSPC-512 Theory of Computation 3 1 0 4 40 60 100
CSPC-513 Introduction to Machine 3 1 0 4
3 PC 40 60 100
Learning
4 PC CSPC-514 Software Engineering 3 0 0 3 40 60 100
Labs:
1 PC CSPC-511P Computer Networks Lab 0 0 2 1 30 20 50
2 PC CSPC-513P Machine Learning Lab 0 0 2 1 30 20 50
Total 12 03 04 17 600
Minor Degree Courses (Optional Additional Courses)
1 MD CSMD-5xx Course-I 4 0 0 4 40 60 100
2 MD CSMD-5xx Course-II 3 0 0 3 40 60 100

Semester-VI
Evaluation Scheme (Marks)
Internal
S. No. Category Subject Code Subject Title L T P/D Credits Subject
Assessment ESE
Total
(IA)
Theory:
1 PC CSPC-611 Digital Image Processing 3 1 0 4 40 60 100
Information and Network 3 0 0 3
2 PC CSPC-612 40 60 100
Security
3 PC CSPC-613 Compiler Design 3 1 0 4 40 60 100
4 PE CSPE-611(x) Professional Elective -I 3 0 0 3 40 60 100
5 PE CSPE-612(x) Professional Elective -II 3 1 0 4 40 60 100
Labs:
1 PC CSPC-611P DIP Lab 0 0 2 1 30 20 50
2 EE CSEE-612P Capstone Project 0 0 4 2 30 20 50
Total 15 03 02 21 600

Minor Degree Courses (Optional Additional Courses)

1 MD CSMD-6xx Course-III 4 0 0 4 40 60 100
2 MD CSMD-6xx Course-IV 3 0 0 3 40 60 100
B.Sc. Degree Exit Option
1 EE CSPC-612P Internship-II 8weeks/2months 6 30 20 50

Exit Option (as per NEP): Regular students (not applicable for lateral entry student) can exercise exit option after 3rd Year for
which he/she will be awarded B. Sc. Degree provided they secure an additional 6 credits through summer internships/
apprenticeship for two months/8 weeks after 6th Semester. The concerned student has to apply for B. Sc. Degree exit option at the
time of filling up of end semester examination of 6th Semester. The evaluation of such candidates shall be done by the concerned
department of Institution after the successful completion of internship by the candidate.
 List of Professional Electives

Professional Elective-I
Teaching
S.No. Category Subject Code Subject Title Hours Per Credits Stream
Week
/Specialization
L T P/D
1 PE CSPE-611(i) Distributed Operating Systems 3 0 0 3 CSE

2 PE CSPE-611(ii) Internet of Things 3 0 0 3 CSE

3 PE CSPE-611(iii) Advanced Algorithms 3 0 0 3 CSE

Professional Elective-II

Teaching Hours
S.No. Category Subject code Subject Title Per Week Credits Stream
L T P/D /Specialization
1 PE CSPE-612(i) Advanced Computer 3 1 0 4 CSE
Architecture
2 PE CSPE-612(ii) Mobile Computing and Wireless 3 1 0 4 CSE
Networks
3 PE CSPE-612(iii) Cloud Computing 3 1 0 4 CSE

Professional Elective-III

Teaching Hours
S. No. Category Subject code Subject Title Per Week Credits Stream
L T P/D /Specialization
1 PE CSPE-711(i) Data Visualization 3 1 0 4 CSE
2 PE CSPE-711(ii) Deep Learning 3 1 0 4 CSE
3 PE CSPE-711(iii) Wireless Sensor Networks 3 1 0 4 CSE

Professional Elective-IV

Teaching Hours
S. No. Category Subject code Subject Title Per Week Credits Stream
L T P/D /Specialization
1 PE CSPE-712(i) Big Data Mining and 3 1 0 4 CSE
Analytics
2 PE CSPE-712(ii) Computer Vision 3 1 0 4 CSE
3 PE CSPE-712(iii) Generative AI 3 1 0 4 CSE
 Open Elective-I

Teaching Hours
S.No. Category Subject code Subject Title Per Week Credits Stream
L T P/D /Specialization
1 PE CSOE-712(i) Cyber Law and Ethics 3 0 0 3 CSE
2 PE CSOE-712(ii) Basics of Java Programming 3 0 0 3 CSE
3 PE CSOE-712(iii) Digital Marketing 3 0 0 3 CSE
4 PE CSOE-712(iii) Basics of Python 3 0 0 3 CSE
programming
5 PE CSOE-712(iv) Mobile Application 3 0 0 3 CSE
Development
 Minor Degree in Artificial Intelligence and Machine Learning Courses
Semester Teaching Hours
S.No. Category Subject Code Subject Title Per Week Credits
L T P/D
1 MD CSMD-511 V Introduction to AI & ML 3 0 2 4

2 MD CSMD-512 V Applications of AI 3 0 0 3

3 MD CSMD-611 VI Deep Learning and Neural 3 0 2 4

Networks
4 MD CSMD-612 VII Introduction to Data Analytics 3 0 0 3
5 MD CSMD-711 VII Special topics in Artificial 4 0 0 4
Intelligence
Total Credits 18

Minor Degree in Data Science Courses

Sem Teaching Hours Per

S.No. Category Subject Code Subject Title Week Credits
L T P/D
1 MD CSMD-511 V Introduction to AI & ML 3 0 2 4

2 MD CSMD-513 V Introduction to Data Science 3 0 0 3

3 MD CSMD-613 VI Web Data Mining 4 0 0 4
4 MD CSMD-612 VII Introduction to Data Analytics 3 0 0 3
5 MD CSMD-712 VII Analysing, Visualization and 3 0 2 4
applying Data Science with
Python
Total Credits 18

Minor Degree in IoT Courses

Semester Teaching Hours Per
S.No. Category Subject Code Subject Title Week Credits
L T P/D
1 MD CSMD-514 V Introduction to Internet of Things 4 0 0 4

2 MD CSMD-515 V Introduction to Security of Cyber- 3 0 0 3

Physical Systems
3 MD CSMD-614 VI Ubiquitous Sensing, Computing and 4 0 0 4
Communication
4 MD CSMD-615 VII Embedded Systems for IoT 3 0 0 3

5 MD CSMD-713 VII IoT with Arduino, ESP and Raspberry 4 0 0 4

Pi
Total Credits 18
Semester- III
 MAFC-311 Probability Theory and Statistics
Teaching
Marks Distribution Duration of
Scheme
Credit End Semester
End Semester
L T P Internal Assessment Total Examination
Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e. one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives:
• To understand the basic probability concepts.
• To have an in-depth knowledge of standard distribution & hypothesis testing which can
describe real- life phenomena.
• To introduce numerical methods for solving interpolation problems and finding the roots of
system of equations.
• To analyze the various methods related to numerical differentiation & integration along with the
solution of ordinary differential equations.
Unit-I
Probability Theory: Counting principles, probability axioms, sample space and events, conditional
probability & Baye’s Theorem. Random variable, discrete & continuous probability distribution,
expectation, variance, standard deviation. Joint probability distribution, mass function, distribution
function, marginal distribution function, covariance. Probability Distributions: Discrete
Probability Distributions: Uniform, Bernoulli, Binomial Distribution and Poisson distribution.
Continuous Probability Distributions: Normal and exponential distribution.
Unit-II
Sampling and Testing of Hypothesis: Basic sampling models, sampling distribution of mean and
standard deviation, testing of hypothesis, level of significance, confidence intervals for known and
unknown means, simple sampling of attributes, tests of significance for large samples, comparison of
large samples, central limit theorem, test of significance for two large samples. Student’s t- test,
Chi-square test, Goodness of fit, F-distribution.
Unit-III
Solution of System of Linear, Transcendental Equations & Interpolation: Bisection method,
Regula-Falsi method Newton Raphson’s method, Gauss elimination method, LU factorization
method. Introduction to Interpolation: Lagrange’s interpolation, Newton’s divided difference
interpolation, Difference operators and relations.
Unit-IV
Numerical Differentiation& Integration: Numerical differentiation using forward difference,
backward difference and central difference formula. Integration by trapezoidal and Simpson’s rules
1/3rd and 3/8th rule. Numerical Solution of Ordinary Differential Equations: Picard’s method,
Taylor series method, Euler’s method, Modified Euler’s method, Runge’s and Runge‐ Kutta
method.
Course Learning Outcomes (CLOs):
After the completion of the course, the student will be able to:
• Solve problems using concept of probability covering axiomatic approach for
discrete and continuous distributions.
• Identify different distributions and apply the concept in various probability problems.
• Apply different tests for sampling distribution and hypothesis testing in real-life problems.
• Implement numerical techniques for interpolation and solving system of equations.
• Inspect numerical methods for differentiation, integration and for the solution
of ordinary differential equations.

Text Books:
• R.K. Jain and S.R.K. Iyengar, Advanced Engineering Mathematics (2003), 2nd ed.
• B.S. Grewal, ―Higher Engineering Mathematic, Khanna Publishers.
• S.C. Gupta & V.K. Kapoor, Fundamentals of Mathematical Statistics, Sultan
Chand & Sons.
• K. E. Atkinson, An Introduction to Numerical Analysis (2nd edition), Wiley-India, 1989.

Reference Books:
• Seymour Lipschutz, and John J. Schiller, Introduction to Probability and Statistics,
Schaum’s Outlines by Mc Graw Hill Education.
• E. Kreyszig, Advanced Engineering Mathematics (8th Edition), John Wiley (1999).
• H.K. Dass and Rajnish Verma, ―Engineering Mathematic, S. Chand Publications.
 CSPC- 311 Data Structure and Algorithms
Teaching Duration of End
Marks Distribution
Scheme Credit Semester
L T P Internal Assessment End Semester Examination Total Examination

Maximum Marks: 40 Maximum Marks: 60 100

3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives: To become familiar with different types of data structures and them applications.

Unit-I
Data Structures: Definition, primitive and derived data types, abstract data types, need for data structures,
types of data structures. Algorithm: Definition, characteristics, development of algorithm, Analysis of
complexity: - time complexity, space complexity, order of growth, asymptotic notation with example,
obtaining the complexity of the algorithm. Arrays: Definition, 1d and 2d arrays, operations on arrays,
sparse matrices, structures and arrays of structures.
Unit-II
Linked list: Representation of linked list in memory, allocation & garbage collection, operations on linked
list, doubly linked lists, circular linked list, linked list with header node, applications. Stacks: representation
of stack in memory, operations on stack and applications. Queues: Representation of queues in memory,
operations on queues, circular queues, double ended queues, priority queues, applications.

Unit-III
Trees: Introduction, representation of tree in memory. Binary Trees: Terminology, binary tree traversal,
binary search tree, insertion, deletion & searching in binary search tree, heap trees, types of heap trees,
insertion, deletion in heap tree with example, heap sort algorithm, introduction of AVL trees & B-trees.
Graphs: Definition, representation of graph (adjacency matrix, adjacency list), traversing a graph (DFS &
BFS), Dijkstra‘s algorithm for shortest distance, minimum spanning tree.

Unit-IV
Searching and sorting: Bubble sorting, Insertion sort, Selection sort, Shell sort, Merge sort, Heap and Heap
sort, Quick sort, Radix sort and Bucket sort, Address calculation, Sequential searching, Binary Searching,
Index searching, Hash table methods.

Course Learning Outcomes (CLOs):

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

1. Implement basic data structures in solving fundamental problems.

2. Implement various searching and sorting techniques.
3. Implement tree and graph data structures along with their related operations.
 4. Evaluate and apply appropriate data structure(s) for real-world problems.

Text Books:

1. Seymour Lipschutz: Theory and practice of Data structure, Tata Mc. Graw Hill 1998
2. Tenenbaum, A. Langsam Y and Augenstein, A. J: Data structures using C++, Prentice Hall
Of India.

Reference Books:

1. Data structures and Algorithms in C++ by Micheal T. Goodrich, Wiley India publication.
2. Data structures, R.Venkatesan, S.Lovelyn Rose, Wiley India publication.
3. Data Structures using C++ By Patil, Oxford University press.
4. Data Structures, Algorithm and Object-Oriented programming, Gregory L.Heileman,
TataMc-Graw Hills.
5. S. Sahni, Data structure Algorithms ad Applications in C++, WCB/McGraw Hill.
6. J.P. Tremblay and P.G. Sorenson, ―An Introduction to Data Structures with applications‖,
Tata McGraw Hill.
 CSPC-312 Python Programming
Teaching Duration of
Marks Distribution
Scheme Credit End Semester
L T P Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
2 0 0 2 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40
Instructions to the question paper setter:
Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e., one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives: This course will help you to understand the basics of Data Science which includes
Programming, Mathematics, and Statistics before getting started with advanced machine learning
techniques. Students will also gain knowledge in various data pre-processing techniques and data
visualization techniques.
Unit-I
Introduction to Python: Identifiers, Keywords, Statements and Expressions, Variables, Operators,
Precedence and Associativity, Data Types, Indentation, Comments, Reading Input, Print Output, Type
Conversions, type () Function and Is Operator, Dynamic and Strongly Typed Language. Control Flow
Statements: if Decision Control Flow Statement, the if…else Decision Control Flow Statement, the if-elif-
else, Decision Control Statement, Nested if Statement, the while Loop, The for Loop, The continue and
break Statements.
Unit–II
Functions, Built-In Functions, Commonly Used Modules, Function Definition and Calling the Function,
The return Statement and void Function, Scope and Lifetime of Variables, Default Parameters.
Strings, Creating and Storing Strings, Basic String Operations, Accessing Characters in String by Index
Number, String Slicing and Joining, String Methods, Formatting Strings,
Unit–III
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions Used on Lists, List
Methods, The del Statement. Dictionaries, Creating Dictionary, Accessing and Modifying key: value Pairs in
Dictionaries, Built-In Functions Used on Dictionaries, Dictionary Methods, The del Statement
Unit-IV
Tuples and Sets, Creating Tuples, Basic Tuple Operations, Indexing and Slicing in Tuples, Built-In
Functions Used on Tuples, Relation between Tuples and Lists, Relation between Tuples and Dictionaries.
Files, Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data, Reading and
Writing Binary Files. Reading and Writing CSV file.
Course Learning Outcomes (CLO):
On completion of this course, the students will be able to:
1. To know the concept of functions in Python, like “if” and different types of loops.
2. Be able to convert data types and work with lists and CSV files.
3. To know the difference between running Python programs on Mac and Windows,.
Textbooks:
1. Gowri Shankar S, Veena A, “Introduction to Python Programming”, 1st
edition, CRC Press/Taylor & Francis, 2018. ISBN-13: 978-0815394372.
 CSPC-313 Computer Architecture & Organisation
Teaching Duration of
Marks Distribution
Scheme Credit End Semester
L T P Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e., one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Unit-I
Register Transfer and Micro operations: Register transfer language, register transfer, bus &
memory transfer, logic micro-operations, shift micro-operation.
Basic Computer Organization: Instruction codes, computer instructions, timing & control,
instruction cycles, memory reference instruction, input/output & interrupts, complete computer
description & design of basic computer.
Unit–II
Control Unit: Hardwired vs Micro programmed control unit. Central Processing Unit: General
register organization, stack organization, instruction format, addressing modes, data transfer &
manipulation, program control, RISC, CISC.
Input-Output Organization: Peripheral devices, I/O interface, Modes of data transfer: Programmed
I/O, Interrupt-Initiated I/O, DMA transfer, I/O processor. Serial Communication.
Unit–III
Computer Arithmetic: Unsigned, signed and floating-point data representation, addition,
subtraction, multiplication and division algorithms. Booth’s multiplication algorithm.
Memory Unit: Memory hierarchy, processor vs. memory speed, main memory, auxiliary memories,
high-speed memories, cache memory, associative memory, virtual memory, and memory
management hardware.
Unit-IV
Introduction to Parallel Processing: Flynn‘s classification, pipelining, arithmetic pipeline,
instruction pipeline, characteristics of multiprocessors, inter connection structures, inter processor
arbitration, inter processor communication & synchronization.

Text Books:
1. Mano, Morris M., Computer System Architecture, Prentice Hall.
2. Hayes, J.P., Computer Architecture and Organization, Mc Graw Hill.
Reference Books:
• Hennessy, J.L., Patterson, D.A, and Goldberg, D., Computer Architecture A Quantitative
Approach, Pearson Education Asia.
• Leigh, W.E. and Ali, D.L., System Architecture: software and hardware concepts, South Wester
Publishing Co.
 ECEPC-312 Digital System Design
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 0 0 3 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40
Instructions to the question paper setter:
Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E has
short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section E.
In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I, Unit-II,
Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objective:
• To understand the fundamentals of number systems and Boolean Algebra.
• To understand the concepts of MSI Devices and Applications.
• To understand the concepts of Combinational Logic Design, Programmable Logic Devices.
• To conceptualize the working of Sequential Circuits, Synchronous Sequential Circuits.
• To gain the knowledge in VLSI Design flow.
Unit-I
Number system and codes: Review of Boolean Algebra, Binary arithmetic (Addition, Subtraction,
Multiplication and Division), Floating point numbers. BCD codes, 8421 code, Excess-3 code, Gray code,
Error detection and correction: Parity code, Hamming code. Logical Simplification: De Morgan”s
Theorem, SOP & POS forms, Canonical forms, Karnaugh maps up to 6 variables. The tabulation method,
Determination of prime implicants, Selection of essential prime implicants. Quine Mccluskey method.
Unit-II
Combinational Logic Design: MSI devices like Comparators, Multiplexers, Encoder, Decoder, Driver &
Multiplexed Display, Half and Full Adders, Subtractors, Serial and Parallel Adders, BCD Adder, Barrel
shifter and ALU. Logic families: TTL NAND gate, Specifications, Noise margin, Propagation delay, fan-
in, fan-out, Tristate TTL, ECL, CMOS families and their interfacing, Memory elements, Concept of
programmable logic devices like FPGA, Logic implementation using programmable Devices.
Unit-III
Sequential Logic Design: Building blocks like S-R, JK and Master-Slave JK FF, Edge triggered FF, Ripple
and Synchronous counters, Shift registers, Finite state machines, Design of synchronous FSM, Algorithmic
State Machines charts. Designing synchronous circuits like Pulse train generator, Pseudo Random Binary
Sequence generator, Clock generation.
Unit-IV
VLSI Design flow: Design entry: Schematic, FSM & HDL, different modelling styles in VHDL, Data types
and objects, Dataflow, Behavioural and Structural Modelling, Synthesis and Simulation VHDL constructs
and codes for combinational and sequential circuits.
Course Learning Outcomes (CLOs): On successful completion of the course
• The student can acquire the basic knowledge of measurement principles and their application in
electrical engineering.
• The students will be able to effectively employ electrical and electronics instruments for
measurements of various electrical quantities.
Textbooks:
• Digital Fundamentals by Morris and Mano, PHI Publication.
• Fundamental of digital circuits by A.ANAND KUMAR, PHI Publication.
• Digital Fundamentals by FLOYD & JAIN, Pearson’s Pub
 IKS-311 Indian Knowledge System
Teaching
Credit Marks Distribution
Scheme Duration of End
End Semester Semester Examination
L T P C Internal Assessment Total
Examination
Maximum Marks: 40 Maximum Marks: 60 100
2 0 0 2 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five sections
A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E has short answer
type questions consisting of six parts of 02 marks each. The candidate will attempt five questions in all, i.e., one
question each from sections A, B, C, D and the compulsory question from section E. In the question paper, the
questions available in sections A, B, C and D will be covered from Unit-I, Unit-II, Unit-III and Unit-IV respectively
and section-E will cover whole syllabus.

Course Learning Objectives:

• To equip the students with the knowledge and understanding related to Indian knowledge systems,
origin, evolution and the approaches used in ancient and modern times.
• To promote the youths to do research in the various fields of Bhāratīya knowledge system.

Unit-I: Bhāratīya Civilization and Development of Knowledge System.

Genesis of the Bharat bhumi and Civilization ,Discovery of the Saraswatī River, The Saraswatī-Sindhu civilization,
Traditional knowledge system, The ancient education system, Brief introduction of the Takṣaśilā University,The
Nālandā University, Knowledge export from Bharata.
Unit-II: Art, Literature and Scholars
Natraja- A masterpiece of Bhartiya Art, Introduction to Vedas and Vedic Literature, Life and works of Agastya,
Vālmīki, Patañjali, Vedvyāsa, Loapmudra, Maitreyi, Gārgī, Caraka, Suśruta, Kaṇāda, Kauṭīlya, Pāṇini, Āryabhaṭa,
Varahmihira, Bhāskarācārya.
Unit-III: Engineering Science and Technology
Engineering, science and technology in the Vedic Age, Post-Vedic period, History of Mathematics in Bharata,
Concepts of Zero, History and Culture of Astronomy in India,Kerala School of Astronomy and Mathematics.
Unit-IV: Cultural Heritage and Indian Traditional Practices
Temple architecture in ancient India, Fairs and festivals, Yoga, Āyurveda, Integrated apporach to healthcare,
Agriculture in Ancient India, Approaches and strategies to the protection and conservation of environment.

Course Learning Outcomes (CLOs): After the completion of the course, the student will be able to:
• The students will be able to understand and appreciate the rich heritage that resides in our traditions.
• The students will be able to improve mindfulness and more maturity leading to effective process of
learning.
Textbooks:
• Bhag Chand Chauhan, IKS: The Knowledge of Bharata, Garuda Prakashan, 2023.
• Pradeep Kohle et. Al. Pride of India- A Glimpse of India’s Scientific Heritage edited by Sanskrit
Bharati, 2006.
• Suresh Soni, India’s Glorious Scientific Tradition, Ocean Books Pvt. Ltd., 2010.
• Sibaji Rah, et al, History of Science in IndiaVolume-1,Part-I, Part-II, Volume VIII, National Academy of
Sciences, India and The Ramkrishna Mission Institute of Culture, Kolkata, 2014.
 HS-311 Engineering Economics
Teaching
Credit Marks Distribution
Scheme Duration of End
End Semester Semester Examination
L T P C Internal Assessment Total
Examination
Maximum Marks: 40 Maximum Marks: 60 100
2 0 0 2 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five sections
A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E has short answer
type questions consisting of six parts of 02 marks each. The candidate will attempt five questions in all, i.e., one
question each from sections A, B, C, D and the compulsory question from section E. In the question paper, the
questions available in sections A, B, C and D will be covered from Unit-I, Unit-II, Unit-III and Unit-IV respectively
and section-E will cover whole syllabus.

Course Learning Objectives:

• Understand the basic definitions, nature, scope, and significance of economics.
• Learn about the elasticity of demand, its types, methods of measurement, and its importance in economic
analysis.
• Examine price determination under different market structures, including perfect competition, monopoly,
monopolistic competition, and oligopoly.
• Explore the meaning, types, theories, causes, effects, and control measures of inflation.

Unit-I
Introduction: Definition, Nature, Scope, Importance and significance of Economics, Distinction between
Microeconomics and Macroeconomics. Concept of Utility and Its Types. Demand and Supply: Meaning, Demand
Function, Law of Demand. Elasticity of Demand, Types, Measurement and importance. Demand Forecasting and its
techniques. Concept of Supply, Law of supply.
Unit-II
Production Function: Concept and types, Returns to Factor and Returns to Scale, Law of Variable Proportions.
Cost and Revenue: Concept of Cost, Short run and Lung-run Cost Curves, Relationships among various costs, Break-
even Analysis. Revenue: Concept and its types.
Unit-III
Market Structure: Price Determination under Different Market Structure i.e. Perfect Competition, Monopoly,
Monopolistic Competition Oligopoly. Reserve Bank of India: Nature, Organisation Structure, Objectives, Function
of RBI. Monetary Policy and Fiscal Policy: Meaning, Objectives and Its tools and Techniques of Monetary and
Fiscal Policy.
Unit-IV
National Income: Definition of National Income and its Aggregates, Methods of Calculating National Income.
Inflation: Meaning, Types, Theories, Causes, Effects and Control. Business Cycle – Meaning- Phases of business
cycle.
Course Learning Outcomes (CLOs):

After the completion of the course, the student will be able to:

• Identify the determinants of supply and demand; demonstrate the impact of shifts in both market supply and
demand curves on equilibrium price and output.
• Determine the roles that prices and markets play in organizing and directing economic activity
• Calculate and graph the short-run and long-run costs of production, supply and demand elasticities.
• Describe governmental efforts to address market failure such as monopoly power, externalities, and public
goods.
• Examine and interpret a nation’s economic performance indicators such as economic growth,
unemployment and inflation from a macroeconomic perspective.
• Articulate the mechanics and institutions of international trade and their impact on the macro economy.

Textbooks:
1. Steven A. Greenlaw, David Shapiro, “Principles of Economics”,2nd Edition, Rice University
OpenStax, 2020.ISBN-13: 978-1947172371.
2. Managerial Economics, 8/e, D N Dwivedi, Vikas Publishing.

Reference Books:
1. N. Gregory Mankiw, “Principles of Economics”,8th Edition, Cengage Learning, 2016.ISBN-13:978-
0357038314.
2. Niall Kishtainy, “The Economics Book: Big Ideas Simply Explained”,1st Edition, DK Publishers,
2012.ISBN-13:978-0756698270.
3. Yves Hilpisch, “Python for Finance: Mastering Data-Driven Finance”, 2nd Edition, O’Reilly Media,
2018 ISBN-13:978-1492024330.
 CSPC-311P Data Structure and Algorithms Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

Following is the list of experiments out of which minimum 08experiments must be performed in the lab.
The additional experiments may be performed by the respective institution depending on the
infrastructure available.
List of experiments:

1. Write a program to implement linear search using arrays.

2. Write a program to implement binary search using arrays.

3. Write c program to implement bubble sort, to sort a given list of integers in ascending order.

4. Program to implement insertion sort to sort a given list of integer in ascending order.

5. Program to implement INSERTION SORT to sort a list of numbers.

6. Write a C program that implement merge sort, to sort a given list of integers in ascending order.

7. Write C programs that implement stack using arrays.

8. Write C programs that implement stack using linked list Program.

9. Write c programs that implement Queue using array.

10. Write C programs that implement Queue using linked lists.

11. Write program to implement linked list operations (Creation, Insertion, Deletion, reversing).

12. Write a program to implement binary tree.

13. Write a program to implement heap sort using arrays.

 CSPC-312P Python Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

NOTE: - Following is the list of experiments out of which 8-10 experiments must be performed in the
lab. The additional experiments may be performed by the respective institution depending on the
infrastructure and student intake.

List of experiments:

1. Demonstrate about Basics of Python Programming

2. Demonstrate about fundamental Data types in Python Programming. (i.e., int, float, complex,
bool and string types) Demonstrate the working of following functions in Python. i) id () ii)
type() iii)range()
3. Write a Python program to demonstrate various base conversion function
4. Write a Python program to demonstrate various type conversion functions
5. Demonstrate the following Operators in Python with suitable examples: i) Arithmetic Operators
ii) Relational Operators iii) Assignment Operator iv) Logical Operators v) Bit wise Operators
vi) Ternary Operator vii) Membership Operators viii) Identity Operators.
Write Python programs to demonstrate the following:
1. Input() ii)print()iii)‘sep’attributeiv)‘end’attributev)replacementOperator({})
6. Demonstrate the following Conditional statements in Python with suitable examples. i) if
statement ii) if else statement iii) if-else-if statement
7. Demonstrate the following Iterative statements in Python with suitable examples. i) while loop
ii) for loop
8. Write a Python program to demonstrate various ways of accessing the string. i) By using
Indexing (Both Positive and Negative) ii) By using Slice Operator
9. Python program to perform read and write operations on a file.
 ECEPC-312P Digital System Design Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

Following is the list of experiments out of which minimum 08experiments must be performed in the lab.
The additional experiments may be performed by the respective institution depending on the infrastructure
available.

List of experiments:

1. Verify the truth table of AND, OR, NOT, X-OR and X-NOR gates

2. Verify the NAND and NOR gates as universal logic gates.

3. Verify the AND and OR gates as universal logic gates.

4. Design and verification of the truth tables of Half and Full adder circuits.

5. Design and verification of the truth tables of Half and Full subtractor circuits.

6. Verification of the truth table of the Multiplexer 74150.

7. Verification of the truth table of the De-Multiplexer 74154.

8. Design and test of an S-R flip-flop using NOR/NAND gates.

9. Verify the truth table of a S-R flip-flop

10. Verify the truth table of a J-K flip-flop

11. Verify the truth table of a D flip-flop

12. Design of 4-bit shift register.

13. Design of modulo-4 counter using J K flip flop

14. To study a BCD to 7 Segment LED display using 7447IC

SEMESTER-IV
 CSPC-411 Discrete Mathematics
Teaching
Marks Distribution Duration of End
Scheme
Credit Semester
End Semester Examination
L T P Internal Assessment Total
Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 0 0 3 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40
Instructions to the question paper setter:
Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Unit-I

Sets, Relations and Functions: Operations on Set, Inclusion -exclusion principle, Representation of
Discrete Structures, Fuzzy Set, Multi-set, bijective function, Inverse and Composition of functions,
Floor and Ceiling functions, Growth of functions: Big-O notation, functions, Recursive function,
Functions applications.

Unit-II

Relations: Reflexivity, Symmetry, transitivity, Equivalence, and partial ordered relations, Asymmetric,
Irrelexivity relation, Inverse and Complementary relations, partitions and Covering of a set, N-ary
Relations and database, Representation relation using matrices and digraph, Closure of relations,
Warshall’s algorithms, Lexicographic Ordering, Hasse diagram, Lattices, Boolean algebra, Application
of transitive Closure in medicine and engineering. Application: Embedding a partial order.

Unit-III

Graph Theory: Representation, Type of Graphs, Paths, and Circuits: Euler Graphs, Hamiltonians Paths
&Circuits: Cut Sets, Connectivity and Separability, Planar Graphs, Isomorphisms, Graph Coloring,
Covering and Partitioning, Max flow: Ford -Fulkerson algorithm, Application of Graph Theory in real
life applications. Basic Logic: Propositional Logic, Logical connectives, Truth Tables, Normal Forms
(Conjunctive and Disjunctive), Validity of well-formed formula, Propositional inference rules
(Concepts of modus ponens and modus tollens), Predicate Logic, Universal and existential
quantification.

Unit-IV

Proof Techniques and Counting: notions of Implications, equivalence, converse, inverse, contra
positive, negation and contradiction, The structure of mathematical proofs, Direct proofs, disproving by
counter example, Proof by contradiction, Induction over natural numbers, structural induction, weak and
strong induction, The pigeonhole principle, solving homogenous and heterogenous recurrence relations.
Algebraic Structure: Group, Semi-group, Monoids, Homomorphism, Congruencies, Ring, Field,
Homomorphism, Congruencies, Applications of algebra to control structure of a program, the
application of Residue Arithmetic to Computers.
Course Learning Outcomes (CLOs):
After the completion of the course, the student will be able to:
• Perform operations on various discrete structures such as set, function and relation.

• Apply basic concepts of asymptotic notation in analysis of algorithm.

• Illustrate the basic properties and algorithms of graphs and apply them in modeling and
solving real world problems.

• Comprehend formal Logical arguments and translate statements from a natural language into
its symbolic structures in logic.

• Identify and prove various properties of rings, field, and groups.

Textbooks:
• Rosen H.K., Discrete mathematics and its Applications, McGraw Hill (2011)7th ed.

• Tremblay P.J. and Manohar, R., Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw Hill (2008).

Reference Books:
• Gallian A.J., Contemporary Abstract Algebra, Cengage Learning (2017) 9th ed.

• Lipschutz S., Lipson M., Discrete Mathematics, McGraw Hill (2007) 3rd ed.
 CSPC-412 Operating System
Teaching Duration of
Marks Distribution
Scheme Credit End Semester
L T P Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40
Instructions to the question paper setter:
Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives (COs): To understand the role, responsibilities and the algorithms involved for
achieving various functionalities of an Operating System.
Unit-I
Introduction and System Structures: Introduction, Types of operating systems Computer System
Operation, Operating-System Services, System Calls, Types of System Calls. Process Management:
Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication, Multi-
threaded programming: Multi-core Programming, Multithreading Models.
Unit-II
Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple-Processor
Scheduling. Concurrency: The Critical-Section Problem, Synchronization Hardware, Semaphores, Classic
Problems of Synchronization, Monitors. Deadlock: System Model, Deadlock Characterization, Methods
for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from
Deadlock.
Unit-III
Memory Management: Basic Hardware, Address Binding, Logical and Physical Address, Dynamic
linking and loading, Shared Libraries, Swapping, Contiguous Memory Allocation, Segmentation, Paging,
Structure of the Page Table, Virtual Memory Management: Demand Paging, Page Replacement, Allocation
of Frames, Thrashing. File Systems: File Concept, Access Methods, Directory and Disk Structure, File-
System Mounting, File Sharing, Protection, File-System Structure, File-System Implementation, Directory
Implementation, Allocation Methods, Free-Space Management.
Unit-IV
Disk Management: Mass Storage Structure, Disk Structure, Disk Attachment, Disk Scheduling, Disk
Management, Swap-Space Management, RAID Structure. Protection and Security: Goals of Protection,
Domain of protection, Access rights, Unix/Linux Case study.

Course Learning Outcomes (CLOs):

After the completion of the course, the student will be able to:
• Explain the basic of an operating system viz. system programs, system calls, user mode and kernel
mode.
 • Select particular CPU scheduling algorithms for specific situation and analyses the environment
leading to deadlock and its rectification.

• Explicate memory management techniques viz. caching, paging, segmentation, virtual memory, and
thrashing.

• Understand the concepts related to file systems, disk scheduling and security, protection.

• Comprehend the concepts related to concurrency.

Text Books:

1. Silberschatz A., Galvin B. P. and Gagne G., Operating System Concepts, John Wiley &
Sons Inc (2013) 9 th ed.

2. Stallings W., Operating Systems Internals and Design Principles, Prentice Hall (2018)9 th ed.

Reference Books:

1. Bovet P. D., Cesati M., Understanding the Linux Kernel, O'Reilly Media (2006), 3 rd ed.
2. Kifer M., Smolka A. S., Introduction to Operating System Design and Implementation: The OSP 2
Approach, Springer (2007).
 CSPC-413 Design and Analysis of Algorithm
Teaching
Marks Distribution
Scheme Duration of End
Credit
End Semester Semester Examination
L T P Internal Assessment Total
Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives

• To impart knowledge about the asymptotic notations to analyze the performance of algorithms.
• To introduce the fundamental concepts various problem-solving techniques such as divide and conquer,
greedy algorithm, etc.
• To enable the students to understand the concepts of P, NP, NP-hard and NP-complete problems.

Unit-I:
Introduction: Algorithms Introduction: Algorithm Design paradigms- motivation, concept of algorithmic
efficiency, run time analysis of algorithms, Asymptotic Notations. Divide and Conquer Approach:
Structure of divide-and-conquer algorithms: sets and disjoint sets: Union and Find algorithms, quick sort,
Finding the maximum and minimum, Quick Sort, Merge sort, Heap and heap sort.
Unit-II:
Greedy Algorithms: Optimal storage on tapes, Knapsack problem, Job sequencing with deadlines,
Minimum Spanning trees: Prim’s algorithm and Kruskal’s algorithm, Huffman codes. Graph Algorithms:
Representation of graphs, BFS, DFS, Topological sort, strongly connected components; single source
shortest paths: Bellmen-Ford algorithm, Dijkstra’s algorithm; All pairs shortest path: The Warshall’s
algorithm

Unit-III:
Dynamic Programming: Overview, difference between dynamic programming and divide and conquer,
Matrix chain multiplication, Traveling salesman Problem, longest Common sequence, 0/1 knapsack.
Backtracking: 8-Queen Problem, Sum of subsets, graph coloring, Hamiltonian cycles
Unit-IV:
Branch and Bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application:
0/1 Knapsack problem, Traveling Salesman Problem. Computational Complexity: Complexity measures,
Polynomial vs. nonpolynomial time complexity; NP-hard and NP-complete classes, examples
Course Outcomes: Upon successful completion of the course, the students will be able to
CO1: Understand asymptotic notations to analyze the performance of algorithms.
CO2: Understand and apply various problem-solving techniques
CO3: Solve given problem by selecting the appropriate algorithm design technique and justify the selection.
CO4: Know the concepts of P, NP, NP-hard and NP-complete problems.

Books and References

1. Fundamentals of Computer Algorithms by E. Horowitz and S. Sahni, Galgotia.
2. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford
Stein, MIT Press, Cambridge.
3. The Design and Analysis of Computer Algorithms by A.V. Aho, J.E. Hopcroft and J.D. Ullman, Addison
Wesley.
 CSPC- 414 Artificial Intelligence in Engineering
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 0 0 3 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Unit-I

Fundamentals of Artificial Intelligence (AI): Introduction to AI, History of AI, General applications
of AI, Need of AI in Engineering, Problem solving, Process of problem solving, breadth first search,
depth first search, heuristics search techniques, best first search, Introduction to intelligent systems,
Various approaches to AI: Cybernetics and brain simulation, Symbolic, Sub-symbolic, Statistical.
Ethical and Social Implications of AI: Ethical considerations in AI development and deployment,
Impact of AI on jobs and society, Regulatory and policy issues.
Unit–II

Fundamentals of Machine Learning (ML): Introduction to Machine Learning, datasets, Forms of

Learning: Supervised and Unsupervised Learning, reinforcement learning, processes involved in
Machine Learning, Applications of ML in Engineering. Data Preprocessing, cleaning and
normalization Approaches in Machine Learning (ML): Data preprocessing, Data cleaning, Feature
selection and extraction, Data normalization and scaling.
Unit–III

Artificial Neural Networks: Introduction to Artificial Neural Networks (ANNs): Definition and
history of ANNs, Types of ANNs architectures, Basic architecture of ANNs, Activation functions,
Singled- Layered and Multi-Layered Perceptron, Backpropagation algorithms, Applications of ANNs
in Engineering.

Unit-IV

Fuzzy Logic and Genetic Algorithm: Introduction to Fuzzy Logic: Basic concepts, history, and fuzzy
set theory. Processes in a fuzzy logic system, Applications of Fuzzy Logic in Engineering.
Genetic Algorithm (GA): Basics of GA, Main operations of GA, Flowchart of GA, Working principle
of GA in step by step, Applications in Engineering.

Course Outcomes (COs): After the completion of the course, the student will be able to:

1. Remember the fundamentals, history, and applications of AI in mechanical engineering.

2. Understand various AI approaches, including cybernetic, symbolic, sub-symbolic, and statistical
methods, in mechanical engineering.
3. Apply data preprocessing techniques like cleaning, feature selection, and normalization in machine
learning.
4. Analyze the ethical and social implications of AI, including job impacts and regulatory issues.
5. Evaluate machine learning algorithms, neural networks, and fuzzy logic systems for mechanical
engineering applications.

Text Books:
• Deisenroth, Faisal, Ong, Mathematics for Machine Learning, Cambridge University Press, 2020.
• B Joshi, Machine Learning and Artificial Intelligence, Springer, 2020.
• Parag Kulkarni and Prachi Joshi, Artificial Intelligence – Building Intelligent Systems, PHI
learning Pvt. Ltd., ISBN – 978-81-203-5046-5, 2015.

Reference Books:
• Solanki, Kumar, Nayyar, Emerging Trends and Applications of Machine Learning, IGI Global,
2018.
• Mohri, Rostamizdeh, Talwalkar, Foundations of Machine Learning, MIT Press, 2018.
• Kumar, Zindani, Davim, Artificial Intelligence in Mechanical and Industrial Engineering, CRC
Press, 2021.
• Zsolt Nagy - Artificial Intelligence and Machine Learning Fundamentals-A press (2018).
• Artificial Intelligence by Elaine Rich, Kevin Knight and Nair, TMH.
 CSPC-415 Database Management System
Teaching Duration of
Marks Distribution
Scheme End
Credit
End Semester Semester
L T P Internal Assessment Total Examination
Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 1 0 4 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40
Instructions to the question paper setter:
Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e. one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives:

• To Understand the basic concepts and the applications of database systems

• To Master the basics of SQL and construct queries using SQL
• To understand the relational database design principles
• To become familiar with the basic issues of transaction processing and concurrency control
• To become familiar with database storage structures and access techniques
•
Unit-I

Database Management System: Introduction, Applications, Purpose of Database Systems, View of

Data – Data Abstraction – Instances and Schemas – data Models – the ER Model – Relational Model
– Other Models – Database Languages – DDL – DML – database Access for applications Programs –
data base
Users and Administrator – Transaction Management – data base Architecture – Storage Manager –
the Query Processor Data base design and ER diagrams – ER Model - Entities, Attributes and Entity
sets – Relationships and Relationship sets – ER Design Issues – Concept Design – Conceptual Design
for University Enterprise. Introduction to the Relational Model – Structure – Database Schema, Keys
– Schema Diagrams
Unit-II

Relational Query Languages, Relational Operations. Relational Algebra – Selection and projection set
operations – renaming – Joins – Division – Examples of Algebra overviews – Relational calculus –
Tuple relational Calculus – Domain relational calculus. Overview of the SQL Query Language – Basic
Structure of SQL Queries, Set Operations, Aggregate Functions – GROUPBY – HAVING, Nested
Sub queries, Views, Triggers.
Unit-III

Normalization – Introduction, Non loss decomposition and functional dependencies, First, Second,
and third normal forms – dependency preservation, Boyce Codd normal form. Higher Normal Forms
- Introduction, Multi-valued dependencies and Fourth normal form, Join dependencies and Fifth
normal form
 Unit-IV

Transaction Concept- Transaction State- Implementation of Atomicity and Durability –

Concurrent – Executions – Serializability- Recoverability – Implementation of Isolation –
Testing for serializability- Lock –Based Protocols – Timestamp Based Protocols- Validation-
Based Protocols – Multiple Granularity. Recovery and Atomicity – Log – Based Recovery –
Recovery with Concurrent Transactions, Introduction to NOSQL.

Course Learning Outcomes (CLOs):

After the completion of the course, the student will be able to:
• Explain the features of database management systems and Relational database.
• Create and populate a RDBMS for a real-life application, with constraints and keys, using
SQL and retrieve any type of information from a data base by formulating complex queries in
SQL.
• Analyze the existing design of a database schema and apply concepts of normalization to
design an optimal database and build indexing mechanisms for efficient retrieval of
information from a database.

Textbooks:
• Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGraw
Hill 3rd Edition.
• A Silberschatz, H Korth, S Sudarshan, “Database System and Concepts”, fifth Edition
McGraw-Hill.
• Data base System Concepts, Silberschatz, Korth, McGraw hill, Sixth Edition.

Reference Books:
• Fundamentals of Database Systems, Elmasri Navathe Pearson Education.
• An Introduction to Database systems, C.J. Date, A.Kannan, S.Swami Nadhan, Pearson, Eight
Edition.
 ECEPC-412 Microcontrollers
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 40 Maximum Marks: 60 100
3 0 0 3 3 Hours
Minimum Marks: 16 Minimum Marks: 24 40

Instructions to the question paper setter:

Question paper of end semester examination will be of 60 marks. The question paper will consist of five
sections A, B, C, D and E. Sections A, B, C and D will have 2 questions of 12 marks each and section E
has short answer type questions consisting of six parts of 02 marks each. The candidate will attempt five
questions in all, i.e. one question each from sections A, B, C, D and the compulsory question from section
E. In the question paper, the questions available in sections A, B, C and D will be covered from Unit-I,
Unit-II, Unit-III and Unit-IV respectively and section-E will cover whole syllabus.

Course Objectives:
• To understand the Architecture of 8085 and its assembly language Programming
• To study the interfacing of peripheral devices
• To understand the features of 8-bit Microcontroller and system design
• To explore the features of 16 bit and higher Microprocessors’ architectures
• To Design and Implement Microcontroller based Systems.
Unit-I
8085 Architecture and Organization: Introduction to Microprocessor, Microcomputer system,
Microprocessor operations, Internal Architecture of 8085, System Bus, Pin description of 8085, Need
and generation of control signals, types of Registers & Timing and Control Unit. Instruction set of
8085: Instruction formats, addressing Modes, Timing effect of Addressing modes, Instruction set
classification, Instruction Cycle, Machine cycles, Timing diagram, Stack and Subroutine, Interrupt
types, interrupt systems and polling, Interrupt control logic, Assembly language programming.
Unit–II
Memory and I/O devices interface: Serial and Parallel communication interface, Hardware (Circuit
level) description of Registers, RAM, ROM and Secondary memories, DMA controller, memory
mapped I/O & I/O mapped I/O, Generating Control Signals, Interfacing 2KX8 EPROM, 2KX8 RAM,
Interfacing I/O ports to 8085, Hand shake Signals, Block diagram and working of PPI-8255, Interfacing
8255 to 8085 and LED Interface.

Unit–III
Microcontroller 8051 - Building Blocks: Microprocessor vs microcontroller; RISC vs CISC
architectures, 8051 Architecture, Internal memory organization, Internal RAM structure, Processor
status word, Types of Special Function Registers and their uses in 8051.architecture, pin configuration,
flag-bits and PSW register, input-output ports, register banks and stack. Instruction set of 8051:
Addressing modes, Data transfer instructions, Arithmetic instructions, Logic instructions, branching
instructions and Bit manipulation instructions.

Unit-IV
Programming concept of 8051: Introduction to 8051 assembly programming, Jump, loop and call
instructions programming, Programming 8051 Timers, Interrupts Programming, Serial communication
programming. Advance Microcontroller: Introduction features and block diagram of PIC and ARM
microcontroller.
Course Outcomes:

At the end of this course students will demonstrate the ability to

1. Understand the architecture of microprocessors and microcontrollers
2. Develop programmes for various microcontrollers.
3. Interface various peripherals with microcontrollers and programmes it for various systems
4. Design and implement real-life engineering applications

Textbooks & References:

1. R. S. Gaonkar, Microprocessor Architecture: Programming and Applications with the8085/8080A, Penram

International Publishing, 1996
2. D A Patterson and J H Hennessy, "Computer Organization and Design The hardwareand software interface.
Morgan Kaufman Publishers.
3. Douglas Hall, Microprocessors Interfacing, Tata McGraw Hill, 1991.
4. Kenneth J.Ayala, The 8051 Microcontroller, Penram International Publishing, 1996.
5. Krishna Kant, “Microprocessors and Microcontrollers: Architecture, Programming and SystemDesign 8085,
8086, 8051, 8096”, PHI Learning Pvt. Ltd., Second Edition, 2013.
6.A.K. Ray and K.M.Burchandi, and A.K.Ray, “Advanced Microprocessor and Peripherals”,McGraw Hill
International Edition, Third Edition, 2017.
7. John B. Peatman, “Design with PIC Microcontrollers”, Pearson Education, 2013.
8. Andrew N. Sloss Dominic Symes and Chris Wright, “ARM System Developer‟s Guide Designing and
Optimizing System Software”, Morgan Kaughmann/Elsevier Publishers, 2006.
9. Muhammad Ali Mazidi, SarmadNaimi, SepehrNaimi, and Janice Mazidi, “ARM Assembly Language
Programming & Architecture”, II Edition, 2016.
 CSPC- 413P DAA Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

Following is the list of experiments out of which minimum 08 experiments must be performed in the lab.
The additional experiments may be performed by the respective institution depending on the infrastructure
available.

List of experiments:

1. Write a program to perform Insertion sort for any given list of numbers.

2. Write a program to perform Quick Sort for the given list of integer values.

3. Write a program to find Maximum and Minimum of the given set of integer values.

4. Write a Program to perform Merge Sort on the given two lists of integer values.

5. Write a Program to perform Binary Search for a given set of integer values recursively and

non-recursively.

6. Write a program to find solution for knapsack problem using greedy method.

7. Write a program to find minimum cost spanning tree using Prim’s Algorithm.

8. Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.

9. Write a program to perform Single source shortest path problem for a given graph.

10. Write a program to find solution for job sequencing with deadlines problem.

11. Write a program for all pairs shortest path problem.

12. Write a program to solve N-QUEENS problem.

 CSPC-414P AI Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

Following is the list of experiments out of which minimum 08 experiments must be performed in the lab.
The additional experiments may be performed by the respective institution depending on the infrastructure
available.

List of experiments:

1. Write a program to implement breadth first search algorithm.

2. Write a program to implement depth first search algorithm.

3. Write a program to implement the Hill Climbing algorithm.

4. Write a program to build and display Neural network using Tenser flow Keres.

5. Write a program to implement Genetic algorithm.

6. Study of expert system tools and its applications.

7. Write a program to implement Traveling salesman problem.

8. Write a program to implement four queen problem.

9. Write a program to solve monkey banana problem.

10. Write a program to implement Tower of Hanoi.

11. Case study related to implementation of algorithms in respective discipline for which lab is
being run.
 CSPC-415P DBMS Lab
Teaching Duration of
Credit Marks Distribution
Scheme End Semester
L T P C Internal Assessment End Semester Examination Total Examination
Maximum Marks: 30 Maximum Marks: 20 50
0 0 2 1 2 Hours
Minimum Marks: 12 Minimum Marks: 08 20

Following is the list of experiments out of which minimum 08 experiments must be performed in the lab.
The additional experiments may be performed by the respective institution depending on the infrastructure
available.

List of Experiments

1. Design a Database and create required tables. For e.g. Bank, College Database

2. Apply the constraints like Primary Key, Foreign key, NOT NULL to the tables.

3. Write a SQL statement for implementing ALTER, UPDATE and DELETE

4. Write the queries to implement the joins

5. Write the query for implementing the following functions: MAX(), MIN (), AVG (), COUNT().

6. Write the query to implement the concept of Integrity constraints.

7. Write the query to create the views.

8. Perform the queries for triggers.

9. Perform the following operation for demonstrating the insertion, updation and deletion using

the referential integrity constraints.

10. Write the query for creating the users and their roles.
 CSEE-417P Internship-I
Credit Marks Distribution Duration of
End Semester
Internal Assessment End Semester Examination Total
Examination
6 Maximum Marks: 30 Maximum Marks: 20 50 2 Hours

List of activities/projects to be completed by student:

1. The appropriate area of internship shall be identified by student in consultation with the faculty
mentor and industrial supervisor (if any) during the course of 4th semester, by learning all concepts
being taught in previous semesters and demonstrating hard work and genuine desire to learn.

2. The student shall clearly state in his brief report to faculty supervisor regarding (a)What he/she intends
to learn, acquire and clarify through this internship? (b) Use of try to use concrete, measurable terms in
listing his/her learning objectives under each of the following categories:
a) Knowledge and Understanding
b) Skills

3. The student will clearly state and describe in his brief reports regarding
a) Learning Activities: How will internship activities enable him/her to acquire the
knowledge/understanding, and skills listed to be acquired by students (above)?
b) On the job: How internship activities will enable him/her to meet his/her learning objectives.
Student should include projects, research, report writing, conversations, etc., which student will
do while working, relating them to what he/she intends to learn.
c) Teaching/Mentoring Activities: How his/her technical knowledge can be applied at the site of
the internship to create value through mentoring/help people learn new things.
d) Off the job: List of appropriate study material for reading, writing, method to keep contact with
faculty supervisor, peer group discussion, field trips, observations, etc., he/she will make and
carry out which will help him/her tomeet his/her learning objectives.
e) Evidences: Student will describe in detail what other evidence he/she will provide to attached
faculty mentor to document what was learnt (e.g. journal, analytic paper, project, descriptive
paper, oral presentation, etc.) Deadline dates should be included.
f) Evaluation: The faculty or internship supervisor will provide a written evaluation, preferably in a
tabular format, and by defining rubrics used for evaluation of internship.
g) The Internship Job Description: Student will describe about role and responsibilities while on
his/her internship. (in as much detail as possible), about list of assigned/expected duties, project
to be completed, deadlines, etc., and description of contribution expected by the organization/site
of internship.

4. The internship will be defended by student during 5th semester in front of appropriate committee
(including faculty/ internship supervisor) as per schedule notified by academic department. The
concerned department will review the Internship-I rigorously to discourage low quality internship work
and to avoid exit options as an escape route, rather than a genuine learning curve.