SEMESTER S3

MATHEMATICS FOR COMPUTER AND INFORMATION SCIENCE-3

(Group A)

Course Code GAMAT301 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hr. 30 Min.

Prerequisites (if any) Basic calculus Course Type Theory

Course Objectives:

1. To familiarize students with the foundations of probability and analysis of random

processes used in various applications in engineering and science.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Random variables, Discrete random variables and their probability
distributions, Cumulative distribution function, Expectation, Mean and
variance, the Binomial probability distribution, the Poisson probability
distribution, Poisson distribution as a limit of the binomial distribution, Joint
1 9
pmf of two discrete random variables, Marginal pmf, Independent random
variables, Expected value of a function of two discrete variables.

[Text 1: Relevant topics from sections 3.1 to 3.4, 3.6, 5.1, 5.2]

Continuous random variables and their probability distributions, Cumulative

distribution function, Expectation, Mean and variance, Uniform, Normal and
Exponential distributions, Joint pdf of two Continuous random variables,
2 Marginal pdf, Independent random variables, Expectation value of a function 9
of two continuous variables.

[Text 1: Relevant topics from sections 3.1, 4.1, 4.2, 4.3, 4.4, 5.1, 5.2]
 Limit theorems : Markov’s Inequality, Chebyshev’s Inequality, Strong Law
of Large Numbers (Without proof), Central Limit Theorem (without proof),
Stochastic Processes: Discrete-time process, Continuous-time process,
3 Counting Processes, The Poisson Process, Interarrival times (Theorems 9
without proof)

[Text 2: Relevant topics from sections 2.7, 2.9, 5.3]

Markov Chains, Random Walk Model, Chapman–Kolmogorov Equations,

Classification of States, Irreducible Markov chain, Recurrent state, Transient
4 state, Long-Run Proportions. (Theorems without proof) 9

[Text 2: Relevant topics from sections 4.1, 4.2, 4.3, 4.4]

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the concept, properties and important models of discrete

CO1 K3
random variables and to apply in suitable random phenomena.
Understand the concept, properties and important models of continuous
CO2 K3
random variables and to apply in suitable random phenomena.
Familiarize and apply limit theorems and to understand the
CO3 K3
fundamental characteristics of stochastic processes.
Solve problems involving Markov Chains, to understand their
CO4 theoretical foundations and to apply them to model and predict the K3
behaviour of various stochastic processes.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - 2 - - - - - - - 2
CO2 3 3 - 2 - - - - - - - 2
CO3 3 3 - 2 - - - - - - - 2
CO4 3 3 - 2 - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year

Probability and Statistics for 9th edition,

1 Devore J. L Cengage Learning
Engineering and the Sciences 2016

2 Introduction to Probability Sheldon M. Ross Academic Press 13th edition,

Models 2024
 Reference Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Probability and Random Cambridge University
1 Processes for Electrical and John A. Gubner 2012
Press
Computer Engineers
Probability Models for 1st edition,
2 Sheldon M. Ross Academic Press
Computer Science 2001

Probability, Random Variables Papoulis, A. & Pillai, 4th edition,

3 Tata McGrawHill.
and Stochastic Processes S.U., 2002

4 Probability, Statistics and Kousalya Pappu Pearson 2013

Random Processes

Video Links (NPTEL, SWAYAM…)

Module Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc22_mg31/preview
2 https://onlinecourses.nptel.ac.in/noc22_mg31/preview
3 https://archive.nptel.ac.in/courses/108/103/108103112/
4 https://archive.nptel.ac.in/courses/108/103/108103112/
 SEMESTER S3

THEORY OF COMPUTATION
(Common to CS/CA/CM/CD/CN/CC)

PCCST302
Course Code CIE Marks 40
Teaching Hours/Week 3:1:0:0 ESE Marks 60
(L: T:P: R)
Credits 4 Exam Hours 2 Hrs 30 Mins
PCCST205
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To introduce the concept of formal languages.

2. To discuss the Chomsky classification of formal languages with a discussion on grammar and
automata for regular, context-free, context-sensitive, and unrestricted languages.
3. To discuss the notions of decidability and the halting problem.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Foundations (Linz, Hopcroft)

Motivation for studying computability, need for mathematical modeling -

automata, Introducing automata through simple models - On/Off switch,
coffee vending machine. Three basic concepts: Alphabet, Strings, and
Languages

Finite Automata (Linz, Hopcroft)

1 11
Formal definition of a finite automaton, Deterministic Finite Automata
(DFA), Regular languages, Nondeterminism (guess and verify paradigm),
Formal definition of a nondeterministic finite automaton, NFA with epsilon
transitions, Eliminating epsilon transitions (Proof not expected), Equivalence
of NFAs and DFAs (Proof not expected) - The Subset Construction. DFA
State Minimization, Applications of finite automata - text search, keyword
recognition

Regular Expressions (Linz)

2
The formal definition of a regular expression, Building Regular
Expressions, Equivalence with finite automata (Proof not expected) -
 Converting FA to Regular Expressions, Converting Regular Expressions
to FA, Pattern Matching and Regular Expressions, Regular grammar,
Equivalence with FA - Conversion in both directions

Properties of Regular Languages (Linz)

Closure and Decision Properties of Regular Languages (with proofs), The

Pumping Lemma for Regular Languages (with formal proof), Pumping
lemma as a tool to prove non regularity of languages

Context-Free Grammars and Applications (Linz) 11

Formal definition of a context-free grammar, Designing context-free
grammars, Leftmost and Rightmost Derivations Using a Grammar, Parse
Trees, Ambiguous Grammars, Resolving ambiguity, Inherent ambiguity,
CFGs, and programming languages

Pushdown Automata (Linz)

Formal definition of a pushdown automaton, DPDA and NPDA, Examples
of pushdown automata

Equivalence NPDAs and CFGs (Proof not expected) - conversions in both

directions
Simplification of Context-Free Languages (Linz)
3 11
Elimination of useless symbols and productions, Eliminating epsilon
productions, Eliminating unit productions, Chomsky normal form,
Greibach normal form,

Properties of Context-Free Languages (Linz)

The Pumping Lemma for Context-Free Languages (with formal proof),
Closure and Decision Properties of Context-Free Languages (with formal
proofs)

