NRI INSTITUTE OF TECHNOLOGY

Approved by AICTE, New Delhi: Permanently Affiliated to JNTUK, Kakinada

Accredited by NAAC with "A" GRADE, Accredited by NBA (CSE,ECE&EEE)
An ISO 9001:2015 Certified Institution
Pothavarappadu (V), Agiripalli (M), Eluru District, A.P., India, Pin: 521 212
URL: www.nriit.edu.in, email: [email protected], Mobile: + 91 8333882444

PROPOSED COURSE STRUCTURE–B.TECH - AIML -R23

(Applicable from the academic year 2023-24 onwards)

AIML B.TECH. II - I YEAR NRIA23 REGULATIONS SYLLABUS

Scheme of
Scheme of Instruction
Sl. Examination No. of
Course Code Title of the Course (Periods Per Week)
No (Maximum Marks) Credits
L T P Total CIA SEA Total
Engineering Mathematics
(Branch specific)
1 BS&H 3 0 0 3 30 70 100 3
Discrete Mathematics &
Graph Theory
Universal Human Values – l
2 BS&H 2 2 0 4 30 70 100 2
Understanding Harmony
Engineering Introduction to Artificial
3 3 0 0 3 30 70 100 3
Science Intelligence
Professional Database Management
4 3 0 0 3 30 70 100 3
Core Systems
Professional Object Oriented
5 3 0 0 3 30 70 100 3
Core Programming Through Java
Professional Database Management
6 0 0 3 3 15 35 50 1.5
Core Systems Lab
Object Oriented
Professional
7 Programming Through Java 0 0 3 3 15 35 50 1.5
Core Lab
Skill
Python programming
8 Enhancement 0 1 2 3 15 35 50 3
course
9 Audit Course Constitution of India 2 0 0 2 15 35 50 -
Total 16 3 8 26 225 525 750 20

* Internal Evaluation

L - LECTURE T – TUTORIAL P - PRACTICAL

CIA – Continuous Internal Assessment SEA – Semester End Assessment
 NRI INSTITUTE OF TECHNOLOGY
Approved by AICTE, New Delhi: Permanently Affiliated to JNTUK, Kakinada
Accredited by NAAC with "A" GRADE, Accredited by NBA (CSE,ECE&EEE)
An ISO 9001:2015 Certified Institution
Pothavarappadu (V), Agiripalli (M), Eluru District, A.P., India, Pin: 521 212
URL: www.nriit.edu.in, email: [email protected], Mobile: + 91 8333882444

AIML B.TECH. II - II YEAR NRIA23 REGULATIONS SYLLABUS

Scheme of
Scheme of Instruction Examination
Sl. (Periods Per Week) (Maximum Marks No. of
Course Code Title of the Course
No ) Credits
L T P Total CIA SEA Total
Management Optimization 2 0 0 2 2
1 30 70 100
Course- I Techniques
Engineering Probability & Statistics 3 0 0 3 3
2 Science/ Basic 30 70 100
Science
Professional Foundations of 3 0 0 3 3
3 30 70 100
Core Machine Learning
Professional Advanced Data 3 0 0 3 3
4 Core Structures and 30 70 100
Algorithms
Professional Digital Logic & 3 0 0 3 3
5 Core Computer 30 70 100
Organization
Professional Machine Learning Lab 0 0 3 3 1.5
6 15 35 50
Core
Professional Advanced Data 0 0 3 3 1.5
7 Core Structures and 15 35 50
Algorithms Lab
Skill Full Stack 0 1 2 3 2
8 Enhancement development -1 15 35 50
course
9 BS&H Design Thinking 1 0 2 2 15 35 50 2
&Innovation
15 1 12 240 560 800 21

* Internal Evaluation
L - LECTURE T – TUTORIAL P - PRACTICAL
CIA – Continuous Internal Assessment SEA – Semester End Assessment
 DISCRETE MATHEMATICS AND GRAPH THEORY

Lecture – Tutorial: 3 – 0-0 Internal Marks: 30

Credits: 3 External Marks: 70
Prerequisites:
Fundamentals of Discrete mathematics, Fundamentals of Graph Theory.
Course Objectives:
 To introduce the students to the topics and techniques of discrete methods and
combinatorial reasoning.
 To introduce a wide variety of applications.
 To the algorithmic approach to the solution of problems.
 To the fundamental in discrete mathematics, and this approach reinforces the close lies
between this disciplines.
 To equip the students with standard concepts and tools at an intermediate to advanced
level mathematics to develop the confidence and ability among the students to handle
various real world problems and their applications.
Course Outcomes:
CO1 Build skills in solving mathematical problems (L3)
CO2 Comprehend mathematical principles and logic (L4)
CO3 Demonstrate knowledge of mathematical modelling and proficiency in using
mathematical software (L6)
CO4 Manipulate and analyze data numerically and /or graphically using appropriate
software. (L3)
CO5 How to communicate effectively mathematical ideas/results verbally or writing (L1)
CO6 Understanding various concepts of graphs and spanning trees (L2)

