B.

TECH THIRD YEAR

Course Code ACSE0501 LTP Credits
Course Title DESIGN AND ANALYSIS OF ALGORITHMS 310 4
Course objective: Analyze asymptotic performance of algorithms designed using different computational model.
Study advanced data structures like Red black Tree, binomial and Fibonacci heap and learn the concept of complexity
classes.

Pre-requisites: Basic knowledge of any programming language like C/C++/ Python/Java, Data Structures,
Discrete Structures and Graph Theory
Course Contents / Syllabus
UNIT-I Introduction 8 Hours
Algorithms, Analyzing Algorithms, Complexity of Algorithms, Amortized Analysis, Growth of Functions, Methods
of solving Recurrences, Performance Measurements, Sorting and Order Statistics –Insertion Sort, Shell Sort, Heap
Sort, Priority queue, Comparison of Sorting Algorithms, Sorting in Linear Time, Counting Sort, Radix Sort.

UNIT-II Advanced Data Structures 8 Hours

Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps.

UNIT-III Divide and Conquer and Greedy Methods 8 Hours

Divide and Conquer concepts with Examples Such as Quick sort, Merge sort, Strassen's Matrix Multiplication, Convex
Hull, Searching. Greedy Methods with Examples Such as Activity Selection, Task scheduling, Knapsack, Minimum
Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and Bellman Ford
Algorithms, Huffman codes.

UNIT-IV Dynamic Programming, Backtracking, Branch and Bound 8 Hours

Dynamic Programming concepts, Examples Such as All Pair Shortest Paths – Warshal’s and Floyd’s Algorithms, 0/1
Knapsack, Longest Common Sub Sequence, Matrix Chain Multiplication, Resource Allocation Problem. Graph
searching (BFS, DFS), Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph
Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
UNIT-V Selected Topics 8 Hours
String Matching Algorithms such as Rabin-karp Matcher, Finite Automaton Matcher, KMP Matcher, Boyer
Moore Matcher. Theory of NP-Completeness, Approximation Algorithms and Randomized Algorithms.
Course outcome: After completion of this course students will be able to
Analyze the asymptotic performance of algorithms and write rigorous
CO 1 K4
correctness proofs for algorithms.
Use efficient data structures such as RB tree, B tree, binomial and Fibonacci
CO 2 K3
heaps etc. according to the problem
Apply divide and conquer and greedy algorithm approach for solving different
CO 3 K5
problems such
Apply important algorithmic design paradigms and methods of analysis such as
CO 4 K5
dynamic programming, backtracking, branch and bound.
 B. TECH. THIRD YEAR
Course code ACSML0502 L T P Credits
Course title MACHINE LEARNING 3 0 0 3

Course objective: To introduction to the fundamental concepts in machine learning and popular machine
learning algorithms. To understand the standard and most popular supervised learning algorithm.

Pre-requisites: Basic Knowledge of Machine learning.

Course Contents / Syllabus

UNIT-I INTRODUCTION TO MACHINE LEARNING 8 Hours
INTRODUCTION – Learning, Types of Learning, Well defined learning problems, Designing a Learning
System, History of ML, Introduction of Machine Learning Approaches, Introduction to Model Building,
Sensitivity Analysis, Underfitting and Overfitting, Bias and Variance, Concept Learning Task, Find – S
Algorithms, Version Space and Candidate Elimination Algorithm, Inductive Bias, Issues in Machine Learning
and Data Science Vs Machine Learning.

UNIT-II MINING ASSOCIATION AND SUPERVISED LEARNING 8 Hours

Classification and Regression, Regression: Linear Regression, Multiple Linear Regression, Logistic
Regression, Polynomial Regression, Decision Trees: ID3, C4.5, CART.
Apriori Algorithm: Market basket analysis, Association Rules.

Neural Networks: Introduction, Perceptron, Multilayer Perceptron, Support vector machine.

UNIT-III UNSUPERVISED LEARNING 8 Hours

Introduction to clustering, K-means clustering, K-Nearest Neighbor, Iterative distance-based clustering,

Dealing with continuous, categorical values in K-Means, Hierarchical: AGNES, DIANA, Partitional: K-means
clustering, K-Mode Clustering, density-based clustering, Expectation Maximization, Gaussian Mixture
Models.

UNIT-IV PROBABILISTIC LEARNING & ENSEMBLE 8 Hours

Bayesian Learning, Bayes Optimal Classifier, Naıve Bayes Classifier, Bayesian Belief Networks.

Ensembles methods: Bagging & boosting, C5.0 boosting, Random Forest, Gradient Boosting Machines and
XGBoost.
UNIT-V REINFORCEMENT LEARNING & CASE STUDIES 8 Hours
Reinforcement Learning: Introduction to Reinforcement Learning, Learning Task, Example of
Reinforcement Learning in Practice, Learning Models for Reinforcement – (Markov Decision process, Q
Learning – Q Learning function, QLearning Algorithm), Application of Reinforcement Learning.

Case Study: Health Care, E Commerce, Smart Cities.

Course outcome: After completion of this course students will be able to:
CO1 Understanding utilization and implementation proper machine learning K2
algorithm.
 B. TECH THIRD YEAR
Course code ACSE0503 LT P Credits

Course title DESIGN THINKING-II 2 2 1 0 3

Course Objectives: The objective of this course is to upgrade Design Thinking skills by learning & applying
advanced and contextual Design Thinking Tools. It aims to solve a Real-Life Problem by applying Design
Thinking to create an impact for all the stakeholders

Pre-requisites: Student must complete Design Thinking-I course.

Course Contents / Syllabus

UNIT-I INTRODUCTION 10 HOURS

Design thinking & Innovation, Design Thinking Mindset and Principles, recap of 5-Step Process of Design
Thinking, Design Approaches, additional in-depth examples of each design approaches. Simon Sinek’s – Start with
Why, The Golden Circle , Asking the “Why” behind each example (an in-class activity of asking 5-WHYS) , The
Higher Purpose, in-class activity for LDO & sharing insights