Turing Machines (Kozen)

The formal definition of a Turing machine, Examples of Turing machines -

Turing machines as language acceptors, Turing machines as computers of
functions, Variants of Turing Machines (Proofs for equivalence with basic
model not expected), Recursive and recursively enumerable languages

Chomskian hierarchy, Linear bounded automaton as a restricted TM.

4 11

Computability (Kozen)

Church Turing thesis, Encoding of TMs, Universal Machine and

Diagonalization, Reductions, Decidable and Undecidable Problems, Halting
problem, Post Correspondence Problem and the proofs for their
undecidability.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks ● Each question can have a maximum of 3 60
subdivisions.
(8x3 =24 marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Classify formal languages into regular, context-free, context-sensitive,
CO1 K2
and unrestricted languages.
Develop finite state automata, regular grammar, and regular
CO2 K3
expression.
Model push-down automata and context-free grammar representations
CO3 K3
for context-free languages.
Construct Turing Machines to accept recursive and recursively
CO4 K3
enumerable languages.
Describe the notions of decidability and undecidability of problems,
CO5 K2
the Halting problem.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 3 3 3 3
CO1
3 3 3 3 3
CO2
3 3 3 3 3
CO3
3 3 3 3 3
CO4
3 3 3 3 3
CO5
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
An Introduction to Formal Peter Linz and Susan H. Jones and Bartlett
1 7/e, 2022
Languages and Automata Rodger Publishers, Inc
Introduction to Automata
John E.Hopcroft, Rainbow Book
2 Theory Languages And 3/e, 2015
Jeffrey D.Ullman Distributiors
Computation

3 Automata and Computability Dexter C. Kozen Springer 1/e,2007

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to the Theory of Cengage India Private 3/e, 2014
1 Michael Sipser
Computation Limited

Introduction to Languages and McGraw-Hill

John C Martin 4/e, 2010
2 the Theory of Computation Education

Theory of Computation: A
Kavi Mahesh Wiley 1/e, 2012
3 Problem-Solving Approach

Elements of the Theory of Harry R. Lewis, Christos

4 Pearson Education 2/e, 2015
Computation Papadimitriou
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/104/106104148/
https://nptel.ac.in/courses/106106049
https://archive.nptel.ac.in/courses/106/104/106104148/
2
https://nptel.ac.in/courses/106106049

https://archive.nptel.ac.in/courses/106/104/106104148/
3
https://nptel.ac.in/courses/106106049

https://archive.nptel.ac.in/courses/106/104/106104148/
4
https://nptel.ac.in/courses/106106049
 SEMESTER S3

DATA STRUCTURES AND ALGORITHMS

(Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG)

Course Code PCCST303 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) UCEST105 Course Type Theory

Course Objectives:

1. To provide the learner a comprehensive understanding of data structures and algorithms.

2. To prepare them for advanced studies or professional work in computer science and related
fields.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Concepts of Data Structures
Definitions; Data Abstraction; Performance Analysis - Time & Space
Complexity, Asymptotic Notations; Polynomial representation using
1 11
Arrays, Sparse matrix (Tuple representation); Stacks and Queues - Stacks,
Multi-Stacks, Queues, Circular Queues, Double Ended Queues; Evaluation
of Expressions- Infix to Postfix, Evaluating Postfix Expressions.
Linked List and Memory Management
Singly Linked List - Operations on Linked List, Stacks and Queues using

2 Linked List, Polynomial representation using Linked List; Doubly Linked 11

List; Circular Linked List; Memory allocation - First-fit, Best-fit, and
Worst-fit allocation schemes; Garbage collection and compaction.
Trees and Graphs
Trees :- Representation Of Trees; Binary Trees - Types and Properties,
Binary Tree Representation, Tree Operations, Tree Traversals; Expression
3 11
Trees; Binary Search Trees - Binary Search Tree Operations; Binary Heaps
- Binary Heap Operations, Priority Queue.
Graphs :- Definitions; Representation of Graphs; Depth First Search and
 Breadth First Search; Applications of Graphs - Single Source All
Destination.
Sorting and Searching
Sorting Techniques :- Selection Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap Sort, Radix Sort.

4 Searching Techniques :- Linear Search, Binary Search, Hashing - Hashing 11

functions : Mid square, Division, Folding, Digit Analysis; Collision
Resolution : Linear probing, Quadratic Probing, Double hashing, Open
hashing.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24 marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Identify appropriate data structures for solving real world problems. K3
Describe and implement linear data structures such as arrays, linked K3
CO2
lists, stacks, and queues.
Describe and Implement non linear data structures such as trees and K3
CO3
graphs.
Select appropriate searching and sorting algorithms to be used in K3
CO4
specific circumstances.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Universities
Ellis Horowitz, Sartaj Sahni
1 Fundamentals of Data Structures in C press, 2/e, 2007
and Susan Anderson-Freed,
Thomas H Cormen, Charles
2 Introduction to Algorithms Leisesrson, Ronald L PHI 3/e, 2009
Rivest, Clifford Stein
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Prentice Hall
1 Classic Data Structures Samanta D. 2/e, 2018
India.
Aho A. V., J. E.
Pearson
2 Data Structures and Algorithms Hopcroft and J. D. 1/e, 2003
Publication.
Ullman
Introduction to Data Structures with Tremblay J. P. and P. G. Tata McGraw
3 2/e, 2017
Applications Sorenson Hill.
Theory and Problems of Data
4 Lipschuts S. Schaum’s Series 2/e, 2014
Structures

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106102064
2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
 SEMESTER S3

OBJECT ORIENTED PROGRAMMING

(Common to CS/CA/CD/AM/CB/CN/CU/CG)

Course Code PBCST304 CIE Marks 60