Contribution of Course Outcomes towards achievement of Program Outcomes (1 – Low, 2-

Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3
CO2 3 3
CO3 3 3
CO4 3 3
CO5 3 3
CO6 3 3
UNIT – I:Mathematical Logic: (10 Hrs)Propositional Calculus: Statements and
Notations, Connectives, Well Formed
Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological
Implications, Normal Forms, Theory of Inference for Statement Calculus, Consistency of
Premises, Indirect Method of Proof.
UNIT – II: Set Theory: (10Hrs)
Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations, properties of binary
relations in a set, Relation matrix and Graph of a relation, partition and covering of a set,
equivalence relations, compatibility relations, composition of binary relations, Partial order
relation, partially ordered set, Hasse diagram.
Functions: Bijective, Composition, Inverse, Permutation and Recursive functions.
UNIT–III:Combinatorics and Recurrence Relations:(10Hrs)
Basics of Counting, Permutations, Permutations with repetitions,Circular and Restricted
Permutations, Combinations, Combination with repetitions, Binomial and Multinomial
Coefficients and Theorems.
Recurrence Relations:
Recurrence Relations, Solving the Recurrence Relation by Substitution Method, Method of
Characteristic roots, Solving inhomogeneous Recurrence Relations.
UNIT –IV:Graph Theory:(10Hrs)
Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representation.
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and
Hamiltonian Graphs.
UNIT –V:Multi Graphs:(10 Hrs)
Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem,Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS
Spanning Trees.
TEXT BOOKS:
1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott,
A. Kandel and T. P. Baker, 2nd Edition, Prentice Hall of India.
2. Discrete Mathematical Structures with Applications to Computer Science, J.
P. Tremblay and P. Manohar, Tata McGraw Hill.

REFERENCE BOOKS:
1. Steven C. Chapra, Applied Numerical Methods with MATLAB for
Engineering and Science,Tata Mc. Graw HillEducation.
2. M. K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific
and Engineering Computation, New Age InternationalPublications.
3. nptl.ac.in/courses/1221104017

E-RESOURCES:1. www.nptel videos.com/mathematics/(Math Lectures from

MIT,Stanford,IIT’S
 Course Code- Universal Human Values– 1 - Understanding Harmony

Lecture – Tutorial- 3-0-0 3

Internal Marks:
Practical:: 0
3 7
Credits: External Marks:
0
Prerequisites: NIL
Course Objectives:

 To help the student to see the need for developing a holistic perspective of life.
 To sensitize the student about the scope of life – individual, family (inter-personal
relationship), society and nature/existence Strengthening self-reflection.
 To develop more confidence and commitment to understand, learn and act accordingly.
Course Outcomes: BTL
LEVE
L
Upon successful completion of the course, the student will be able to:
CO1 Describe more aware of themselves, and their surroundings (family, society,
nature) L2
CO2 Illustrate more responsibility in life, and in handling problems with sustainable
solutions, while keeping human relationships and human nature in mind L2
CO3 Evaluate the significance of trust and respect in human relationships and
society, and propose programs that foster justice, resolution, prosperity, and
fearlessness as comprehensive human goals. L5
CO4 Exhibit sensitivity to their commitment towards what they have understood
(human values, human relationship and human society) L3
CO5 Able to apply the principles of human values to professional ethics L3

Contribution of Course Outcomes towards achievement of Program Outcomes & Strength

of
correlations (3: Substantial, 2: Moderate, 1: Slight)
P PO PO PO PO PO P P P P PO PO PS P P
O 2 3 4 5 6 O O O O 11 12 O1 S S
1 7 8 9 10 O O
2 3
CO1 -- -- -- -- -- 2 -- -- -- -- -- -- -- -- --
CO2 -- -- -- -- -- 2 -- 2 2 2 -- -- -- -- --
CO3 -- -- -- -- -- 2 -- 2 -- -- -- -- 2 -- --
CO4 -- -- -- -- -- 2 -- 2 -- -- -- -- -- -- --
CO5 -- -- -- -- -- 2 -- 2 -- -- -- -- -- -- --
 Syllabus
Unit MappedCO
No Contents
Introduction - Need, Basic Guidelines, Content and Process for Value
Education: pose and motivation for the course, recapitulation from Universal
Human Values-I, Self-Exploration–what is it? - Its content and process;
‘Natural Acceptance’ and Experiential Validation- as the process for self-
exploration, Continuous Happiness and Prosperity- A look at basic Human
I Aspirations, Right understanding, Relationship and Physical Facility- the CO1
basic requirements for fulfilment of aspirations of every human being with
their correct priority, Understanding Happiness and Prosperity correctly- A
critical appraisal of the current scenario, Method to fulfil the
above human aspirations: understanding and living in harmony at various
levels.
Understanding Harmony in the Human Being - Harmony in Myself!
Understanding human being as a co-existence of the sentient ‘I’ and the
material ‘Body’, Understanding the needs of Self (‘I’) and ‘Body’ - happiness
and physical facility, Understanding the Body as an instrument of ‘I’ (I
II being the doer, seer and enjoyer),Understanding the characteristics and CO2
activities of ‘I’ and harmony in ‘I’, Understanding the harmony of I with the
Body: Sanyam and Health; correct appraisal of Physical needs, meaning of
Prosperity in detail, Programs to ensure Sanyam and Health
Understanding Harmony in the Family and Society- Harmony in Human-
Human Relationship: Understanding values in human-human relationship;
meaning of Justice (nine universal values in relationships) and program for
its fulfillment to ensure mutual happiness; Trust and Respect as the
foundational values of relationship. Understanding the meaning of Trust;
Difference between intention and competence, Understanding the meaning of
III Respect, Difference between respect and differentiation; the other salient CO3
values in relationship, Understanding the harmony in the society (society
being an extension of family): Resolution, Prosperity, fearlessness (trust) and
co- existence as comprehensive Human Goals, Visualizing a universal
harmonious order in society- Undivided Society, Universal Order- from
family to world family
Understanding Harmony in the Nature and Existence - Whole existence as
Coexistence: Understanding the harmony in the Nature, Interconnectedness
and mutual fulfilment among the four orders of nature- recyclability and self
IV regulation in nature, Understanding Existence as Co-existence of mutually CO4
interacting units in all- pervasive space, Holistic perception of
harmony at all levels of existence
 Implications of the above Holistic Understanding of Harmony on
Professional Ethics: Natural acceptance of human values, Definitiveness of
Ethical Human Conduct, Basis for Humanistic Education, Humanistic
V Constitution and Humanistic Universal Order, Competence in professional CO5
ethics: Ability to utilize the professional competence for augmenting universal
human order b. Ability to identify the scope and characteristics of people
friendly and eco-friendly production systems, c. Ability to identify and
develop appropriate technologies and management patterns for above
production systems. Case studies of typical holistic technologies, management
models and production systems, Strategy for transition from the present state
to Universal Human Order: a. At the level of individual: as socially and
ecologically responsible engineers, technologists and managers
b. At the level of society: as mutually enriching institutions and
organizations
TEXTBOOKS:

Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel Books,New
Delhi, 2010

REFERENCE BOOKS:

1. JeevanVidya: EkParichaya by ANagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.

2. HumanValues by A.N.Tripathi,NewAgeIntl.Publishers,NewDelhi,2004.
3. The Story of Stuff(Book).
4. TheStoryofMyExperimentswithTruth – byMohandas Karamchand Gandhi
 Introduction to Artificial Intelligence

Lecture – Tutorial- Practical:: 3-0-0 Internal Marks: 30

Credits: 3 External Marks: 70
Prerequisites:
Course Objectives:
1 To learn the difference between optimal reasoning vs human like reasoning
2 To understand the notions of state space representation, exhaustive search, heuristic search
along with the time and space complexities
3 To learn different knowledge representation techniques
4 To understand the applications of AI: namely Game Playing, Theorem Proving, Expert
Systems, Machine Learning and Natural Language Processing
Course Outcomes:
Upon Completion of the course, the students will be able to
CO1 Possess the ability to formulate an efficient problem space for a problem expressed in English.
CO 2 Possess the ability to select a search algorithm for a problem and characterize its time and space
complexities.
CO3 Possess the skill for representing knowledge using the appropriate technique
CO4 Possess the ability to apply AI techniques to solve problems of Game Playing, Expert Systems,
Machine Learning and Natural Language Processing
CO5 Apply the knowledge to develop the solutions for real life
problems CO6 Develop new algorithms to contribute to the research
arena
Upon successful completion of the course, the student will be able to:
Contribution of Course Outcomes towards achievement of Program Outcomes (1 – Low, 2-
Medium, 3 –
High)
P P P P P P P P P P P P
O O O O O O O O O O O O
1 2 3 4 5 6 7 8 9 10 11 12
CO1 -
3 - 2 - 2 - - - - 2 -
CO2 3 2 - 2 - - - - 2 - 2 -
CO3 3 - 2 - - - - 2 - - - -
CO4 3 2 - 2 - - - - - - -
CO5 3 - 2 - 2 - - 2 2 2 - -
CO6 3 - - 2 2 - - - - 2 2 2

Unit - I
Introduction, History, Intelligent Systems, Foundations of AI, Sub areas of AI, Applications. Problem
Solving – State-Space Search and Control Strategies: Introduction, General Problem Solving,
Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening A*,
Constraint Satisfaction
Unit – II
Logic Concepts and Logic Programming: Introduction, Propositional Calculus, Propositional Logic,
Natural Deduction System, Resolution Refutation in Propositional Logic, Predicate
Logic, Logic Programming.
Representing Knowledge Using Rules: Logic programming, Procedural Vs Declarative knowledge,
Forward Vs Backward Reasoning, Matching, Control Knowledge
Unit – III
Knowledge Representation: Introduction, Approaches to Knowledge Representation, Knowledge
Representation using Semantic Network, Extended Semantic Networks for KR, Knowledge
Representation using Frames, Conceptual dependencies, Scripts
Unit IV
Learning in AI Systems : Types of Learning, Supervised, Unsupervised, and Reinforcement Learning,
Rote Learning, Machine Learning Algorithms, Neural Networks, Decision Trees, Support Vector
Machines, Clustering Algorithms
Planning with State-Space Search : Partial-Order Planning, Planning Graphs, Planning and Acting in the
Real World
Unit-V
Natural Language Processing: Steps in The Natural Language Processing, Syntactic Processing and
Augmented Transition Nets, Semantic Analysis, NLP Understanding Systems;
Experts Systems: Overview of an Expert System, Architecture of an Expert Systems, Different Types of
Expert Systems, Architectures, Knowledge Acquisition and Validation Techniques, Knowledge System
Building Tools, Expert System Shells.
AI Programming languages: Overview of LISP and PROLOG, Production System in Prolog

Text Books
1. Artificial Intelligence, Elaine Rich and Kevin Knight, Tata Mcgraw-Hill Publications
2. Introduction To Artificial Intelligence & Expert Systems, Patterson, PHI publications

References:
1. Artificial Intelligence, George F Luger, Pearson Education Publications
2. Artificial Intelligence : A modern Approach, Russell and Norvig, Printice Hall
3. Artificial Intelligence, Robert Schalkoff, Mcgraw-Hill Publications
4. Artificial Intelligence and Machine Learning, Vinod Chandra S.S., AnandHareendran S.
 Course Code- Database Management Systems

Lecture – Tutorial- 3-0-0 30

Internal Marks:
Practical::
Credits: 3 External Marks: 70
Prerequisites: Engineering Mathematics-1, Data Structures
Course Objectives:
The main objectives of the course is to
 Introduce database management systems and to give a good formal foundation on the
relational model of data and usage of Relational Algebra
 Introduce the concepts of basic SQL as a universal Database language
 Demonstrate the principles behind systematic database design approaches by covering
conceptual design, logical design through normalization
 Provide an overview of physical design of a database system, by discussing Database
indexing techniques and storage techniques

Course Outcomes: BTL

LEVEL
Upon successful completion of the course, the student will be able to:
CO1 Apply the Entity Relationship Model (ER Model) to represent entities, attributes,
relationships, and constraints using ER diagrams. (Applying) L3
CO2 Define domains, attributes, tuples, relations, and enforce constraints (Domain,
Key, Integrity) in the Relational Model. Perform operations using Relational
Algebra and Relational Calculus. (Applying) L3
CO3 Develop and execute SQL queries including basic querying (select and project),
data manipulation (insert, delete, update), and advanced operations like joins,
subqueries, and aggregation. (Applying) L3
CO4 Analyze and apply normalization techniques (1NF, 2NF, 3NF, BCNF, 4NF,
5NF) to optimize database schema, ensuring data integrity and efficient query
processing. (Analyzing) L4
CO5 Analyze potential concurrency control issues like deadlocks, and explain failure
classification and recovery mechanisms in the context of transactions. (Analyze) L4

Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CO1
- 2 1 - 1 - - - - - - - 2 2 2
CO2 3 3 2 - 2 - - - - - - - 2 - -
CO3 3 2 2 - 3 - - - - 2 - - 2 2 -
CO4 3 3 3 2 2 - - - - - - - 2 - 2
CO5 3 3 2 2 2 - - - - - - - 2 2 -

Syllabus
Unit Mapped
No Contents CO
UNIT I:
Introduction: Database system, Characteristics (Database Vs File System), Database
Users, Advantages of Database systems, Database applications. Brief introduction
of different Data Models; Concepts of Schema, Instance and data independence;
Three tier schema architecture for data independence; Database system structure,
I CO1
environment, Centralized and Client Server architecture for the database.
Entity Relationship Model: Introduction, Representation of entities, attributes, entity
set, relationship, relationship set, constraints, sub classes, super class, inheritance,
specialization, generalization using ER Diagrams.

UNIT II:
CO2
Relational Model: Introduction to relational model, concepts of domain, attribute,
tuple, relation, importance of null values, constraints (Domain, Key constraints,
integrity constraints) and their importance, Relational Algebra, Relational Calculus.
II
BASIC SQL:Simple Database schema, data types, table definitions (create, alter),
different DML operations (insert, delete, update).

UNIT III:
SQL:Basic SQL querying (select and project) using where clause, arithmetic &
logical operations, SQL functions(Date and Time, Numeric, String
conversion).Creating tables with relationship, implementation of key and integrity
constraints, nested queries, sub queries, grouping, aggregation, ordering,
implementation of different types of joins, view(updatable and non-updatable),
III relational set operations. CO3
UNIT IV:
Schema Refinement (Normalization):Purpose of Normalization or schema
refinement, concept of functional dependency, normal forms based on functional
IV dependencyLossless join and dependency preserving decomposition, (1NF, 2NF and CO4
3 NF), concept of surrogate key, Boyce-Coddnormal form(BCNF), MVD, Fourth
normal form(4NF), Fifth Normal Form (5NF).

UNIT V:
Transaction Concept: Transaction State, ACID properties, Concurrent Executions,
Serializability, Recoverability, Implementation of Isolation, Testing for
V CO5
Serializability, lock based, time stamp based, optimistic, concurrency protocols,
 Deadlocks, Failure Classification, Storage, Recovery and Atomicity, Recovery
algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+Trees, Hash Based
Indexing:

Text Books:
Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke, TMH (For
Chapters 2, 3, 4)
Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan,TMH (For Chapter 1 and
Chapter 5)

Reference Books:
Introduction to Database Systems, 8thedition, C J Date, Pearson.
Database Management System, 6th edition, RamezElmasri, Shamkant B. Navathe, Pearson
Database Principles Fundamentals of Design Implementation and Management, Corlos Coronel,
Steven Morris, Peter Robb, Cengage Learning.

Web-Resources:
https://nptel.ac.in/courses/106/105/106105175/
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01275806667282022456_shared/
overview
 Course Code- Object Oriented Programming Through Java

Lecture – Tutorial- 3-0-0 30

Internal Marks:
Practical::
Credits: 3 External Marks: 70
Prerequisites: C Programming language
Course Objectives:
The learning objectives of this course are to:
 Identify Java language components and how they work together in applications
 Learnthe fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries.
 Learn how to extend Java classes with inheritance and dynamic binding and how to use
exception handling in Java applications
 Understand how to design applications with threads in Java
 Understand how to use Java APIs for program development

Course Outcomes: BTL

LEVEL
Upon successful completion of the course, the student will be able to:
CO1 Recall core Java syntax and semantics, explain fundamental object-oriented
programming (OOP) concepts like classes, objects, inheritance, and interfaces.
(BTL Level: Remembering & Understanding) L1& L2
CO2 Implement basic Java programs using control flow statements (if-else, loops),
data types, variables, operators, methods, and constructors. (BTL Level:
Applying) L3
CO3 Utilize arrays for data storage and manipulation, analyze and debug programs to
identify and correct errors in logic and syntax. (BTL Level: Analyzing &
Applying) L3& L4
CO4 Explain and implement exception handling mechanisms, effectively utilize built-
in Java packages and libraries for efficient programming. (BTL Level:
Understanding & Applying) L2 & L3
CO5 Assess the performance and efficiency of Java programs, considering factors like
memory usage and execution time. (BTL Level: Evaluating) L5

Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CO1
3 2 - - - - - - - - - - 2 - -
CO2 3 - 3 - 2 - - - - - - - 2 - 2
CO3 3 2 2 - 3 - - - - 2 - 3 2 3 -
CO4 3 3 3 2 3 - - - - - - - 2 3 2
CO5 3 3 2 2 2 - - - - - - 3 3 - -

Syllabus
Unit Mapped
No Contents CO
UNIT I
Object Oriented Programming: Basic concepts, Principles,
Program Structure in Java: Introduction, Writing Simple Java Programs, Elements or
Tokens in Java Programs, Java Statements, Command Line Arguments, User Input
to Programs, Escape Sequences Comments, Programming Style.
I CO1,C
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration O2
of Variables, Data Types, Type Casting, Scope of Variable Identifier, Literal
Constants, Symbolic Constants, Formatted Output with printf() Method, Static
Variables and Methods, Attribute Final, Introduction to Operators, Precedence
and Associativity of Operators, Assignment Operator ( = ), Basic Arithmetic
Operators, Increment (++) and Decrement (- -) Operators, Ternary Operator,
Relational Operators, Boolean Logical Operators, Bitwise Logical Operators.
Control Statements:Introduction, if Expression, Nested if Expressions, if–else
Expressions, Ternary Operator?:, Switch Statement, Iteration Statements, while
Expression, do–while Loop, for Loop, Nested for Loop, For–Each for Loop, Break
Statement, Continue Statement.

UNIT II
CO2
Classes and Objects: Introduction, Class Declaration and Modifiers, Class
Members, Declaration of Class Objects, Assigning One Object to Another, Access
Control for Class Members, Accessing Private Members of Class, Constructor
II
Methods for Class, Overloaded Constructor Methods, Nested Classes, Final Class
and Methods, Passing Arguments by Value and by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded
Constructor Methods, Class Objects as Parameters in Methods, Access Control,
Recursive Methods, Nesting of Methods, Overriding Methods, Attributes Final and
Static.

UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in
Computer Memory, Accessing Elements of Arrays, Operations on Array Elements,
Assigning Array to Another Array, Dynamic Change of Array Size, Sorting of
Arrays, Search for Values in Arrays, Class Arrays, Two-dimensional Arrays, Arrays
of Varying Lengths, Three-dimensional Arrays, Arrays as Vectors.
III CO3
 Inheritance:Introduction, Process of Inheritance, Types of Inheritances, Universal
Super Class-Object Class, Inhibiting Inheritance of Class Using Final, Access
Control and Inheritance, Multilevel Inheritance, Application of Keyword Super,
Constructor Method and Inheritance, Method Overriding, Dynamic Method
Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces:Introduction, Declaration of Interface, Implementation of Interface,
Multiple Interfaces, Nested Interfaces, Inheritance of Interfaces, Default Methods in
Interfaces, Static Methods in Interface, Functional Interfaces, Annotations.

UNIT IV
Packages and Java Library:Introduction, Defining Package, Importing Packages
and Classes into Programs, Path and Class Path, Access Control, Packages in Java
IV SE, Java.lang Package and its Classes, Class Object, Enumeration, class Math, CO4
Wrapper Classes, Auto-boxing and Auto-unboxing, Java util Classes and Interfaces,
Formatter Class, Random Class, Time Package, Class Instant (java.time.Instant),
Formatting for Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters
Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes,
Keywords throws and throw, try, catch, and finally Blocks, Multiple Catch Clauses,
Class Throwable, Unchecked Exceptions, Checked Exceptions.
Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams,
Character streams, Scanner class, Files in Java

UNIT V
String Handling in Java:Introduction, Interface Char Sequence, Class String,
Methods for Extracting Characters from Strings,Comparison, Modifying, Searching;
V CO5
Class String Buffer.
Multithreaded Programming:Introduction, Need for Multiple Threads
Multithreaded Programming for Multi-core Processor, Thread Class, Main Thread-
Creation of New Threads, Thread States, Thread Priority-Synchronization, Deadlock
and Race Situations, Inter-thread Communication - Suspending, Resuming, and
Stopping of Threads.
Java Database Connectivity:Introduction, JDBC Architecture, Installing MySQL
and MySQL Connector/J, JDBC Environment Setup, Establishing JDBC Database
Connections, ResultSet Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying
text and image, event handling, laying out nodes in scene graph, mouse events

Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
 2) Joy with JAVA, Fundamentals of Object Oriented Programming, DebasisSamanta,
MonalisaSarma, Cambridge, 2023.
3) JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

