0% found this document useful (0 votes)
19 views47 pages

CSE VR23 II.B.tech Syllabus

The document outlines the course structure for the B.Tech. program in Computer Sciences and Engineering for the academic year 2023-24, detailing the subjects, credits, and course codes for the II Year I and II Semesters. It includes specific course objectives and outcomes for key subjects such as Mathematical Foundations of Computer Science and Universal Human Values. Additionally, it provides an overview of the curriculum, including lectures, tutorials, and recommended readings.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views47 pages

CSE VR23 II.B.tech Syllabus

The document outlines the course structure for the B.Tech. program in Computer Sciences and Engineering for the academic year 2023-24, detailing the subjects, credits, and course codes for the II Year I and II Semesters. It includes specific course objectives and outcomes for key subjects such as Mathematical Foundations of Computer Science and Universal Human Values. Additionally, it provides an overview of the curriculum, including lectures, tutorials, and recommended readings.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 47

Department of Computer Sciences and Engineering

COURSE STRUCTURE
(Applicable from the academic year 2023-24 onwards)

B.Tech.– II Year I Semester


S.No Codes course L T P Credits
Mathematical Foundations of Computer 3 0 0 3
1 1000232104 Science
1099232101 Universal Human Values– Understanding 2 1 0 3
2 Harmony & Human Ethical Conduct
3 1004232104 Digital Logic & Computer Organization 3 0 0 3
4 1005232101 Software Engineering 3 0 0 3
5 1005232102 Object Oriented Programming Through 3 0 0 3
6 1005232110 CASE Tools Lab 0 0 3 1.5
Object Oriented Programming Through Java 0 0 3 1.5
7 1005232111 Lab
8 1005232180 Python Programming 0 1 2 2
9 1000232125 Environmental Science 2 0 0 -
Total 16 2 8 20

B.Tech.– II Year II Semester

S.No Category Title L T P Credits


Managerial Economics and Financial 2 0 0 2
1 1099232201
Analysis
2 1000232202 Probability & Statistics 3 0 0 3
3 1005232201 Operating Systems 3 0 0 3
4 1005232202 Database Management Systems 3 0 0 3
5 1005232203 Formal Languages and Automata Theory 3 0 0 3
6 1005232210 Operating Systems Lab 0 0 3 1.5
7 1005232211 Database Management Systems Lab 0 0 3 1.5
8 1005232280 Full Stack Development–I 0 1 2 2
9 1002232220 Design Thinking &Innovation 1 0 2 2
Total 14 2 10 21
Mandatory Community Service Project Internship of 08weeks duration during summer vacation
II Year I Semester Mathematical Foundations of Computer L T P C
Course Code: Science 3 0 0 3
1000232104

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE


Course Objectives:

 Introduce the students to the topics and techniques of discrete methods and combinatorial
reasoning.
 Introduce a wide variety of applications. The algorithmic approach to the solution of problems
is fundamental in discrete mathematics, and this approach reinforces the closeties between this
discipline and the area of computer science.

Course Outcomes:

 Apply principles of mathematical logic to statement calculus and Predicate calculus (K3)
 Discuss various types of relations, functions ,Lattice and algebraic structures (K2)
 To expose the students to Binary relations, posets, Hasse diagram, lattice, and discuss various
properties of relations (K3)
 Solve the recurrence relations by Method of substitution, characteristic roots, Generating
functions (K3)
 Able to model and solve the real world problems using Graph theory (K4)

Unit-I:
Mathematical Logic
Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas, Truth
Tables, Tautologies, and Equivalence of Formulas, Duality Law, Tautological Implications, and
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises and Indirect
Method of Proof.
Predicate Calculus: Predicative Logic, Statement Functions, Variables and Quantifiers, Free and
Bound Variables, Inference Theory for Predicate Calculus.

Unit-II:
Functions & Relations
Set Theory: Introduction, Operations on Binary Sets, Principle of Inclusion and Exclusion,
Relations: Properties of Binary Relations, Relation Matrix and Digraph, Operations on Relations,
Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering
Relations, Hasse Diagrams,
Functions: Bijective Functions, Composition of Functions, Inverse Functions, Permutation
Functions, Recursive Functions, Lattice and its Properties

Unit-III:
Algebraic Structures and Number Theory
Algebraic Structures:Algebraic Systems, Examples, General Properties, Semi Groups and
Monoids, Homomorphism of Semi Groups and Monoids, Group, Subgroup, Abelian Group,
Homomorphism, Isomorphism
Number Theory:Properties of Integers, Division Theorem, The Greatest Common Divisor,
Euclidean Algorithm, Least Common Multiple, Testing for Prime Numbers, The Fundamental
Theorem of Arithmetic, Modular Arithmetic (Fermat’s Theorem and Euler’s Theorem)

Unit-IV:
Recurrence Relations
Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of
Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving
Recurrence Relations by Substitution and Generating Functions, Method of Characteristic Roots,
Solving Inhomogeneous Recurrence Relations

Unit-V:
Graph Theory
Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs: Adjacency Matrices,
Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian Graphs,
Multigraphs, Planar Graphs, Euler’s Formula, Graph Colouring and Covering, Chromatic Number,
Spanning Trees, Algorithms for Spanning Trees (Problems Only and Theorems without Proofs)

Text Books:

1. J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to C Sc,


Tata McGraw Hill,1997
2. C. L. Liuand ,Elements of Discrete Mathematics-A Computer Oriented Approach

Reference Books:

1. Kenneth. H. Rosen, Discrete Mathematics and its Applications, 6/e, Tata McGraw-Hill, 2009.
2. Discrete Mathematics for Computer Scientists and Mathematicians, J.L.Mott,A. Kandel, T. P.
Baker, 2ndEdition, Prentice Hall of India.
3. Dr. D S Chandrasekharaiah, Mathematical Foundations of Computer Science, Prism Book Pvt Ltd.
4. S. K. Chakraborthy and B.K. Sarkar ,Discrete Mathematics, Oxford,2011
II Year I Semester L T P C
Universal Human Values – Understanding Harmony
Course Code: & Ethical Human Conduct 2 1 0 3
1099232101

UNIVERSAL HUMAN VALUES – UNDERSTANDING HARMONY AND


ETHICAL HUMAN CONDUCT
Course Objectives:

 To develop a holistic perspective based on self exploration and value education.


 To understand method to fulfill human aspiration. .
 To understand harmony in human being, family and society.
 To understand harmony in nature and its existence.
 To understand holistic understanding of harmony on professional ethics.