Teaching Hours/Week
3:0:0:1 ESE Marks 40
(L:T:P:R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To teach the core object-oriented principles such as abstraction, encapsulation, inheritance, and
polymorphism, robust error-handling using exception mechanisms to ensure program
reliability.
2. To equip the learner to develop object oriented programs encompassing fundamental
structures, environments, and the effective utilization of data types, arrays, strings, operators,
and control statements for program flow in Java.
3. To enable the learner to design and develop event-driven graphical user interface (GUI)
database applications using Swing and database connection components.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Java:
Structure of a simple java program; Java programming Environment and
Runtime Environment (Command Line & IDE); Java compiler; Java Virtual
Machine; Primitive Data types and Wrapper Types; Casting and Autoboxing;
Arrays; Strings; Vector class; Operators - Arithmetic, Bitwise, Relational,
Boolean Logical, Assignment, Conditional (Ternary); Operator Precedence;
1 Control Statements - Selection Statements, Iteration Statements and Jump 10
Statements; Functions; Command Line Arguments; Variable Length
Arguments; Classes; Abstract Classes; Interfaces. [Use proper naming
conventions]

OOP Concepts :-
Data abstraction, encapsulation, inheritance, polymorphism, Procedural and
 object oriented programming paradigm; Microservices.

Object Oriented Programming in Java :-

Declaring Objects; Object Reference; Introduction to Methods; Constructors;
Access Modifiers; this keyword.
Polymorphism :-
Method Overloading, Using Objects as Parameters, Returning Objects,
Recursion.
Static Members, Final Variables, Inner Classes.
2 8
Inheritance - Super Class, Sub Class, Types of Inheritance, The super
keyword, protected Members, Calling Order of Constructors.
Method Overriding, Dynamic Method Dispatch, Using final with
Inheritance.
Packages and Interfaces –
Packages - Defining a Package, CLASSPATH, Access Protection, Importing
Packages.

Interfaces - Interfaces v/s Abstract classes, defining an interface,

implementing interfaces, accessing implementations through interface
3 references, extending interface(s). 9

Exception Handling - Checked Exceptions, Unchecked Exceptions, try

Block and catch Clause, Multiple catch Clauses, Nested try Statements,
throw, throws and finally, Java Built-in Exceptions, Custom Exceptions.

Introduction to design patterns in Java : Singleton and Adaptor.

SOLID Principles in Java (https://www.javatpoint.com/solid-principles-
java)
Swings fundamentals – Overview of AWT, Swing v/s AWT, Swing Key
Features, Model View Controller (MVC), Swing Controls, Components and
Containers, Swing Packages, Event Handling in Swings, Swing Layout
Managers, Exploring Swings–JFrame, JLabel, The Swing Buttons,
4 JTextField. 10

Event handling – Event Handling Mechanisms, Delegation Event Model,

Event Classes, Sources of Events, Event Listener Interfaces, Using the
Delegation Event Model.

Developing Database Applications using JDBC – JDBC overview, Types,

 Steps, Common JDBC Components, Connection Establishment, SQL
Fundamentals [For projects only] - Creating and Executing basic SQL
Queries, Working with Result Set, Performing CRUD Operations with
JDBC.

Suggestion on Project Topics

Student should Identify a topic to be implemented as project having the following nature
i. It must accept a considerable amount of information from the user for processing.
ii. It must have a considerable amount of data to be stored permanently within the computer -
as plain files / using databases..
iii. It must process the user provided data and the stored data to generate some output to
be displayed to the user.

Examples : -

1. Design and implement the Circulation function in a Library Management System using
Object-Oriented Programming (OOP) principles in Java and limited use of SQL. The system
should manage the operations of a library, such as book & user management, borrowing and
returning books.

Requirements

I. Class Design
● Book: Attributes like title, author, ISBN, genre, and status (available/borrowed).
● User: Attributes like user ID, name, contact information, and a list of borrowed
books.
● Library: Attributes like a list of books and a list of users.
● Librarian: Inherits from User, with additional functionalities like adding/removing
books and managing users.
● BorrowTransaction: Attributes like transaction ID, book, user, borrow date, and
return date
II. Functionalities
a. Book Management:
● Add, remove, and update book details.
● Search books by title, author, ISBN, and genre.
b. User Management:
● Register new users.
● Search users by user ID and name.
 c. Borrowing and Returning:
● Borrow a book: Check if the book is available and if the user can borrow
more books.
● Return a book: Update the book’s status and remove it from the user’s
borrowed list.
III. Deliverables

1. Design Document: Describe the classes, their attributes, methods and relationships.

2. Source Code: Well-documented Java code implementing the described functionalities.

3. User Manual: Instructions on how to set up, run and use the system.

4. Test Cases: A suite of test cases demonstrating the functionality of the system.

2. Design and implement an Online Payment Processing System using Object-Oriented

Programming(OOP) principles in Java, with a focus on dynamic polymorphism. The system
should support different types of payment methods and demonstrate polymorphism in
processing payments.

Requirements

a. Class Design
● Payment: An abstract base class with common attributes and an abstract method for
processing payments.
● CreditCardPayment: Inherits from Payment, with specific implementation for processing
credit card payments.
● PayPalPayment: Inherits from Payment, with specific implementation for processing
PayPal payments.
● BankTransferPayment: Inherits from Payment, with specific implementation for
processing bank transfer payments.
● PaymentProcessor: A class to manage and process different types of payments.
b. Functionalities
● Add Payment Method: Add new payment methods (CreditCardPayment, PayPalPayment,
BankTransferPayment) to the system.
● Process Payment: Demonstrate dynamic polymorphism by processing payments using
different methods.

c. Deliverables
● Design Document: Describe the classes, their attributes, methods and relationships.
● Source Code: Well-documented Java code implementing the described functionalities.
 ● User Manual: Instructions on how to set up, run and use the system.
● Test Cases: A suite of test cases demonstrating the functionality of the system.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

5 30 12.5 12.5 60

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  2 questions will be given from each module,
module. out of which 1 question should be answered.
 Total of 8 Questions,  Each question can have a maximum of 2
40
each carrying 2 marks subdivisions. E
(8x2 =16 marks)  ach question carries 6 marks.
(4x6 = 24 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the process of writing, compiling, and executing basic Java programs,
CO1 including their structure and components, to demonstrate proficiency.
K2

Utilize object-oriented programming principles in the design and

CO2 implementation of Java applications.
K3

Develop and manage Java packages and interfaces, enhancing code

CO3 modularity and reusability.
K3

Implement error handling using Java's exception mechanisms and leverage

CO4 interfaces for modular applications.
K3

Develop event-driven Java GUI applications with database connectivity using

CO5 Swing and JDBC.
K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3

CO2 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

1 Java: The Complete Reference Herbert Schildt Tata McGraw Hill 13/e, 2024
Introduction to Java Programming,
2 Y Daniel Liang Pearson 10/e, 2014
Comprehensive Version
Eric Freeman, Elisabeth O'Reilly Media
Head First Design Patterns
3 Robson, Bert Bates, 1/e, 2004
Kathy Sierra

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Head First Java: A Brain
Kathy Sierra & Bert
1 O’Reilly 3/e, 2022
Friendly Guide Bates

2 JAVA™ for Programmers Paul Deitel PHI 11/e, 2018

Clean Code : A Handbook of
3 Robert C. Martin Prentice Hall 1/e, 2008
Agile Software Craftsmanship

Programming with Java McGraw Hill

4 E Balagurusamy 6/e, 2019
Education
5 Java For Dummies Barry A. Burd Wiley 8/e.2022
6 Effective Java Joshua Bloch Pearson 3/e, 2018
 Video Links (NPTEL, SWAYAM…)
Modul
Link ID
e No.
1 https://nptel.ac.in/courses/106105191 (Lecture no: 9, 10, 1, 2, 3, 4)
2 https://nptel.ac.in/courses/106105191 (Lecture no: 1, 7, 8, 11, 12, 13, 14, 15, 16)
3 https://nptel.ac.in/courses/106105191 (Lecture no: 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
4 https://nptel.ac.in/courses/106105191 (Lecture no: 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55)

PBL Course Elements

L: Lecture R: Project (1 Hr.), 2 Faculty Members

(3 Hrs.) Tutorial Practical Presentation
Simulation/
Presentation
Lecture Laboratory
Project identification (Progress and Final
delivery Work/
Presentations)
Workshops
Group
Project Analysis Data Collection Evaluation
discussion
Question Project Milestone Reviews,
answer Analytical thinking Feedback,
Sessions/ Testing
and self-learning Project reformation (If
Brainstorming
Sessions
required)
Poster Presentation/
Guest Speakers
Case Study/ Field Video Presentation: Students
(Industry Prototyping
Survey Report present their results in a 2 to
Experts)
5 minutes video

Assessment and Evaluation for Project Activity

Sl. No Evaluation for Allotted

Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer 4
Sessions
3 Involvement in the project work and Team Work 3
4 Execution and Implementation 10
5 Final Presentations 5
6 Project Quality, Innovation and Creativity 3
Total 30
1. Project Planning and Proposal (5 Marks)

 Clarity and feasibility of the project plan

 Research and background understanding
 Defined objectives and methodology

2. Contribution in Progress Presentation and Question Answer Sessions (4 Marks)

 Individual contribution to the presentation

 Effectiveness in answering questions and handling feedback

3. Involvement in the Project Work and Team Work (3 Marks)

 Active participation and individual contribution

 Teamwork and collaboration

4. Execution and Implementation (10 Marks)

 Adherence to the project timeline and milestones

 Application of theoretical knowledge and problem-solving
 Final Result

5. Final Presentation (5 Marks)

 Quality and clarity of the overall presentation

 Individual contribution to the presentation
 Effectiveness in answering questions

6. Project Quality, Innovation, and Creativity (3 Marks)

 Overall quality and technical excellence of the project

 Innovation and originality in the project

 Creativity in solutions and approaches

 SEMESTER S3

DIGITAL ELECTRONICS AND LOGIC DESIGN

(Common to Group A)

Course Code GAEST305 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L:T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To familiarize the basic concepts of Boolean algebra and digital systems.

2. To enable the learner to design simple combinational and sequential logic circuits which is
essential in understanding organization & design of computer systems .

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to digital Systems :- Digital abstraction
Number Systems – Binary, Hexadecimal, grouping bits, Base conversion;
Binary Arithmetic – Addition and subtraction, Unsigned and Signed
numbers; Fixed-Point Number Systems; Floating-Point Number Systems
Basic gates- Operation of a Logic circuit; Buffer; Gates - Inverter, AND gate,
OR gate, NOR gate, NAND gate, XOR gate, XNOR gate; Digital circuit

1 operation - logic levels, output dc specifications, input dc specifications, 11

noise margins, power supplies; Driving loads - driving other gates, resistive
loads and LEDs.

Verilog (Part 1) :-
HDL Abstraction; Modern digital design flow - Verilog constructs: data
types, the module, Verilog operators.
 Combinational Logic Design: –
Boolean Algebra - Operations, Axioms, Theorems; Combinational logic
analysis - Canonical SOP and POS, Minterm and Maxterm equivalence;
Logic minimization - Algebraic minimization, K-map minimization, Dont

2 cares, Code convertors. 11

Modeling concurrent functionality in Verilog:-
Continuous assignment - Continuous Assignment with logical operators,
Continuous assignment with conditional operators, Continuous assignment
with delay.
MSI Logic and Digital Building Blocks
MSI logic - Decoders (One-Hot decoder, 7 segment display decoder),
Encoders, Multiplexers, Demultiplexers; Digital Building Blocks -
Arithmetic Circuits - Half adder, Full adder, half subtractor, full subtractor;
3 8
Comparators.

Structural design and hierarchy - lower level module instantiation, gate level
primitives, user defined primitives, adding delay to primitives.
Sequential Logic Design :- Latches and Flip-Flops- SR latch, SR latch with
enable, JK flipflop, D flipflop, Register Enabled Flip-Flop, Resettable Flip-
Flop. Sequential logic timing considerations; Common circuits based on
sequential storage devices - toggle flop clock divider, asynchronous ripple
counter, shift register.

4 Finite State Machines :- 14

Finite State Machines - logic synthesis for an FSM, FSM design process and
design examples; Synchronous Sequential Circuits - Counters;

Verilog (Part 2) : -
Procedural assignment; Conditional Programming constructs; Test benches;
Modeling a D flipflop in Verilog; Modeling an FSM in Verilog.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out of
 Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks.  Each question can have a maximum of 3 subdivisions.
(4x9 = 36 marks)
(8x3 =24 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Summarize the basic concept of different number systems and perform
CO1 K2
conversion and arithmetic operations between different bases.
Interpret a combinational logic circuit to determine its logic expression, truth
CO2 table, and timing information and to synthesize a minimal logic circuit through K2
algebraic manipulation or with a Karnaugh map.
Illustrate the fundamental role of hardware description languages in modern
CO3 digital design and be able to develop the hardware models for different digital K3
circuits.
Develop MSI logic circuits using both the classical digital design approach and
CO4 K3
the modern HDL-based approach.
Develop common circuits based on sequential storage devices including
CO5 counter, shift registers and a finite state machine using the classical digital K3
design approach and an HDL-based structural approach.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

CO5 3 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Introduction to Logic Circuits & Logic Springer International
1 Brock J. LaMeres 2/e, 2017
Design with Verilog Publishing
Digital Design and Computer Sarah L. Harris,
2 Morgan Kaufmann 1/e, 2022
Architecture - RISC-V Edition David Harris

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Digital Design with an Introduction to the M Morris Mano,
1 Pearson 6/e, 2018
Verilog HDL, VHDL, and System Verilog Michael D Ciletti
2 Digital Fundamentals Thomas Floyd Pearson 11/e, 2015
Fundamentals of Digital Logic with Verilog Stephen Brown,
3 McGrawHill 3/e, 2014
Design Zvonko Vranesic
Zvi Kohavi Cambridge
4 Switching and Finite Automata Theory 3/e, 2010
Niraj K. Jha University Press
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/117105080
2 https://onlinecourses.nptel.ac.in/noc21_ee39/
3 https://onlinecourses.nptel.ac.in/noc24_cs61/
 SEMESTER S3

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

Teaching Hours/Week
2:0:0:0 ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Understanding of finance and costing for engineering operation, budgetary planning and control
2. Provide fundamental concept of micro and macroeconomics related to engineering industry
3. Deliver the basic concepts of Value Engineering.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Basic Economics Concepts - Basic economic problems – Production

Possibility Curve – Utility – Law of diminishing marginal utility – Law of
Demand - Law of supply – Elasticity - measurement of elasticity and its
1 applications – Equilibrium- Changes in demand and supply and its effects
6

Production function - Law of variable proportion – Economies of Scale –

Internal and External Economies – Cobb-Douglas Production Function

Cost concepts – Social cost, private cost – Explicit and implicit cost – Sunk
cost - Opportunity cost - short run cost curves - Revenue concepts

2 Firms and their objectives – Types of firms – Markets - Perfect Competition 6

– Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)

3 Monetary System – Money – Functions - Central Banking –Inflation - 6

Causes and Effects – Measures to Control Inflation - Monetary and Fiscal
 policies – Deflation

Taxation – Direct and Indirect taxes (merits and demerits) - GST

National income – Concepts - Circular Flow – Methods of Estimation and

Difficulties - Stock Market – Functions- Problems faced by the Indian stock
market-Demat Account and Trading Account – Stock market Indicators-
SENSEX and NIFTY

Value Analysis and value Engineering - Cost Value, Exchange Value, Use
Value, Esteem Value - Aims, Advantages and Application areas of Value
4 Engineering - Value Engineering Procedure - Break-even Analysis - Cost-
6

Benefit Analysis - Capital Budgeting - Process planning

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ Case
Attendance Examination-1 Examination- 2 Total
study/Microproject
(Written) (Written)

10 15 12.5 12.5 50
End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 Minimum 1 and Maximum  2 questions will be given from each module, out
of which 1 question should be answered.
2 Questions from each
module.  Each question can have a maximum of 2 sub
divisions. 50
 Total of 6 Questions, each
carrying 3 marks  Each question carries 8 marks.
(6x3 =18marks) (4x8 = 32 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the fundamentals of various economic issues using laws K2

CO1 and learn the concepts of demand, supply, elasticity and production
function.
Develop decision making capability by applying concepts relating to K3
CO2 costs and revenue, and acquire knowledge regarding the functioning of
firms in different market situations.
Outline the macroeconomic principles of monetary and fiscal systems, K2
CO3
national income and stock market.
Make use of the possibilities of value analysis and engineering, and K3
CO4 solve simple business problems using break even analysis, cost benefit
analysis and capital budgeting techniques.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - - - 1 - - - - 1 -

CO2 - - - - - 1 1 - - - 1 -

CO3 - - - - 1 - - - - - 2 -

CO4 - - - - 1 1 - - - - 2 -
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Geetika, Piyali Ghosh
1 Managerial Economics Tata McGraw Hill, 2015
and Chodhury

H. G. Thuesen, W. J.
2 PHI 1966
Engineering Economy Fabrycky

3 R. Paneerselvam PHI 2012

Engineering Economics
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Leland Blank P.E,
1 Mc Graw Hill 7TH Edition
Engineering Economy Anthony Tarquin P. E.

2 Indian Financial System Khan M. Y. Tata McGraw Hill 2011

Engineering Economics and Donald G. Newman,

3 Engg. Press, Texas 2002
analysis Jerome P. Lavelle

Contemporary Engineering Prentice Hall of India

4 Chan S. Park 2001
Economics Ltd
 SEMESTER S3/S4

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

2:0:0:0
Teaching Hours/Week
ESE Marks 50
(L: T:P: R)
2
Credits Exam Hours 2 Hrs. 30 Min.
None
Prerequisites (if any) Course Type Theory

Course Objectives:

1. Equip with the knowledge and skills to make ethical decisions and implement gender-
sensitive practices in their professional lives.
2. Develop a holistic and comprehensive interdisciplinary approach to understanding
engineering ethics principles from a perspective of environment protection and sustainable
development.
3. Develop the ability to find strategies for implementing sustainable engineering solutions.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,
Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,
Plagiarism, a balanced outlook on law - challenges - case studies,
Technology and digital revolution-Data, information, and knowledge,
Cybertrust and cybersecurity, Data collection & management, High
1 6
technologies: connecting people and places-accessibility and social
impacts, Managing conflict, Collective bargaining, Confidentiality, Role
of confidentiality in moral integrity, Codes of Ethics.
Basic concepts in Gender Studies - sex, gender, sexuality, gender
spectrum: beyond the binary, gender identity, gender expression, gender
stereotypes, Gender disparity and discrimination in education,
 employment and everyday life, History of women in Science & Technology,
Gendered technologies & innovations, Ethical values and practices in
connection with gender - equity, diversity & gender justice, Gender policy
and women/transgender empowerment initiatives.

Introduction to Environmental Ethics: Definition, importance and

historical development of environmental ethics, key philosophical theories
(anthropocentrism, biocentrism, ecocentrism). Sustainable Engineering
Principles: Definition and scope, triple bottom line (economic, social and
environmental sustainability), life cycle analysis and sustainability metrics.

2 Ecosystems and Biodiversity: Basics of ecosystems and their functions, 6

Importance of biodiversity and its conservation, Human impact on
ecosystems and biodiversity loss, An overview of various ecosystems in
Kerala/India, and its significance. Landscape and Urban Ecology:
Principles of landscape ecology, Urbanization and its environmental impact,
Sustainable urban planning and green infrastructure.

Hydrology and Water Management: Basics of hydrology and water cycle,

Water scarcity and pollution issues, Sustainable water management practices,
Environmental flow, disruptions and disasters. Zero Waste Concepts and
Practices: Definition of zero waste and its principles, Strategies for waste
reduction, reuse, reduce and recycling, Case studies of successful zero waste
initiatives. Circular Economy and Degrowth: Introduction to the circular

3 economy model, Differences between linear and circular economies, 6

degrowth principles, Strategies for implementing circular economy practices
and degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and climate,
Basic tenets of a Sustainable Transportation design, Sustainable urban
mobility solutions, Integrated mobility systems, E-Mobility, Existing and
upcoming models of sustainable mobility solutions.

Renewable Energy and Sustainable Technologies: Overview of renewable

energy sources (solar, wind, hydro, biomass), Sustainable technologies in
energy production and consumption, Challenges and opportunities in
4 renewable energy adoption. Climate Change and Engineering Solutions: 6
Basics of climate change science, Impact of climate change on natural and
human systems, Kerala/India and the Climate crisis, Engineering solutions to
mitigate, adapt and build resilience to climate change. Environmental
 Policies and Regulations: Overview of key environmental policies and
regulations (national and international), Role of engineers in policy
implementation and compliance, Ethical considerations in environmental
policy-making. Case Studies and Future Directions: Analysis of real-
world case studies, Emerging trends and future directions in environmental
ethics and sustainability, Discussion on the role of engineers in promoting a
sustainable future.

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

Continuous internal evaluation will be based on individual and group activities undertaken throughout
the course and the portfolio created documenting their work and learning. The portfolio will include
reflections, project reports, case studies, and all other relevant materials.

 The students should be grouped into groups of size 4 to 6 at the beginning of the semester.
These groups can be the same ones they have formed in the previous semester.
 Activities are to be distributed between 2 class hours and 3 Self-study hours.
 The portfolio and reflective journal should be carried forward and displayed during the 7th
Semester Seminar course as a part of the experience sharing regarding the skills developed
through various courses.
Sl. Item Particulars Group/I Marks
No. ndividu
al (G/I)

1 Reflective Weekly entries reflecting on what was learned, personal I 5

Journal insights, and how it can be applied to local contexts.

2 Micro project 1 a) Perform an Engineering Ethics Case Study analysis and G 8

prepare a report

1 b) Conduct a literature survey on ‘Code of Ethics for

(Detailed Engineers’ and prepare a sample code of ethics
documentation
of the project, 2. Listen to a TED talk on a Gender-related topic, do a G 5
including literature survey on that topic and make a report citing the
methodologies, relevant papers with a specific analysis of the Kerala
findings, and context
reflections)
3. Undertake a project study based on the concepts of G 12
sustainable development* - Module II, Module III &
Module IV

3 Activities 2. One activity* each from Module II, Module III & Module G 15
IV

4 Final A comprehensive presentation summarising the key G 5

Presentation takeaways from the course, personal reflections, and
proposed future actions based on the learnings.

Total Marks 50

*Can be taken from the given sample activities/projects

Evaluation Criteria:
● Depth of Analysis: Quality and depth of reflections and analysis in project reports and
case studies.
● Application of Concepts: Ability to apply course concepts to real-world problems and
local contexts.
● Creativity: Innovative approaches and creative solutions proposed in projects and reflections.
● Presentation Skills: Clarity, coherence, and professionalism in the final presentation.
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Develop the ability to apply the principles of engineering ethics in their K3

CO1
professional life.
Develop the ability to exercise gender-sensitive practices in their K4
CO2
professional lives
Develop the ability to explore contemporary environmental issues and K5
CO3
sustainable practices.
Develop the ability to analyse the role of engineers in promoting K4
CO4
sustainability and climate resilience.
Develop interest and skills in addressing pertinent environmental and K3
CO5
climate-related challenges through a sustainable engineering approach.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 3 2 2

CO2 1 3 2 3 3 2 2

CO3 3 3 2 3 2 2

CO4 1 3 3 2 3 2 2

CO5 3 3 2 3 2 2
 Reference Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
2nd edition
Ethics in Engineering Practice Cambridge University
1 Caroline Whitbeck & August
and Research Press & Assessment
2011

Cambridge University November

2 Virtue Ethics and Professional Justin Oakley
Roles Press & Assessment 2006

2nd edition
Cambridge University &
3 Bert J. M. de Vries
Sustainability Science Press & Assessment December
2023

Cambridge University
4 Sustainable Engineering Bhavik R. Bakshi, 2019
Principles and Practice Press & Assessmen

M Govindarajan, S
PHI Learning Private
5 Natarajan and V S 2012
Engineering Ethics Ltd, New Delhi
Senthil Kumar

New age international

6 Professional ethics and human RS Naagarazan 2006.
values (P) limited New Delhi

Tata McGraw Hill

Mike W Martin and 4" edition,
7 Publishing Company
Ethics in Engineering Roland Schinzinger, 2014
Pvt Ltd, New Delhi

Suggested Activities/Projects:

Module-II
● Write a reflection on a local environmental issue (e.g., plastic waste in Kerala
backwaters or oceans) from different ethical perspectives (anthropocentric, biocentric,
ecocentric).
● Write a life cycle analysis report of a common product used in Kerala (e.g., a coconut,
bamboo or rubber-based product) and present findings on its sustainability.
● Create a sustainability report for a local business, assessing its environmental, social, and
economic impacts
● Presentation on biodiversity in a nearby area (e.g., a local park, a wetland, mangroves,
college campus etc) and propose conservation strategies to protect it.
● Develop a conservation plan for an endangered species found in Kerala.
● Analyze the green spaces in a local urban area and propose a plan to enhance urban
ecology using native plants and sustainable design.
● Create a model of a sustainable urban landscape for a chosen locality in Kerala.
Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption and
suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose improvements -
calculate the water footprint, how to reduce the footprint, how to increase supply through rainwater
harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the challenges
and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil, cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala

Module-IV
● Evaluate the potential for installing solar panels on the college campus including cost-benefit analysis
and feasibility study.
● Analyse the energy consumption patterns of the college campus and propose sustainable alternatives
to reduce consumption - What gadgets are being used? How can we reduce demand using energy-
saving gadgets?
● Analyse a local infrastructure project for its climate resilience and suggest improvements.
● Analyse a specific environmental regulation in India (e.g., Coastal Regulation Zone) and its impact
on local communities and ecosystems.
● Research and present a case study of a successful sustainable engineering project in Kerala/India
(e.g., sustainable building design, water management project, infrastructure project).
● Research and present a case study of an unsustainable engineering project in Kerala/India
highlighting design and implementation faults and possible corrections/alternatives (e.g., a housing
complex with water logging, a water management project causing frequent floods, infrastructure
project that affects surrounding landscapes or ecosystems).
 SEMESTER S3

DATA STRUCTURES LAB

(Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG)

Course Code PCCSL307 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)
Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GYEST204 Course Type Lab