Visualization and it’s importance in design thinking , reflections on wheel of life (in-class activity for visualization
& Wheel of Life), Linking it with Balancing Priorities (in class activity), DBS Singapore and Bank of Americas’
Keep the Change Campaign. Litter of Light & Arvind Eye Care Examples, understanding practical application of
design thinking tools and concepts, case study on McDonald’s Milkshake / Amazon India’s Rural Ecommerce &
Gillette

Working on 1-hour Design problem, Applying RCA and Brainstorm on innovative solutions.

Main project allocation and expectations from the project.

UNIT-II REFINEMENT AND PROTOTYPING 8 HOURS

Refine and narrow down to the best idea, 10-100-1000gm, QBL, Design Tools for Convergence – SWOT Analysis
for 1000gm discussion. In-class activity for 10-100-1000gm & QBL

Prototyping (Convergence): Prototyping mindset, tools for prototyping – Sketching, paper models, pseudo-codes,
physical mockups, Interaction flows, storyboards, acting/role-playing etc, importance of garnering user feedback
for revisiting Brainstormed ideas.

Napkin Pitch, Usability, Minimum Viable Prototype, Connecting Prototype with 3 Laws, A/B Testing, Learning
Launch. Decision Making Tools and Approaches – Vroom Yetton Matrix, Shift-Left, Up, Right, Value Proposition,
Case study: Careerbuddy, You-Me-Health Story & IBM Learning Launch.
In-class activities on prototyping- paper-pen / physical prototype/ digital prototype of project’s 1000gm idea.

UNIT-III STORYTELLING, TESTING AND ASSESSMENT 8 HOURS

Storytelling: Elements of storytelling, Mapping personas with storytelling, Art of influencing, Elevator Pitch,
Successful Campaigns of well-known examples, in-class activity on storytelling. Testing of design with people,
conducting usability test, testing as hypothesis, testing as empathy, observation and shadowing methods, Guerrilla
Interviews, validation workshops, user feedback, record results, enhance, retest, and refine design, Software
validation tools, design parameters, alpha &beta testing, Taguchi, defect classification, random sampling.
Final Project Presentation and assessing the impact of using design thinking

UNIT-IV INNOVATION, QUALITY AND LEADERSHIP 6 HOURS

Innovation: Need & Importance, Principles of innovations, Asking the Right Questions for innovation, Rationale
for innovation, Quality: Principles & Philosophies, Customer perception on quality, Kaizen, 6 Sigma. FinTech case
study of Design Thinking application – CANVAS

Leadership, types, qualities and traits of leaders and leadership styles, Leaders vs Manager, Personas of Leaders &
Managers, Connecting Leaders-Managers with 13 Musical Notes, Trait theory, LSM (Leadership Situational
Model), Team Building Models: Tuckman’s and Belbin’s. Importance of Spatial elements for innovation.

UNIT-V UNDERSTANDING HUMAN DESIRABILITY 8 HOURS

Comprehensive human goal: the five dimensions of human endeavour (Manaviya - Vyavstha) are: Education- Right
living (Sikhsa- Sanskar), Health – Self-regulation (Swasthya - Sanyam), Justice – Preservation (Nyaya- Suraksha),
Production – Work ( Utpadan – Karya), Exchange – Storage (Vinimya – Kosh), Darshan-Gyan-Charitra (Shifting
the Thinking)

Interconnectedness and mutual fulfilment among the four orders of nature recyclability and self-regulation in
nature, Thinking expansion for harmony: Self-exploration (Johari’s window), group behaviour, interpersonal
behaviour and skills, Myers-Briggs personality types (MBTI), FIRO-B test to repair relationships.

Course outcome: After completion of this course, students will be able to

CO 1 Learn sophisticated design tools to sharpen their problem-solving skills K2

CO 2 Construct innovate ideas using design thinking tools and converge to feasible K6
idea for breakthrough solution
CO 3 Implement storytelling for persuasive articulation K3

CO 4 Understanding the nature of leadership empowerment K2

CO 5 Understand the role of a human being in ensuring harmony in society and nature. K2

Textbooks:
1. Arun Jain, UnMukt : Science & Art of Design Thinking, 2020, Polaris
2. Gavin Ambrose and Paul Harris, Basics Design 08: Design Thinking, 2010, AVA Publishing SA
3. R R Gaur, R Sangal, G P Bagaria, A Foundation Course in Human Values and Professional Ethics, First Edition,
2009, Excel Books: New Delhi

Reference Books:
 B. TECH THIRD YEAR
Course Code ACSE0505 L T P Credits
Course Title WEB TECHNOLOGY 3 0 0 3
Course objective: This course covers different aspect of web technology such as HTML, CSS, Java Script and
provide fundamental concepts of Internet, Web Technology and Web Programming. Students will be able to build a
proper responsive website.

Pre-requisites: Basic Knowledge of any programming language like C/C++/Python/Java. Familiarity with basic
concepts of Internet.
Course Contents / Syllabus
UNIT-I Basics of Web Technology & Testing 8 Hours
History of Web and Internet, connecting to Internet, Introduction to Internet services and tools, Client-Server
Computing, Protocols Governing Web, Basic principles involved in developing a web site, Planning process, Types
of Websites, Web Standards and W3C recommendations, Web Hosting Basics, Types of Hosting Packages,
Introduction to Web testing, Functional Testing,
Usability & Visual Testing, Performance & Load Testing.
UNIT-II Introduction to HTML & XML 8 Hours
HTML, DOM- Introduction to Document Object Model, Basic structure of an HTML document, Mark up Tags,
Heading-Paragraphs, Line Breaks, Understand the structure of HTML tables. Lists, working with Hyperlinks, Image
Handling, Understanding Frames and their needs, HTML forms for User inputs. New form Elements- date, number,
range, email, search and data list, Understanding audio, video and article tags XML Syntax, Elements, Attributes,
Namespaces, Display, HTTP request, Parser, DOM, XPath, XSLT, XQuerry, XLink, Validator, DTD and XML
Schema.
UNIT-III Concepts of CSS3 & Bootstrap 8 Hours
Creating Style Sheet, CSS Properties, CSS Styling (Background, Text Format, Controlling Fonts), Working with block
elements and objects, Working with Lists and Tables, CSS-Id and Class, Box Mode l(Introduction, JavaScript Border
properties, Padding Properties, Margin properties) CSS Advanced(Grouping, Dimension, Display, Positioning,

Floating, Align, Pseudo class, Navigation Bar, Image Sprites, Attribute sector), CSS Color, Creating page Layout and
Site. Bootstrap Features & Bootstrap grid system, Bootstrap Components, Bootstrap Plug-Ins.