References Books:
1) The complete Reference Java, 11thedition, Herbert Schildt,TMH
2) Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

Online Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618816347_shared/
overview
 Course Code- Object Oriented Programming Through Java Lab

Lecture – Tutorial- 0-0-3 30

Internal Marks:
Practical::
Credits: 1.5 External Marks: 70
Prerequisites: C Programming language
Course Objectives:
The aim of this course is to
 Practice object oriented programming in the Java programming language
 Implement Classes, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User
defined Exception handling mechanism
 Illustrate inheritance, Exception handling mechanism, JDBC connectivity
 Construct Threads, Event Handling, implement packages, Java FX GUI

Course Outcomes: BTL

LEVEL
Upon successful completion of the course, the student will be able to:
CO1 Implement Java programs that utilize primitive data types, control structures,
classes, methods, inheritance, polymorphism, exception handling, threads,
L3
packages, interfaces, files, I/O streams, and JavaFX GUI to solve specific
problems. (Applying)
CO2 Analyze and debug Java programs to identify errors in logic and syntax, and
apply appropriate algorithms such as binary search and bubble sort to manipulate L4
data structures. (Analyzing)
CO3 Assess the efficiency and effectiveness of different programming constructs and
algorithms used in Java, and evaluate the impact of exception handling and L5
multi-threading on program performance. (Evaluating)
CO4 Design and create Java applications that demonstrate an understanding of
advanced concepts such as abstract classes, interfaces, user-defined exceptions,
L6
database connectivity using JDBC, and build graphical user interfaces using
JavaFX. (Creating)

Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CO1
3 2 - - - - - - - - - 2 2 - -
CO2 3 - 3 - 2 - - - - - - - 2 - 2
CO3 3 2 2 - 3 - - - - - - 3 2 3 -
CO4 3 3 3 2 3 - - - - - - - 2 3 2
 Syllabus
S No. Mapped
CONTENTS
CO
Experiments covering the Topics:
 Object Oriented Programming fundamentals- data types, control structures
 Classes, methods, objects, Inheritance, polymorphism,
 Exception handling, Threads, Packages, Interfaces
 Files, I/O streams, JavaFX GUI

Exercise – 1: CO1,

a) Write a JAVA program to display default value of all primitive data type of
1 JAVA

b) Write a JAVA program that display the roots of a quadratic equation ax2+bx=0.
Calculate the discriminate D and basing on value of D, describe the nature of root.

Exercise - 2 CO2

2 a) Write a JAVA program to search for an element in a given list of elements using
binary search mechanism.

b) Write a JAVA program to sort for an element in a given list of elements using
bubble sort

c) Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3 CO2

3 a) Write a JAVA program to implement class mechanism. Create a class, methods

and invoke them inside main method.

b) Write a JAVA program implement method overloading.

c) Write a JAVA program to implement constructor.

d) Write a JAVA program to implement constructor overloading.

Exercise - 4 CO1

4 a) Write a JAVA program to implement Single Inheritance

b) Write a JAVA program to implement multi level Inheritance

 c) Write a JAVA program for abstract class to find areas of different shapes

Exercise - 5 CO1

5 a) Write a JAVA program give example for “super” keyword.

b) Write a JAVA program to implement Interface. What kind of

Inheritance can be achieved?

c) Write a JAVA program that implements Runtime

polymorphism

Exercise – 6 CO3

a) Write a JAVA program that describes exception handling mechanism

6 b) Write a JAVA program Illustrating Multiple catch clauses

c) Write a JAVA program for creation of JAVA Built-in Exceptions

d) Write a JAVA program for creation of User Defined Exception
Exercise - 7 CO3
a) Write a JAVA program that creates threads by extending Thread class.First
thread display “Good Morning “every 1 sec, the second thread displays “Hello
“every 2 seconds and the third display “Welcome” every 3 seconds,(Repeat the
same by implementing Runnable)
7
b) Write a program illustrating is Alive and join ()
c) Write a Program illustrating Daemon Threads.
d) Write a JAVA program Producer Consumer Problem

Exercise – 8
a. Write a JAVA program that import and use the user defined packages
b. Without writing any code, build a GUI that display text in label and image
in an ImageView (use JavaFX)
8 c. Build a Tip Calculator app using several JavaFX components and learn
how to respond to user interactions with the GUI

CO4
 Exercise – 9

a) Write a java program that connects to a database using JDBC

b)Write a java program to connect to a database using JDBC and insert values
9 into it.
CO4
c) Write a java program to connect to a database using JDBC and delete values
from it

Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2) Joy with JAVA, Fundamentals of Object Oriented Programming, DebasisSamanta,
MonalisaSarma, Cambridge, 2023.
3) JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

References Books:
1) The complete Reference Java, 11thedition, Herbert Schildt,TMH
2) Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

Online Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618816347_shared/
overview
 Course Code- Database Management Systems Lab

Lecture – Tutorial- 0-0-3 30

Internal Marks:
Practical::
Credits: 1.5 External Marks: 70
Prerequisites: Computer Programming Lab
Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DML Commands
 Declare and enforce integrity constraints on a database
 Writing Queries using advanced concepts of SQL
 Programming PL/SQL including procedures, functions, cursors and triggers

Course Outcomes: BTL

LEVEL
Upon successful completion of the course, the student will be able to:
CO1 Apply database management techniques to solve problems L2
CO2 Conduct experiments by using modern tools like MYSQL, Oracle L3
CO3 Develop an effective report based on various constructs implemented. L3
CO4 Apply technical knowledge for a given problem and express with an effective L3
oral communication
CO5 Analyze outputs of queries for a given problem L4

Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CO1
3 2 - - - - - - - - - 2 2 - -
CO2 3 - 3 - 2 - - - - - - - 2 - 2
CO3 3 2 2 - 3 - - - - 2 - 3 2 3 -
CO4 3 3 3 2 3 - - - - 3 - - 2 3 2
CO5 - - - - - - - - - - - 3 - 2 -

Syllabus
EXP Mapped
CONTENTS
CO
Creation, altering and dropping of tables and inserting rows into a table (use CO1,CO2,CO
I constraints while creating tables). 3,CO4,CO5
 II Queries using i)DML Commands. INSERT, UPDATE and DELETE ii)DCL CO1,CO2,CO
Commands: COMMIT , ROLLBACK and SAVEPOINT. 3,CO4,CO5

