1

IV Semester

MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

Course Code Category Hours/Week Credits Maximum Marks

Continuous Sem.-
Humanities L T P C Internal End Total
23HS421 Assessment
(Management) Exam
2 0 0 2 30 70 100
Mid Exam Duration: 2 Hrs Sem.-End Exam Duration: 3 Hrs
Pre-Requisites:
Title of the Pre-requisite Course(s)
Course Objectives:
CEO1. To inculcate the basic knowledge of microeconomics and financial accounting
CEO2. To make the students learn how demand is estimated for different products, input- output
relationship for optimizing production and cost minimization.
CEO3. To Know the Various types of market structure and pricing methods and strategy
CEO4. To give an overview on investment appraisal methods to promote the students to learn
how to plan long-term investment decisions.
CEO5. To provide fundamental knowledge on accounting and to explain the process of preparing
financial statemen

2
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Define the concepts related to Managerial Economics, financial accounting and
management(L2)
CO2. Understand the fundamentals of Economics viz., Demand, Production, cost, revenue and
markets (L2)
CO3. Apply the Concept of Production cost and revenues for effective Business decision (L3)
CO4. Analyzing and evaluating investment decisions using Capital budgeting techniques to
maximize the returns. (L5)
CO5. Able to prepare financial statements and evaluate the financial performance of business
firms (L5)

UNIT-I: Managerial Economics

Introduction –Meaning, Nature and scope, significance. Demand-Concept, Function, Law of

Demand - Demand Elasticity- Types – Measurement. Demand Forecasting- Methods. Managerial
Economics and Financial Accounting and Management.

UNIT - II Production and Cost Analysis

Introduction – Nature, meaning, significance. Production Function with one variable and two
variables– Least- cost combination– - Isoquants and Iso costs, Break-Even Analysis - Cost
concepts - Determination of Break-Even Point (Simple Problems).

UNIT - III Capital Budgeting

Capital Budgeting - Nature, meaning, significance, Features, Proposals, Methods and Evaluation of
Projects – Pay Back period (PBP) Accounting Rate of Return (ARR), Net Present Value (NPV),
Internal Rate of Return (IRR) Method and Profitability Index (P/I) (simple problems)

UNIT - IV 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.

UNIT - V Financial Accounting and Analysis (9 periods)

Introduction – Meaning, Concepts and Conventions- Double-Entry Bookkeeping, Journal,
Ledger, Trial Balance- Final Accounts (Trading Account, Profit and Loss Account and Balance
Sheet with simple adjustments). Financial Ratios – Types of Ratios.

Total Periods: 38
Textbooks:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand.
2. Aryasri: Business Economics and Financial Analysis, 4/e, MGH.
3
 Reference Books:
1. Ahuja Hl Managerial economics, S. Chand.
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/managerialeconomics-ppt
https://www.slideshare.net/rossanz/production-and-cost45827016
https://www.slideshare.net/darkyla/business-organizations19917607
https://www.slideshare.net/balarajbl/market-and-classification-ofmarket

PROBABILITY AND STATISTICS

(Common to CSE&AIML)
(Open Elective / Inter Disciplinary Elective / Professional Elective)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Basic Internal
L T P C End Total
23HS402 Sciences Assessment Exam
(BS)
3 0 -- 3 30 70 100
Mid Exam Duration: 2 Hrs Sem.-End Exam Duration: 3 Hrs
Pre-Requisites:

Course Objectives:
CEO1. To help the students in getting a thorough understanding of statistical elementary tools
and the fundamentals of Probability.
CEO2. To help the students in getting a thorough understanding and usage of statistical
techniques like testing of hypothesis.

4
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Acquire knowledge in finding the analysis of the data quantitatively or categorically and
various statistical elementary tools.
CO2. Develop skills in designing mathematical models involving probability, random
variables and the critical thinking in the theory of probability and its applications in real
life problems.
CO3. Apply the theoretical probability distributions like binomial, Poisson, and Normal in the
relevant application areas.
CO4. Analyze to test various hypotheses included in theory and types of errors for large
samples.
CO5. Apply the different testing tools like t-test, F-test, chi-square test to analyze the relevant
real-life problems.