UNIT-IV JavaScript and ES6 8 Hours

Introduction to Java Script, Javascript Types, Var, Let and Const Keywords, Operators in JS, Conditional Statements,
Java Script Loops, JS Popup Boxes JS Events, JS Arrays, Working with Arrays, JS Objects, JS Functions Validation
of Forms, Arrow functions and default arguments, Template Strings, Strings methods, Callback functions, Object de-
structuring, Spread and Rest Operator, Typescript fundamentals, Typescript OOPs- Classes, Interfaces, Constructor
etc. Decorator and Spread Operator, Asynchronous Programming in ES6, Promise Constructor, Promise with Chain,
Promise Race.
UNIT-V Introduction to PHP 8 Hours
Basic Syntax of PHP, Variables & Constants, Data Type, Operator & Expressions, Control flow and Decision making
statements, Functions, Strings, Arrays, Understanding file& directory, Opening and closing, a file, Copying, renaming
and deleting a file, working with directories, Creating and deleting folder, File Uploading &Downloading. Introduction
to Session Control, Session Functionality What is a Cookie, Setting Cookies with PHP. Using Cookies with Sessions,
Deleting Cookies, Registering Session variables, Destroying the variables and Session.
Course outcome: After completion of this course students will be able to
 B. TECH. THIRD YEAR (ELECTIVE-I)
Course code ACSAI0513 LT P Credits
Course title INTRODUCTION TO ARTIFICIAL INTELLIGENCE 3 0 0 3
Course objective: Introductory knowledge of historical perspective of AI and its foundations and familiarity
with principles of AI toward problem solving, inference, perception, knowledge representation, and learning.
Acquiring the knowledge various forms of learning and computation statistics.

Pre-requisites: Basic Knowledge of Transform techniques

Course Contents / Syllabus

UNIT-I INTRODUCTION 8 Hours
Introduction to Artificial Intelligence, Historical developments of Artificial Intelligence, well defined learning
problems, Designing a Learning System, Basics of problem-solving: problem representation paradigms, state
space, Problem reduction, Constraint satisfaction, Applications of AI

UNIT-II SEARCH TECHNIQUES 8 Hours

Searching for solutions, Uninformed Search Strategies: DFS, BFS, Informed Search Strategies: Local search
algorithms and optimistic problems, adversarial Search, Search for games, minimax, Alpha - Beta pruning,
Heuristic Search techniques, Hill Climbing, Best-first search, Means Ends Analysis, Iterative deepening Heuristic
Search and A*.

UNIT-III LOGIC AND KNOWLEDGE REPRESENTATION 8 Hours

Introduction of Logic, Propositional Logic Concepts, Semantic Tableaux and Resolution in Propositional logic,
FOPL, Semantic Tableaux and Resolution in FOPL, Logic Programming in Prolog. Production systems and rules
for some AI problems: Water Jug Problem, Missionaries-Cannibals Problem, n-Queen problem, monkey banana
problem, Travelling Salesman Problem. Knowledge representation, semantic nets, partitioned nets, parallel
implementation of semantic nets. Frames, Common Sense reasoning and thematic role frames.

UNIT-IV EXPERT SYSTEM 8 Hours

Architecture of knowledge-Based System, Rule-based systems, Forward and Backward Chaining, Frame Based
systems. Architecture of Expert System, Agents and Environment, Forward & Backward chaining, Resolution,
Probabilistic reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks.

UNIT-V PLANNING & UNCERTAINTY 8 Hours

Planning with state Space Search, Conditional Planning, Continuous planning, Multi-Agent Planning, Forms of
learning, inductive learning, Reinforcement Learning, learning decision trees, Neural Net learning and Genetic
learning. Probabilistic Methods, Bayesian Theory, Dempster Shafer Theory, Bayes Network. 19 Evolutionary
computations: Swarm Intelligence, ant colony optimization Agents, Intelligent Agents, Structure of Intelligent
Agents, Virtual Agents, Multi-agent systems.

Case Study: Health Care, E Commerce, Smart Cities.

 B. TECH. THIRD YEAR (ELECTIVE II)
Course code ACSAI0522 L T P Credits
Course title IMAGE PROCESSING AND PATTERN 3 0 0 3
RECOGNITION
Course objective: The objective of this course is to get adequate knowledge about image processing and pattern
recognition. It helps students to acquire practical knowledge about image processing and pattern recognition tools. It
will provide students the necessary knowledge to design and implement a prototype of an image processing and
pattern recognition applications.

Pre-requisites:

Course Contents / Syllabus

UNIT-I INTRODUCTION TO IMAGE PROCESSING & IMAGE FORMATION 8 Hours

Image processing systems and its applications, Basic image file formats, Geometric and photometric models;
Digitization - sampling, quantization; Image definition, its representation and neighbourhood metrics.

UNIT-II INTENSITY TRANSFORMATIONS & SPATIAL FILTERING 8 Hours

Enhancement, contrast stretching, histogram specification, local contrast enhancement; Smoothing, linear and order
statistic filtering, sharpening, spatial convolution, Gaussian smoothing, DoG, LoG.

UNIT-III IMAGE SEGMENTATION & IMAGE/OBJECT FEATURES 8 Hours

EXTRACTION
Pixel classification; Grey level thresholding, global/local thresholding; Optimum thresholding - Bayes analysis, Otsu
method; Derivative based edge detection operators, edge detection/linking, Canny edge detector; Region growing,
split/merge techniques, line detection, Hough transform, Textural features - gray level co-occurrence matrix;
Moments; Connected component analysis; Convex hull; Distance transform, medial axis transform,
skeletonization/thinning, shape properties.

UNIT-IV IMAGE REGISTRATION 8 Hours

Mono-modal/multimodal image registration; Global/local registration; Transform and similarity measures for
registration; Intensity/pixel interpolation.

UNIT-V COLOUR IMAGE PROCESSING & MORPHOLOGICAL FILTERING 8 Hours