Course Outcomes:

 Describe the Value Education


 Illustrate Understanding the activities in the Self and the activities in the Body.
 Discuss Harmony in Nature: The Four Orders in Nature.
 Demonstrate Defects in Ethical Human Conduct.
 Generalize Competence in Professional Ethics.

Course Topics
The course has 28 lectures and 14 tutorials in 5 modules. The lectures and tutorials are of 1-
hour duration. Tutorial sessions are to be used to explore and practice what has been
proposed during the lecture sessions.
The Teacher’s Manual provides the outline for lectures as well as practice sessions. The
teacher is expected to present the issues to be discussed as propositions and encourage the
students to have a dialogue.

UNIT I
Introduction to Value Education (6 lectures and 3 tutorials for practice session)
Lecture 1: Right Understanding, Relationship and Physical Facility (Holistic Development and
the Role of Education)
Lecture 2: Understanding Value Education
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: self-exploration as the Process for Value Education
Lecture4: Continuous Happiness and Prosperity – the Basic Human Aspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfill the Basic Human Aspirations
Tutorial 3: Practice Session PS3 Exploring Natural Acceptance

UNIT II
Harmony in the Human Being (6 lectures and 3 tutorials for practice session)
Lecture 7: Understanding Human being as the Co-existence of the self and the body.
Lecture 8: Distinguishing between the Needs of the self and the body

Tutorial 4: Practice Session PS4 Exploring the difference of Needs of self and body.
Lecture 9: The body as an Instrument of the self
Lecture 10: Understanding Harmony in the self
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the self
Lecture 11: Harmony of the self with the body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 Exploring Harmony of self with the body

UNIT III

Harmony in the Family and Society (6 lectures and 3 tutorials for practice session)
Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship

Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust


Lecture 15: 'Respect' – as the Right Evaluation

Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect


Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 Exploring Systems to fulfil Human Goal
UNIT IV
Harmony in the Nature/Existence (4 lectures and 2 tutorials for practice session)
Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among
the Four Orders of Nature

Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 Exploring Co-existence in Existence.

UNIT V
Implications of the Holistic Understanding – a Look at Professional Ethics (6 lectures and
3 tutorials for practice session)
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial 12: Practice Session PS12 Exploring Ethical Human Conduct
Lecture 25: A Basis for Humanistic Education, Humanistic Constitution and Universal Human
Order
Lecture 26: Competence in Professional Ethics
Tutorial 13: Practice Session PS13 Exploring Humanistic Models in Education

Lecture 27: Holistic Technologies, Production Systems and Management Models-Typical Case
Studies
Lecture 28: Strategies for Transition towards Value-based Life and Profession

Tutorial 14: Practice Session PS14 Exploring Steps of Transition towards Universal Human
Order

Practice Sessions for


UNIT I – Introduction to Value Education
PS1 Sharing about Oneself

PS2 Exploring Human Consciousness


PS3 Exploring Natural Acceptance
Practice Sessions for UNIT II – Harmony in the Human Being
PS4 Exploring the difference of Needs of self and body
PS5 Exploring Sources of Imagination in the self
PS6 Exploring Harmony of self with the body

Practice Sessions for UNIT III – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust
PS8 Exploring the Feeling of Respect
PS9 Exploring Systems to fulfil Human Goal

Practice Sessions for UNIT IV – Harmony in the Nature (Existence)


PS10 Exploring the Four Orders of Nature
PS11 Exploring Co-existence in Existence

Practice Sessions for UNIT V – Implications of the Holistic Understanding – a Look at


Professional Ethics
PS12 Exploring Ethical Human Conduct
PS13 Exploring Humanistic Models in Education
PS14 Exploring Steps of Transition towards Universal Human Order

Readings:
Textbook and Teachers Manual
a. The Textbook
R R Gaur, R Asthana, G P Bagaria, A Foundation Course in Human Values and Professional
Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-1
b. The Teacher’s Manual
R R Gaur, R Asthana, G P Bagaria,Teachers’ Manual for A Foundation Course in Human
Values and Professional Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN
978-93-87034-53-2

Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.

3. The Story of Stuff (Book).


4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.

6. Slow is Beautiful - Cecile Andrews


7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal

9. Rediscovering India - by Dharampal


10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)

Mode of Conduct:
Lecture hours are to be used for interactive discussion, placing the proposals about the topics
at hand and motivating students to reflect, explore and verify them.

Tutorial hours are to be used for practice sessions.


While analyzing and discussing the topic, the faculty mentor’s role is in pointing to essential
elements to help in sorting them out from the surface elements. In other words, help the students
explore the important or critical elements.
In the discussions, particularly during practice sessions (tutorials), the mentor encourages the
student to connect with one’s own self and do self-observation, self-reflection and self-
exploration.
Scenarios may be used to initiate discussion. The student is encouraged to take up ”ordinary”
situations rather than” extra-ordinary” situations. Such observations and their analyses are
shared and discussed with other students and faculty mentor, in a group sitting.
Tutorials (experiments or practical) are important for the course. The difference is that the
laboratory is everyday life, and practical are how you behave and work in real life. Depending
on the nature of topics, worksheets, home assignment and/or activity are included. The practice
sessions (tutorials) would also provide support to a student in performing actions
commensurate to his/her beliefs. It is intended that this would lead to development of
commitment, namely behaving and working based on basic human values.

It is recommended that this content be placed before the student as it is, in the form of a basic
foundation course, without including anything else or excluding any part of this content.
Additional content may be offered in separate, higher courses. This course is to be taught by
faculty from every teaching department, not exclusively by any one department.
Teacher preparation with a minimum exposure to at least one 8-day Faculty Development
Program on Universal Human Values is deemed essential.
Online Resources:
1. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201-
Introduction%20to%20Value%20Education.pdf

2. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202-
Harmony%20in%20the%20Human%20Being.pdf

3. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203-
Harmony%20in%20the%20Family.pdf

4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf

5. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205-
Harmony%20in%20the%20Nature%20and%20Existence.pdf

6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days%20FDP-
SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3-
S2A%20Und%20Nature-Existence.pdf

7. https://fdp-si.aicte-
india.org/UHV%20II%20Teaching%20Material/UHV%20II%20Lecture%2023-
25%20Ethics%20v1.pdf

8. https://www.studocu.com/in/document/kiet-group-of-institutions/universal-human-
values/chapter-5-holistic-understanding-of-harmony-on-professional-ethics/62490385