Course Objectives:

To give practical experience for learners on implementing different linear and non linear data
structures, and algorithms for searching and sorting.

Expt.
Experiments
No.
1 Find the sum of two sparse polynomials using arrays
2 Find the transpose of a sparse matrix and sum of two sparse matrices.
3 Convert infix expression to postfix (or prefix) and then evaluate using stack,

4 Implement Queue, DEQUEUE, and Circular Queue using arrays.

Implement backward and forward navigation of visited web pages in a web browser (i.e.
5
back and forward buttons) using doubly linked list operations.
6 Implement addition and multiplication of polynomials using singly linked lists.
Create a binary tree for a given simple arithmetic expression and find the prefix / postfix
7
equivalent.
8 Implement a dictionary of word-meaning pairs using binary search trees.
9 Find the shortest distance of every cell from a landmine inside a maze.
We have three containers whose sizes are 10 litres, 7 litres, and 4 litres, respectively. The
7-litre and 4-litre containers start out full of water, but the 10-litre container is initially
10 empty. We are allowed one type of operation: pouring the contents of one container into
another, stopping only when the source container is empty or the destination container is
full. We want to know if there is a sequence of pourings that leaves exactly 2 litres in the 7
 or 4-litre container. Model this as a graph problem and solve.

11 Implement the find and replace feature in a text editor.