BASICS
Fundamentals of different colour models - RGB, CMY, HSI, YCbCr, Lab; False colour; Pseudo colour;
Enhancement; Segmentation, Dilation and Erosion Operators, Top Hat Filters

Course outcome: After completion of this course students will be able to:
CO 1 Understanding the concept of image processing and its techniques. K3
CO 2 Explain and exemplify spatial filtering and intensity transformation. K2
CO 3 Performing Image Segmentation and understanding image/object features K3
extraction techniques.
CO4 Analyze different image registration types. K4
 (d) # (Hash)

1-j. Which of the following is the use of strlen() function in PHP?[CO5] 1

(a) The strlen() function returns the type of string

(b) The strlen() function returns the length of string
(c) The strlen() function returns the value of string
(d) The strlen() function returns both value and type of string

2. Attempt all parts:-

2.a. Explain three-Tier web architecture.[CO1] 2

2.b. Briefly describe DTD in XML?[CO2] 2

2.c. Define Bootstrap Container, and how does it work?[CO3] 2

2.d. Is java script a statically typed or a dynamically typed language? Explain it.[CO4] 2

2.e. Discuss the characteristics of PHP variables.[CO5] 2

SECTION B 30

3. Answer any five of the following:-

3-a. List and discuss the factors which makes a website search engine friendly.[CO1] 6

3-b. Draw and explain Client-Server architecture. What is Transparency.[CO1] 6

3-c. Create HTML form for Registration of a student in college?[CO2] 6

3-d. Explain XML schema and discuss various types ways to define xml schema with 6
example.[CO2]

3.e. Differentiate between Inline, Internal and External CSS.[CO3] 6

3.f. Explain Function constructor in Javascript with example.[CO4] 6

3.g. Discuss the function that is used for deleting a directory in PHP.[CO5] 6

SECTION C 50

4. Answer any one of the following:-

4-a. Explain the term Search Engine Optimization with related examples.[CO1] 10

4-b. Elaborate different types of Web Hosting packages ?[CO1] 10

5. Answer any one of the following:-

5-a. Create and save an XML document at the server which contains 10 users information. Write 10
a program, which takes user Id as an input and returns user details by taking user information
from the XMl document.[CO2]

5-b. Design an internal and external DTD with the help of suitable example.[CO2] 10

Page 3 of
6. Answer any one of the following:-

6-a. Explain why to choose bootstrap for building the website?[CO3] 10

6-b. Create a webpage which displays "Hello World" with font size 20 pixels, bold format, in 10
"Times New Roman" font and green in color using inline CSS, embedded CSS and external
CSS.[CO3]

7. Answer any one of the following:-

7-a. Explain object-based concept in JavaScript. Justify your answer.[CO4] 10

7-b. Develop a simple online shopping application using JavaScript.(Assume your own 10
data).[CO4]

8. Answer any one of the following:-

8-a. How can we create a database using PHP and MySQL?[CO5] 10

8-b. Explain in detail about session control in PHP?[CO5] 10

Page 4 of
 (b) $_POST
(c) $_REQUEST
(d) $_SESSION
Subject Code: ACSE0505/ACSEH0505
2. Attempt all parts:-
2.a. Explain three-tier web architecture with neat diagram. [CO1] 2
2.b. Describe the significance of using HTML5 semantic elements in web development. 2
Justify with the sample code. [CO2]
2.c. Explain the role of the Bootstrap framework in web development and mention the key 2
component of button dropdown menus it provides with code. [CO3]
2.d. Provide an example of a scenario where JavaScript's asynchronous programming is 2
beneficial. [CO4]
2.e. How does PHP differ from HTML, and what role does it play in dynamic web page 2
creation, explain with steps. [CO5]
SECTION – B 30
3. Answer any five of the following-
3-a. Explain the fundamental concepts of the web hosting, its types and the role of hosting 6
platforms in web development. [CO1]
3-b. Explain the difference between manual testing and automated testing in the context of 6
web applications. [CO1]
3-c. Create a XML document of 5 students of B.tech final year.(i)add marks in 5 6
subjects,(ii)Roll NO.(iii)Percentage .Give a valid DTD for the following document.
[CO2]
3-d. Explain how to validate an HTML form. Construct a program to check the following 6
validation: (i) Checking all input field for non-empty (ii) Length of first name and last
name must be less than 20 characters. (iii)Mobile number should be a number & 10
digit length.(iv)Email validation (v)Password validation (vi)Date validation(Not
equal to the current date) [CO2]
3-e. Design a web page using following styles. (a)H1 tag has to green, and underlined, (b) 6
p has to be enclosed with border with text font italic, font family Helvetica, font size
15px and font color red, (c) unordered list text blue, text bold. Add these features by
using an external css file and then refers this file in HTML document. [CO3]
3-f. Elaborate the variable naming conventions in JavaScript in detail. [CO4] 6
3-g. Explain cookies in PHP. How can a user create cookies with PHP and also write 6
syntax of it? [CO5]
SECTION – C 50
4. Answer any one of the following-
4-a. Provide an in-depth explanation of the client-server architecture in the context of web 10
technology. Discuss the roles of clients and servers and the flow of information. [CO1]
4-b. Elaborate on the role of DNS (Domain Name System) in web technology. Explain 10
how DNS translates human-readable domain names to IP addresses, facilitating the
navigation of the internet. [CO1]
5. Answer any one of the following-
5-a. Create a HTML document that divides the browser screen frame into two frames. The 10
frame on the left will be a menu consisting of a hyperlink. Clicking on any one of

Page 3 of 4
 these links will lead to new page open in the target frame, which is on the right hand
side. [CO2]
5-b. Explain below with example in HTML: [CO2] 10
1. Ordered Lists
2. Unordered Lists
3. Image Handling
4. Anchor tags
5. Frames

6. Answer any one of the following-