9. https://onlinecourses.swayam2.ac.in/aic22_ge23/preview
II Year I Semester L T P C
Course Code: Digital Logic & Computer Organization 3 0 0 3
1004232104

DIGITAL LOGIC & COMPUTER ORGANIZATION


Course Objectives:
The main objectives of the course is to
 To learn fundamental concepts of Number representation and Conversion and Boolean
Algebra.
 Designing of different types of Sequential logic circuits.
 Discuss about the Components in computer.
 To Analyze Arithmetic operation of computers and processor organization.
 Study the Different units in computer organization.

Course Outcomes:
After completion of the course, students will be able to
 Analyze the Digital Circuit using basic Boolean algebra.
 Designing of Registers and counters using flipflops and Describe the concepts of
computers and processors.
 Design different Digital circuits using arithmetic operations in computers.
 Explain the organization of Memory by using Register concepts.
 Explain about the Input and output access in Computer Organization.

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 gates,
Minimization of Logic expressions. K-Map Simplification, Combinational 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 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 Control
UNIT – IV:
The Memory Organization: Basic Concepts, Semiconductor RAM Memories, Read-Only
Memories, Speed, Size and Cost, Cache Memories, Performance Considerations, Virtual
Memories, Memory Management Requirements, Secondary Storage

UNIT – V:
Input/Output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct
Memory Access, Buses, Interface Circuits, Standard I/O Interfaces

Textbooks:
1. Digital Logic Design, 6th Edition, M. Morris Mano, Pearson Education.
2. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson
3. Computer Organization and Architecture, William Stallings, 11thEdition, Pearson.

Reference Books:
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 6th
edition, McGraw Hill
2. Computer Organization and Design, David A. Paterson, John L. Hennessy, Elsevier
3. Fundamentals of Logic Design, Roth, 5thEdition, Thomson

Online Learning Resources:


1. https://nptel.ac.in/courses/106/103/106103068/
II Year I Semester L T P C
Course Code: 3 0 0 3
1005232101
Software Engineering

SOFTWARE ENGINEERING

Course Objectives:
The objectives of this course are to introduce
 Software life cycle models, Software requirements and SRS document.
 Project Planning, quality control and ensuring good quality software.

Course Outcomes:
After completion of the course, students will be able to
 Explain the significance of software engineering in various software development
models to different types of projects (K2)
 Identify the complexities involved in managing the software projects, project
estimation and Risk management techniques, formal specification techniques and
prepare a comprehensive SRS document to the software requirements. (K3)
 Apply a high quality software system by using software design methodologies, agile
process and user interfaces that meet user needs and enhance usability. (K3)
 Apply various testing techniques to ensure software quality , software reliability to the
software quality management systems and standards (K3)
 Discuss the scope and capabilities of CASE tools, software maintenance projects ,
maintenance costs and apply reverse engineering techniques for reusing the software
strategies at the organizational level.(K2)

UNIT I:
Introduction: Evolution, Software development projects, Exploratory style of software
developments, Emergence of software engineering, Notable changes in software development
practices, Computer system engineering.
Software Life Cycle Models: Basic concepts, Waterfall model and its extensions, Rapid
application development, Agile development model, Spiral model.

UNIT II:
Software Project Management: Software project management complexities, Responsibilities
of a software project manager, Metrics for project size estimation, Project estimation
techniques, Empirical Estimation techniques, COCOMO, Halstead’s software science, risk
management.
Requirements Analysis and Specification: Requirements gathering and analysis, Software
Requirements Specification (SRS), Formal system specification, Axiomatic specification,
Algebraic specification, Executable specification and 4GL.

UNIT III:
Software Design: Overview of the design process, How to characterize a good software
design? Layered arrangement of modules, Cohesion and Coupling. approaches to software
design.
Agility: Agility and the Cost of Change, Agile Process, Extreme Programming (XP), Other
Agile Process Models, Tool Set for the Agile Process (Text Book 2)
Function-Oriented Software Design: Overview of SA/SD methodology, Structured analysis,
Developing the DFD model of a system, Structured design, Detailed design, and Design
Review.
User Interface Design: Characteristics of a good user interface, Basic concepts, Types of user
interfaces, Fundamentals of component-based GUI development, and user interface design
methodology.

UNIT IV:
Coding And Testing: Coding, Code review, Software documentation, Testing, Black-box
testing, White-Box testing, Debugging, Program analysis tools, Integration testing, Testing
object-oriented programs, Smoke testing, and Some general issues associated with testing.
Software Reliability And Quality Management: Software reliability. Statistical testing,
Software quality, Software quality management system, ISO 9000. SEI Capability maturity
model. Few other important quality standards, and Six Sigma.

UNIT V:
Computer-Aided Software Engineering (Case): CASE and its scope, CASE environment,
CASE support in the software life cycle, other characteristics of CASE tools, Towards second
generation CASE Tool, and Architecture of a CASE Environment.
Software Maintenance: Characteristics of software maintenance, Software reverse
engineering, Software maintenance process models and Estimation of maintenance cost.
Software Reuse: reuse- definition, introduction, reason behind no reuse so far, Basic issues in
any reuse program, A reuse approach, and Reuse at organization level.

Text Books:
1. Fundamentals of Software Engineering, Rajib Mall, 5th Edition, PHI.
2. Software Engineering A practitioner’s Approach, Roger S. Pressman, 9th Edition, Mc-
Graw Hill International Edition.

Reference Books:
1. Software Engineering, Ian Sommerville,10th Edition, Pearson.
2. Software Engineering, Principles and Practices, Deepak Jain, Oxford University
Press.

e-Resources:
1) https://nptel.ac.in/courses/106/105/106105182/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012605895063
87148827_shared/overview
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0133826904110039047
35_shared/overview
II Year I Semester L T P C
Course Code: Object Oriented Programming through JAVA 3 0 0 3
1005232102

OBJECT ORIENTED PROGRAMMING THROUGH JAVA


Course Objectives:

The learning objectives of this course are to:


 To identify Java language components and how they work together in applications
 To learn the fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries.
 To learn how to extend Java classes with inheritance and dynamic binding and how to
use exception handling in Java applications
 To understand how to design applications with threads in Java
 To understand how to use Java APIs for program development

Course Outcomes:
After completion of the course, students will be able to
 Interpret the concepts of Object Oriented Programming and the Java Programming