UNIT-I: Descriptive statistics

Statistics: Introduction, Population vs Sample, Collection of data, primary and secondary data,
Measures of Central tendency, Measures of Variability (spread or variance) Skewness, Kurtosis,
correlation, correlation coefficient, rank correlation.

UNIT-II: Probability

Probability, probability axioms, addition law and multiplicative law of probability, conditional
probability, Baye’s theorem, random variables (discrete and continuous), probability density functions,
properties, mathematical expectation.

UNIT-III: Probability distributions

Probability distributions: Binomial, Poisson and Normal-their properties (Chebyshevs

inequality). Approximation of the binomial distribution to normal distribution.

UNIT-IV: Testing of hypothesis, large sample tests

Formulation of null hypothesis, alternative hypothesis, the critical and acceptance regions, level
of significance, two types of errors and power of the test. Large Sample Tests: Test for single
proportion, difference of proportions, test for single mean and difference of means. Confidence interval
for parameters in one sample and two sample problems

UNIT-V: Small sample tests

Student’s t-distribution (test for single mean, two means and paired t-test), testing of equality of
variances (F-test), χ2 - test for goodness of fit, χ2 - test for independence of attributes.
5
TEXT BOOKS:
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. S. Ross, a First Course in Probability, Pearson Education India, 2002.
2. W. Feller, an Introduction to Probability Theory and its Applications, 1/e, Wiley, 1968.
3. B. V. Ramana, Higher Engineering Mathematics, Mc Graw Hill Education.
4. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 2017, 44th Edition.

ADDITIONAL LEARNING RESOURCES:

1. https://onlinecourses.nptel.ac.in/noc21_ma74/preview
2. https://onlinecourses.nptel.ac.in/noc22_mg31/preview

OPERATING SYSTEMS
(Professional Core)

Course Code Category Hours/Week Credits Maximum Marks

Engineering Continuous Sem.-
Science L T P C Internal End Total
2305401 Assessment
(ESC) Exam
3 0 0 3 30 70 100
Mid Exam Duration: 1.5 Hrs Sem.-End Exam Duration: 3 Hrs
Pre-Requisites: Nill

Course Objectives:
CEO1. Understand the basic concepts and principles of operating systems, including
process management, memory management, file systems, and Protection
CEO2. Make use of process scheduling algorithms and synchronization techniques to achieve
better performance of a computer system.
CEO3. Illustrate different conditions for deadlock and their possible solutions.

Course Outcomes: On successful completion of this course, the students will be able to

6
 CO1 Understand the basic concepts related to the operating systems.
CO2 Analyze the various process scheduling algorithms and Understand the Thread
concepts
CO3 Analyze Process synchronization mechanisms & Understand the way to deal the
deadlocks
CO4 Analyze the various memory management schemes
CO5 Understand the basic concepts related to files in the system & Analyze the protection
and security mechanisms.

UNIT-I:

Operating Systems Overview: Introduction, operating system functions, operating systems

operations, Computing environments. System Structures: Operating System Services, User and
Operating-System Interface, system calls, Types of System Calls, system programs, operating system
structure.
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,Page replacement, Allocation of frames,

UNIT-V:

File System: File System Interface: File concept, Access methods, Directory Structure; File
system Implementation: File-system structure, File-system Operations, Allocation method.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of protection,
Access matrix. Security: The security problem, Program threats, User authentication.

7
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

ADDITIONAL LEARNING RESOURCES:

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

DATABASE MANAGEMENT SYSTEMS

(Common to CSE, CSE(DS ), AI&ML, CSE(AI&ML)) (Professional
Core)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Professional L T P C Internal End Total
2339402 Assessment
Core Exam
3 0 0 3 30 70 100
Mid Exam Duration: 1.5 Hrs Sem.-End Exam Duration: 3 Hrs
Pre-Requisites:
Data structures, File organization and management
Course Objectives:
CEO1. Introduce database management systems and to give a good formal foundation on the
relational model of data and usage of Relational Algebra
CEO2. Introduce the concepts of basic SQL as a universal Database language
CEO3. Demonstrate the principles behind systematic database design approaches by covering
conceptual design, logical design through normalization
CEO4. Provide an overview of physical design of a database system, by discussing Database
indexing techniques and storage techniques