6-a. How many types of layouts are there in Bootstrap. Explain uses of each layout in 10
detail? [CO3]
6-b. Elaborate on the concept of CSS Flexbox and its role in layout design. Provide 10
examples of how Flexbox can be used to create flexible and responsive page layouts,
and discuss its advantages over traditional layout methods. [CO3]
7. Answer any one of the following-
7-a. Write a JavaScript code to display a welcome web page when submit button of an 10
html form is pressed. [CO4]
7-b. Explore the concept of call back functions in JavaScript. Explain with coding 10
example. [CO4]
8. Answer any one of the following-
8-a. Discuss the concept of sessions in PHP and their importance in web applications. 10
Explain how sessions are initiated, maintained, and utilized to store user-specific
information across multiple pages. [CO5]
8-b. Explain with code in PHP the process of opening the file, closing the file, copying and 10
deleting the data from file. [CO5]

Page 4 of 4
 .
1-i. A variable name can only contain ____________? [CO5] 1

(a) alphanumeric characters

(b) underscores
(c) Both A and B
(d) None of the above

1-j. What does PEAR stands for? [CO5] 1

(a) PHP extension and application repository

(b) PHP enhancement and application reduce
(c) PHP event and application repository
(d) None of the above

2. Attempt all parts:-

2.a. Discuss two-tier architecture in web technology. [CO1] 2

2.b. Explain with example the division based layout and semantic tags in html. 2
[CO2]

2.c. Write CSS style rule that applies the background declaration to div element. 2
[CO3]

2.d.
rest operator in javascript. [CO4]

E T
How many types of errors are there in JavaScript? Discuss about spread and 2

2.e.

N I
Construct a code to show destroying the variables and session in PHP. [CO5]

SECTION B
2

30

3. Answer any five of the following:-

3-a. Elaborate service oriented architecture with examples. [CO1] 6

3-b. Differentiate between Web Client & Web Server. Also, explain the basic 6
principles involved in developing a web site. [CO1]

3-c. Explain well formed and valid XML with an example. [CO2] 6

3-d. Design a HTML form for booking a ticket in railway reservation system. Validate 6
the form for five customers. [CO2]

3.e. Differentiate between visibility: hidden and display:none properties in CSS? 6

[CO3]

3.f. Describe global variables. How are these variable declared in javascript. Explain 6
with example. [CO4]

3.g. Explain the process to compare objects in PHP? [CO5] 6

SECTION C 50

.
Page 3 of
 .
4. Answer any one of the following:-

4-a. Write a detailed note on Web 3.0 standards. Also, explain the 10
publication/subscription model. [CO1]

4-b. Discuss the web hosting basics. Explain the types of web hosting packages in 10
real scenario. [CO1]

5. Answer any one of the following:-

5-a. Discuss how frames play a big role in advertising on web. Make a web page 10
using frames divided in three pages header.html, nav.html, and body.html
divided in a table in two rows. [CO2]

5-b. Define XML and its significance. Differentiate between XML and HTML, along 10
with the method of parsing in XML. [CO2]

6. Answer any one of the following:-

6-a. Using type selectors, write a CSS rule that creates a thin solid single-line border 10
around all tables and uses a single line to separate adjacent columns and
adjacent row. [CO3]

6-b. Using type selectors, write a CSS rule that puts 5 pixels of padding around the 10
text in each table header and data cell. [CO3]

7. Answer any one of the following:-

E T
7-a.

7-b.
N I
Explain javascript validation. Construct a web page using javascript validation
for a student form capturing the data for placement office. [CO4]

Explain the escape characters in JavaScript and about callback functions. [CO4]
10

10

8. Answer any one of the following:-

8-a. Write about the functions of session_cache_limiter,session_commit 10

,session_get_cookie_params ,session_id and session_name in PHP? [CO5]

8-b. Differentiate between the session and cookies. Create a program in PHP to 10
create the cookie, retrieve the cookie value, and delete the cookie. [CO5]

.
Page 4 of
 (d) None of these

1-j. Upper confidence bound is a (CO5) 1

(a) Reinforcement algorithm

(b) Supervised algorithm
(c) Unsupervised algorithm
(d) None of these

2. Attempt all parts:-

2.a. What is overfitting and underfitting? (CO1) 2

2.b. What is classifier in machine learning? (CO2) 2

2.c. Define types of clustring and explain one of them. (CO3) 2

2.d. What are Bayesian Belief nets? (CO4) 2