Constructs (K2)
 Demonstrate the concepts of Object Orientation like Objects, Classes, Methods,
Constructors alongside the usage of various keywords(K2)
 Apply the concepts of Array operations, Inheritance and Interfaces to solve the real-
world problems(K3)
 Examine the usage of Packages and Exception handling to build the Java
Applications(K3)
 Analyze the methods of String handling, Survey the techniques of Multithreading and
Connect the front-end with the back-end through Java Database Connectivity.(K4)

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.
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration 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,
TernaryOperator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop,
for Loop, Nested for Loop, For–Each for Loop, Break Statement, Continue Statement.
UNIT II:
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 Methods for Class, Overloaded
Constructor Methods, Nested Classes, Final Class and Methods, Passing Arguments by
Value and by Reference, Keywordthis.
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.
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 inInterface, 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 SE, Java.
Lang Package and its Classes, Class Object, Enumeration, class Math, 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.
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(Text Book 2)
UNIT V:
String Handling in Java: Introduction, Class String, Methods for Extracting Characters
from Strings, Comparison, Modifying, Searching; 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,
Result Set 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 Book 3)

Text Books:

1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.


2) Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis
Samanta,Monalisa Sarma, Cambridge, 2023.
3) JAVA for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

References Books:
1) The complete Reference Java, 11th edition, 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_012880464547618
816347_shared/overview
II Year I Semester L T P C
Course Code: CASE Tools Lab 0 0 3 1.5
1005232110

CASE TOOLS LAB


Course Objectives

To have hands on experience in developing a software project by using various software


engineering principles and methods in each of the phases of software development.

Course Level Learning Outcomes (Cos)


 Students will be able to achieve & demonstrate the following COs on completion of
coursebased learning
 Illustrate and articulate software development problems clearly and concisely (K2).
 Demonstration of how to translate requirements into functional specifications and
design documents.
 Develop Skills in identifying, assessing, and managing risks associated with software
Projects (K3).
 Classify how CASE tools facilitate design modeling, analysis, and documentation(K4).
 List the test cases to validate the unit and integration testing.(K4)

List of Experiments:
Do the following g 8 exercises for any two projects given in the list of sample projects or any
other projects:
1) Development of problem statement.
2) Preparation of Software Requirement Specification Document, Design Documents and
Testing
Phase related documents.
3) Preparation of Software Configuration Management and Risk Management related
documents.
4) Study and usage of any Design phase CASE tool
5) Performing the Design by using any Design phase CASE tools.
6) Develop test cases for unit testing and integration testing
7) Develop test cases for various white box and black box testing techniques.
Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
9. E-book management System.
10. Recruitment system
Text Books:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition, Mc Graw
Hill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson,
Pearson Education.
II Year I Semester L T P C
Object Oriented Programming through Java
Course Code: 0 0 3 1.5
1005232111 Lab

OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB


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:
 After completion of the course, students will be able to
 Make use of Primitive Data Types, Expressions, Classes and Methods to conduct
investigations of various problems (K3).
 Simulate Inheritance, Exception Handling Mechanism and Runtime Polymorphism to
design solutions for complex problems (K3).
 Discriminate Standalone Applications with the Graphical User Interface Environment to
understand the procedure of Event Handling (K4).

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

Sample Experiments:
Exercise – 1:
a) Write a JAVA program to display default value of all primitive data type of 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
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
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
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
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
a) Write a JAVA program that describes exception handling mechanism
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
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)
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)
c) Build a Tip Calculator app using several JavaFX components and learn how to respond to
user interactions with the GUI

References Books:

1. P. J. Deitel, H. M. Deitel, “Java for Programmers”, Pearson Education, PHI, 4th


Edition, 2007.
2. P. Radha Krishna, “Object Oriented Programming through Java”, Universities Press,
2nd Edition, 2007
3. Bruce Eckel, “Thinking in Java”, Pearson Education, 4th Edition, 2006.
4. Sachin Malhotra, Saurabh Chaudhary, “Programming in Java”, Oxford University
Press, 5th Edition, 2010.

Online Learning Resources:

https://java-iitd.vlabs.ac.in/
http://peterindia.net/JavaFiles.html
II Year I Semester L T P C
Course Code: 0 1 2 2
1005232180
Python Programming

PYTHON PROGRAMMING
(Skill Enhancement Course)
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
 Implement Dictionary keys in python convert this dictionary as a pandas data frame

Course Outcomes:
After completion of the course, students will be able to
 Write a program to define a function using default arguments
 Write a program to sum all the items in a given dictionary
 Write a program to define a function with multiple return values.
 Python program to check whether a JSON string contains complex object or not

UNTI-I:
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda
Python Distribution, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords, 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 find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.

i) Arithmetic Operators ii) Relational Operators iii) Assignment Operators iv) Logical
Operators v) Bit wise Operators vi) Ternary Operator vii) Membership Operators viii)
Identity Operators
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.
UNIT-II:
Functions: Built-In Functions, Commonly Used Modules, Function Definition and Calling the
function, return Statement and void Function, 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.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions
Used on Lists, List Methods, del Statement.
Sample Experiments:
7. Write a program to define a function with multiple return values.
8. Write a program to define a function using default arguments.
9. Write a program to find the length of the string without using any library functions.
10. Write a program to check if the substring is present in a given string or not.
11. Write a program to perform the given operations on a list:

i. Addition ii. Insertion iii. slicing


12. Write a program to perform any 5 built-in functions by taking any list.

UNIT-III:
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:
13. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
14. Write a program to count the number of vowels in a string (No control flow allowed).
15. Write a program to check if a given key exists in a dictionary or not.
16. Write a program to add a new key-value pair to an existing dictionary.
17. Write a program to sum all the items in a given dictionary.

UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python os
and os.path Modules.
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:
18. Write a program to sort words in a file and put them in another file. The output files
should have only lower-case words, so any upper-case words from source must be
lowered.
19. Python program to print each line of a file in reverse order.

20. Python program to compute the number of characters, words and lines in a file.
21. Write a program to create, display, append, insert and reverse the order of the items in
the array.
22. Write a program to add, transpose and multiply two matrices.

23. 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.

UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.
Sample Experiments:
24. Python program to check whether a JSON string contains complex object or not.
25. Python Program to demonstrate NumPy arrays creation using array () function.
26. Python program to demonstrate use of ndim, shape, size, dtype.
27. Python program to demonstrate basic slicing, integer and Boolean indexing.
28. Python program to find min, max, sum, cumulative sum of array
29. 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
30. 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