III Queries using i)SELECT statement ii) SELECT statement with where CO1,CO2,CO
clause(Comparison Operators, AND, OR, NOT, IN, BETWEEN,LIKE) iii) 3,CO4,CO5
ORDER BY clause(sort by column name) iv) LIMIT clause

IV Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), CO1,CO2,CO
GROUP BY, HAVING and Creation and dropping of Views. 3,CO4,CO5

V Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, CO1,CO2,CO
NOTEXISTS, UNION, INTERSET, Constraints. Example:- Select the roll 3,CO4,CO5
number and name of the student who secured fourth rank in the class.

VI Queries using Conversion functions (to_char, to_number and to_date), string CO1,CO2,CO
functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, 3,CO4,CO5
length, substr and instr), date functions (Sysdate, next_day, add_months,
last_day, months_between, least, greatest, trunc, round, to_char, to_date)

Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, CO1,CO2,CO
VII NOTEXISTS, UNION, INTERSECT. 3,CO4,CO5

VIII Queries using Inner join, outer join using USING and NATURAL Keywords. CO1,CO2,CO
3,CO4,CO5

IX Create a simple PL/SQL program which includes declaration section, CO1,CO2,CO

executable section and exception –Handling section (Ex. Student marks can 3,CO4,CO5
be selected from the table and printed for those who secured first class and an
exception can be raised if no records were found)
Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.

X Develop a program that includes the features NESTED IF, CASE and CASE CO1,CO2,CO
expression. The program can be extended using the NULLIF and 3,CO4,CO5
COALESCE functions.

XI Program development using WHILE LOOPS, numeric FOR LOOPS, nested CO1,CO2,CO
loops using ERROR Handling, BUILT –IN Exceptions, USE defined 3,CO4,CO5
Exceptions, RAISE- APPLICATION ERROR.
 Programs development using creation of procedures, passing parameters IN CO1,CO2,CO
XII and OUT of PROCEDURES. 3,CO4,CO5

Program development using creation of stored functions, invoke functions in CO1,CO2,

XIII SQL Statements and write complex functions. CO3,CO4,
CO5
XIV Develop programs using features parameters in a CURSOR, FOR UPDATE CO1,CO2,CO
CURSOR, WHERE CURRENT of clause and CURSOR variables. 3,CO4,CO5

Develop Programs using BEFORE and AFTER Triggers, Row and Statement CO1,CO2,
XV Triggers and INSTEAD OF Triggers. CO3,CO4,
CO5
CO1,CO2,CO
XVI Create a table and perform the search operation on table using indexing and 3,CO4,CO5
non-indexing techniques

Learning Resources
Text Books
1. Murach‟s MySQL by JOEL MURACH, Shroff Publishers & Distributors Pvt.Ltd, June
2012.
2. The Complete Reference MYSQL,VikramVaswani, 2017, McGrawHill Education.
3. Oracle: The Complete Reference by Oracle Press
4. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
5. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007
 Course Code- Python Programming

Lecture – Tutorial- 0-1-2 30

Internal Marks:
Practical::
Credits: 2 External Marks: 70
Prerequisites: NIL
Course Objectives:
The main objectives of the course are to
 Introduce core programming concepts of Python programming language.
 Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
 Implement Functions, Modules and Regular Expressions in Python Programming and to create
practical and contemporary applications using these
Course Outcomes
Upon successful completion of the course, the student will be able to:
CO1 Apply Python programming constructs for solving problems. L3
CO2 Conduct experiments as an individual, or team member by using Python L3
programming.
CO3 Develop an effective report based on various programs implemented. L3
CO4 Apply technical knowledge for a given problem and express with an effective oral L3
communication
CO5 Analyze outputs generated through Python programming. L4

Contribution of Course Outcomes towards achievement of Program Outcomes &Strength of

correlations(3:Substantial,2:Moderate,1:Slight)
PO1 PO PO PO PO PO PO PO PO PO PO1 PO1 PS PS PSO3
2 3 4 5 6 7 8 9 10 1 2 O1 O2
CO1 - - - - 3 - - - - - - - 3 - -
CO2 - - 3 - 3 - - - 2 - - - - - 3
CO3 - - - - - - - - 2 - - - 3 -
CO4 - - - - 3 - - - - 3 - - 2 - -
CO5 - 3 3 - - - - - - - - - 3 3

Syllabus
Unit No. Mapped
CONTENTS
CO
UNTI-I:
History of Python Programming Language, Thrust Areas of Python,
Installing Anaconda Python Distribution, Installing and Using Jupyter
I Notebook. CO1,C02,CO3,C
Parts of Python Programming Language: Identifiers, Keywords, O4,CO5
Statements and Expressions, Variables, Operators, Precedence and
Associativity, Data Types, Indentation, Comments, Reading Input, Print
Output, Type Conversions, the type () Function and Is Operator,
Dynamic and Strongly Typed Language.
Control Flow Statements: if statement, if-else statement, if...elif…else,
Nested if statement, while Loop, for Loop, continue and break
Statements, Catching Exceptions Using try and except Statement.
Sample Experiments
1. Write a Program to print the student details using Escape
sequence characters.(Example:\n,\t,\”).
2. The total number of students in a class are 45 out of which 25 are
boys. If 80% of the total students secured grade 'A' out of which
16 are boys, then Develop a Program to calculate the total number
of girls getting grade 'A'.
3. Develop a Program to calculate the sum of the first and the last
digit of a 56743
4. Write a program for calculating the bill amount for an item with
the following scenarios
 The quantity of item sold, and price of the item must read
from the user and calculate the bill
 After that there is a 10% discount on bill amount
 There is a tax amount of 12%
 Find the total bill after availing the discount and applying
the tax
5. Implement a program to calculate in how many days a work will
be completed by three persons A, B and C together. A, B, C take
x days, y days and z days respectively to do the job alone. The
formula to calculate the number of days if they work together is
xyz/(xy + yz + xz) days where x, y, and z are given as input to
the program.
6. Implement a program to read two complex numbers and perform
addition ,subtraction
7. Develop a program to demonstrate evolution of following
arithmetic expressions?
 Consider b=4, c=8, d=2,e=4,f=2
 a=b+c/d+e*f
 a=(b+c)/d+e*f
 a=b+c/((d+e)*f)
8. Write a Python program that takes two lists as input and
concatenates them using the "+" operator.
9. Write a program to enter the marks of a student in four subjects.
Then calculate the total and aggregate, and display the grade
obtained by the student. If the student scores an aggregate
greater than 75%, then the grade is Distinction. If aggregate is
>=60 and <75, then the grade is First Division. If aggregate is
>=50 and <60, then the grade is Second division. If aggregate is
>=40 and <50, then the grade is third division. Else the grade is
Fail.
 10. Write a program to calculate roots of a quadratic equation. The
programmer has to identify whether the roots are real, equal or
imaginary
11. A company decides to give bonus to all its employees on Diwali.
A 5% bonus on salary is given to the male workers and 10%
bonus on salary to the female workers. Write a program to enter
the salary and gender of the employee. If the salary of the
employee is less than Rs. 10,000 then the employee gets an extra
2% bonus on salary. Calculate the bonus that must be given to
the employee and display the salary that the employee will get.

12. Demonstrate a program to print the sum of the series 1/12+

1/22+1/32 +……. +1/n2. where n is taken from the user.

13. Write a program to implement the below scenarios

 Sum of cubes of numbers from 1 to n using range ().

 Display the numbers in descending order using range ().
 Sum of squares of even numbers from 1 to n using range ().
 Display all leap years from 2000 – 2200 using range ().

14. Write a program to print the below patterns:

1 1 5432 *
1
23 21 ** 1
4321
456 321 *** 1 2
321
7 8 9 10 432 **** 12 3
1 21
11 12 13 14 **** 1 23 4
15 543 1 *
21
 15. Create a library with functions to input the values with exception
handling in Python

16. Write a Python program input and add two integers only and handle
the exceptions.

UNIT-II:

II Functions: Built-In Functions, Commonly Used Modules, Function CO1,C02,CO3,C

Definition and Calling the function, return Statement and void Function, O4,CO5
Scope and Lifetime of Variables, Default Parameters, Keyword Arguments,
*args and **kwargs, Command Line Arguments.

Strings: Creating and Storing Strings, Basic String Operations, Accessing

Characters in String by Index Number, String Slicing and Joining, String
Methods, Formatting Strings.Regular expression: Matching the patterns,
Search and replace.

Sample Experiments
1. Write a program to find sum of all odd numbers between 1 to n
using functions.

2. Write a program to demonstrate default arguments with keyword

arguments, to display name, age and salary of an employee.
Wherecourse (B. Tech) is passed as default argument.
3. Write a program to find the sum of first 10 natural numbers
usinglambda or anonymous function using range () function.
4. Demonstrate a program to convert time into minutes using
functions
5. Write a program to calculate simple interest. Suppose the
customeris a senior citizen. He is being offered 12% rate of
interest (ROI).For all other customers, the ROI is 10%.
6. Python Program to check if two numbers are amicable numbers
ornot. Two different numbers are called amicable numbers if the
sumof the proper divisors of each is equal to the other number.
7. Demonstrate a program to sum the series 1/1!+4/2!+27/3+…n
usingfunctions
8. Write a program to generate the following pattern using default
arguments. Consider four types in calling the function.
 Do not pass arguments
 Pass only the character as argument
 Pass character and no. of rows as argument
 Pass character, no. of rows and columns as arguments.
9. Write a program using recursive functions:
 Counting the no. of times, a recursive function is called
  Power of a number
 GCD of two given numbers
 Print the Fibonacci series
.
10. Write a python program without using the built in functions to
find the length of the string, reverse the string.
11. Write a python program to arrange string characters such that
lowercase letters should come first.
12. Write a program that uses regular expressions to validate dates
entered by users. The program should check that the date is in a
valid format, such as MM/DD/YYYY and that the month, day,
and year values are within a valid range.
13. Write a program to validate a password using regular
expressions using the following rules
• At least 8 characters long
• Contains at least one uppercase letter
• Contains at least one lowercase letter
• Contains at least one digit
14. Write a program to remove all non-alphanumeric characters from
a given string using regular expressions.
UNIT-III:

III Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, CO1,C02,CO3,C
Built-In Functions Used on Lists, List Methods, del Statement. O4,CO5

Dictionaries: Creating Dictionary, Accessing and Modifying key:value Pairs

in Dictionaries, Built-In Functions Used on Dictionaries, Dictionary
Methods, del Statement.

Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple() Function,
Indexing and Slicing in Tuples, Built-In Functions Used on Tuples, Relation
between Tuples and Lists, Relation between Tuples and Dictionaries, Using
zip() Function, Sets, Set Methods, Frozenset.