2.e. What is The Bellman Equation? (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Define Machine Learning. Discuss with examples why machine learning is important. (CO1) 6

3-b. Explain in detail how to implement Find S Algorithm. (CO1) 6

3-c. Explain linear and logistics Regression. (CO2) 6

3-d. Construct an expression to compute co-variance between two variable x and y. (CO2) 6

3.e. Explain Instance Based Learning With Examples. (CO3) 6

3.f. How does a Gradient Boosted Decision tree work? (CO4) 6

3.g. How would you differentiate between Positive and Negative reinforcement ? (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Describe direct learning and indirect learning with examples. (CO1) 10

4-b. Define Consistent Hypothesis and Version Space. With the help of suitable example explain 10
Version Space and Representation of version Space. (CO1)

5. Answer any one of the following:-

5-a. Differentiate between linear regression and multiple linear regression. CO2) 10

5-b. Explain Naïve Bayes Classifier with an Example. (CO4) 10

6. Answer any one of the following:-

6-a. Discuss the major drawbacks of K-nearest Neighbour learning Algorithm and how 10

Page 3 of
 it can be corrected. (CO3)

6-b. Explain the density based clustering with suitable example.. (CO3) 10

7. Answer any one of the following:-

7-a. Write down Similarities and difference Between Bagging and Boosting. (CO4) 10

7-b. Explain the concept of Support Vector Machine. (CO4) 10

8. Answer any one of the following:-

8-a. What is Q-learning? Explain it with the help of real examples. (CO5) 10

8-b. Explain the reinforcement learning method and also write application of reinforcement 10
learning. (CO5)

Page 4 of
 .
(c) Reinforcement Learning
(d) None of the above

1-j. Which of the following is false about Upper confidence bound? (CO5) 1

(a) It’s a Deterministic algorithm

(b) It does not allow delayed feedback
(c) It is not based on Bayes inference
(d) None

2. Attempt all parts:-

2.a. Define Hebb Learning. (CO1) 2

2.b. Explain Dependent and Indepenedent Variable. (CO2) 2

2.c. How to choose the optimal value of K in the KNN Algorithm? (CO3) 2

2.d. How does random forest Work? (CO4) 2

2.e. Write the application areas of Reinforcement Learning. (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Explain Types of Machine Learning. (CO1) 6

3-b.
T
Explain the inductive biased hypothesis space and unbiased learner. (CO1)

E
6

3-c.

3-d.
dataset. (CO2)

N I
Justify the cases where the linear regression algorithm is suitable for a given

How many neurons are required in each layer of ANN ? (CO2)

6

3.e. Explain the steps of k-Means Clustering Algorithm. (CO3) 6

3.f. What is a Gradient Boosted Decision Tree? (CO4) 6

3.g. Explain Characteristics of Reinforcement Learning. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. What do you mean by a well –posed learning problem? Explain the important 10
features
that are required to well –define a learning problem. (CO1)

4-b. What are the basic design issues and approaches to machine learning? (CO1) 10

5. Answer any one of the following:-

5-a. What are issues in decision tree learning? Explain briefly How are they 10
overcome? Discuss the following issues in detail. (CO2)
a. Avoiding overfitting in Decision Trees
.
Page 3 of
 .
b. Incorporating Continuous valued attributes
c. Handling Training Examples with Missing attribute values.
d. Handling Attributes with Different costs.

5-b. Explain Learning Algorithm with respect to ANN. What are the requirements of 10
learning laws for effective implementation? (CO2)

6. Answer any one of the following:-

6-a. Explain the concept of KNN Algorithm with example. (CO3) 10

6-b. What are the pros and cons of the K-means Algorithm? Also differentiate 10
between K-means and K - nearest neighbors. (CO3)

7. Answer any one of the following:-

7-a. How can we improve Gradient Boosted Decision Trees? Also write advatange of 10
it. (CO4)

7-b. How is data prepared while performing XGB? (CO4) 10

8. Answer any one of the following:-

8-a. What are some common use cases for reinforcement learning 10
algorithms? (CO5)

8-b. Describe the Discount Factor's function in Reinforcement Learning. (CO5) 10

E T
N I

.
Page 4 of
 (b) Semantic networks
(c) Partitioned Semantic Networks
(d) None of the above

1-j. Choose the correct option regarding machine learning (ML) and artificial Intelligence (CO5) 1

(a) ML is a set of techniques that turns a dataset into a software

(b) AI is a software that can emulate the human mind
(c) ML is an alternate way of programming intelligent machines
(d) All of the above

2. Attempt all parts:-

2.a. How does Artificial Intelligence effects human life? Define the main threats because of AI? 2
(CO1)

2.b. Differentiate Informed & Uninformed search. Give examples. (CO2) 2

2.c. Define the term logic. Explain its types also. (CO3) 2

2.d. Why you need a knowledge base.? Write benefits of a knowledge base.(CO4) 2

2.e. Explain Planning in Artificial Intelligence? (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Explain the different steps to design a well- defined Learning System in detail. (CO1) 6

3-b. How is Machine Learning related to Artificial Intelligence? (CO1) 6

3-c. Explain the Minimax search with sutaible example.(CO2) 6

3-d. Explain difference between Greedy Best First Search and Uniform Cost search. (CO2) 6

3.e. Explain First-Order Logic in Artificial intelligence with example.(CO3) 6

3.f. Explain Forward Chaining and Backward Chaining with diagram.(CO4) 6

3.g. Define the Bayesian Network in detail with example. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Explain the Problem Reduction in AI with example.(CO1) 10

4-b. Explain Constraint satisfaction and hence find the solution to following problem: (CO1) 10
SEND + MORE = MONEY

5. Answer any one of the following:-

5-a. Compare between Iterative deepening Heuristic Search & A*. Which one is better, explain 10

Page 3 of
 with suitable example. (CO2)

5-b. " Alpha-Beta Pruning algorithm is better then Minimax." Justify this statement with 10
example.(CO2)

6. Answer any one of the following:-

6-a. John or Mary or both will go to cinema. If John goes then Jenny will go. Mike will go if 10
Mary goes. Mike does not go to cinema. Conclude that Jenny will go to cinema. (CO3)

6-b. Explain Missionaries Cannibals problem in detail.(CO3) 10

7. Answer any one of the following:-

7-a. Describe Architecture of Expert System in detail.(CO4) 10

7-b. What do you mean by Markov Chains? Explain the areas where HMM is used. (CO4) 10

8. Answer any one of the following:-

8 Explain various types of Uncertainty in Artificial Intelligence?. (CO5) 10

8 Explain intelligent agents and their uses in artificial intelligence?. (CO5) 10

Page 4 of
 .
(d) None of the above

1-j. A perceptron can be defined as _________ (CO5) 1

(a) A double layer auto-associative neural network

(b) A neural network with feedback
(c) An auto-associative neural network
(d) A single layer feed-forward neural network with pre-processing

2. Attempt all parts:-

2.a. What is Virtual Agent? (CO1) 2

2.b. Explain different types of Hill Climbing Search ?(CO2) 2

2.c. What do you mean by Knowledge representation? (CO3) 2

2.d. Name any four Expert Systems.(CO4) 2

2.e. What do you mean by frame of discernment? (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. What is Artificial Intelligence? Give some real life applications of AI. (CO1) 6

3-b. Explain the different steps to design a well- defined Learning System in 6
detail.(CO1)

E T
3-c.

3-d.

N I
How will you differentiate between Blind Search and Heuristic Search? (CO2)

What do you understand by the term State Space Tree? Explain with example.
(CO2)
6

3.e. How means-end analysis works in AI?(CO3) 6

3.f. What do you mean by Knowledge Acquisition? What is its role in Expert 6
System?(CO4)

3.g. What is the difference between inductive, deductive, and abductive learning? 6
(CO5)

SECTION C 50

4. Answer any one of the following:-

4-a. What do you mean by Problem Reduction in AI? Explain AND OR Graphs with 10
suitable example.(CO1)

4-b. Explain history of Artificial Intelligence.(CO1) 10

5. Answer any one of the following:-

5-a. Explain the problems associated with Hill Climbing and the ways to resolve 10
those problems. (CO2)

.
Page 3 of
 .
5-b. Explain A* search.Also explain various stages of A* search with an example. 10
(CO2)

6. Answer any one of the following:-

6-a. Explain the rules associated with Semantic Tableaux in Propositional Logic. 10
(CO3)

6-b. Explain Missionaries Cannibals Problem in AI by writing the steps in the form of 10
Production rules. (CO3)

7. Answer any one of the following:-

7-a. What do you mean by Knowledge Based System? Explain the architecture of 10
Knowledge Based Systems.(CO4)

7-b. What is the role of inference engine an Expert System? Explain Forward and 10
Backward chaining in detail with suitable example.?(CO4)

8. Answer any one of the following:-

8-a. What are the components of a Bayesian Network? How Bayesian network is 10
constructed? Explain in detail with suitable example (CO5)

8-b. Explain Swarm Intelligence and Ant Colony Optimization in detail. (CO5) 10

E T
N I

.
Page 4 of
 c) finding predecessor
d) All
1-e. Which of the following sorting algorithm is stable? (CO3) 1
a) Selection sort
b) Quick sort
c) Binary insertion sort
d) Heap sort
1-f. Worst case of quick sort is? (CO3) 1
a)Elements are sorted
b) Elements are sorted in reverse order
c) Elements are random order sorted
d) Elements are unsorted
1-g. The Data structure used in standard implementation of Breadth First Search is(CO4) 1
a) Stack
b) Queue
c) Linked List
d) Tree
1-h. In Depth First Search, how many times a node is visited? (CO4) 1
a) Once
b) Twice
c) Equivalent to number of indegree of the node
d) Thrice
1-i. Basic principle in Rabin Karp algorithm? (CO5) 1
a)Hashing
b) Sorting
c) Augmenting
d) Dynamic programming
1-j. Which of the following are the examples of NP-complete Problem (CO5) 1
a) Knapsack problem
b) Hamiltonian path problem.
c) Subset sum problem
d) All above
2. Attempt all parts:-
2.a. List the fundamental steps involved in algorithmic problem solving? 2
(CO1)
2.b. Define binomial heap. (CO2) 2
2.c. Briefly explain the Prim’s algorithm (CO3) 2
2.d. Define principle of optimality (CO4) 2
2.e. Define P, NP and NP Complete in decision problem (CO5) 2
SECTION – B
3. Answer any five of the following-
3-a. Explain the concepts of Counting sort and analyse its complexity with suitable 6
example.(CO1)
3-b. Discuss Insertion sort algorithm and analyse it with an example.(CO1) 6