Reference Books:
1. Gowri shankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2nd Edition, Pearson,
2024

3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.


Online Learning Resources/Virtual Labs:
1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus

******
II Year I Semester L T P C
Course Code: 2 0 0 0
1000232125
Environmental Science

ENVIRONMENTAL SCIENCE

Course Objectives:
 Basic understanding of the ecosystem and its diversity.
 Overall understanding of the natural resources.
 Acquaintance on various environmental challenges induced due to unplanned
anthropogenic activities.
 Awareness on the social issues, environmental legislation and global treaties.
 An understanding of the environmental impact of developmental activities.

Course Outcomes:
At the end of course student will be able to:
 Describe the Natural resources and their importance for the sustenance of the life and
learn to conserve the natural resources.(K2)
 Interpret the concepts of Eco-system and its function in the environment.(K3)
 Predict the control or reduce pollution with waste management practices.(K3)
 Illustrate Environmental legislations of India and the first global initiatives towards
sustainable development with Case Studies.(K3)
 Relate human Population size to natural resources and resource Consumption.(K3)

UNIT I

Multidisciplinary Nature of Environmental Studies: – Definition, Scope and Importance –


Need for Public Awareness.
Natural Resources : Renewable and non-renewable resources – Natural resources and
associated problems – Forest resources – Use and over – exploitation, deforestation, case
studies – Timber extraction – Mining, dams and other effects on forest and tribal people –
Water resources – Use and over utilization of surface and ground water – Floods, drought,
conflicts over water, dams – benefits and problems – Mineral resources: Use and exploitation,
environmental effects of extracting and using mineral resources, case studies – Food resources:
World food problems, changes caused by agriculture and overgrazing, effects of modern
agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. – Energy
resources:

UNIT II
Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem – Producers,
consumers and decomposers – Energy flow in the ecosystem – Ecological succession – Food
chains, food webs and ecological pyramids – Introduction, types, characteristic features,
structure and function of the following ecosystem:
a. Forest ecosystem.
b. Grassland ecosystem
c. Desert ecosystem.
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Biodiversity and its Conservation : Introduction 0 Definition: genetic, species and ecosystem
diversity – Bio-geographical classification of India – Value of biodiversity: consumptive use,
Productive use, social, ethical, aesthetic and option values – Biodiversity at global, National
and local levels – India as a mega-diversity nation – Hot-sports of biodiversity – Threats to
biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – Endangered and
endemic species of India – Conservation of biodiversity: In-situ and Ex-situ conservation of
biodiversity.
UNIT III
Environmental Pollution: Definition, Cause, effects and control measures of :
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and industrial
wastes – Role of an individual in prevention of pollution – Pollution case studies – Disaster
management: floods, earthquake, cyclone and landslides.

UNIT IV
Social Issues and the Environment: From Unsustainable to Sustainable development –
Urban problems related to energy – Water conservation, rain water harvesting, watershed
management – Resettlement and rehabilitation of people; its problems and concerns. Case
studies – Environmental ethics: Issues and possible solutions – Climate change, global
warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies –
Wasteland reclamation. – Consumerism and waste products. – Environment Protection Act. –
Air (Prevention and Control of Pollution) Act. – Water (Prevention and control of Pollution)
Act – Wildlife Protection Act – Forest Conservation Act – Issues involved in enforcement of
environmental legislation – Public awareness.

UNIT V
Human Population and the Environment: Population growth, variation among nations.
Population explosion – Family Welfare Programmes. – Environment and human health –
Human Rights – Value Education – HIV/AIDS – Women and Child Welfare – Role of
information Technology in Environment and human health – Case studies.
Field Work: Visit to a local area to document environmental assets River/forest
grassland/hill/mountain – Visit to a local polluted site-Urban/Rural/Industrial/Agricultural
Study of common plants, insects, and birds – river, hill slopes, etc..

Textbooks:
1. Textbook of Environmental Studies for Undergraduate Courses Erach Bharucha for
University Grants Commission, Universities Press.
2. Palaniswamy, “Environmental Studies”, Pearson education
3. S.Azeem Unnisa, “Environmental Studies” Academic Publishing Company
4. K.Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate
Courses as per UGC model syllabus”, Scitech Publications (India), Pvt. Ltd.

References:
1. Deeksha Dave and E.Sai Baba Reddy, “Textbook of Environmental Science”, Cengage
Publications.
2. M.Anji Reddy, “Text book of Environmental Sciences and Technology”, BS
Publication.
3. J.P.Sharma, Comprehensive Environmental studies, Laxmi publications.
4. J. Glynn Henry and Gary W. Heinke, “Environmental Sciences and Engineering”,
Prentice Hall of India Private limited
5. G.R.Chatwal, “A Text Book of Environmental Studies” Himalaya Publishing House
6. Gilbert M. Masters and Wendell P. Ela, “Introduction to Environmental Engineering
and Science, Prentice Hall of India Private limited.

******
II Year II Semester L T P C
Managerial Economics and Financial
Course Code: 2 0 0 2
1099232201 Analysis

MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

Course Objectives:
● To inculcate the basic knowledge of microeconomics and financial accounting
● To make the students learn how demand is estimated for different products, input-
output relationship for optimizing production and cost
● To Know the Various types of market structure and pricing methods strategy
● To give an overview on investment appraisal methods to promote and the students to
learn how to plan long-term investment decisions.
● To provide fundamental skills on accounting and to explain the process of preparing
financial statements.
Course Outcomes:
 Demonstrate managerial economics & elasticity of demand (K2)
 Generalize production function and cost concepts (K2)
 Explain market structures and industrial organizations (K2)
 Determine financial performance of a company (K3)
 Apply capital budgeting techniques in Investment proposals (K3)

UNIT - I
Managerial Economics
Introduction – Nature, meaning, significance, functions, and advantages. Demand-Concept,
Function, Law of Demand - Demand Elasticity- Types – Measurement. Demand Forecasting-
Factors governing Forecasting, Methods. Managerial Economics and Financial Accounting
and Management.