Sample Experiments
1. Write a python program to add each element of list x with list y
using nested loops.
2. Write a python program to print index at which a particular value
exists. If the value exists at multiple locations in the list, then print all
the indices. Also, count the number of times that value is repeated in
the list.
3. Write a python program applying all the list methods ('append', 'clear',
'copy', 'count', 'extend', 'index', 'insert', 'pop', 'remove', 'reverse', 'sort')
on the given list.
List = [100,’a’,’b’,102,2.3,4.5]
 4. Write a python program to add each element of x list with each
element of y list.
 Using loops
 Using list comprehension

5. Write a program using lambda and below functions to perform

tasks
 Using filter () to filter out even numbers from a list.
 Find squares of elements in a list using map ().
 Product of elements of a list using reduce() function
6. Write a python program to do the below matrix operations
 Addition
 Subtraction
 Multiplication
7. Write a program to create tuples (name, age, address, college) for at
least two members and concatenate the tuples and print the
concatenated tuples.
8. Write a program to count the number of vowels in a string (No
control flow allowed).
9. Write a program to check if a given key exists in a dictionary or not.
10. Write a program to add a new key-value pair to an existing
dictionary.
11. Write a program to sum all the items in a given dictionary.
12. Write a program that reads string from user. Your program should
create a dictionary having key as word length and value is count of
words of that length. For example, if user enters 'A fat cat is on the
mat'.The content of dictionary should be {1:1, 3:4, 2:2}
UNIT-IV:

Files: Types of Files, Creating and Reading Text Data, File Methods to
IV Read and Write Data, Reading and Writing Binary Files, Pickle Module, CO1,C02,CO3,
Reading and Writing CSV Files, Python os and os.path Modules. CO4,CO5

Object-Oriented Programming: Classes and Objects, Creating Classes in

Python, Creating Objects in Python, Constructor Method, Classes with
Multiple Objects, Class Attributes Vs Data Attributes, Encapsulation,
Inheritance, Polymorphism.

Sample Experiments

1. Write a program to sort words in a file and put them in another file.
The output file should have only lower-case words, so any upper-
case words from source must be lowered.
2. Python program to print each line of a file in reverse order.
3. Python program to compute the number of characters, words and
 lines in a file.
4. Write a function lines_count() that reads lines from a text file named
'zen.txt' and displays the lines that begin with any vowel. Assume the
file contains the following text and already exists on the computer's
disk:
Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
The lines_count() function should display the output as:
Explicit is better than implicit.
5. Write a Python program to create a class that represents a shape.
Include methods to calculate its area and perimeter. Implement
subclasses for different shapes like circle, triangle, and square.
6. .Create aParallelepipede child classinheriting from theRectangle class
and withaheight attribute and anotherVolume() method to calculate
the volume oftheParallelepiped.
7. Write the complete code for BankAccount class based on the
description given below:
 Create a Python class calledBankAccountwhich represents a bank
account, havingasattributes:accountNumber(numeric
type),Name(name of the account owner asstring type), balance.
 Create a constructorwith parameters:accountNumber, name, balance
 Create aDeposit()method which manages the deposit actions.
 .Create aWithdrawal() methodwhich manages withdrawals actions.
 Create abankFees()method to apply the bank fees with a percentage
of 5% of the balance account.
 Create adisplay()method to display account details.
UNIT-V:

V Introduction to Data Science: Functional Programming, JSON and XML in CO1,CO2,CO3

Python, NumPy with Python, Pandas. ,CO4,CO5

Sample Experiment

1. Python program to check whether a JSON string contains complex

object or not.
2. Python Program to demonstrate NumPy arrays creation using array ()
function.
3. Python program to demonstrate use of ndim, shape, size, dtype.
4. Python program to demonstrate basic slicing, integer and Boolean
indexing.
5. Python program to find min, max, sum, cumulative sum of array
 6. Create a dictionary with at least five keys and each key represent value
as a list where this list contains at least ten values and convert this
dictionary as a pandas data frame and explore the data through the
data frame as follows:
a) Apply head () function to the pandas data frame
b) Perform various data selection operations on Data Frame
7. Select any two columns from the above data frame, and observe the
change in one attribute with respect to other attribute with scatter and
plot operations in matplotlib

Learning Resources
TextBooks
1. Gowrishankar S, Veena A., Introduction to Python Programming, CRC Press.

Reference Books
1. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2 ndEdition, Pearson, 2024
2. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.

E-Resources & other digital material

1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus
 Course Code- CONSTITUTION OF INDIA

Lecture – Tutorial- 2-0-0 30

Internal Marks:
Practical::
Credits: 0 External Marks: 70*
Prerequisites: NIL
Course Objectives:
The main objectives of the course are to
 Familiarize with constitutive rules with the help of the case study of Nepal, learn very basic
understanding of the significance of these features within the working of democracy
 Develop concerns of diversity, unity, socio economic reform and representation, understand the
ways in which a balance was created between the then existing concerns and the commitment
to transform independent India into a strong and democratic society
Course Outcomes:
Upon successful completion of the course, the student will be able to:
CO1 Describe historical background of the constitution making and its importance for building a
democratic India. (L2)
CO2 Know the functioning of three wings of the government i.e., executive, legislative and judiciary.
(L2)
CO3 Able to know the value of the fundamental rights and duties for becoming good citizen of India.
(L2)
CO4 Analyse the decentralisation of power between central, state and local self government (L4)
CO5 Apply the knowledge in strengthening of the constitutional institutions like CAG, Election
Commission and UPSC for sustaining democracy. (L3)
Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2-
Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O O3
2
CO1
3 2 - - - - - - - - - 2 - - -
CO2 3 3 3 - - - - 2 - - - - - - -
CO3 3 - 2 - - - - - - - - 2 - - -
CO4 - - 3 - - - - 2 - - - - - - -
CO5 - - 3 - - - - 2 - - - - - - -

UNIT I
Introduction to Indian Constitution: Constitution’ meaning of the term, Indian Constitution - Sources
and constitutional history, Features - Citizenship, Preamble, Fundamental Rights and Duties, Directive
Principles of State Policy. (CO1)
UNIT II
Union Government and its Administration Structure of the Indian Union: Federalism, Centre- State
relationship, President: Role, power and position, PM and Council of ministers, Cabinet and Central
Secretariat, Lok Sabha, Rajya Sabha, The Supreme Court and High Court: Powers and Functions;
(CO2)
UNIT III
State Government and its Administration Governor - Role and Position - CM and Council of ministers,
State Secretariat: Organisation, Structure and Functions (CO3)

UNIT IV
Local Administration - District’s Administration Head - Role and Importance, Municipalities - Mayor
and role of Elected Representative - CEO of Municipal Corporation Pachayati Raj: Functions PRI: Zilla
Panchayat, Elected officials and their roles, CEO Zila Panchayat: Block level Organizational Hierarchy
- (Different departments), Village level - Role of Elected and Appointed officials - Importance of grass-
root democracy (CO4)
UNIT V
Election Commission: Role of Chief Election Commissioner and Election Commission; State Election
Commission: Functions of Commissions for the welfare of SC/ST/OBC and women (CO5)*
Reference Books
1. Durga Das Basu, Introduction to the Constitution of India, Prentice – Hall of India Pvt.Ltd.. New
Delhi
2. SubashKashyap, Indian Constitution, National Book Trust J.A. Siwach, Dynamics of Indian
Government & Politics D.C. Gupta, Indian Government and Politics 3. H.M.Sreevai, Constitutional
Law of India, 4th edition in
3 volumes (Universal Law Publication)
4. J.C. Johari, Indian Government and Politics Hans J. Raj IndianGovernment and Politics
5. M.V. Pylee, Indian Constitution Durga Das Basu, Human Rights in Constitutional Law, Prentice –
Hall of India Pvt.Ltd.. New Delhi
6. Noorani, A.G., (South Asia Human Rights Documentation Centre), Challenges to Civil Right),
Challenges to Civil Rights Guarantees in India, Oxford University Press 2012
E-Resources:
nptel.ac.in/courses/109104074/8
nptel.ac.in/courses/109104045/
nptel.ac.in/courses/101104065/
www.hss.iitb.ac.in/en/lecture-details
www.iitb.ac.in/en/event/2nd-lecture-institute-lecture-series-indian-constitution
 II-II SEMESTER:

Scheme of
Scheme of Instruction Examination
Sl. (Periods Per Week) (Maximum Marks No. of
Course Code Title of the Course
No ) Credits
L T P Total CIA SEA Total
Management Optimization 2 0 0 2 2
1 30 70 100
Course- I Techniques
Engineering Probability & Statistics 3 0 0 3 3
2 Science/ Basic 30 70 100
Science
Professional Foundations of 3 0 0 3 3
3 30 70 100
Core Machine Learning
Professional Advanced Data 3 0 0 3 3
4 Core Structures and 30 70 100
Algorithms
Professional Digital Logic & 3 0 0 3 3
5 Core Computer 30 70 100
Organization
Professional Machine Learning Lab 0 0 3 3 1.5
6 15 35 50
Core
Professional Advanced Data 0 0 3 3 1.5
7 Core Structures and 15 35 50
Algorithms Lab
Skill Full Stack 0 1 2 3 2
8 Enhancement development -1 15 35 50
course
Design Thinking
9 BS&H 1 0 2 2 15 35 50 2
&Innovation
15 1 12 240 560 800 21
 Course Code- OPTIMIZATION TECHNIQUES

Lecture – Tutorial- 2-0-0 30

Internal Marks:
Practical::
Credits: 2 External Marks: 70
Prerequisites: NIL
Course Objectives:
The main objectives of the course is to make student
 Develop a comprehensive understanding of optimization techniques applicable to engineering
problems.
 Acquire practical skills in formulating optimization problems, identifying constraints, and
defining objective functions.
 Learn to apply a variety of optimization algorithms and methods effectively.
 Gain insight into the theoretical foundations of optimization through both classical and modern
approaches.
 Explore real-world applications of optimization in engineering and decision-making contexts.

Course Outcomes: Upon successful completion of the course, the student will be able to
Statement BTL

CO1 Utilize a variety of classical optimization techniques. L3

CO2 Select suitable Numerical method for optimization of Engineering Problems. L3

CO3 Analyze Multistage Decision-Making Processes Using Dynamic Programming L3

CO4 Enumerate fundamentals of Integer programming technique L3

Contribution of Course Outcomes towards achievement of Program Outcomes &

Strength of correlations (H: High, M: Medium, L: Low)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 3 3 2 - 2 - 2 - 2 - 2 2 2 2

CO2 2 3 3 2 - 2 - 2 - 2 - 2 2 2 2

CO3 2 3 3 2 - 2 - 2 - 2 - 2 2 2 2

CO4 2 2 3 2 - 2 - 2 - 2 - 2 2 2 2
 SYLLABUS

UNIT Content Mapped CO

Introduction to optimization: Introduction, engineering applications of

optimization, statement of an optimization problem-design vector,
design constraints, constraint surface, objective function, classification
of optimization problems, optimization techniques.
1 CO1
Classical Optimization techniques: Introduction to Single Variable
Optimization and Multivariable Optimization without Constraints,
Semidefinite Cases, and Saddle Point Multivariable Optimization with
Equality Constraints Solved by the Method of Lagrange Multipliers