8
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Understand the basic concepts of database management systems
CO2. Analyze a given database application scenario to use ER model for conceptual design of the
database
CO3. Utilize SQL proficiently to address diverse query challenges
CO4. Employ normalization methods to enhance database structure
CO5. Assess and implement transaction processing, concurrency control and database recovery
protocols in databases

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: TITLE OF THE UNIT

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: TITLE OF THE UNIT

Schema Refinement (Normalization): Purpose of Normalization or schema refinement,
concept of functional dependency, normal forms based on functional dependencyLossless 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: TITLE OF THE UNIT

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.
9
 Introduction to Indexing Techniques: B+ Trees, operations on B+Trees, Hash Based
Indexing:

Textbooks:
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, RamezElmasri, Shamkant B. Navathe, Pearson
3. Database Principles Fundamentals of Design Implementation and Management, Corlos
Coronel, Steven Morris, Peter Robb, Cengage Learning.

Web-Resources:
1. https://nptel.ac.in/courses/106/105/106105175/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0127580666728202
2456_shared/overview

SOFTWARE ENGINEERING
(Professional Core)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Engineering Internal
L T P C End Total
2305402 Science Assessment Exam
(ESC)
3 0 0 3 30 70 100
Mid Exam Duration: 1.5 Hrs Sem.-End Exam Duration:3Hrs
Pre-Requisites:
Introduction to Programming

Course Objectives:
CEO1. Software life cycle models, Software requirements and SRS document
CEO2. Project Planning, quality control and ensuring good quality software
CEO3. Software Testing strategies, use of CASE tools, Implementation issues, validation &
verification procedures

10
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Perform various life cycle activities like Analysis, Design, Implementation, Testing
and Maintenance (L3)
CO2. Analyse various software engineering models and apply methods for design and
development of software projects. (L4)
CO3. Develop system designs using appropriate techniques. (L3)
CO4. Understand various testing techniques for a software project. (L2)
CO5. Apply standards, CASE tools and techniques for engineering software projects (L3)

UNIT-I: INTRODUCTION
Introduction: Evolution, Software development projects, 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: 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).

UNIT-III: SOFTWARE DESIGN

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)
User Interface Design: Characteristics of a good user interface, Basic concepts, Types of user
interfaces.

UNIT-IV: CODING AND TESTING

Coding And Testing: Coding, Code review, Software documentation, Testing, Black-box testing,
White-Box testing, Debugging, Integration testing, Smoke testing, and Some general issues associated
with testing.
Software Reliability And Quality Management: Software reliability. Statistical testing, Software
quality, Software quality management system,SEI Capability maturity model.

UNIT-V: COMPUTER AIDED SOFTWARE DESIGN

11
 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.
Software Reuse: reuse- definition, introduction, reason behind no reuse so far, Basic issues in
any reuse program.

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.

ADDITIONAL LEARNING RESOURCES:

1) https://nptel.ac.in/courses/106/105/106105182/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012605895063871
48827_shared/overview
3) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_013382690411003
904735_shared/overview

OPERATING SYSTEMS LAB

(Professional Core)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Engineering L T P C Internal End Total
2305451 Assessment Exam
0 0 3 1.5 30 70 100
Pre-Requisites: Nill

Course Objectives:
CEO3. Provide insights into system calls, file systems, semaphores,
CEO1. Develop and debug CPU Scheduling algorithms, page replacement algorithms. CEO2.
Implement Bankers Algorithms to Avoid the Dead Lock

12
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Trace different CPU Scheduling algorithms (L2).
CO2. Implement Bankers Algorithms to Avoid the Dead Lock (L3).
CO3. Evaluate Page replacement algorithms (L5).
CO4. Illustrate the file organization techniques (L4).
CO5. Illustrate Inter process Communication (L4)

List of Exercises/List of Experiments:

1. Practicing of Basic UNIX Commands.
2. Simulate UNIX commands like cp, ls, grep, etc.,
3. Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Priority d) Round Robin
4. Write a program to illustrate concurrent execution of threads using pthreads library.
5. Write a program to solve producer-consumer problem using Semaphores.
6. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
7. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
8. Simulate Paging Technique of memory management.
9. Implement Bankers Algorithm for Dead Lock avoidance and prevention
10. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked

REFERENCE BOOKS/LABORATORY MANUALS:

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

DATABASE MANAGEMENT SYSTEMS LAB

(Common to CSE, CSE(DS ), AI&ML, CSE(AI&ML))
(Professional Core)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Professional L T P C Internal End Total
2339452 Assessment
Core Exam
0 0 3 1.5 30 70 100
Pre-Requisites:
Data Structures, File Organization.

13
Course Objectives:
CEO1. Populate and query a database using SQL DDL/DML Commands
CEO2. Declare and enforce integrity constraints on a database
CEO3. Writing Queries using advanced concepts of SQL
CEO4. Programming PL/SQL including procedures, functions, cursors and triggers.
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Utilizing Data Definition Language (DDL), Data Manipulation Language (DML), and Data
Control Language (DCL) commands effectively within a database environment CO2.
Constructing and execute queries to manipulate and retrieve data from databases CO3.
Develop application programs using PL/SQL.
CO4. Analyze requirements and design custom Procedures, Functions, Cursors, and Triggers,
leveraging their capabilities to automate tasks and optimize database functionality

List of Exercises/List of 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.
14
 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/LABORATORY MANUALS:
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

FULL STACK DEVELOPMENT – 1

(Common To CSE, CSE(DS ), AI&ML, CSE(AI&ML))
(Skill Enhancement Course)
Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Skill Internal
L T P C End Total
2305452 Enhancement Assessment Exam
Course
0 1 2 2 30 70 100
Pre-Requisites:
C Programming & Java Basics

15
Course Objectives:
CEO4. Make use of HTML elements and their attributes for designing static web pages.
CEO1. Build a web page by applying appropriate CSS styles to HTML elements
CEO2. Experiment with JavaScript to develop dynamic web pages and validate forms.
CEO3. Developing JavaScript programs using Looping statements.
Course Outcomes: On successful completion of this course, the students will be able to
CO1. Design Websites. (L6)
CO2. Apply Styling to web pages. (L4)
CO3. Design Forms for applications. (L6)
CO4. Choose Control Structure based on the logic to be implemented. (L3)
CO5. Understand HTML tags, Attributes and CSS properties (L2)

List of Exercises/List of 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

● Write a HTML program, to explain the working of tables. (use tags: <table>, <tr>, <th>,
<td> and attributes: border, rowspan, colspan)
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.).

16
● 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).
● 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
● Simple selector (element, id, class, group, universal)
● Combinator selector (descendant, child, adjacent sibling, general sibling)
● Pseudo-class selector
● Pseudo-element selector
● 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

17
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 no

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 date object properties and methods.
g. 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
9. JavaScript Functions and Events
a. Design a appropriate function should be called to display
● Factorial of that number
● Fibonacci series up to that number
● Prime numbers up to that number
● Is it palindrome or not

18
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
• Factorial of that number
• Fibonacci series up to that number
• Prime numbers up to that number
• 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])

Textbooks:
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.

DESIGN THINKING AND INNOVATION

Course Code Category Hours/Week Credits Maximum Marks
Continuous Sem.-
Engineering Internal
L T P C End Total
2304453 Science Assessment Exam
(ESC)
1 0 2 2 30 70 100
Pre-Requisites:
Management science
Course Objectives:
CEO1: To familiarize students with design thinking process as a tool for breakthrough
innovation.
CEO2: To equip students with design thinking skills and ignite
CEO3: To create innovative ideas, develop solutions for real-time problems.

19
 Course Outcomes: On successful completion of this course, the students will be able to
CO1: Define the concepts related to design thinking (L1, L2)
CO2: Explain the fundamentals of Design Thinking and innovation (L1, L2)
CO3: Apply the design thinking techniques for solving problems in various sectors. (L3)
CO4: Analyze to work in a multidisciplinary environment(L4)
CO5: Evaluate the value of creativity(L5)

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: Artofinnovation, 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 modeling, 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.

20
 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 in Business Processes”, 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

21