UNIT - II
Production And Cost Analysis
Introduction – Nature, meaning, significance, functions and advantages. Production Function–
Least- cost combination– Short run and long run Production Function- Isoquants and Is costs,
Cost & Break-Even Analysis - Cost concepts and Cost behaviour- Break-Even Analysis (BEA)
- Determination of Break-Even Point (Simple Problems).
UNIT - III
Business Organizations and Markets
Introduction – Forms of Business Organizations- Sole Proprietary - Partnership - Joint Stock
Companies - Public Sector Enterprises. Types of Markets - Perfect and Imperfect Competition
- Features of Perfect Competition Monopoly- Monopolistic Competition–Oligopoly-Price-
Output Determination - Pricing Methods and Strategies
UNIT - IV
Capital Budgeting
Introduction – Nature, meaning, significance. Types of Working Capital, Components, Sources
of Short-term and Long-term Capital, Estimating Working capital requirements. Capital
Budgeting– Features, Proposals, Methods and Evaluation. Projects – Pay Back Method,
Accounting Rate of Return (ARR) Net Present Value (NPV) Internal Rate Return (IRR)
Method (sample problems)

UNIT - V
Financial Accounting and Analysis
Introduction – Concepts and Conventions- Double-Entry Bookkeeping, Journal, Ledger, Trial
Balance- Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet with
simple adjustments). Introduction to Financial Analysis - Analysis and Interpretation of
Liquidity Ratios, Activity Ratios, and Capital structure Ratios and Profitability.
Textbooks:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand.
2. Aryasri: Business Economics and Financial Analysis, 4/e, MGH.
Reference Books:
1. Ahuja Hl Managerial economics Schand.
2. S.A. Siddiqui and A.S. Siddiqui: Managerial Economics and Financial Analysis, New
Age International.
3. Joseph G. Nellis and David Parker: Principles of Business Economics, Pearson, 2/e,
New Delhi.
4. Domnick Salvatore: Managerial Economics in a Global Economy, Cengage.

Online Learning Resources:


https://www.slideshare.net/123ps/managerial-economics-ppt
https://www.slideshare.net/rossanz/production-and-cost-45827016
https://www.slideshare.net/darkyla/business-organizations-19917607
https://www.slideshare.net/balarajbl/market-and-classification-of-market
https://www.slideshare.net/ruchi101/capital-budgeting-ppt-59565396
https://www.slideshare.net/ashu1983/financial-accounting

******
II Year II Semester L T P C
Course Code: PROBABILITY & STATISTICS
1000232202
3 0 0 3

PROBABILITY & STATISTICS


(Common to CSE, CSE (AI &ML), CSE(IoT), CSE(AI), AI &ML, CS, IT)

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:
After successful completion of this course, the students should be able to:

 Classify the concepts of data science and its importance. (K2)


 Use discrete and continuous probability distributions to solve problems. (K3)
 Identify the types of sampling methods for different data samples.(K3)
 Test suitable sample statistical tests in testing hypothesis data.(K4)
 Interpret the association of characteristics through correlation and regression
methods.(K3)

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 (spread
or variance) –Skewness Kurtosis.

UNIT II:
Probability and Distributions:
Probability – Conditional probability and Baye’s theorem – Random variables – Discrete and
Continuous random variables – Distribution function – Mathematical Expectation and
Variance –Binomial, Poisson, Uniform and Normal distributions.

UNIT III:
Sampling Theory:
Introduction – Population and samples – Sampling distribution of Means and Variance
(definition only) – Central limit theorem (without proof) – Introduction to t, chi-square and F-
distributions – Point and Interval estimations –Standard error and Maximum error of estimate.

UNIT IV:
Tests of Hypothesis:
Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and Type II errors – Level
of significance- Confidence limits-Test of significance for large samples-single and two means
– single and two proportions- Student’s t- distribution- significance test of a sample mean –
significance test of difference between sample means.F-test, chi-square test and test of goodness
of fit.
UNIT V:
Regression analysis:
Method of least squares – Straight line – Parabola – Exponential – Power curves. Regression -
Regression coefficients and properties – Curvilinear Regression, Multiple Regression -
Correlation –Correlation coefficient – Rank correlation

Textbooks:

1. Miller and Freunds, Probability and Statistics for Engineers,7/e, Pearson, 2008.
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan
Chand & Sons Publications, 2012.

Reference Books:

1. Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineers
and the
Scientists,8th Edition, Pearson 2007.
2. S. Ross, a First Course in Probability, Pearson Education India, 2002.
3. W. Feller, an Introduction to Probability Theory and its Applications, 1/e, Wiley, 1968.
1. https://onlinecourses.nptel.ac.in/noc21_ma74/preview
2. https://onlinecourses.nptel.ac.in/noc22_mg31/preview

******
II Year II Semester L T P C
Course Code: Operating Systems 3 0 0 3
1005232201

OPERATING SYSTEMS
Course Objectives:
The main objectives of the course is to make student
 Understand the basic concepts and principles of operating systems, including process
management, memory management, file systems, and Protection
 Makeuseofprocessschedulingalgorithmsandsynchronizationtechniquestoachieve better
performance of a computer system.
 Illustrate different conditions for dead lock and their possible solutions.

Course Outcomes:
After completion of the course, students will be able to
 Describe the basics of the operating systems, mechanisms of OS to handle
processes, threads, and their communication.
 Understand the basic concepts and principles of operating systems, including
process management, memory management, file systems, and Protection.
 Make use of process scheduling algorithms and synchronization techniques to
achieve better performance of a computer system.
 Illustrate different conditions for deadlock and their possible solutions.
 Analyze the memory management and its allocation policies.

UNIT - I
Operating Systems Overview: Introduction, Operating system functions, Operating systems
operations, Computing environments, Free and Open-Source Operating Systems
System Structures: Operating System Services, User and Operating-System Interface, system
calls, Types of System Calls, system programs, Operating system Design and Implementation,
Operating system structure, Building and Booting an Operating System, Operating system
debugging.

UNIT - II
Processes: Process Concept, Process scheduling, Operations on processes, Inter-process
communication.
Threads and Concurrency: Multithreading models, Thread libraries, Threading issues.
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling.

UNIT – III
Synchronization Tools: The Critical Section Problem, Peterson’s Solution, Mutex Locks,
Semaphores, Monitors, Classic problems of Synchronization.
Deadlocks: system Model, Deadlock characterization, Methods for handling Deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlock.

UNIT - IV
Memory-Management Strategies: Introduction, Contiguous memory allocation, Paging,
Structure of the Page Table, Swapping.
Virtual Memory Management: Introduction, Demand paging, Copy-on-write, Page
replacement, Allocation of frames, Thrashing
Storage Management: Overview of Mass Storage Structure, HDD Scheduling.