Non-linear programming, I: One-Dimensional Minimization

Methods: Introduction, Unimodal Functions, Elimination Methods -
2 CO2 CO1
Unrestricted Search, Fixed Step Size Search, Exhaustive Search,
Interval Halving Method, Fibonacci Method, Golden Section Method,
Interpolation Methods - Quadratic
Non-Linear Programming Interpolation
II: Direct Method
Search Method - Nelder-Mead
3 Simplex Method, Indirect Search Methods - Steepest Descent Method CO1 CO2
(Cauchy's Method), Newton's Method, Marquardt Method

Dynamic Programming: Multistage Decision Processes, Concepts of

4 Sub-Optimization - Calculus Methods and Tabular Methods, Linear CO1 CO3
Programming as a Case of Dynamic Programming

Integer Programming: Introduction, Graphical Representation,

5 Gomory’s Cutting Plane Method, Bala’s Algorithm for Zero-One CO1 CO4
Programming, Branch-and-Bound Method, Penalty Function Method;
Basic Approaches of Interior and Exterior Penalty Function Methods.
Learning Resources
Text Books:
1.S.S.Rao, Engineering optimization theory and practice, , 3rd Edition, New age
international,2007.
2. Optimization for Engineering Design by Kalyanmoy Deb, PHI Publishers
Reference Books:
 1. H.A.Taha, Operations Research, , 9th Edition, Prentice Hall of India, 2010.
2. F.S.Hillier, and G.J.Lieberman, Introduction to Operations Research, , 7th
Edition, TMH, 2009.
3. Mokhtar S. Bazaraa, Hanif D. Sherali, and C. M. Shetty Nonlinear
Programming: Theory and Algorithms b john wiley & Sons 2006
E-Resources & other digital Material:

1. https://nptel.ac.in/courses/111/105/111105039/
2. https://nptel.ac.in/courses/106/108/106108056/
3. https://nptel.ac.in/courses/111/104/111104071/
4. https://nptel.ac.in/courses/112/105/112105235/
 PROBABILITY AND STATISTICS

Lecture – Tutorial: 3 – 0--0 Internal Marks: 30

Credits: 3 External Marks: 70
Prerequisites: ...
Course Objectives:
• To familiarize the students with the foundations of probability and statistical methods
• To impart probability concepts and statistical methods in various applications
Engineering
Course Outcomes:
CO1 Classify the concepts of data science and its importance(L2)
CO2 Interpret the association of characteristics and through correlation and regression
tools (L4)
CO3 Make use of the concepts of probability and their applications(L3)
CO4 Apply discrete and continuous probability distributions (L3)
CO5 Design the components of a classical hypothesis test(L6)
CO6 Infer the statistical inferential methods based on small and large sampling tests(L4)

Contribution of Course Outcomes towards achievement of Program Outcomes (1 –

Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3
CO2 3 3
CO3 3 3
CO4 3 3
CO5 3 3
CO6 3 3

Unit–I: Descriptive statistics and methods for data science:

Data science – Statistics Introduction –Population vs Sample –Collection of data – primary
and secondary data–Type of variable: dependent and independent Categorical and
Continuous variables –Data visualization – Measures of Central tendency – Measures of
Variability – Skewness – Kurtosis.

UNIT–II: Correlation and Regression:

Correlation–Correlation coefficient–Rank correlation.
Linear Regression: Straight line – Multiple Linear Regression - Regression coefficients and properties
– Curvilinear Regression: Parabola – Exponential – Power curves.

UNIT–III: Probability and Distributions:

Probability– Conditional probability and Baye’s theorem – Random variables – Discrete and
Continuousrandomvariables–Distributionfunctions–Probabilitymassfunction,
Probability density function and Cumulative distribution functions–Mathematical Expectation and
Variance – Binomial, Poisson, Uniform and Normal distributions.
UNIT–IV: Sampling Theory:
Introduction – Population and Samples – Sampling distribution of Means and Variance
(definitiononly)–PointandIntervalestimations–Maximumerrorofestimate–Centrallimit theorem(without
proof)–Estimation using t, 𝜒 2 and F-distributions.
UNIT–V: Tests of Hypothesis:

Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and Type II errors – Level of
significance – One tail and two-tail tests – Test of significance for large samples and Small Samples:
Single and difference means – Single and two proportions –
Student’s t-test, F-test, 𝜒 2 − test.

TextBooks:
• MillerandFreund’s,ProbabilityandStatisticsforEngineers,7/e,Pearson,2008.
• S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan Chand
& Sons Publications, 2012.

Reference Books:
• Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineers and
the Scientists,8th Edition, Pearson 2007.
• Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8 th Edition,
Cengage.
• Sheldon M. Ross, Introduction to probability and statistics Engineers and the Scientists, 4 th
Edition, Academic Foundation, 2011.
• Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical
Scientists, 3rd Edition, Pearson, 2010.
E-RESOURCES: 1. www.nptel videos.com/mathematics/(Math Lectures from MIT,
Stanford, IIT’S
2. nptl.ac.in/courses/1221104017
 Foundations of Machine Learning
Course Objectives:
The objectives of the course is to
 Define machine learning and its different types (supervised and unsupervised) and understand
their applications.
 Apply supervised learning algorithms including decision trees and k-nearest neighbours (k-NN).
 Implement unsupervised learning techniques, such as K-means clustering.

Course Outcomes:
Upon successful completion of the course, the student will be able to:
CO1 Able to learn fundamentals of Machine Learning.
CO2 Understanding R Data Structures and Exploring Data.
CO3 Learn the use of Convex and Non-Convex functions.
CO4 Analyze various Optimization methods.
CO5 Use of Machine Learning Models.
CO6 Evaluation of Machine Learning Models.

P P P P P P P P P P P P PS PS PS
O O O O O O O O O O O O O1 O2 O3
1 2 3 4 5 6 7 8 9 1 1 1
0 1 2
C - 2 - 3
3 - 2 2 2 2 - - - 2 2
O1
C - 2 - 2
2 2 3 2 2 - - - - 2 2
O2
C - 2 - 2
- - 3 2 2 - - - - 3 3
O3
C - 2 - 2
3 3 2 3 3 3 - - - 2 3
O4
C - 2 - 2
3 3 2 3 3 3 - - - 2 3
O5
C - 2 - 3
- 2 2 3 3 3 - - - 2 3
O6

UNIT-I: Introduction to Machine Learning: Fundamentals of Machine Learning, Evolution of

Machine Learning
Types of Machine Learning: Supervised, Unsupervised, Reinforcement Learning, Learning by Rote,
Learning by Induction, Matching, Stages in Machine Learning.
UNIT-II: Data Acquisition and Modelling: Types of Data, Data acquisition, Data Representation,
Feature Engineering, Model Selection, Model Learning, Model Evaluation, Model Prediction, Search
and Learning
Training and Testing : Datasets, Overfitting, Underfitting, Cross-Validation

UNIT-III: Classification Models: Logistic Regression, K-Nearest Neighbors (KNN), Support Vector
Machines (SVM), Decision Trees, Random Forests, Gradient Boosting Machines (GBM), XGBoost
Evaluation Metrics: Confusion matrix, Accuracy, Precision, Recall, F1 Score

Unit IV: Regression Models : Linear Regression, multiple regression, Polynomial Regression, Ridge
Regression, Lasso Regression, Elastic Net,
Evaluation metrics : Mean Absolute Error, Mean Squared Error, Root Mean Squared Error.

UNIT-V: Unsupervised Learning: K-Means, Hierarchical Clustering, DBSCAN, Mean Shift,

Gaussian Mixture Models (GMM), Principal Component Analysis (PCA), Apriori, Eclat, FP-Growth
Reinforcement Learning: Q-Learning, SARSA, Deep Q-Networks (DQN), Policy Gradient Methods,
Actor-Critic Methods

Text Books:
1. “Machine Learning Theory and Practice”, M N Murthy, V S Ananthanarayana, Universities
Press (India), 2024

Reference Books:
1. “Machine Learning”, Tom M. Mitchell, McGraw-Hill Publication, 2017
2. “Machine Learning in Action”,Peter Harrington, DreamTech
3. “Introduction to Data Mining”, Pang-Ning Tan, Michel Stenbach, Vipin Kumar, 7th Edition,
2019.
 Course Code- Advanced Data Structures & Algorithm Analysis

Lecture – Tutorial- 3-0-0 30

Internal Marks:
Practical::
Credits: 3 External Marks: 70
Prerequisites: Data Structures
Course Objectives:
The main objectives of the course is to make student
 Provide knowledge on advance data structures frequently used in Computer Science domain
 Develop skills in algorithm design techniques popularly used
 Understand the use of various data structures in the algorithm design

Course Outcomes
Upon successful completion of the course, the student will be able to:
CO1 Implement AVL Trees and B Trees for efficient data storage and retrieval, L3
including operations such as insertion and deletion. (Apply)
CO2 Apply Divide and Conquer strategies to solve problems including Quick Sort, L3
Merge Sort, Strassen’s matrix multiplication, and Convex Hull computation.
(Apply)
CO3 Utilize Dynamic Programming techniques to solve problems(Apply) L3
CO4 Apply Backtracking and Branch and Bound techniques to solve optimization L3
problems (Apply)
CO5 Analyze and recognize NP Hard Graph Problems such as Clique Decision L4
Problem, Chromatic Number Decision Problem, and Traveling Salesperson
Decision Problem. (Analyze)

Contribution of Course Outcomes towards achievement of Program Outcomes &Strength of

correlations(3:Substantial,2:Moderate,1:Slight)
PO1 PO PO PO PO PO PO PO PO PO PO1 PO1 PS PS PSO3
2 3 4 5 6 7 8 9 10 1 2 O1 O2
CO1 3 2 - 2 3 - - - - - - - 2 3 -
CO2 3 - 3 - 2 - - - - - - - 2 - 2
CO3 - - 2 - - - - - - 2 - 3 3 3 -
CO4 3 3 3 2 3 - - - - - - - 2 3 2
CO5 3 3 2 2 2 - - - - - - 3 3 - -

Syllabus
Unit No. Map
CONTENTS ped
CO
 UNIT – I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic
Notations.AVL Trees – Creation, Insertion, Deletion operations and Applications
I B-Trees – Creation, Insertion, Deletion operations and Applications CO1

UNIT – II:
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications
II Graphs – Terminology, Representations, Basic Search and Traversals, Connected CO2
Components and Biconnected Components, applications
Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s matrix
multiplication, Convex Hull
UNIT – III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem,
III Minimum cost spanning trees, Single Source Shortest Paths CO3
Dynamic Programming: General Method, All pairs shortest paths, Single Source
Shortest Paths– General Weights (Bellman Ford Algorithm), Optimal Binary Search
Trees, 0/1 Knapsack, String Editing, Travelling Salesperson problem
UNIT – IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph
Coloring, 0/1 Knapsack Problem
IV Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling CO4
Salesperson problem
UNIT – V:
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem CO5
V NP Hard Graph Problems: Clique Decision Problem (CDP), Chromatic Number
Decision Problem (CNDP), Traveling Salesperson Decision Problem (TSP)
NP Hard Scheduling Problems: Scheduling Identical Processors, Job Shop Scheduling

Learning Resources
TextBooks
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh, 2 ndEdition
Universities Press
2. Computer Algorithms in C++, Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, 2 nd Edition
University Press
Reference Books
1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
2. An introduction to Data Structures with applications, Trembley& Sorenson, McGraw Hill
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth, Addison-
Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein&Tanenbaum, Pearson, 1995
 5. Algorithms + Data Structures & Programs:, N.Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni& Mehta, Galgottia Pub.
7. Data structures in Java:, Thomas Standish, Pearson Education Asia
E-Resources &other digital material
Online Learning Resources:
 https://www.tutorialspoint.com/advanced_data_structures/index.asp
 http://peterindia.net/Algorithms.html
 Course Code- Digital Logic &Computer Organization

Lecture – Tutorial- 3-0-0 30

Internal Marks:
Practical::
Credits: 3 External Marks: 70
Prerequisites: Engineering Mathematics, BEEE
Course Objectives:
 Provide students with a comprehensive understanding of digital logic design principles and
computer organization fundamentals
 Describe memory hierarchy concepts
 Explain input/output (I/O) systems and their interaction with the CPU, memory, and peripheral
devices
Course Outcomes: BTL LEVEL
Upon successful completion of the course, the student will be able to:
CO1 Describe the representation of data using binary, octal, and hexadecimal
numbering systems. (Understanding) L2
CO2 Apply logic gates and universal logic gates to design and analyze combinational
circuits. (Applying) L3
CO3 Analyze the operation and design of sequential circuits using flip-flops and
registers. (Analyzing) L4
CO4 Evaluate the performance and design considerations of fast adders and
multipliers in computer arithmetic. (Evaluating) L5
CO5 Assess the characteristics and functionalities of different types of memory
systems, including cache memories and virtual memories. (Analyzing) L4
CO6 Demonstrate proficiency in accessing and managing I/O devices, interrupts, and
standard I/O interfaces in computer systems. (Applying) L3

Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2- Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O 2 O3
CO1
3 2 1 - 1 - - - - - - - 2 - 2
CO2 3 3 2 - 2 - - - - - - - 3 - -
CO3 3 3 3 - 2 - - - - - - - 3 - -
CO4 3 3 2 1 3 - - - - - - - 3 2 -
CO5 3 3 2 2 3 - 2 - - - - - 2 - -
CO6 3 3 2 1 2 1 - - - 2 - - 2 - 2

Syllabus
Unit Mapped
No Contents CO
 UNIT – I:
Data Representation: Binary Numbers,Fixed Point Representation.Floating Point
Representation. Number base conversions, Octal and Hexadecimal Numbers,
components, Signed binary numbers, Binary codes
Digital Logic Circuits-I: Basic Logic Functions, Logic gates, universal logic
I CO1,C
gates, Minimization of Logic expressions. K-Map Simplification, Combinational
O2
Circuits, Decoders, Multiplexers
UNIT – II:
Digital Logic Circuits-II: Sequential Circuits, Flip-Flops, Binary counters,
Registers, Shift Registers, Ripple counters
Basic Structure of Computers:Computer Types, Functional units, Basic
II CO3
operational concepts, Bus structures, Software, Performance, multiprocessors and
multi computers, Computer Generations,Von- Neumann Architecture
UNIT – III:
Computer Arithmetic : Addition and Subtraction of Signed Numbers, Design of
Fast Adders, Multiplication of Positive Numbers, Signed-operand Multiplication,
Fast Multiplication, Integer Division, Floating-Point Numbers and Operations
Processor Organization: Fundamental Concepts, Execution of a Complete
Instruction, Multiple-Bus Organization, Hardwired Control and Multi programmed
III Control CO4
UNIT – IV:
The Memory Organization: Basic Concepts, Semiconductor RAM Memories,
Read-Only Memories, Speed, Size and Cost, Cache Memories, Performance
IV Considerations, Virtual Memories, Memory Management Requirements, Secondary CO5
Storage
UNIT – V:
Input/Output Organization: Accessing I/O Devices, Interrupts, Processor
Examples, Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces
V CO6
Textbooks:
Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 6th edition, McGraw Hill
Digital Design, 6th Edition, M. Morris Mano, Pearson Education.
Computer Organization and Architecture, William Stallings, 11thEdition, Pearson.
Reference Books:
Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson
Computer Organization and Design, David A. Paterson, John L.Hennessy, Elsevier
Fundamentals of Logic Design, Roth, 5thEdition, Thomson
Online Learning Resources:
1. https://nptel.ac.in/courses/117105080
2. https://archive.nptel.ac.in/courses/106/105/106105163/
3. https://nptel.ac.in/courses/106/103/106103068/
 Machine Learning Lab
Course Objectives:
 To learn about computing central tendency measures and Data preprocessing techniques
 To learn about classification and regression algorithms
 To apply different clustering algorithms for a problem.

Software Required: Python/R

Course Outcomes (CO)

Upon successful completion of the Machine Learning Lab course, students will be able to:
1. CO1: Compute central tendency measures and measures of dispersion for a given dataset.
2. CO2: Apply various data preprocessing techniques such as attribute selection, handling missing
values, discretization, and elimination of outliers.
3. CO3: Implement and evaluate the performance of K-Nearest Neighbors (KNN) algorithm for
classification and regression problems.
4. CO4: Utilize decision tree algorithms for classification and regression, including parameter
tuning for optimized results.
5. CO5: Apply Random Forest algorithm for both classification and regression tasks.
6. CO6: Implement Naïve Bayes Classification algorithm and evaluate its performance.
Contribution of Course Outcomes (CO) towards Program Outcomes (PO)

Course
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Outco
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
mes
CO1 3 2 2 2
CO2 2 2 2 2
CO3 3 2 2 2
CO4 3 2 2 2 2
CO5 2 3 2 2
CO6 2 2 2 2

List of Experiments :

1. Compute Central Tendency Measures: Mean, Median, Mode Measure of Dispersion: Variance,
Standard Deviation.
2. Apply the following Pre-processing techniques for a given dataset.
a. Attribute selection
b. Handling Missing Values
c. Discretization
d. Elimination of Outliers
3. Apply KNN algorithm for classification and regression
4. Demonstrate decision tree algorithm for a classification problem and perform parameter tuning
for better results
5. Demonstrate decision tree algorithm for a regression problem
6. Apply Random Forest algorithm for classification and regression
7. Demonstrate Naïve Bayes Classification algorithm.
8. Apply Support Vector algorithm for classification
9. Demonstrate simple linear regression algorithm for a regression problem
10. Apply Logistic regression algorithm for a classification problem
11. Implement the K-means algorithm and apply it to the data you selected. Evaluate performance by
measuring the sum of the Euclidean distance of each example from its class center. Test the
performance of the algorithm as a function of the parameters K.
13. Demonstrate the use of Fuzzy C-Means Clustering
14. Demonstrate the use of Expectation Maximization based clustering algorithm
15. Demonstrate Q-learning algorithm
 Course Code- ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS LAB

Lecture – Tutorial- 0-0-3 30

Internal Marks:
Practical::
Credits: 1.5 External Marks: 70
Prerequisites: Data Structures through C / Object Oriented Programming
Course Objectives:
The objectives of the course is to
 acquire practical skills in constructing and managing Data structures
 apply the popular algorithm design methods in problem-solving scenarios

COURSE OUTCOMES
Upon successful completion of the course, Student will be able to

CO1 Implement programs as an individual on different IDEs/ online platforms. L3

CO2 Apply different design techniques for solving problems. L3

CO3 Develop an effective report based on various programs implemented. L3

Apply technical knowledge for a given problem and express with an effective oral
CO4 L3
communication.

CO5 Analyze outputs using given constraints/test cases. L4

Contribution of Course Outcomes towards achievement of Program Outcomes & Strength of correlations
(3:Substantial, 2: Moderate, 1:Slight)
PSO PSO PS
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 O3
1 2
2
CO1 3 2 2

CO2 2 2 2 2

CO3 2 2 2

CO4 2 3 2 2

CO5 3 2 2
 2
Unit Mapped CO
SYLLABUS CONTENTS
No.
a) Implement AVL Trees and its operations.
1 CO1, CO2, CO3, CO4, CO5
b) Develop a solution to the given problem using AVL Trees.
2 a) Implement B- Trees and its operations. CO1, CO2, CO3, CO4, CO5
b) Develop a solution to the given problem using B- Trees.
a) Implement Binary Heap and its operations.
3 CO1, CO2, CO3, CO4, CO5
b) Develop a solution to the given problem using Binary Heaps.
4 a) Implement Graph and its operations. CO1, CO2, CO3, CO4, CO5
b) Develop a solution to the given problem using Graphs.
5 Develop and implement an algorithm using Divide and Conquer CO1, CO2, CO3, CO4, CO5
strategy for a given set of problems.
6 Make use of Greedy method to implement a solution for a given CO1, CO2, CO3, CO4, CO5
problem.
7 Develop and implement an efficient solution using Dynamic CO1, CO2, CO3, CO4, CO5
Programming.
8 Use Backtracking design technique to implement a solution for CO1, CO2, CO3, CO4, CO5
a given problem.
9 Develop and implement an algorithm using Branch and Bound CO1, CO2, CO3, CO4, CO5
technique for solving a given problem.
Case Study-1: CO1, CO2, CO3, CO4, CO5
10 Apply the most appropriate design technique to develop and
implement an efficient solution for a given problem.
Case Study-2: CO1, CO2, CO3, CO4, CO5
11 Develop and implement an optimal solution for a given
problem by applying a suitable design technique.