Given an array of sorted items, implement an efficient algorithm to search for specific
12
item in the array.
Implement Bubble sort, Insertion Sort, Radix sort, Quick Sort, and Merge Sort and
13
compare the number of steps involved.
The General post office wishes to give preferential treatment to its customers. They have
identified the customer categories as Defence personnel, Differently abled, Senior citizen,

14 Ordinary. The customers are to be given preference in the decreasing order - Differently
abled, Senior citizen, Defence personnel, Normal person. Generate the possible sequence
of completion.

Implement a spell checker using a hash table to store a dictionary of words for fast

15 lookup. Implement functions to check if a word is valid and to suggest corrections for
misspelled words.

16 Simulation of a basic memory allocator and garbage collector using doubly linked list

The CSE dept is organizing a tech fest with so many exciting events. By participating

in an event, you can claim for activity points as stipulated by KTU. Each event i gives
17
you A[i] activity points where A is an array. If you are not allowed to participate in more

than k events, what’s the max number of points that you can earn?

Merge K sorted lists into a single sorted list using a heap. Use a min-heap to keep track of
18 the smallest element from each list. Repeatedly extract the smallest element and insert the
next element from the corresponding list into the heap until all lists are merged.

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)
Continuous Internal Evaluation Marks (CIE):
Preparation/Pre-Lab Work experiments,
Viva and Timely Internal
Attendance Total
completion of Lab Reports / Record Examination
(Continuous Assessment)