UNIT - V
File System: File System Interface: File concept, Access methods, Directory Structure; File
system Implementation: File-system structure, File-system Operations, Directory
implementation, Allocation method, Free space management; File-System Internals: File-
System Mounting, Partitions and Mounting, File Sharing.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of
protection, Access matrix.

Text Books:
1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G, 10th Edition, Wiley,
2018.
2. Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson , 2016

Reference Books:
1. Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson,
2018
2. Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition,
McGraw- Hill, 2013

Online Learning Resources:


1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html

******
II Year II Semester L T P C
Course Code: 3 0 0 3
1005232202
Database Management Systems

DATABASE MANAGEMENT SYSTEMS


Course Objectives:
The main objectives of the course is to
• To study about the theoretical knowledge and practical skills in the use of databases and
database management systems in information technology applications.
• To understand about the logical design, physical design and implementation of relational
databases are covered.
• To understand and construct ER Model on various applications.

Course Outcomes:
After completion of the course, students will be able to
• Discuss elements of Database System and its Architecture for defining the schema.
• Make Use of relational model concepts and create queries using Basic SQL.
• Develop ER Model and perform various query operations on SQL.
• Construct the relations using different normal forms without redundant information.
• Illustrate state of the transaction using ACID properties and Organize database storage
structures and access techniques using file organization, indexing methods include B+
Tree, Hashing.

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, 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:
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. 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), relational set operations.

UNIT IV:
Schema Refinement (Normalization): Purpose of Normalization or schema refinement,
concept of functional dependency, normal forms based on functional dependency Lossless join
and dependency preserving decomposition, (1NF, 2NF and 3 NF), concept of surrogate key,
Boyce-Codd normal 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 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:
1) Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke,
TMH (For Chapters 2, 3, 4)
2) Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan, TMH (For
Chapter 1 and Chapter 5)

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

Web-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012758066672820
22456_shared/overview
II Year II Semester L T P C
Course Code: Formal Languages and Automata Theory 3 0 0 3
1005232203

FORMAL LANGUAGES AND AUTOMATA THEORY


Course Objectives:
• To understand the relation between Regular Language and Finite Automata and
machines.
• To learn how to design Automata’s and machines as Acceptors, Verifiers and
Translators.
• To understand the relation between Contexts free Languages, PDA .
• To learn how to design PDA as acceptor and TM as Calculators.

Course Outcomes:
By the end of the course students can
• Compare different types of Finite Automata and perform Conversion and Minimization
Techniques.(K2)
• Relate the knowledge of finite machines with regular expressions and classify the types
of grammars in Finite Automata. (K3)
• Demonstrate different Normal Forms and simplify the CFG.(K3)
• Illustrate Finite Automata with Stack. (K4)
• Demonstrate Turing Machines and classify the computability in Automata Theory. (K3)

UNIT I
Finite Automata: Need of Automata theory, Central Concepts of Automata Theory,
Automation, Finite Automation, Transition Systems, Acceptance of a String, DFA,
Design of DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of
NFA into DFA, Finite Automata with Є-Transitions, Minimization of Finite Automata,
Finite Automata with output-Mealy and Moore Machines, Applications and Limitation of
Finite Automata.

UNIT II
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE,
Manipulations of REs, Finite Automata and Regular Expressions, Inter Conversion,
Equivalence between FA and RE, Pumping Lemma of Regular Sets, Closure Properties of
Regular Sets, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem,Right
and Left Linear Regular Grammars, Equivalence between RG and FA, Inter Conversion.

UNIT III
Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse
Trees, Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of
Useless Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal
Form and Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of
Context Free Grammars.
UNIT IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description,
Language Acceptance of Pushdown Automata, Design of Pushdown Automata,
Deterministic and Non – Deterministic Pushdown Automata, Equivalence of Pushdown
Automata and Context Free Grammars, Conversion, Two Stack Pushdown Automata,
Application of Pushdown Automata.

UNIT V
Turning Machine: Definition, Model, Representation of TMs-Instantaneous
Descriptions, Transition Tables and Transition Diagrams, Language of a TM, Design of
TMs, Types of TMs, Church’s Thesis, Universal and Restricted TM, Decidable and Un-
decidable Problems, Halting Problem of TMs, Post’s Correspondence Problem,
Modified PCP, Classes of P and NP, NP-Hard and NP-Complete Problems.

Text Books:

1) Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft,


R. Motwani and J. D. Ullman, 3rd Edition, Pearson, 2008
2) Theory of Computer Science-Automata, Languages and Computation, K. L. P.
Mishra and N. Chandrasekharan, 3rd Edition, PHI, 2007

Reference Books:

1) Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., Pearson


/PHI
2) Theory of Computation, V. Kulkarni, Oxford University Press, 2013
3) Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw
Hill, 2014

e-Resources:
1) https://nptel.ac.in/courses/106/104/106104028/

******
II Year II Semester L T P C
Course Code: 0 0 3 1.5
1005232201
Operating Systems Lab

OPERATING SYSTEMS LAB


Course Objectives:
The main objectives of the course are to
• Provide insights into system calls, file systems, semaphores.
• Develop and debug CPU Scheduling algorithms, page replacement algorithms, thread
implementation.
• Implement Bankers Algorithms to Avoid the Dead Lock.

Course Outcomes:
After completion of the course, students will be able to
1. Trace different CPU Scheduling algorithms (K2).
2. Implement Bankers Algorithms to Avoid the Dead Lock (K3).
3. Evaluate Page replacement algorithms (K5).
4. Illustrate the file organization techniques (K4).
5. Illustrate Inter process Communication and concurrent execution of threads (K4)

Experiments covering the Topics:


 UNIX fundamentals, commands & system calls
 CPU Scheduling algorithms, thread processing
 IPC, semaphores, monitors, deadlocks
 Page replacement algorithms, file allocation strategies
 Memory allocation strategies

Sample Experiments:

1. Practicing of Basic UNIX Commands.


2. Write programs using the following UNIX operating system calls
fork, exec, getpid, exit, wait, close, stat, opendir and readdir
3. Simulate UNIX commands like cp, ls, grep, etc.,
4. Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Priority d) Round Robin
5. Control the number of ports opened by the operating system with
a) Semaphore b) Monitors.
6. Write a program to illustrate concurrent execution of threads using pthreads library.
7. Write a program to solve producer-consumer problem using Semaphores.
8. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
9. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
10. Simulate Paging Technique of memory management.
11. Implement Bankers Algorithm for Dead Lock avoidance and prevention
12. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked
Reference Books:
1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G, 10th Edition, Wiley,
2018.
2. Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson, 2016
3. Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson,
2018
4. Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition,
McGraw- Hill, 2013