Learning Resources
Text Books
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh, 2 ndEdition
Universities Press
2. Computer Algorithms in C++, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, 2 nd Edition
University Press
References Text Book
1. Introduction to the Design & Analysis of Algorithms, Anany Levitin, Third Edition, 2011, Pearson Education.
2. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2002, Pearson.
3. Algorithm Design Techniques, Narasimha Karumanchi, CareerMonk Publications, 2018.

e-Resources and other Digital Material

1. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
2. http://littlesvr.ca/dsa-html5-animations/sorting.php
3. https://www.youtube.com/watch?v=AfYqN3fGapc
 Course Code- FULL STACK DEVELOPMENT – 1(SKILL ENHANCEMENT COURSE)

Lecture – Tutorial- 0-1-2 30

Internal Marks:
Practical::
Credits: 2 External Marks: 70
Prerequisites: NIL
Course Objectives:
The main objectives of the course are to
 Make use of HTML elements and their attributes for designing static web pages
 Build a web page by applying appropriate CSS styles to HTML elements
 Experiment with JavaScript to develop dynamic web pages and validate forms
Course Outcomes:
Upon successful completion of the course, the student will be able to:
CO1 Students are able to develop a dynamic webpage by the use of java script
CO2 Understand the basics of full stack web development
CO3 Develop responsive web pages using HTML and CSS
CO4 Implement client-side scripting using JavaScript
Contribution of Course Outcomes towards the achievement of Program Outcomes (1 – Low, 2-
Medium, 3 – High)
PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
1 2 3 4 5 6 7 8 9 10 11 12 O1 O O3
2
CO1
3 2 - - - - - - - - - - 2 - -
CO2 3 - 3 - 2 - - - - - - - 2 - 2
CO3 3 2 2 - 3 - - - - 2 - 3 2 3 -
CO4 3 3 3 2 3 - - - - - - - 2 3 2