Page 2 of 4
3-c. Insert the nodes 15 , 13 , 12 , 16 , 19 , 23 , 5 , 8 in empty Red Black tree and 6
delete in the reverse order of insertion.(CO2)
3-d. Discuss the union operation of Binomial heap with an example. (CO2) 6
3-e. Consider following instance for simple knapsack problem. Find the solution using 6
greedy method. (CO3)
N=8
P= {11,21,31,33,43,53,55,65}
W= {1,11,21,23,33,43,45,55}
M=110
3-f. What is backtracking ? Write general iterative algorithm for backtracking. (CO4) 6
3-g. What is travelling salesman problem? Find the solution of following travelling 6
salesman. (CO5)
Cost matrix =
∞ 20 30 10 11
15 ∞ 16 4 2
3 5 ∞ 2 4
19 6 18 ∞ 3
16 4 7 16 ∞
SECTION – C
4. Answer any one of the following-
4-a. What is heap sort? Apply heap sort algorithm for sorting 1,2,3,4,5,6, 7,8,9, 10. 10
Also deduce time complexity of heap sort.(CO1)
4-b. Solve the given recurrence T(n)= 4T(n/4)+n . Explain the Growth of an functions 10
with an example.(CO1)
5. Answer any one of the following-
5-a. Explain insertion in Red Black Tree. Show steps for inserting 1, 2, 3. 4, 5, 6, 7, 8 10
,9 into empty RB tree.(CO2)
5-b. Discuss the Fibonacci heap extract min operation on given example. ( CO2) 10

6. Answer any one of the following-

6-a. Discuss knapsack problem with respect to dynamic programming approach. Find 10
the optimal solution for given solution for given problem, w (weight set) ={5, 10.
15,20} and W (Knapsack size) = 25, V(value set)={50, 60 120, 100}.(CO3)
6-b. Using Strassen’s matrix multiplication multiply the following matrices. (CO3) 10

7. Answer any one of the following-

7-a. Discuss the matrix chain multiplication algorithm with the example using four 10
matrices.(CO4)

Page 3 of 4
7-b. Write an algorithm for solving n-queen problem. Show the solution of 4 queen 10
problem using backtracking approach.(CO4)
8. Answer any one of the following-
8-a. Prove the three coloring problem is NP Complete. 10
(CO5)
8-b. What is string matching algorithm? Explain Rabin-Karp method with 10
examples.(CO5)

Page 4 of 4
 .
(d) Mapping

1-i. Problems that can be solved in polynomial time are known as? (CO5) 1

(a) intractable
(b) tractable
(c) decision
(d) complete

1-j. Travelling Salesman Problem belongs to. (CO5) 1

(a) NP-Complete Problem

(b) NP-Hard Problem
(c) NP-soft Problem
(d) None of them

2. Attempt all parts:-

2.a. Find the Time Complexity through substitution method. (CO1) 2

T(n) = 1 , if n=1

T(n)= T(n-1) + Log(n) , if n>1

2.b.

2.c.

E T
What are the basic operation on B-Tree? (CO2)

Point out the pros of Kruskal's Algorithm. (CO3)

2

2.d.

2.e. Define theory of completeness. (CO5)

N I
What is time complexity of Longest Common Subsequence problem? (CO4) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Explain asymptotic notations with example. (CO1) 6

3-b. What do you understand by stable and unstable sorting? Sort the following 6
sequence { 25, 57, 48, 36, 12, 91, 86, 32} using Heap Sort. (CO1)

3-c. Write an algorithm for union of two Binomial Heap tree. Also explain with 6
example .(CO2)

3-d. Insert the following keys into empty B-tree: 40,35,22,90,12,45,58,78,67,60 and 6
m=4. (CO2)

3.e. Implement Prim's algorithm. Take an example and find MST of any graph using 6
Prim's algorithm. (CO3)