Online Learning Resources:


1. https://www.cse.iitb.ac.in/~mythili/os/
2. http://peterindia.net/OperatingSystems.html

******
II Year II Semester L T P C
Course Code: Database Management Systems Lab 0 0 3 1.5
1005232211

DATABASE MANAGEMENT SYSTEMS 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:
After completion of the course, students will be able to
 Write a PL/SQL program to check whether the given number is ARMSTRONG or not.
 Write a PL/SQL Code Creation of forms for any Information System such as Student
Information System, Employee Information System etc.

Experiments covering the topics:


 DDL, DML, DCL commands
 Queries, nested queries, built-in functions,
 PL/SQL programming- control structures
 Procedures, Functions, Cursors, Triggers,
 Database connectivity- ODBC/JDBC

Sample Experiments:
1. Creation, altering and droping of tables and inserting rows into a table (use constraints
while creating tables) examples using SELECT command.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS,
UNION, INTERSET, Constraints. Example:- Select the roll number and name of the
student who secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP
BY, HAVING and Creation and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date), string
functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr
and instr), date functions (Sysdate, next_day, add_months, last_day, months_between,
least, greatest, trunc, round, to_char, to_date)
5.
i. Create a simple PL/SQL program which includes declaration section,
executable section and exception –Handling section (Ex. Student marks can be
selected from the table and printed for those who secured first class and an
exception can be raised if no records were found)
ii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops
using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-
APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters IN and OUT
of PROCEDURES.
9. Program development using creation of stored functions, invoke functions in SQL
Statements and write complex functions.
10. Develop programs using features parameters in a CURSOR, FOR UPDATE
CURSOR, WHERE CURRENT of clause and CURSOR variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers
and INSTEAD OF Triggers
12. Create a table and perform the search operation on table using indexing and non-
indexing techniques.
13. Write a Java program that connects to a database using JDBC
14. Write a Java program to connect to a database using JDBC and insert values into it
15. Write a Java program to connect to a database using JDBC and delete values from it

Reference Books:

1. Oracle: The Complete Reference by Oracle Press


2. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007
4. RamezElmasri, Shamkant, B. Navathe, “Database Systems”, Pearson Education, 6th
Edition, 2013.
5. Database Principles Fundamentals of Design Implementation and Management, 10th
edition, Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning, 2022

Online Learning Resources:

1. http://www.scoopworld.in
2. http://vlabs.iitb.ac.in/vlabs-dev/labs/dblab/index.php

******
II Year II Semester L T P C
Course Code: Full Stack Development – 1 0 1 2 2
1005232280

FULL STACK DEVELOPMENT – 1


(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
 Design static web pages by utilizing HTML components and their properties.
 Apply the proper CSS styles to the HTML elements to create a webpage.
 Create dynamic web pages and verify forms by experimenting with JavaScript.

Course Outcomes:
 Develop static web pages using HTML Elements (K3)
 Apply CSS styles to the HTML elements to create web pages(K3)
 Prepare dynamic web pages using JavaScript and validate the fields in the web page(K3)

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

Sample 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. JavaScript 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. JavaScript 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 a program 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. JavaScript 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])

10. Write a program to implement XMl Elements


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

Online Learning Resources:

1. https://www.w3schools.com/html
2. https://www.w3schools.com/css
3. https://www.w3schools.com/js/
4. https://www.w3schools.com/nodejs
5. https://www.w3schools.com/typescript

******
II Year II Semester L T P C
Course Code: Design Thinking & Innovation 1 0 2 2
1002232220

DESIGN THINKING & INNOVATION

Course Objectives:
The objective of this course is to
 Familiarize students with design thinking process as a tool for breakthrough innovation.
 Equip students with design thinking skills and ignite the minds to create innovative
ideas, develop solutions for real-time problems.

Course Outcomes:
 Define the concepts related to design thinking. (K2)
 Explain the fundamentals of Design Thinking and innovation (K2)
 Apply the design thinking techniques for solving problems in various sectors. (K3)
 Analyze to work in a multidisciplinary environment (K4)
 Evaluate the value of creativity (K5)
 Formulate specific problem statements of real time issues (K3)

UNIT I
Introduction to Design Thinking
Introduction to elements and principles of Design, basics of design-dot, line, shape, form as
fundamental design components. Principles of design. Introduction to design thinking, history
of Design Thinking, New materials in Industry.

UNIT II
Design Thinking Process
Design thinking process (empathize, analyze, idea & prototype), implementing the process in
driving inventions, design thinking in social innovations. Tools of design thinking - person,
costumer, journey map, brainstorming, product development

Activity: Every student presents their idea in three minutes, Every student can present design
process in the form of flow diagram or flow chart etc. Every student should explain about
product development.

UNIT III
Innovation
Art of innovation, Difference between innovation and creativity, role of creativity and
innovation in organizations- Creativity to Innovation- Teams for innovation- Measuring the
impact and value of creativity.
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation,
Debate on value-based innovation.
UNIT IV
Product Design
Problem formation, introduction to product design, Product strategies, Product value, Product
planning, product specifications- Innovation towards product design- Case studies
Activity: Importance of modelling, how to set specifications, Explaining their own product
design.

UNIT V
Design Thinking in Business Processes
Design Thinking applied in Business & Strategic Innovation, Design Thinking principles that
redefine business – Business challenges: Growth, Predictability, Change, Maintaining
Relevance, Extreme competition, Standardization. Design thinking to meet corporate needs-
Design thinking for Startups- Defining and testing Business Models and Business Cases-
Developing & testing prototypes.
Activity: How to market our own product, About maintenance, Reliability and plan for startup.

Textbooks:
1. Tim Brown,Change by design, Harper Bollins (2009)
2. Idris Mootee, Design Thinking for Strategic Innovation, 2013, John Wiley & Sons.

Reference Books:
1. David Lee, Design Thinking in the Classroom, Ulysses press
2. Shrutin N Shetty, Design the Future, Norton Press
3. William Lidwell, Universal Principles of Design- Kritinaholden, Jill Butter.
4. Chesbrough. H, The Era of Open Innovation – 2013

Online Learning 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

******

You might also like