5 25 20 50
End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output
10 15 10 10 5 50
● Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

● Endorsement by External Examiner: The external examiner shall endorse the record

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Model a real world problem using suitable data structure and implement the
CO1 K3
solution.
Compare efficiency of different data structures in terms of time and space
CO2 K4
complexity.
CO3 Evaluate the time complexities of various searching and sorting algorithms. K5
Differentiate static and dynamic data structures in terms of their advantages
CO4 K3
and application.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO- PO Mapping (Mapping of Course Outcomes with Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3 3 3 3
1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Universities
Fundamentals of Data Ellis Horowitz, Sartaj Sahni and Susan Press,
1 2/e, 2007
Structures in C Anderson-Freed,

Thomas H Cormen, Charles

Introduction to
2 Leisesrson, Ronald L Rivest, Clifford PHI 3/e, 2009
Algorithms
Stein

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Classic Data Structures Samanta D. Prentice Hall India. 2/e, 2018

Aho A. V., J. E. Hopcroft

2 Data Structures and Algorithms Pearson Publication. 1/e, 2003
and J. D. Ullman

Introduction to Data Structures with Tremblay J. P., P. G.

3 Tata McGraw Hill. 2/e, 2017
Applications Sorenson

Theory and Problems of Data

4 Lipschutz S. Schaum’s Series 2/e, 2014
Structures

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://nptel.ac.in/courses/106102064

2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

● Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding

of the upcoming experiment.
● Understanding of Theory: Evaluation based on students’ preparation and understanding of the
theoretical background related to the experiments.
2. Conduct of Experiments (7 Marks)

● Procedure and Execution: Adherence to correct procedures, accurate execution of

experiments, and following safety protocols.
● Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
● Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

● Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
● Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

● Oral Examination: Ability to explain the experiment, results and underlying principles
during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva,
and record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

● Procedure Understanding and Description: Clarity in explaining the procedure and

understanding each step involved.
● Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
 ● Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
● Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

● Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.

3. Result with Valid Inference/Quality of Output (10 Marks)

● Accuracy of Results: Precision and correctness of the obtained results.

● Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

● Ability to explain the experiment, procedure results and answer related questions
● Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

● Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER S3
DIGITAL LAB
(Common to CS/CM/AM/CN)

Course Code PCCSL308 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Lab

Course Objectives:
1. To enable the learner to design and implement basic digital logic circuits using logic
gates and ICs.
2. To familiarize digital system design using HDL.

EXPERIMENTS
(All HDL based experiments should be done using Verilog HDL. At Least three experiments
Expt. of PART A & B together should be implemented on a breadboard . Use any open source
No. circuit simulation software or web based logic simulator softwares for the rest of the
experiments (refer to https://circuitverse.org, https://simulator.io,
https://www.logiccircuit.org)
Part A
(All experiments in this part are mandatory. These experiments give an introduction to the
digital design by familiarising the basic gates and combinational circuits on breadboard /
circuit simulation softwares along with their HDL based realisation.)
Study of basic digital ICs and verification of Boolean theorems using digital logic
A1.
gates.
Familiarisation of the working of circuit simulation software.
a. Realize the basic logic gates and analyze their waveforms
A2..
b. Realize a given Boolean function using basic gates and verify the
waveform with the truth table.

Familiarisation of Verilog HDL - Modelling of the basic gates using

A3. a. gate level modelling
 b. behavioural modelling

c. structural modelling

d. dataflow modelling

Realization of an SOP and its corresponding POS expression using NAND gates alone and NOR
A4.
gates alone (to be do on breadboard and simulated using software)
Model a given Boolean function (SOP and POS) in Verilog using
a. continuous assignment with logical operators

A5. b. continuous assignment with conditional operators

c. using gate level primitives

Part B
(All experiments to be done using any circuit simulation softwares.)
Design and implement a combinational logic circuit for arbitrary functions (any two)
a) Code converters
B1.
b) Half adder, full adder, half subtractor, full subtractor
c) Multiplexer, Demultiplexer,Encoder, Decoder
Design and implement combinational circuits using MSI devices: (any three)
1. 4-bit adder and subtractor using MSI device IC 7483.
B2. 2. Parity generator / checker using MSI device IC 74180
3. Magnitude Comparator using MSI device IC 7485
4. Implement a boolean function using MUX IC
B3. Study of D flip flop and JK flip flops using ICs
To design and implement the following shift registers using D flip flops
(i) Serial in serial out
B4. (ii) Serial in parallel out
(iii) Parallel in serial out
(iv) Parallel in parallel out
Design and implement an asynchronous counter - 3 bit up counter, 3-bit down counter, 3 bit up
B5.
down counter with mode control, mod-N counter
Design and implement a synchronous counter - 3 bit up counter, 3-bit down counter, sequence
B6.
generator.
PART C
using Verilog HDL
For the all the experiments in part C:
1. Write Verilog program code in the IDE/Software (Other open source or online softwares
such as Icarus Verilog / EDAplayground may be used)
 2. Simulate the code using a test bench or by giving input values.