3.f. What is the sum of subsets problem? Let w={5,7,10,12,15,18,20} and m=35. Find 6
all possible subsets of w that sum to m using recursive backtracking algorithm
for it. Draw the portion of the state-space tree that is generated. (CO4)
.
Page 3 of
 .
3.g. Give some examples of P and NP problem. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Solve the recurrence relation ? By using recursion tree Method or Back 10
Substitution method. (CO1)
T(n)=1, If n=0
T(n)=2T(n-1)+1,if n>0

4-b. Explain the algorithm of counting sort. Illustrate the operation of counting sort 10
on the following array A = {0,1,3,0,3,2,4,5,2,4,6,2,2,3}. (CO1)

5. Answer any one of the following:-

5-a. Discuss the various cases for insertion of key in red-black tree for given 10
sequence of key in an empty red-black tree- {15,13,12,16,19,23,5,8}. (CO2)

5-b. Explain the algorithm to delete a given element in a binomial Heap. Give an 10
example for the same. (CO2)

6. Answer any one of the following:-

6-a. Describe the importance of pivot element in quick sort. How the position of it 10
effect the performance of quick sort. Explain with algorithm. (CO3)

6-b.
T
Consider the following instances of the fractional knapsack problem: n = 3, M =

E
10

7. Answer any one of the following:-

7-a.
I
20, V = (24, 25, 15) and W = (18, 15, 20) find the feasible solutions. (CO3)

N
Solve the instance of 0/1 knapsack problem using dynamic Programming : n = 10
4, M = 25, (P1, P2, P3 P4) = (10, 12, 14, 16), (W1, W2, W3, W4) = (9, 8, 12, 14)

7-b. Illustrate n queen’s problem. Examine 4 queen’s problem using back tracking 10
method. (CO4)

8. Answer any one of the following:-

8-a. Describe in detail Knuth-Morris-Pratt string Matching Algorithm. Compute the 10

prefix function for the pattern ababbabbabbababbabb when the alphabet is

= {a,b}. (CO5)

8-b. Define the following problems related to NPC: (CO5) 10

(i) Vertex Cover
(ii) Clique

.
Page 4 of
 (d) affirming.

1 Which is NOT a reason why people join group? (CO5) 1

(a) Knowledge
(b) Status
(c) Safety
(d) Power

2. Attempt all parts:-

2.a. List the Five Stages of Design Thinking. (CO1) 2

2.b. Discuss 10-100-1000 gm law of design thinking. (CO2) 2

2.c. Define Systematic Random Sampling (CO3) 2

2.d. Enumerate at least four business leaders from different industries who have changed the 2
opinion business. (CO4)

2.e. Explain Myers-Briggs Personality Type Indicator. (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3 Discuss Creativity and Innovation. (CO1) 6

3 How does the Aravind Eye Care work. (CO1) 6

3 Explain the tools used for prototyping in design thinking. (CO2) 6

3 Discuss convergent thinking in design thinking. (CO2) 6

3.e. Persona mapping is a key element of storytelling. Explain in detail. (CO3) 6

3.f. "Innovation comes at a cost." Explain with your reason. (CO4) 6

3.g. Write short note on FIRO-B Test. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Summarize DBS Singapore and Bank of Americas’ Keep the Change Campaign. (CO1) 10

4-b. Elaborate 3 core design principles. (CO1) 10

5. Answer any one of the following:-

5 Explain SWOT analysis with suitable example. (CO2) 10

5 How can we apply the concept of the design thinking in a real life . Justify the statement 10
with an example.(CO2)

6. Answer any one of the following:-

Page 3 of
6 Describe proactive, reactive and ongoing methods of user feedback. (CO3) 10

6 Define usability testing? Explain remote and in person testing methods. (CO3) 10

7. Answer any one of the following:-

7 Suggest the changes you would like to implement as a leader to bring harmony among the 10
employees of your company. (CO4)

7 Describe the Belbin's model of Team roles. Describe various team roles also. (CO4) 10

8. Answer any one of the following:-

8 Design the MBTI chart as per the real problem of your choice. (CO5) 10

8 Define and link all the 5 dimensions of the human order. (CO5) 10

Page 4 of
 .
(c) Avadhi Jnana
(d) Mati Jnana

1-j. Which among the following is a part of Ignorance. (CO5) 1

(a) Manahparyayajnana
(b) Kushruta
(c) Avadhijnana
(d) Kevaljnana

2. Attempt all parts:-

2.a. Explain expansive thinking. (CO1) 2

2.b. Discuss any five rules of brainstorming. (CO2) 2

2.c. What is defect classification. (CO3) 2

2.d. Discuss the approach of Crosby towards quality. (CO4) 2

2.e. Define interconnectedness. (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Elaborate the following term as per wheel of life: (1) Spiritual (2) Physical (CO1) 6

3-b.
T
Summarize Design Thinking Mindset and Principles. (CO1)

E
6

3-c.

3-d.
N I
Explain any two laws of design thinking. (CO2)

Explain the concept of active facilitation in Ideation step of design thinking.

(CO2)
6

3.e. Describe the elements of storytelling proposed by Aristotle. (CO3) 6

3.f. Describe the factors that can foster the innovation in economy. (CO4) 6

3.g. Explain Fallacious knowledge according to Jain Darshan. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Illustrate Amazon India’s Rural Ecommerce. (CO1) 10

4-b. Describe the Higher Purpose. (CO1) 10

5. Answer any one of the following:-

5-a. Explain the concept of learning launch with the help of suitable example. (CO2) 10

5-b. Define prototyping and explain the tools used in prototyping. (CO2) 10

6. Answer any one of the following:-

6-a. Explain different types of classes of defects in quality control. (CO3) 10

.
Page 3 of
 .
6-b. How will you correlate persona with storytelling. (CO3) 10

7. Answer any one of the following:-

7-a. Discuss the quality parameters that you would like to have in your prospective 10
car. (CO4)

7-b. Describe the principles of the innovation in detail. (CO4) 10

8. Answer any one of the following:-

8-a. Explain the Feelings in relationship in details. (CO5) 10

8-b. Shifting the thinking is the answer of every problem justify it. (CO5) 10

E T
N I

.
Page 4 of