Experiments covering the Topics:

 Lists, Links and Images
 HTML Tables, Forms and Frames
 HTML 5 and Cascading Style Sheets, Types of CSS
 Selector forms
 CSS with Color, Background, Font, Text and CSS Box Model
 Applying JavaScript - internal and external, I/O, Type Conversion
 JavaScript Conditional Statements and Loops, Pre-defined and User-defined Objects
 JavaScript Functions and Events
 Node.js

Experiments:

1. Lists, Links and Images

a. Write a HTML program, to explain the working of lists.
Note: It should have an ordered list, unordered list, nested lists and ordered list in an unordered list
and definition lists.
b. Write a HTML program, to explain the working of hyperlinks using <a> tag and href, target
Attributes.
c. Create a HTML document that has your image and your friend’s image with a specific height and
width. Also when clicked on the images it should navigate to their respective profiles.
d. Write a HTML program, in such a way that, rather than placing large images on a page, the preferred
technique is to use thumbnails by setting the height and width parameters to something like to
100*100 pixels. Each thumbnail image is also a link to a full sized version of the image. Create an
image gallery using this technique

2. HTML Tables, Forms and Frames

a. Write a HTML program, to explain the working of tables. (use tags: <table>, <tr>, <th>, <td> and
attributes: border, rowspan, colspan)
b. Write a HTML program, to explain the working of tables by preparing a timetable. (Note: Use
<caption> tag to set the caption to the table & also use cell spacing, cell padding, border, rowspan,
colspan etc.).
c. Write a HTML program, to explain the working of forms by designing Registration form. (Note:
Include text field, password field, number field, date of birth field, checkboxes, radio buttons, list
boxes using <select>&<option> tags, <text area> and two buttons ie: submit and reset. Use tables
to provide a better view).
d. Write a HTML program, to explain the working of frames, such that page is to be divided into 3
parts on either direction. (Note: first frame  image, second frame  paragraph, third frame 
hyperlink. And also make sure of using “no frame” attribute such that frames to be fixed).

3. HTML 5 and Cascading Style Sheets, Types of CSS

a. Write a HTML program, that makes use of <article>, <aside>, <figure>, <figcaption>, <footer>,
<header>, <main>, <nav>, <section>, <div>, <span> tags.
b. Write a HTML program, to embed audio and video into HTML web page.
c. Write a program to apply different types (or levels of styles or style specification formats) - inline,
internal, external styles to HTML elements. (identify selector, property and value).

4. Selector forms
a. Write a program to apply different types of selector forms
i. Simple selector (element, id, class, group, universal)
ii. Combinator selector (descendant, child, adjacent sibling, general sibling)
iii. Pseudo-class selector
iv. Pseudo-element selector
v. Attribute selector
5. CSS with Color, Background, Font, Text and CSS Box Model
a. Write a program to demonstrate the various ways you can reference a color in CSS.
b. Write a CSS rule that places a background image halfway down the page, tilting it horizontally. The
image should remain in place when the user scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation vi. text-alignment
d. Write a program, to explain the importance of CSS Box model using
i. Content ii. Border iii. Margin iv. padding

6. Applying JavaScript - internal and external, I/O, Type Conversion

a. Write a program to embed internal and external JavaScript in a web page.
b. Write a program to explain the different ways for displaying output.
c. Write a program to explain the different ways for taking input.
d. Create a webpage which uses prompt dialogue box to ask a voter for his name and age. Display the
information in table format along with either the voter can vote or not

7. Java Script Pre-defined and User-defined Objects

a. Write a program using document object properties and methods.
b. Write a program using window object properties and methods.
c. Write a program using array object properties and methods.
d. Write a program using math object properties and methods.
e. Write a program using string object properties and methods.
f. Write a program using regex object properties and methods.
g. Write a program using date object properties and methods.
h. Write a program to explain user-defined object by using properties, methods, accessors, constructors
and display.

8. Java Script Conditional Statements and Loops

a. Write a program which asks the user to enter three integers, obtains the numbers from the user and
outputs HTML text that displays the larger number followed by the words “LARGER NUMBER”
in an information message dialog. If the numbers are equal, output HTML text as “EQUAL
NUMBERS”.
b. Write a program to display week days using switch case.
c. Write a program to print 1 to 10 numbers using for, while and do-while loops.
d. Write aprogram to print data in object using for-in, for-each and for-of loops
e. Develop a program to determine whether a given number is an ‘ARMSTRONG NUMBER’ or not.
[Eg: 153 is an Armstrong number, since sum of the cube of the digits is equal to the number i.e.,13
+ 53+ 33 = 153]
f. Write a program to display the denomination of the amount deposited in the bank in terms of 100’s,
50’s, 20’s, 10’s, 5’s, 2’s & 1’s. (Eg: If deposited amount is Rs.163, the output should be 1-100’s, 1-
50’s, 1- 10’s, 1-2’s & 1-1’s)

9. Java Script Functions and Events

a. Design a appropriate function should be called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Is it palindrome or not
b. Design a HTML having a text box and four buttons named Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate function should be called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Is it palindrome or not
c. Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and the length should not be less
than 6 characters)
ii. Mobile (only numbers and length 10 digits)
iii. E-mail (should contain format like [email protected])

Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2. Web Programming with HTML5, CSS and JavaScript, John Dean, Jones & Bartlett Learning,
2019 (Chapters 1-11).
3. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React, and Node,
Vasan Subramanian, 2nd edition, APress, O’Reilly.

Web Links:

1. https://www.w3schools.com/html
2. https://www.w3schools.com/css
3. https://www.w3schools.com/js/
4. https://www.w3schools.com/nodejs
 DESIGN THINKING & INNOVATION
Lecture – Tutorial- 1-0-2 30
Internal Marks:
Practical::
Credits: 2 External Marks: 70
Prerequisites: NIL
Course Objectives:
The main objectives of the course are to
 Understand the principles of design thinking and innovation.
 Develop skills to identify, define, and solve complex problems creatively.
 Learn to use design thinking tools and methodologies.
 Gain hands-on experience through lab experiments and projects.
 Foster teamwork, collaboration, and effective communication.

Course outcomes: At the end of the course, the student will be able to:

CO Statement BTL Units

CO1 Define the concepts related to design thinking. L1 1

CO2 Explain the fundamentals of Design Thinking and innovation. L2 2,3
Apply the design thinking techniques for solving problems in various
CO3 L3 3,4
sectors.
CO4 Analyze to work in a multidisciplinary environment. L4 4,5
CO5 Evaluate the value of creativity. L5 5

Contribution of Course outcomes towards achievement of programme outcomes & Strength of

correlations (High:3, Medium: 2, Low:1)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 - 2 2 - 2 - 2 3 2 - 2 3 -
CO2 3 - 2 2 - 2 - 2 3 2 - 2 3 -
CO3 3 - 2 2 - 2 - 2 3 2 - 2 3 -
CO4 3 - 2 2 - 2 - 2 3 2 - 2 3 -
CO5 3 - 2 2 - 2 - 2 3 2 - 2 3 -
Unit Mapped
Lecture Topic Lab Cycle (Experiment)
Number CO
Unit 1: Introduction to Design Thinking
Lab 1: Introduction to the Design Thinking CO1
Overview of Design Thinking
Toolkit
The Design Thinking Process:
1 Experiment: Use of personas, empathy
Empathize, Define, Ideate,
maps, and customer journey maps to
Prototype, Test
understand user experiences.
 Lab 2: Conducting User Interviews CO1
Techniques for User Research, Experiment: Plan and conduct interviews
1
Importance of Empathy in Design with potential users to understand their
needs and challenges.
Unit 2: Problem Definition
How to Synthesize Research Lab 3: Crafting Problem Statements CO2
2 Findings Experiment: Analyze user research data
Creating Problem Statements and create clear problem statements.
Brainstorming and Other Ideation Lab 4: Ideation Session CO2
Techniques Experiment: Conduct a brainstorming
2
Encouraging Creativity and session to generate a wide range of ideas to
Divergent Thinking solve the defined problem.
Unit 3: Prototyping
Lab 5: Creating Low-fidelity Prototypes CO2,CO3
Principles of Prototyping
Experiment: Build simple prototypes using
3 Types of Prototypes: Low-fidelity
materials like paper, cardboard, and digital
vs High-fidelity
tools.
Importance of Testing Prototypes Lab 6: User Testing CO2,
3 Gathering and Analyzing Experiment: Test prototypes with users CO3
Feedback and gather feedback to refine ideas.
Unit 4: Iteration and Refinement
Lab 7: Prototype Iteration CO3,
The Iterative Design Process
4 Experiment: Refine and improve CO4
Integrating Feedback into Design
prototypes based on user feedback.
The Role of Storytelling in CO3,
Lab 8: Preparing for Final Presentation
Design CO4
4 Experiment: Develop a narrative and
Effective Presentation
prepare a presentation for the final project.
Techniques
Unit 5: Final Project Development and Presentation
Lab 9: Final Project Development CO5
Guidance and Tips for the Final
5 Experiment: Continue working on the final
Project
project, with instructor guidance.
Lab 10: Final Presentations CO5
5 Course Review and Q&A Experiment: Present final projects to the
class and receive feedback.
Objective: Develop an innovative solution CO5
to a real-world problem using design
thinking methodologies.
5 Final Project
Components: Research, problem
definition, ideation, prototyping, testing,
and final presentation.
Learning Resources
Text Book(s):
 1. Tim Brown, Change by design, 1/e, Harper Bollins, 2009.
2. Idris Mootee, Design Thinking for Strategic Innovation, 1/e, Adams Media, 2014
References:
1. David Lee, Design Thinking in the Classroom, Ulysses press, 2018.
2. Shrrutin N Shetty, Design the Future, 1/e, Norton Press, 2018.
3. William lidwell, Kritinaholden, & Jill butter, Universal principles of design, 2/e,
Rockport Publishers, 2010.
4. Chesbrough.H, The era of open innovation, 2003.
E Resources:
 https://nptel.ac.in/courses/110/106/110106124/
 https://nptel.ac.in/courses/109/104/109104109/
 https://swayam.gov.in/nd1_noc19_mg60/preview
 https://onlinecourses.nptel.ac.in/noc22_de16/preview