3. Synthesize the design and verify the waveforms

Model a 4:1 MUX, 1:4 DEMUX, 4 to 2 encoder, and 2 to 4 decoder and a 7-Segment Display
Decoder in Verilog using
C1. a. continuous assignment with logical operators

b. continuous assignment with conditional operators

C2. Design and synthesize the behavioural model for a D flip flop in Verilog HDL

C3. Design and synthesize the behavioural model for a synchronous counter in Verilog
Design a Verilog HDL behavioral model to implement a finite-state machine - a serial bit sequence
C4.
detector

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)
Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments, Viva

and Timely Internal
Attendance Total
completion of Lab Reports / Record Examination
(Continuous Assessment)

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid
Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output
10 15 10 10 5 50

● Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

● Endorsement by External Examiner: The external examiner shall endorse the record
 Course Outcomes (COs)
At the end of the course students should be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Model and construct combinational logic circuits. K3

CO2 Develop modular combinational circuits with MUX,DEMUX and decoder. K3

CO3 Experiment with synchronous and asynchronous sequential circuits. K3

CO4 Model and implement FSM. K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
CO- PO Mapping (Mapping of Course Outcomes with Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Logic Circuits Springer International
1 Brock J. LaMeres 2/e, 2017
& Logic Design with Verilog Publishing
Digital Design and Computer Sarah L. Harris, David
2 Morgan Kaufmann 1/e, 2022
Architecture - RISC-V Edition Harris
Verilog HDL Synthesis: A
3 J Bhasker Star Galaxy Publishing 1/e, 1998
Practical Primer
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Digital Design with an Introduction to the
M Morris Mano,
1 Verilog HDL, VHDL, and System Pearson 6/e, 2018
Michael D Ciletti
Verilog
Fundamentals of Digital Logic with Stephen Brown,
2 McGrawHill 3/e, 2014
Verilog Design Zvonko Vranesic

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/117105080

2 https://archive.nptel.ac.in/courses/108/103/108103179/

3 https://www.youtube.com/watch?v=JU0RKPe7AhA (Introduction to CircuitVerse)

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

● Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding

of the upcoming experiment.
● Understanding of Theory: Evaluation based on students’ preparation and understanding of the
theoretical background related to the experiments.
2. Conduct of Experiments (7 Marks)

● Procedure and Execution: Adherence to correct procedures, accurate execution of

experiments, and following safety protocols.
● Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
● Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

● Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
● Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.
 4. Viva Voce (5 Marks)

● Oral Examination: Ability to explain the experiment, results and underlying principles
during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva,
and record are the average of all the specified experiments in the syllabus.
Evaluation Pattern for End Semester Examination (50 Marks)
1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

● Procedure Understanding and Description: Clarity in explaining the procedure and

understanding each step involved.
● Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
● Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
● Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

● Setup and Execution: Proper setup and accurate execution of the experiment or programming task.

3. Result with Valid Inference/Quality of Output (10 Marks)

● Accuracy of Results: Precision and correctness of the obtained results.

● Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

● Ability to explain the experiment, procedure results and answer related questions
● Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

● Completeness, clarity, and accuracy of the lab record submitted