ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER III
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

MAT CATEGORY L T P CREDITS

DISCRETE MATHEMATICAL
203 STRUCTURES BSC 3 1 0 4

Preamble:

The purpose of this course is to create awareness in students about the basic terminologies used
in advanced courses in Computer Science and develop rigorous logical thinking for solving
different kinds of problems in Computer Science. This course helps the learner to apply the
theory and applications of elementary Counting Principles, Propositional Logic, Predicate Logic,
Lattices, Generating Functions, Recurrence Relations and Algebraic Structures eventually in
practical applications.

Prerequisite: A sound background in higher secondary school Mathematics

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Check the validity of predicates in Propositional and Quantified Propositional Logic
CO1 using truth tables, deductive reasoning and inference theory on Propositional Logic
(Cognitive Knowledge Level: Apply)
Solve counting problems by applying the elementary counting techniques - Rule of
Sum, Rule of Product, Permutation, Combination, Binomial Theorem, Pigeonhole
CO2
Principle and Principle of Inclusion and Exclusion (Cognitive Knowledge Level:
Apply)
Classify binary relations into various types and illustrate an application for each type
CO3 of binary relation, in Computer Science (Cognitive Knowledge Level:
Understand)
Illustrate an application for Partially Ordered Sets and Complete Lattices, in
CO4
Computer Science (Cognitive Knowledge Level: Apply)
Explain Generating Functions and solve First Order and Second Order Linear
CO5 Recurrence Relations with Constant Coefficients (Cognitive Knowledge Level:
Apply)
Illustrate the abstract algebraic systems - Semigroups, Monoids, Groups,
CO6 Homomorphism and Isomorphism of Monoids and Groups (Cognitive Knowledge
Level: Understand)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze

Evaluate

Create
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of Series Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module – 1 (Fundamentals of Logic)
Mathematical logic - Basic connectives and truth table, Statements, Logical Connectives,
Tautology, Contradiction. Logical Equivalence - The Laws of Logic, The Principle of duality,
Substitution Rules . The implication - The Contrapositive, The Converse,The Inverse.
 ARTIFICIAL
Logical Implication - Rules of Inference. INTELLIGENCE
The use of QuantifiersAND MACHINE
- Open LEARNING
Statement, Quantifier.
Logically Equivalent – Contrapositive, Converse , Inverse , Logical equivalences and
implications for quantified statement, Implications , Negation .

Module - 2 (Fundamentals of Counting Theory)

The Rule of Sum – Extension of Sum Rule . The Rule of Product - Extension of Product Rule .
Permutations. Combinations. The Binomial Theorem (without proof). Combination with
Repetition. The Pigeon hole Principle. The Principle of Inclusion and Exclusion Theorem
(Without Proof) - Generalization of the Principle. Derangements.

Module - 3 ( Relations and Functions )

Cartesian Product - Binary Relation. Function – domain , range-one to one function, Image-
restriction. Properties of Relations- Reachability Relations, Reflexive Relations, Symmetric
Relations, Transitive relations, Anti-symmetric Relations, Partial Order relations, Equivalence
Relations, Irreflexive relations.

Partially ordered Set – Hasse Diagram, Maximal-Minimal Element, Least upper bound (lub),
Greatest Lower bound(glb) ( Topological sorting Algorithm- excluded). Equivalence Relations
and Partitions - Equivalence Class.

Lattice - Dual Lattice , Sub lattice , Properties of glb and lub , Properties of Lattice , Special
Lattice , Complete Lattice, Bounded Lattice, Completed Lattice , Distributive Lattice.

Module - 4 (Generating Functions and Recurrence Relations)

Generating Function - Definition and Examples , Calculation techniques, Exponential
generating function. First order linear recurrence relations with constant coefficients –
homogeneous, non-homogeneous Solution. Second order linear recurrence relations with
constant coefficients, homogeneous, non-homogeneous Solution.

Module - 5 (Algebraic Structures )

Algebraic system-properties- Homomorphism and Isomorphism. Semi group and monoid –
cyclic monoid , sub semi group and sub monoid, Homomorphism and Isomorphism of Semi
group and monoids. Group- Elementary properties, subgroup, symmetric group on three
symbols ,The direct product of two groups, Group Homomorphism, Isomorphism of groups,
Cyclicgroup. R i g h t c o s e t s - L e f t c o s e t s . L a g r a n g e ’s T h e o r e m

Text Book

1. Discrete and Combinatorial Mathematics (An Applied Introduction), Ralph P Grimaldi, B

V Ramana , 5th Edition, Pearson

Reference Books ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
1) Kenneth H. Rosen, Discrete Mathematics and Its Applications with Combinatorics and
Graph Theory, Seventh Edition, MGH, 2011
2) Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 2003.
3) Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical
Structures”, Pearson Education Pvt Ltd., New Delhi, 2003
4) Kenneth H .Rosen, “Discrete Mathematics and its Applications”, 5/e, Tata Mc Graw Hill
Pub. Co. Ltd, New Delhi 2003
5) Richard Johnsonbaugh, “Discrete Mathematics”, 5/e, Pearson Education Asia, NewDelhi,
2002.
6) Joe L Mott, Abraham Kandel, Theodore P Baker,“Discrete Mathematics for Computer
Scientists and Mathematicians”, 2/e, Prentice-Hall India, 2009.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Show that R⋁M , R⋁S , M , S cannot exist simultaneously (without using truth
table)
2. Represent the following statement in symbolic form “Not every city in Canada is clean”.
Course Outcome 2 (CO2):
1. How many possible arrangements are there for the letters in MASSASAUGA in which 4
A’ s are together?
2. Find the number of integers between 1 and 1000 inclusive, which are not divisible by 5,
6 or 8
Course Outcome 3 (CO3):
1. If A = {1, 2, 3, 4}, give an example of a relation R that is reflexive and symmetric but not
transitive.
2. Let Z be the set of integers. R is a relation called “Congruence Modulo 3 “ defined by R
= { (x,y) /x ɛ Z,y ɛ Z, x - y is divisible by 3 } . Show that R is an equivalence relation.
Course Outcome 4 (CO4):
1. Assume A ={ a, b, c}. Let P(A) be its power set and ‘≤ ‘ be the subset relation on the
power set. Draw the Hasse diagram of (P(A), ≤).
2. What is meant by Bounded Lattice ? Give an example.
Course Outcome 5 (CO5):
1. Solve ar- 3ar-1- 4ar-2 = 3r using Generating function method; Given a0 = 1, a1 = 2.
2. Find the generating function for the sequence 1, 3, 32, 33 …….
Course Outcome 6 (CO6):
1. Prove that the group { 1,-1, i, -i } is cyclic with generators i and –i.
2. State and prove Lagrange’s Theorem.
 ARTIFICIAL
Model INTELLIGENCE
Question Paper AND MACHINE LEARNING
QP CODE:
Reg No:______________
Name :______________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

THIRD SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: MAT 203

Course Name: Discrete Mathematical Structures

Max.Marks :100 Duration: 3 Hrs

PART A

Answer all Questions. Each question carries 3 Marks

1. Show the following implication without constructing the truth table: (P ^ Q) => P→Q
2. Write the negation of the following statement. “ If I drive, then I will not walk”
3. What is pigeon hole principle? Explain. If you select any five numbers from 1 to 8 then
prove that at least two of them will add up to 9 .
4. In how many ways can the letters of the word ALLAHABAD be arranged ?
5. Show that the divisibility relation ' / ' is a partial ordering on the set Z+.
6. Consider the functions given by f(x) = 2x+3 and g(x) = x2. Find (g o f ) and ( f o g).
7. What is meant by exponential generating function? Explain.
8. Provide one example of linear homogeneous recurrence relation. Mention the degree
also.
9. What is a monoid ? Explain.
10. Let (A, .) be a group. Show that (ab)-1 = b-1a-1

(10 x 3 = 30 Marks)

PART B

(Answer any one Question from each Module. Each question carries 14 Marks)

11.
(a) Show that S ⋁ R is tautologically implied by (PVQ) ⋀ (P→R) ⋀ (Q→S)
(6 marks)
 (b) Show that from ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(ii) (∃x)(F(x) ⋀ S(x)) → (y) (M(y) → W(y)).
(iii)(∃y) (M(y) ⋀ W(y)) the conclusion (x)(F(x) →S(x)) follows.
(8 marks)
OR
12.
(a) Show that (x) (P(x) ⋁ Q(x)) ⇒ ((x)P(x) ⋁ (∃x) Q(x)) using indirect method of
proof .
(6 marks)
(b) Discuss indirect method of proof . Show that the following premises are inconsistent

(i) If Jack misses many classes through illness, then he fails high school.
(ii) If Jack fails high school, then he is uneducated.
(iii)If Jack reads a lot of books, then he is not uneducated.
(iv) Jack misses many classes through illness and reads a lot of books.
(8 marks)

13.
(a) Explain binomial theorem. Determine the coefficient of x9y3 in the expansion of
(x+y)12, (x+2y)12 and (2x- 3y)12 using binomial theorem.
(6 marks)
(b) How many 5 digit numbers can be formed from the digits 1,2,3,4,5 using the digits without
repetition ?
(i) How many of them are even?
(ii) How many are even and greater than 30,000?
(8 marks)
OR
14.
(a) There are 8 guests in a party. Each guest brings a gift and receives another gift in
return. No one is allowed to receive the gift they bought. How many ways are there to
distribute the gifts?
(6 marks)
(b) Six papers are set in an examination of which two are mathematical. Only one
examination will be conducted in a day. In how many different orders ,can the papers
be arranged so that
(i) Two mathematical papers are consecutive?
(ii) Two mathematical papers are not consecutive?
(8 marks)
15.
ARTIFICIAL
(a) Let A = { 1,2,3,4,...11,12} and let R INTELLIGENCE AND
be the equivalence MACHINE
relation on A xLEARNING
A defined by
(a,b) R (c,d) iff a+d = b+c. Prove that R is an equivalence relation and find the
equivalence class of (2 ,5)
(8 marks)
(b) What is a chain lattice ? Explain. Also show that every chain is a distributive lattice.
(6 marks)
OR
16.
(a) Suppose f(x) = x+2 , g(x) = x-2, and h(x) = 3x for x ɛ R , where R is the set of real
numbers. Find (g o f ) , ( f o g ) , (f o f) and ( g o g)
(8 marks)
(b) Let R and S be two relations on a set A . If R and S are symmetric, Prove that (R∩S)
is also symmetric.
(6 marks)

17.
(a) Solve the recurrence relation ar - 7ar-1+ 10ar-2 = 0 for r ≥ 2 ; Given a0 = 0; a1 = 41
using generating functions
(8 marks)
(b) Solve the recurrence relation ar - 4ar-1 + 4ar-2 = (r+1)2 using generating function.
(6 marks)
OR
18.
(a) Solve an - 3an-1 + 2 ; a0 = 1 n ≥ 1, using generating functions.
(8 marks)
(b) Use generating function to solve the following recurrence relation an = 2an-1+ 2n ;
with a0 = 2.
(6 marks)

19.
(a) Prove that the set 'Q' of rational numbers other than 1 forms an abelian group with
respect to the operation ' * ' defined by a * b = a+b -ab.
(8 Marks)
(b) Show that the direct product of two group is a group.
(6 Marks)
OR
20.
(a) Show that the subgroup of a cyclic group is cyclic.
(8 Marks)
(b) Let (A,*) be a group. Show that (A,*) is an abelian group if and only if a2* b2=(a*b)2 for all
‘a’ and ‘b’ in A
(6 Marks)
TEACHING PLAN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

No of Lecture
No Contents
Hrs
Module – 1 (Fundamentals of Logic) (9 hrs)

1.1 1
Mathematical logic, Basic Connectives and Truth Table

1.2 Statements, Logical Connectives, Tautology, Contradiction 1

1.3 Logical Equivalence, The Laws of Logic 1
1.4 The Principle of duality, Substitution Rules 1
1.5 The implication, The Contrapositive, the Converse , the Inverse 1
1.6 Logical Implication,Rules of Inference, Logical Implication 1
1.7 The use of Quantifiers, Open Statement, Quantifier, Negation 1
Logically Equivalent, Contrapositive, The Converse, The
1.8 Inverse 1

1.9 Logical Implications 1

Module - 2 (Fundamentals of Counting Theory) (9 hrs)
2.1 The Pigeon-hole Principle 1
2.2 The Rule of Sum 1
2.3 Extension of Sum Rule 1
2.4 The Rule of Product 1
2.5 Extension of Product Rule , Permutations 1
2.6 Combinations, Combination with repetition 1
2.7 The Binomial Theorem 1
The Principle of Inclusion and Exclusion Theorem ( Without
2.8 1
Proof) Generalization of the Principle
2.9 Derangements 1

Module - 3 ( Relations and Functions) (9 hrs)

Cartesian Product, Binary Relation, Function, Domain, Range ,

3.1 1
One to One Function Image - Restriction

P roperties, Reachability Relations, Reflexive Relations,Symmetric

3.2 Relations,Transitive relations, Antisymmetric Relations. 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
3.3 Partial Order relations 1

3.4 Equivalence Relation, Irreflexive Relations. 1

3.5 Partially ordered Set, Hasse Diagram.

1
Maximal-Minimal Element, Least Upper bound, Greatest
3.6 1
Lower Bound

3.7 Equivalence Relations and Partitions ,Equivalence Class 1

3.8 Lattice- Dual Lattice,sub lattice , Properties of glb and lub 1

Properties of Lattice , Special Lattice , Complete Lattice,

3.9 Bounded Lattice, Completed Lattice, Distributive Lattice 1

Module - 4 (Generating Functions and Recurrence Relations) (9 hrs)

4.1 Generating Function , Definition and Examples 1

Exponential Generating Function.

4.2 1

First Order Linear Recurrence Relations with Constant

4.3 Coefficients (Lecture I) 1

First Order Linear Recurrence Relations with Constant

4.4 1
Coefficients (Lecture II)

4.5 Homogeneous Solution 1

4.6 Non homogeneous Solution 1

Second order linear recurrence relations with constant

4.7 1
coefficients

4.8 Homogeneous Solution 1

4.9 Non homogeneous Solution 1

Module - 5 (Algebraic Structures )( 9 hrs)

Algebraic System-Properties, Homomorphism and
5.1 1
Isomorphism

5.2 Semi group , Monoid, Cyclic monoid 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
5.3 Sub semigroup and sub monoid 1

5.4 Homomorphism and Isomorphism of Semigroup, Monoids and

1
Groups
Elementary Properties, Subgroup, Symmetric group on three
5.5 symbols 1

5.6 The direct Product of two Groups 1

5.7 Group Homomorphism, Isomorphism, Cyclic group 1

5.8 Right coset, Left coset 1

5.9 Lagrange’s Theorem 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
DATA CATEGORY L T P CREDIT
CST201 INTRODUCTION
STRUCTURES
PCC 3 1 0 4 2019

Preamble: This course aims at moulding the learner to understand the various data structures,
their organization and operations. The course helps the learners to assess the applicability
of different data structures and associated algorithms for solving real world problem which
requires to compare and select appropriate data structures to solve the problem efficiently.
This course introduces abstract concepts for data organization and manipulation using data
structures such as stacks, queues, linked lists, binary trees, heaps and graphs for designing their
own data structures to solve practical application problems in various fields of Computer
Science.

Prerequisite: Topics covered under the course Programming in C (EST 102)

Design an algorithm for a computational task and calculate the time/space

CO1
complexities of that algorithm (Cognitive Knowledge Level: Apply)

Identify the suitable data structure (array or linked list) to represent a data item
required to be processed to solve a given computational problem and write an
CO2
algorithm to find the solution of the computational problem (Cognitive Knowledge
Level: Apply)

Write an algorithm to find the solution of a computational problem by selecting an

CO3 appropriate data structure (binary tree/graph) to represent a data item to be processed
(Cognitive Knowledge Level: Apply)

Store a given dataset using an appropriate Hash Function to enable efficient access of
CO4
data in the given set (Cognitive Knowledge Level: Apply)
Select appropriate sorting algorithms to be used in specific circumstances (Cognitive
CO5
Knowledge Level: Analyze)

Design and implement Data Structures for solving real world problems efficiently
CO6
(Cognitive Knowledge Level: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category
Test1 (Percentage) Test2 (Percentage) Examination Marks

Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module 1

Basic Concepts of Data Structures

System Life Cycle, Algorithms, Performance Analysis, Space Complexity, Time Complexity,
Asymptotic Notation, Complexity Calculation of Simple Algorithms

Module 2

Arrays and Searching

Polynomial representation using Arrays, Sparse matrix, Stacks, Queues-Circular Queues, Priority
Queues, Double Ended Queues, Evaluation of Expressions
Linear Search and Binary Search
Module 3

Linked List and Memory Management

Self Referential Structures, Dynamic Memory Allocation, Singly Linked List-Operations on
Linked List. Doubly Linked List, Circular Linked List, Stacks and Queues using Linked List,
Polynomial representation using Linked List
Memory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes

Module 4
Trees and Graphs
Trees, Binary Trees-Tree Operations, Binary Tree Representation, Tree Traversals, Binary Search
Trees- Binary Search Tree Operations
Graphs, Representation of Graphs, Depth First Search and Breadth First Search on Graphs,
Applications of Graphs

Module 5

Sorting and Hashing

Sorting Techniques – Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort
Hashing- Hashing Techniques, Collision Resolution, Overflow handling, Hashing functions –
Mid square, Division, Folding, Digit Analysis

Text Book

1. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Universities Press,

Fundamentals of Data Structures in C
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Reference Books

1. Samanta D., Classic Data Structures, Prentice Hall India.

2. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with
C, 2/e, Cengage Learning.

3. Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson
Publication.

4. Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata

McGraw Hill.
5. Peter Brass, Advanced Data Structures, Cambridge University Press.
6. Lipschuts S., Theory and Problems of Data Structures, Schaum’s Series.
7. Wirth N., Algorithms + Data Structures = Programs, Prentice Hall.
8. Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI.
9. Martin Barrett, Clifford Wagner, C And Unix: Tools For Software Design, John Wiley.

Sample Course Level Assessment Questions

Course Outcome1(CO1): Write an algorithm for matrix multiplication and calculate its
time complexity.

Course Outcome 2(CO2): How a linked list can be used to represent the polynomial
5x4y6+24x3y4-17x2y3+15xy2+45.Write an algorithm to add two Bivariate polynomials
represented using linked list.

Course Outcome 3(CO3): Create a Binary search Tree with node representing the
following sequence 14, 15, 4, 18, 9, 16, 20, 17, 3, 7, 5, 2 and perform inorder, preorder
and postorder traversals on the above tree and print the output.

Course Outcome 4(CO4): The size of a hash table is 7. The index of the hash table
varies from 0 to 6. Consider the keys 89, 18, 49, 58, 25 in the order. Show how the keys
are stored in the hash table using Linear probing.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 5(CO5): In what circumstances does Quick Sort perform over Merge
sort.

Course Outcome 6(CO6): Design a reservation system for railways that include
waiting list. If the reservation is full “Display reservation full” and put the passenger in
in waiting list and give a waiting list number. If a passenger cancels the ticket, then the
seat should be automatically allocated to the first passenger in the waiting list.

Model Question Paper

QP CODE: PAGES:3

Reg No:_______________

Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH

DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 201

Course Name: DATA STRUCTURES

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Calculate the frequency count of the statement x = x+1; in the following code segment

for (i = 0; i< n; i++)

for (j = 0; j< n; j*=2)

x = x + 1;

2. What is the relevance of verification in System Life Cycle?

3. Write an algorithm to insert a new element in a particular position of an array.

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. Convert the expression ((A/(B-D+E))*(F-G)*H) to postfix form. Show each step in the
conversion including the stack contents

5. Write an algorithm to count the number of occurrences of a character in a linked list (each
node contains only one character)

6. Write an algorithm for best-fit method of memory allocation

7. Draw the binary tree whose sequential representation is given below

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
A B C - D E - - - - F G - - -

8. Find the Depth First Search of the following Graph

B C D

E F G

9. Write an algorithm to arrange n numbers in nonincreasing order.

10. Let the size of a hash table is 10. The index of the hash table varies from 0 to 9. Assume
the keys 73, 54, 15, 48, 89, 66, 37, 18, 41, 22, 62 are mapped using modulo operator.
Show how the keys are distributed using chaining method.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B

Answer any one Question from each module. Each question carries 14 Marks

11. a) Explain the System Life Cycle in detail (10)

b) How the performance of an algorithm is evaluated? (4)

OR

12. a) Write algorithms for Linear Search and Binary Search and Compare their time

complexities (10)

b) Between O(nlogn) and O(logn) which one is better and why? (4)

13. a) Write algorithms to insert and delete elements from a double ended queue.

Demonstrate with examples (10)

b) Compare and contrast Circular Queue with a Normal Queue (4)

OR

14. a) Write an algorithm to insert and delete elements from a Priority Queue (8)

b) Discuss an algorithm to convert an infix expression to a prefix expression (6)

15. a) Write an algorithm to multiply two polynomials represented using linked list (10)

b) How doubly linked list can be used to find palindromes ? (4)

OR

16. a) How is memory compaction (de-allocation) done in memory management ? (8)

b) Discuss the advantages and disadvantages of First-fit, Best-fit and Worst-fit allocation

schemes (6)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. a) List the properties of Binary Search Tree. Write an algorithm to search an element

from a Binary Search Tree (10)

b) Write an iterative algorithm for in-order traversal of a Binary Tree (4)

OR

18. a) Give algorithms for DFS and BFS of a graph and explain with examples (8)

b) How graphs can be represented in a Computer? (6)

19. a) Write algorithms for Merge sort and Quick Sort. (10)

b) Illustrate the working of Quick sort on the following input 38, 8, 0, 28, 45, -12, 89, 66,
42 (4)

OR

20. a) With examples discuss the different hash functions used for hashing (10)

b) Apply the hash function h(x) = x mod 7 for linear probing on the data 2341, 4234,
2839, 430, 22, 397, 3920 and show the resulting hash table (4)

Teaching Plan
Module 1 :Basic Concepts of Data Structures (5 hours)

1.1 System Life Cycle, 1 hour

1.2 Algorithms , Performance Analysis 1 hour

1.3 Space Complexity, Time Complexity 1 hour

1.4 Asymptotic Notation (Big O Notation) 1 hour

1.5 Complexity Calculation of Simple Algorithms 1hour

Module 2 :Arrays and Searching (10 hours)

2.1 Polynomial representation using Arrays 1 hour

2.2 Sparse matrix (Lecture 1) 1 hour

2.3 Sparse matrix (Lecture 2) 1 hour
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.4 Stacks 1 hour

2.5 Queues, Circular Queues 1 hour

2.6 Priority Queues, 1 hour

2.7 Double Ended Queues, 1 hour

2.8 Conversion and Evaluation of Expressions (Lecture 1) 1 hour

2.9 Conversion and Evaluation of Expressions (Lecture 2) 1 hour

2.10 Linear Search and Binary Search 1 hour

Module 3 : Linked List and Memory Management (12 hours)

3.1 Self Referential Structures 1 hour

3.2 Dynamic Memory Allocation 1 hour

3.3 Singly Linked List-Operations on Linked List, 1 hour

3.4 Doubly Linked List 1 hour

3.5 Circular Linked List 1 hour

3.6 Stacks using Linked List 1 hour

3.7 Queues using Linked List 1 hour

3.8 Polynomial representation using Linked List (Lecture 1) 1 hour

3.9 Polynomial representation using Linked List (Lecture2) 1 hour

3.10 Memory de-allocation 1 hour

3.11 Memory allocation-First-fit 1 hour

3.12 Best-fit and Worst-fit allocation schemes 1hour

Module 4 :Trees and Graphs (8 hours)

4.1 Trees, Binary Trees 1hour

4.2 Tree Operations, Binary Tree Representation, 1hour

4.3 Tree Traversals 1hour

4.4 Binary Search Trees 1hour

4.5 Binary Search Tree Operations 1hour

4.6 Graphs, Representation of Graphs 1hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.7 Depth First Search and Breadth First Search on Graphs 1hour
4.8 Applications of Graphs 1hour

Module 5 : Sorting and Hashing (10 hours)

5.1 Sorting Techniques – Selection Sort 1hour

5.2 Insertion Sort 1hour

5.3 Quick Sort 1hour

5.4 Merge Sort 1hour

5.5 Heap Sort 1hour

5.6 Hashing- Hashing Techniques 1hour

5.7 Collision Resolution 1hour

5.8 Overflow handling 1hour

5.9 Hashing functions – Mid square and Division methods 1hour

5.10 Folding and Digit Analysis methods 1hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CST LOGIC SYSTEM Category L T P Credit Year of Introduction

203 DESIGN PCC 3 1 0 4 2019

Preamble: The objective of the course is to familiarize learners with the basic concepts of
Boolean algebra and digital systems. This course covers the design of simple combinational and
sequential logic circuits, representation and arithmetic algorithms for Binary, BCD (Binary
Coded Decimal) and Floating point numbers which in turn are helpful in understanding
organization & design of a computer system and understanding how patterns of ones and zeros
can be used to store information on computers, including multimedia data.

Prerequisite: Nil

Course Outcomes: After the completion of the course the student will be able to

CO# CO

Illustrate decimal, binary, octal, hexadecimal and BCD number systems, perform
conversions among them and do the operations - complementation, addition,
CO1
subtraction, multiplication and division on binary numbers (Cognitive Knowledge
level: Understand)

Simplify a given Boolean Function and design a combinational circuit to implement

CO2 the simplified function using Digital Logic Gates (Cognitive Knowledge level:
Apply)
Design combinational circuits - Adders, Code Convertors, Decoders, Magnitude
CO3 Comparators, Parity Generator/Checker and design the Programmable Logic Devices -
ROM and PLA. (Cognitive Knowledge level: Apply)

Design sequential circuits - Registers, Counters and Shift Registers. (Cognitive

CO4
Knowledge level: Apply)

Use algorithms to perform addition and subtraction on binary, BCD and floating point
CO5
numbers (Cognitive Knowledge level: Understand)
 ARTIFICIAL
Mapping of course outcomes with INTELLIGENCE AND MACHINE LEARNING
program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern:

End Semester
Bloom’s Category Test 1 (%) Test 2 (%)
Examination Marks (%)

Remember 20 20 20
Understand 35 35 35

Apply 45 45 45
Analyse

Evaluate
Create
Mark Distribution: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

SYLLABUS
Module I
Number systems, Operations & Codes
Decimal, Binary, Octal and Hexadecimal Number Systems- Number Base Conversions.
Addition, Subtraction, Multiplication and Division of binary numbers. Representation of
negative numbers- Complements, Subtraction with complements. Addition and subtraction of
BCD, Octal and Hexadecimal numbers. Binary codes- Decimal codes, Error detection codes,
Reflected code, Character coding schemes – ASCII, EBCDIC.

Module II
Boolean Algebra
Postulates of Boolean Algebra. Basic theorems and Properties of Boolean Algebra. Boolean
Functions - Canonical and Standard forms. Simplification of Boolean Functions- Using
Karnaugh- Map Method (upto five variables), Don’t care conditions, Product of sums
simplification, Tabulation Method.ARTIFICIAL INTELLIGENCE
Digital Logic AND MACHINE
Gates- Implementation LEARNING
of Boolean functions
using basic and universal gates.

Module III
Combinational Logic Circuits
Design Procedure & Implementation of combinational logic circuits- Binary adders and
subtractors, Binary Parallel adder, Carry look ahead adder, BCD adder, Code converter,
Magnitude comparator, Decoder, Demultiplexer, Encoder, Multiplexer, Parity generator/
Checker.

Module IV
Sequential logic circuits:
Flip-flops- SR, JK, T and D. Triggering of flip-flops- Master slave flip- flops, Edge- triggered
flip- flops. Excitation table and characteristic equation. Registers- register with parallel load.
Counter design: Asynchronous counters- Binary and BCD counters, timing sequences and state
diagrams. Synchronous counters- Binary Up- down counter, BCD counter.

Module V
Shift registers
Shift registers – Serial In Serial Out, Serial In Parallel Out, Bidirectional Shift Register with
Parallel load. Ring counter. Johnson counter- timing sequences and state diagrams.

Arithmetic algorithms
Algorithms for addition and subtraction of binary numbers in signed magnitude and 2’s
complement representations. Algorithm for addition and subtraction of BCD numbers.
Representation of floating point numbers, Algorithm for addition and subtraction of floating
point numbers.

Programmable Logic devices

ROM. Programmable Logic Array(PLA)- Implementation of simple circuits using PLA.

Text Books:
1. M. Morris Mano, Digital Logic & Computer Design, 4/e, Pearson Education, 2013
2. Thomas L Floyd, Digital Fundamentals, 10/e, Pearson Education, 2009.
3. M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007.

Reference Books:
1. M. Morris Mano, Michael D Ciletti , Digital Design With An Introduction to the Verilog
HDL, 5/e, Pearson Education, 2013.
2. Donald D Givone, Digital Principles and Design, Tata McGraw Hill, 2003
Sample Course Level AssessmentARTIFICIAL
Questions INTELLIGENCE AND MACHINE LEARNING

Course Outcome1(CO1): Perform the following number base conversions:

a) (250.55)
! 10 to Hexadecimal b) (357)
! 8 to Decimal

Course Outcome 2(CO2): Given a Boolean function F and don’t care conditions D, using
Karnaugh map obtain the simplified expression in (i) SOP and (ii) POS:
! F(A, B, C, D) = A′B′D′ + A′CD + A′BC
! D(A, B, C, D) = A′BC′D + ACD + A B′D

Course Outcome 3(CO3): Design a BCD to Excess-3 Code Convertor.

Course Outcome 4(CO4): Design a 4- bit binary ripple counter.

Course Outcome 5(CO5): Demonstrate floating-point addition algorithm.

 ARTIFICIAL INTELLIGENCE
Model Question Paper AND MACHINE LEARNING
QP CODE: PAGES: 2

Reg No:_______________
Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH

DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 203

Course name : LOGIC SYSTEM DESIGN

Max Marks: 100 Duration: 3 Hours

PART-A

(Answer All Questions. Each question carries 3 marks)

1. Represent the decimal numbers (459)10 and (859)10 in hexadecimal and perform

addition of these hexadecimal numbers.

2. Subtract (1101)
! 2 from !(11010)2 using: i) !2′s complement and ii) 1′
! s complement
arithmetic.

3. Find the dual and complement of the boolean function F

! = A B′ + B(A + B′).

4. Using K-map, reduce the expression: A

! B + A BC + A BC + BC.

5. Design a half subtractor with NAND gates only.

6. Design a combinational circuit that multiplies an input decimal digit by 5 represented in

BCD. The output is also in BCD. Show that the outputs can be obtained from the input
lines without using any logic gates.
7. Differentiate between ripple counter and synchronous counter.

8. Construct D flip- flop using NAND gates. Also give its truth table.
9. Explain how a shift register is used for serial data transfer?

10. Write short notes on ROM.

PART-B
(Answer any one full question from each module) (14X5=70)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

11. (a) Perform the following operations using 2’s complement arithmetic: (8)
(i) !8810 + (−37)10 (ii) !(−20)10 + (−12)10

(b) Perform the following base conversions: (i) (101011.11)

! 2 to octal (6)
(ii) (3F 9B)16 to binary (iii) (121)10 to binary (iv) (3077)8 to binary

OR

12. (a) Find the 12 bit 2′

! s complement representation of the following decimal (6)
numbers.
(i) – 97 (ii) – 224 (iii) - 197.5

(b) Perform the following operations (8)

(i) (520)8 + (488)8 (ii) (520)16 − (488)16

13. (a) Prove that (i) A! B + A(B + C ) + B(B + C ) = B + AC (4)

(ii) A
! B + A(B + C ) + B(B + D) = A

(b) Using K-map, simplify the Boolean function F in sum of products form, (10
using the don’t care conditions d:
!F(w, x, y, z) = w′(x′y + x′y′ + x yz) + x′z′(y + w)
!d(w, x, y, z) = w′ x (y′z + yz′) + w yz

OR
14. (a) Simplify the following expressions using Karnaugh- map method. (8)
(i) !F = Σ(0,2,4,6,9,11,13,15,17,21,25,27,29,31)
(ii) !F = Π(0,2,5,7)

(b) Convert the following to the other canonical form: (6)

∑
(i) !F(x, y, z, a) = (1,3,7)

(ii) !F(x, y, z) = Π(0,3,6,7)

(iii) F(A,
! B, C, D) = Π(0,1,2,3,4,6,12)

15. (a) Implement Full adder circuit using NAND gate only. (4)

(b) Design a code converter for converting BCD to Excess 3 code (10)
OR

16. (a) With a neat diagram explain 4-bit carry look-ahead adder. (6)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(b) Design a Gray to binary code converter using a 4x1 MUX. Draw the (8)
circuit diagram and explain.

17. (a) Design a counter that count the states 0,3,5,6,0… using T flip- flops. (10)

(b) Write the characteristics equation, excitation table of JK, T and D flipflop. (4)
OR

18. (a) Explain race around condition and how it can be avoided. (6)
(b) Design a synchronous Binary Up-Down Counter. (8)

19. (a) With a neat diagram explain universal shift register. (8)

(b) Explain Johnson Counter with timing diagram. (6)

OR

20. (a) Write algorithm for floating point addition and subtraction. (8)
(b) Implement the functions Y
! 1 = A B′C′ + A B′C + A BC and Y
! 2 = BC + AC (6)
using minimum gates Programmable Logic Array.

Teaching Plan

(7
Module 1: Number systems, Operations & Codes (No algorithms)
hours)
Number Systems: Decimal, Binary, Octal and Hexadecimal number systems,
1.1 1 hour
Number Base Conversions.

Binary Arithmetic: Addition, Subtraction, Multiplication & Division of

1.2 1 hour
Binary Numbers. (Lecture 1)

Addition, Subtraction, Multiplication & Division of Binary Numbers. (Lecture

1.3 1 hour
2)
Representation of Negative Numbers- Complements, subtraction with 1 hour
1.4
complements.

1.5 BCD Arithmetic: Addition and Subtraction of BCD Numbers 1 hour

Octal and Hexadecimal Arithmetic: Addition & Subtraction of Octal and

1.6 1 hour
Hexadecimal Numbers.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Binary Codes: Decimal Codes, Error detection codes, Reflected code,
1.7 1 hour
Character Coding Schemes-ASCII, EBCDIC
(9
Module 2: Boolean Algebra
hours)
2.1 Introduction to Boolean Algebra: Postulates of Boolean Algebra 1 hour

2.2 Basic theorems and Properties of Boolean Algebra 1 hour

2.3 Boolean Functions: Canonical and Standard Forms 1 hour

2.4 Simplification of Boolean Functions: Karnaugh -Map Method (upto five 1 hour
variables), Don’t care conditions (Lecture 1)
Simplification of Boolean Functions: Karnaugh -Map Method (upto five
2.5 1 hour
variables), Don’t care conditions (Lecture 2)

2.6 Product of sums simplification 1 hour

2.7 Tabulation method 1 hour

Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR,
2.8 Implementation of Boolean functions using basic and universal gates. (Lecture 1 hour
1)
Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR,
2.9 Implementation of Boolean functions using basic and universal gates. (Lecture 1 hour
2)
(9
Module 3: Combinational Logic Circuits
hours)

3.1 Design Procedure & Implementation of Combinational Circuits 1 hour

Binary Adders:
3.2 1 hour
Implementation of Half Adder, Full Adder
Binary Subtractors:
3.3 1 hour
Implementation of Half Subtractor, Full Subtractor

Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
3.4 1 hour
(Lecture 1)

Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
3.5 1 hour
(Lecture 2)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Implementation of Various Combinational Circuits:
3.6 1 hour
Code Converters, Magnitude Comparator

3.7 Implementation of Decoder, Demultiplexer 1 hour

3.8 Implementation of Encoder, Multiplexer 1 hour

3.9 Implementation of Parity Generator/Checker 1 hour

(9
Module 4: Sequential logic circuits:
hours)
Flip flops:
4.1 1 hour
SR, JK, T and D flip- flops (Lecture 1)

4.2 SR, JK, T and D flip- flops (Lecture 2) 1 hour

Triggering of flip-flops- Master slave flip- flop, Edge- triggered flip-flops

4.3 1 hour
(Lecture 1)

Triggering of flip-flops- Master slave flip- flop, Edge- triggered flip-flops

4.4 1 hour
(Lecture 2)

4.5 Excitation table and characteristic equations of flip- flops 1 hour

4.6 Registers- Register with parallel load 1 hour

Counter Design:
4.7 Asynchronous counters- Binary and BCD counters- timing sequences and state 1 hour
diagrams. (Lecture 1)
Asynchronous counters- Binary and BCD counters- timing sequences and state
4.8 1 hour
diagrams. (Lecture 2)

4.9 Synchronous counters- Binary Up- down counter, BCD counter 1 hour

(11
Module 5: Shift registers, Arithmetic algorithms & PLD’s
hours)

5.1 Shift Registers - Serial In Serial Out, Serial In Parallel Out. 1 hour

5.2 Bidirectional Shift Register with Parallel load 1 hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Shift register counters - Ring Counter, Johnson Counter- timing sequences
5.3 1 hour
and state diagrams

Arithmetic Algorithms: Algorithm for addition and subtraction of binary

5.4 1 hour
numbers in Signed magnitude and 2’s complement representations (Lecture 1)

Algorithm for addition and subtraction of binary numbers in Signed magnitude

5.5 1 hour
and 2’s complement representations (Lecture 2)

5.6 Algorithm for addition and subtraction of BCD numbers 1 hour

5.7 Representation of floating point numbers (IEEE Standard representations). 1 hour

5.8 Algorithms for floating point addition and subtraction 1 hour

5.9 Programmable Logic devices - ROM 1 hour

5.10 PLA, Implementation of simple circuits using PLA(Lecture 1) 1 hour

5.11 PLA, Implementation of simple circuits using PLA(Lecture 2) 1 hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OBJECT ORIENTED YEAR OF

CST CATEGORY L T P CREDIT
PROGRAMMING INTRODUCTION
205
USING JAVA
PCC 3 1 0 4 2019

Preamble: The purpose of this course is to enable learners to solve problems by breaking
it down to object level while designing software and to implement it using Java. This course
covers Object Oriented Principles, Object Oriented Programming in Java, Inheritance,
Exception handling, Event handling, multithreaded programming and working with
window-based graphics. This course helps the learners to develop Desktop GUI
Applications, Mobile applications, Enterprise Applications, Scientific Applications and Web
based Applications.

Prerequisite: Topics covered under the course PROGRAMMING IN C (EST 102)

Course Outcomes: After the completion of the course the student will be able to

Write Java programs using the object oriented concepts - classes, objects,
CO1 constructors, data hiding, inheritance and polymorphism (Cognitive Knowledge
Level: Apply)

Utilise datatypes, operators, control statements, built in packages & interfaces, Input/
CO2 Output Streams and Files in Java to develop programs (Cognitive Knowledge Level:
Apply)
Illustrate how robust programs can be written in Java using exception handling
CO3
mechanism (Cognitive Knowledge Level: Understand)

Write application programs in Java using multithreading and database connectivity

CO4
(Cognitive Knowledge Level: Apply)
Write Graphical User Interface based application programs by utilising event
CO5
handling features and Swing in Java (Cognitive Knowledge Level: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester Examination

Bloom’s Category
Test1 (Marks %) Test2 (Marks %) Marks (% )

Remember 30 30 30
Understand 30 30 30

Apply 40 40 40
Analyse

Evaluate
Create
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First series test shall be preferably conducted after completing the first half of the syllabus and
the second series test shall be preferably conducted after completing remaining part of the
syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly covered module), each with 7 marks.
Out of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A
contains 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions. Part B contains 2 questions from each module of which
a student should answer any one. Each question can have maximum 2 sub-divisions and carry 14
marks.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Object Oriented Programming Using Java

Module 1

Introduction:
Approaches to Software Design - Functional Oriented Design, Object Oriented Design, Case
Study of Automated Fire Alarm System.
Object Modeling Using Unified Modeling Language (UML) – Basic Object Oriented concepts,
UML diagrams, Use case model, Class diagram, Interaction diagram, Activity diagram, State
chart diagram.
Introduction to Java - Java programming Environment and Runtime Environment, Development
Platforms -Standard, Enterprise. Java Virtual Machine (JVM), Java compiler, Bytecode, Java
applet, Java Buzzwords, Java program structure, Comments, Garbage Collection, Lexical Issues.

Module 2

Core Java Fundamentals:

Primitive Data types - Integers, Floating Point Types, Characters, Boolean. Literals, Type
Conversion and Casting, Variables, Arrays, Strings, Vector class.
Operators - Arithmetic Operators, Bitwise Operators, Relational Operators, Boolean Logical
Operators, Assignment Operator, Conditional (Ternary) Operator, Operator Precedence.
Control Statements - Selection Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring Objects, Object
Reference, Introduction to Methods, Constructors, this Keyword, Method Overloading, Using
Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members, Final
Variables, Inner Classes, Command Line Arguments, Variable Length Arguments.
Inheritance - Super Class, Sub Class, The Keyword super, protected Members, Calling Order of
Constructors, Method Overriding, the Object class, Abstract Classes and Methods, using final
with Inheritance.
Module 3

More features of Java:

Packages and Interfaces - Defining Package, CLASSPATH, Access Protection, Importing
Packages, Interfaces.
Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block and catch Clause,
Multiple catch Clauses, Nested try Statements, throw, throws and finally.
Input/Output - I/O Basics, Reading Console Input, Writing Console Output, PrintWriter Class,
Object Streams and Serialization, Working with Files.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 4
Advanced features of Java:
Java Library - String Handling – String Constructors, String Length, Special String Operations -
Character Extraction, String Comparison, Searching Strings, Modifying Strings, using valueOf(),
Comparison of StringBuffer and String.
Collections framework - Collections overview, Collections Interfaces- Collection Interface, List
Interface.
Collections Class – ArrayList class. Accessing a Collection via an Iterator.
Event handling - Event Handling Mechanisms, Delegation Event Model, Event Classes, Sources
of Events, Event Listener Interfaces, Using the Delegation Model.
Multithreaded Programming - The Java Thread Model, The Main Thread, Creating Thread,
Creating Multiple Threads, Synchronization, Suspending, Resuming and Stopping Threads.

Module 5

Graphical User Interface and Database support of Java:

Swings fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls,
Components and Containers, Swing Packages, Event Handling in Swings, Swing Layout
Managers, Exploring Swings –JFrame, JLabel, The Swing Buttons, JTextField.
Java DataBase Connectivity (JDBC) - JDBC overview, Creating and Executing Queries – create
table, delete, insert, select.

Text Books:

1. Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.
2. Rajib Mall, Fundamentals of Software Engineering, 4th edition, PHI, 2014.
3. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11th Edition, Pearson,
2018.

Reference Books:

1. Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013.

2. Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008.
3. Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005.
4. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004.
5. Sierra K., Head First Java, 2/e, O'Reilly, 2005.
6. Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome1(CO1): For the following passage develop UML diagrams and then
implement it as a Java program in accordance with your UML design.

Passage: College Office collects semester fee and college bus fee for each student. A
clerk at the college office collects the fees from each student. The bus fee is calculated
depending on the distance of the corresponding bus stop from the college. The semester
fee varies depending upon the semester as well as branch of each student. Students are
supposed to pay the fees in full. Economically backward students are eligible for 50%
discount in semester fee. The consolidated fees receipt is issued to each student by the
clerk, which contains the student name, admission number, semester and branch of
student along with details of fees collected. Students can log in and view the details of
fees remitted and dues if any. The system allows students and clerk level login to the
system. Clerk is able to view reports of each class showing status of fees payment of
each student.

Course Outcome 2(CO2): Write a Java program to evaluate a post fix expression
containing two operands and a single operator using stack. Stack should be implemented
as a separate entity so as to reflect OOP concepts.

Course Outcome 3(CO3): Write a program to demonstrate the start, run, sleep and join
methods in Thread class.

Course Outcome 4(CO4): Write a GUI based program with separate buttons to add,
delete and display student details i.e. name, student ID, current semester and branch of
study based on student ID.

Course Outcome 5(CO5): Using Swing create a JFrame with a JLabel and two
JButtons. Set the texts of JButtons as “Yes” and “No” respectively. Set the JLabel’s text
to the text of the button currently being pressed. Initially the JLabel’s text is blank.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES:3

Reg No:_______________

Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

THIRD SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 205

Course Name: Object Oriented Programming using Java

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Briefly explain the portable, secure and robust features of Java.

2. Describe the concepts of object and class with a suitable Java program.
3. Explain the concept of method overriding with an example.
4. What is the use of the keyword final in Java?
5. Explain the concept of streams.
6. Explain any two applications of Serialization.
7. Distinguish the usage of “==” and equals() method when comparing String type?
8. What are Collections in Java? Explain any one Collection interface in Java.
9. Explain any two properties of Swing components in Java.
10. Explain JLabel component. With suitable examples explain any two of its constructors.
Part B
Answer any one question completely from each module

11.
(a) Describe in detail any three Object Oriented Programming principles. Illustrate with
suitable examples.
(9)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) What is Java Runtime Environment? What is the role of Java Virtual Machine in it?
(5)
OR
12.
(a) Compare and contrast Java standard edition and Java enterprise edition.
(5)
(b) Why is Java considered to be platform independent? What is the role of Bytecode in
making Java platform independent?
(9)

13.
(a) Explain in detail the primitive data types in Java.
(8)
(b) Explain automatic type conversion in Java with an example. What are the two
conditions required for it?
(6)
OR
14.
(a) Using a suitable Java program explain the difference between private and public
members in the context of inheritance.
(8)
(b) Is it possible to use the keyword super within a static method? Give justification for
your answer.
(6)

15.
(a) Explain in detail about byte streams and character streams with suitable code
samples.
(6)
(b) Describe in detail about exception handling, try block and catch clause with the help
of a suitable Java program.
(8)
OR
16.
(a) Explain object streams in Java. Explain the role of Serializable interface with a
suitable code sample.
(8)
(b) Explain throw, throws and finally constructs with the help of a Java program.
(6)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17.
(a) Describe in detail the creation of a thread using the Runnable interface and the
Thread class with suitable examples.
(10)
(b) Explain List Interface. Mention any two exceptions thrown by its methods.
(4)
OR
18.
(a) Explain in detail the Delegation Event model for event handling in Java.
(7)
(b) Write a simple program by extending appropriate class to demonstrate the working of
threads in java.
(7)

19.
(a) Write a Java program to demonstrate the use of JLabel and JButton by adding them
to JFrame.
(7)
(b) Explain step-by-step procedure of using Java DataBase Connectivity in Java
programs.
(7)
OR
20.
(a) Explain the class hierarchy of Java Swing components.
(7)
(b) Write a Java Program to create a student table and to add student details to it using
JDBC.
(7)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

Module 1 : Introduction (8 hours)

Approaches to Software Design- Functional Oriented Design, Object-

1.1 1 hour
Oriented Design, Case Study of Automated Fire Alarm System.
1.2 Object Modeling Using UML – Basic object oriented concepts 1 hour

1.3 Basic object oriented concepts 1 hour

1.4 UML diagrams, Use case model 1hour

1.5 Class diagram, Interaction diagram 1hour

1.6 Activity diagram, State chart diagram 1hour

Java programming Environment and Runtime Environment,

1.7 Development Platforms -Standard, Enterprise. JVM, Java compiler, 1hour
Bytecode
Java applet, Java Buzzwords, Java program structure, Comments,
1.8 1hour
Garbage Collection, Lexical Issues

Module 2: Core Java Fundamentals (11 hours)

Core Java Fundamentals: Primitive Data types, Integers, Floating
2.1 1 hour
Point Types, Characters, Boolean

Literals, Type Conversion and Casting, Variables, Arrays, Strings,

2.2 1 hour
Vector class.
Operators: Arithmetic Operators, Bitwise Operators, Relational
2.3 Operators, Boolean Logical Operators, Assignment Operator, 1 hour
Conditional (Ternary) Operator, Operator Precedence.

Control Statements: Selection Statements, Iteration Statements and

2.4 1 hour
Jump Statements.
Object Oriented Programming in Java: Class Fundamentals, Declaring
2.5 1 hour
Objects, Object Reference, Introduction to Methods

Constructors, this Keyword, Method Overloading, Using Objects as

2.6 1 hour
Parameters
2.7 Returning Objects, Recursion, Access Control, static Members 1 hour
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Final Variables, Inner Classes, Command-Line Arguments, Variable

2.8 1 hour
Length Arguments
Inheritance : Super class, Sub class, the keywords super, protected
2.9 1 hour
Members,

2.10 Calling Order of Constructors, Method Overriding, the Object class, 1 hour
2.11 Abstract Classes and Methods, Using final with Inheritance 1 hour

Module 3: More features of Java (8 hours)

Packages and Interfaces: Defining Package, CLASSPATH, Access
3.1 1 hour
Protection, Importing Packages

3.2 Interfaces 1 hour

Input / Output: I/O Basics, Reading Console Input, Writing Console
3.3 1 hour
Output, PrintWriter Class
3.4 Object Streams and Serialization 1 hour
3.5 Working with Files 1 hour

Exception Handling: Checked Exceptions, Unchecked Exceptions, try

3.6 1 hour
Block and catch Clause
3.7 Multiple catch Clauses, Nested try Statements 1 hour
3.8 throw, throws and finally 1 hour
Module 4:Advanced features of Java (10 hours)

Java Library: String Handling – String Constructors, String Length,

4.1 1hour
Special String Operations
Character Extraction, String Comparison, Searching Strings,
4.2 Modifying Strings Using valueOf( ), Comparison of String Buffer 1hour
and String.

Collections framework – Collections overview, Collections Interfaces-

4.3 1hour
Collection Interface
4.4 List Interface, Collections Class – ArrayList Class 1hour

4.5 Accessing Collections via an Iterator. 1hour

Event handling: Event Handling Mechanisms, Delegation Event
4.6 1hour
Model

4.7 Delegation Event Model, Event Classes 1hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sources of Events, Event Listener Interfaces, Using the Delegation

4.8 1hour
Model
Multithreaded Programming: The Java Thread Model, The Main
4.9 1hour
Thread, Creating Thread

Creating Multiple Threads, Synchronization, Suspending, Resuming

4.10 1hour
and Stopping Threads.
Module 5: Graphical User Interface and Database support of Java (8 hours)

5.1 Swings fundamentals, Swing Key Features 1hour

5.2 MVC, Swing Controls, Components and Containers 1hour

5.3 Swing Packages, Event Handling in Swings. 1 hour

5.4 Swing Layout Managers 1hour

5.5 Exploring Swings –JFrame, JLabel, The Swing Buttons, JTextField. 1 hour
JDBC overview, Creating and Executing Queries – create table,
5.6 1hour
delete, insert, select (Basics only, DBMS course is not a prerequisite).

5.7 Creating and Executing Queries – create table, delete, insert, select. 1 hour
5.8 Creating and Executing Queries – create table, delete, insert, select. 1 hour
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
DATA STRUCTURES CATEGORY L T P CREDIT INTRODUCTION
CSL201
LAB
PCC 0 0 3 2 2019

Preamble: The aim of the Course is to give hands-on experience for Learners on creating and
using different Data Structures. Data Structures are used to process data and arrange data in
different formats for many applications. The most commonly performed operations on
data structures are traversing, searching, inserting, deleting and few special operations like
merging and sorting.

Prerequisite: Topics covered under the course Programming in C (EST 102)

Write a time/space efficient program using arrays/linked lists/trees/graphs to provide

CO1 necessary functionalities meeting a given set of user requirements (Cognitive
Knowledge Level: Analyse)

Write a time/space efficient program to sort a list of records based on a given key in
CO2
the record (Cognitive Knowledge Level: Apply)
Examine a given Data Structure to determine its space complexity and time
CO3
complexities of operations on it (Cognitive Knowledge Level: Apply)

CO4 Design and implement an efficient data structure to represent given data (Cognitive
Knowledge Level: Apply)

Write a time/space efficient program to convert an arithmetic expression from one

CO5
notation to another (Cognitive Knowledge Level: Apply)
Write a program using linked lists to simulate Memory Allocation and Garbage
CO6
Collection (Cognitive Knowledge Level: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment Test End Semester

Bloom’s Category
(Internal Exam)Percentage Examination Percentage

Remember 20 20
Understand 20 20

Apply 60 60
Analyse

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva-voce : 15 marks

Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks, Program
20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be converted out of
15 while calculating Internal Evaluation marks.

End Semester Examination Pattern: The marks will be distributed as Algorithm 30 marks,
Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be converted out
of 75 for End Semester Examination.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Operating System to Use in Lab : Linux

Compiler/Software to Use in Lab : gcc

Programming Language to Use in Lab : Ansi C

Fair Lab Record:

All Students attending the Data Structures Lab should have a Fair Record. The fair record should
be produced in the University Lab Examination. Every experiment conducted in the lab should
be noted in the fair record. For every experiment in the fair record the right hand page should
contain Experiment Heading, Experiment Number, Date of Experiment, Aim of Experiment,
Data Structure used and the operations performed on them, Details of Experiment including
algorithm and Result of Experiment. The left hand page should contain a print out of the code
used for the experiment and sample output obtained for a set of input.

SYLLABUS

1. Implementation of Polynomials and Sparse matrices using arrays**

2. Implementation of Stack , Queues, Priority Queues, DEQUEUE and Circular Queues
using arrays**

3. Application problems using stacks: Conversion of expression from one notation to

another notation . **

4. Implementation of various linked list operations. **

5. Implementation of stack, queue and their applications using linked list.pression

6. Implementation of trees using linked list

7. Representation of polynomials using linked list, addition and multiplication of

polynomials. **

8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion
and traversal. **

9. Implementation of binary search trees – creation, insertion, deletion, search

10. Any application programs using trees

11. Implementation of sorting algorithms – bubble, insertion, selection, quick, merge sort
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

and heap sort.**

12. Implementation of searching algorithms – linear search, binary search.**

13. Representation of graphs and computing various parameters (in degree, out degree etc.) -
adjacency list, adjacency matrix.

14. Implementation of BFS and DFS for each graph representations.**

15. Implementation of hash table using your own mapping functions and observe collisions
and overflow resolving schemes.**

16. Simulation of first-fit, best-fit and worst-fit allocations.

17. Simulation of a basic memory allocator and garbage collector using doubly linked list.
** mandatory.

DATA STRUCTURES LAB - PRACTICE QUESTIONS

1. Write a program to read two polynomials and store them in an array. Calculate the sum of the
two polynomials and display the first polynomial, second polynomial and the resultant
polynomial.

2. C Write a program to enter two matrices in normal form . Write a function to convert two
matrices to tuple form and display it. Also find the transpose of the two matrices represented
in tuple form and display it. Find the sum of the two matrices in tuple form and display the
sum in tuple form.

3. Write a program to enter two matrices in normal form . Write a function to convert two
matrices to tuple form and display it. Also find the transpose of the two matrices represented
in tuple form and display it. Find the sum of the two matrices in tuple form and display the
sum in tuple form.

4. Implement a circular queue using arrays with the operations:

4.1.Insert an element to the queue.
4.2.Delete an elements from the queue.
4.3.Display the contents of the queue after each operation.

5. Implement a Queue using arrays with the operations:

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.1.Insert elements to the Queue.

5.2.Delete elements from the Queue.
5.3.Display the contents of the Queue after each operation.

6. Implement a Stack using arrays with the operations:

6.1.Pushing elements to the Stack.
6.2.Popping elements from the Stack
6.3.Display the contents of the Stack after each operation.

7. Implement a Priority Queue using arrays with the operations:

7.1.Insert elements to the Priority Queue.
7.2.Delete elements from the Priority Queue.
7.3.Display the contents of the Priority Queue after each operation.

8. Implement a Double-Ended Queue (DEQUEUE) with the operations:

8.1.Insert elements to the Front of the queue.
8.2.Insert elements to the Rear of the queue
8.3.Delete elements from the Front of the queue.
8.4.Delete elements from the Rear of the queue.
8.5.Display the queue after each operation.

9. Using stack convert an infix expression to a postfix expression and evaluate the postfix
expression.

10. Write a program to convert an infix expression to a prefix expression using stacks.

11. Convert an infix expression to a postfix expression without using a stack

12. Write a menu driven program for performing the following operations on a Linked List:
12.1.Display
12.2.Insert at Beginning
12.3.Insert at End
12.4.Insert at a specified Position
12.5.Delete from Beginning
12.6.Delete from End
12.7.Delete from a specified Position

13. Implement a stack using linked list with the operations:

13.1.Push elements to the queue.
13.2.Pop elements from the queue.
13.3.Display the queue after each operation.

14. Implement a Queue using linked list with the operations:

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

14.1.Insert an elements to the queue.

14.2.Delete an elements from the queue.
14.3.Display the queue after each operation.

15. Write a program to reverse the content of queue using stack

16. Write a program to read two polynomials and store them using linked list. Calculate the sum
of the two polynomials and display the first polynomial, second polynomial and the resultant
polynomial.

17. Write a program to read two polynomials and store them using linked list. Find the product
of two polynomials and store the result using linked list. Display the resultant polynomial.

18. Write a program for addition of polynomials containing two variables using linked list.

19. The details of students(number, name, total-mark) are to be stored in a linked list. Write
functions for the following operations:
19.1.Insert
19.2.Delete
19.3.Search
19.4.Sort on the basis of number
19.5.Display the resultant list after every operation

20. Create a Doubly Linked List from a string taking each character from the string. Check if the
given string is palindrome in an efficient method.

21. Create a binary tree with the following operations

21.1.Insert a new node
21.2.Inorder traversal.
21.3.Preorder traversal.
21.4.Postorder traversal.
21.5.Delete a node.

22. Write a program to create a binary search tree and find the number of leaf nodes

23. Create a binary search tree with the following operations:

23.1.Insert a new node .
23.2.Inorder traversal.
23.3.Preorder traversal.
23.4.Postorder traversal.
23.5.Delete a node.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

24. Write a program to sort a set of numbers using a binary tree.

25. Represent any given graph and

25.1.Perform a depth first search .
25.2.Perform a breadth first search

26. Create a text file containing the name, height, weight of the students in a class. Perform
Quick sort and Merge sort on this data and store the resultant data in two separate files. Also
write the time taken by the two sorting methods into the respective files.
Eg. Sony Mathew 5.5 60
Arun Sajeev 5.7 58
Rajesh Kumar 6.1 70

27. Write a program to sort a set of numbers using Heap sort and find a particular number from
the sorted set using Binary Search.

28. Implement a Hash table using Chaining method. Let the size of hash table be 10 so that the
index varies from 0 to 9.

29. Implement a Hash table that uses Linear Probing for collision resolution
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OBJECT ORIENTED YEAR OF

CSL CATEGORY L T P CREDIT
PROGRAMMING INTRODUCTION
203
LAB (IN JAVA)
PCC 0 0 3 2 2019

Preamble: The aim of the course is to provide hands-on experience to the learners on various
object oriented concepts in Java Programming. This course helps the learners to enhance the ca-
pability to design and implement various Java applications for real world problems.

Prerequisite: Topics covered under the course Programming in C (EST 102)

Course Outcomes:

At the end of the course, the student should be able to

Implement the Object Oriented concepts - constructors, inheritance, method

CO1 overloading & overriding and polymorphism in Java (Cognitive Knowledge Level:
Apply)
Implement programs in Java which use datatypes, operators, control statements,
CO2 built in packages & interfaces, Input/Output streams and Files (Cognitive
Knowledge Level: Apply)

Implement robust application programs in Java using exception handling

CO3
(Cognitive Knowledge Level: Apply)
Implement application programs in Java using multithreading and database
CO4
connectivity (Cognitive Knowledge Level: Apply)

Implement Graphical User Interface based application programs by utilizing event

CO5
handling features and Swing in Java (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1 ! ! ! ! ! ! ! !

CO2 ! ! ! ! ! ! ! !

CO3 ! ! ! ! ! ! ! !

CO4 ! ! ! ! ! ! ! !

CO5 ! ! ! ! ! ! ! !
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
End Semester Examination
Bloom’s Category Test - Internal Exam
(Percentage)
(Percentage)

Remember 20 20
Understand 20 20

Apply 60 60
Analyse

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 75 75 3 hours
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva-voce : 15 marks

Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks, Pro-
gram 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be con-
verted out of 15 while calculating Internal Evaluation marks.

End Semester Examination Pattern: The marks will be distributed as Algorithm 30

marks, Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be
converted out of 75 for End Semester Examination.

Operating System to Use in Lab : Linux

Compiler/Software to Use in Lab : gcc, javac, jdk, jre, Eclipse, NetBeans,

MySQL / PostgreSQL.

Programming Language to Use in Lab : Java

Fair Lab Record:

All Students attending the Object Oriented Programming Lab (in Java) should have a Fair
Record. The fair record should be produced in the University Lab Examination. Every experi-
ment conducted in the lab should be noted in the fair record. For every experiment in the fair
record the right hand page should contain Experiment Heading, Experiment Number, Date of
Experiment, Aim of Experiment, Operations Performed, Details of Experiment including algo-
rithm and Result of Experiment. The left hand page should contain a print out of the code used
for the experiment and sample output obtained for a set of input.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

The syllabus contains six sessions (A, B, C, D, E, F). Each session consists of three concrete
Java exercises, out of which at least two questions are mandatory.

(A) Basic programs using datatypes, operators, and control statements in Java.

1) Write a Java program that checks whether a given string is a palindrome or not.
Ex: MALAYALAM is palindrome.
2) Write a Java Program to find the frequency of a given character in a string. **
3) Write a Java program to multiply two given matrices. **

(B) Object Oriented Programming Concepts: Problem on the use of constructors, inheritance,
method overloading & overriding, polymorphism and garbage collection:

4) Write a Java program which creates a class named 'Employee' having the following
members: Name, Age, Phone number, Address, Salary. It also has a method named 'print-
Salary( )' which prints the salary of the Employee. Two classes 'Officer' and 'Manager'
inherits the 'Employee' class. The 'Officer' and 'Manager' classes have data members 'spe-
cialization' and 'department' respectively. Now, assign name, age, phone number, address
and salary to an officer and a manager by making an object of both of these classes and
print the same. (Exercise to understand inheritance). **
5) Write a java program to create an abstract class named Shape that contains an empty
method named numberOfSides( ). Provide three classes named Rectangle, Triangle and
Hexagon such that each one of the classes extends the class Shape. Each one of the class-
es contains only the method numberOfSides( ) that shows the number of sides in the giv-
en geometrical structures. (Exercise to understand polymorphism). **
6) Write a Java program to demonstrate the use of garbage collector.

(C) Handling different types of files as well as input and output management methods:

7) Write a file handling program in Java with reader/writer.

8) Write a Java program that read from a file and write to file by handling all file related ex-
ceptions. **
9) Write a Java program that reads a line of integers, and then displays each integer, and the
sum of all the integers (Use String Tokenizer class of java.util). **

(D) Exception handling and multi-threading applications:

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

10) Write a Java program that shows the usage of try, catch, throws and finally. **
11) Write a Java program that implements a multi-threaded program which has three threads.
First thread generates a random integer every 1 second. If the value is even, second
thread computes the square of the number and prints. If the value is odd the third thread
will print the value of cube of the number.
12) Write a Java program that shows thread synchronization. **

(E) Graphics Programming:

13) Write a Java program that works as a simple calculator. Arrange Buttons for digits and
the + - * % operations properly. Add a text field to display the result. Handle any possible
exceptions like divide by zero. Use Java Swing. **
14) Write a Java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green. When a radio button is selected, the light is turned on,
and only one light can be on at a time. No light is on when the program starts. **
15) Write a Java program to display all records from a table using Java Database Connectivi-
ty (JDBC).

(F) Standard Searching and Sorting Algorithms using data structures and algorithms learned
from course Data Structures (CST 201):

16) Write a Java program for the following: **

1) Create a doubly linked list of elements.
2) Delete a given element from the above list.
3) Display the contents of the list after deletion.
17) Write a Java program that implements Quick sort algorithm for sorting a list of names in
ascending order. **
18) Write a Java program that implements the binary search algorithm.

** Mandatory
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PRACTICE QUESTIONS

1) Write a Java program to reverse an given string.

2) Write a Java program to display the transpose of a given matrix.
3) Write a Java program to find the second smallest element in an array.
4) Write a Java program to check whether a given number is prime or not.
5) Write a Java program to calculate the area of different shapes namely circle, rectangle,
and triangle using the concept of method overloading.
6) Write two Java classes Employee and Engineer. Engineer should inherit from Employee
class. Employee class to have two methods display() and calcSalary(). Write a program to
display the engineer salary and to display from Employee class using a single object in-
stantiation (i.e., only one object creation is allowed).
● display() only prints the name of the class and does not return any value. Ex. “ Name
of class is Employee.”
● calcSalary() in Employee displays “Salary of employee is 10000” and calcSalary() in
Engineer displays “Salary of employee is 20000.”
7) Write a Java program to illustrate Interface inheritance.
8) Write a Java program that shows how to create a user-defined exception.
9) Write a Java program to create two threads: One for displaying all odd number between 1
and 100 and second thread for displaying all even numbers between 1 and 100.
10) Write a Java program that shows thread priorities.
11) Write a Java program that reads a file and displays the file on the screen, with a line
number before each line.
12) Write a Java program that displays the number of characters, lines and words in a text
file.
13) Write a Java program for handling mouse events.
14) Write a Java program for handling key events using Adapter classes (general).
15) Write a Java program that allows the user to draw lines, rectangles and ovals.
16) Write a Java Swing program to print a wave form on the output screen.
17) Write a program to accept rollno, name, CGPA of “n” students and store the data to a
database using JDBC connectivity. Display the list of students having CGPA greater than
7. (Use MySQL /PostgreSQL).
18) Write a Java program to implement Heap sort algorithm using array.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER IV
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

MATHEMATICAL CATEGORY L T P CREDIT

CODE
FOUNDATIONS FOR
MAT216 BSC 3 1 0 4
MACHINE LEARNING

Preamble: This course enables the learners to understand the mathematical foundations of
Machine Learning concepts. This course covers Linear Algebra, Vector Calculus, Probability
& Distributions and Optimization. Concepts in this course help the learners to identify the
inherent assumptions & limitations of the current methodologies and develop new Machine
Learning solutions.

Prerequisite: A sound background in higher secondary school Mathematics.

Course Outcomes: After the completion of the course the student will be able to

Make use of the concepts, rules and results about linear equations, matrix algebra,
CO 1 vector spaces, eigenvalues & eigenvectors and orthogonality & diagonalization to
solve computational problems (Cognitive Knowledge Level: Apply)
Perform calculus operations on functions of several variables and matrices,
CO 2 including partial derivatives and gradients (Cognitive Knowledge Level: Apply)

Utilize the concepts, rules and results about probability, random variables, additive
& multiplicative rules, conditional probability, probability distributions and Bayes’
CO 3
theorem to find solutions of computational problems (Cognitive Knowledge Level:
Apply)
Train Machine Learning Models using unconstrained and constrained optimization
CO 4 methods (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO PO PO PO 4 PO 5 PO PO 7 PO 8 PO 9 PO PO 11 PO
1 2 3 6 10 12
CO 1 √ √ √ √ √
CO 2 √ √ √ √
CO 3 √ √ √ √ √
CO 4 √ √ √ √ √ √
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of

Accreditation
PO# Broad PO# Broad
PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category
1 2 Examination

Remember 20% 20% 20%

Understand 40% 40% 40%

Apply 40% 40% 40%

Analyse
Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Tests : 25 marks
Continuous Assessment Assignment : 15 marks
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer
all questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly covered module), each with 7 marks. Out
of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A
contains 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions. Part B contains 2 questions from each module of which
student should answer anyone. Each question can have maximum 2 sub-divisions and carries
14 marks.

Syllabus

Module 1

LINEAR ALGEBRA: Systems of Linear Equations – Matrices, Solving Systems of Linear

Equations. Vector Spaces –Vector Spaces, Linear Independence, Basis and Rank. Linear
Mappings – Matrix Representation of Linear Mappings, Change of Basis, Image space and
null (Kernel) space.

Module 2

ANALYTIC GEOMETRY, MATRIX DECOMPOSITIONS: Norms, Inner Products,

Lengths and Distances, Angles and Orthogonality, Orthonormal Basis, Orthogonal
Complement, Orthogonal Projections – Projection into One Dimensional Subspaces,
Projection onto General Subspaces.

Determinant and Trace, Eigenvalues and Eigenvectors, Cholesky Decomposition, Eigen

decomposition and Diagonalization, Singular Value Decomposition, Matrix Approximation.

Module 3

VECTOR CALCULUS : Differentiation of Univariate Functions - Partial Differentiation

and Gradients, Gradients of Vector Valued Functions, Gradients of Matrices, Useful
Identities for Computing Gradients. Back propagation and Automatic Differentiation –
Gradients in Deep Network, Automatic Differentiation. Higher Order Derivatives-
Linearization and Multivariate TaylorSeries.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 4

Probability and Distributions : Axiomatic definition of probability, Discrete and

Continuous random variables, Probability Space, Sum Rule, Product Rule, and Bayes’
Theorem. Summary Statistics and Independence – Gaussian Distribution - Conjugacy and the
Exponential Family.

Module 5

Optimization : Optimization Using Gradient Descent - Gradient Descent With Momentum,

Stochastic Gradient Descent. Constrained Optimization and Lagrange Multipliers - Convex
Optimization - Linear Programming - Quadratic Programming.

Text book:

1.Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal, and
Cheng Soon Ong published by Cambridge University Press (freely available at https://
mml - book.github.io)

Reference books:

1. Linear Algebra and Its Applications, 4th Edition by Gilbert Strang

2. Linear Algebra Done Right by Axler, Sheldon, 2015 published bySpringer

3. Introduction to Applied Linear Algebra by Stephen Boyd and Lieven Vandenberghe,

2018 published by Cambridge UniversityPress

4. Convex Optimization by Stephen Boyd and Lieven Vandenberghe, 2004 published by

Cambridge UniversityPress

5. Pattern Recognition and Machine Learning by Christopher M Bishop, 2006, published

bySpringer

6. Learning with Kernels – Support Vector Machines, Regularization, Optimization, and

Beyond by Bernhard Scholkopf and Smola, Alexander J Smola, 2002, published by
MIT Press

7. Information Theory, Inference, and Learning Algorithms by David J. C MacKay, 2003

published by Cambridge UniversityPress

8. Machine Learning: A Probabilistic Perspective by Kevin P Murphy, 2012 published by

MITPress.

9. The Nature of Statistical Learning Theory by Vladimir N Vapnik, 2000, published by

Springer
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Sample Course Level Assessment Questions.
Course Outcome 1 (CO1):
1. Find the set S of all solutions in x of the following linear systems Ax
= b, where A and b are defined as follows:

2. Determine the inverses of the following matrix if possible

3. Find the characteristic equation, eigenvalues, and eigen vectors corresponding to each
eigenvalue of the following matrix

4. Diagonalize the following matrix, if possible

5. Find the singular value decomposition (SVD) of the following matrix

Course Outcome 2 (CO2):

1. For a scalar function f(x, y, z ) = x2 +3y2 +2z2, find the gradient and its magnitude at
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
the point (1, 2, -1).
2. Find the maximum and minimum values of the function f(x,y)=4x+4y-x2-y2
subject to the condition x2 + y2 <= 2.
3. Suppose you were trying to minimize f(x, y) = x2+ 2y + 2y2. Along what vector
should you travel from (5,12)?
4. Find the second order Taylor series expansion for f(x, y) = (x + y)2about (0 ,0).
5. Find the critical points of f(x, y) = x2 –3xy+5x-2y+6y2+8.
6. Compute the gradient of the Rectified Linear Unit (ReLU) function ReLU(z) =
max(0 , z).
7. Let L = ||Ax - b||22, where A is a matrix and x and b are vectors. Derive dL in terms of

dx.

Course Outcome 3 (CO3):

1. Let J and T be independent events, where P(J)=0.4 andP(T)=0.7.

i. Find P(J∩T)

ii. Find P(JT)

iii. Find P(J∩T′)

2. Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A ∪ B)=0.5. Find
P(A∣B).
3. A random variable R has the probability distribution as shown in the followingtable:

i. Given that E(R)=2.85, find a and b.

ii. Find P(R>2).

4. A biased coin (with probability of obtaining a head equal to p> 0) is tossed repeatedly
and independently until the first head is observed. Compute the probability that the
first head appears at an even numbered toss.
5. Two players A and B are competing at a trivia quiz game involving a series of
questions. On any individual question, the probabilities that A and B give the correct
answer are p and q respectively, for all questions, with outcomes for different
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
questions being independent. The game finishes when a player wins by answering a
question correctly. Compute the probability that A winsif
i. A answers the firstquestion,

ii. B answers the first question.

6. A coin for which P(heads) = p is tossed until two successive tails are obtained. Find
the probability that the experiment is completed on the nth toss.

Course Outcome 4(CO4):

1. Find the extrema of f(x, y) = x subject to g(x, y) = x2 + 2y2 =3.

2. Maximize the function f(x, y, z) = xy + yz + xz on the unit sphere g(x, y, z) = x2 + y2 +

z2 =1.
3. Provide necessary and sufficient conditions under which a quadratic optimization
problem be written as a linear least squares problem.
4. Consider the univariate function f(x) = x3 + 6x2 - 3x - 5. Find its stationary points and
indicate whether they are maximum, minimum, or saddlepoints.
5. Consider the update equation for stochastic gradient descent. Write down the update
when we use a mini-batch size ofone.
6. Consider the function

i. Is f(x) a convex function? Justify youranswer.

ii. Is (1 , -1) a local/global minimum? Justify youranswer.

7. Is the function f(x, y) = 2x2 + y2 + 6xy - x + 3y - 7 convex, concave, or neither?

Justify youranswer.
8. Consider the following convex optimization problem

Subject to the constraint x + y >= 4, x, y >= 1.

Derive an explicit form of the Lagrangian dual problem.

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
9. Solve the following LP problem with the simplex method.

subject to the constraints

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Model Question paper

QP Code : Total Pages : 5

Reg No.:_______________ Name:__________________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
IV SEMESTER B.TECH DEGREE EXAMINATION, MONTH and YEAR
Course Code: MAT 216
Course Name: MATHEMATICAL FOUNDATIONS FOR MACHINE LEARNING
Max. Marks: 100 Duration: 3 Hours
PART A
Answer all questions, each carries3 marks. Marks
1 Show that with the usual operation of scalar multiplication but with addition
on reals given by x # y = 2(x + y) is not a vector space.
2 Are the following sets of vectors linearly independent? Explain your
answer.

3 1 1
Find the angle between the vectors 𝑥𝑥 = � �and 𝑦𝑦 = � �.
1 2
4 Find the eigen values of the following matrix in terms of k. Can you find an
eigen vector corresponding to each of the eigen values?

5 Let f(x, y, z) = xyer, where r = x2+z2-5. Calculate the gradient of f at the

point (1, 3, -2).
6 Compute the Taylor polynomials Tn, n =0 , ... , 5 of f(x) = sin(x) +
cos(x) at x0 = 0.
7 Let X be a continuous random variable with probability density function on
0 <= x <= 1 defined by f(x) = 3x2. Find the pdf of Y =X2.
8 Show that if two events A and B are independent, then A and B' are
independent.
9 Explain the principle of the gradient descent algorithm.
10 Briefly explain the difference between (batch) gradient descent and
stochastic gradient descent. Give an example of when you might prefer one
over the other.

PART B
Answer any one Question from each module. Each question carries 14 Marks
11 a) i.Find all solutions to the system of linear equations (4)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ii. Prove that all vectors orthogonal to [2,−3,1]T forms a subspace (4)
W of R3. What is dim (W) and why?
b) A set of n linearly independent vectors in Rn forms a basis. Does the set of (6)
vectors (2, 4,−3),(0, 1, 1),(0, 1,−1) form a basis for R3? Explain
yourreasons.

OR
𝑥𝑥1
12 a) Find all solutions in 𝑥𝑥 = �𝑥𝑥2� ∈ 𝑅𝑅 3 of the equation system 𝐴𝐴𝐴𝐴 = 12𝑥𝑥 , (7)
𝑥𝑥3
6 4 3
where 𝐴𝐴 = �6 0 9� and ∑3𝑖𝑖=1 xi = 1.
0 8 0
b) Consider the transformation T (x, y) = (x + y, x + 2y, 2x + 3y). Obtain ker T (7)
and use this to calculate the nullity. Also find the transformation matrix
forT.
13 a) What is meant by the least square solution to the equation Ax=b? Find the (7)
1 2 4
least square solution to the equation Ax=b, where 𝐴𝐴 = �1 3� and 𝑏𝑏 = �5�
0 0 6

b) Find the SVD of the matrix. (7)

2 2
� �
−1 −1

OR

14 a) i. Let L be the line through the origin in R2 that is parallel to the vector (6)
[3, 4]T. Find the standard matrix of the orthogonal projection onto L.
Also find the point on L which is closest to the point (7, 1) and find the
point on L which is closest to the point (-3 , 5).

ii. Find the rank-1 approximation of

b) i. Find an orthonormal basis of R3 consisting of eigenvectors for the (8)

following matrix, A.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ii. Find a 3×3 orthogonal matrix S and a 3×3 diagonal matrix D

such that A = SDST
15 a) A skieris on a mountain with equation z=100–0.4x2–0.3y2, where z (8)
denotes height.
i. The skier is located at the point with xy-coordinates (1, 1), and wants to
ski downhill along the steepest possible path. In which direction
(indicated by a vector (a, b) in the xy-plane) should the skier begin
skiing.
ii. The skier begins skiing in the direction given by the xy-vector (a, b)
you found in part (i), so the skier heads in a direction in space given by
the vector (a, b, c). Find the value of c.
b) Find the linear approximation to the function f(x,y) = 2 - sin(-x - 3y) at the (6)
point (0 , π), and then use your answer to estimate f(0.001 , π).

OR
16 a) Let g be the function given by (8)

i. Calculate the partial derivatives of g at (0,0).

ii. Show that g is not differentiable at (0,0).
b) Find the second order Taylor series expansion for f(x,y) =e-(x2+y2) cos(xy) (6)
about (0 , 0).

17 a) There are two bags. The first bag contains four mangos and two apples; the (6)
second bag contains four mangos and four apples. We also have a biased
coin, which shows “heads” with probability 0.6 and “tails” with probability
0.4. If the coin shows “heads”. we pick a fruitat random from bag 1;
otherwise we pick a fruit at random from bag 2. Your friend flips the coin
(you cannot see the result), picks a fruit at random from the corresponding
bag, and presents you a mango.
What is the probability that the mango was picked from bag 2?
b) Suppose that one has written a computer program that sometimes compiles (8)
and sometimes not (code does not change). You decide to model the
apparent stochasticity (success vs. no success) x of the compiler using a
Bernoulli distribution with parameter μ:

Choose a conjugate prior for the Bernoulli likelihood and compute the
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
posterior distribution p( μ | x1 , ... ,xN).

OR
18 a) Two dice are rolled. (6)
A = ‘sum of two dice equals 3’
B = ‘sum of two dice equals 7’
C = ‘at least one of the dice shows a 1’
i. What is P(A|C)?
ii. What is P(B|C)?
iii. Are A and C independent? What about B and C?

b) Consider the following bivariate distribution p(x,y) of two discrete random (8)
variables X and Y .

Compute:
i. The marginal distributions p(x) and p(y).
ii. The conditional distributions p(x|Y = y1) and p(y|X = x3).

19 a) Find the extrema of f(x,y,z) = x - y + z subject to g(x,y,z) = x2 + y2 + z2 (8)

=2.
b) Let

Show that x* = (1, 1/2, -1) is optimal for the optimization problem

(6)

OR
20 a) Derive the gradient descent training rule assuming that the target function is (8)
represented as od = w0 + w1x1 + ... + wnxn. Define explicitly the cost/ error
function E, assuming that a set of training examples D is provided, where
each training example d D is associated with the target output td.
b) Find the maximum value of f(x,y,z) = xyz given that g(x,y,z) = x + y + z = 3 (6)
and x,y,z>=0.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
No Topic Lectures

(45)
Module-I (LINEAR ALGEBRA) 8
1.1 Matrices, Solving Systems of Linear Equations
1
1.2 Vector Spaces 1
1.3 Linear Independence 1
1.4 Basis and Rank (Lecture – 1) 1
1.5 Basis and Rank (Lecture – 2) 1
1.6 Linear Mappings 1

1.7 Matrix Representation of Linear Mappings 1

1.8 Image space, null space 1

Module-II (ANALYTIC GEOMETRY, MATRIX 11

DECOMPOSITIONS)
1
2.1 Norms, Inner Products

2.2 Lengths and Distances, Angles and Orthogonality 1

2.3 1
Orthonormal Basis, Orthogonal Complement

1
2.4 Orthogonal Projections – Projection into One Dimensional
Subspaces

2.5 1
Projection onto General Subspaces.

2.6 Determinant and Trace, Eigen values and Eigenvectors. 1

2.7 Cholesky Decomposition 1

2.8 Eigen decomposition and Diagonalization 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.9 Eigen decomposition and Diagonalization 1

2.10 Singular Value Decomposition 1
2.11 Matrix Approximation 1
Module-III (VECTOR CALCULUS) 9
3.1 Differentiation of Univariate Functions, Partial Differentiation and 1
Gradients
3.2 Gradients of Vector Valued Functions (Lecture 1) 1

3.3 Gradients of Vector Valued Functions (Lecture 2) 1

3.4 Gradients of Matrices 1

3.5 Useful Identities for Computing Gradients 1
3.6 Backpropagation and Automatic Differentiation – Gradients in deep 1
Netwok
3.7 Automatic Differentiation 1
3.8 Higher Order Derivatives 1
3.9 Linearization and Multivariate Taylor Series 1

Module-IV (Probability and 10

Distributions)
4.1 Axiomatic definition of Probability, Probability Space, Random 1
variables
4.2 Discrete random variables (Probability Mass Function, Cumulative 1
Distribution Function, Marginal distribution)
4.3 Continuous random variables (Probability Density Function, 1
Cumulative Distribution Function, Marginal distribution)
4.4 Sum Rule, Product Rule, Bayes’ Theorem 1

4.5 Summary Statistics and Independence (Lecture 1) 1

4.6 Summary Statistics and Independence (Lecture 2) 1

4.7 Bernoulli, Binomial, Uniform (Discrete) Distributions 1

4.8 Uniform (Continuous), Poisson Distributions 1

4.9 Gaussian Distribution 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.10 Conjugacy and the Exponential Family (Beta – Bernoulli, Beta – 1

Binomial Conjugacies)
Module-V (Optimization) 7

5.1 Optimization Using Gradient Descent. 1

5.2 Gradient Descent With Momentum, Stochastic Gradient Descent 1

5.3 Constrained Optimization and Lagrange Multipliers (Lecture 1) 1

5.4 Constrained Optimization and Lagrange Multipliers (Lecture 2) 1

5.5 Convex Optimization 1

5.6 Linear Programming 1

5.7 Quadratic Programming 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

COMPUTER YEAR OF
ORGANISATION CATEGORY L T P CREDIT
CST202 INTRODUCTION
AND
ARCHITECTURE PCC 3 1 0 4 2019

Preamble:

The course is prepared with the view of enabling the learners capable of understanding the
fundamental architecture of a digital computer. Study of Computer Organization and
Architecture is essential to understand the hardware behind the code and its execution at
physical level by interacting with existing memory and I/O structure. It helps the learners
to understand the fundamentals about computer system design so that they can extend the
features of computer organization to detect and solve problems occurring in computer
architecture.

Prerequisite : Topics covered under the course Logic System Design (CST 203)

Course Outcomes: After the completion of the course the student will be able to

CO# CO

Recognize and express the relevance of basic components, I/O organization and
CO1
pipelining schemes in a digital computer (Cognitive knowledge: Understand)

Explain the types of memory systems and mapping functions used in memory systems
CO2
(Cognitive Knowledge Level: Understand)
Demonstrate the control signals required for the execution of a given instruction
CO3
(Cognitive Knowledge Level: Apply) )

Illustrate the design of Arithmetic Logic Unit and explain the usage of registers in it
CO4
(Cognitive Knowledge Level: Apply)

Explain the implementation aspects of arithmetic algorithms in a digital computer

CO5
(Cognitive Knowledge Level:Apply)
Develop the control logic for a given arithmetic problem (Cognitive Knowledge
CO6
Level: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category
Test1 (%) Test2 (%) Examination Marks (%)

Remember 20 20 30

Understand 40 40 30
Apply 40 40 40

Analyze
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module 1

Basic Structure of computers – functional units - basic operational concepts - bus structures.
Memory locations and addresses - memory operations,Instructions and instruction sequencing ,
addressing modes.

Basic processing unit – fundamental concepts – instruction cycle – execution of a complete

instruction - single bus and multiple bus organization

Module 2

Register transfer logic: inter register transfer – arithmetic, logic and shift micro operations.
Processor logic design: - processor organization – Arithmetic logic unit - design of
arithmetic circuit - design of logic circuit - Design of arithmetic logic unit - status register –
design of shifter - processor unit – design of accumulator.
Module 3

Arithmetic algorithms: Algorithms for multiplication and division (restoring method) of binary
numbers. Array multiplier , Booth’s multiplication algorithm.
Pipelining: Basic principles, classification of pipeline processors, instruction and arithmetic
pipelines (Design examples not required), hazard detection and resolution.

Module 4
Control Logic Design: Control organization – Hard_wired control-microprogram control –
control of processor unit - Microprogram sequencer,micro programmed CPU organization -
horizontal and vertical micro instructions.

Module 5

I/O organization: accessing of I/O devices – interrupts, interrupt hardware -Direct memory
access.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Memory system: basic concepts – semiconductor RAMs. memory system considerations –

ROMs, Content addressable memory, cache memories - mapping functions.

Text Books

1. Hamacher C., Z. Vranesic and S. Zaky, Computer Organization ,5/e, McGraw Hill, 2011

2. Mano M. M., Digital Logic & Computer Design, PHI, 2004

3. KaiHwang, Faye Alye Briggs, Computer architecture and parallel processing McGraw-
Hill, 1984

Reference Books

1. Mano M. M., Digital Logic & Computer Design, 3/e, Pearson Education, 2013.

2. Patterson D.A. and J. L. Hennessy, Computer Organization and Design, 5/e, Morgan
Kaufmann Publishers, 2013.

3. William Stallings, Computer Organization and Architecture: Designing for Performance,

Pearson, 9/e, 2013.

4. Chaudhuri P., Computer Organization and Design, 2/e, Prentice Hall, 2008.

5. Rajaraman V. and T. Radhakrishnan, Computer Organization and Architecture, Prentice

Hall, 2011

Sample Course Level Assessment Questions

Course Outcome1(CO1): Which are the registers involved in a memory access

operation and how are they involved in it?

Course Outcome 2(CO2): Explain the steps taken by the system to handle a write miss
condition inside the cache memory.

Course Outcome 3(CO3): Generate the sequence of control signals required for the
execution of the instruction MOV [R1],R2 in a threebus organization.

Course Outcome 4(CO4): Design a 4-bit combinational logic shifter with 2 control
signals H0 and H1 that perform the following operations :
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

H1 H0 Operation

0 0 Transfer 1's to all output line

0 1 No shift operation

1 0 Shift left
1 1 Shift right

Course Outcome 5(CO5): Explain the restoring algorithm for binary division. Also
trace the algorithm to divide (1001)2 by (11)2

Course Outcome 6(CO6): Design a software control logic based on microprogramed

control to perform the addition of 2 signed numbers represented in sign magnitude form.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES:2

Reg No:_______________

Name:_________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

THIRD SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 202

Course Name: Computer organisation and architecture

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Give the significance of instruction cycle.

2. Distinguish between big endian and little endian notations. Also give the significance of
these notations.

3. Compare I/O mapped I/O and memory mapped I/O.

4. Give the importance of interrupts in I/O interconnection.

5. Justify the significance of status register.

6. How does the arithmetic circuitry perform logical operations in an ALU.

7. Illustrate divide overflow with an example.

8. Write notes on arithmetic pipeline.

9. Briefly explain the role of micro program sequence.

10. Differentiate between horizontal and vertical micro instructions.

Part B

Answer any one Question from each module. Each question carries 14 Marks
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

11.

11.(a) What is the significance of addressing modes in computer architecture.

(4)

11.(b) Write the control sequence for the instruction DIV R1,[R2] in a three bus structure.
(10)

OR

12. Explain the concept of a single bus organization with help of a diagram. Write the control
sequence for the instruction ADD [R1],[R2].

(14)

13. Explain various register transfer logics.

(14)

OR

14.
14.(a) Design a 4 bit combinational logic shifter with 2 control signals H1 and H2 that
perform the following operations (bit values given in parenthesis are the values of
control variable H1 and H2 respectively.) : Transfer of 0’s to S (00), shift right (01),
shift left (10), no shift (11).
(5)
14.(b) Design an ALU unit which will perform arithmetic and logic operation with a given
binary adder.
(9)

15.
15.(a) Give the logic used behind Booth’s multiplication algorithm.
(4)

15.(b) Identify the appropriate algorithm available inside the system to perform the
multiplication between -14 and -9. Also trace the algorithm for the above input.
(10)
OR

16.

16.(a) List and explain the different pipeline hazards and their possible solutions

(10)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

16.(b) Design a combinational circuit for 3x2 multiplication.

(4)
17. Design a hardwared control unit used to perform addition/subtraction of 2 numbers
represented in sign magnitude form.

(14)

OR

18. Give the structure of the micro program sequencer and its role in sequencing the micro
instructions.

(14)

19.

19.(a) Explain the different ways in which interrupt priority schemes can be implemented
(10)

19.(b) Give the structure of SRAM cell.

(4)

OR

20.

20.(a) Explain the various mapping functions available in cache memory.

(9)

20.(b) Briefly explain content addressable memory.

(5)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN

No of
No Contents Lecture
Hrs
Module 1 : (Basic Structure of computers) (9 hours)
Functional units,basic operational concepts,bus structures
1.1 1
(introduction)
1.2 Memory locations and addresses , memory operations 1

1.3 Instructions and instruction sequencing 1

1.4 Addressing modes 1

1.5 Fundamental concepts of instruction execution, instruction cycle 1

1.6 Execution of a complete instruction - single bus organization (Lecture 1) 1

1.7 Execution of a complete instruction - single bus organization (Lecture 2) 1

1.8 Execution of a complete instruction - multiple bus organization (Lecture 1) 1

1.9 Execution of a complete instruction - multiple bus organization (Lecture 2) 1

Module 2 :(Register transfer logic and Processor logic design) (10 hours)

2.1 Inter register transfer – arithmetic micro operations 1

2.2 Inter register transfer – logic and shift micro operations 1

2.3 Processor organization 1

2.4 Design of arithmetic circuit 1

2.5 Design of logic circuit 1

2.6 Design of arithmetic logic unit 1

2.7 Design of status register 1

2.8 Design of shifter - processor unit 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.9 Design of accumulator (Lecture 1) 1

2.10 Design of accumulator (Lecture 2) 1

Module 3 : (Arithmetic algorithms and Pipelining) (9 hours)

3.1 Algorithm for multiplication of binary numbers 1

3.2 Algorithm for division (restoring method) of binary numbers 1

3.3 Array multiplier 1

3.4 Booth’s multiplication algorithm 1
3.5 Pipelining: Basic principles 1
3.6 Classification of pipeline processors (Lecture 1) 1
3.7 Classification of pipeline processors (Lecture 2) 1
3.8 Instruction and arithmetic pipelines (Design examples not required) 1
3.9 Hazard detection and resolution 1
Module 4 :( Control Logic Design) (9 hours)

4.1 Control organization –design of hardwired control logic (Lecture 1) 1

4.2 Control organization –design of hardwired control logic (Lecture 2) 1
4.3 Control organization –design of hardwired control logic (Lecture 3) 1
4.4 Design of microprogram control logic–control of processor unit (Lecture1) 1
4.5 Design of microprogram control logic–control of processor unit (Lecture2) 1
4.6 Design of microprogram control logic–control of processor unit (Lecture3) 1
4.7 Microprogram sequencer 1
4.8 Micro programmed CPU organization 1
4.9 Microinstructions –horizontal and vertical micro instructions 1
Module 5 : (Basic processing units, I/O and memory) (8 hours)

5.1 Accessing of I/O devices –interrupts 1

5.2 Interrupt hardware 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.3 Direct memory access 1

5.4 Memory system: basic concepts –semiconductor RAMs 1
5.5 Memory system considerations – ROMs 1
5.6 Content addressable memory 1
5.7 Cache memories -mapping functions (Lecture 1) 1
5.8 Cache memories -mapping functions (Lecture 2) 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

DATABASE YEAR OF
CST CATEGORY L T P CREDIT
MANAGEMENT INTRODUCTION
204 SYSTEMS
PCC 3 1 0 4 2019

Preamble: This course provides a clear understanding of fundamental principles of Database

Management Systems (DBMS) with special focus on relational databases to the learners. The
topics covered in this course are basic concepts of DBMS, Entity Relationship (ER) model,
Relational Database principles, Relational Algebra, Structured Query Language (SQL), Physical
Data Organization, Normalization and Transaction Processing Concepts. The course also gives a
glimpse of the alternative data management model, NoSQL. This course helps the learners to
manage data efficiently by identifying suitable structures to maintain data assets of
organizations and to develop applications that utilize database technologies.

Prerequisite: Topics covered under the course Data Structures (CST 201), Exposure to a
High Level Language like C/python.

Course Outcomes: After the completion of the course the student will be able to

Summarize and exemplify fundamental nature and characteristics of database systems

CO1
(Cognitive Knowledge Level: Understand)
Model real word scenarios given as informal descriptions, using Entity Relationship
CO2
diagrams. (Cognitive Knowledge Level: Apply)

Model and design solutions for efficiently representing and querying data using
CO3
relational model (Cognitive Knowledge Level: Analyze)

Demonstrate the features of indexing and hashing in database applications (Cognitive

CO4
Knowledge Level: Apply)
Discuss and compare the aspects of Concurrency Control and Recovery in Database
CO5
systems (Cognitive Knowledge Level: Apply)

Explain various types of NoSQL databases (Cognitive Knowledge Level:

CO6
Understand)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category Examination Marks
Test1 (%) Test2 (%)
(%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Analyze
Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module 1: Introduction & Entity Relationship (ER) Model

Concept & Overview of Database Management Systems (DBMS) - Characteristics of Database

system, Database Users, structured, semi-structured and unstructured data. Data Models and
Schema - Three Schema architecture. Database Languages, Database architectures and
classification.

ER model - Basic concepts, entity set & attributes, notations, Relationships and constraints,
cardinality, participation, notations, weak entities, relationships of degree 3.

Module 2: Relational Model

Structure of Relational Databases - Integrity Constraints, Synthesizing ER diagram to relational

schema

Introduction to Relational Algebra - select, project, cartesian product operations, join - Equi-join,
natural join. query examples, introduction to Structured Query Language (SQL), Data Definition
Language (DDL), Table definitions and operations – CREATE, DROP, ALTER, INSERT,
DELETE, UPDATE.

Module 3: SQL DML (Data Manipulation Language), Physical Data Organization

SQL DML (Data Manipulation Language) - SQL queries on single and multiple tables, Nested
queries (correlated and non-correlated), Aggregation and grouping, Views, assertions, Triggers,
SQL data types.

Physical Data Organization - Review of terms: physical and logical records, blocking factor,
pinned and unpinned organization. Heap files, Indexing, Singe level indices, numerical examples,
Multi-level-indices, numerical examples, B-Trees & B+-Trees (structure only, algorithms not
required), Extendible Hashing, Indexing on multiple keys – grid files.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 4: Normalization
Different anomalies in designing a database, The idea of normalization, Functional dependency,
Armstrong’s Axioms (proofs not required), Closures and their computation, Equivalence of
Functional Dependencies (FD), Minimal Cover (proofs not required). First Normal Form (1NF),
Second Normal Form (2NF), Third Normal Form (3NF), Boyce Codd Normal Form (BCNF),
Lossless join and dependency preserving decomposition, Algorithms for checking Lossless Join
(LJ) and Dependency Preserving (DP) properties.

Module 5: Transactions, Concurrency and Recovery, Recent Topics

Transaction Processing Concepts - overview of concurrency control, Transaction Model,

Significance of concurrency Control & Recovery, Transaction States, System Log, Desirable
Properties of transactions.
Serial schedules, Concurrent and Serializable Schedules, Conflict equivalence and conflict
serializability, Recoverable and cascade-less schedules, Locking, Two-phase locking and its
variations. Log-based recovery, Deferred database modification, check-pointing.

Introduction to NoSQL Databases, Main characteristics of Key-value DB (examples from:

Redis), Document DB (examples from: MongoDB)

Main characteristics of Column - Family DB (examples from: Cassandra) and Graph DB

(examples from : ArangoDB)

Text Books

1. Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design and

Application Programming, Pearson Education, 2013.

2. Sliberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw
Hill, 2011.

Reference Books:
1. Adam Fowler, NoSQL for Dummies, John Wiley & Sons, 2015
2. NoSQL Data Models: Trends and Challenges (Computer Engineering: Databases and Big
Data), Wiley, 2018
3. Web Resource: https://www.w3resource.com/redis/
4. web Resource: https://www.w3schools.in/category/mongodb/
5. Web Resource: https://www.tutorialspoint.com/cassandra/cassandra_introduction.htm
6. Web Resource : https://www.tutorialspoint.com/arangodb/index.htm
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome1 (CO1):

1. List out any three salient features of database systems, which distinguish it from a file
system.
2. Give one example each for logical and physical data independence.

Course Outcome 2(CO2):

1. What facts about the relationships between entities EMPLOYEE and PROJECT are
conveyed by the following ER diagram?

1. Design an ER diagram for the following scenario:

There is a set of teams, each team has an ID (unique identifier), name, main stadium, and to
which city this team belongs. Each team has many players, and each player belongs to one
team. Each player has a number (unique identifier), name, DoB, start year, and shirt
number that he uses. Teams play matches, in each match there is a host team and a guest
team.

Course Outcome 3(CO3):

1. For the SQL query, SELECT A, B FROM R WHERE B=’apple’ AND C = ‘orange’ on the
table R(A, B, C, D), where A is a key, write any three equivalent relational algebra
expressions.
2. Given the FDs P→Q, P→R, QR→S, Q→T, QR→U, PR→U, write the sequence of
Armstrong’s Axioms needed to arrive at the following FDs: (a) P → T (b) PR → S (c)
QR → SU
3. Consider a relation PLAYER (PLAYER-NO, PLAYER-NAME, PLAYER-POSN,
TEAM, TEAM-COLOR, COACH-NO, COACH-NAME, TEAM-CAPTAIN). Assume
that PLAYER-NO is the only key of the relation and that the following dependencies
hold:
TEAM→{TEAM-COLOR, COACH-NO, TEAM-CAPTAIN}
COACH-NO→COACH-NAME.
i. Is the relation in 2NF? If not, decompose to 2NF.
ii. Is the relation in 3NF? If not, decompose to 3NF.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. In the following tables foreign keys have the same name as primary keys except
DIRECTED-BY, which refers to the primary key ARTIST-ID. Consider only single-
director movies.
MOVIES(MOVIE-ID, MNAME, GENRE, LENGTH, DIRECTED-BY)
ARTIST(ARTIST-ID, ANAME)
ACTING(ARTIST-ID, MOVIE-ID)
Write SQL expressions for the following queries:
(a) Name(s) and director name(s) of movie(s) acted by ‘Jenny’.
(b) Names of actors who have never acted with ‘Rony’
(c) Count of movies genre-wise.
(d) Name(s) of movies with maximum length.

Course Outcome 4(CO4):

1. Consider an EMPLOYEE file with 10000 records where each record is of size 80 bytes.
The file is sorted on employee number (15 bytes long), which is the primary key.
Assuming un-spanned organization, block size of 512 bytes and block pointer size of 5
bytes. Compute the number of block accesses needed for retrieving an employee record
based on employee number if (i) No index is used (ii) Multi-level primary index is used.

Course Outcome 5(CO5):

1. Determine if the following schedule is recoverable. Is the schedule cascade-less? Justify
your answer. r1(X), r2(Z), r1(Z), r3(X), r3(Y), w1(X), c1, w3(Y), c3, r2(Y), w2(Z), w2(Y),
c2. (Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci means
transaction Ti commits.)
2. Two-phase locking protocol ensures serializability. Justify.

Course Outcome 6(CO6):

1. List out any three salient features of NoSQL databases. Give example of a document in
MongoDB.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question paper

QPCODE
Reg No:__________________
Name:___________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FOURTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 204
Course Name: Database Management Systems
Max.Marks:100 Duration: 3 Hours
PART A
Answer all Questions. Each question carries 3 Marks
1 List out any three salient features of a database systems.
2 When is multi-valued composite attribute used in ER modelling?
3 For the SQL query, SELECT A, B FROM R WHERE B=’apple’ AND C = ‘orange’
on the table R(A, B, C, D), where A is a key, write any two equivalent relational
algebra expressions.
4 Outline the concept of theta-join.
5 How is the purpose of where clause is different from that of having clause?
6 What is the use of a trigger?
7 When do you say that a relation is not in 1NF?
8 Given the FDs P→Q, P→R, QR→S, Q→T, QR→U, PR→U, write the sequence of
Armstrong’s Axioms needed to arrive at a. P → T b. PR → S
9 What is meant by the lost update problem?
10 What is meant by check pointing?

PART B
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Answer any one Question from each module. Each question carries 14 Marks
11 a. Design an ER diagram for the following scenario: There is a set of teams, each (14)
team has an ID (unique identifier), name, main stadium, and to which city this
team belongs. Each team has many players, and each player belongs to one
team. Each player has a number (unique identifier), name, DoB, start year, and
shirt number that he uses. Teams play matches, in each match there is a host
team and a guest team. The match takes place in the stadium of the host team.
For each match we need to keep track of the following: The date on which the
game is played The final result of the match. The players participated in the
match. For each player, how many goals he scored, whether or not he took
yellow card, and whether or not he took red card. During the match, one player
may substitute another player. We want to capture this substitution and the time
at which it took place. Each match has exactly three referees. For each referee
we have an ID (unique identifier), name, DoB, years of experience. One referee
is the main referee and the other two are assistant referee.
OR
12 a. Interpret the the following ER diagram.
(8)

"

b. Distinguish between physical data independence and logical data independence (6)
with suitable examples.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

13 EMPLOYEE(ENO, NAME, ADDRESS, DOB, AGE, GENDER, SALARY, (14)

DNUM, SUPERENO)
DEPARTMENT(DNO, DNAME, DLOCATION, DPHONE, MGRENO)
PROJECT(PNO, PNAME, PLOCATION, PCOST, CDNO)

DNUM is a foreign key that identifies the department to which an employee

belongs. MGRENO is a foreign key identifying the employee who manages the
department. CDNO is a foreign key identifying the department that controls the
project. SUPERENO is a foreign key identifying the supervisor of each employee.

Write relational algebra expressions for the following queries:-

(a) Names of female employees whose salary is more than 20000.

(b) Salaries of employee from ‘Accounts’ department
(c) Names of employees along with his/her superviser’s name
(d) For each employee return name of the employee along with his department
name and the names of projects in which he/she works
(e) Names of employees working in all the departments

OR
14 a.Write SQL DDL statements for the the following (Assume suitable domain (10)
types):
i. Create the tables STUDENT(ROLLNO, NAME, CLASS, SEM,
ADVISER), FACULTY(FID, NAME, SALARY, DEPT). Assume that
ADVISER is a foreign key referring FACUTY table.
ii. Delete department with name ‘CS’ and all employees of the
department.
iii. Increment salary of every faculty by 10%.
b.Illustrate foreign key constraint with a typical example. (4)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

15 For the relation schema below, give an expression in SQL for each of the queries (14)
that follows:

employee(employee-name, street, city)

works(employee-name, company-name, salary)
company(company-name, city)
manages(employee-name, manager-name)

a) Find the names, street address, and cities of residence for all employees
who work for the Company ‘RIL Inc.' and earn more than $10,000.
b) Find the names of all employees who live in the same cities as the
companies for which they work.
c) Find the names of all employees who do not work for ‘KYS Inc.’. Assume
that all people work for exactly one company.
d) Find the names of all employees who earn more than every employee of
‘SB Corporation'. Assume that all people work for at most one company.
e) List out number of employees company-wise in the decreasing order of
number of employees.

OR
16 a. Consider an EMPLOYEE file with 10000 records where each record is of (9)
size 80 bytes. The file is sorted on employee number (15 bytes long), which
is the primary key. Assuming un-spanned organization and block size of
512 bytes compute the number of block accesses needed for selecting
records based on employee number if,
i. No index is used
ii. Single level primary index is used
iii. Multi-level primary index is used
Assume a block pointer size of 6 bytes.
b. Illustrate correlated and non-correlated nested queries with real examples. (5)

17 a. Illstrate3NF and BCNF with suitable real examples. (6)

b. Given a relation R(A1,A2,A3,A4,A5) with functional dependencies (8)

A1→A2A4 and A4→A5, check if the decomposition R1(A1,A2,A3),
R2(A1,A4), R3(A2,A4,A5) is lossless.
OR
18 a. Consider the un-normalized relation R(A, B, C, D, E, F, G) with the FDs (7)
A→B , AC→G, AD→EF, EF→G, CDE→AB. Trace the normalization
process to reach 3NF relations.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

b. Illustrate Lossless Join Decomposition and Dependency Preserving (7)

Decomposition with typical examples.
19 a. Discuss the four ACID properties and their importance. (7)

b. Determine if the following schedule is conflict serializable. Is the schedule (7)

recoverable? Is the schedule cascade-less? Justify your answers.
r1(X), r2(Z), r1(Z), r3(X), r3(Y ), w1(X), c1, w3(Y), c3, r2(Y), w2(Z),
w2(Y), c2

(Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci

means transaction Ti commits.)
OR
20 a. Discuss the main characteristics of Key-value DB and Graph DB. (7)

b. Illustrate two-phase locking with a schedule containing three transactions. (7)

Argue that 2PL ensures serializability. Also argue that 2Pl can lead to
deadlock.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

Hours
Course Name
(48)
Module 1: Introduction & ER Model 8
Concept & Overview of DBMS, Characteristics of DB system,
1.1 1
Database Users.
Structured, semi-structured and unstructured data. Data Models and
1.2 1
Schema

1.3 Three-Schema-architecture. Database Languages 1

1.4 Database architectures and classification 1

1.5 ER model: basic concepts, entity set & attributes, notations 1

1.6 Relationships and constraints – cardinality, participation, notations 1
1.7 Weak entities, relationships of degree 3 1
1.8 ER diagram – exercises 1
Module 2: Relational Model 7
2.1 Structure of relational Databases, Integrity Constraints 1
Synthesizing ER diagram to relational schema, Introduction to
2.2 1
relational algebra.
2.3 Relational algebra: select, project, Cartesian product operations 1
2.4 Relational Algebra: join - Equi-join, Natural join 1
2.5 Query examples 1
2.6 Introduction to SQL, important data types 1
DDL, Table definitions and operations – CREATE, DROP, ALTER,
2.7 1
INSERT, DELETE, UPDATE
Module 3: SQL DML, Physical Data Organization 11
3.1 SQL DML, SQL queries on single and multiple tables 1
3.2 Nested queries (correlated and non-correlated) 1
3.3 Aggregation and grouping 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Hours
Course Name
(48)
3.4 Views, assertions (with examples) 1
3.5 Triggers (with examples), SQL data types 1
Review of terms: physical and logical records, blocking factor,
3.6 1
pinned and unpinned organization. Heap files, Indexing
3.7 Singe level indices, numerical examples 1

3.8 Multi-level-indices, numerical examples 1

3.9 B-Trees and B+Trees (structure only, algorithms not required) 1

3.10 Extendible Hashing 1

3.11 Indexing on multiple keys – grid files 1
Module 4: Normalization 8
Different anomalies in designing a database, The idea of
4.1 1
normalization
4.2 Functional dependency, Armstrong’s Axioms (proofs not required) 1
Closures and their computation, Equivalence of FDs, minimal
4.3 1
Cover (proofs not required).
4.4 1NF, 2NF 1
4.5 3NF, BCNF 1
4.6 Lossless join and dependency preserving decomposition 1
Algorithms for checking Lossless Join and Dependency preserving
4.7 1
properties (Lecture 1)
Algorithms for checking Lossless Join and Dependency preserving
4.8 1
properties (Lecture 2)
Module 5: Transactions, Concurrency and Recovery, Recent
14
Topics
5.1 Transaction Processing Concepts: Transaction Model 1
Overview of concurrency control, Significance of concurrency
5.2 1
Control & Recovery
5.3 Transaction States, System Log 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Hours
Course Name
(48)
5.4 Desirable Properties of transactions, Serial schedules 1
5.5 Concurrent and Serializable Schedules 1
5.6 Conflict equivalence and conflict serializability 1
5.7 Recoverable and cascade-less schedules 1

5.8 Locking, Two-phase locking, strict 2PL. 1

5.9 Log-based recovery 1

5.10 Deferred database modification (serial schedule), example 1
Deferred database modification (concurrent schedule) example,
5.11 1
check-pointing
5.12 Introduction to NoSQL Databases 1
Main characteristics of Key-value DB (examples from: Redis),
5.13 Document DB (examples from: MongoDB) [detailed study not 1
expected]

Main characteristics of Column-Family DB (examples from:

5.14 Cassandra) and Graph DB (examples from : ArangoDB) [detailed 1
study not expected]
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
CST OPERATING Category L T P Credit
Introduction
206 SYSTEMS
PCC 3 1 0 4 2019

Preamble: Study of operating system is an essential to understand the overall working of

computer system, tradeoffs between performance and functionality and the division of jobs
between hardware and software. This course introduces the concepts of memory management,
device management, process management, file management and security & protection
mechanisms available in an operating system. The course helps the learner to understand the
fundamentals about any operating system design so that they can extend the features of operating
system to detect and solve many problems occurring in operating system and to manage the
computer resources appropriately.

Prerequisite: Topics covered in the courses are Data Structures (CST 201) and Programming
in C (EST 102)

Course Outcomes: After the completion of the course the student will be able to

Explain the relevance, structure and functions of Operating Systems in computing

CO1
devices. (Cognitive knowledge: Understand)

Illustrate the concepts of process management and process scheduling mechanisms

CO2
employed in Operating Systems. (Cognitive knowledge: Understand)

Explain process synchronization in Operating Systems and illustrate process

CO3 synchronization mechanisms using Mutex Locks, Semaphores and Monitors
(Cognitive knowledge: Understand)
Explain any one method for detection, prevention, avoidance and recovery for
CO4
managing deadlocks in Operating Systems. (Cognitive knowledge: Understand)

Explain the memory management algorithms in Operating Systems. (Cognitive

CO5
knowledge: Understand)
Explain the security aspects and algorithms for file and storage management in
CO6
Operating Systems. (Cognitive knowledge: Understand)
 ARTIFICIAL
Mapping of course outcomes with INTELLIGENCE AND MACHINE LEARNING
program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Test 1 (Marks Test 2 (Marks End Semester Examination

Bloom’s Category
in percentage) in percentage) (Marks in percentage)
Remember 30 30 30

Understand 30 30 30
Apply 40 40 40

Analyse
Evaluate

Create
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module I

Introduction: Operating system overview – Operations, Functions, Service – System calls,

Types – Operating System structure - Simple structure, Layered approach, Microkernel, Modules
– System boot process.

Module II

Processes - Process states, Process control block, threads, scheduling, Operations on processes -
process creation and termination – Inter-process communication - shared memory systems,
Message passing systems.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Process Scheduling – Basic concepts- Scheduling criteria -scheduling algorithms- First come
First Served, Shortest Job Firs, Priority scheduling, Round robin scheduling

Module III

Process synchronization- Race conditions – Critical section problem – Peterson’s solution,

Synchronization hardware, Mutex Locks, Semaphores, Monitors – Synchronization problems -
Producer Consumer, Dining Philosophers and Readers-Writers.

Deadlocks: Necessary conditions, Resource allocation graphs, Deadlock prevention, Deadlock

avoidance – Banker’s algorithms, Deadlock detection, Recovery from deadlock.

Module IV

Memory Management: Concept of address spaces, Swapping, Contiguous memory allocation,

fixed and variable partitions, Segmentation, Paging. Virtual memory, Demand paging, Page
replacement algorithms.

Module V

File System: File concept - Attributes, Operations, types, structure – Access methods, Protection.
File-system implementation, Directory implementation. Allocation methods.
Storage Management: Magnetic disks, Solid-state disks, Disk Structure, Disk scheduling,
Disk formatting.

Text Book

Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ' Operating System Concepts' 9th
Edition, Wiley India 2015.

Reference Books:

1. Andrew S Tanenbaum, “Modern Operating Systems” , 4th Edition, Prentice Hall, 2015.
2. William Stallings, “Operating systems”, 6th Edition, Pearson, Global Edition, 2015.
3. Garry Nutt, Nabendu Chaki, Sarmistha Neogy, “Operating Systems”, 3rd Edition, Pearson
Education.
4. D.M.Dhamdhere, “Operating Systems”, 2nd Edition, Tata McGraw Hill, 2011.
5. Sibsankar Haldar, Alex A Aravind, “Operating Systems”, Pearson Education.
Sample Course Level AssessmentARTIFICIAL
Questions INTELLIGENCE AND MACHINE LEARNING

Course Outcome1 (CO1): What is the main advantage of the micro kernel approach to system
design? How do user program and system program interact in a microkernel architecture?

Course Outcome 2 (CO2): Define process. With the help of a neat diagram explain different
states of process.
Course Outcome 3 (CO3): What do you mean by binary semaphore and counting semaphore?
With C, explain implementation of wait () and signal().

Course Outcome 4 (CO4): Describe resource allocation graph for the following. a) with a
deadlock b) with a cycle but no deadlock.

Course Outcome 5 (CO5): Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2,

1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Find out the number of page faults if there are 4 page frames, using
the following page replacement algorithms. i) LRU ii) FIFO iii) Optimal

Course Outcome 6 (CO6): Explain the different file allocation methods with advantages and
disadvantages.

Model Question Paper

QP CODE: PAGES: ___

Reg No:_______________
Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FOURTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 206

Course name : OPERATING SYSTEMS

Max Marks: 100 Duration: 3 Hours

PART-A

(Answer All Questions. Each question carries 3 marks)

1. How does hardware find the Operating System kernel after system switch-on?

2. What is the purpose of system call in operating system?

3. Why is context switching considered as an overhead to the system?

 ARTIFICIAL
4. How is inter process communication INTELLIGENCE
implement ANDmemory?
using shared MACHINE LEARNING

5. Describe resource allocation graph for the following.

a) with a deadlock b)with a cycle but no deadlock.

6. What is critical section? What requirement should be satisfied by a solution to the critical
section problem?

7. Consider the reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How

many page faults occur while using FCFS for the following cases.

a) frame=2 b)frame=3

8. Differentiate between internal and external fragmentations.

9. Compare sequential access and direct access methods of storage devices.

10. Define the terms (i) Disk bandwidth (ii) Seek time.

PART-B(Answer any one question from each module)

11. a) Explain the following structures of operating system (i) Monolithic systems
(ii) Layered Systems (iii) Micro Kernel (iv) Modular approach. (12)

b) Under what circumstances would a user be better of using a time sharing system than a
PC or a single user workstation? (2)

OR

12. a) What is the main advantage of the micro kernel approach to system design? How do user
program and system program interact in a microkernel architecture? (8)

b) Describe the differences between symmetric and asymmetric multiprocessing? What are
the advantages and disadvantages of multiprocessor systems? (6)

13. a) Define process. With the help of a neat diagram explain different states of process. (8)
b) Explain how a new process can be created in Unix using fork system call. (6)
OR

14 a) Find the average waiting time and average turnaround time for the processes given in the
table below using:- i) SRT scheduling algorithm ii) Priority scheduling algorithm (9)
 Process ARTIFICIAL
Arrival Time (ms)INTELLIGENCE AND MACHINE
CPU Burst Time (ms) LEARNING
Priority
P1 0 5 3
P2 2 4 1
P3 3 1 2
P4 5 2 4
b) What is a Process Control Block? Explain the fields used in a Process Control Block. (5)

15. Consider a system with five processes P0 through P4 and three resources of type A, B, C.
Resource type A has 10 instances, B has 5 instances and C has 7 instances. Suppose at time
t0 following snapshot of the system has been taken:

i) What will be the content of the Need matrix? Is the system in a safe state? If Yes, then what is
the safe sequence? (8)
iii)What will happen if process P1 requests one additional instance of resource type A and two
instances of resource type C? (6)

OR

16. a) State dining philosopher’s problem and give a solution using semaphores. (7)

b) What do you mean by binary semaphore and counting semaphore? With C struct, explain
implementation of wait () and signal() (7)
17. a) Consider the following pageARTIFICIAL INTELLIGENCE
reference string 1, 2, 3, 4, 2, AND MACHINE
1, 5, 6, 2, 1, 2, 3,LEARNING
7, 6, 3, 2, 1, 2,
3, 6. Find out the number of page faults if there are 4 page frames, using the following
page replacement algorithms i) LRU ii) FIFO iii) Optimal (9)

b) Explain the steps involved in handling a page fault. (5)

OR

18. a) With a diagram, explain how paging is done with TLB. (5)

b) Memory partitions of sizes 100 kb, 500 kb, 200 kb, 300 kb, 600 kb are available, how
would best ,worst and first fit algorithms place processes of size 212 kb, 417 kb, 112 kb,
426 kb in order. Rank the algorithms in terms of how efficiently they uses memory. (9)

19. a) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. the drive currently
services a request at cylinder 143, and the previous request was at cylinder 125. the queue
of pending request in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
Starting from the current position, what is the total distance (in cylinders) that the disk arm
moves to satisfy all pending requests for each of the following algorithms

i) FCFS ii) SSFT iii) SCAN iv) LOOK v) C-SCAN (10)

b) What is the use of access matrix in protection mechanism? (4)

OR

20. a) Explain the different file allocation operations with advantages and disadvantages. (8)
b) Explain the following i) file types ii) file operation iii) file attributes (6)

Teaching Plan

Module 1 - Introduction 5 Hours

1.1 Introduction to Operating System 1

1.2 Operating System operations, functions, service 1

1.3 System calls, Types 1

1.4 Operating System Structure: Simple, Layered, Microkernel, Modules 1

1.5 System Boot Process 1

Module 2 – Processes and Process Scheduling 9 Hours

2.1 Processes, Process states 1

2.2 Process Control Block, Threads 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
2.3 Scheduling 1

2.4 Operations on processes: process creation and termination 1

2.5 Inter-process communication: Shared memory systems, Message Passing 1

2.6 Process Scheduling – Basic concepts, Scheduling Criteria 1

2.7 Scheduling algorithms - Basics 1

2.8 First come First Served, Shortest Job First 1

2.9 Priority scheduling, Round Robin Scheduling 1

Module 3 - Process synchronization and Dead locks 13 Hours

3.1 Process synchronization, Race conditions 1

3.2 Critical Section problem, Peterson’s solution 1

3.3 Synchronization hardware, Mutex Locks 1

3.4 Semaphores 1
3.5 Monitors 1

3.6 Synchronization problem examples (Lecture 1) 1

3.7 Synchronization problem examples (Lecture 2) 1

3.8 Deadlocks: Necessary conditions, Resource Allocation Graphs 1

3.9 Deadlock prevention 1

3.10 Deadlock avoidance 1

3.11 Banker’s algorithm 1

3.12 Deadlock detection 1

3.13 Deadlock recovery 1

Module 4 - Memory Management 9 Hours

4.1 Memory Management: Concept of Address spaces 1

4.2 Swapping 1
4.3 Contiguous memory allocation, fixed and variable partitions 1

4.4 Segmentation. 1
4.5 Paging (Lecture 1) 1

4.6 Paging (Lecture 2) 1

4.7 Virtual memory, Demand Paging 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
4.8 Page replacement algorithms (Lecture 1) 1

4.9 Page replacement algorithms (Lecture 2) 1

Module 5 - File and Disk management 9 Hours

5.1 File concept, Attributes, Operations, types, structure 1

5.2 Access methods 1

5.3 Protection 1
5.4 File-System implementation 1

5.5 Directory implementation 1

5.6 Allocation methods 1

5.7 Magnetic disks, Solid-state disks, Disk structure 1

5.8 Disk scheduling 1

5.9 Disk formatting 1

 CATEGORY
ARTIFICIAL INTELLIGENCE L T PLEARNING
AND MACHINE CREDITS
DATABASE MANAGEMENT
AIL202
SYSTEMS LAB PCC 0 0 3 2

Preamble: The Database Management Systems course is intended to impart the elementary
concepts of a database management system to students and equip them to design and implement a
database application based on those concepts. This course helps the learners to get practical
exposure on database creation, SQL queries creation, transaction processing and NoSQL &
MongoDB based operations. The course enables the students to create, manage and administer the
databases, develop necessary tools for the design and development of the databases, and to
understand emerging technologies to handle Big Data.

Prerequisite: A sound knowledge of the basics of relational DBMS.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
CO1 Design database schema for a given real world problem-domain using standard design and
modeling approaches.
(Cognitive Knowledge Level: Apply)
CO2 Construct queries using SQL for database creation, interaction, modification, and updation.
(Cognitive Knowledge Level: Apply)
C03 Design and implement triggers and cursors.
(Cognitive Knowledge Level: Apply)
C04 Implement procedures, functions, and control structures using PL/SQL.
(Cognitive Knowledge Level: Apply)
CO5 Perform CRUD operations in NoSQL Databases.
(Cognitive Knowledge Level: Apply)
C06 Develop database applications using front-end tools and back-end DBMS.
(Cognitive Knowledge Level: Create)

Mapping of course outcomes with program outcomes

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

CO2

CO3

CO4

CO5

CO6
 Abstract POs defined by National
ARTIFICIAL Board of Accreditation
INTELLIGENCE AND MACHINE LEARNING

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern:
Bloom’s Category Continuous Assessment Test End Semester
(Internal Exam)Percentage Examination Percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create

Mark Distribution
Total Marks CIE Marks ESE Marks ESE Duration
150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks
Continuous Evaluation in Lab : 30 marks
Continuous Assessment Test : 15 marks
Viva-voce : 15 marks

Internal Examination Pattern : The marks will be distributed as Schema/Logic: 30 marks,

Program/Queries: 20 marks, Output: 20 marks, and Viva: 30 marks. Total 100 marks which will be
converted out of 15 while calculating Internal Evaluation marks.

End Semester Examination Pattern: The marks will be distributed as Schema/Logic: 30 marks,
Program/Queries: 20 marks, Output: 20 marks, and Viva: 30 marks. Total 100 marks will be
converted out of 75 for the End Semester Examination.
DBMS software: Oracle, MySQL, SQL Server, INTELLIGENCE
ARTIFICIAL PostgreSQL, MongoDB.
AND MACHINE LEARNING
Front end Tool: Java

Fair Lab Record:

All Students attending the DBMS Lab should have a Fair Record. The fair record should be
produced in the University Lab Examination. Every experiment conducted in the lab should be
noted in the fair record. For every experiment in the fair record, the right hand page should contain
Experiment Heading, Experiment Number, Date of Experiment, Aim of Experiment,
Schemas/Menu & Form Design, and Query questions. The left hand page should contain Queries
and sample output(relations created, Form, and Menu Output) obtained for a set of input.

SYLLABUS

1. Design a database schema for an application with ER diagram from a problem description
**.
2. Creation, modification, configuration, and deletion of databases using UI and SQL
Commands **.
3. Creation of database schema - DDL (create tables, set constraints, enforce relationships,
create indices, delete and modify tables). Export ER diagram from the database and verify
relationships** (with the ER diagram designed in step 1).
4. Database initialization - Data insert, Data import to a database (bulk import using UI and
SQL Commands)**.
5. Practice SQL commands for DML (insertion, updating, altering, deletion of data, and
viewing/querying records based on condition in databases)**.
6. Implementation of built-in functions in RDBMS**.
7. Implementation of various aggregate functions in SQL**.
8. Implementation of Order By, Group By & Having clause **.
9. Implementation of set operators nested queries, and join queries **.
10. Implementation of queries using temp tables.
11. Practice of SQL TCL commands like Rollback, Commit, Savepoint **.
12. Practice of SQL DCL commands for granting and revoking user privileges **.
13. Practice of SQL commands for creation of views and assertions ** .
14. Implementation of various control structures like IF-THEN, IF-THEN-ELSE, IF-THEN-
ELSIF, CASE, WHILE using PL/SQL **.
15. Creation of Procedures, Triggers and Functions**.
16. Creation of Packages **.
17. Creation of Cursors **.
18. Creation of PL/SQL blocks for exception handling **.
19. Database backup and restore using commands.
20. Query analysis using Query Plan/Show Plan.
21. Familiarization of NoSQL Databases and CRUD operations**.
22. Design a database application using any front end tool for any problem selected. The
application constructed should have five or more tables**.
** mandatory
Text Books
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
1. Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design and Application
Programming, Pearson Education, 2013.
2. Sliberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw
Hill, 2011.

References

1. Adam Fowler, NoSQL for Dummies, John Wiley & Sons, 2015
2. NoSQL Data Models: Trends and Challenges (Computer Engineering: Databases and Big
Data), Wiley, 2018

PRACTICE QUESTIONS

Design a normalised database schema for the following requirement.

The requirement: A library wants to maintain the record of books, members, book issue, book
return, and fines collected for late returns, in a database. The database can be loaded with book
information. Students can register with the library to be a member. Books can be issued to students
with a valid library membership. A student can keep an issued book with him/her for a maximum
period of two weeks from the date of issue, beyond which a fine will be charged. Fine is calculated
based on the delay in days of return. For 0-7 days: Rs 10, For 7 – 30 days: Rs 100, and for days
above 30 days: Rs 10 will be charged per day.

Sample Database Design

BOOK (Book_Id, Title, Language_Id, MRP, Publisher_Id, Published_Date, Volume, Status) //
Language_Id, Publisher_Id are FK (Foreign Key)
AUTHOR(Author_Id, Name, Email, Phone_Number, Status)

BOOK_AUTHOR(Book_Id, Author_Id) // many-to-many relationship, both columns are PK and

FK (Primary Key and Foreign Key)
PUBLISHER(Publisher_id, Name, Address)

MEMBER(Member_Id, Name, Branch_Code, Roll_Number, Phone_Number, Email_Id,

Date_of_Join, Status)
BOOK_ISSUE(Issue_Id, Date_Of_Issue, Book_Id, Member_Id, Expected_Date_Of_Return,
Status) // Book+Id and Member_Id are FKs
BOOK_RETURN(Issue_Id, Actual_Date_Of_Return, LateDays, LateFee) // Issue_Id is PK and FK
LANGUAGE(Language_id, Name) //Static Table for storing permanent data
LATE_FEE_RULE(FromDays, ToDays, Amount) // Composite Key
EXERCISES
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
1. Create a normalized database design with proper tables, columns, column types, and constraints
2. Create an ER diagram for the above database design.
3. Write SQL commands to
a. Create a database by name Library. Drop the database and re-create it.
b. Create DDL statements and create the tables and constraints (from the design) in the
database created in step-a (Library)
Notes: [ Create a script file and execute it. Create the script file in such a way that,,if the
table exists, drop the tables and recreate )]
c. Create and execute DROP TABLE command in tables with and without FOREIGN
KEY constraints.
d. Create and execute ALTER TABLE command in tables with data and without data.
e. Create and execute SQL commands to build indices on Member_Id and Book_Id on
table Book_Issue.
f. Create and execute GRANT/REVOKE commands on tables.
g. Create and execute SQL commands to insert data into each of the tables designed
h. Learn and execute bulk import of data to tables from CSV files (insert 1000 records of
books into the BOOK table from a CSV file).
i. Create and execute UPDATE/DELETE commands on tables. Try to update/delete rows
with Primary and Foreign Keys. Try bulk updates or deletes using SQL UPDATE
statement
4. Write SQLQuery to retrieve the following information
a. Get the number of books written by a given author
b. Get the list of publishers and the number of books published by each publisher
c. Get the names of authors who jointly wrote more than one book.
d. Get the list of books that are issued but not returned
e. Get the list of students who reads only ‘Malayalam’ books
f. Get the total fine collected for the current month and current quarter
g. Get the list of students who have overdue (not returned the books even on due date)
h. Calculate the fine (as of today) to be collected from each overdue book.
i. Members who joined after Jan 1 2021 but has not taken any books
5. Book return should insert an entry into the Book_Return table and also update the status in
Book_Issue table as ‘Returned’. Create a database TRANSACTION to do this operation (stored
procedure).
6. Create a database view ‘Available_Books’, which will list out books that are currently available
in the library
7. Create a database procedure to add, update and delete a book to the Library database (use
parameters).
8. Use cursors and create a procedure to print Books Issue Register (page wise – 20 rows in a
page)
9. Create a history table (you may use the same structure without any keys) for the MEMBER
table and copy the original values of the row being updated to the history table using a
TRIGGER.
10. NoSQL Exercise
a. Practice Mongo DB CRUD operations. Refer: https://docs.mongodb.com/manual/crud/
b. You may use a MongoDB local installation or cloud MongoDB services like MongoDB
Atlas for this exercise
c. For documentation: Refer: https://docs.mongodb.com/manual/introduction/
11. Application Development Problem examples:INTELLIGENCE AND MACHINE LEARNING
ARTIFICIAL
1) Inventory Control System.
2) Material Requirement Processing.
3) Hospital Management System.
4) Railway Reservation System.
5) Personal Information System.
6) Web Based User Identification System.
7) Timetable Management System.
8) Hotel Management System.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
OPERATING CATEGORY L T P CREDIT
CSL204 INTRODUCTION
SYSTEMS LAB
PCC 0 0 3 2 2019

Preamble: The course aims to offer students a hands-on experience on Operating System
concepts using a constructivist approach and problem-oriented learning. Operating systems are
the fundamental part of every computing device to run any type of software.

Prerequisite: Topics covered in the courses are Data Structures (CST 201) and Programming
in C (EST 102)

Course Outcomes:

At the end of the course, the student should be able to

Illustrate the use of systems calls in Operating Systems. (Cognitive knowledge:

CO1
Understand)

Implement Process Creation and Inter Process Communication in Operating

CO2
Systems. (Cognitive knowledge: Apply)
Implement Fist Come First Served, Shortest Job First, Round Robin and Priority-
CO3
based CPU Scheduling Algorithms. (Cognitive knowledge: Apply)

Illustrate the performance of First In First Out, Least Recently Used and Least
CO4
Frequently Used Page Replacement Algorithms. (Cognitive knowledge: Apply)
Implement modules for Deadlock Detection and Deadlock Avoidance in Operating
CO5
Systems. (Cognitive knowledge: Apply)
Implement modules for Storage Management and Disk Scheduling in Operating
CO6
Systems. (Cognitive knowledge: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern:

Continuous Assessment Test

End Semester Examination
Bloom’s Category (Internal Exam) Marks in
Marks in percentage
percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse

Evaluate
Create
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

ESE
Total Marks CIE Marks ESE Duration
Marks
150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva Voce : 15 marks

Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks,

Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be
converted out of 15 while calculating Internal Evaluation marks.

End Semester Examination Pattern: The percentage of marks will be distributed as

Algorithm 30 marks, Program 20 marks, Output 20 marks and Viva 30 marks. Total 75 marks.

Operating System to Use in Lab : Linux

Compiler/Software to Use in Lab : gcc

Progamming Language to Use in Lab : Ansi C

Fair Lab Record:

All Students attending the Operating System Lab should have a Fair Record. The fair record
should be produced in the University Lab Examination. Every experiment conducted in the
lab should be noted in the fair record. For every experiment in the fair record, the right hand
page should contain Experiment Heading, Experiment Number, Date of experiment, Aim of
the Experiment and the operations performed on them, Details of experiment including
algorithm and result of Experiment. The left hand page should contain a print out of the code
used for experiment and sample output obtained for a set of input.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS
OPERATING SYSTEMS LAB
* mandatory

1. Basic Linux commands

2. Shell programming
-Command syntax
-Write simple functions with basic tests, loops, patterns
3. System calls of Linux operating system:*
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of Linux operating system (open, read, write)
5. Implement programs for Inter Process Communication using Shared Memory *
6. Implement Semaphores*
7. Implementation of CPU scheduling algorithms. a) Round Robin b) SJF c) FCFS d)
Priority *
8. Implementation of the Memory Allocation Methods for fixed partition*
a) First Fit b) Worst Fit c) Best Fit
9. Implement l page replacement algorithms a) FIFO b) LRU c) LFU*
10. Implement the banker’s algorithm for deadlock avoidance. *
11. Implementation of Deadlock detection algorithm
12. Simulate file allocation strategies.
b) Sequential b) Indexed c) Linked
13. Simulate disk scheduling algorithms. *
c) FCFS b)SCAN c) C-SCAN

OPERATING SYSTEMS LAB - PRACTICE QUESTIONS

1. Write a program to create a process in linux.

2. Write programs using the following system calls of Linux operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
3. Write programs using the I/O system calls of Linux operating system (open, read, write)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. Given the list of processes, their CPU burst times and arrival times, display/print the
Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the
average waiting time and average turnaround time
5. Write a C program to simulate following non-preemptive CPU scheduling algorithms to
find turnaround time and waiting time.
a)FCFS b) SJF c) Round Robin (pre-emptive) d) Priority
6. Write a C program to simulate following contiguous memory allocation techniques
a) Worst-fit b) Best-fit c) First-fit
7. Write a C program to simulate paging technique of memory management.
8. Write a C program to simulate Bankers algorithm for the purpose of deadlock avoidance.
9. Write a C program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN
10. Write a C program to simulate page replacement algorithms a) FIFO b) LRU c) LFU
11. Write a C program to simulate producer-consumer problem using semaphores.
12. Write a program for file manipulation for display a file and directory in memory.
13. Write a program to simulate algorithm for deadlock prevention.
14. Write a C program to simulate following file allocation strategies.
a)Sequential b) Indexed c) Linked
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER IV
HONOURS
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
CODE COURSE NAME CATEGORY L T P CREDIT
Introduction

CST292 NUMBER THEORY VAC 4 0 0 4 2019

Preamble: This is the foundational course for awarding B. Tech. Honours in Computer Science and
Engineering with specialization in Security in Computing. The purpose of this course is to
create awareness among learners about the important areas of number theory used in computer
science. This course covers Divisibility & Modular Arithmetic, Primes & Congruences, Euler's
Function, Quadratic Residues and Arithmetic Functions, Sum of Squares and Continued fractions.
Concepts in Number Theory help the learner to apply them eventually in practical applications in
Computer organization & Security, Coding & Cryptography, Random number generation, Hash
functions and Graphics.

Prerequisite: A sound background in Higher Secondary School Mathematics

Course Outcomes: After the completion of the course the student will be able to

Illustrate modular arithmetic operations, methods and techniques (Cognitive Knowledge

CO1
Level:Understand)
Use the methods - Induction, Contraposition or Contradiction to verify the correctness of
CO2
mathematical assertions (Cognitive Knowledge Level: Apply)
Utilize theorems and results about prime numbers, congruences, quadratic residues and
CO3 integer factorization for ensuring security in computing systems (Cognitive Knowledge
Level: Analyse)
Illustrate uses of Chinese Remainder Theorem & Euclidean algorithm in Cryptography and
CO4
Security (Cognitive Knowledge Level: Apply)

Explain applications of arithmetic functions in Computer Science (Cognitive Knowledge

CO5
Level:Understand)

Implement Number Theoretic Algorithms using a programming language (Cognitive

CO6
Knowledge Level: Apply)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1 ! ! ! ! ! !

CO2 ! ! ! ! !

CO3 ! ! ! ! ! !

CO4 ! ! ! ! ! !

CO5 ! ! ! ! ! !

CO6
! ! ! ! ! ! !

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category Examination Marks
Test1 (Percentage) Test2 (Percentage) (Percentage)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyse

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the syllabus
and the Second Internal Examination shall be preferably conducted after completing remaining part of
the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly covered module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules and 1 question from
the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which a student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

SYLLABUS
Module 1

Divisibility and Modular Arithmetic:

Finite Fields – Groups, Rings and Fields.

Divisibility - Divisibility and Division Algorithms, Well ordering Principle,Bezout’s Identity.

Modular Arithmetic- Properties, Euclid's algorithm for the greatest common divisor, Extended Euclid’s
Algorithm, Least Common multiple, Solving Linear Diophantine Equations, Modular Division.

Module 2

Primes and Congruences:

Prime Numbers-Prime Numbers andprime-powerfactorization, Fermat and Mersenne primes.,

Primality testing and factorization.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Congruences-Linear congruences, Simultaneous linear congruences, Chinese Remainder Theorem,

Fermat’s little theorem, Wilson's theorem.

Module 3

Congruences with a Prime-Power Modulus&Euler's Function:

Congruences with a Prime-Power Modulus-Arithmetic modulo p, Pseudoprimes and Carmichael

numbers, Solving congruences modulo prime powers.

Euler's Function-Euler’s Totient function, Applications of Euler’s Totient function, Traditional

Cryptosystem, Limitations.

The Group of units- The group Un,Primitive roots, Existence of primitive roots, Applications of
primitive roots.

Module 4

Quadratic Residues & Arithmetic Functions :

Quadratic Residues- Quadratic Congruences, The group of Quadratic residues, Legendre symbol,
Jacobi Symbol, Quadratic reciprocity.

Arithmetic Functions- Definition and examples, Perfect numbers, Mobius function and its properties,
Mobius inversion formula, The Dirichlet Products.

Module 5

Sum of Squares and Continued Fractions:

Sum of Squares- Sum of two squares, The Gaussian Integers, Sum of three squares, Sum of four
squares.

Continued Fractions -Finite continued fractions, Infinite continued fractions, Pell's Equation, Solution
of Pell’s equation by continued fractions.

Text Books

1. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007.

2. Joseph Silverman, A Friendly introduction to Number Theory, Pearson Ed. 2009.

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Reference Books

1. William Stallings, Cryptography and Network Security Principles and Practice, Pearson Ed.
2. Tom M.Apostol, ‘Introduction to Analytic Number Theory’, Narosa Publishing House Pvt. Ltd,
New Delhi, (1996).

3. Neal Koblitz, A course in Number Theory and Cryptography, 2nd Edition, Springer ,2004.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1): Describe the properties of modular arithmetic and modulo operator.

Course Outcome 2 (CO2): Prove that the equation y2 = x3 - 2 has only the integer solution (3, ±5).

Course Outcome 3 (CO3): State the law of reciprocity for Jacobi symbols and use it to determine
whether 888 is a quadratic residue or non residue of the prime 1999.

Course Outcome 4 (CO4): Using Chinese remainder theorem, solve the system of congruence x
≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7)

Course Outcome 5(CO5): State and prove Dirichlet product.

Course Outcome 6 (CO6):Use extended Euclid's algorithm to solve Diophantine equations

efficiently. Given three numbers a>0, b>0, and c, the algorithm should return some x and y such that
a x + b y = c.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES: 03
RegNo : …............................... Name :………..……………

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FOURTH SEMESTER BTECH (HONOURS) DEGREE EXAMINATION, MONTH &YEAR

Course Code:CST 292 Course

Name: Number Theory

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks (10x3=30)

1. State and prove well ordering principle.
2. Find gcd d of x=525 and y=231 and express d as ax + by where a and b are integers.
3. Solve the congruence equation 103 x≡ 57 (mod 211).
4. Use Fermat’s Little theorem to show that 91 is not a prime.
5. If m is relatively prime to n , show that Φ(mn) = Φ(m) Φ(n).
6. Explain how public key cryptography can be used for digital signatures.
7. Define Mobius function and prove Mobius function is a multiplicative.
8. State and prove Dirichlet product.
9. Show that every prime of the form 4k+1 canbe represented uniquely as the sum of two
squares.
10. Find the continued fraction representation of the rational number 55/89.

Part B

Answer any one Question from each module.

Each question carries 14 Marks

11. (a) State the Euclidean algorithm and its extension with an example. (7)
(b) Find all the solutions of 24x + 34 y = 6. (7)
OR
12. (a) Describe the properties of modular arithmetic and modulo operator. (7)
(b) Explain Extended Euclidean algorithm. Using the algorithm find the
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

multiplicative inverse of 135 mod 61 (7)

13. (a) State and prove Wilson’s theorem . (7)

(b) Explain Fermat’s factorization method and use it to factor 809009 (7)

OR
14. (a) Using Chinese remainder theorem, solve the system of congruences,
x ≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7) (7)
(b) Define Fermat primes. Show that any two distinct Fermat numbers are
Relatively prime. (7)

15. (a) Distinguish between public key and private key encryption techniques.
Also point out the merits and demerits of both. (7)
(b) Define Carmichael number and show that a Carmichael number must
be the product of at least three distinct primes. (7)

OR
16. (a)Define a pseudo prime to a base and find all non trivial bases for which
15 is a pseudo prime. (6)
(b) Find an element of
i) order 5 modulo 11 ii) order 4 modulo 13
iii) order 8 modulo 17 iv) order 6 modulo 19 (8)

17. (a) Determine the quadratic residues and non residues modulo 17. Also
determine whether 219 is a quadratic residue or non residue of the prime 383.
(8)
(b) State the law of quadratic reciprocity. Determine those odd primes p for
which 3 is a quadratic residue and those for which it is a non residue. (6)
OR
18. (a) State and prove properties of Legendre’s symbol. (7)
(b) State the law of reciprocity for Jacobi symbols and using it determine
whether 888 is a quadratic residue or non residue of the prime 1999. (7)

19. (a) Prove that the equation y2 = x3 - 2 has only the integer solution (3 , ±5). (7)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Define a Gaussian integer. Factorize the Gaussian integer 440 − 55i. (7)
OR
20. (a) If m, and n can be expressed as sum of four squares, then show that mn can
also be expressed the sum of four squares. (7)
(b) Find all the solutions of the Diophantine equation x2 – 6 y 2 =1. (7)

Teaching Plan

Module 1: Divisibility and Euclidean Algorithm 9 hours

1.1 Finite Fields – Groups and Rings. 1 hour

1.2 Finite Fields – Fields. 1 hour

1.3 Divisibility and Division Algorithms, Well ordering Principle. 1 hour

Decimal Expansion of a positive Integer, Greatest Common Divisor,

1.4 1 hour
Bezout’s Theorem.
Modular Arithmetic- Properties of congruences, Modular Arithmetic
1.5 1 hour
Operations, Properties of Modular Arithmetic.
Euclid's algorithm for the greatest common divisor, Extended Euclid’s
1.6 1 hour
Algorithm.

1.7 Solving Linear Diophantine Equations. 1 hour

1.8 Least Common multiple and Modular Division. 1 hour

Implementation of Euclid’s algorithm, Extended Euclid’s Algorithm and

1.9 1 hour
solution of Linear Diophantine Equations.

Module 2: Primes and Congruences 9 hours

2.1 Prime Numbersand prime-powerFactorization. 1 hour

2.2 Fermat and Mersenne primes. 1 hour

2.3 Primality testing and factorization, Miller -Rabin Test for Primality. 1 hour

2.4 Pollard's Rho Method for Factorization, Fermat’s Factorization. 1 hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.5 Linear congruences, Simultaneous linear congruences. 1 hour

2.6 Chinese Remainder Theorem. 1 hour

2.7 Implementation of Chinese Remainder Theorem. 1 hour

2.8 Fermat's little theorem. 1 hour

2.9 Wilson's theorem. 1 hour

Module 3: Congruences with a Prime-Power Modulus &Euler's Function 9 hours

3.1 Congruences with a Prime-Power Modulus, Arithmetic modulo p. 1 hour

3.2 Pseudo-primes and Carmichael numbers. 1 hour

3.3 Solving congruences modulo prime powers. 1 hour

3.4 Definition of Euler Totient function, Examples and properties. 1 hour

3.5 Multiplicativity of Euler's Totient function. 1 hour

3.6 Applications of Euler’s function, Euler’s Theorem. 1 hour

3.7 Traditional Cryptosystem, Limitations, Public Key Cryptography. 1 hour

3.8 The Group of Units, Primitive Roots. 1 hour

3.9 Existence of primitive roots for Primes, Applications of primitive roots. 1 hour

Module 4: Quadratic Residues and Arithmetic Functions 9 hours

4.1 Quadratic congruences, The group of Quadratic Residues. 1 hour

4.2 Legendre symbol, Jacobi Symbol. 1 hour

4.3 Quadratic reciprocity. 1 hour

4.4 Quadratic residues for prime-power moduli. 1 hour

4.5 Arithmetic Functions: Definition and examples. 1 hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.6 Perfect numbers, Definition and proposition. 1 hour

4.7 Mobius inversion formula., application of the Mobius inversion formula. 1 hour

4.8 Mobius function and its properties. 1 hour

4.9 The Dirichlet Product, Definition and proof. 1 hour

Module 5: Sum of Squares and Continued Fractions 9 hours

5.1 Sum of Squares, Sum of two squares. 1 hour

5.2 The Gaussian Integers. 1 hour

5.3 Sum of three squares. 1 hour

5.4 Sum of four squares. 1 hour

5.5 Continued Fractions, Finite continued fractions. 1 hour

5.6 Continued Fractions, Finite continued fractions. 1 hour

5.7 Infinite continued fractions. 1 hour

5.8 Pell's Equation, Definition. 1 hour

5.9 Solution of Pell's equation by continued fractions. 1 hour

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

COMPUTATIONAL Category Year of

L T P Credit
AIT294 FUNDAMENTALS FOR Introduction
BIOINFORMATICS VAC 3 1 0 4 2020

Preamble: Bioinformatics is an interdisciplinary area that combines Computer Science,

Molecular Biology, and Mathematics and allied areas of Science. This course covers
computational fundamentals of Bioinformatics and Computational Biology such as DNA, genes
and proteins, transcription, translation, sequence alignment, representation and basic Python
programming required for handling bioinformatics data. The learners will be able to solve basic
bioinformatics problems using python programming.

Prerequisite: Basic understanding of programming languages.

Mapping of course outcomes with program outcomes

CO 1 Describe the basic concepts of Bioinformatics with an emphasis on biological

macromolecules-DNA, RNA and Protein and synthesis of biomolecules (Cognitive
knowledge level : Understand)
CO 2 Identify biological data formats and databases, retrieve bio-sequences, and align bio-
sequences to identify similarity, dynamic programming (Cognitive knowledge level :
Apply)
CO 3 Illustrate nucleotide attributes and transcription using programming tools (Cognitive
knowledge level : Apply)
CO 4 Demonstrate the concepts of Parsing FASTA and Sequences Analysis (Cognitive
knowledge level : Apply)
CO 5 Compute k-mers, translation of DNA subsequences and Open reading frame.
(Cognitive knowledge level : Apply)

Mapping of course outcomes with program outcomes

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

CO1 √ √ √ √

CO2 √ √ √ √ √ √ √

CO3 √ √ √ √ √ √

CO4 √ √ √ √ √ √

CO5 √ √ √ √ √
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Test1 (%) Test2 (%) Examination

Remember 10 10 10
Understand 30 30 70
Apply 10 10 20
Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

SYLLABUS

Module-1 (Introduction to bioinformatics)

Introduction to bioinformatics, Nature & Scope of Bioinformatics, animal vs plants, Eukaryote
vs prokaryote,Nucleus. Chromosome, gene DNA, RNA, amino acids, and Protein, The Central
Dogma, Messenger RNA, tRNA, rRNA, Genetic code, Gene Structure, Transcription,
translation.

Module-2 (Introduction to bio sequences and analysis)

Introduction to Biological Databases and data storage, NCBI, Genbank, Bio sequence formats-
Database Similarity Searching, BLAST, Sequence alignment, Scoring Matrices, Multiple-
Sequence Alignment, Dynamic programming

Module 3: (Introduction to Processing Nucleotides)

Tetranucleotide Frequency, Counting the Nucleotides, Writing and Verifying a Solution,
Transcribing DNA into mRNA: Mutating Strings, Reading and Writing Files, Reverse
Complement of DNA, String Manipulation, Iterating Over a Reversed String.

Module 4: (Processing Nucleotides GC Content and Hamming Distance)

Creating the Fibonacci Sequence, Writing, Testing, and Benchmarking Algorithms, retrieving
FASTA Using Biopython, Iterating the Sequences Using a for Loop, Parsing FASTA and
Analyzing Sequences, Computing GC Content, Finding the Hamming Distance, Counting Point
Mutations
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Module 5 (Translation of DNA and subsequence)
K-mers and Codons, Translating Codons, Translating mRNA into Protein, Finding
Subsequences of DNA, Find a Motif in DNA, Finding Overlapping Patterns Using Regular
Expressions, Sequence Similarity, Finding the Shortest Sequence in a FASTA File, Extracting
K-mers from a Sequence, Counting Frequencies of K-mers, Finding Open Reading Frames

Text Books
1. Mount, D. W.. Bioinformatics: Sequence and Genome Analysis. India, CBS Publishers
& Distributors, 2005.
2. Youens-Clark, Ken. Mastering Python for Bioinformatics. United States: O'Reilly
Media, 2021.
References

1. Kelley, S.T. and Didulo, D, Computational Biology: A Hypertextbook. John Wiley & Sons,
2020

2. Baxevanis, Andreas D., Gary D. Bader, and David S. Wishart, eds. Bioinformatics. John
Wiley & Sons, 2020.
3. Shaik, Noor Ahmad, et al. Essentials of Bioinformatics, Volume I. Springer, 2019
4. Selzer, Paul M., Richard J. Marhöfer, and Andreas Rohwer, Applied bioinformatics. An
introduction–Springer, Verlag,, 2008.
5. S C Rastogi, N Mendiratta and P Rastogi, Bioinformatics: Methods and Applications, PHI
Learning Private Limited, New Delhi, 2015.
6. D E Krane and M L Raymer, Fundamental Concepts of Bioinformatics, Pearson Education,
2006.
7. Bassi, Sebastian. Python for Bioinformatics. United Kingdom: CRC Press, 2017.
8. Model, Mitchell L. Bioinformatics Programming Using Python. United States: O'Reilly
Media, 2010.
9. Antao, Tiago. Bioinformatics with Python Cookbook. United Kingdom: Packt
Publishing, 2015.Antao, Tiago. Bioinformatics with Python Cookbook: Learn how to Use
Modern Python Bioinformatics Libraries and Applications to Do Cutting-edge Research in
Computational Biology, 2nd Edition. United Kingdom: Packt Publishing, 2018.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Course Level Assessment Questions

Course Outcome 1 (CO1)

1. Compare and contrast the DNA and RNA on the basis of structure and functions.
2. Demonstrate with the help of a flow diagram the generation of protein using the
transcription and translation process.
Course Outcome 2 (CO2):

1. Identify the following qualifiers for GenBank and give their definitions: [ACCN],
[ALL], [AUTH], [ECNO], [FKEY], [GENE], [JOUR], [KYWD]
2. Find the sequence alignment between the following two sequences, locally and
Globally
Sequence1: GATTCTATCTAACTA, Sequence2: GTTCTATTCTAAC
3. Retrieve sequence of Severe acute respiratory syndrome coronavirus 2 and use BLAST to
find the similar sequences

Course Outcome 3 (CO3):

1. Write a Python program pseudocode to read the below given sequence as command line
argument and print the counts for each of the bases A, C, G, and T.
Sequence: ACTGCAACGGGCAATATGTCTC
2. Write a python pseudocode to transcribe the following DNA sequence to its mRNA
sequence.
Sequence: TGCAACGGGCAATATGTCTC
Course Outcome 4 (CO4)

1. Solve the problem of generating the Fibonacci sequence using Python.

2. Use a simple python program using a list to find the DNA string having the highest GC
content, provided any 5 random DNA strings.
Course Outcome 5 (CO5)

1. Illustrate with the help of an example how an RNA string is getting converted to a
protein string.
2. Write a python code to print the position and the number of times a subsequence is
present in a given DNA string.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
.
Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FOURTH SEMESTER B.TECH DEGREE (HONOURS) EXAMINATION, MONTH &

YEAR

Course Code: AIT294

Course Name: COMPUTATIONAL FUNDAMENTALS FOR BIOINFORMATICS

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate DNA, Gene, genome and chromosome.

2. What do you mean by Gene expression?

3. Specify the functions of mRNA, tRNA and rRNA?

4. Differentiate between local and global alignment.

5. Find the reverse complement of the following DNA given in 5’-3’order?

AAAACCCGGT

6. List any 3 string manipulation construct used in processing nucleotides.

7. Illustrate how recursion is implemented using a Python pseudocode.

8. What is GC content? Give the GC content of the DNA string: “AGCTATAG”.

9. Discuss the role of K-mers and codons in protein synthesis.

10. Define motif in DNA. Mention its importance in finding a conserved sequence.

(10x3=30)
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Discuss the central dogma of molecular biology. (7)

(b) How is the primary transcript produced by a prokaryote different from that (7)
produced by a eukaryotic cell?

OR

12. (a) Differentiate between Prokaryote and Eukaryote Cell (7)

(b) Describe with the help of a neat diagram, the structure of DNA. (7)

13. (a) What is sequence alignment? Explain any five applications of sequence (7)
alignment in Bioinformatics?

(b) Discuss variants of BLAST with its input and output (7)

OR

14. (a) Explain the working principles of the Nucleotide BLAST with an example (7)

(b) Differentiate primary and secondary databases in Bioinformatics. (7)

15. (a) How do you find the reverse complement of a DNA sequence? Write at least (10)
2 different Python pseudocodes using different constructs to print the reverse
complement of a given the 5’-3’ end of a DNA sequence.

(b) Write a Python pseudocode to convert DNA sequence to RNA sequence by (4)
using the re.sub() regular expression construct.

OR

16. (a) What is the need for ‘argparse’ module in Python? How can we use this (7)
module in different ways to do a tetra nucleotide frequency count?

(b) Write a Python program pseudocode to read the below given sequence as (7)
command line argument and print the counts for each of the bases A, C, G,
and T.

17. (a) Generate a random DNA sequence using python and find the transcribed (7)
DNA sequence of its reverse complement
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(b) Write a python code using regular expressions to find the DNA sequence (7)
having the highest GC content in a DNA sequence.

OR

18. (a) Define Hamming distance. Using hamming distance, find the percentage of (7)
similarity between the sequence AAACCCGGGTTT and AACCCGGGTTTA
with one sequence in line with other.

(b) Write a Python code using zip() function to find the hamming distance (7)
between 2 sequence. Give comments on each construct used in the code.

19. (a) Write a Python program using function and a list comprehension to translate (10)
RNA into protein. Illustrate working of the program with an example RNA
string.

(b) Illustrate with python pseudocode to show how the str.find( ) function can be (4)
used to find a substring and its position in an input sequence.

OR

20. (a) Illustrate with the help of an example how an RNA string is getting converted (6)
to a protein string..

(b) Write notes on ORF. Write a python code to find the ORF using the str.find( ) (8 )
and str.partition( ) functions.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
TEACHING PLAN

No Contents No of
Lecture
Hrs

Module-1 (Introduction to bioinformatics)(10 hrs)

1.1 Introduction to bioinformatics 1

1.2 Nature & Scope of Bioinformatics 1
1.3 Animal vs plants, Eukaryote vs prokaryote 1
1.4 Nucleus. Chromosome, gene 1

1.5 DNA, RNA, and Protein 1

1.6 The Central Dogma introduction 1
1.7 Messenger RNA, tRNA, rRNA, 1
1.8 Genetic code 1
1.9 Gene Structure and Control 1
1.10 Transcription, Translation 1

Module-2 (Introduction to bio sequences and analysis) (10 hrs)

2.1 Introduction to Biological Databases and data storage 1

2.2 NCBI, Genbank 1
2.3 NCBI, Genbank Sequence retrieval 1
2.4 Bio sequence formats 1
2.5 Database Similarity Searching, BLAST 1
2.6 BLAST Exercises 1
2.7 Sequence alignment 1
2.8 Scoring Matrices 1
2.9 Multiple-Sequence Alignment 1
2.10 Introduction to Dynamic programming in MSA 1

Module-3 (Introduction to Processing Nucleotides) (8 hrs)

3.1 Counting the Nucleotides, Writing and Verifying a Solution 1

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
3.2 Transcribing DNA into mRNA 1
3.3 Iterating the Input Files 1
3.4 Mutating Strings 1
3.5 Writing and Reading Output Sequences 1
3.6 Reverse Complement of DNA 1
3.7 String Manipulation 1
3.8 Iterating Over a Reversed String 1

Module-4 (Processing Nucleotides GC Content and Hamming Distance) (8 hrs)

4.1 Creating the Fibonacci Sequence 1

4.2 Writing, Testing, and Benchmarking Algorithms 1
4.3 Retrieving FASTA Using Biopython 1
4.4 Parsing FASTA and Analysing Sequences 1
4.5 Computing GC Content 1
4.6 Finding the Hamming Distance 1
4.7 Iterating the Characters of Two Strings 1
4.8 Counting Point Mutations 1

Module-5 (Translation of DNA and subsequence) (9 hrs)

5.1 K-mers and Codons 1

5.2 Translating mRNA into Protein 1
5.3 Finding Subsequence of DNA 1
5.4 Find a Motif in DNA 1
5.5 Finding Overlapping Patterns Using Regular Expressions 1
5.6 Sequence Similarity 1
5.7 Finding the Shortest Sequence in a FASTA File , Extracting K-mers from a 1
Sequence
5.8 Counting Frequencies of K-mers 1
5.9 Finding Open Reading Frames 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ADVANCED TOPICS IN CATEGORY L T P CREDITS

AIT296
COMPUTER GRAPHICS
VAC 3 1 0 4

Preamble: This course helps the learners to make awareness about strong theoretical concept in
computer graphics. It covers the three-dimensional environment representation in a computer,
transformation of 2D/3D objects, basic mathematical techniques and algorithms used to build
useful applications. This course enables the learners to develop the ability to create image
processing frameworks for different domains and develops algorithms for emerging display
technologies.

Prerequisite: A sound knowledge of Mathematics and concepts of any programming language.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge level:
CO1 Understand)

Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)

CO3 Demonstrate geometric representations and transformations on 2D & 3D objects.

(Cognitive Knowledge level: Apply)
CO4 Demonstrate the working of various clipping algorithms and projection algorithms.
(Cognitive Knowledge level: Apply)
CO5 Summarize visible surface detection methods(Cognitive Knowledge level:
Understand)
CO6 Explain the concept of realism in a scene and its performance
preservation(Cognitive Knowledge level: Understand)

Mapping of course outcomes with program outcomes

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

CO3

CO4
CO5
CO6
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Abstract POs defined by National Board of Accreditation
PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester
Category Test 1 (%) Test 2 (%) Examination
Marks (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Internal Examination Pattern:
Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one full
question. Each question can have maximum 2 sub-divisions and carries 14 marks.
SYLLABUS

Module – 1(Line and Circle drawing algorithms)

Basics of Computer Graphics and its applications. Video Display devices - Refresh Cathode Ray
Tubes, Random Scan Displays and systems, Raster scan displays and systems, Color CRT displays,
Flat panel display and its categories. Line drawing algorithms - DDA, Bresenham’s algorithm.
Circle drawing algorithms - Midpoint Circle generation algorithm, Bresenham’s algorithm.

Module - 2(Filled Area Primitives and Two dimensional transformations)

Filled Area Primitives- Scan line polygon filling, Boundary filling and flood filling. Two
dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing, Composite
transformations, Matrix representations and homogeneous coordinates.

Module - 3 (Clipping and 3D transformations)

Window to viewport transformation. Cohen Sutherland and Midpoint subdivision line clipping
algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping algorithms. Three
dimensional viewing pipeline. Basic 3D transformations.

Module - 4 (Projections and Visible Surface detection)

Projections- Parallel and Perspective projections. Visible surface detection algorithms- Back face
detection, Depth buffer algorithm, Scan line algorithm, A buffer algorithm

Module - 5 (Realism and performance)

Realism - Illumination Shading, Shadows, Texture mapping, Bump mapping, Environment
mapping, Transparency, Accumulation Buffer, Back face Culling, Visibility Culling.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Text Books
1. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
2. Aditi Majumder and M.Gopi , Introduction to VISUAL COMPUTING Core Concepts in
Computer Vision, Graphics, and Image Processing, 2018

References
1) William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics.
McGraw Hill, 2001
2) Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw
Hill, 2019.
3) David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
4) Donald Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with OpenGL,
PHI, 4e, 2013

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Compare the working principle of raster scan systems and random scan systems.
2. How much time is spent scanning across each row of pixels during screen refresh on a
raster system with resolution of 1280*1024 and a refresh rate of 60 frames per second?

Course Outcome 2 (CO2):

1. Rasterize the line with end points accepted from the user(2,3) and (5,8) using Bresenham’s
line drawing algorithm and implement it using any appropriate programming language.
(Assignment)
2. Illustrate how the 4-connected area filling approach differs from 8- connected area filling in
boundary filling algorithm and implement it using any appropriate programming
language.(Assignment)

Course Outcome 3 (CO3):

1. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3) , where the
position vector of the coordinate ABC is given as A(4,1), B(5,2) and C(4,3).
2. Implement the above transformation using any appropriate programming language with
user inputs. (Assignment)

Course Outcome 4 (CO4):

1. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen
Sutherland algorithm, find the visible portion of the line segment joining the points
P(40,80) and Q(120,30).
2. Implement Cohen Sutherland clipping algorithm using any appropriate programming
language with user inputs. (Assignment)

Course Outcome 5 (CO5):

1. Explain scan line algorithm for detecting visible surfaces in an object.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Course Outcome 6 (CO6):
1. You are rendering a black and white checkered tiled floor using a single texture mapped
polygon. The view is simulating a person standing on the floor and looking at a point far
away from him on the floor. (1)Artifacts at the distant end of the floor can be seen. How
would you remove these artifacts? (2) How can you explain why this method works using
the sampling theorem?
2. You are seeing an object which is either texture mapped, bump mapped or displacement
mapped but you don't know which one. However, you have the liberty to move the light and
the viewpoint of an object and see it from different angles and for different positions of the
light. How will you figure out which technique was used?

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FOURTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT296

Course Name: Advanced Topics in Computer Graphics

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Consider a raster system with a resolution of 1024*1024. Compute the size of the
raster needed to store 4 bits per pixel? How much storage is needed if 8 bits per
pixel are to be stored?

2. How 8-way symmetry of circle can be used for writing circle drawing algorithms?
Write the symmetric points if (x, y) is a point on the circle with centre at origin.

3. Show that two successive reflections about either of the coordinate axes is
equivalent to a single rotation about the coordinate origin.

4. Determine a sequence of basic transformations that are equivalent to the x-

direction shearing matrix.
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Find the window to viewport normalization transformation with window lower left
corner at (1,1) and upper right corner at (2,6).

6. How does Cohen Sutherland algorithm determine whether a line is visible,

invisible or a candidate for clipping based on the region codes assigned to the end
points of the line?

7. Define the terms (i) Centre of projection (ii) Principal vanishing point

8. Differentiate between the object space and image space method for the hidden
surface removal of an image.

9. Describe the steps used to convert the normal map to bump mapping.

10. One artifact of Gouraud shading is that it can miss specular highlights in the
interior of the triangles. How can this be explained as an aliasing artifact?
(10x3=30
)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Derive the initial decision parameter of Bresenham’s line drawing algorithm (8)
and rasterize a line with endpoints (2,2) and (10,10).

(b) Draw the architecture of raster scan display systems and explain its working (6)
principle

OR

12. (a) Explain the working principle of a Refresh CRT monitor with suitable (7)
diagrams.

(b) Write Midpoint circle drawing algorithm and plot a circle with radius=20 and (7)
center (50,30) using the algorithm.

13. (a) Differentiate between boundary fill and flood fill algorithms. (5)

(b) Reflect a triangle ABC about the line 3x-4y+8=0, where the position vector of (9)
the coordinate ABC is given as A(4,1), B(5,2) and C(4,3).

OR

14. (a) A diamond shaped polygon is located at P(-1,0), Q(0,-2), R(1,0) and S(0,2). (7)
Find the transformation matrix which would rotate the triangle by 90 degree
counter clockwise about the point Q. Using the transformation matrix, find
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
the coordinates of the rotated polygon.

(b) Illustrate the working principle of scan line polygon filling algorithm (7)

15. (a) Illustrate Weiler – Atherton polygon clipping algorithm. (6)

(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (8)
line P1 (70, 20) and P2(100,10) against a window lower left hand corner
(50,10) and upper right hand corner (80,40).

OR

16. (a) Describe the steps required for a general 3D rotation if the rotation axis is not (6)
parallel to any one of the principal axis. The rotation axis is defined by the
points P1(x1,y1,z1) and P2(x2,y2,z2). Give its composite matrix
representation

(b) Describe Sutherland Hodgeman polygon clipping algorithm and list out its (8)
limitations

17. (a) Explain how visible surfaces can be detected using depth buffer algorithm. (7)

(b) Define parallel projection. Describe orthographic and oblique parallel (7)
projection.

OR

18. (a) Illustrate the scan line method used in visible surface detection. (7)

(b) Explain the steps involved in performing perspective projections (7)

19. (a) Specify any three shading algorithms used in interactive graphics. (6)

(b) Explain the procedure of texture to object space mapping. (8)

OR

20. (a) Explain the mapping scheme in which the effects of small bumps on the (8)
surface of an object can be simulate without changing the number of
primitives

(b) Describe about object to screen space mapping. (6)

 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
TEACHING PLAN
No Contents No of Lecture
Hrs

Module – 1 (Line and Circle drawing algorithms) (10 hrs)

1.1 Basics of Computer Graphics and applications 1
1.2 Refresh Cathode Ray Tubes 1
1.3 Random and Raster Scan Displays and systems, 1
1.4 Color CRT displays 1
1.5 Flat panel display and its categories. 1
1.6 DDA Line drawing Algorithm 1
1.7 Bresenham’s line drawing algorithm 1
1.8 Midpoint Circle generation algorithm 1
1.9 Bresenham’s Circle generation algorithm 1
1.10 Illustration of line and circle drawing algorithms 1

Module - 2 (Filled Area Primitives and Two dimensional transformations) (9 hrs)

2.1 Scan line polygon filling 1
2.2 Boundary filling and flood filling 1
2.3 Basic 2D transformations-Translation 1
2.4 Basic 2D transformations- Rotation 1
2.5 Basic 2D transformations- Scaling 1
2.6 Reflection and Shearing 1
2.7 Illustration of Basic 2D Transformations 1
2.8 Composite transformations 1
2.9 Matrix representations and homogeneous coordinates 1

Module - 3 (Clipping and 3D transformations) ( 8 hrs)

3.1 Window to viewport transformation 1
3.2 Cohen Sutherland Line clipping algorithm 1
3.3 Midpoint subdivision Line clipping algorithm 1
3.4 Sutherland Hodgeman Polygon clipping algorithm 1
3.5 Weiler Atherton Polygon clipping algorithm 1
3.6 Three dimensional viewing pipeline 1
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
3.7 Basic 3D transformation-Translation and scaling 1
3.8 Basic 3D transformation-Rotation 1

Module - 4 (Projections and Visible Surface detection) (7 hrs)

4.1 Projections-Parallel projections 1
4.2 Projections- Perspective projections 1
4.3 Illustration of projection methods 1
4.4 Visible surface detection algorithms- Back face detection 1
4.5 Depth buffer algorithm 1
4.6 Scan line visible surface detection algorithm 1
4.7 A buffer algorithm 1

Module - 5 (Realism and performance)( 10 hrs)

5.1 Illumination 1
5.2 Shading and Shadows 1
5.3 Texture mapping-Texture to object space mapping 1
5.4 Texture mapping-Object to screen space mapping and Mip 1
Mapping
5.5 Bump mapping 1
5.6 Bump mapping-Illustration 1
5.7 Environment mapping and Transparency 1
5.8 Accumulation Buffer and Back face Culling 1
5.9 Visibility Culling 1
5.10 Visibility Culling 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER V
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

DATA HANDLING AND CATEGORY L T P CREDIT

AMT301
VISUALIZATION
PEC 3 1 0 4

Preamble: The syllabus is prepared with the view of facilitating the learner to get an
overview of data visualization. This course aims at providing fundamental knowledge in
various data visualization techniques using R programming language. It also deals with
security aspects involved in data visualization. The learner will be able to understand the
process and security aspects involved in data visualization and apply the tools in solving
complex problems.

Prerequisite: Nil

Course Outcomes: After the completion of the course the student will be able to:

Summarize the key techniques and theory used in visualization (Cognitive

CO 1 Knowledge Level : Understand)

Design and use various methodologies present in data visualization.

CO 2 (Cognitive Knowledge Level : Understand)
Employ various processes and tools for data visualization.
CO 3 (Cognitive Knowledge Level : Apply)
Use interactive data visualization to make inferences.(Cognitive
CO 4 Knowledge Level : Apply)

Recognize the process involved and security issues present in data

CO 5 visualization. (Cognitive Knowledge Level : Understand)

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO6 PO7 PO PO PO1 PO11 PO1

1 2 3 4 5 8 9 0 2

CO1

CO2

CO3

CO4

CO5
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO# Broad

PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

EndSemester
Bloom’s Test1 Test2 Examination Marks
Category (percentage) (percentage)
Remember 40 40 40
Understand 40 40 40
Apply 20 20 20
Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First Internal
Examination shall be preferably conducted after completing the first half of the syllabus and
the Second Internal Examination shall be preferably conducted after completing the
remaining part of the syllabus.There will be two parts: Part A and Part B. Part A contains 5
questions (preferably, 2 questions each from the completed modules and 1 question from the
partly covered module), having 3 marks for each question adding up to 15 marks for part A.
Students should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly covered module),
each with 7 marks. Out of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions
from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 questions from each module of which a student should answer any one.
Each question can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus

Module 1(Introduction to Data Visualization)

Introduction to Visualization – Need and purpose, External representation – Interactivity –

Difficulty in Validation, Data Abstraction: Dataset types – Attribute types – Semantics,
Task Abstraction – Analyse, Produce, Search, Query, Four levels of validation –
Validation approaches – Validation examples. Marks and Channels.
Data Visualization tools.
Module 2 (Arranging Spatial Data and Networks)

Arrange tables: Categorical regions – Spatial axis orientation – Spatial layout density,
Arrange spatial data: Geometry – Scalar fields – Vector fields – Tensor fields. Arrange
networks and trees: Connections, Matrix views – Containment, Map color: Color theory,
Color maps and other channels.

Module 3 (Data Visualization using R)

Installing packages in R, Data types in R, Special values in R, Matrices in R, Data frames

in R, Importing data in R, Exporting data in R, Writing a function in R, Writing if else
statements in R, Basic loops in R, Nested loops in R, The apply, lapply, sapply, and tapply
functions, Using par to beautify a plot in R, Saving plots

Module 4 (Basic and Interactive Plots)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Basic and Interactive Plots: scatter plot, interactive scatter plot, bar plot, line plot,
interactive Gantt/timeline chart, Merging histograms, interactive bubble plot, waterfall
plot, Heat Maps and Dendrograms: simple dendrogram, dendrograms with colors and
labels, heat map, heat map with customized colors, three-dimensional heat map and a
stereo map, tree map. Maps: regional maps, choropleth maps, contour maps, maps with
bubbles, Integrating text with maps, shapefiles, cartograms, Pie Chart and Its Alternatives,
Adding the Third Dimension: 3D scatter plot, 3D pie chart, 3D histogram, 3D contour plot.

Module 5 (Security Data Visualization)

Port scan visualization - Vulnerability assessment and exploitation - Firewall log

visualization - Intrusion detection log visualization - Attacking and defending visualization
systems – Creating security visualization system.

Text Books
1. Tamara Munzner, Visualization Analysis and Design, AK Peters Visualization Series,
CRC Press, Nov. 2014
2. Atmajitsinh Gohil, "R Data Visualization Cookbook", PACKT, 2015.
3. Greg Conti, “Security Data Visualization: Graphical Techniques for Network
Analysis”, NoStarch Press Inc, 2007.

Reference Books
1. A Julie Steele and Noah Iliinsky, Designing Data Visualizations: Representing
Informational Relationships, O’Relly.

2. Andy Kirk, Data Visualization: A Successful Design Process, PAKT.

3. Nathan Yau, "Data Points: Visualization that means something", Wiley, 2013.
4. Scott Murray, “Interactive data visualization for the web”, O‟Reilly Media, Inc., 2013.

Course Level Assessment Questions

CourseOutcome 1 (CO1): Illustrate the four levels of validation in Data Visualization.

CourseOutcome 2(CO2): Summarize the different methods to arrange spatial data and
networks.
Course Outcome 3(CO3): Apply the different R programming concepts
usingappropriate data types for applications.
Course Outcome 4 (CO4): Model the given dataset: [ 5, 10, 13, 19, 21, 25, 22, 18, 15,
13, 11, 12, 15, 20, 18, 17, 16, 18, 23, 25] using any 4 interactive plots and appropriate
visualizing charts.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 5 (CO5): Illustrate how email transmission at different levels of

network can be visualized.

Model Question Paper

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 301

Course Name: Data Handling and Visualization
Max. Marks : 100 Duration: 3 Hours
PART A
Answer All Questions. Each Question Carries 3 Marks

1. Define data visualization? Illustrate the need of data visualization.

2. Why do data semantics and data types matter in data visualization?

3. Describe the HSL system.

4. Discuss the different forms of data types in R. Give one example each.

5. Define the significance of data frames in R.

6. Describe scatterplot with an example.

7. Illustrate with examples how the waterfall plot constructed in R?

8. Compare chloropleth maps and cartograms.

9. Outline port scan visualization.

10. Explain vulnerability assessment in visualization? (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) “Splitting the complex problem of visualization design into four cascading (10)
levels provides an analysis framework that lets you address different
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

concerns separately”. Explain the four cascading levels with a diagram?

(b) Listthe threats to validate each of the levels? (4)

OR

12. (a) Define marks and channels. Explain how visual channels control the (8)
appearance of marks. How are these visual channels and marks used for
encoding different chart types?

(b) Illustrate the different data visualization tools. (6)

13. (a) Distinguish between node-link diagrams and matrix views. Also specify the (8)
costs and benefits of each.

(b) Explain Treemaps and GrouseFlocks. (6)

OR

14. (a) Summarize color mapping. Explain the different types of color maps. (8)

(b) Explain scalar fields, vector fields and tensor fields. (4)

15. (a) Implement a R program to count the number of NA values in a data frame (7)
column.

(b) Implement a R program to concatenate two given matrices of same column (7)
but different rows.

OR

16. (a) Explain in detail how the par() function can be used to beautify plots in R. (7)

(b) Implement a R program to extract every nth element from a vector. (7)

17. (a) Define is a dendrogram? Write the R code to construct a dendrogram. (7)

(b) Explain pie chart, its limitation and the steps involved for its construction in R. (7)

OR

18. (a) Illustrate the need of a 3D scatter plot? Write the sample code to generate a (7)
3D scatter plot in R.

(b) Illustrate how and where are shape files used and the step-by-step procedure (7)
to construct a shape file.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

19. (a) Summarize firewall log visualization. (7)

(b) Discuss in detail about intrusion detection log visualization. (7)

OR

20. (a) Describe the concept of attacking and defending visualization systems. (7)

(b) Describe about security visualization system. (7 )

Teaching Plan
No. of
Lecture
Hours
No Contents (45 hrs)
Module - 1 (Introduction to Data Visualization) (10 hours)
1.1 Introduction to Visualization – Need and purpose 1 hour
1.2 Data Abstraction: Dataset types 1 hour
1.3 Attribute types 1 hour
1.4 Semantics 1 hour
1.5 Task Abstraction, Actions 1 hour
1.6 Targets, Analysing and Deriving 1 hour
1.7 Four levels of validation 1 hour
1.8 Angles to attack, Threats to Validity 1 hour
1.9 Validation approaches 1 hour
1.10 Data Visualization tools 1 hour
Module - 2 (Arranging Spatial Data and Networks) (9 hours)
2.1 Arrange tables: Categorical regions – Spatial axis orientation 1 hour
2.2 Spatial layout density 1 hour
2.3 Arrange spatial data: Geometry – Scalar fields 1 hour
2.4 Vector fields 1 hour
2.5 Tensor Fields 1 hour
2.6 Arrange networks and trees: Connections 1 hour
2.7 Matrix views – Containment 1 hour
2.8 Map color: Color theory 1 hour
2.9 Color maps and other channels 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module- 3 (Data Visualization using R) (8 hours)

3.1 Installing packages in R 1 hour
3.2 Data types in R, Special values in R 1 hour
3.3 Matrices in R, Data frames in R 1 hour
3.4 Importing data in R, Exporting data in R 1 hour
3.5 Writing a function in R, Writing if else statements in R 1 hour
3.6 Basic loops in R, Nested loops in R 1 hour
The apply,lapply,sapply, and tapplnyfuctions, Using par to beautify a plot
3.7 1 hour
in R
3.8 Saving plots ,Drawing with data 1 hour
Module - 4 (Basic and Interactive Plots) (12 hours)
4.1 Basic and Interactive Plots: scatter plot 1 hour
4.2 Interactive Scatter Plot 1 hour
4.3 Interactive Gantt/timeline chart, Merging histograms 1 hour
4.4 Interactive bubble plot, waterfall plot 1 hour
Heat Maps and Dendrograms : simple dendrogram, dendrograms with
4.5 1 hour
colors and labels
4.6 Heat Map, Heat map with customized colors 1 hour
4.7 Three-dimensional heat map and a stereo map, tree map
4.8 Maps: regional maps, choropleth maps, contour maps 1 hour
4.9 Maps with bubbles, Integrating text with maps, shape files, cartograms 1 hour
4.10 Pie Chart and Its Alternatives 1 hour
4.11 Adding the Third Dimension: 3D scatter plot 1 hour
4.12 3D pie chart, 3D histogram, 3D contour plot 1 hour
Module- 5 (Security Data Visualization) (6 hours)
5.1 Port scan visualization 1 hour
5.2 Vulnerability assessment and exploitation 1 hour
5.3 Firewall log visualization 1 hour
5.4 Intrusion detection log visualization 1 hour
5.5 Attacking and defending visualization systems 1 hour
5.6 Creating security visualization system 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
CST COMPUTER Category L T P Credit
Introduction
303 NETWORKS
PCC 3 1 0 4 2019

Preamble: Study of this course provides the learners a clear understanding of how computer
networks from local area networks to the massive and global Internet are built, how they allow
computers to share information and communicate with one another. This course covers the
physical aspects of computer networks, layers of OSI Reference model, and inter-networking.
The course helps the learners to compare and analyze the existing network technologies and
choose a suitable network design for a given system.

Prerequisite: Nil

Course Outcomes: After the completion of the course, the student will be able to

CO# Course Outcomes

Explain the features of computer networks, protocols, and network design

CO1 models (Cognitive Knowledge: Understand)

Describe the fundamental characteristics of the physical layer and identify the
CO2 usage in network communication (Cognitive Knowledge: Apply)

Explain the design issues of data link layer, link layer protocols, bridges and
CO3 switches (Cognitive Knowledge: Understand)

Illustrate wired LAN protocols (IEEE 802.3) and wireless LAN protocols (IEEE
CO4 802.11) (Cognitive Knowledge: Understand)

Select appropriate routing algorithms, congestion control techniques, and

CO5 Quality of Service requirements for a network (Cognitive Knowledge: Apply)

CO6 Illustrate the functions and protocols of the network layer, transport layer, and
application layer in inter-networking (Cognitive Knowledge: Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

End Semester
Test 1 (Marks in Test 2 (Marks
Bloom’s Category Examination (Marks in
percentage) in percentage)
percentage)

Remember 40 30 30
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Understand 50 50 50
Apply 10 20 20

Analyze

Evaluate

Create

Mark Distribution

ESE
Total Marks CIE Marks ESE Marks
Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus. The second series
test shall be preferably conducted after completing the remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer anyone. Each
question can have maximum 2 sub-divisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

Module - 1 (Introduction and Physical Layer)

Introduction – Uses of computer networks, Network hardware, Network software. Reference

models – The OSI reference model, The TCP/IP reference model, Comparison of OSI and
TCP/IP reference models.

Physical Layer – Modes of communication, Physical topologies, Signal encoding, Repeaters and
hub, Transmission media overview. Performance indicators – Bandwidth, Throughput, Latency,
Queuing time, Bandwidth–Delay product.

Module - 2 (Data Link Layer)

Data link layer - Data link layer design issues, Error detection and correction, Sliding window
protocols, High-Level Data Link Control(HDLC)protocol. Medium Access Control (MAC)
sublayer –Channel allocation problem, Multiple access protocols, Ethernet, Wireless LANs -
802.11, Bridges & switches - Bridges from 802.x to 802.y, Repeaters, Hubs, Bridges, Switches,
Routers and Gateways.

Module - 3 (Network Layer)

Network layer design issues. Routing algorithms - The Optimality Principle, Shortest path
routing, Flooding, Distance Vector Routing, Link State Routing, Multicast routing, Routing for
mobile hosts. Congestion control algorithms. Quality of Service (QoS) - requirements,
Techniques for achieving good QoS.

Module - 4 (Network Layer in the Internet)

IP protocol, IP addresses, Internet Control Message Protocol (ICMP), Address Resolution

Protocol (ARP), Reverse Address Resolution Protocol (RARP), Bootstrap Protocol (BOOTP),
Dynamic Host Configuration Protocol (DHCP). Open Shortest Path First(OSPF) Protocol,
Border Gateway Protocol (BGP), Internet multicasting, IPv6, ICMPv6.

Module – 5 (Transport Layer and Application Layer)

Transport service – Services provided to the upper layers, Transport service primitives. User
Datagram Protocol (UDP). Transmission Control Protocol (TCP) – Overview of TCP, TCP
segment header, Connection establishment &release, Connection management modeling, TCP
retransmission policy, TCP congestion control.

Application Layer –File Transfer Protocol (FTP), Domain Name System (DNS), Electronic
mail, Multipurpose Internet Mail Extension (MIME), Simple Network Management Protocol
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(SNMP), World Wide Web(WWW) – Architectural overview.

Text Books

1. Andrew S. Tanenbaum, Computer Networks, 4/e, PHI (Prentice Hall India).

2. Behrouz A Forouzan, Data Communication and Networking, 4/e, Tata McGraw Hill

Reference Books
1. Larry L Peterson and Bruce S Dave, Computer Networks – A Systems Approach, 5/e,
Morgan Kaufmann.
2. Fred Halsall, Computer Networking and the Internet, 5/e.
3. James F. Kurose, Keith W. Ross, Computer Networking: A Top-Down Approach, 6/e.
4. Keshav, An Engineering Approach to Computer Networks, Addison Wesley, 1998.
5. W. Richard Stevens. TCP/IP Illustrated Volume 1, Addison-Wesley, 2005.
6. William Stallings, Computer Networking with Internet Protocols, Prentice-Hall, 2004.
7. Request for Comments (RFC) Pages - IETF -https://www.ietf.org/rfc.html

Course Level Assessment Questions

Course Outcome1 (CO1)

1. Compare TCP/IP and OSI reference model.
2. The purpose of physical layer is to transport a raw bit stream from one machine to
another. Justify.
Course Outcome2 (CO2)
1. Write the physical and transmission characteristics of Optical Fibre Cable guided
transmission media.
2. The distance between the sender and receiver systems is about 200 KM. The speed of
transmission is 2GB/s. Find out the propagation time?
Course Outcome3 (CO3)
1. Ethernet frames must be at least 64 bytes long to ensure that the transmitter is still going
in the event of a collision at the far end of the cable. Fast Ethernet has the same 64-byte
minimum frame size but can get the bits out ten times faster. How is it possible to
maintain the same minimum frame size?
2. What do you mean by bit stuffing?
Course Outcome4 (CO4)
1. Draw and explain the frame format for Ethernet.
2. Give the differences between CSMA/CD and CSMA/CA protocol.
Course Outcome5 (CO5)
1. Consider the given subnet in which distance vector routing is used, and the vectors just
come in to router C as follows: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10);
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

and from E: (7, 6, 3, 9, 0, 4). The measured delays from C to B, D, and E, are 6, 3, and
5, respectively. What is C’s new routing table? Give both the outgoing line to use and
the expected delay.

2. Illustrate the leaky bucket congestion control technique.

Course Outcome 6 (CO6)
1. How do you subnet the Class C IP Address 206.16.2.0 so as to have 30 subnets. What
is the subnet mask for the maximum number of hosts? How many hosts can each
subnet have?
2. Give the architecture of World Wide Web.

Model Question Paper

QP CODE: PAGES:

Reg No:
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST 303
Course Name : Computer Networks
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)

1. What does “negotiation" mean when discussing network protocols in a

layered architecture? Give an example.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Define simplex, half-duplex, and full-duplex transmission modes. Give one

example for each.

3. Data link protocols almost always put the CRC in a trailer rather than in a header.
Why?

4. An 8-bit byte with binary value 10101111 is to be encoded using an even-parity

Hamming code. What is the binary value after encoding?

5. Illustrate the Count to Infinity problem in routing.

6. Describe two major differences between the warning bit method and the
Random Early Detection (RED) method.

7. The Protocol field used in the IPv4 header is not present in the fixed IPv6 header.
Why?

8. How many octets does the smallest possible IPv6 (IP version 6) datagram contain?

9. Can Transmission Control Protocol(TCP) be used directly over a network

(e. g. an Ethernet) without using IP? Justify your answer.

10. When Web pages are sent out, they are prefixed by MIME headers. Why?
(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)

11. (a) With a neat diagram, explain Open Systems Interconnection (OSI) Reference
Model. (8)

(b) Compare Twisted Pair, Coaxial Cable and Optical Fibre guided transmission
media. (6)

OR

12. (a) Consider two networks providing reliable connection-oriented service. One
of them offers a reliable byte stream and the other offers a reliable message (8)
stream. Are they identical? Justify your answer.

(b) Sketch the waveform in Manchester and Differential Manchester Encoding (6)
for the bitstream 11000110010.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

13. (a) A bit stream 10011101 is transmitted using the standard CRC method. The
generator polynomial is 𝜖𝜖3 + 1. Show the actual bit string transmitted.
Suppose the third bit from the left is inverted during transmission. Show that
this error is detected at the receiver's end.
(8)

(b) Explain the working of High-Level Data Link Control (HDLC) protocol.
(6)

OR

14. (a) Explain the working of IEEE 802.11 MAC sublayer. (10)

(b) Distinguish between Bridges and Switches. (4)

15. (a) Illustrate Distance Vector Routing algorithm with an example. (8)

(b) Explain the characteristics of Routing Information Protocol (RIP). (6)

OR

16. (a) A computer on a 6-Mbps network is regulated by a token bucket. The token
bucket is filled at a rate of 1 Mbps. It is initially filled to capacity with 8 (8)
megabits. How long can the computer transmit at the full 6 Mbps?

(b) Explain how routing is performed for mobile hosts. (6)

17. (a) Explain the address resolution problem using Address Resolution Protocol (10)
(ARP) and Reverse Address Resolution Protocol (RARP)with an example
network.

(b) A network on the Internet has a subnet mask of 255.255.240.0. What is the (4)
maximum number of hosts it can handle?

OR

18. (a) How do you subnet the Class C IP address 195.1.1.0 so as to have 10 subnets (6)
with a maximum of 12 hosts in each subnet.

(b) Draw IPv6 Datagram format and explain its features. (8)

19. (a) Distinguish the header formats of Transmission Control protocol (TCP) and (8)
User Datagram Protocol (UDP).

(b) Explain the principal Domain Name System (DNS) resource record types for (6)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

IPv4.

OR

20. (a) What is the role of Simple Mail Transfer Protocol (SMTP) in E- mail? (6)

(b) With the help of a basic model, explain the working of World Wide Web (8 )
(WWW).

Teaching Plan

No Contents No of
Lecture
Hrs

Module – 1 (Introduction and Physical Layer) (10 hrs)

1.1 Introduction, Uses of computer networks. 1 hour

1.2 Network Hardware, Local Area Networks (LAN), Metropolitan Area 1 hour
Networks (MAN), Wide Area Networks (WAN), Wireless networks, Home
networks, Internetworks.

1.3 Network Software, Protocol hierarchies, Design issues for the layers. 1 hour

1.4 Connection-oriented and Connectionless services, Service primitives, 1 hour

Relationship of services to protocols.

1.5 Reference models, The OSI reference model. 1 hour

1.6 The TCP/IP reference model, Comparisonof OSI and TCP/IP reference 1 hour
models.

1.7 Physical layer, Modes of communication, Simplex, Half-duplex, and Full- 1 hour
duplex, Physical topologies, Mesh, Star, Bus, Ring, Hybrid.

1.8 Signal encoding, Manchester, Differential Manchester. 1 hour

1.9 Transmission media overview, Guided media (twisted pair, coaxial and 1 hour
fiber optic media), Unguided/wireless media (radio, microwave, and
infrared).

1.10 Performance indicators, Bandwidth (in Hertz and in Bits per Seconds), 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Throughput, Latency (Delay), Queuing time, Bandwidth-Delay product.

Module 2 – (Data Link Layer) (10 hrs)

2.1 Data link layer design issues. 1 hour

2.2 Error detection and correction, Error correcting codes 1 hour

2.3 Error detecting codes. 1 hour

2.4 Sliding window protocols. 1 hour

2.5 High-Level Data Link Control(HDLC) protocol. 1 hour

2.6 Medium Access Control (MAC) sublayer, Channel allocation problem, 1 hour
Multiple access protocols.

2.7 Ethernet, Ethernet cabling, Manchester encoding, Ethernet MAC sublayer 1 hour
protocol, Binary Exponential Backoff algorithm.

2.8 Ethernet performance, Switched Ethernet, Fast Ethernet, Gigabit Ethernet, 1 hour
IEEE 802.2: Logical Link Control.

2.9 Wireless LANs, 802.11 protocol stack, Physical layer, MAC Sublayer 1 hour
protocol, Frame structure.

2.10 Bridges &switches, Bridges from 802.x to 802.y, Repeaters, Hubs, 1 hour
Bridges, Switches, Routers, and Gateways.

Module 3 - (Network Layer) (8 hrs)

3.1 Network layer design issues. 1 hour

3.2 Routing algorithms, The Optimality Principle, Shortest path routing, 1 hour
Flooding.

3.3 Distance Vector Routing. 1 hour

3.4 Link State Routing. 1 hour

3.5 Multicast routing, Routing for mobile hosts. 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.6 General principles of congestion control, Congestion prevention policies, 1 hour

Congestion control in virtual circuit subnets.

3.7 Congestion control algorithms, Congestion control in Datagram subnets, 1 hour

Load shedding, Jitter control.

3.8 Quality of Service, Requirements, Techniques for achieving good Quality 1 hour
of Service.

Module 4 – (Network Layer in the Internet) (9 hrs)

4.1 Network layer in the Internet, Internet Protocol (IP). 1 hour

4.2 IP Addresses, Subnets, Classless Inter-Domain Routing (CIDR). 1 hour

4.3 IP Addresses, Network Address Translation (NAT). 1 hour

4.4 Internet Control Message Protocol (ICMP), Address Resolution Protocol 1 hour
(ARP), Reverse Address Resolution Protocol (RARP).

4.5 Bootstrap Protocol (BOOTP), Dynamic Host Configuration Protocol 1 hour

(DHCP).

4.6 Open Shortest Path First (OSPF) protocol. 1 hour

4.7 Border Gateway Protocol (BGP). 1 hour

4.8 Internet multicasting. 1 hour

4.9 IPv6, Header format, Extension headers, Internet Control Message Protocol 1 hour
version 6 (ICMPv6).

Module 5 - ( Transport Layer and Application Layer) (8 hrs)

5.1 Transport Service, Services provided to the upper layers, Transport service 1 hour
primitives. User Datagram Protocol (UDP).

5.2 Transmission Control Protocol (TCP), TCP segment header, Connection 1 hour
establishment &release, Connection management modeling.

5.3 TCP retransmission policy, TCP congestion control. 1 hour

5.4 Application layer, File Transfer Protocol (FTP). 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.5 Domain Name System (DNS). 1 hour

5.6 Electronic Mail, Multipurpose Internet Mail Extension (MIME). 1 hour

5.7 Simple Network Management Protocol (SNMP). 1 hour

5.8 World Wide Web, Architectural overview. 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMT 305 INTRODUCTION TO Category L T P Credit

MACHINE LEARNING
PCC 3 1 0 4

Preamble:
This course enables the learners to understand the advanced concepts and algorithms in machine
learning. The course covers the standard and most popular supervised learning algorithms such as
linear regression, logistic regression, decision trees, Bayesian learning and the Naive Bayes
algorithm, basic clustering algorithms and classifier performance measures. This course helps the
students to provide machine learning based solutions to real world problems.
Prerequisite: Basic understanding of probability theory and linear algebra

Mapping of course outcomes with program outcomes

CO1 Illustrate Machine Learning concepts and basics of supervised learning concepts.
(Cognitive Knowledge Level: Apply)
CO2 Describe dimensionality reduction techniques and supervised learning concepts
(regression, linear classification). (Cognitive Knowledge Level: Apply)
CO3 Solve real life problems using appropriate machine learning models and evaluate the
performance measures and Illustrate the concepts of Multilayer neural network .
(Cognitive Knowledge Level: Apply)
CO4 Illustrate basics of parameter estimation models and the working of classifier SVM
classifier model (Cognitive Knowledge Level: Apply)
CO5 Describe unsupervised learning concepts (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
Internal Examination Pattern
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall
be preferably conducted after completing remaining part of the syllabus. There will be two parts:
Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed
modules and 1 question from the partly completed module), having 3 marks for each question
adding up to 15 marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules and 1 question from
the partly completed module), each with 7 marks. Out of the 7 questions, a student should answer
any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
full questions from each module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module-1 (Overview of machine learning)
Introduction to Machine Learning, Machine learning paradigms-supervised, semi-supervised,
unsupervised, reinforcement learning.
Supervised learning- Input representation, Hypothesis class, Version space, Vapnik-Chervonenkis
(VC) Dimension, Probably Approximately Correct Learning (PAC), Noise, Learning Multiple
classes, Model Selection and Generalization
Module-2 (Supervised Learning)
Dimensionality reduction – Subset selection, Principal Component Analysis.
Regression - Linear regression with one variable, Linear regression with multiple variables, solution
using gradient descent algorithm and matrix method, basic idea of overfitting in regression. Linear
Methods for Classification- Logistic regression, Naive Bayes, Decision tree algorithm ID3.
Case Study: Develop a classifier for face detection.
Module-3 (Classification Assessment and Neural Networks (NN))
Classification Performance measures - Precision, Recall, Accuracy, F-Measure, Receiver Operating
Characteristic Curve(ROC), Area Under Curve AUC. Bootstrapping, Cross Validation.
Perceptron, Neural Network - Multilayer feed forward network, Activation functions (Sigmoid,
ReLU, Tanh), Backpropagation algorithm.

Module-4 (Parameter estimation & SVM Classifier)

Basics of parameter estimation - Maximum Likelihood Estimation(MLE) and Maximum a
Posteriori estimation(MAP). Bias-Variance decomposition.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Support Vector Machines - Introduction, Maximum Margin hyperplanes, Mathematics behind

Maximum Margin Classification, soft margin SVM classifier, non-linear SVM, Kernels for learning
non-linear functions, polynomial kernel, Radial Basis Function(RBF), Kernel Trick.

Module-5 (Unsupervised Learning)

Ensemble methods, Voting, Bagging, Boosting.
Unsupervised Learning - Clustering Methods -Similarity measures, K-means clustering,
Expectation-Maximization for soft clustering, Hierarchical Clustering Methods , Density based
clustering.
Text Book
1. Ethem Alpaydin, Introduction to Machine Learning, 2nd edition, MIT Press 2010.
2. Tom Mitchell, Machine Learning, McGraw-Hill, 1997.
Reference Books
1. Christopher Bishop. Neural Networks for Pattern Recognition,Oxford University Press,
1995.
2. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective, MIT Press 2012.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements Of Statistical Learning,
Second edition Springer 2007.
4. P. Langley, Elements of Machine Learning, Morgan Kaufmann, 1995.
5. Richert and Coelho, Building Machine Learning Systems with Python.
6. Mohammed J. Zaki and Wagner Meira, Data Mining and Analysis: Fundamental Concepts
and Algorithms, Cambridge University Press, First South Asia edition, 2016.
7. Jake VanderPlas, Python Data Science Handbook, O'Reilly Media, 2016
8. Davy Cielen, Arno DB Meysman and Mohamed Ali.Introducing Data Science: Big Data,
Machine Learning, and More, Using Python Tools, Dreamtech Press 2016.

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Compare different machine learning paradigms with suitable examples.
2. Explain (a) Hypothesis space (b) Version space (c) Most General hypothesis
(d) Most specific hypothesis in the context of a classification problem.
3. Define VC dimension. Show that an axis aligned rectangle can shatter 4 points
in 2 dimensions.
4. Explain the concept of PAC learning . Derive an expression for PAC learning
in such a way that the selected function will have low generalized error.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Distinguish between overfitting and underfitting. How it can affect model

generalization?

Course Outcome 2(CO2):

1. Suppose that you are asked to perform linear regression to learn the function that
outputs y, given the D-dimensional input x. You are given N independent data points,
and that all the D attributes are linearly independent. Assuming that D is around 100,
would you prefer the closed form solution or gradient descent to estimate the
regressor?
2. Suppose you have a three class problem where class label y ∈ 0, 1, 2 and each
training example X has 3 binary attributes X1, X2, X3 ∈ 0, 1. How many parameters
(probability distribution) do you need to know to classify an example using the Naive
Bayes classifier?
3. Is principal component analysis a supervised learning problem? Justify your answer
4. Explain feature selection and feature extraction method for dimensionality reduction.
5. Use the ID3 algorithm to construct a decision tree for the data in the following table.

Course Outcome 3(CO3):

1. Classifier A attains 100% accuracy on the training set and 70% accuracy on the test set.
Classifier B attains 70% accuracy on the training set and 75% accuracy on the test set.
Which one is a better classifier? Justify your answer.
2. What are ROC space and ROC curve in machine learning? In ROC space, which points
correspond to perfect prediction, always positive prediction and always negative prediction?
Why?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the three
classifiers are as follows – A (0, 1), B (1, 1) , C (1,0.5). Which can be considered as a
perfect classifier? Justify your answer.
4. Briefly explain Perceptron Network.
5. Briefly explain BackPropagation Network.
6. Briefly explain one way in which using tanh instead of logistic activations makes
optimization easier.
7. ReLU activation functions are most used in neural networks instead of the tanh
activation function. Draw both activation functions and give a) an advantage of the
ReLU function compared to the tanh function. b) a disadvantage of the ReLU
function compared to the tanh function.

Course Outcome 4(CO4): .

1. What are support vectors and list any three properties of the support vector classifier
solution?
2. Why do you use kernels to model a projection from attributes into a feature space,
instead of simply projecting the dataset directly?
3. Describe how Support Vector Machines can be extended to make use of kernels.
Illustrate with reference to the Gaussian kernel K(x, y) = e−z, where z = (x−y)2 .
4. A coin is tossed 100 times and lands heads 62 times. What is the maximum likelihood
estimate for θ, the probability of heads.
5. Suppose data x1, ..., xn are independent and identically distributed drawn from an
exponential distribution exp(λ). Find the maximum likelihood for λ.
6. Suppose x1, ..., xn are independent and identically distributed(iid) samples from a
distribution with density

Find the maximum likelihood estimate(MLE) for θ.

7. Find the maximum likelihood estimator (MLE) and maximum a posteriori (MAP) estimator
for the mean of a univariate normal distribution. Assume that we have N samples, x1,..., xN
independently drawn from a normal distribution with known variance σ2 and unknown
mean µ and the prior distribution for the mean is itself a normal distribution with mean ν
and variance β2. What happens to the MLE and MAP estimators as the number of samples
goes to infinity.

Course Outcome 5(CO5): .

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Illustrate the strength and weakness of the K-means algorithm.

2. Suppose you want to cluster the eight points shown below using k-means

Assume that k = 3 and that initially the points are assigned to clusters as follows:
C1 = {x1, x2, x3}, C2 = {x4, x5, x6}, C3 = {x7, x8}. Apply the k-means algorithm until
convergence, using the Manhattan distance.
3. Cluster the following eight points representing locations into three clusters: A1(2, 10), A2(2,
5), A3(8, 4), A4(5, 8), A5(7, 5), A6(6, 4), A7(1, 2), A8(4, 9).
Initial cluster centers are: A1(2, 10), A4(5, 8) and A7(1, 2).
The distance function between two points a = (x1, y1) and b = (x2, y2) is defined as D(a, b) =
|x2 – x1| + |y2 – y1|
Use k-Means Algorithm to find the three cluster centers after the second iteration.

4. What is ensemble learning? Can ensemble learning using linear classifiers learn
classification of linearly non-separable sets?
5. Describe boosting. What is the relation between boosting and ensemble learning?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 305

Course Name: Introduction to Machine Learning

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Distinguish
1 between classification and regression with an example.

2. Determine the hypothesis space H and version space with respect to the
following data D.

3. Is principal component analysis a supervised learning problem? Justify your

answer.

4. Specify the basic principle of gradient descent algorithm.

5. (a)Classifier A attains 100% accuracy on the training set and 70% accuracy on the test
set. Classifier B attains 70% accuracy on the training set and 75% accuracy on the test
set. Which one is a better classifier? Justify your answer.

(b) How does bias and variance trade-off affect machine learning algorithms?

6. Mention the primary motivation for using the kernel trick in machine learning
algorithms?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

7. Suppose that you have a linear support vector machine(SVM) binary classifier.
Consider a point that is currently classified correctly, and is far away from the decision
boundary. If you remove the point from the training set, and re-train the classifier, will
the decision boundary change or stay the same? Justify your answer.

8. Differentiate between bagging and boosting.

9. Illustrate the strength and weakness of the k-means algorithm.

10. Expectation maximization (EM) is designed to find a maximum likelihood setting of the
parameters of a model when some of the data is missing. Does the algorithm converge?
If so, do you obtain a locally or globally optimal set of parameters?

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Define machine learning. Explain different paradigms of machine learning with (7)
examples.

(b) Calculate the VC dimension of the following

1)An open internal in R is defined as(a,b) = {x€R | a<x<b}. It has two
parameters a and b. Calculate the VC dimension of the set of all open intervals.

2) Suppose the instance space X is the set of real numbers and the
hypothesis space H is the set of intervals on the real number line. Here, it is
evident that H is the set of hypotheses of the form a < x < b, where a and b
may be any real constants. What is VC(H)?

OR

12. (a) Let X = R2 and C be the set of all possible rectangles in two dimensional plane (7)
which are axis aligned (not rotated). Show that this concept class is PAC
learnable.

(b) What is meant by noise in data? What are the interpretations of noise? (7)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Consider the hypothesis for the linear regression hθ(x) = θ0 + θ1x, and the cost
13. (a) (7)
function J( θ0, θ1) = 1/2m Σ1m( hθ(x(i)) – y(i))2where m is the number of training
examples. Given the following set of training examples.

2. Answer the following questions :

3. 1) Find the value of hθ (2) if θ0= 0 and θ1 = 1.5
4. 2) Find the value of J(0,1)
3) Suppose the value of J( θ0, θ1) = 0. What can be inferred from this.

(b) Let X = R2 and C be the set of all possible rectangles in two dimensional plane (7)
which are axis aligned (not rotated). Show that this concept class is PAC
learnable.

OR

14. (a) The following dataset can be used to train a classifier that determines whether a (7)
given person is likely to own a car or not. There are three features: education level
(primary, secondary, or university); residence (city or country); gender (female,
male).

Use ID3 Algorithm and find the best attribute at the root level of the tree
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Consider a linear regression problem y = w1x + w0, with a training set having m (7)
examples (x1, y1), . . .(xm, ym). Suppose that we wish to minimize the mean 5th
degree error (loss function) given by 1/m Σ1m(yi −w1xi − w0)5.
1. Calculate the gradient with respect to the parameter w1.
2. Write down pseudo-code for on-line gradient descent on w1.
3. Give one reason in favor of on-line gradient descent compared to batch-gradient
descent, and one reason in favor of batch over on-line.

15. (a) Suppose the dataset had 9700 cancer-free images from 10000 images from cancer (7)
patients. Find precision, recall and accuracy ? Is it a good classifier? Justify.

Actual cancer = yes cancer = no Total

Class\Predicted
class
cancer = yes 90 210 300
cancer = no 140 9560 9700
Total 230 9770 10000

(b) Compare ReLU with Sigmoid function. Consider a neuron with four inputs, and (7)
weight of edge connecting the inputs are 1, 2, 3 and 4. Let the bias of the node is
zero and inputs are 2, 3, 1, 4. If the activation function is linear f(x)=2x, compute
the output of the neuron.

OR

16. (a)
( What are ROC space and ROC curve in machine learning? In ROC space, which (7)
points correspond to perfect prediction, always positive prediction and always
negative prediction? Why?

(b) Discuss with a flowchart ,explain how training and testing is performed in back- (7)
propagation neural networks?

17. (a) Compute the maximum likelihood estimate for the parameter λ in the Poisson (8)
distribution whose probability function is

(b) Explain the general MLE method for estimating the parameters of a probability (6)
distribution

OR

18. (a) State the mathematical formulation to express Soft Margin as a (8)
constraint optimization problem
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain Kernel Trick in the context of support vector machine. List any two (6)
kernel function used in SVM.

19. (a) Suppose that we have the following data (one variable). Use single linkage (8)
Agglomerative clustering to identify the clusters.
Data: (2, 5, 9, 15, 16, 18, 25, 33, 33, 45).

(b) Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8): (6)
(i) Compute the Euclidean distance between the two objects.
(ii) Compute the Manhattan distance between the two objects.
(iii) Compute the Minkowski distance between the two objects, using p = 3

OR

20. (a) Suppose that we have the following data: (8)

(2, 0), (1, 2), (2, 2), (3, 2), (2, 3), (3, 3), (2, 4), (3, 4), (4, 4), (3, 5)
Identify the cluster by applying the k-means algorithm, with k = 2. Try using initial
cluster centers as far apart as possible

(b) Describe EM algorithm for Gaussian Mixtures (6)

Teaching Plan

No. of
Lecture
No Contents Hours
(44 hrs)
Module -1 (Overview of machine learning) (8 hours)

Introduction to Machine Learning, Machine learning paradigms-supervised,

1.1 1 hour
semi-supervised, unsupervised, reinforcement learning.

1.2 Supervised learning- Input representation, Hypothesis class, Version space 2 hours

1.3 Vapnik-Chervonenkis (VC) Dimension 2 hours

1.4 Probably Approximately Correct Learning (PAC) 1 hour

1.5 Noise, Learning Multiple classes 1 hour

1.6 Model Selection and Generalization, Overfitting and Underfitting 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module-2 (Supervised Learning) (11 hours)

2.1 Dimensionality reduction – Subset selection, Principal Component Analysis. 2 hours

2.2 Linear regression with one variable (TB 1: Section 2.6) 1 hour

2.3 Multiple variables, Solution using gradient descent algorithm and matrix 2 hours
method (No derivation required) (TB 1: Section 5.8)
2.4 Logistic regression 1 hour

2.5 Naive Bayes (TB 2: Section 18.2) 2 hours

2.6 Decision trees (TB 2: Chapter 19) 1 hour

2.7 Decision trees- ID3 algorithm (TB 2: Chapter 19) 1 hour

Case Study: Develop a classifier for face detection.

2.8 1 hour

Module-3 (Classification Assessment and Neural Networks) (7 hours)

3.1 Performance measures - Precision, Recall, Accuracy, F-Measure, ROC, 2 hours

AUC. (TB 2: Chapter 22.1)
3.2 Bootstrapping, Cross validation 1 hour
3.3 Perceptron, Perceptron Learning 1 hour

3.4 Multilayer Feed forward Network, Activation Functions (Sigmoid, ReLU, 1 hour
Tanh)
3.5 Back Propagation Algorithm 1 hour
3.6 Illustrative Example for Back Propagation 1 hour
Module-4 (Parameter estimation & SVM Classifier)) (9 hours)
4.1 Basics of Parameter estimation 1 hour
4.2 Maximum Likelihood Estimation 1 hour

Maximum a Posteriori estimation(MAP). Bias-Variance decomposition.

4.3 1 hour

4.4 Introduction, Maximum Margin Hyperplane, 1 hour

4.5 Mathematics behind Maximum Margin Classification 1 hour
4.6 Formulation of maximum margin hyperplane and solution 1 hour
4.7 Soft margin SVM, Solution of Soft margin SVM 1 hour
Non-linear SVM , Kernels for learning non-linear functions, Examples -
4.8 Linear, RBF, Polynomial, Kernel trick 2 hours

Module-5 (Unsupervised Learning) (9 hours)

4.1 Ensemble Methods- Voting, Bagging, Boosting 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.2 Similarity measures- Minkowski distance measures( Manhattan, Euclidean), 1 hour

Cosine Similarity
4.3 K-means clustering (TB 2: Chapter 13) 1 hour
4.4 Clustering - Hierarchical Clustering (TB 2: Chapter 14) 2 hours
4.5 Density based Clustering 2 hours
4.6 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1 hour
4.7 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT 307 INTRODUCTION TO CATEGORY L T P CREDITS

ARTIFICIAL INTELLIGENCE
PCC 3 1 0 4

Preamble:
The course aims to introduce the fundamental principles of intelligent systems to students. This
involves ideas about the characteristics of intelligent systems, knowledge representation schemes,
logic and inference mechanisms. The course helps the learner to understand the design of self
learning systems along with some of their typical applications in the emerging scenario where the
business world is being transformed by the progress made in machine learning.

Prerequisite : NIL
Course Outcomes: After the completion of the course the student will be able to

CO# CO

Explain the fundamental concepts of intelligent systems and their architecture.

CO1 (Cognitive Knowledge Level: Understanding)

Illustrate uninformed and informed search techniques for problem solving in

CO2
intelligent systems. (Cognitive Knowledge Level: Understanding )

Solve Constraint Satisfaction Problems using search techniques. (Cognitive

CO3 Knowledge Level: Apply )
Represent AI domain knowledge using logic systems and use inference
techniques for reasoning in intelligent systems. (Cognitive Knowledge Level:
CO4
Apply )

Illustrate different types of learning techniques used in intelligent systems

CO5 (Cognitive Knowledge Level: Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

1 2 3 4 5 6 7 8 9 0 1 2

CO
1

CO
2

CO
3

CO
4

CO
5

Abstract POs defined by National Board of

Accreditation
PO Broad PO# Broad
# PO PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work
solutions
Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester Examination
Categor Marks (%)
y
Test 1 Test 2
(%) (%)
Remember 30 30 30
Understand 60 30 40
Apply 20 40 30

Analyze
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Evaluate
Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks
Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

Module – 1 (Introduction)
Introduction – What is Artificial Intelligence(AI) ? The Foundations of AI, History of AI,
Applications of AI. Intelligent Agents – Agents and Environments, Good behavior: The concept
of rationality, Nature of Environments - Specifying the task environment, Properties of task
environments. Structure of Agents - Agent programs, Basic kinds of agent programs.

Module – 2 (Problem Solving)

Solving Problems by searching-Problem solving Agents, Example problems, Searching for
solutions, Uninformed search strategies, Informed search strategies, Heuristic functions.

Module - 3 (Search in Complex environments)

Adversarial search - Games, Optimal decisions in games, The Minimax algorithm, Alpha-Beta
pruning. Constraint Satisfaction Problems – Defining CSP, Example Problems, Constraint
Propagation- inference in CSPs, Backtracking search for CSPs, Structure of CSP problems.

Module - 4 (Knowledge Representation and Reasoning)

Logical Agents – Knowledge based agents, Logic, Propositional Logic, Propositional Theorem
proving, Agents based on Propositional Logic. First Order Predicate Logic - Syntax and
Semantics of First Order Logic, Using First Order Logic, Knowledge representation in First
Order Logic. Inference in First Order Logic – Propositional Vs First Order inference, Unification
and Lifting, Forward chaining, Backward chaining, Resolution. Classical Planning - Algorithms
for planning state space search, Planning Graphs.

Module - 5 (Machine Learning)

Learning from Examples – Forms of Learning, Supervised Learning. Learning Decision Trees-
The decision tree representation, Inducing decision trees from examples, Choosing attribute
tests, Generaliztion and overfitting. Evaluating and choosing the best hypothesis, Regression
and classification with Linear models.

Text Book
1. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition.
Prentice Hall.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

References
1. Nilsson N.J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pvt. Ltd.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Explain about the basic types of agent programs in intelligent systems.
2. For the following activities, give a PEAS description of the task environment and characterize
it in terms of the task environment properties.
a) Playing soccer.
b) Bidding on an item at an auction.
Course Outcome 2 (CO2):
1. Differentiate between uninformed and informed search strategies in intelligent systems.
2. Illustrate the working of Minimax search procedure.

Course Outcome 3 (CO3):

1. Solve the following crypt arithmetic problem by hand, using the strategy
of backtracking with forward checking and the MRV & least-
constraining-value heuristics.

Course Outcome 4 (CO4):

1. Prove, or find a counter example to, the following assertion:
If α |= γ or β |= γ (or both) then (α ∧ β) |= γ
2. For each pair of atomic sentences, find the most general unifier if it exists:
a) P (A, B, B), P (x, y, z).
b) Q(y, G(A, B)), Q(G(x, x), y).

Course Outcome 5 (CO5):

1. Consider the following data set comprised of three binary input attributes (A1 , A2 , and
A3 ) and one binary output.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for these data. Show
the computations made to determine the attribute to split at each node.
2. What is multivariate linear regression? Explain.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 307

Course Name: Introduction To Artificial Intelligence

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1 What is a rational agent? Explain.

2 Describe any two ways to represent states and the transitions between them in
agent programs.

3 Differentiate between informed search and uninformed search.

4 Define heuristic function? Give two examples.

5 What are the components of a Constraint Satisfaction Problem? Illustrate with an

example.

6 Formulate the following problem as a CSP. Class scheduling: There is a fixed

number of professors and classrooms, a list of classes to be offered, and a list of
possible time slots for classes. Each professor has a set of classes that he or she
can teach.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

7 What is a knowledge based agent? How does it work?

8. Represent the following assertion in propositional logic:

“A person who is radical (R) is electable (E) if he/she is conservative (C), but
otherwise is not electable.”

9 Describe the various forms of learning?

10 State and explain Ockham’s razor principle? (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the structure Goal-based agents and Utility-based agents with the (8)
help of diagrams.

(b) For the following activities, give a PEAS description of the task environment (6)
and characterize it in terms of the task environment properties.
a) Playing soccer
b) Bidding on an item at an auction.

OR

12. (a) Explain the structure of Simple reflex agents and Model-based reflex agents (8)
with the help of diagrams.

(b) Discuss about any five applications of AI. (6)

13. (a) Explain Best First Search algorithm. How does it implement heuristic search? (6)

(b) Describe any four uninformed search strategies. (8)

OR

14. (a) Write and explain A* search algorithm. (6)

(b) Explain the components of a well defined AI problem? Write the standard (8)
formulation of 8-puzzle problem.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

15. (a) (a) Solve the following crypt arithmetic problem by hand, using the strategy (8)
of backtracking with forward checking and the MRV and least-constraining-
value heuristics.

(b) What is local consistency in CSP constraint propagation? Explain different (6)
types of local consistencies.

OR

16. (a) Illustrate the use of alpha-beta pruning in games. (6)

(b) Consider the following game tree in which static evaluation score are all from (8)
the players point of view: static evaluation score range is (+10 to -10)

Suppose the first player is the maximizing player. What move should be
chosen? Justify your answer.

17. (a) Convert the following sentences into first order logic: (6)
Everyone who loves all animals is loved by someone.
Anyone who kills an animal is loved by no one.
Jack loves all animals.
Either Jack or Curiosity killed the cat, who is named Tuna.
Did Curiosity kill the cat?

(b) Give a resolution proof to answer the question “Did Curiosity kill the cat? “ (8)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

18. (a) Draw a planning graph for the “have cake and eat cake too” problem up to (6)
level S2.

(b) For each pair of atomic sentences, give the most general unifier if it exists: (8)
Older (Father (y), y), Older (Father (x), John).

19. (a) How is best hypothesis selected from alternatives? (8)

(b) Explain Univariate Linear Regression. (6)

OR

20. (a) Consider the following data set comprised of two binary input attributes (A1 (8)
and A2) and one binary output.

Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for

these data. Show the computations made to determine the attribute to split at
each node.

(b) Explain Linear classification with logistic regression (6 )

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN
No Contents No of
Lecture
Hrs (44)

Module – 1 (Introduction) (9 hrs)

1.1 Introduction, What is Artificial Intelligence(AI)? 1
1.2 The foundations of AI, The history of AI 1
1.3 Applications of AI 1
1.4 Intelligent Agents – Agents and Environments 1
1.5 Good behavior: The concept of rationality 1
1.6 The nature of Environments- - Specifying the task environment 1
1.7 Properties of task environments 1
1.8 The structure of Agents - Agent programs 1
1.9 Basic kinds of agent programs 1

Module - 2 (Problem Solving by searching) (7 hrs)

2.1 Solving Problems by searching-Problem solving Agents 1
2.2 Illustration of the problem solving process by agents 1
2.3 Searching for solutions 1
2.4 Uninformed search strategies:BFS, Uniform-cost search, DFS, Depth- 1
limited search, Iterative deepening depth-first search
2.5 Informed search strategies: Best First search 1
2.6 Informed search strategies: A* Search 1
2.7 Heuristic functions 1

Module - 3 (Problem Solving in complex environments ) (8 hrs)

3.1 Adversarial search - Games 1
3.2 Optimal decisions in games, The Minimax algorithm 1
3.3 Alpha-Beta pruning 1
3.4 Constraint Satisfaction Problems – Defining CSP 1
3.5 Example Problem formulations 1
3.6 Constraint Propagation- inference in CSPs 1
3.7 Backtracking search for CSPs 1
3.8 The structure of problems 1

Module - 4 (Knowledge Representation and Reasoning) (12 hrs)

4.1 Logical Agents – Knowledge based agents and logic 1
4.2 Propositional Logic 1
4.3 Propositional Theorem proving 1
4.4 Agents based on Propositional Logic 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.5 First Order Predicate Logic – Syntax and Semantics of First Order 1
Logic
4.6 Using First Order Logic, Knowledge representation in First Order 1
Logic
4.7 Inference in First Order Logic – Propositional Vs First Order inference, 1
Unification and Lifting
4.8 Forward chaining, Backward chaining 1
4.9 Resolution 1
4.10 Classical Planning 1
4.11 Algorithms for planning state space search 1
4.12 Planning Graphs 1

Module - 5 ( Machine Learning)( 8 hrs)

5.1 Learning from Examples – Forms of Learning 1

5.2 Supervised Learning 1
5.3 Learning Decision Trees- The decision tree representation 1
5.4 Inducing decision trees from examples 1
5.5 Choosing attribute tests 1
5.6 Generalization and overfitting 1
5.7 Evaluating and choosing the best hypothesis 1
5.8 Regression and classification with Linear models. 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
CST MANAGEMENT OF Category L T P Credit
Introduction
309 SOFTWARE SYSTEMS
PCC 3 0 0 3 2019

Preamble: This course provides fundamental knowledge in the Software Development Process.
It covers Software Development, Quality Assurance, Project Management concepts and
technology trends. This course enables the learners to apply state of the art industry practices in
Software development.

Prerequisite: Basic understanding of Object Oriented Design and Development.

Course Outcomes: After the completion of the course the student will be able to

Demonstrate Traditional and Agile Software Development approaches (Cognitive

CO1
Knowledge Level: Apply)

Prepare Software Requirement Specification and Software Design for a given

CO2
problem. (Cognitive Knowledge Level: Apply)

Justify the significance of design patterns and licensing terms in software

CO3 development, prepare testing, maintenance and DevOps strategies for a project.
(Cognitive Knowledge Level: Apply)

Make use of software project management concepts while planning, estimation,

CO4 scheduling, tracking and change management of a project, with a traditional/agile
framework. (Cognitive Knowledge Level: Apply)

Utilize SQA practices, Process Improvement techniques and Technology

CO5 advancements in cloud based software models and containers & microservices.
(Cognitive Knowledge Level: Apply)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and

Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and

Finance

PO6 The Engineer and Society PO12 Lifelong learning

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Category
Test1 (Percentage) Test2 (Percentage) Examination Marks

Remember 30 30 30
Understand 40 40 50
Apply 30 30 20
Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE

Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks ( Each student shall identify a software

development problem and prepare Requirements Specification, Design Document, Project Plan
and Test case documents for the identified problem as the assignment. )

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing the
remaining part of the syllabus.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus

Module 1 : Introduction to Software Engineering (7 hours)

Introduction to Software Engineering - Professional software development, Software engineering

ethics. Software process models - The waterfall model, Incremental development. Process
activities - Software specification, Software design and implementation, Software validation,
Software evolution. Coping with change - Prototyping, Incremental delivery, Boehm's Spiral
Model. Agile software development - Agile methods, agile manifesto - values and principles.
Agile development techniques, Agile Project Management. Case studies: An insulin pump
control system. Mentcare - a patient information system for mental health care.

Module 2 : Requirement Analysis and Design (8 hours)

Functional and non-functional requirements, Requirements engineering processes. Requirements

elicitation, Requirements validation, Requirements change, Traceability Matrix. Developing use
cases, Software Requirements Specification Template, Personas, Scenarios, User stories, Feature
identification. Design concepts - Design within the context of software engineering, Design
Process, Design concepts, Design Model. Architectural Design - Software Architecture,
Architectural Styles, Architectural considerations, Architectural Design Component level design
- What is a component?, Designing Class-Based Components, Conducting Component level
design, Component level design for web-apps. Template of a Design Document as per “IEEE Std
1016-2009 IEEE Standard for Information Technology Systems Design Software Design
Descriptions”. Case study: The Ariane 5 launcher failure.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 3 : Implementation and Testing (9 hours)

Object-oriented design using the UML, Design patterns, Implementation issues, Open-source
development - Open-source licensing - GPL, LGPL, BSD. Review Techniques - Cost impact of
Software Defects, Code review and statistical analysis. Informal Review, Formal Technical
Reviews, Post-mortem evaluations. Software testing strategies - Unit Testing, Integration
Testing, Validation testing, System testing, Debugging, White box testing, Path testing, Control
Structure testing, Black box testing, Testing Documentation and Help facilities. Test automation,
Test-driven development, Security testing. Overview of DevOps and Code Management - Code
management, DevOps automation, Continuous Integration, Delivery, and Deployment
(CI/CD/CD). Software Evolution - Evolution processes, Software maintenance.

Module 4 : Software Project Management (6 hours)

Software Project Management - Risk management, Managing people, Teamwork. Project

Planning, Software pricing, Plan-driven development, Project scheduling, Agile planning.
Estimation techniques, COCOMO cost modeling. Configuration management, Version
management, System building, Change management, Release management, Agile software
management - SCRUM framework. Kanban methodology and lean approaches.

Module 5 : Software Quality, Process Improvement and Technology trends (6 hours)

Software Quality, Software Quality Dilemma, Achieving Software Quality Elements of

Software Quality Assurance, SQA Tasks , Software measurement and metrics. Software Process
Improvement(SPI), SPI Process CMMI process improvement framework, ISO 9001:2000 for
Software. Cloud-based Software - Virtualisation and containers, Everything as a service(IaaS,
PaaS), Software as a service. Microservices Architecture - Microservices, Microservices
architecture, Microservice deployment.

Text Books

1. Book 1 - Ian Sommerville, Software Engineering, Pearson Education, Tenth edition, 2015.
2. Book 2 - Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw
Hill publication, Eighth edition, 2014
3. Book 3 - Ian Sommerville, Engineering Software Products: An Introduction to
Modern Software Engineering, Pearson Education, First Edition, 2020.
References

1. IEEE Std 830-1998 - IEEE Recommended Practice for Software Requirements

SpeciÞcations
2. IEEE Std 1016-2009 IEEE Standard for Information Technology—Systems Design—
Software Design Descriptions
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. David J. Anderson, Kanban, Blue Hole Press 2010

4. David J. Anderson, Agile Management for Software Engineering, Pearson, 2003
5. Walker Royce, Software Project Management : A unified framework, Pearson Education,
1998
6. Steve. Denning, The age of agile, how smart companies are transforming the way work gets
done. New York, Amacom, 2018.
7. Satya Nadella, Hit Refresh: The Quest to Rediscover Microsoft’s Soul and Imagine a Better
Future for Everyone, Harper Business, 2017
8. Henrico Dolfing, Project Failure Case Studies: Lessons learned from other people’s
mistakes, Kindle edition
9. Mary Poppendieck, Implementing Lean Software Development: From Concept to Cash,
Addison-Wesley Signature Series, 2006
10. StarUML documentation - https://docs.staruml.io/
11. OpenProject documentation - https://docs.openproject.org/
12. BugZilla documentation - https://www.bugzilla.org/docs/
13. GitHub documentation - https://guides.github.com/
14. Jira documentation - https://www.atlassian.com/software/jira

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What are the advantages of an incremental development model over a waterfall
model?
2. Illustrate how the process differs in agile software development and traditional
software development with a socially relevant case study. (Assignment question)

Course Outcome 2 (CO2):

1. How to prepare a software requirement specification?
2. Differentiate between Architectural design and Component level design.
3. How does agile approaches help software developers to capture and define the user
requirements effectively?
4. What is the relevance of the SRS specification in software development?
5. Prepare a use case diagram for a library management system.

Course Outcome 3 (CO3):

1. Differentiate between the different types of software testing strategies.
2. Justify the need for DevOps practices?
3. How do design patterns help software architects communicate the design of a complex
system effectively?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. What are the proactive approaches one can take to optimise efforts in the testing phase?

Course Outcome 4 (CO4):

1. Illustrate the activities involved in software project management for a socially relevant
problem?
2. How do SCRUM, Kanban and Lean methodologies help software project
management?
3. Is rolling level planning in software project management beneficial? Justify your
answer.
4. How would you assess the risks in your software development project? Explain
how you can manage identified risks?

Course Outcome 5 (CO5):

1. Justify the importance of Software Process improvement?
2. Explain the benefits of cloud based software development, containers and
microservices.
3. Give the role of retrospectives in improving the software development process.
4. Illustrate the use of project history data as a prediction tool to plan future socially
relevant projects.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:
Reg No: _
Name : PAGES : 3
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST 309
Course Name: Management of Software Systems

Duration: 3 Hrs Max. Marks :100

PART A
Answer all Questions. Each question carries 3 marks
1. Why professional software that is developed for a customer is not simply
theprograms that have been developed and delivered.
2. Incremental software development could be very effectively used for customers
who do not have a clear idea about the systems needed for their operations.
Justify.
3. Identify any four types of requirements that may be defined for a software system

4. Describe software architecture

5. Differentiate between GPL and LGPL?

6. Compare white box testing and black box testing.

7. Specify the importance of risk management in software project management?

8. Describe COCOMO cost estimation model.

9. Discuss the software quality dilemma

10. List the levels of the CMMI model? (10x3=30

)
Part B
(Answer any one question from each module. Each question carries
14
Marks)
11. (a) Compare waterfall model and spiral model
(8)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain Agile ceremonies and Agile manifesto

(6)

12. (a) Illustrate software process activities with an example.

(8)

(b) Explain Agile Development techniques and Agile Project Management (6)

13. (a) What are functional and nonfunctional requirements? Imagine that you are
developing a library management software for your college, list eight (10)
functional requirements and four nonfunctional requirements.

(b) List the components of a software requirement specification?

(4)

OR

14. (a) Explain Personas, Scenarios, User stories and Feature identification? (8)

(b) Compare Software Architecture design and Component level design (6)

15. (a) Explain software testing strategies. (8)

(b) Describe the formal and informal review techniques. (6)

OR

16. (a) Explain Continuous Integration, Delivery, and Deployment CI/CD/CD)

(8)

(b) Explain test driven development (6)

17. (a) What is a critical path and demonstrate its significance in a project schedule (8)
with the help of a sample project schedule.

(b) Explain plan driven development and project scheduling. (6)

OR

18. (a) Explain elements of Software Quality Assurance and SQA Tasks. (6)

(b) What is algorithmic cost modeling? What problems does it suffer from when (8)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

compared with other approaches to cost estimation?

19. (a) Explain elements of Software Quality Assurance and SQA Tasks. (8)

(b) Illustrate SPI process with an example. (6)

OR

20. (a) Compare CMMI and ISO 9001:2000. (8)

(b) How can Software projects benefit from Container deployment and Micro (6 )
service deployment?

Teaching Plan

No of
No Contents Lecture
Hrs
Module 1 : Introduction to Software Engineering (7 hours)
1.1 Introduction to Software Engineering.[ Book 1, Chapter 1] 1 hour
1.2 Software process models [Book 1 - Chapter 2] 1 hour
1.3 Process activities [Book 1 - Chapter 2] 1 hour

1.4 Coping with change [Book 1 - Chapter 2, Book 2 - Chapter 4] 1 hour

1.5 Case studies : An insulin pump control system. Mentcare - a patient 1 hour
information system for mental health care. [Book 1 - Chapter 1]

1.6 Agile software development [Book 1 - Chapter 3] 1 hour

1.7 Agile development techniques, Agile Project Management.[Book 1 - Chapter 1 hour
3]
Module 2 : Requirement Analysis and Design (8 hours)
2.1 Functional and non-functional requirements, Requirements engineering 1 hour
processes [Book 1 - Chapter 4]
2.2 Requirements elicitation, Requirements validation, Requirements change, 1 hour
Traceability Matrix [Book 1 - Chapter 4]
2.3 Developing use cases, Software Requirements Specification Template [Book 1 hour
2 - Chapter 8]
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.4 Personas, Scenarios, User stories, Feature identification [Book 3 - 1 hour

Chapter 3]
2.5 Design concepts [Book 2 - Chapter 12] 1 hour
2.6 Architectural Design [Book 2 - Chapter 13] 1 hour
2.7 Component level design [Book 2 - Chapter 14] 1 hour
2.8 Design Document Template. Case study: The Ariane 5 launcher failure. 1 hour
[Ref
- 2, Book 2 - Chapter 16]
Module 3 : Implementation and Testing (9 hours)
3.1 Object-oriented design using the UML, Design patterns [Book 1 - 1 hour
Chapter 7]
3.2 Implementation issues, Open-source development - Open-source 1 hour
licensing -GPL, LGPL, BSD [Book 1 - Chapter 7]
3.3 Review Techniques - Cost impact of Software Defects, Code review 1 hour
andstatistical analysis. [Book 2 - Chapter 20]
34 Informal Review, Formal Technical Reviews, Post-mortem 1 hour
evaluations. [Book 2 - Chapter 20]
3.5 Software testing strategies - Unit Testing, Integration Testing, Validation 1 hour
testing, System testing and Debugging (basic concepts only). [Book 2 -
Chapter 22]
3.6 White box testing, Path testing, Control Structure testing, Black box 1 hour
testing. Test documentation [Book 2 - Chapter 23]
3.7 Test automation, Test-driven development, Security testing. 1 hour
[Book 3 -Chapter 9]
3.8 DevOps and Code Management - Code management, DevOps 1 hour
automation, CI/CD/CD. [Book 3 - Chapter 10]
3.9 Software Evolution - Evolution processes, Software maintenance. 1 hour
[Book 1 -Chapter 9]
Module 4 : Software Project Management (6 hours)
4.1 Software Project Management - Risk management, Managing 1 hour
people, Teamwork [Book 1 - Chapter 22]
4.2 Project Planning - Software pricing, Plan-driven development, Project 1 hour
scheduling, Agile planning [Book 1 - Chapter 23]
4.3 Estimation techniques [Book 1 - Chapter 23] 1 hour
4.4 Configuration management [Book 1 - Chapter 25] 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.5 Agile software management - SCRUM framework [Book 2 - Chapter 5] 1 hour

4.6 Kanban methodology and lean approaches.[Ref 9 - Chapter 2] 1 hour
Module 5 : Software Quality, Process Improvement and Technology trends (6
hours)
5.1 Software Quality, Software Quality Dilemma, Achieving Software Quality. 1 hour
[Book 2 - Chapter 19]
5.2 Elements of Software Quality Assurance, SQA Tasks , Software 1 hour
measurement and metrics. [Book 3 - Chapter 21]
5.3 Software Process Improvement (SPI), SPI Process [Book 2 - Chapter 37] 1 hour
5.4 CMMI process improvement framework, ISO 9001:2000 for Software. 1 hour
[Book 2 - Chapter 37]
5.5 Cloud-based Software - Virtualisation and containers, IaaS, PaaS, 1 hour
SaaS.[Book 3 - Chapter 5]
5.6 Microservices Architecture - Microservices, Microservices architecture, 1 hour
Microservice deployment [Book 3 - Chapter 6]
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PYTHON AND CATEGORY L T P Credit Year of Introduction

AML
MACHINE LEARNING
311 331
LAB 2
LAB 0 0 3 2022

Preamble:
This course enables the learners to get hands-on experience in most popular supervised learning
algorithms (such as linear regression, logistic regression, decision trees, Bayesian learning and
Naive Bayes algorithm) and unsupervised learning algorithms (such as basic clustering
algorithms). This helps the learners to understand the process of knowledge inference from raw
data through dataset preprocessing and analysis.
Prerequisite: Fundamentals of Programming, Python programming fundamentals, Machine
learning.
Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

CO1 Develop applications in Python programming. (Cognitive Knowledge Level: Apply )

CO2 Implement machine learning algorithms using packages and libraries in Python for various
applications.(Cognitive Knowledge Level: Apply)

CO3 Implement python programs for supervised learning methods through Neural network,
Regression and classification.(Cognitive Knowledge Level: Apply)

CO4 Implement clustering algorithms.(Cognitive Knowledge Level: Apply)

CO5 Apply dimensionality reduction as a dataset preprocessing step. (Cognitive Knowledge

Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Bloom’s Category Continuous Assessment Test End Semester

(Internal Exam) Marks in percentage Examination
Marks in percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 75 75 3 hours
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva voce : 15 marks

Internal Examination Pattern:

The Internal examination shall be conducted for 100 marks, which will be converted to out
of 15 while calculating Internal Evaluation marks. The marks will be distributed as,
Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva - 30 marks.

End Semester Examination Pattern:

The End Semester Examination shall be conducted for 100 marks, which will be converted
to out of 75 while calculating External Evaluation marks. The marks will be distributed as,
Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva- 30 marks.

Operating System to use in lab : Ubuntu , Windows

Fair Lab Record:

All the students attending the Python and machine learning lab should have a Fair Record.
Every experiment conducted in the lab should be noted in the fair record. For every
experiment, in the fair record, the right-hand page should contain experiment heading,
experiment number, date of experiment, aim of the experiment, procedure/algorithm
followed, other such details of the experiment and final result. The left-hand page should
contain a print out of the respective code with sample input and corresponding output
obtained. All the experiments noted in the fair record should be verified by the faculty
regularly. The fair record, properly certified by the faculty, should be produced during the
time of End Semester Examination for the verification by the examiners.

Syllabus

*Mandatory

1. Introduction to Python Programming.

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Familiarization of basic Python Libraries such as Sklearn, Numpy, Pandas and

Matplotlib.*
3. Write a Python program to find the union and intersection of two lists.
4. Design a Python program to count the occurrences of each word in a given
sentence.
5. Write a Python program to multiply two matrices.*
6. Write a Python program to find the most frequent words in a text file.*
7. Implement and demonstrate Single, Multi variable and Polynomial Regression for
a given set of training data stored in a .CSV file and evaluate the accuracy.*
8. Implement a Python program to perform logistic regression on a dataset.
9. Write a Python program to implement Naive Bayes classifier and calculate the
accuracy, precision, and recall for your data set.*
10. Write a Python program to demonstrate the working of the decision tree based ID3
algorithm. Use an appropriate data set for building the decision tree and apply this
knowledge to classify a new sample.*
11. Assuming a set of data that need to be classified, use a Support Vector Machine
classifier to perform this task and evaluate the accuracy.*
12. Implement K-Nearest Neighbor algorithm to classify any dataset.
13. Implement K-Means Clustering using any given dataset.*
14. Build an Artificial Neural Network using Backpropagation algorithm and test the
same with appropriate dataset.*
15. Implement dimensionality reduction using PCA.
( Use socially relevant dataset as far as possible )

Python and Machine Learning Lab-Practice Questions

1. Review of Python programming: Programs using matplotlib / plotly / bokeh /

seaborn.
2. Write a program to find words which are greater than a given length k.
3. Write a program to construct a Bayesian network considering medical data. Use this
model to demonstrate the diagnosis of heart patients using the standard Heart Disease
Dataset.
4. Implementation of Random Forest Classification in Python.
5. Write a program to implement k-Nearest Neighbor algorithm to classify the iris data
set. Print both correct and wrong predictions.
6. Program to implement text classification using Support vector machine.
7. The probability that it is Friday and that a student is absent is 3%. Since there are 5
school days in a week, the probability that it is Friday is 20%. What is the probability
that a student is absent given that today is Friday? Apply Bayes’ rule in python to get
the result. (Ans: 15%)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

8. Implement Naïve Bayes theorem to classify the English text.

9. Program to implement Mean-Shift algorithm in python.
10. Implement Agglomerative Hierarchical Clustering.
11. Apply K-Means clustering to evaluate Student’s performance. The results expected
show the profile of a student with criteria for excellent performance, standard
performance, and underperformance.

Reference Books:

1. Aurelien Geron, “Hands–On Machine Learning with Scikit–Learn and TensorFlow”,

O’Relily.
2. Christopher Bishop, “Pattern Recognition and Machine Learning”, Springer, 2007.
3. Ian Good fellow and Yoshua Bengio and Aaron Courville, “Deep Learning”, MIT Press,
2016.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIL AI ALGORITHMS CATEGORY L T P Credit Year of Introduction

333 LAB
LAB 0 0 3 2 2022

Preamble:
This laboratory course enables the students to get the fundamental concepts in the area of
Artificial Intelligence. This course covers the AI based Algorithms, logical reasoning agents and
implementation of these reasoning systems using either backward or forward inference
mechanisms. This course helps the learners to apply AI techniques to solve real world problems.
Prerequisite: A sound knowledge of the basics of programming, Discrete Mathematics.
Course Outcomes: After the completion of the course, the student will be able to:

CO# Course Outcomes

State the basics of learning problems with hypothesis and version spaces
CO1
(Cognitive Knowledge Level: Understand).

Demonstrate real-world problems as state space problems, optimization problems or

CO2 constraint satisfaction problems.
(Cognitive Knowledge Level: Apply)

Simulate given problem scenario and analyze its performance.

CO3
(Cognitive Knowledge Level: Apply)

Develop programming solutions for given problem scenario.

CO4
(Cognitive Knowledge Level: Apply)

Design and develop an expert system by using appropriate tools and techniques.
CO5
(Cognitive Knowledge Level: Apply)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and teamwork
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Bloom’s Category Continuous Assessment Test End Semester

(Internal Exam) Marks in Examination
percentage Marks in percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyze
Evaluate
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva voce : 15 marks

Internal Examination Pattern:

The internal examination shall be conducted for 100 marks, which will be converted to out
of 15, while calculating internal evaluation marks. The marks will be distributed as,
Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva - 30 marks.

End Semester Examination Pattern:

The end semester examination will be conducted for a total of 75 marks and shall be
distributed as, Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva- 30
marks.

Operating System to Use in Lab : Linux/Windows

Programming Language to Use in Lab : C++/Java/Python/Prolog

Fair Lab Record:

All the students attending the Artificial Intelligence Algorithms laboratory should have a
fair record. Every experiment conducted in the lab should be noted in the fair record. For
every experiment, in the fair record, the right-hand page should contain experiment heading,
experiment number, date of experiment, aim of the experiment, procedure/algorithm
followed, other such details of the experiment and final result. The left-hand page should
contain a print out of the respective code with sample input and corresponding output
obtained. All the experiments noted in the fair record should be verified by the faculty
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

regularly. The fair record, properly certified by the faculty, should be produced during the
time of end semester examination for the verification by the examiners.

Syllabus

*Mandatory

1. Installation and working on various AI tools viz. Python, R, GATE, NLTK, MATLAB etc.*

2. Implement basic search strategies for selected AI applications*.

3. Implement state space search algorithms*

4. Implement informed search algorithms*

5. Implement backtracking algorithms for CSP*

6. Implement local search algorithms for CSP*

7. Implement propositional logic inferences for AI tasks*

8. Implementation of Knowledge representation schemes*

9. Implement travelling salesman problem*

10. Implementation of Game playing (adversarial search)

11. Mini Project that implement a real world application using AI techniques (Group project
with a maximum of four students)

PRACTICE QUESTIONS

1. Implementation of Depth-First Search (DFS).

2. Write a program to implement water jug problem.

3. Implement variants of hill-climbing and genetic algorithms.

4. Implement tic tac toe game for 0 and X.

5. Develop a program to construct a pruned game tree using Alpha-Beta pruning. Take the
sequence, [5, 3, 2, 4, 1, 3, 6, 2, 8, 7, 5, 1, 3, 4] of MINIMAX values for the nodes at the
cutoff depth of 4 plies. Assume that branching factor is 2, MIN makes the first move, and
nodes are generated from right to left.

6. Write a program to implement production system.

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

7. Write a program to implement heuristic search procedure.

8. Write a program to implement Expert system.

9. Write a program to implement search problem of 3 x 3 puzzles.

References:

1. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007

2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
3. Patrick H. Winston, "Artificial Intelligence", Third edition, Pearson Edition, 2006
4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
(http://nptel.ac.in/)
5. Artificial Intelligence by Example: Develop machine intelligence from scratch using
real artificial intelligence use cases -by Dennis Rothman, 2018
6. Padhy, N.P. 2009. Artificial Intelligence and Intelligent Systems, Oxford University
Press
7. Brachman, R. and Levesque, H. 2004. Knowledge Representation and Reasoning,
Morgan Kaufmann.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER V
MINOR
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
CONCEPTS IN Category L T P Credit
CST Introduction
SOFTWARE
381
ENGINEERING
VAC 3 1 0 4 2019

Preamble: This course provides fundamental knowledge in the Software Development Process.
It covers Software Development, Quality Assurance and Project Management concepts. This
course enables the learners to apply state of the art industry practices in Software development.
Prerequisite: Basic understanding of Object Oriented Design and Development.
Course Outcomes: After the completion of the course the student will be able to

Differentiate Traditional and Agile Software Development approaches (Cognitive

CO1
Knowledge Level: Understand)

Prepare Software Requirement Specification and Software Design for a given

CO2
problem. (Cognitive Knowledge Level: Apply)

Justify the significance of design patterns and licensing terms in software

CO3 development, prepare testing, maintenance and DevOps strategies for a project.
(Cognitive Knowledge Level: Apply)

Make use of software project management concepts while planning, estimation,

CO4 scheduling, tracking and change management of a project, with proper application of
SCRUM, Kanban and Lean frameworks. (Cognitive Knowledge Level: Apply)

Utilize SQA practices, Process Improvement techniques and Technology

CO5 improvements namely cloud based software model and containers & microservices
in a Software Development Process. (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO12
0 1

CO1

CO2
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

End Semester
Bloom’s Category
Examination Marks
Test1 (Percentage) Test2 (Percentage)

Remember 30 30 30

Understand 30 30 30
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Apply 40 40 40

Analyse

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks ( Each student shall identify a software

development problem and prepare Requirements Specification, Design Document, Project Plan
and Test case documents for the identified problem as the assignment. )

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing the
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus

Module 1 : Introduction to Software Engineering (8 hours)

Introduction to Software Engineering - Professional software development, Software engineering
ethics. Software process models - The waterfall model, Incremental development. Process
activities - Software specification, Software design and implementation, Software validation,
Software evolution. Coping with change - Prototyping, Incremental delivery, Boehm's Spiral
Model. Agile software development - Agile methods, agile manifesto - values and principles.
Agile development techniques, Agile Project Management. Case studies : An insulin pump
control system. Mentcare - a patient information system for mental health care.

Module 2 : Requirement Analysis and Design (10 hours)

Functional and non-functional requirements, Requirements engineering processes. Requirements

elicitation, Requirements validation, Requirements change, Traceability Matrix. Developing use
cases, Software Requirements Specification Template, Personas, Scenarios, User stories, Feature
identification. Design concepts - Design within the context of software engineering, Design
Process, Design concepts, Design Model. Architectural Design - Software Architecture,
Architectural Styles, Architectural considerations, Architectural Design Component level design
- What is a component?, Designing Class-Based Components, Conducting Component level
design, Component level design for web-apps. Template of a Design Document as per “IEEE Std
1016-2009 IEEE Standard for Information Technology Systems Design Software Design
Descriptions”. Case study: The Ariane 5 launcher failure.

Module 3 : Implementation and Testing (12 hours)

Object-oriented design using the UML, Design patterns, Implementation issues, Open-source
development - Open-source licensing - GPL, LGPL, BSD. Review Techniques - Cost impact of
Software Defects, Code review and statistical analysis. Informal Review, Formal Technical
Reviews, Post-mortem evaluations. Software testing strategies - Unit Testing, Integration
Testing, Validation testing, System testing, Debugging, White box testing, Path testing, Control
Structure testing, Black box testing, Testing Documentation and Help facilities. Test automation,
Test-driven development, Security testing. Overview of DevOps and Code Management - Code
management, DevOps automation, CI/CD/CD. Software Evolution - Evolution processes,
Software maintenance.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 4 : Software Project Management (8 hours)

Software Project Management - Risk management, Managing people, Teamwork. Project

Planning, Software pricing, Plan-driven development, Project scheduling, Agile planning.
Estimation techniques, COCOMO cost modeling. Configuration management, Version
management, System building, Change management, Release management, Agile software
management - SCRUM framework. Kanban methodology and lean approaches.

Module 5 : Software Quality and Process Improvement (6 hours)

Software Quality, Software Quality Dilemma, Achieving Software Quality Elements of

Software Quality Assurance, SQA Tasks , Software measurement and metrics. Software Process
Improvement(SPI), SPI Process CMMI process improvement framework, ISO 9001:2000 for
Software.

Text Books

1. Book 1 - Ian Sommerville, Software Engineering, Pearson Education, Tenth edition, 2015.
2. Book 2 - Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw
Hill publication, Eighth edition, 2014
3. Book 3 - Ian Sommerville, Engineering Software Products: An Introduction to Modern
Software Engineering, Pearson Education, First Edition, 2020.
References

1. IEEE Std 830-1998 - IEEE Recommended Practice for Software Requirements

Specifications
2. IEEE Std 1016-2009 IEEE Standard for Information Technology—Systems Design—
Software Design Descriptions
3. David J. Anderson, Kanban, Blue Hole Press 2010
4. David J. Anderson, Agile Management for Software Engineering, Pearson, 2003
5. Walker Royce, Software Project Management : A unified framework, Pearson Education,
1998
6. Steve. Denning, The age of agile, how smart companies are transforming the way work gets
done. New York, Amacom, 2018.
7. Satya Nadella, Hit Refresh: The Quest to Rediscover Microsoft’s Soul and Imagine a Better
Future for Everyone, Harper Business, 2017
8. Henrico Dolfing, Project Failure Case Studies: Lessons learned from other people’s
mistakes, Kindle edition
9. Mary Poppendieck, Implementing Lean Software Development: From Concept to Cash,
Addison-Wesley Signature Series, 2006
10. StarUML documentation - https://docs.staruml.io/
11. OpenProject documentation - https://docs.openproject.org/
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

12. BugZilla documentation - https://www.bugzilla.org/docs/

13. GitHub documentation - https://guides.github.com/
14. Jira documentation - https://www.atlassian.com/software/jira

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. What are the advantages of an incremental development model over a waterfall model?
2. Compare agile software development with traditional software development?

Course Outcome 2 (CO2):

1. How to prepare a software requirement specification?
2. Differentiate between Architectural design and Component level design.
3. How do agile approaches help software developers to capture and define the user
requirements effectively?
4. What is the relevance of the SRS specification in software development?
5. Prepare a use case diagram for a library management system.

Course Outcome 3 (CO3):

1. Differentiate between the different types of software testing strategies.
2. What are the benefits of DevOps?
3. How do design patterns help software architects communicate the design of a complex
system effectively?
4. What are the proactive approaches one can take to optimise efforts in the testing phase?

Course Outcome 4 (CO4):

1. What are the activities involved in software project management?
2. What is the need for SCRUM, Kanban and Lean methodologies?
3. What are the benefits of rolling level planning in software project management and how
would you implement it?
4. How would you assess the risks in your software development project? How would you
plan for risk mitigation and contingency?

Course Outcome 5 (CO5):

1. What is the importance of Software Process improvement?
2. How will retrospectives help in improving the software development process?
3. What are the important skills required for the SQA role?
4. How would you use project history data as a prediction tool to plan future projects?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:
Reg No: _
Name :
PAGES : 3
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Code: CST 381
Course Name: Concepts in Software Engineering
Duration: 3 Hrs Max. Marks : 100
PART A
Answer all Questions. Each question carries 3 Marks

1. Explain why professional software that is developed for a customer is not simply
the programs that have been developed and delivered

2. Incremental software development could be very effectively used for customers

who do not have a clear idea about the systems needed for their operations.
Discuss.

3. Identify and briefly describe four types of requirements that may be defined for a
computer based system.

4. Describe software architecture in your own words.

5. What are the major differences between GPL and LGPL?

6. Compare between white box testing and black box testing.

7. What is the importance of risk management in software project management?

8. Explain COCOMO cost estimation model

9. Describe the software quality dilemma in your own words

10. Which are the levels of the CMMI model?

(10x3=30)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B
(Answer any one question from each module. Each question carries 14 marks)

11. (a) Compare between waterfall model and spiral model (8)

(b) Explain Agile methods and Agile manifesto (6)

OR

12. (a) Explain software process activities (7)

(b) Explain Agile Development techniques and Agile Project Management. (7)

13. (a) What are functional and nonfunctional requirements? Imagine that you are
developing a library management software for your college, identify at least (10)
8 functional requirements and 4 nonfunctional requirements.

(b) What are the contents of a software requirement specification?

(4)

OR

14. (a) Explain Personas, Scenarios, User stories and Feature identification? (8)

(b) Compare between Software Architecture design and Component level (6)
design

15. (a) Describe the formal and informal review techniques in detail. (6)

(b) Explain various software testing strategies. (8)

OR

16. (a) Explain DevOps CI/CD/CD in detail.

(8)

(b) Explain test driven development. (6)

17. (a) What is a critical path and demonstrate its significance in a project schedule (6)
with the help of a sample project schedule.

(b) Explain plan driven development and project scheduling (6)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

18. (a) Explain the SCRUM framework. (8)

(b) What is algorithmic cost modeling? What problems does it suffer from when (6)
compared with other approaches to cost estimation?

19. (a) Explain elements of Software Quality Assurance and SQA Tasks. (8)

(b) Explain the SPI process. (6)

OR

20. (a) Compare between CMMI and ISO 9001:2000 (8)

(b) Compare Quality Control and Quality Assurance. (6)

Teaching Plan [44 hours]

Module 1 : Introduction to Software Engineering (8 hours) Hours

1.1 Introduction to Software Engineering. [ Book 1, Chapter 1] 1 hour

1.2 Software process models [Book 1 - Chapter 2] 1 hour

1.3 Process activities [Book 1 - Chapter 2] 1 hour

1.4 Coping with change [Book 1 - Chapter 2, Book 2 - Chapter 4] 1 hour

1.5 Agile software development [Book 1 - Chapter 3] 1 hour

1.6 Agile development techniques [Book 1 - Chapter 3] 1 hour

1.7 Agile Project Management.[Book 1 - Chapter 3] 1 hour

1.8 Case studies : An insulin pump control system. Mentcare - a patient 1 hour
information system for mental health care. [Book 1 - Chapter 1]
Module 2 : Requirement Analysis and Design (10 hours)

2.1 Functional and non-functional requirements, Requirements engineering 1 hour

processes [Book 1 - Chapter 4]
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.2 Requirements elicitation, Requirements validation, Requirements 1 hour

change, Traceability Matrix [Book 1 - Chapter 4]
2.3 Developing use cases, Software Requirements Specification Template [Book 2 1 hour
- Chapter 8]
2.4 Personas, Scenarios [Book 3 - Chapter 3] 1 hour

2.5 User stories, Feature identification [Book 3 - Chapter 3] 1 hour

2.6 Design concepts [Book 2 - Chapter 12] 1 hour

2.7 Architectural Design [Book 2 - Chapter 13] 1 hour

2.8 Component level design [Book 2 - Chapter 14] 1 hour

2.9 Component level design, Design Document Template. [Book 2 - Chapter 14, 1 hour
Ref - 2]
2.10 Case study: The Ariane 5 launcher failure. [ Book 2 - Chapter 16] 1 hour

Module 3 : Implementation and Testing (12 hours)

3.1 Object-oriented design using the UML, Design patterns [Book 1 - Chapter 7] 1 hour

3.2 Implementation issues, Open-source development - Open-source licensing - 1 hour

GPL, LGPL, BSD [Book 1 - Chapter 7]
3.3 Review Techniques - Cost impact of Software Defects, Code review. [Book 2 - 1 hour
Chapter 20]

34 Informal Review, Formal Technical Reviews, Post-mortem evaluations. [Book 1 hour

2 - Chapter 20]
3.5 Software testing strategies [Book 2 - Chapter 22] 1 hour

3.6 Software testing strategies [Book 2 - Chapter 22] 1 hour

3.7 White box testing, Path testing, Control Structure testing [Book 2 - Chapter 1 hour
23]
3.8 Black box testing. Test documentation [Book 2 - Chapter 23] 1 hour

3.9 Test automation, Test-driven development [Book 3 - Chapter 9] 1 hour

3.10 Security testing. DevOps and Code Management [Book 3 - Chapter 9, Chapter 1 hour
10]
3.11 DevOps and Code Management - Code management, DevOps automation, 1 hour
CI/CD/CD. [Book 3 - Chapter 10]
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.12 Software Evolution - Evolution processes, Software maintenance. [Book 1 - 1 hour

Chapter 9]
Module 4 : Software Project Management (8 hours)

4.1 Software Project Management - Risk management, Managing people, 1 hour

Teamwork [Book 1 - Chapter 22]

4.2 Project Planning - Software pricing, Plan-driven development, Project 1 hour

scheduling, Agile planning [Book 1 - Chapter 23]
4.3 Estimation techniques [Book 1 - Chapter 23] 1 hour

4.4 Configuration management [Book 1 - Chapter 25] 1 hour

4.5 Agile software management - SCRUM framework [Book 2 - Chapter 5] 1 hour

4.6 Agile software management - SCRUM framework [Book 2 - Chapter 5] 1 hour

4.7 Kanban methodology and lean approaches. [Ref 9 - Chapter 2] 1 hour

4.8 Kanban methodology and lean approaches.[Ref 9 - Chapter 2] 1 hour

Module 5 : Software Quality, Process Improvement and Technology trends (6 hours)

5.1 Software Quality, Software Quality Dilemma, Achieving Software Quality. 1 hour
[Book 2 - Chapter 19]
5.2 Elements of Software Quality Assurance, SQA Tasks [Book 3 - Chapter 21] 1 hour

5.3 Software measurement and metrics. [Book 3 - Chapter 21] 1 hour

5.4 Software Process Improvement(SPI), SPI Process[Book 2 - Chapter 37] 1 hour

5.5 Software Process Improvement(SPI), SPI Process[Book 2 - Chapter 37] 1 hour

5.6 CMMI process improvement framework, ISO 9001:2000 for Software. [Book 1 hour
2 - Chapter 37]
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CONCEPTS IN Year of
CST Category L T P Credit
MACHINE introduction
383
LEARNING VAC 3 1 0 4 2019

Preamble: This course enables the learners to understand the fundamental concepts and
algorithms in machine learning. The course covers the standard and most popular supervised
learning algorithms such as linear regression, logistic regression, decision trees, Bayesian
learning & the naive Bayes algorithm, support vector machines& kernels, basic clustering
algorithms and dimensionality reduction methods. This course helps the students to provide
machine learning based solutions to real world problems.

Prerequisite: Familiarity with basics in linear algebra, probability and Python

programming.

Course Outcomes

CO1 Illustrate Machine Learning concepts and basic parameter estimation

methods.(Cognitive Knowledge Level: Apply)

CO2 Demonstrate supervised learning concepts (regression, linear classification).

(Cognitive Knowledge Level: Apply)

CO3 Illustrate the concepts of Multilayer neural network and Support Vector Machine
(Cognitive Knowledge Level: Apply)

CO4 Describe unsupervised learning concepts and dimensionality reduction techniques.

(Cognitive Knowledge Level: Apply)

CO5 Solve real life problems using appropriate machine learning models and evaluate the
performance measures (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO PO8 PO9 PO10 PO11 PO1
7 2
CO1
CO2
CO3
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO4
CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Test1 (Percentage) Test2 (Percentage) Examination
Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create

Mark Distribution
Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Tests : 25 marks
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:
Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carry 14 marks.

Syllabus

Module-1 (Overview of machine learning)

Machine learning paradigms-supervised, semi-supervised, unsupervised, reinforcement learning.

Basics of parameter estimation - maximum likelihood estimation(MLE) and maximum a
posteriori estimation(MAP). Introduction to Bayesian formulation.

Module-2 (Supervised Learning)

Regression - Linear regression with one variable, Linear regression with multiple variables,
solution using gradient descent algorithm and matrix method, basic idea of overfitting in
regression. Linear Methods for Classification- Logistic regression, Perceptron, Naive Bayes,
Decision tree algorithm ID3.

Module-3 (Neural Networks (NN) and Support Vector Machines (SVM))

NN - Multilayer feed forward network, Activation functions (Sigmoid, ReLU, Tanh),

Backpropagation algorithm.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SVM - Introduction, Maximum Margin Classification, Mathematics behind Maximum Margin

Classification, Maximum Margin linear separators, soft margin SVM classifier, non-linear SVM,
Kernels for learning non-linear functions, polynomial kernel, Radial Basis Function(RBF).

Module-4 (Unsupervised Learning)

Clustering - Similarity measures, Hierarchical Agglomerative Clustering, K-means partitional

clustering, Expectation maximization (EM) for soft clustering. Dimensionality reduction –
Principal Component Analysis, factor Analysis, Multidimensional scaling, Linear Discriminant
Analysis.

Module-5 (Classification Assessment)

Classification Performance measures - Precision, Recall, Accuracy, F-Measure, Receiver

Operating Characteristic Curve(ROC), Area Under Curve(AUC. Bootstrapping, Cross
Validation, Ensemble methods, Bias-Variance decomposition. Case Study: Develop a
classifier for face detection.

Text Book
1. Ethem Alpaydin, Introduction to Machine Learning, 2nd edition, MIT Press 2010.
2. Mohammed J. Zaki and Wagner Meira, Data Mining and Analysis: Fundamental
Concepts and Algorithms, Cambridge University Press, First South Asia edition,
2016.
3. Jake VanderPlas, Python Data Science Handbook, O'Reilly Media, 2016
4. Tom Mitchell, Machine Learning, McGraw-Hill, 1997.

Reference Books
1. Christopher Bishop. Neural Networks for Pattern Recognition, Oxford University
Press, 1995.
2. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective, MIT Press
2012.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements Of Statistical
Learning, Second edition Springer 2007.
4. P. Langley, Elements of Machine Learning, Morgan Kaufmann, 1995.
5. Richert and Coelho, Building Machine Learning Systems with Python.
6. Davy Cielen, Arno DB Meysman and Mohamed Ali. Introducing Data Science:
Big Data, Machine Learning, and More, Using Python Tools, Dreamtech Press
2016.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome1(CO1):
1. A coin is tossed 100 times and lands heads 62 times. What is the maximum likelihood
estimate for θ, the probability of heads.
2. Suppose data x1, ..., xnare independent and identically distributed drawn from an
exponential distribution exp(λ). Find the maximum likelihood for λ.
3. Suppose x1, ..., xn are independent and identically distributed(iid) samples from a
distribution with density

Find the maximum likelihood estimate(MLE) for θ.

4. Find the maximum likelihood estimator (MLE) and maximum a posteriori (MAP)
estimator for the mean of a univariate normal distribution. Assume that we have N
samples, x1,..., xN independently drawn from a normal distribution with known variance σ2
and unknown mean µ and the prior distribution for the mean is itself a normal distribution
with mean ν and variance β2. What happens to the MLE and MAP estimators as the
number of samples goes to infinity.

Course Outcome 2 (CO2):

1. Explain the difference between (batch) gradient descent and stochastic gradient descent.
Give an example of when you might prefer one over the other.
2. Suppose that you are asked to perform linear regression to learn the function that outputs
y, given the D-dimensional input x. You are given N independent data points, and that all
the D attributes are linearly independent. Assuming that D is around 100, would you
prefer the closed form solution or gradient descent to estimate the regressor?
3. Suppose you have a three class problem where class label y ∈ 0, 1, 2 and each training
example X has 3 binary attributes X1, X2, X3∈ 0, 1. How many parameters (probability
distribution) do you need to know to classify an example using the Naive Bayes
classifier?

Course Outcome 3 (CO3):

1. What are support vectors and list any three properties of the support vector classifier
solution?
2. Why do you use kernels to model a projection from attributes into a feature space, instead
of simply projecting the dataset directly?
3. Describe how Support Vector Machines can be extended to make use of kernels. Illustrate
with reference to the Gaussian kernel K(x, y) = e−z,where z = (x−y)2 .
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. Briefly explain one way in which using tanh instead of logistic activations makes
optimization easier.
5. ReLU activation functions are most used in neural networks instead of the tanh activation
function. Draw both activation functions and give a) an advantage of the ReLU function
compared to the tanh function. b) a disadvantage of the ReLU function compared to the
tanh function.

Course Outcome 4(CO4):

1. Describe cluster analysis? Identify two applications where cluster analysis can be applied
to multimedia data?
2. Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8):

(i) Compute the Euclidean distance between the two objects.

(ii) Compute the Manhattan distance between the two objects.

3. Use PCA to reduce the dimension from 2 to 1 for the design matrix X.

4. What is Principal Component Analysis (PCA)? Which eigen value indicates the direction
of largest variance?
5. Suppose that one runs a principal component analysis on a data set and tells that the
percentage of variance explained by the first 3 components is 80%. How is this
percentage of variance explained?

Course Outcome 5 (CO5):

1. Suppose that you are contacted by a food processing company that wants you to develop a
classifier that detects whether a rat is present in an image. You collect a large dataset of
images by crawling the web, and have annotators determine which images contain rats.
This set of images can then be used as the training set for your classifier.
a. Suggest a machine learning method to use for this classification task and evaluate
its performance.
b. After you have delivered your solution to the company, they get back to you and
complain that when they evaluate on a new test set, they get precision and recall
values that are much lower than what you reported to them. Explain what might
have gone wrong and propose remedial measures .
2. A real estate firm would like to build a system that predicts the sale prices of a house.
They create a spreadsheet containing information about 1,500 house sales in the Kochi
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

area. In addition to the price, there are 10 features describing the house, such as number
of bedrooms, total indoor area, lot area, a swimming pool, location, etc. Explain how you
would implement a machine learning model that would solve this prediction task. Give all
steps you would carry out when developing it. Explain why the model you built is
probably useless in the long run.
3. For a classifier, the confusion matrix is given by:

What is the precision, recall and accuracy of that classifier?

Model Question Paper

QP CODE: PAGES:3
Reg No:
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH &
YEAR
Course Code: CST 383

Course Name: CONCEPTS IN MACHINE LEARNING

Max.Marks:100 Duration: 3
Hours
PART A
Answer all Questions. Each question carries 3 Marks
1. Define supervised learning? Name special cases of supervised learning depending on whether
the inputs/outputs are categorical, or continuous.
2. Differentiate between Maximum Likelihood estimation (MLE) and Maximum a Posteriori
(MAP) estimation?
3. What is overfitting and why is it a problem? Give an example of a method to reduce the risk
of overfitting.
4. Specify the basic principle of gradient descent algorithm.
5. Suppose that you have a linear support vector machine(SVM) binary classifier. Consider a
point that is currently classified correctly, and is far away from the decision boundary. If you
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

remove the point from the training set, and re-train the classifier, will the decision boundary
change or stay the same? Justify your answer.
6. Mention the primary motivation for using the kernel trick in machine learning algorithms?
7. Expectation maximization (EM) is designed to find a maximum likelihood setting of the
parameters of a model when some of the data is missing. Does the algorithm converge? If so,
do you obtain a locally or globally optimal set of parameters?
8. Illustrate the strength and weakness of k-means algorithm.
9. Classifier A attains 100% accuracy on the training set and 70% accuracy on the test set.
Classifier B attains 70% accuracy on the training set and 75% accuracy on the test set. Which
one is a better classifier. Justify your answer.
10. How does bias and variance trade-off affect machine learning algorithms?

(10x3=30)

Part B

Answer any one Question from each module. Each question carries 14 Marks

11. a) Suppose that X is a discrete random variable with the following probability mass
function: where 0 ≤ θ ≤ 1 is a parameter. The following 10 independent observations

were taken from such a distribution: (3, 0, 2, 1, 3, 2, 1, 0, 2, 1). What is the maximum
likelihood estimate of θ. (6)
b) A gamma distribution with parameters α, β has the following density function, where Γ(t) is
the gamma function.

If the posterior distribution is in the same family as the prior distribution, then we say that
the prior distribution is the conjugate prior for the likelihood function. Using the Gamma
distribution as a prior, show that the Exponential distribution is a conjugate prior of the
Gamma distribution. Also, find the maximum a posteriori estimator for the parameter of the
Exponential distribution as a function of α and β. (8)
OR
12. a) Traffic between 8AM and 9AM at a certain place was measured by counting the number
of vehicles that passed at that time. Suppose the counts follow a Poisson process. A random
sample of 9 observations was collected, having observed the following number of vehicles:
(95, 100, 80, 70, 110, 98, 97, 90, 70). Derive the maximum likelihood estimator for the
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

average number of vehicles that pass by that place between 8 AM and 9 AM, and compute
the corresponding estimate using the given sample. (7)

b) Find the maximum a posteriori (MAP) estimator for the mean of a univariate normal
distribution. Assume that we have N samples, x1,..., xN independently drawn from a normal
distribution with known variance σ2 and unknown mean µ and the prior distribution for the
mean is itself a normal distribution with mean ν and variance β2. (7)

13.a) Derive the gradient descent training rule assuming for the target functionod = w0 + w1x1 + ...
+ wnxn. Define explicitly the squared cost/error function E, assuming that a set of training
examples D is provided, where each training example d ∈ D is associated with the target
output td. (10)
b) How can we interpret the output of a two-class logistic regression classifier as a probability?
(4)
OR
14. a) In a two-class logistic regression model, the weight vector w = [4, 3, 2, 1, 0]. We apply it
to some object that we would like to classify; the vectorized feature representation of this
object is x = [−2, 0,−3, 0.5, 3]. What is the probability, according to the model, that this
instance belongs to the positive class? (6)
b) The following dataset can be used to train a classifier that determines whether a given person
is likely to own a car or not. There are three features: education level (primary, secondary, or
university); residence (city or country); gender (female, male).
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Find the root attribute and justify your answer (8)

15. a) Consider a support vector machine whose input space is 2-D, and the inner products are
computed by means of the kernel K(x, y) = (x.y + 1)2-1, where x.ydenotes the ordinary inner
product. Show that the mapping to feature space that is implicitly defined by this kernel is the
mapping to 5-D given by (10)

b) What is the basic idea of a Support Vector Machine? (4)

OR
16. a) Explain how back propagation can be used to solve XOR problem which is not linearly
separable. (8)
b) Consider the following one dimensional training data set, ’x’ denotes negative examples and
’o’ positive examples. The exact data points and their labels are given in the table. Suppose
a SVM is used to classify this data. Indicate which are the support vectors and mark the
decision boundary. Find the equation of the hyperplane. (6)

17. a)Suppose that we have the following data (one variable). Use single linkage
Agglomerative clustering to identify the clusters.
Daa: (2, 5, 9, 15, 16, 18, 25, 33, 33, 45). (8)

b) Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8):
(i) Compute the Euclidean distance between the two objects.
(ii) Compute the Manhattan distance between the two objects.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(iii) Compute the Minkowski distance between the two objects, using p = 3 (6)

OR
18. a) Suppose that we have the following data:

Identify the cluster by applying the k-means algorithm, with k = 2. Try using initial
cluster centers as far apart as possible. (10)
b) List the steps involved in Principal Component Analysis. (4)

19. a) Suppose the dataset had 9700 cancer-free images from 10000 images from cancer
patients. Find precision, recall and accuracy ? Is it a good classifier? Justify. (8)

Actual Class\ cancer = yes cancer = no Total

Predicted class

cancer = yes 90 210 300

cancer = no 140 9560 9700

Total 230 9770 10000

b) Suppose that you have a classification problem where our feature representation contains
about 10,000,000 features. We would like to develop a classifier that can be deployed in a
mobile phone, so preferably it should have a small memory footprint. Discuss one solution
for how this can be done. (6)

OR

20. a) What are ROC space and ROC curve in machine learning? In ROC space, which points
correspond to perfect prediction, always positive prediction and always negative prediction?
Why? (6)
b) Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the three
classifiers are as follows – A (0, 1), B (1, 1) , C (1,0.5). Which can be considered as a
perfect classifier? Justify your answer. (4)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

c) Given the following ROC Curve? Find the AUC? (4)

Teaching Plan

No of
No Contents Lecture
Hrs
Module 1 :Overview of machine learning (7 hours)

1.1 Supervised, semi-supervised, unsupervised learning, reinforcement learning 1hour

(Text Book (TB) 1: Chapter 1)
1.2 Maximum likelihood estimation(MLE) (TB 1: Section 4.2) 1hour

1.3 Maximum likelihood estimation (MLE)- example (TB 1: Section 4.2) 1hour
1.4 Maximum a posteriori estimation(MAP) (TB 4: Section 6.2) 1hour

1.5 Maximum a posteriori estimation(MAP)-example (TB 4: Section 6.2) 1hour

1.6 Bayesian formulation (TB 1: Section 14.1, 14.2) 1hour
1.7 Bayesian formulation -example (TB 1: Section 14.1, 14.2) 1hour
Module 2 : Supervised Learning (8 hours)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.1 Linear regression with one variable (TB 1: Section 2.6) 1hour
2.2 Multiple variables, Solution using gradient descent algorithm and matrix 1hour
method (No derivation required) (TB 1: Section 5.8)
2.3 Overfitting in regression, Lasso and Ridge regularization 1hour
2.4 Logistic regression 1hour
2.5 Perceptron 1hour
2.6 Naive Bayes (TB 2: Section 18.2) 1hour
2.7 Decision trees (TB 2: Chapter 19) 1hour
2.8 Decision trees- ID3 algorithm (TB 2: Chapter 19) 1hour
Module 3 : Neural Networks and Support Vector Machines (TB 2: Chapter 21)
(11 hours)
3.1 Multilayer Feed forward Network, Activation Functions (Sigmoid, ReLU, 1hour
Tanh)
3.2 Back Propagation Algorithm 1hour
3.3 Illustrative Example for Back Propagation 1hour
3.4 Introduction, Maximum Margin Hyperplane, 1hour
3.5 Mathematics behind Maximum Margin Classification 1hour
3.6 Formulation of maximum margin hyperplane and solution 1hour
3.7 Soft margin SVM 1hour
3.8 Solution of Soft margin SVM 1hour
3.9 Non-linear SVM 1hour
3.10 Kernels for learning non-linear functions and properties of kernel functions. 1hour
3.11 Example Kernels functions- Linear, RBF, Polynomial. 1hour
Module 4 : Unsupervised Learning (10 hours)
4.1 Similarity measures- Minkowski distance measures( Manhattan, Euclidean), 1hour
Cosine Similarity
4.2 Clustering - Hierarchical Clustering (TB 2: Chapter 14) 1hour
4.3 K-means partitional clustering (TB 2: Chapter 13) 1hour
4.4 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1hour
4.5 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.6 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1hour

6.3)
4.7 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1hour
6.3)
4.8 Factor Analysis (TB 1: Section 6.4) 1hour
4.9 Multidimensional scaling (TB 1: Section 6.5) 1hour
4.10 Linear Discriminant Analysis (TB 1: Section 6.6) 1hour
Module 5 : Classification Assessment (8 hours)
Performance measures - Precision, Recall, Accuracy, F-Measure, ROC, 1hour
5.1
AUC. (TB 2: Chapter 22.1)
5.2 Boot strapping, Cross validation 1hour
5.3 Ensemble methods- bagging 1hour
5.4 Ensemble methods- boosting 1hour
5.5 Bias-Variance decomposition (TB 2: Chapter 22.3) 1hour
5.6 Bias-Variance decomposition (TB 2: Chapter 22.3) 1hour
Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1hour
5.7
Pipeline)
Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1hour
5.8
Pipeline)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
Category L T P Credit
CST CLIENT SERVER Introduction
385 SYSTEMS
VAC 3 1 0 4 2019

Preamble:

The syllabus is prepared with the view of preparing the Engineering Graduates to build effective
Client/Server applications. This course aims at providing a foundation in decentralized computer
systems, using the client/server model. The course content is decided to cover the essential
fundamentals which can be taught within the given slots in the curriculum.

Prerequisite: Basic knowledge in Computer

Course Outcomes: After the completion of the course the student will be able to

Course Outcomes

Identify the basics of client/server systems and the driving force behind the
CO 1
development of client/server systems(Cognitive Knowledge Level: Understand)

Outline the architecture and classifications of client/server systems(Cognitive

CO 2
Knowledge Level: Understand)

Summarize the client/server network services for an application(Cognitive

CO 3
Knowledge Level: Understand)

Identify management services and issues in network (Cognitive Knowledge Level:

CO 4
Understand)

Outline the Client/Server technology in respect of databases and Client/Server

CO 5
database architecture (Cognitive Knowledge Level: Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Bloom’s Continuous Assessment Tests End Semester

Category Examination Marks
Test 1 (Percentage) Test 2
(Percentage)

Remember 40 40 40

Understand 40 40 40

Apply 20 20 20

Analyse

Evaluate

Create

Mark distribution

Total CIE ESE ESE Duration

Marks Marks Marks

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test 1 (for theory, for 2 hrs) : 20 marks
Continuous Assessment Test 2 (for lab, internal examination, for 2hrs) : 20 marks
Internal Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 5 questions with 2 questions from
each module (2.5 modules x 2 = 5), having 3 marks for each question. Students should answer
all questions. Part B also contains 5 questions with 2 questions from each module (2.5 modules
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

x 2 = 5), of which a student should answer any one. The questions should not have sub-
divisions and each one carries 7 marks.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each
question can have maximum 2 sub-divisions and carry 14 marks.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Computing in client server architecture over Mainframe architecture has certain

advantages and disadvantages. Describe at least three advantages and disadvantages
for each architecture.

Course Outcome 2 (CO2):

1. Explain the role of mainframe-centric model in Client/Server computing?

Course Outcome 3(CO3):

1. Describe the client server system development methodology? Explain different phases of
System Integration Life-Cycle.

Course Outcome 4 (CO4):

1. Explain about network management and remote system management. How can security be
provided to the network?

Course Outcome 5 (CO5):

1. Explain various types of Client/Server Database Architecture

Syllabus
Module – 1 (Introduction)

Introduction to Client/Server computing - Basic Client/Server Computing Model, Server for

Every Client- File Server, Print Server, Application Server, Mail Server, Directory Services
Server, Web Server, Database Server, Transaction Servers. Client/Server-Fat or Thin, Stateless
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

or Stateful, Servers and Mainframes, Client/Server Functions. Driving Forces behind

Client/Server Computing- Business Perspective, Technology Perspective.

Module -2 (Client/Server Classification)

Client/Server Types-Single Client/Single Server, Multiple Clients/Single Server, Multiple

Clients/Multiple Servers, Integration With Distributed Computing, Alternatives To
Client/Server Systems. Classification of Client/Server Systems- Two-Tier Computing,
Middleware, Three-Tier Computing- Model View Controller (MVC), Principles behind
Client/Server Systems.Client/Server Topologies. Existing Client/Server Architecture.
Architecture for Business Information System.

Module -3 (Client/Server Application Components)

Client- Services, Request for services, RPC, Windows services, Print services, Remote boot
services, other remote services, Utility Services. Server- Detailed server functionality, Network
operating system, Available platforms, Server operating system. Organizational Expectations,
Improving performance of client/server applications, Single system image, Downsizing and
Rightsizing, Advantages and disadvantages of Client/Server computing, Applications of
Client/Server.

Module -4 (Client/ Server Systems Services and Support)

Services and Support- System administration, Availability, Reliability, Scalability,

Observability, Agility, Serviceability. Software Distribution, Performance, Network
management. Remote Systems Management- RDP, Telnet, SSH, Security. LAN and Network
Management issues.

Module -5(Client/Server Technology and Databases)

Client/Server Technology and Databases - Storing Data, Database System Architectures.

Client/Server In Respect Of Databases- Client/Server Databases, Client/Server Database
Computing, Database Computing Vs. Mainframe, PC/File Server Computing. Client/Server
Database Architecture - Process-Per-Client Architecture, Multi-Threaded Architecture, Hybrid
Architecture. Database Middleware Component - Application Programming Interface, Database
Translator, Network Translator.

Text Book

1. Patrick Smith &Steve Guengerich, Client / Server Computing, PHI

2. Subhash Chandra Yadav, Sanjay Kumar Singh, An Introduction to Client/Server Computing,

New Age International Publishers
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Reference Books

1. Jeffrey D.Schank, “Novell’s Guide to Client-Server Application & Architecture” Novell Press

2. Robert Orfali, Dan Harkey, Jeri Edwards, Client/Server Survival Guide, Wiley-India
Edition, Third Edition

3. Dawna Travis Dewire, Client Server Computing ― McGraw Hill

4. W.H.Inman, Developing Client Server Applications, BPB

Model Question Paper

QP CODE: PAGES:
Reg No:
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Code: CST 385
Course Name : Client Server Systems
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)

1. Differentiate between Stateful and Stateless servers

2. List the different phases and activities of client/server system development

methodology.

3. How does transmission protocol work in client/server applications?

4. List any six services in single system image environment.

5. Specify the role of the client in Client/Server computing and also list any six
services provided by the client.

6. Why do most RPC system support call by value semantics for parameter passing?

7. What do you mean by a thin client network? List three advantages of the Thin
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Client Network system.

8. How are connectivity and interoperability between client/server achieved?

9. One disadvantage of the Client/Server system is lack of control in a Database

Management environment. Justify.

10. Explain the DBMS concept in client/server architecture.

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Differentiate between Transaction server and Data server system with
examples. (7)

(b) Computing in client server architecture over Mainframe architecture has

certain advantages and disadvantages. Describe at least three advantages (7)
and disadvantages for each architecture.

OR

12. (a) Explain various Clients/Server system development tools.

(6)

(b) Classify and describe the driving forces that drive the move to Client/Server (8)
computing.

13. (a) Explain the role of mainframe-centric model in Client/Server computing? (5)

(b) Describe the three types of Client/Server systems in existence (9)

OR

14. (a) List and explain the general forces behind the architecture for business (7)
information systems

(b) Explain the different distribution styles. (7)

15. (a) Illustrate the concept of rightsizing and downsizing in Client/Server (7)
Computing

(b) What is client server system development methodology? Explain the (7)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

different phases of System Integration Life-Cycle.

OR

16. (a) In Client/Server computing, explain the following with examples (10)
i. Dynamic Data Exchange
ii. RPC, Remote Procedure Call
iii. Remote Boot Service
iv. Diskless Computer
v. Object-linking and embedding

(b) Explain the functions and features of Network Operating System (4)

17. (a) Explain about network management and remote system management. How (10)
can security be provided to the network ?

(b) In client server architecture, what do you mean by Availability, Reliability, (4)
Serviceability and Security? Explain with examples.

OR

18. (a) Client server is modular infrastructure, this is intended to improve Usability, (7)
Flexibility, Interoperability and Scalability. Explain each term with an
example, in each case how it helps to improve the functionality of client
server architecture.

(b) Explain about network management and remote system management. How (7)
can security be provided to network?

19. (a) Explain the different types of Client/Server Database Architecture (9)

(b) List and explain the main components of Database middleware (5)

OR

20. (a) Discuss types of database utilities, tools and their functions (7)

(b) Discuss about the role of traditional and web databases in handling (7 )
client/server based applications.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

Module- 1( Introduction) (10 hours)

1.1 Basic Client/Server Computing Model 1 hour

1.2 Server for Every Client- File Server, Print Server 1 hour
1.3 Application Server, Mail Server, Directory Services Server 1 hour
1.4 Web Server, Database Server 1 hour

1.5 Transaction Servers 1 hour

1.6 Client/Server-Fat or Thin 1 hour
1.7 Stateless or Stateful 1 hour
1.8 Servers and Mainframes 1 hour
1.9 Client/Server Functions 1 hour
1.1 Driving Forces behind Client/Server Computing- Business Perspective, 1 hour
0 Technology Perspective
Module- 2 (Client/Server Classification) (10 hours)
2.1 Client/Server Types-Single Client/Single Server 1 hour
2.2 Multiple Clients/Single Server, Multiple Clients/Multiple Servers 1 hour
2.3 Integration With Distributed Computing 1 hour
2.4 Alternatives To Client/Server Systems 1 hour
2.5 Classification of Client/Server Systems- Two-Tier Computing, 1 hour
Middleware
2.6 Three-Tier Computing- Model View Controller (MVC) 1 hour
2.7 Principles behind Client/Server Systems. 1 hour

2.8 Client/Server Topologies 1 hour

2.9 Existing Client/Server Architecture 1 hour
2.10 Architecture for Business Information System 1 hour
Module -3 (Client/Server Application Components) (9 hours)

3.1 The client: Services, Request for services, RPC 1 hour

3.2 Windows services, Print services, Remote boot services 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.3 Utility Services & Other Services 1 hour

3.4 Server- Detailed server functionality, Network operating system 1 hour
3.5 Available platforms, Server operating system 1 hour
3.6 Organizational Expectations, Improving performance of client/server 1 hour
applications
3.7 Single system image, Downsizing and Rightsizing 1 hour
3.8 Advantages and disadvantages of Client/Server computing 1 hour
3.9 Applications of Client/Server 1 hour
Module -4 (Client/ Server Systems Services and Support) (8 hours)
4.1 Services and Support, System administration 1 hour
4.2 Availability, Reliability 1 hour
4.3 Scalability, Observability, Agility 1 hour
4.4 Serviceability, Software Distribution 1 hour
4.5 Performance 1 hour

4.6 Network management 1 hour

4.7 Remote Systems Management- RDP, Telnet, SSH 1 hour

4.8 Security, LAN and Network Management issues 1 hour

Module -5(Client/Server Technology and Databases) (8 hours)

5.1 Client/Server Technology and Databases - Storing Data 1 hour

5.2 Database System Architectures 1 hour

5.3 Client/Server In Respect Of Databases- Client/Server Databases 1 hour
5.4 Client/Server Database Computing 1 hour

5.5 Database Computing Vs. Mainframe, PC/File Server Computing 1 hour

5. Client/Server Database Architecture - Process-Per-Client Architecture 1 hour

5.7 Multi-Threaded Architecture, Hybrid Architecture 1 hour

5.8 Database Middleware Component - Application Programming Interface,

1 hour
Database Translator, Network Translator
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER V
HONOURS
 Year of
Category L T P Credit
CST CRYPTOGRAPHIC Introduction
393 ALGORITHMS
VAC 3 1 0 4 2019

Preamble:

The course on Cryptographic Algorithms aims at exploring various algorithms deployed in

offering confidentiality, integrity, authentication and non-repudiation services. This course
covers classical encryption techniques, symmetric and public key crypto-system, key exchange
and management, and authentication functions. The concepts covered in this course enable the
learners in effective use of cryptographic algorithms for real life applications.

Prerequisite: A sound background in Number Theory.

Course Outcomes: After the completion of the course the student will be able to

Identify the security services provided for different types of security attacks.
CO1
(Cognitive Knowledge Level : Understand)

Summarize the classical encryption techniques for information hiding. (Cognitive

CO2
Knowledge Level: Apply)

Illustrate symmetric / asymmetric key cryptographic algorithms for secure

CO3
communication.(Cognitive Knowledge Level: Apply)

Interpret key management techniques for secure communication.(Cognitive

CO4
Knowledge Level: Understand)

Summarize message authentication functions in a secure communication

CO5
scenario.(Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO11
9 0 2

CO1
CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems
PO5 Modern tool usage PO11 Project Management and

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End

Bloom’s Semester
Category Test1 (Percentage) Test2 Examinati
(Percent on Marks
 age)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module-1 (Introduction to the Concepts of Security)

Need for security, Security approaches, Principles of security, Types of attacks, OSI Security
Architecture, Classical encryption techniques - Substitution techniques, Transposition
techniques. Stream cipher, Block cipher, Public key cryptosystems vs. Symmetric key
cryptosystems, Encrypting communication channels.

Module-2 (Symmetric Key Cryptosystems)

Overview of symmetric key cryptography, Block cipher principles, Data Encryption Standard
(DES), Differential and Linear cryptanalysis, Double DES, Triple DES, International Data
Encryption Algorithm (IDEA), Advanced Encryption Algorithm (AES),Block cipher modes of
operation, Stream cipher, RC4.

Module-3 (Public Key Cryptosystems)

Principles of public key cryptosystems, RSA algorithm, RSA illustration, Attacks, ElGamal
cryptographic system, Knapsack algorithm, Diffie-Hellman key exchange algorithm, Elliptical
curve cryptosystems.

Module-4 (Key Management)

Symmetric key distribution using symmetric encryption, Symmetric key distribution using
asymmetric encryption, Distribution of public keys, Generating keys, transferring keys,
Verifying keys, Updating keys, Storing keys, Backup keys, Compromised keys, Public key
infrastructure.
Module – 5 (Authentication)

Authentication requirements, Authentication functions, Message authentication codes (MAC),

Hash functions, Security of Hash functions and MAC, Message Digest 5 (MD5), Secure Hash
Algorithm (SHA)-512, Hash-based Message Authentication Code (HMAC), Cipher-based
Message Authentication Code (CMAC), X.509 Authentication services.

Text Books

1. William Stallings, Cryptography and Network Security Principles and Practice, Pearson
Edu, 6e.
2. Bruice Schneier, Applied Cryptography Protocols, Algorithms and source code in C,
Wiley,2e.

References

1. Behrouz A. Forouzan, Cryptography and Network Security, McGraw Hill, 2e.

2. Johannes A. Buchmann, Introduction to Cryptography, Springer, 2e.

3. DouglasR. Stinson, Cryptography Theory and Practice, 3e,Chapman & Hall/CRC,

2006.

4. Bernard Menezes, Network Security and Cryptography, Cengage Learning, 2011.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Consider an automated teller machine (ATM) in which users provide a personal
identification number (PIN) and a card for account access. Give examples of
confidentiality, integrity, and availability requirements associated with the system and, in
each case, indicate the degree of importance of the requirement.

2. Discuss the different security services provided for preventing security attacks.

Course Outcome 2 (CO2):

1. The encryption key in a transposition cipher is (3,2,6,1,5,4). Find the decryption key

2.Discuss the process of encryption in Vernam cipher

Course Outcome 3 (CO3):
1. Devise a meet-in-the-middle attack for a triple DES.
 2. Write an algorithm for the InvSubBytes transformation and implement using python
(Assignment)
3. Consider the following elliptic curve signature scheme. We have a global elliptic curve,
prime p, and “generator” G. Alice picks a private signing key XA and forms the public
verifying YA = XAG. To sign a message M:
 Alice picks a value k
 Alice sends Bob M, k and the signature S = M - kXAG.
 Bob verifies that M=S+kYA.
Show that the verification process produces an equality if the signature is valid.
4. Write an algorithm to add two points on an elliptic curve over GF(p) and implement using
Python. (Assignment)
5. Write an algorithm for encryption using knapsack cryptosystem and implement using Java.
(Assignment)
Course Outcome4 (CO4):
1. List four general categories of schemes for the distribution of public keys.
2. What are the essential ingredients of a public-key directory?
Course Outcome 5 (CO5):
1. State the value of the length field in SHA-512 if the length of the message is 1919 bits and
1920 bits.
2. Write an algorithm in pseudo code for HMAC and implement using Python (Assignment)
 Model Question Paper
QP CODE:
Reg No: _
Name : PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER B.TECH DEGREE EXAMINATION(HONORS), MONTH &

YEAR

Course Code: CST 393

Course Name: Cryptographic Algorithms

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. State the two approaches in attacking a cipher.

2. Define Substitution Cipher. Encrypt using one time pad M = HONORS and K =
CIPHER.

3. Specify the purpose of S-Boxes in Data Encryption Standard (DES).

4. Differentiate between diffusion and confusion.

5. Perform encryption using RSA Algorithm for the following p=7; q=11; e=13;
M=5.

6. Is Diffie-Hellman key exchange protocol vulnerable? Justify.

7. List the techniques for distribution of public keys.

8. Define a certificate authority and its relation to public key cryptography.

9. Distinguish between integrity and message authentication.

10. What types of attacks are addressed by message authentication?

 (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)

11. (a)
With a neat sketch, Explain OSI Security architecture model.
(8)

(b)
How does link encryption differ from end-to-end encryption? Explain.
(6)

OR

12. (a)
Encrypt the text “cryptography” using the Hill Cipher with the key
9 4
  (8)
5 7 . Show the calculations.

(b) Illustrate the steps involved in encrypting a plain text using playfair cipher
(6)
with an example.

13. (a)
With a neat sketch, explain a single round in DES.
10

(b)
Explain encryption and decryption using 2 keys and 3 keys of triple DES.
(4)

OR

14.
(a) Explain the block cipher modes i) Cipher feedback mode ii) Output (8)
feedback mode.

(b) Describe the four types of transformations in AES. (6)

15.
(a) Write an algorithm for generating public and private key using Elliptical (10)
curve cryptography.
 (b) The equation y2 =x3 +x+1, the calculation is done modulo 13. Add two
(4)
points R= P+Q, where P= (4,2) and Q= (10,6).

OR

16. User A and B use the Diffie-Hellman key exchange technique with a
common prime q=71 and primitive root alpha=7.

(a) If user A has private key XA =3, What is A’s public key YA? (7)

(b) If user B has private key XB =6, What is A’s public key YB? (7)

17. (a) Define a session key and show how a KDC can create can create a session
(7)
key between Alice and Bob.

(b) What are the requirements for the use of a public-key certificate scheme? (7)

OR

18. (a) What are the core components of a PKI? Briefly describe each component. (8)

(b) Describe the following (i) Updating keys (ii) Compromised Keys. (6)

19. (a) Describe how SHA-512 logic produce message digest (10)

(b) Distinguish between HMAC and CMAC (4)

OR

20. (a) Specify the format for X.509 certificate. Explain the steps required to obtain
(7)
user’s certificate.

(b) With suitable block diagrams, explain the types of functions that may beused
(8 )
to produce an authenticator.
Teaching Plan

No of Lecture
No Contents
Hrs

Module - 1 (Introduction to the Concepts of Security) (9 hrs)

1.1 Need for security, Security approaches 1 hour

1.2 Principles of security, Types of attacks 1 hour

1.3 OSI Security Architecture 1 hour

Classical encryption techniques: Substitution techniques(Caesar cipher,

1.4 1 hour
Monoalphabetic cipher, Playfair cipher)

Classical encryption techniques: Substitution techniques (Hill cipher,

1.5 1 hour
Polyalphabetic cipher, One-time pad)

1.6 Classical encryption techniques: Transposition techniques 1 hour

1.7 Stream cipher, Block cipher 1 hour

1.8 Public- key cryptosystems vs. Symmetric key cryptosystems 1 hour

1.9 Encrypting communication channels 1 hour

Module - 2 (Symmetric key cryptosystems) (11 hrs)

2.1 Overview of symmetric key cryptography 1 hour

2.2 Block cipher principles 1 hour

2.3 Data Encryption Standard (DES) 1 hour

2.4 DES design criteria 1 hour

2.5 Differential and Linear cryptanalysis 1 hour

2.6 Double DES, Triple DES 1 hour

2.7 IDEA 1 hour

2.8 Advanced Encryption Algorithm (AES structure) 1 hour

2.9 Advanced Encryption Algorithm (Transformations) 1 hour

2.10 Block cipher modes of operation 1 hour

2.11 Stream cipher, RC4 1 hour

Module - 3 (Public key cryptosystems) (8 hrs)

3.1 Principles of public key cryptosystems 1 hour

3.2 RSA algorithm 1 hour

3.3 RSA illustration, Attacks 1 hour

3.4 ElGamal cryptographic system 1 hour

3.5 Knapsack algorithm 1 hour

3.6 Diffie-Hellman key exchange algorithm 1 hour

3.7 Elliptical curve cryptosystems(Elliptical curve arithmetic) 1 hour

3.8 Elliptical curve cryptosystems (Elliptical curve algorithm) 1 hour

Module - 4 (Key Management) (8 hrs) [Text book-2]

4.1 Symmetric key distribution using symmetric encryption 1 hour

4.2 Symmetric key distribution using asymmetric encryption 1 hour

4.3 Distribution of public keys 1 hour

4.4 Generating keys, Transferring keys 1 hour

4.5 Verifying keys, Updating keys 1 hour

4.6 Storing keys, Backup keys 1 hour

4.7 Compromised keys 1 hour

4.8 Public key infrastructure 1 hour

Module - 5 (Authentication) (9 hrs)

5.1 Authentication requirements 1 hour

5.2 Authentication functions 1 hour

5.3 Message Authentication Codes (MAC) 1 hour

5.4 Hash functions 1 hour

5.5 Security of Hash functions and MAC 1 hour

5.6 MD5 1 hour

5.7 SHA-512 1 hour

5.8 HMAC, CMAC 1 hour

5.9 X.509 Authentication services 1 hour

 CATEGORY L T P Credit

AIT 395 COMPUTATIONAL BIOLOGY Honors 3 1 0 4

Preamble:
This course helps the learners to understand concepts in Genomics, Proteomics
Computational Biology, Next Generation Sequencing, NGS Data Analysis and Systems
biology. It enables the learners to understand various Next Generation Sequencing
Techniques, analysis and interpretation of the NGS Data. Also, course introduces
computational and mathematical analysis and modeling of complex biological systems and
Systems Biology

Prerequisite: Basic background in Bioinformatics

Course Outcomes: After the completion of the course, the student will be able to
CO 1 Describe the basic concepts of genomics, microarray, protein structure determination
and prediction(Cognitive knowledge level: Understand)
CO 2 Explain the fundamental aspects drug discovery and molecular modelling
(Cognitive knowledge level: Apply)
CO 3 Demonstrate Networks in Biology, types of networks and its representation (Cognitive
knowledge level : Apply)
CO 4 Explain Next Generation sequencing Technologies and DNA Protein interaction
analysis(Cognitive knowledge level: Understand)
CO 5 Illustrate Next Generation sequence analysis, Mapping approaches and algorithms
(Cognitive knowledge level: Understand)

Mapping of course outcomes with program outcomes

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

CO1 √

CO2

CO3

CO4

CO5
PO# Broad PO# Broad
PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of PO9 Individual and team work
solutions
Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester Examination

Test1 (%) Test2 (%)

Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of Series Tests 1& 2) 25 marks

Continuous Assessment Assignment 15 marks

 Internal Examination Pattern:
Each of the two internal examinations has to be conducted out of 50 marks. First series test
shall be preferably conducted after completing the first half of the syllabus and the second
series test shall be preferably conducted after completing remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly completed
module), having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly completed
module), each with 7 marks. Out of the 7 questions, a student should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions
from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 full questions from each module of which student should answer any
one. Each question can have maximum 2 sub-divisions and carries 14 marks.
 SYLLABUS`

Module -01 (Genomics and Proteomics)

Genes, Genes in genomes, Genomes of prokaryotes and Eukaryotes, Protein-coding genes,
RNA, Single-nucleotide polymorphisms, Microarray, Analysis of microarray data, Proteins
and peptides, Experimental Protein structure identification, computational methods for
protein structure prediction, Homology modelling, Protein folding and fold recognition.

Module-02 (Computer Aided Drug Discovery)

Drug discovery pipeline, Drug target identification & validation, Active site identification,
pharmacophore, Lead/Ligand identification, lead compound optimization, Binding energy
calculation, Energy Minimization. Molecular modelling in drug discovery, concept of
Molecular Dynamics, concept of Absorption, Distribution, Metabolism and Excretion
(ADME), Quantitative Structure-Activity Relationships.

Module-03 (Network Biology)

Transcriptional Regulatory Networks, Genes and DNA Regulatory Regions, Genetic
Interaction Map, Protein Interaction Networks, Experimental methodologies to obtain Protein
Interaction Data, Computational methods to Predict Protein-Protein Interactions,
Visualization of Protein Interaction Networks,Metabolic Networks, Interacting Partners,
Mathematical Representation

Module-04 (Next Generation Sequencing and analysis)

A Typical NGS Experimental Workflow, Next-Generation Sequencing (NGS) Technologies,

Illumina Reversible Dye-Terminator Sequencing, Ion Torrent Semiconductor Sequencing,
Pacific Biosciences Single Molecule Real-Time (SMRT) Sequencing, RNA-sequencing
(RNA Seq), Protein-DNA Interaction Analysis (ChIP-Seq)

Module-05 (NGS Data Analysis)

Base Calling, FASTQ File Format, and Base Quality Score, NGS Data Quality Control and
Preprocessing, Reads Mapping, Mapping Approaches and Algorithms, Selection of Mapping
Algorithms and Reference Genome Sequences, SAM/BAM as the Standard Mapping File
Format, Mapping File Examination and Operation, Tertiary Analysis

Books
1. Lesk, Arthur M. Introduction to Bioinformatics. United Kingdom, Oxford University
Press, 2019.
2. Biological Networks. Singapore, World Scientific Publishing Company, 2007.
3. Wang, Xinkun. Next-Generation Sequencing Data Analysis. United States, CRC
Press, 2016.

References
1. Tiwary, Basant K.. Bioinformatics and Computational Biology: A Primer for
Biologists. Singapore, Springer Singapore, 2021.
 2. Benfey, Philip N.. Quickstart Molecular Biology: An Introductory Course for
Mathematicians, Physicists, and Computational Scientists. United States, Cold Spring
Harbor Laboratory Press, 2014.
3. Baxevanis, Andreas D., Gary D. Bader, and David S. Wishart, eds. Bioinformatics.
John Wiley & Sons, 2020.
4. Shaik, Noor Ahmad, et al. Essentials of Bioinformatics, Volume I. Springer, 2019
5. Selzer, Paul M., Richard J. Marhöfer, and Andreas Rohwer, Applied
bioinformatics. An introduction–Springer, Verlag,, 2008.
6. S C Rastogi, N Mendiratta and P Rastogi, Bioinformatics: Methods and Applications ,
PHI Learning Private Limited, New Delhi, 2015.
7. D E Krane and M L Raymer, Fundamental Concepts of Bioinformatics, Pearson
Education, 2006.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Compare and contrast the genomes of Prokaryotes and Eukaryotes
2. Summarize the method of DNA microarray and its analysis.
3. Using the online tool SWISS-MODEL, develop model of Homo sapiens (Human)
Leptin protein and interpret your result

Course Outcome 2 (CO2):

1. Explain the process of computer aided drug discovery and various step involved in
it
2. Explain the process of molecular modelling in drug discovery

Course Outcome 3 (CO3):

1. Differentiate between Transcriptional and protein interaction networks
2. From the STRING database identify the interactions of Homo sapiens TP53 protein
and interpret your result

Course Outcome 4 (CO4):

1. Summarize Next Generation Sequencing methods.
2. Explain The Protein- DNA interaction analysis with the help of ChIP-Seq
3. What can RNA-seq reveal?

Course Outcome 5 (CO5):

1. Illustrate the process involved in Data Quality control and preprocessing in Next
Generation Sequencing
2. Explain the mapping algorithms and reference genome sequences
 TEACHING PLAN

No Contents No of Lecture
(45Hrs)
Module -01 (Genomics and Phylogenetics) (9hrs)

1.1 Genes, Genes in genomes. 1

1.2 Genomes of prokaryotes and Eukaryotes 1
1.3 Protein-coding genes, RNA, Single-nucleotide polymorphisms 1
1.4 Microarrays 1
1.5 Analysis of microarray data 1
1.6 Proteins and peptides 1
1.7 Experimental Protein structure identification 1
1.8 Computational methods for protein structure prediction 1
1.9 Homology modelling, Protein folding and fold recognition 1
Module-02 (Computer Aided Drug Discovery)(9hrs)
2.1 Drug discovery pipeline 1
2.2 Drug target identification & validation 1
2.3 Active site identification, pharmacophore 1
2.4 Lead/Ligand identification 1
2.5 lead compound optimization, Binding energy calculation, 1
Energy Minimization
2.6 Molecular modelling in drug discovery 1
2.7 Concept of Molecular Dynamics 1
2.8 Concept of Absorption, Distribution, Metabolism and 1
Excretion (ADME)
2.9 Quantitative Structure-Activity Relationship 1
Module-03 (Network Biology)(9hrs)
3.1 Transcriptional Regulatory Networks 1
3.2 Genes and DNA Regulatory Regions, 1
3.3 Genetic Interaction Map, 1
3.4 Protein Interaction Networks 1
3.5 Experimental methodologies to obtain Protein Interaction 1
Data
3.6 Computational methods to Predict Protein-Protein Interactions 1
3.7 Visualization of Protein Interaction Networks 1
3.8 Metabolic Networks- Interacting Partners
3.9 Metabolic Networks- Mathematical Representation
 Module-04 (Next Generation Sequencing and analysis) (8hrs)
4.1 A Typical NGS Experimental Workflow 1
4.2 Next-Generation Sequencing (NGS) Technologies 1
4.3 Next-Generation Sequencing (NGS) Technologies 1
4.4 Illumina Reversible Dye-Terminator Sequencing 1
4.5 Ion Torrent Semiconductor Sequencing 1
4.6 Pacific Biosciences Single Molecule Real-Time (SMRT) 1
Sequencing
4.7 RNA-sequencing (RNA Seq) 1
4.8 Protein-DNA Interaction Analysis (ChIP-Seq) 1

Module-05 (NGS Data Analysis)(10hrs)

5.1 NGS data,FASTQ File Format 1
5.2 Base Calling, Base Quality Score 1
5.3 NGS Data Quality Control 1
5.4 NGS data Preprocessing 1
5.5 Reads Mapping, Mapping Approaches and Algorithms, 1
5.6 Selection of Mapping Algorithms and Reference Genome 1
Sequences
5.7 SAM/BAM as the Standard Mapping 1
5.8 Mapping File Examination and Operation 1
5.9 Tertiary Analysis 1
5.10 Demonstration of NGS Data Analysis 1
 Model Question Paper

QP CODE:
Reg No: _______________

Name: _________________ PAGES: 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 395

Course Name: COMPUTATIONAL BIOLOGY

Max. Marks: 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Distinguish between Genes, Genes in genomes.

2. What are the structural features of Eukaryotic cells?

3. What are SNPs and why are they important?

4. How do you identify the active site of a protein?

5. What is protein energy minimization?

6. List any three types of biochemical networks with one line description

7. What are reversible Dye-Terminators in NGS sequencing?

8. What is the difference between the DNA sent for Whole Exome sequencing vs
ChIP sequencing?

9. List any three features of FastQ file format.

10. What is SAM format? How is BAM different from SAM? (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)
11. (a) With the help of a neat diagram, explain a prokaryotic gene structure. Is a (7)
promoter at the upstream or downstream of a transcription unit?
(b) What is homology modeling? Discuss the steps involved in the same (7)

OR

12. (a) Explain the design of a microarray experiment, detailing the various phases. (7)
(b) What experimental method is used to determine the tertiary protein structure? (7)
What are the computational methods?

13. (a) Illustrate the computational drug discovery pipeline with a suitable flowchart (7)
 (b) What is Molecular modeling in drug discovery? Explain the process of (7)
molecular modelling.

OR

14. (a) Explain the scoring functions in molecular docking. (7)

(b) Explain lead compound optimization, Binding energy calculation, Energy (7)
Minimization in the process of Computer aided drug discovery

15. (a) What is transcriptional control and why is it important? Explain how (7)
transcriptional regulatory networks plays an important role in gene
expression and control?

(b) Explain how the computational methods helps in identifying the Protein– (7)
Protein Interactions

OR

16. (a) How the Protein–Protein Interactions are identified by using experimental (7)
methods.
(b) What is metabolic network? What are type of data are needed for metabolic (7)
network reconstruction?

17. (a) Explain any two next-generation sequencing techniques with their steps. (7)
(b) How do you interpret a FastQC report? (7)
OR
18. (a) What are the steps in RNA sequencing?Why is RNA-seq better than (7)
microarrays?
(b) illustrate the steps involved in mapping protein-DNA interactions using (7)
ChIP-sequencing

19. (a)
a How do you interpret per base sequence quality?What is the purpose of (7)
mapping reads to a reference genome?
(b) Explain any three mapping algorithms for the NGS. (7)

OR

20. (a) Illustrate steps involved in the NGS data Preprocessing and Quality Control (7)
(b) Discuss the significance of NGS in clinical diagnosis. (7 )
 AIT ADVANCED Category L T P Credit
397 CONCEPTS IN
COMPUTER VISION HONORS 3 1 0 4

Preamble:

This course enables the learners to understand the advanced concepts in computer vision. The course covers
the basics of image processing, imaging geometry, image segmentation, feature extraction, object
recognition and classification and common applications of computer vision. This course helps the students
to design solutions for complex real-life problems.

Prerequisite: A sound knowledge of Mathematics and concepts of any programming language.

Mapping of course outcomes with program outcomes

CO1 Illustrate the concepts of image formation and image model. (Cognitive Knowledge
Level: Understand)

CO2 Demonstrate various feature extraction and edge detection techniques. (Cognitive
Knowledge Level: Apply

CO3 Apply edge-based and region-based image segmentation techniques. (Cognitive

Knowledge Level: Apply)

CO4 Understand and implement image recognition and classification methods. (Cognitive
Knowledge Level: Apply)

CO5 Explain the various applications of computer vision. (Cognitive Knowledge Level:
Understand)
Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 Assessment Pattern

Continuous Assessment Tests

Bloom’ End Semester
s Examination
Catego Marks (%)
ry Test 1 Test 2
(%) (%)

Remember 30 30 3
0

Understand 30 30 3
0

Apply 40 40 4
0

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus
Module – 1 (Image Formation and Processing)
Image formation and Image model- Components of a vision system- Cameras- camera model
and camera calibration-Radiometry- Light in space- Light in surface - Sources, shadows and
shading.
Fundamentals of Image processing: Basic steps of Image processing system sampling and
quantization of an Image – Basic relationship between pixels.
Module - 2(Feature Extraction)
Points and Patches – Feature detectors, feature descriptors, feature matching, feature tracking.
Edges – edge detection, edge linking. Lines - Successive approximation, Hough transforms,
Vanishing points.
Module - 3 (Image Segmentation)
Classification of segmentation techniques, Edge detection, Edge linking, Thresholding, Region
growing, Region splitting and merging, Watershed based segmentation. Shadow detection and
removal. Image processing using OpenCV - blending, smoothing, and reshaping.

Module - 4 (Image Recognition and Classification)

Shape based object classification, Motion based object classification, Viola Jones Object
Detection Framework, Object classification using CNNs, use of RCNN for object classification.

Module - 5 (Applications)
Speech and Handwriting Recognition, Automatic Face Recognition, Video Segmentation and
Keyframe Extraction, Real-Time Hand Pose Recognition.

Text Books
1. David A. Forsyth & Jean Ponce, Computer vision – A Modern Approach, Prentice Hall, 2002.
2. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer.
3. Maheshkumar H Kolekar, “Intelligent Video Surveillance Systems: An Algorithmic
Approach”, CRC Press.
4. Francesco Camastra, Alessandro Vinciarelli, “Machine Learning for Audio, Image and Video
Analysis: Theory and Applications”, Springer 2015.
Reference Books
1. Reinhard Klette, “Concise Computer Vision: An Introduction into Theory and Algorithms”,
Springer London, 2014.
2. Olivier Faugeras, “Three-Dimensional Computer Vision”, The MIT Press, 1993.

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Explain the components of a visual system.
2. Elaborate on the image formation model.

Course Outcome 2(CO2):

1. Explain edge linking through Hough Transform.

2. Discuss how feature extraction is done in image processing.

Course Outcome 3(CO3):

1. Compare the following methods for image segmentation: a) multiple thresholding, b) global thresholding
c) local thresholding.

2. Justify the role of region growing, region splitting and region merging operations in any of the computer
vision applications.

Course Outcome 4(CO4): .

1. Explain convolution stage and pooling stage of a typical CNN layer.

2. Illustrate Viola Jones object detection framework.

Course Outcome 5(CO5):

1. Elaborate on how computer vision helps in automatic face recognition applications.

2. Discuss how computer vision helps in tackling complex real world problems.
 Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 397

Course Name: Advanced Concepts in Computer Vision

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Explain the working of a pinhole camera, Derive the expression for pinhole perspective
projection.

2. Illustrate “foreshortening” with a neat diagram.

3. Explain edge linking through Hough Transform.

4. Illustrate any two techniques for vanishing point detection in an image.

5. Compare following methods for image segmentation

a, multiple thresholding, b, global thresholding c, local thresholding.

6. Draw the flowchart of foreground-pixel extraction by edge-based shadow removal

7. Why is a convolutional neural network preferred over a dense neural network for an
image classification task?

8. Assess the relevance of selective search algorithm in RCNN for object classification
9. Draw the diagram which shows the general scheme of a recognition system.

10. Illustrate steps in feature extraction from handwritten images.

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) State different limitations of pinhole cameras and how to overcome these limitations. (9)

(b) What are shadows? Differentiate umbra from penumbra. How is a self shadow (5)
different from a cast shadow?

OR

12. (a) Explain the local shading model.How are area sources different from line sources? (7)

(b) Define Camera Calibration. Explain intrinsic and extrinsic parameters of a camera. (7)

13. (a) Assess the role of adaptive non-maximal suppression (ANMS) in feature detection. (4)

(b) Illustrate following techniques: (10)

i) Bias and gain normalization (MOPS).
ii) Gradient location-orientation histogram (GLOH)

OR

14. (a) Illustrate any 2 techniques in Successive approximation. (4)

(b) Compare Scale invariant feature transform (SIFT) and PCA-SIFT. (5)

15. (a) Illustrate Gradient operator and Laplacian operator with one example for each. (10)

(b) Illustrate Watershed Algorithms. (4)

OR
16. (a) With the help of a diagram illustrate region splitting and merging. (7)

(b) Compare blending, smoothing, and reshaping functions using OpenCV. (7)

17. (a) Differentiate between convolution stage and pooling stage of a typical CNN layer. (8)

(b) Assess the role of dispersedness in shape based object classification. (6)

OR

18. (a) Illustrate Viola Jones object detection framework. (8)

(b) Explain the steps in motion based object classification. (6)

19. (a) Illustrate shot boundary detection through pixel-based approaches and block-based (7)
approaches .

(b) Explain different approaches in keyframe extraction problems. (7)

OR

20. (a) Illustrate shot boundary detection through histogram-based approaches and (6)
clustering-based approaches.

(b) Illustrate HMM training in speech and handwriting recognition. (8 )

Teaching Plan
No Contents No. of Lecture
Hours
(42 hrs)

Module – 1 (Image Formation and Processing) (8 hours)

1.1 Image formation and Image model-Introduction 1 hour

1.2 Components of a vision system- Cameras-Camera model 1 hour

1.3 Camera calibration 1 hour

1.4 Radiometry- Light in space-Light in surface 1 hour

1.5 Sources-Shadows and shading 1 hour

1.6 Fundamentals of Image processing: Basic steps of Image 1 hour

processing system

1.7 Sampling and quantization of an Image 1 hour

1.8 Basic relationship between pixels. 1 hour

Module-2( Feature Extraction) (8 hours)

2.1 Points and Patches – Feature detectors 1 hour

2.2 Feature descriptors 1 hour

2.3 Feature matching 1 hour

2.4 Feature tracking. 1 hour

2.5 Edges – edge detection, edge linking. 1 hour

2.6 Lines - Successive approximation 1 hour

2.7 Hough transforms 1 hour

2.8 Vanishing points 1 hour

Module-3( Image Segmentation)(9 hours)

3.1 Classification of segmentation techniques, Edge detection 1 hour

3.2 Edge linking 1 hour

3.3 Thresholding, Region growing 2 hours

3.4 Region splitting and merging 1 hour

3.5 Watershed based segmentation. 1 hour

3.6 Shadow detection and removal 1 hour

3.7 Image processing using OpenCV - blending 1 hour

3.8 Smoothing, and reshaping 1 hour

Module-4(Image Recognition and Classification) (9 hours)

4.1 Shape based object classification 1 hour

4.2 Motion based object classification 2 hours

4.3 Viola Jones Object Detection Framework 2 hours

4.4 Object classification using CNNs 2 hours

4.6 Use of RCNN for object classification. 2 hours

Module-5( Applications)(8 hours)

5.1 Speech and Handwriting Recognition 1 hour

5.2 Handwriting Recognition 1 hour

5.3 Automatic Face Recognition 2 hours

5.4 Video Segmentation 2 hours

5.5 Keyframe Extraction 1 hour

5.6 Real-Time Hand Pose Recognition. 1 hour

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

SEMESTER VI
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

AMT CONCEPTS IN Category L T P Credit Year of

302 NATURAL Introduction
LANGUAGE
PEC 3 1 0 4 2019
PROCESSING

Preamble:
This course enables the learners to understand the concepts of Natural Language Processing.The
course covers basic pre-processing steps, language models, text classification using machine
learning algorithms, information and relation extraction methods, Information Retrieval, Question
Answer Systems and Machine Translation models. This course enables the students to apply
techniques and methods to solve challenging real-world problems in NLP.
Prerequisite: Nil.

Mapping of course outcomes with program outcomes

CO1 Summarize basic concepts and learning methods for NLP (Cognitive Knowledge
Level: Understand)

CO2 Demonstrate the relevance of pre-processing methods on text data(Cognitive

Knowledge Level: Apply)

CO3 Compare different language modelling techniques(Cognitive Knowledge Level:

Apply)

CO4 Make use of NLP techniques in Text Classification and Information

Retrieval(Cognitive Knowledge Level: Apply)

CO5 Explain Information Extraction, Relation Detection, QA Systems and Machine

Translation(Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate
Create

Mark Distribution
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of InternalTests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module – 1 (Introduction to NLP)
NLP Tasks and Applications, Language-Building Blocks, Challenges of NLP, Machine Learning
for NLP – Naïve Bayes Classifier, Logistic Regression, Support Vector Machines, Approaches to
NLP-- Heuristics-Based NLP, Machine Learning-based NLP.
Module - 2(Pre-processing and Representation Models)
NLP System Pipeline--Steps--Data Acquisition, Text Extraction and Clean-up, Pre-processing,
Feature Engineering, Modelling, Evaluation, Post-Modelling Phases
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

Text Representation--Vector Space Models--Basic Vectorization Approaches--One-Hot

Encoding, Bag of Words, Bag of N-Grams TF-IDF; Distributed Representations-- Word
Embeddings, Doc2Vec.
Module - 3 ( Classification and Information Extraction)
Text Classification--Text classification applications – Pipeline for building text classification
systems, Naïve Bayes for Sentiment Classification – Naïve Bayes Classifier Training –
Optimizing for Sentiment Analysis, Logistic Regression, Support Vector Machine for Text
Classification
Information Extraction(IE)—IE Applications – The General Pipeline for IE - Named Entity
Recognition(NER), Ambiguity in Named Entity Recognition – NER as Sequence Labeling –
Evaluation of NER.
Module - 4 (Relation Detection and Information Retrieval)
Relation Detection and Classification – Supervised Learning Approaches to Relation Analysis –
Lightly Supervised Approaches to Relation Analysis – Evaluation of Relation Analysis systems
Information Retrieval – Term weighting and document scoring – Inverted Index – Evaluation of
Information Retrieval Systems.
Module - 5 (QA Systems and Machine Translation )
Question-Answering Systems – Factoid Question Answering – Question Processing – Passage
Retrieval – Answer Processing – Evaluation of Factoid Answers

Machine Translation – Why Machine Translation is Hard – Classical Machine Translation –

Direct Translation – Transfer – Statistical Machine Translation- The Phrase based Translation
model – Alignment in MT – Training Alignment Models – Symmetrizing Alignments for Phrase-
based MT – Decoding for Phrase-based Statistical MT

Text Books
1. Daniel Jurafsky, James H. Martin , “Speech and Language Processing”(2nd and 3rd editions),
Pearson Prentice Hall
2. SowmyaVajjala, BodhisattwaMajumder, Anuj Gupta, Harshit Surana,” Practical Natural
Language Processing: A Comprehensive Guide to Building Real-World NLP Systems“ June
2020 Publisher(s): O'Reilly Media, Inc. ISBN: 9781492054054.
ReferenceBooks
1. James Allen, “Natural Language Understanding”, Second Edn , Pearson.
2. Christopher Manning and HinrichSchutze, Statistical Natural Language Processing, MIT Press.
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Explain the fundamental tasks that make up an NLP system.

2. Why is NLP considered a challenging problem domain?

3. The following table shows data about the profile of customers and whether they
purchase computers or not. Given this data, use Naïve Bayes Classifier to classify
the customer X (age = youth, income = medium, student = yes, credit rating = fair)

4. Illustrate how linearly inseparable data can be made linearly separable by suitable
mapping using kernel functions.
Course Outcome 2(CO2):
1. Mention two issues associated with sentence segmentation.

2. Show how is lemmatization done using Python Library.

3. Given a dataset of tweets, prepare the data for sentiment analysis by doing the
following operations: conversion to lower casing, removal of punctuations, removal of
stop-words, stemming, lemmatization, removal of emojis and removal of URLs.
(Assignment Question)

Course Outcome 3(CO3):

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

1. Compare Bag-of-Words model and Bag-of-n-gram model.

2. Illustrate how TF-IDF model is used to represent text. Mention the advantage of TF-IDF
over other models.

3. A corpus of data is given below:

Use one hot-encoding and Bag-of-words models to represent “dog bites man”.
4. Using the toy corpus given above, represent the sentence “Dog and Man eat meat” with
TF-IDF model. Use python code for implementation. (Assignment Question)

Course Outcome 4(CO4):

1. Given the following data about documents and contents, use tf-idf document scoring method
to retrieve the document for the query “best game”
The game was so exciting. The players excelled in every
Doc 1 department of the game.
Doc 2 It was an excellent game.
Doc 3 The game was not good. The moves were boring
2. A corpus of data is available from a social media platform that represents review of
books.How can Naïve Bayes Classifier be used for sentiment analysis of the reviews? What
changes can be made to this classifier to make it tuned for sentiment analysis.
3. Use python library to implement sentiment analysis of review of a book, given a toy corpus
data set given below. (Assignment Question)

Document Category
just plain boring Negative
entirely predictable and lacks energy Negative
no surprises and very few laughs Negative
very powerful book Positive
the best book of the summer Positive

Course Outcome 5(CO5):

1. Explain lightly supervised approaches to relational analysis.
2. Explain a statistical algorithm for word alignment in Machine Translation.
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 302

Course Name: Concepts in Natural Language Processing

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate information extraction and information retrieval.

2. State Bayes’ Theorem.

3. List threepreprocessing steps that are necessary for an HTML file.

4. Differentiate CBOW and Skipgram models

5. Explain the role of support vectors in SVM Classification.

6. Explain challenges in Name Entity Recognition.

7. How is a Relational Analysis System evaluated?

8. Explain the need for an inverted index in an information retrieval system. Are there
any more efficient data structures that serve the same purpose.

9. How do you extract answers to DEFINITION questions?

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

10. What are the components that make up a noisy channel model of statistical
Machine Translation? (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) How is classification done by SVM on linearly separable data? (8)

(b) What is a kernel function? What is the need for a kernel function? Can a (4)
kernel function be replaced by an ordinary mapping function?

(c) Explain Heuristic-based NLP. (2)

OR

12. (a) Illustrate the steps involved in classification in Naïve Bayes Classifier. (8)

(b) Explain the fundamental tasks that make up an NLP system. (6)

13. (a) Supposing that a set of social media posts’ dataset is available to do sentiment (8)
analysis. What pre-processing steps need to be done in order to use the data
for generating a language model? Illustrate.

(b) Illustrate Bag-of-ngrams model with an example. (6)

OR

14. (a) Explain the concept of word embeddings as a model for text representation. (6)

(b) Compare word embeddings model with vectorization approaches. (4)

(c) Explain the concept of feature engineering in NLP Systems. (4)

15. (a) 1. Given the following data about movie review and its classification, (10)
classify“predictable with no fun” to one of the classes using Naïve
Bayes Classifier.

Document Category
just plain boring Negative
entirely predictable and lacks energy Negative
no surprises and very few laughs Negative
 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

very powerful Positive

the most fun film of the summer Positive

(b) Explain challenges in Name Entity Recognition. (4)

OR

16. (a) Explain Logistic Regression for Text Classification. (6)

(b) Explain Name Entity Recognition using Sequence Labeling. (8)

17. (a) Explain supervised approach to relation analysis. What are its limitations? (10)

(b) How is term selection done for indexing? (4)

OR

18. (a) Given the following data about documents and contents, use tf-idf document (10)
scoring method to retrieve the document for the query “sweet love”.

Doc 1 Sweet sweet nurse! Love

Doc 2 Sweet sorrow
Doc 3 How sweet is love?
Doc 4 Nurse!

(b) Explain the approaches to evaluate a relation analysis system. (4)

19. (a) Explain the phases of a factoid question-answering system. (8)

(b) Give an algorithm for word alignment in Machine Translation. (6)

OR

20. (a) How is decoding done in a Phrase-based Statistical Machine Translation (10)
System?

(b) Explain the concept of Mean Reciprocal Rank. (4)

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

TEACHING PLAN
No of
No Contents Lecture
Hrs: 45

Module 1 : Introduction to NLP (8 hours)

1.1 Introduction to NLP – Tasks and Applications 1

1.2 Language – Building Blocks, Challenges of NLP 1

1.3 Approaches to NLP - Heuristics-Based NLP, 1

1.4 Machine Learning for NLP 1

1.5 Naïve Bayes Classifier 1

1.6 Logistic Regression 1

1.7 Support Vector Machines – Linearly Separable Data 1

1.8 Support Vector Machines – Linearly Inseparable Data 1

Module 2 : Pre-processing and Representation Models( 10 hours)

2.1 NLP System Pipeline – Stages – Overview 1

2.2 NLP System Pipeline – Data Acquisition 1

2.3 NLP System Pipeline – Text Extraction and Cleanup 1

2.4 NLP System Pipeline – Preprocessing - Sentence segmentation 1

2.5 Word tokenization, Stemming and lemmatization 1

Feature Engineering, Model Building, Evaluation – Metrices, Post-

2.6 1
modeling phase

2.7 Text Representation – Vector Space Model 1

2.8 Vectorization Approaches – One hot encoding, Bag of words 1

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

2.9 Bag of n-grams, TF-IDF 1

2.10 Word Embeddings – Word2Vec- CBOW, SkipGram models 1

Module 3: Classification and Information Extraction(9 hours)
Text Classification-Text classification applications, Pipeline for
3.1 1
building text classification systems

3.2 Sentiment Analysis using Naïve Bayes Classifier 1

Case Studies for Text Classification using Logistic Regression and

3.3 1
Support Vector Machines (Lecture 1)

Case Studies for Text Classification using Logistic Regression and

3.4 1
Support Vector Machines (Lecture 2)

Information Extraction (IE) and Applications, IE Tasks and the IE

3.5 1
Pipeline

3.6 Named Entity Recognition (NER), Ambiguity in NER 1

3.7 NER as Sequence Labeling 1

3.8 Evaluation of NER 1

3.9 Practical NER Systems 1

Module 4 : Relation Detection and Information Retrieval(8 hours)

Relation Detection and Classification – Supervised Learning 1

4.1
Approaches to Relation Analysis

4.2 Relation Detection and Classification – Lightly Supervised 1

Approaches to Relation Analysis
Relation Detection and Classification -Evaluation of Relation
4.3 1
Analysis systems

Information Retrieval – Term weighting and document scoring

4.4 1
(Lecture 1)

Information Retrieval – Term weighting and document scoring

4.5 1
(Lecture 2)

4.6 Inverted Index 1

 BTECH ARTIFICIAL INTELLIGENCE ANDBMACHINE LEARNING

4.7 Evaluation of Information-Retrieval Systems (Lecture 1) 1

4.8 Evaluation of Information-Retrieval Systems (Lecture 2) 1

Module 5 : QA Systems and Machine Translation (10 hours)

Question-Answering Systems – Factoid Question Answering,

5.1 1
Question Processing

5.2 Passage Retrieval 1

5.3 Answer Processing, Evaluation of Factoid Answers 1

5.4 Machine Translation – Why Machine Translation is Hard 1

5.5 Classical Machine Translation 1

5.6 Statistical Machine Translation 1

5.7 The Phrase based Translation model 1

5.8 Alignment in Machine Translation 1

5.9 Decoding for Phrase-based Statistical MT (Lecture 1) 1

5.10 Decoding for Phrase-based Statistical MT (Lecture 2) 1

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT304 ROBOTICS AND Category L T P Credit Year of

INTELLIGENT Introduction
SYSTEM
PCC 3 1 0 4 2022

Preamble:
This course enables the learners to understand the fundamental concepts and algorithms in
Robotics and Intelligent systems. The course covers the standard hardware and kinematic concepts
for robot design. Standard algorithms for localization, mapping, path planning, navigation and
obstacle avoidance, to incorporate intelligence in robots are included in the course. This course
helps the students to design robots with intelligence in a real-world environment.
Prerequisite: Basic understanding of probability theory, linear algebra, machine learning,
artificial intelligence
Mapping of course outcomes with program outcomes

Understand the concepts of manipulator and mobile robotics. (Cognitive Knowledge

CO1
Level: Understand)

CO2 Choose the suitable sensors, actuators and control for robot design. (Cognitive
Knowledge Level: Apply)

CO3 Developing kinematic model of mobile robot and understand robotic vision
intelligence. (Cognitive Knowledge Level: Apply)

CO4 Discover the localization and mapping methods in robotics. (Cognitive Knowledge
Level: Apply)

CO5 Plan the path and navigation of robot by applying artificial intelligence algorithm.
(Cognitive Knowledge Level: Apply)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment Tests

Bloom End Semester
’s Examination
Catego Marks (%)
ry Test 1 Test 2
(%) (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have a maximum 2 subdivisions and carries 14 marks.

Syllabus
Module – 1 (Introduction to robotics)
Introduction to robotics – Degrees of freedom, Robot types- Manipulators- Anatomy of a
robotic manipulator-links, joints, actuators, sensors, controllers. Robot configurations-PPP,
RPP, RRP, RRR. Mobile robots- wheeled, legged, aerial robots, underwater robots, surface
water robots . Dynamic characteristics- speed of motion, load carrying capacity & speed of
response. Introduction to End effectors - mechanical grippers, special tools, Magnetic grippers,
Vacuum grippers, adhesive grippers, Active and Passive grippers. Ethics in robotics - 3 laws -
applications of robots.
Module - 2(Sensors, Actuators and Control)
Sensor classification- touch, force, proximity, vision sensors. Internal sensors-Position sensors,
velocity sensors, acceleration sensors, Force sensors; External sensors-contact type, non
contact type; Digital Camera - CCD camera - CMOS camera - Omnidirectional cameras
Sensor characteristics. Actuators - DC Motors - H-Bridge - Pulse Width Modulation - Stepper
Motors – Servos, Hydraulic & pneumatic actuators. Control - On-Off Control - PID Control -
Velocity Control and Position Control
Module – 3 (Robotic vision & Kinematics)
Robotic Vision: Sensing, Pre-processing, Segmentation, Description, Recognition,
Interpretation, Feature extraction -Camera sensor hardware interfacing. Representation of
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Transformations - Representation of a Pure Translation - - Pure Rotation about an Axis -

Combined Transformations - Transformations Relative to the Rotating Frame.
Basic understanding of Differential-Drive Wheeled Mobile Robot, Car-Like Wheeled Mobile
Robot. Kinematic model of a differential drive and a steered mobile robot, Degree of freedom
and manoeuvrability, Degree of steerability, Degree of mobility - different wheel
configurations, holonomic and nonholonomic robots. Omnidirectional Wheeled Mobile
Robots.
Module - 4 ( Localization and Mapping)
Position and Orientation - Representing robot position. Basics of reactive navigation; Robot
Localization, Challenges in localization - An error model for odometric position estimation
Map Representation - Continuous representations - Decomposition strategies - Current
challenges in map representation. Probabilistic map-based localization (only Kalman
method), Autonomous map building, Simultaneous localization and mapping (SLAM) -
Mathematical definition of SLAM - Visual SLAM with a single camera - Graph-based
SLAM - Particle filter SLAM - Open challenges in SLAM

Module - 5 (Path Planning and Navigation)

Path Planning- Graph search, deterministic graph search - , breadth first search - depth first
search- Dijkstra’ s algorithm, A*, D* algorithms, Potential field based path planning. Obstacle
avoidance - Bug algorithm - Vector Field Histogram - Dynamic window approaches.
Navigation Architectures - Modularity for code reuse and sharing - Control localization -
Techniques for decomposition. Alternatives for navigation - Neural networks - Processing the
image - Training the neural network for navigation - Convolutional neural network robot
control implementation

Text Books
1. R Siegwart, IR Nourbakhsh, D Scaramuzza, Introduction to Autonomous Mobile Robots
,, MIT Press, USA, 2011
2. Thomas Bräunl - Embedded Robotics,Mobile Robot Design and Applications with
Embedded Systems-Springer (2006)
3. S.G. Tzafestas - Introduction to Mobile Robot Control-Elsevier (2014)
4. Francis X. Govers - Artificial Intelligence for Robotics-Packt Publishing (2018)
5. Saeed B. Niku - Introduction to Robotics_ Analysis, Control, Applications
Reference Books
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. John J. Craig, Introduction to Robotics, Pearson Education Inc., Asia, 3rd Edition, 2005
2. S. K. Saha, Introduction to Robotics 2e, TATA McGraw Hills Education (2014)
3. Peter Corke - Robotics, Vision and Control_ Fundamental Algorithms in MATLAB® -
Springer-Verlag Berlin Heidelberg (2021)

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Categorise the various types of Grippers used in robot manipulators.
2. Differentiate between active and passive grippers.
3. Explain speed of motion and load carrying capacity of a mobile robot.
4. You wish to build a dynamically stable robot with a single wheel only. For each of the
four basic wheel types, explain whether or not it may be used for such a robot.
Course Outcome 2(CO2):
1. Categorise the sensors used in robotics
2. Explain any four characteristics of a sensor
3. Illustrate the sensor performance measuring parameters
4. Suggest any two mechanism to realise 360o Camera
Course Outcome 3(CO3):
1. Determine the degrees of mobility, steerability, and maneuverability for each of the
following: (a) bicycle; (b) dynamically balanced robot with a single spherical wheel (c)
automobile.
2. A frame F was rotated about the y-axis 90o, followed by a rotation about the o-axis of 30o,
followed by a translation of 5 units along the n-axis, and finally, a translation of 4 units
along the x-axis. Find the total transformation matrix.
3. Explain the camera sensor hardware
interfacing.
4. What is an omni directional robot? Explain
two configurations to set up an omni directional robot.
Course Outcome 4(CO4): .
1. Explain the challenges of localization
2. How Kalman method can be used in localization of mobile robots
3. What are the Decomposition strategies in map representation
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. How Visual SLAM can be performed with a single camera

Course Outcome 5(CO5):
1. Explain Dijkstra’s algorithm with a suitable example.
2. Identify the steps of Generic temporal decomposition of a navigation architecture.
3. What is meant by control decomposition? Explain two types of control decomposition.
4. Why does SLAM work better with wheel odometer data available?
5. In the Floor Finder algorithm, what does the Gaussian blur function does to improve the
results?

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 304

Course Name: ROBOTICS AND INTELLIGENT SYSTEM

Max. Marks : 100 Duration: 3

Hours
PART A

Answer All Questions. Each Question Carries 3 Marks

1. What do you mean by degrees of freedom? How many degrees of freedom are
required for a drone to achieve any position in 3D space? And how many more
DOF required for achieving any orientation as well.

2. Explain how leg configuration affects the stability of mobile robot.

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Explain Dynamic range, Linearity and Resolution of a Sensor.

4. Explain the working of a Mechanical accelerometer with a block diagram

5. Differentiate between holonomic and nonholonomic robots.

6. What is the significance of differential drive in mobile robot?

7. How will you represent the position and orientation of a wheeled mobile robot?

8. Identify the 2 mobile robot localization problems.

9. Explain the Bug algorithm for obstacle avoidance. .

10. What is Voronoi diagram method and its advantages?

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the general features of wheeled, legged and aerial robots. (9)

(b) Explain the anatomy of a robotic manipulator with a neat diagram. (5)

OR

12. (a) Briefly explain the dynamic characteristics of robots. (9)

(b) Assume an object of mass 140 kg is to be lifted up with an acceleration of 10 (5)

m/s2. Calculate the gripper force required for the operation, if coefficient of
friction between contact surfaces is 0.2, number of fingers in gripper is 2 and
acceleration due to gravity is 9.8 m/s2

13. (a) Explain the working of an Optical Encoder. (5)

(b) A mobile robot is designed for unidirectional motion with constant velocity. (9)
Illustrate the mechanism to make the robot move in forward and reverse
direction with variable speed. Support with necessary diagrams
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

14. (a) Compare and contrast the working of CCD and CMOS camera (9)

(b) Illustrate the significance of the PID controller with a neat block diagram (5)

15. (a) Outline the seven stages of robot vision. (14)

OR

16. (a) Derive the kinematic model of a differential drive mobile robot. (7)

(b) A frame B was rotated about the x-axis 90o, then it was translated about the (7)
current a-axis 3 inches before it was rotated about the z-axis 90o. Finally, it
was translated about the current o–axis 5 inches.
(a) Write an equation that describes the motions.
(b) Find the final location of a point p(1,5,4)T attached to the frame relative
to the reference frame.

17. (a) Derive error model for odometric position estimation (8)

(b) Illustrate the SLAM problem with suitable diagrams (6)

OR

18. (a) Compare and Contrast graph based and particle SLAM (8)

(b) Describe the concept of mobile robot localization with suitable Block (6)
diagrams

19. (a) Compare and contrast local and global Dynamic window approaches in (7)
obstacle avoidance.

(b) Explain the concepts of floor finding Algorithm (7)

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

20. (a) Illustrate the Incorporation of Neural network approach in Robot navigation? (6)
List its advantages

(b) Make the robot to run from start position to goal position in the Following (8 )
diagram using A* Algorithm

Teaching Plan

No. of
Lecture
No Contents Hours
(45 hrs)

Module-1 (Introduction to robotics) (8 hours)

1.1 Introduction to robotics – Degrees of freedom - Robot types 1 hour

Manipulators- Anatomy of a robotic manipulator-links, joints, actuators,

1.2 1 hour
sensors, controller
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1.3 Robot configurations-PPP, RPP, RRP, RRR- Mobile robots- wheeled 1 hour

1.4 Legged robots, Aerial robots, underwater robots, surface water robots - 1 hour

Dynamic characteristics of robot- speed of motion, load carrying capacity & speed
1.5 of response 1 hour

Introduction to End effectors - mechanical grippers, special tools, Magnetic

1.6 1 hour
grippers

1.7 Vacuum grippers, adhesive grippers, Active and Passive grippers 1 hour

1.8 Ethics in robotics - 3 laws - applications of robots 1 hour

Module-2 (Sensors, Actuators and Control) (9 hours)

2.1 Sensor classification- touch, force, proximity, vision sensors. 1 hour

2.2 Internal sensors-Position sensors, velocity sensors 1 hour

2.3 Acceleration sensors, Force sensors; 1 hour

2.4 External sensors-contact type, non-contact type 1 hour

2.5 Digital Camera - CCD camera - CMOS camera 1 hour

2.6 Omnidirectional cameras - Sensor characteristics 1 hour

2.7 Actuators - DC Motors - H-Bridge - Pulse Width Modulation 1 hour

2.8 Stepper Motors – Servos - Control - On-Off Control 1 hour

2.9 PID Control - Velocity Control and Position Control 1 hour

Module-3 (Robotic vision & Kinematics) (9 hours)

3.1 Robot Vision: Sensing, Pre-processing, Segmentation, Description 1 hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Recognition, Interpretation, Feature extraction -Camera sensor hardware

3.2 1 hour
interfacing

Representation of Transformations - Representation of a Pure Translation -

3.3 Pure Rotation about an Axis 1 hour

Combined Transformations - Transformations Relative to the Rotating

3.4 Frame 1 hour

Basic understanding of Differential Drive Wheeled Mobile Robot - Car Like

3.5 Wheeled Mobile Robot 1 hour

3.6 Kinematic model of a differential drive and a steered mobile robot. 1 hour

3.7 Degree of freedom and manoeuvrability, Degree of steerability 1 hour

3.8 Degree of mobility, Different wheel configurations 1 hour

Holonomic and Nonholonomic robots, Omnidirectional Wheeled

3.9 1 hour
Mobile Robots

Module-4 ( Localization and Mapping) (9 hours)

Position and Orientation - Representing robot position, Basics of reactive

4.1 1 hour
navigation

4.2 Robot Localization, Challenges in localization 1 hour

4.3 An error model for odometric position estimation 1 hour

Map Representation - Continuous representations - Decomposition

4.4 1 hour
strategies

Current challenges in map representation, Probabilistic map-based

4.5 1 hour
localization (only Kalman method)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.6 Probabilistic map-based localization (only Kalman method) 1 hour

Autonomous map building, Simultaneous localization and mapping

4.7 1 hour
(SLAM) - Mathematical definition of SLAM

4.8 Visual SLAM with a single camera - Graph-based SLAM 1 hour

4.9 Particle filter SLAM - Open challenges in SLAM 1 hour

Module-5 (Path Planning and Navigation) (10 hours)

5.1 Path Planning- Graph search 1 hour

Deterministic graph search - breadth first search - depth first search-

5.2 1 hour
Dijkstra’s algorithm

5.3 A*, D* algorithms, Potential field based path planning 1.5 hour

Obstacle avoidance - Bug algorithm - Vector Field Histogram - Dynamic

5.4 1.5 hour
window approaches

Navigation Architectures - Modularity for code reuse and sharing - Control

5.5 1 hour
localization - Techniques for decomposition

5.6 Alternatives for navigation - Neural networks 1 hour

5.7 Processing the image - Training the neural network for navigation 1.5 hour

Training the neural network for navigation - Convolutional neural network

5.8 1.5 hour
robot control implementation
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ALGORITHM Year of
Category L T P Credit
CST Introduction
ANALYSIS AND
306 DESIGN PCC 3 1 0 4 2019

Preamble:
The course introduces students to the design of computer algorithms, as well as analysis of
algorithms. Algorithm design and analysis provide the theoretical backbone of computer science
and are a must in the daily work of the successful programmer. The goal of this course is to
provide a solid background in the design and analysis of the major classes of algorithms. At the
end of the course students will be able to develop their own versions for a given computational
task and to compare and contrast their performance.
Prerequisite:
Strong Foundation in Mathematics, Programming in C, Data Structures and Graph Theory.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Analyze any given algorithm and express its time and space complexities in
CO1
asymptotic notations. (Cognitive Level: Apply)
Derive recurrence equations and solve it using Iteration, Recurrence Tree,
CO2 Substitution and Master’s Method to compute time complexity of algorithms.
(Cognitive Level: Apply)
Illustrate Graph traversal algorithms & applications and Advanced Datastructures
CO3 like AVL trees and Disjoint set operations. (Cognitive Level:
Apply)
Demonstrate Divide-and-conquer, Greedy Strategy, Dynamic programming,
CO4 Branch-and Bound and Backtracking algorithm design techniques
(Cognitive Level: Apply)
Classify a problem as computationally tractable or intractable, and discuss
CO5
strategies to address intractability (Cognitive Level: Understand)
Identify the suitable design strategy to solve a given problem. (Cognitive
CO6
Level: Analyze)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5 √

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Test 1 (%) Test 2 (%) Marks (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of SeriesTests1& 2) 25 marks
Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Module-1 (Introduction to Algorithm Analysis)
Characteristics of Algorithms, Criteria for Analysing Algorithms, Time and Space Complexity -
Best, Worst and Average Case Complexities, Asymptotic Notations - Big-Oh (O), Big- Omega
(Ω), Big-Theta (Θ), Little-oh (o) and Little- Omega (ω) and their properties. Classifying functions
by their asymptotic growth rate, Time and Space Complexity Calculation of simple algorithms.
Analysis of Recursive Algorithms: Recurrence Equations, Solving Recurrence Equations –
Iteration Method, Recursion Tree Method, Substitution method and Master’s Theorem (Proof not
required).
Module–2 (Advanced Data Structures and Graph Algorithms)
Self Balancing Tree - AVL Trees (Insertion and deletion operations with all rotations in detail,
algorithms not expected); Disjoint Sets- Disjoint set operations, Union and find algorithms.
DFS and BFS traversals - Analysis, Strongly Connected Components of a Directed graph,
Topological Sorting.
Module–3 (Divide & Conquer and Greedy Strategy)
The Control Abstraction of Divide and Conquer- 2-way Merge sort, Strassen’s Algorithm for
Matrix Multiplication-Analysis. The Control Abstraction of Greedy Strategy- Fractional Knapsack
Problem, Minimum Cost Spanning Tree Computation- Kruskal’s Algorithms - Analysis, Single
Source Shortest Path Algorithm - Dijkstra’s Algorithm-Analysis.
Module-4 (Dynamic Programming, Back Tracking and Branch & Bound))
The Control Abstraction- The Optimality Principle- Matrix Chain Multiplication-Analysis, All
Pairs Shortest Path Algorithm - Floyd-Warshall Algorithm-Analysis. The Control Abstraction of
Back Tracking – The N Queen’s Problem. Branch and Bound Algorithm for Travelling Salesman
Problem.
Module-5 (Introduction to Complexity Theory)
Tractable and Intractable Problems, Complexity Classes – P, NP, NP- Hard and NP-Complete
Classes- NP Completeness proof of Clique Problem and Vertex Cover Problem- Approximation
algorithms- Bin Packing, Graph Coloring. Randomized Algorithms (Definitions of Monte Carlo
and Las Vegas algorithms), Randomized version of Quick Sort algorithm with analysis.
Text Books
1. T.H.Cormen, C.E.Leiserson, R.L.Rivest, C. Stein, Introduction to Algorithms, 2nd Edition,
Prentice-Hall India (2001)
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, 2nd Edition, Orient Longman Universities Press (2008)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Sara Baase and Allen Van Gelder ―Computer Algorithms, Introduction to Design and
Analysis, 3rd Edition, Pearson Education (2009)
Reference Books
1. Jon Kleinberg, Eva Tardos, “Algorithm Design”, First Edition, Pearson (2005)
Robert Sedgewick, Kevin Wayne, “Algorithms”,4th Edition Pearson (2011)
2.
GIlles Brassard, Paul Brately, “Fundamentals of Algorithmics”, Pearson (1996)
3. Steven S. Skiena, “The Algorithm Design Manual”, 2nd Edition, Springer(2008)

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Is 2n+1 = O(2n) ? Is 22n = O(2n)? Justify your answer.
2. What is the need of asymptotic analysis in calculating time complexity? What are the
notations
used for asymptotic analysis?
3. Calculate the time complexity for addition of two matrices.
4. Define time complexity and space complexity. Write an algorithm for adding n natural
numbers and analyse the time and space requirements of the algorithm.

Course Outcome 2 (CO2):

1. State Master’s theorem for solving recurrences.
2. Solve the recurrence T(n) = 3T(n-2), using iteration method
3. State the conditions in recurrences where Master Theorem is not applicable.
4. Solve the following recurrence equations using Master’s theorem.
a) T (n) = 8T(n/2) + 100 n2
b) T (n) = 2T(n/2) + 10 n
5. Using Recursion Tree method, Solve T(n)= 2T(n/10)+ T(9n/10)+n. Assume constant time for
small values of n.

Course Outcome 3 (CO3):

1. Explain the rotations performed for insertion in AVL tree with example.
2. Write down BFS algorithm and analyse the time complexity. Perform BFS traversal on the
given graph starting from node A. If multiple node choices are available for next travel,
choose the next node in alphabetical order.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Find the minimum and maximum height of any AVL-tree with 7 nodes? Assume that the
height of a tree with a single node is 0. (3)
4. Find any three topological orderings of the given graph.

Course Outcome 4 (CO4):

1. Give the control abstraction for Divide and Conquer method.
2. Construct the minimum spanning tree for the given graph using Kruskal’s algorithm. Analyse
the complexity of the algorithm.

3. Compare Divide and Conquer and Dynamic programming methodologies

4. What is Principle of Optimality?
5. Define Travelling Salesman Problem (TSP). Apply branch and bound algorithm to solve TSP
for the following graph, assuming the start city as ‘a’. Draw the state space tree.

Course Outcome 5 (CO5):

1. Compare Tractable and Intractable Problems
2. With the help of suitable code sequence convince Vertex Cover Problem is an example of
NP-Complete Problem
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Explain Vertex Cover problem using an example. Suggest an algorithm for finding Vertex
Cover of a graph.
4. Write short notes on approximation algorithms.
5. Compare Conventional quick sort algorithm and Randomized quicksort with the help of a
suitable example?
Course Outcome 6 (CO6): (CO attainment through assignment only, not meant for
examinations)
Choosing the best algorithm design strategy for a given problem after applying applicable design
strategies – Sample Problems Given.

1. Finding the Smallest and Largest elements in an array of ‘n’ numbers

2. Fibonacci Sequence Generation.
3. Merge Sort
4. Travelling Sales Man Problem
5. 0/1 Knapsack Problem

Model Question Paper

QP CODE:

Reg No:

Name:
PAGES : 4
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 306

Course Name: Algorithm Analysis and Design

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Define asymptotic notation? Arrange the following functions in increasing order

of asymptotic growth rate.
n3, 2n, log n3, 2100, n2 log n, nn, log n, n0.3, 2logn
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. State Master’s Theorem. Find the solution to the following recurrence equations
using Master’s theorem.
a) T (n) = 8T(n/2) + 100 n2
b) T (n) = 2T(n/2) + 10 n

3. Find any two topological ordering of the DAG given below.

4. Show the UNION operation using linked list representation of disjoint sets.

5. Write the control abstraction of greedy strategy to solve a problem.

6. Write an algorithm based on divide-and-conquer strategy to search an element in a

given list. Assume that the elements of list are in sorted order.

7. List the sequence of steps to be followed in Dynamic Programming approach.

8. Illustrate how optimal substructure property could be maintained in Floyd-

Warshall algorithm.

9. Differentiate between P and NP problems.

10. Specify the relevance of approximation algorithms.

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Define Big O, Big Ω and Big Ɵ Notation and illustrate them graphically. (7)

(b) Solve the following recurrence equation using recursion tree method (7)
T(n) = T(n/3) + T(2n/3) + n , where n>1
T(n) = 1, Otherwise

OR
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

12. (a) Explain the iteration method for solving recurrences and solve the following (7)
recurrence equation using iteration method.
T(n) = 3T(n/3) + n; T(1) = 1

(b) Determine the time complexities of the following two functions fun1( ) and (7)
fun2( ).
i) int fun1(int n)
{
if (n <= 1) return n;
return 2*fun1(n-1);
}
ii) int fun2 (int n)
{
if (n <= 1) return n;
return fun2 (n-1) + fun2 (n-1)
}

13. (a) Write DFS algorithm and analyse its time complexity. Illustrate the (7)
classification of edges in DFS traversal.

(b) Find the strongly connected components of the digraph given below: (7)

OR

14. (a) Illustrate the advantage of height balanced binary search trees over binary (7)
search trees? Explain various rotations in AVL trees with example.

(b) Perform the following operations in the given AVL trees. (7)

i) Insert 70 ii) Delete 55

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

15. (a) State Fractional Knapsack Problem and write Greedy Algorithm for (7)
Fractional Knapsack Problem.

(b) Find the optimal solution for the following Fractional Knapsack problem. (7)
Given the number of items(n) = 7, capacity of sack(m) = 15,
W={2,3,5,7,1,4,1} and P = {10,5,15,7,6,18,3}

OR

16. (a) Write and explain merge sort algorithm using divide and conquer strategy (7)
using the data {30, 19, 35, 3, 9, 46, 10}. Also analyse the time complexity.

(b) Write the pseudo code for Dijkstra’s algorithm. Compute the shortest distance (7)
from vertex 1 to all other vertices using Dijkstra’s algorithm.

17. (a) Write Floyd-Warshall algorithm and analyse its complexity. (5)

(b) Write and explain the algorithm to find the optimal parenthesization of matrix (9)
chain product whose sequence of dimension is 4x10,10x3, 3x12,12x20.

OR

18. (a) Explain the concept of Backtracking method using 4 Queens problem. (7)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Define Travelling Salesman Problem (TSP). Apply branch and bound (7)
algorithm to solve TSP for the following graph, assuming the start city as ‘a’.
Draw the state space tree.

19. (a) State bin packing problem? Explain the first fit decreasing strategy (7)

(b) Prove that the Clique problem is NP-Complete. (7)

OR

20. (a) Explain the need for randomized algorithms. Differentiate Las Vegas and (6)
Monte Carlo algorithms.

(b) Explain randomized quicksort and analyse the expected running time of (9 )
randomized quicksort with the help of a suitable example?

Teaching Plan

No. of Hours
No Topic
(45 hrs)

Module -1 (Introduction to Algorithm Analysis) 9 hrs.

1.1 Introduction to Algorithm Analysis: Characteristics of Algorithms. 1 hour

1.2 Criteria for Analysing Algorithms, Time and Space Complexity - Best, 1 hour
Worst and Average Case Complexities.

1.3 Asymptotic Notations - Properties of Big-Oh (O), Big- Omega (Ω), Big- 1 hour
Theta (Θ), Little-Oh (o) and Little- Omega (ω).

1.4 Illustration of Asymptotic Notations 1 hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1.5 Classifying functions by their asymptotic growth rate 1 hour

1.6 Time and Space Complexity Calculation of algorithms/code segments. 1 hour

1.7 Analysis of Recursive Algorithms: Recurrence Equations, 1 hour

Solving Recurrence Equations – Iteration Method.

1.8 Recursion Tree Method 1 hour

1.9 Substitution method and Master’s Theorem and its Illustration. 1 hour

Module-2 (Advanced Data Structures and Graph Algorithms) 10 Hrs.

2.1 Self Balancing Trees - Properties of AVL Trees, Rotations of AVL Trees 1 hour

2.2 AVL Trees Insertion and Illustration 1 hour

2.3 AVL Trees Deletion and Illustration 1 hour

2.4 Disjoint set operations. 1 hour

2.5 Union and find algorithms. 1 hour

2.6 Illustration of Union and find algorithms 1 hour

2.7 Graph Algorithms: BFS traversal, Analysis. 1 hour

2.8 DFS traversal, Analysis. 1 hour

2.9 Strongly connected components of a Directed graph. 1 hour

2.10 Topological Sorting. 1 hour

Module-3 (Divide & Conquer and Greedy Method) 8 Hrs

3.1 Divide and Conquer: The Control Abstraction. 1 hour

3.2 2-way Merge Sort, Analysis. 1 hour

3.3 Strassen’s Algorithm for Matrix Multiplication, Analysis 1 hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.4 Greedy Strategy: The Control Abstraction. 1 hour

3.5 Fractional Knapsack Problem. 1 hour

3.6 Minimum Cost Spanning Tree Computation- Kruskal’s Algorithm, 1 hour

Analysis.
3.7 Single Source Shortest Path Algorithm - Dijkstra’s Algorithm 1 hour

3.8 Illustration of Dijkstra’s Algorithm-Analysis. 1 hour

Module-4 (Dynamic Programming, Back Tracking and Branch and Bound) 8 Hrs.

4.1 Dynamic Programming: The Control Abstraction, The Optimality 1 hour

Principle.
4.2 Matrix Chain Multiplication-Analysis. 1 hour

4.3 Illustration of Matrix Chain Multiplication-Analysis. 1 hour

4.4 All Pairs Shortest Path Algorithm- Analysis and Illustration of Floyd- 1 hour
Warshall Algorithm.
4.5 Back Tracking: The Control Abstraction . 1 hour

4.6 Back Tracking: The Control Abstraction – The N Queen’s Problem. 1 hour

4.7 Branch and Bound:- Travelling salesman problem. 1 hour

4.8 Branch and Bound:- Travelling salesman problem. 1 hour

Module-5 (Introduction to Complexity Theory) 10 Hrs

5.1 Introduction to Complexity Theory: Tractable and Intractable 1 hour

Problems.
5.2 Complexity Classes – P, NP. 1 hour

5.3 NP- Hard and NP-Complete Problems. 1 hour

5.4 NP Completeness Proof of Clique Problem. 1 hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.5 NP Completeness Proof of Vertex Cover Problem. 1 hour

5.6 Approximation algorithms- Bin Packing Algorithm and Illustration. 1 hour

5.7 Graph Colouring Algorithm and Illustration. 1 hour

5.8 Randomized Algorithms (definitions of Monte Carlo and Las Vegas 1 hour
algorithms).

5.9 Randomized Version of Quick Sort Algorithm with Analysis. 1 hour

5.10 Illustration of Randomized Version of Quick Sort Algorithm with 1 hour

Analysis.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

SEMESTER VI
PROGRAM ELECTIVE I
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

YEAR OF
RECOMMENDATI CATEGORY L T P CREDIT INTRODUCTION
AIT 312
ON SYSTEM
PEC 2 1 0 3 2020

Preamble: The course is prepared with the view of facilitating the learner to get an
overview of recommender system. This course covers the concepts like Introduction to
basic concepts and Recent developments, Collaborative Filtering, Content-based
recommendation, Knowledge based recommendation, Hybrid approaches and Evaluating
Recommender System. The course enables the learners to develop state-of-the-art
recommender systems that automate a variety of choice-making strategies with the goal of
providing affordable, personal, and high-quality recommendations

Prerequisite: Nil

Course Outcomes: After the completion of the course the student will be able to:

Describe the basic concepts of recommender systems (Cognitive

CO 1 Knowledge Level : Understand)
Summarize the features of constraint based and case-based knowledge-
based recommender systems (Cognitive Knowledge Level :
CO 2
Understand)
Explain different hybridizing algorithms and illustrate them with suitable
CO 3 examples. (Cognitive Knowledge Level : Understand )
Analyze the design issues in offline recommender evaluation (Cognitive
CO 4 Knowledge Level : Apply)
Explain the features of attack-resistant recommender systems (Cognitive
CO 5 Knowledge Level : Understand)

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO6 PO PO PO PO1 PO1 PO1

1 2 3 4 5 7 8 9 0 1 2

CO1

CO2

CO3

CO4
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO# Broad

PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

End Semester
Bloom’s Test1 Test2
Examination Marks
Category (percentage) (percentage)
Remember 40 40 40
Understand 40 40 40
Apply 20 20 20
Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.First Internal
Examination shall be preferably conducted after completing the first half of the syllabus and
the Second Internal Examination shall be preferably conducted after completing the
remaining part of the syllabus. There will be two parts: Part A and Part B. Part A contains 5
questions (preferably, 2 questions each from the completed modules and 1 question from the
partly covered module), having 3 marks for each question adding up to 15 marks for part A.
Students should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly covered module),
each with 7 marks. Out of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions
from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 questions from each module of which a student should answer any one.
Each question can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus

Module 1(Introduction to basic concepts and Recent developments)

Introduction to basic concepts and Recent developments, Collaborative recommendation -

User-based nearest neighbor recommendations, Item-based nearest neighbour
recommendation, Collaborative recommendation ratings, Model-based and preprocessing-
based approaches, Recent practical approaches and systems Content-based recommendation -
Content representation and content similarity Similarity-based retrieval and other text
classification methods

Module 2 (Knowledge-based recommendation)

Knowledge-based recommendation - Knowledge representation and reasoning, Constraints,

Cases and similarities, Interacting with constraint-based recommenders - Defaults Dealing
with unsatisfiable requirements and empty result set, Proposing repairs for unsatisfiable
requirements, Ranking the items/utility-based recommendation, Interacting with case-based
recommenders, Critiquing -Compound critiquing, Dynamic critiquing

Module 3 (Hybrid recommendation approaches )

Hybrid recommendation approaches - Opportunities for hybridization Recommendation

paradigms, Hybridization designs, Monolithic hybridization design - Feature
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

combination hybrids, Feature augmentation hybrids, Parallelized hybridization design -

Mixed hybrids, Switching hybrids, Weighted hybrids, Pipelined hybridization design
Cascade hybrids, Meta-level hybrids Limitations of hybridization strategies

Module 4 (Evaluating Recommender Systems)

Introduction - Evaluation Paradigms , User Studies , Online Evaluation Offline Evaluation

with Historical Data Sets, General Goals of Evaluation Design - Accuracy, Coverage ,
Confidence and Trust , Novelty , General Goals of Evaluation Design - Serendipity
,Diversity , Robustness and Stability Scalability, Design Issues in Offline Recommender
Evaluation - Case Study of the Netflix Prize Data Set , Segmenting the Ratings for Training
and Testing - Hold-Out , Cross-Validation , Comparison with Classification, Accuracy
Metrics in Offline Evaluation - Measuring the Accuracy of Ratings Prediction , RMSE
versus MAE, Impact of the Long Tail, Evaluating Ranking via Correlation , Evaluating
Ranking via Utility Evaluating Ranking via Receiver Operating Characteristic, Limitations
of Evaluation Measures - Avoiding Evaluation Gaming

Module 5 (Attack-Resistant Recommender Systems)

Introduction Understanding the Trade-Offs in Attack Models - Quantifying Attack Impact

Types of Attacks - Random Attack . Average Attack Bandwagon, Reverse Bandwagon
Attack, Probe Attack Segment Attack, Effect of Base Recommendation Algorithm,
Detecting Attacks on Recommender Systems - Individual Attack Profile Detection , Group
Attack Profile Detection - Preprocessing Methods Online Methods Strategies for Robust
Recommender Design - Preventing Automated Attacks with CAPTCHAs Using Social
Trust. Designing Robust Recommendation Algorithms - Incorporating Clustering in
Neighborhood Methods Fake Profile Detection during Recommendation Time Association
- Based Algorithms

Text Books
3. Jannach D., Zanker M. and FelFering A., Recommender Systems: An Introduction,
Cambridge University Press(2011)
4. C.C. Aggarwal, Recommender Systems: The Textbook, Springer, 2016.
Reference Books
5. F. Ricci, L Rokach, B. Shapira and P.B. Kantor, Recommender systems handbook,
Springer 2010
6. Manouselis N., Drachsler H., Verbert K., Duval E., Recommender Systems For Learning,
Springer (2013), 1st ed.

Course Level Assessment Questions

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

Course Outcome 1 (CO1): Discuss the cases in which content-based recommendations will
not perform as well as collaborative filtering.
Course Outcome 2 (CO2): Analyze, in detail, different techniques available to support
users in the interaction with constraint-based recommender applications.
Course Outcome 3(CO3): Explain about the feature combination and feature augmentation
hybrid mechanisms.

Course Outcome 4 (CO4): With appropriate case study, explain the design issues in offline
recommender evaluation .

Course Outcome 5 (CO5): Illustrate different methods used to detect attacks on existing
recommender system.

Model Question Paper

QP CODE:
Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: AIT 312
Course Name: Recommendation System
Max. Marks : 100 Duration: 3 Hours

PART A
Answer All Questions. Each Question Carries 3 Marks

4. List any two purposes of recommender systems.

5. Indicate the main idea of collaborative recommendation approaches.

6. Describe the two types of outputs generated with pure collaborative approaches
that takes matrix of given user–item ratings as the only input .

7. Define case amplification. How it can be computed?

8. Explain the need of item-based nearest neighbor recommendation system.

9. Define classical constraint satisfaction problem (CSP).

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

10. Differentiate between parallelized hybridization design and pipelined

hybridization design with suitable diagram.

11. What is meant by monolithic hybridization design?

12. Differentiate between internal validity and external validity.

13. Specify the effect of base recommendation algorithm. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

14. (a) Describe about user-based nearest neighbor recommendation system which (7)
deals with new items for which no ratings exist.

(b) Explain about Rocchio’s relevance feedback method (7)

OR

15. (a) Summarize the implicit and explicit rating mechanism in collaborative (7)
recommendation approaches.

(b) Explain any two techniques that deal with data sparsity and the cold-start (7)
problem.

16. (a) Explain QuickXPlain algorithm that calculates one conflict set at a time for (7)
a given set of constraints.

(b) Which are the ways available to specify defaults? Explain how derived (7)
defaults can be determined.

OR

17. (a) Explain about the ranking of items/utility-based recommendation. (7)

(b) Describe DynamicCritiquing algorithm. (7)

18. (a) Explain about feature combination hybrids. (7)

(b) Describe feature augmentation hybrid. (7)

OR

19. (a) Explain about different parallelized hybridization strategies. (7)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

(b) Describe pipelined hybridization design methods. (7)

20. (a) Explain about offline and online evaluations in recommender systems. (7)

(b) Describe the general goals of evaluation design. (7)

OR

21. (a) Discuss about the design issues in offline recommender evaluation. Illustrate (7)
with a case study.

(b) Explain about accuracy metrics in offline evaluation. (7)

22. (a) How do you quantify attack impact on recommender system? (7)

(b) Discuss about different attacks on recommender system. (7)

OR

23. (a) Discuss about different methods available to detect attacks on recommender (7)
system.

(b) Explain how to design robust recommendation algorithms. (7 )

Teaching Plan
No. of
Lecture
Hours
No Contents ( 36 hrs)
(7
Module - 1 (Introduction to basic concepts ) hours)
1.1 Introduction to basic concepts and Recent developments 1 hour
1.2 Collaborative recommendation :User-based nearest neighbor recommendation 1 hour
Collaborative recommendation : Item-based nearest neighbor
1.3 recommendation 1 hour
1.4 Collaborative recommendation ratings 1 hour
Model-based and preprocessing-based approaches, Recent practical approaches
1.5 and systems 1 hour
1.6 Content-based recommendation - Content representation and content similarity 1 hour
1.7 Similarity-based retrieval and Other text classification methods 1 hour
(8
Module - 2 (Knowledge-based recommendation) hours)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

2.1 Knowledge representation and reasoning , Constraints, Cases and similarities 1 hour
2.2 Interacting with constraint-based recommenders - Defaults 1 hour
2.3 Dealing with unsatisfiable requirements and empty result sets 1 hour
2.4 Proposing repairs for unsatisfiable requirements 1 hour
2.5 Ranking the items/utility-based recommendation 1 hour
2.6 Interacting with case-based recommenders Introduction 1 hour
2.7 Critiquing -Compound critiquing 1 hour
2.8 Dynamic critiquing 1 hour
(7
Module- 3 (Hybrid recommendation)
hours)
Hybrid recommendation approaches - Opportunities for hybridization
3.1 1 hour
Recommendation paradigms, Hybridization designs
3.2 Monolithic hybridization design - Feature combination hybrids 1 hour
3.3 Feature augmentation hybrids 1 hour
3.4 Parallelized hybridization design -Mixed hybrids, Switching hybrids 1 hour
3.5 Weighted hybrids 1 hour
3.6 Pipelined hybridization design Cascade hybrids, Meta-level hybrids 1 hour
3.7 Limitations of hybridization strategies 1 hour
(8
Module - 4 ( Evaluating Recommender Systems )
hours)
Introduction - Evaluation Paradigms , User Studies , Online Evaluation
4.1 1 hour
Offline Evaluation with Historical Data Sets
Goals of Evaluation Design - Accuracy, Coverage , Confidence and Trust ,
4.2 1 hour
Novelty
General Goals of Evaluation Design - Serendipity ,Diversity , Robustness and
4.3 1 hour
Stability Scalability
Design Issues in Offline Recommender Evaluation - Case Study of the
4.4 1 hour
Netflix Prize Data Set
Design Issues in Offline Recommender Evaluation -Segmenting the Ratings for
4.5 Training and Testing - Hold-Out , Cross-Validation , Comparison with 1 hour
Classification
Accuracy Metrics in Offline Evaluation - Measuring the Accuracy of Ratings
4.6 1 hour
Prediction , RMSE versus MAE, Impact of the Long Tail
Evaluating Ranking via Correlation , Evaluating Ranking via Utility
4.7
Evaluating Ranking via Receiver Operating Characteristic
4.8 Limitations of Evaluation Measures - Avoiding Evaluation Gaming 1 hour
Module- 5 (Attack-Resistant Recommender Systems ) (6 hours)
Introduction Understanding the Trade-Offs in Attack Models - Quantifying
5.1 1 hour
Attack Impact
5.2 Types of Attacks - Random Attack . Average Attack Bandwagon 1 hour
5.3 Reverse Bandwagon Attack , Probe Attack Segment Attack , Effect of Base 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

Recommendation Algorithm
Detecting Attacks on Recommender Systems - Individual Attack Profile
5.4 Detection ,Group Attack Profile Detection - Preprocessing Methods Online 1 hour
Methods
Strategies for Robust Recommender Design - Preventing Automated Attacks
with CAPTCHAs Using Social Trust . Designing Robust Recommendation
5.5 1 hour
Algorithms - Incorporating Clustering in Neighborhood Methods Fake
Profile Detection during Recommendation Time
5.6 Association-Based Algorithms 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
Category L T P Credit
AIT CONCEPTS IN COMPUTER Introduction
322 GRAPHICS AND IMAGE
PROCESSING PEC 2 1 0 4 2019

Preamble:
The purpose of this course is to make awareness about strong theoretical relationships between
computer graphics and image processing. This course helps the learner to understand three-
dimensional environment representation in a computer, transformation of 2D/3D objects, basic
mathematical techniques and algorithms used to build useful applications, imaging, and image
processing techniques. The study of computer graphics and image processing develops the
abilityto create image processing frameworks for different domains and develops algorithms for
emerging display technologies.

Prerequisite: A sound knowledge of Mathematics and a programming language.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge level:
CO1 Understand)

Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)

Demonstrate geometric representations, transformations on 2D & 3D objects,

CO3 clipping algorithms and projection algorithms(Cognitive Knowledge level: Apply)

Summarize visible surface detection methods(Cognitive Knowledge level:

CO4 Understand)

Summarizethe concepts of digital image representation, processing and

CO5 demonstrate pixel relationships(Cognitive Knowledge level: Apply)

Solve image enhancement and segmentation problems using spatial domain

CO6 techniques(Cognitive Knowledge level: Apply)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING
Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester Examination
Category Test 1 (%) Test 2 (%) Marks (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING
Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks
Continuous Assessment Assignment15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall be
preferably conducted after completing the remaining part of the syllabus. There will be two parts: Part A
and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed modules and 1
question from the partly completed module), having 3 marks for each question adding up to 15 marks for
part A. Students should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly completed module), each
with 7 marks. Out of the 7 questions, a student should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2 full
questions from each module of which student should answer any one full question. Each question can
have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module – 1(Basics of Computer graphics and Algorithms)
Basics of Computer Graphics and its applications. Video Display devices- Refresh Cathode Ray
Tubes, Random Scan Displays and systems, Raster scan displays and systems. Line
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
drawingalgorithms- DDA, Bresenham’s algorithm. Circle drawing algorithms- Midpoint Circle
generation algorithm, Bresenham’s algorithm.
Module - 2(Filled Area Primitives and transformations)
Filled Area Primitives- Scan line polygon filling, Boundary filling and flood filling. Two
dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing, Composite
transformations, Matrix representations and homogeneous coordinates. Basic 3D transformations.
Module - 3 (Clipping and Projections)
Window to viewport transformation. Cohen Sutherland Line clipping algorithm.Sutherland
Hodgeman Polygon clipping algorithm. Three-dimensional viewing pipeline. Projections-Parallel
and Perspective projections. Visible surface detection algorithms- Depth buffer algorithm, Scan
line algorithm.
Module - 4 (Fundamentals of Digital Image Processing)
Introduction to Image processing and applications. Image as 2D data. Image representation
ingrayscale, Binary and Colour images. Fundamental steps in image processing. Components of
image processing system.Coordinate conventions. Sampling and quantization. Spatial and Gray
Level Resolution. Basic relationship between pixels– neighbourhood, adjacency, connectivity.
Module - 5 (Image Enhancement in Spatial Domain and Image Segmentation)
Basic gray level transformation functions- Log transformations, Power-Law transformations,
Contrast stretching. Histogram equalization. Basics of spatial filtering - Smoothing spatial filter-
Linear and nonlinear filters, andSharpening spatial filters-Gradient and Laplacian.
Fundamentals of Image Segmentation.Thresholding-Basics of Intensity thresholding and Global
Thresholding. Region based Approach- Region Growing, Region Splitting and Merging. Edge
Detection - Edge Operators- Sobel and Prewitt.

Text Book
5. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
6. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing. Pearson, 4e, 2017
References
a. William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics. McGraw
Hill, 2001
b. Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw Hill,
2019.
c. David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
d. M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision, Thomson
India Edition, 4e, 2017.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome 1 (CO1):
4. Compare the working principle of raster scan systems and random scan systems.
5. How much time is spent scanning across each row of pixels during screen refresh on a raster
system with resolution of 1280*1024 and a refresh rate of 60 frames per second?
Course Outcome 2 (CO2):
3. Rasterize the line with end points(2,3) and (5,8) using Bresenham’s line drawing algorithm.
4. Explain how the 4-connected area filling approach differs from 8- connected area filling in
boundary filling algorithm
Course Outcome 3 (CO3):
21. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3), where the
position vector of the coordinate ABC is given as A(4,1), B(5,2) and C(4,3).
22. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen Sutherland
algorithm, find the visible portion of the line segment joining the points P(40,80) and Q(120,30)
Course Outcome 4 (CO4):
2. Explain scan line algorithm for detecting visible surfaces in an object.

Course Outcome 5 (CO5):

1. Give an image representation model and describe how the representation changes in grayscale,
binary and colour images.
2. Consider an image segment shown below.
3 1 2 1 (q)
2 2 0 2
1 2 1 1
(p) 1 0 1 2
(a) Let V={0,1} and compute the length of the shortest 4-,8- and m- path between p and
q. If a particular path does not exist between these two points , explain why?
(b) Repeat for V={1,2}.
3. The spatial resolution of an image is given by 128 X 128.What is its storage requirements if
it is represented by 64 gray levels?
Course Outcome 6 (CO6):
6. A skilled medical technician is charged with the job of inspecting a certain class of monochrome
images generated by electronic microscope. To facilitate the inspection, the technician uses image
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
processing aids. However when he examines the images he finds the following problems.
4. Presence of bright isolated dots that are not of interest.
5. Lack of sharpness
6. Poor contrast
Identify the sequence of preprocessing steps that the technician may use to overcome the
above-mentioned problems and explain it.

7. A 4x4, 4 bits/pixel original image is given by

10 12 8 9
10 12 12 14
12 13 10 9
14 12 10 12

5. Apply histogram equalisation to the image by rounding the resulting image pixels to integers
6. Sketch the histogram of the original image and the histogram-equalised image.
8. You have Sobel operator and Laplacian operator for edge detection. Which operator will you select
for edge detection in the case of noisy image? Explain.(Assignment)

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 322

Course Name: Concepts in Computer Graphics and Image Processing

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Justify the approach of using integer arithmetic in Bresenham’s line drawing algorithm.

6. Consider a raster system with a resolution of 1024*1024. What is the size of the raster
needed to store 4 bits per pixel? How much storage is needed if 8 bits per pixel are to be
stored?

7. Show that two successive reflections about either of the coordinate axes is equivalent to
a single rotation about the coordinate origin.

8. Determine a sequence of basic transformations that are equivalent to the x-direction

shearing matrix.

9. Find the window to viewport normalization transformation with window lower left
corner at (1,1) and upper right corner at (2,6).

10. Find the orthographic projection of a unit cube onto the x=0, y=0 and z=0 plane.

11. Define Sampling and Quantization of an image.

12. Give any three applications of digital image processing.

13. A captured image appears very dark because of wrong lens aperture setting. Describe an
enhancement technique which is appropriate to enhance such an image.

14. Suggest an approach of thresholding that should be used in case of uniform illumination.
(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

15. (a) Write Midpoint circle drawing algorithm and use it to plot a circle with (10)
radius=20 and center is (50,30).

(b) Draw the architecture of raster scan display systems and explain its working (4)
principle.

OR

16. (a) Derive the initial decision parameter of Bresenham’s line drawing algorithm (10)
and use the algorithm to rasterize a line with endpoints (2,2) and (10,10).
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the working principle of color CRT monitors with suitable (4)
illustrations.

17. (a) Compare boundary fill algorithm and flood fill algorithm. (5)

(b) Reflect a triangle ABC about the line 3x-4y+8=0. The position vector of the (9)
coordinate ABC is given as A(4,1), B(5,2) and C(4,3).

OR

18. (a) Explain the need of using vanishing points in projections. (4)

(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (10)
line P1(70, 20) and P2(100,10) against a window lower left hand corner
(50,10) and upper right hand corner (80,40).

19. (a) Describe Sutherland Hodegman polygon clipping algorithm and what are its (7)
limitations.

(b) Explain how visible surfaces can be detected using depth buffer algorithm. (7)

OR

20. (a) Describe Sutherland Hodegman polygon clipping algorithm and what are its (7)
limitations.

(b) Explain how visible surfaces can be detected using depth buffer algorithm. (7)

21. (a) Explain the components of an image processing system with suitable diagram (9)

(b) Define Resolution of an image. Explain the spatial and gray level resolution (5)
of an image with an example.

OR

22. (a) Define 4-adjacency, 8 adjacency and m-adjacency. Consider the image (7)
segment shown.
4 2 3 2 (q)
3 3 1 3
2 3 2 2
(p) 2 1 2 3
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Let V={1,2} and compute the length of the shortest 4- ,8- and m- path
between p and q. If a particular path does not exist between these two points,
explain why?

(b) Using any one application, explain the steps involved in image processing. (7)

23. (a) A 5x5 image patch is shown below. Compute the value of the marked pixel if (4)
it is smoothened by a 3x3 average filterand median filter.

(b) Define Image segmentation and describe in detail method of edge and region (10)
based segmentation technique.

OR

24. (a) Distinguish between smoothing and sharpening filters in terms of (10)
5. Functionality

6. Types

7. Applications

8. Mask Coefficients

(b) Describe how an image is segmented using split and merge technique in (8 )
association with the region adjacency graph.

Teaching Plan

No Contents No of Lecture
Hrs (36 hrs)

Module – 1 (Basics of Computer Graphics and Algorithms) (8 hrs)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
1.1 Basics of Computer Graphics and applications 1 hour

1.2 Refresh Cathode Ray Tubes 1 hour

1.3 Random Scan Displays and systems,Raster scan displays and systems 1 hour

1.4 DDA Line drawing Algorithm 1 hour

1.5 Bresenham’s line drawing algorithm 1 hour

1.6 Midpoint Circle generation algorithm 1 hour

1.7 Bresenham’s Circle generation algorithm 1 hour

1.8 Illustration of line drawing and circle drawing algorithms 1 hour

Module - 2 (Filled Area Primitives and transformations) (8 hrs)

2.1 Scan line polygon filling 1 hour

2.2 Boundary filling and flood filling 1 hour

2.3 Basic 2D transformations-Translation, Rotation and Scaling 1 hour

2.4 Reflection and Shearing 1 hour

2.5 Composite transformations 1 hour

2.6 Matrix representations and homogeneous coordinates 1 hour

2.7 Basic 3D transformation-Translation and scaling 1 hour

2.8 Basic 3D transformation-Rotation 1 hour

Module - 3 (Clipping and Projections) (7 hrs)

3.1 Window to viewport transformation 1 hour

3.2 Cohen Sutherland Line clipping algorithm 1 hour

3.3 Sutherland Hodgeman Polygon clipping algorithm 1 hour

3.4 Practice problems on Clipping algorithms 1 hour

3.5 Three-dimensional viewing pipeline, Projections-Parallel 1 hour

projections,Perspective projections

3.6 Visible surface detection algorithms- Depth buffer algorithm 1 hour

3.7 Scan line visible surface detection algorithm 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Module - 4 (Fundamentals of Digital Image Processing) (6 hrs)

4.1 Introduction to Image processing-Image as a 2D data, Image 1 hour

representation-Gray scale, Binary and Colour images.

4.2 Fundamental steps in image processing and applications 1 hour

4.3 Components of image processing system 1 hour

4.4 Coordinate conventions, Sampling and quantization, Spatial and Gray 1 hour
Level Resolution

4.5 Basic relationship between pixels – neighbourhood, adjacency, 1 hour

connectivity

4.6 Illustration of basic relationship between pixels– neighbourhood, 1 hour

adjacency, connectivity

Module - 5 (Image Enhancement in spatial domain and Image Segmentation) (7 hrs)

5.1 Basic gray level transformation functions- Log transformations, Power 1 hour
law transformation, Contrast stretching

5.2 Histogram equalization with illustration 1 hour

5.3 Basics of spatial filtering, Smoothing spatial filter- Linear and 1 hour
nonlinear filters

5.4 Sharpening spatial filtering-Gradient filter mask, Laplacian Filter Mask 1 hour

5.5 Fundamentals of Image Segmentation, Basics of Intensity thresholding, 1 hour

Basic Global Thresholding

5.6 Region Based Approach- Region Growing, Region Splitting and 1 hour
Merging

5.7 Basics of Edge Detection- Sobel and Prewitt edge detection masks 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year Of
FOUNDATIONS Category L T P Credit
CST Introduction
OF SECURITY IN
332
COMPUTING PEC 2 1 0 3 2019

Preamble: The purpose of this course is to create awareness among learners about the
fundamentals of security and number theory. This course covers Integer & Modular Arithmetic,
Primes & Congruences, Discrete Logarithms & Elliptic Curve Arithmetic and an overview of
computer security. The concepts covered in this course enable the learners in effective use of
cryptographic algorithms and to identify the security threats in computing.

Prerequisite: A sound knowledge in Mathematics, Discrete Computational Structures, Operating

Systems and Database Systems.

Course Outcomes: After the completion of the course, the student will be able to

CO1 Illustrate the operations and properties of algebraic structures, integer

arithmetic and modular arithmetic. (Cognitive Knowledge Level:
Understand)

Use the concepts of prime numbers and factorization for ensuring security in
CO2 computing systems (Cognitive Knowledge Level: Apply)

Illustrate the concepts of Linear Congruence, Primitive Roots, Discrete

CO3 Logarithms and Elliptic Curve Arithmetic (Cognitive Knowledge Level:
Apply)
CO4 Summarize the threats and attacks related to computer and program security
(Cognitive Knowledge Level: Understand)
CO5 Outline the key aspects of operating system and database security (Cognitive
Knowledge Level: Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

End Semester
Bloom’s Category Test 1 (%) Test 2 (%)
Examination (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Evaluate
Create

Mark Distribution
Total Marks CIE Marks ESE Marks ESE Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module-1 (Modular Arithmetic)
Integer arithmetic - Integer division, Divisibility, Greatest Common Divisor (GCD), Euclid's
algorithm for GCD, Extended Euclid’s algorithm, Linear Diophantine Equations. Modular
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

arithmetic - Operations, Properties. Algebraic structures - Groups, Rings, Fields, Finite fields,
GF(p), GF (2n).

Module-2 (Prime Numbers and Factorization)

Prime numbers - Prime numbers and prime-power factorization, Fermat and Mersenne primes,
Fermat’s theorem, Applications, Euler’s theorem, Euler’s totient function, Applications.
Primality testing – Deterministic algorithms and Probabilistic algorithms. Factorization -
Fermat’s factorization, Pollard p-1 method.

Module-3 (Linear Congruence, Primitive Roots and Elliptic Curve Arithmetic)

Linear congruence - Simultaneous linear congruence, Chinese Remainder Theorem (CRT).
Congruence with a prime - Power modulus, Arithmetic modulo p, Pseudoprimes and Carmichael
numbers, Solving congruence modulo prime powers. Primitive roots - Existence of primitive
roots for primes, Discrete logarithms. Elliptic curve arithmetic – Prime curves, Binary curves,
Addition of two points, Multiplication of a point by a constant.

Module-4 (Computer and Program Security)

Introduction to computer security – Threats, Vulnerabilities, Controls. Browser attack types, Web
attacks targeting users, Email attack types. Introduction to program security - Non-malicious
programming oversights, Malware.

Module-5 (Operating System and Database Security)

Operating system security – Security in operating system, Security in design of operating system.
Database security – Security requirements of databases, Reliability and integrity, Database
disclosure.

Text Books
5. Behrouz A Forouzan, Cryptography and Network Security, 3/e, Tata McGraw-Hill.
6. Charles P Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies, Security in
Computing, 5/e, Prentice Hall.
7. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

References
a. William Stallings, Cryptography and Network Security Principles and Practices, 4/e,
Pearson Ed.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):
6. Find the n- bit word that is represented by the polynomial x2 +1 in GF(25).
7. Solve the linear Diophantine equation 21x + 14y=35.
Course Outcome 2 (CO2):
21. Prove that a Carmichael number cannot be the product of two distinct primes.
22. Use the Pollard p-1 method to find a factor of 57247159 with the bound B=8.
Course Outcome 3 (CO3):
4. Find an integer that has a remainder of 3 when divided by 7 and 13, but is divisible
by 12.
5. In the elliptic curve E(1,2) over the field GF(11), find the equation of the curve and
all the points on the curve.
Course Outcome 4 (CO4):
5. List three controls that could be applied to detect or prevent off-by-one errors.
6. How does fake email messages act as spam?
Course Outcome 5 (CO5):
1. Discuss the importance of auditability and access control in database security.
2. Explain the various factors which can make data sensitive.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES:

Reg No:
Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST 332

Course Name : FOUNDATIONS OF SECURITY IN COMPUTING

Max Marks: 100 Duration: 3 Hours

PART A
(Answer All Questions. Each question carries 3 marks)

1. List the four properties of divisibility with examples.

2. Find gcd (401,700) using Euclid’s algorithm.

3. Use Fermat’s Little theorem to show that 91 is not a prime.

4. If m is relatively prime to n , show that Φ(mn) = Φ(m) Φ(n).

5.
Solve the congruence relation 103x ≡ 57 (mod 211).

6. Find a solution for the congruence 3x ≡ 5 mod 73

7. What are the problems created by an off-by-one error?

8. How does a clickjacking attack succeed?

9. Explain the significance of correctness and completeness in the design of operating

systems.

10. How does the two-phase update technique help the database manager in handling
failures? (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. (a) For the group G = < Z6*, x>, prove that it is an Abelian group. Also show the
result of 5 x 1 and 1 ÷ 5. (6)

• Find a particular and the general solution to the following linear Diophantine
equations. (8)
i) 19 x+13y = 20 ii) 40 x + 16 y =88

OR

6. (a) Describe the properties of modular arithmetic and modulo operator.

(6)
• Using Extended Euclidean algorithm, find the multiplicative inverse of (i)
(8)
131 in Z180 and (ii) 23 in Z100.

7. (a) State and prove Fermat’s theorem. (6)

• Explain Fermat’s factorization method and use it to factor 809009. (8)

OR
8. (a) Define Euler’s totient function. Prove that, Ø(pq)=(p-1)(q-1) where p and q (7)
are prime numbers.

• Define Fermat primes. Show that any two distinct Fermat numbers are (7)
relatively prime.
9. (a) Using Chinese Remainder Theorem, solve the system of congruence, x (7)
≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7).

• Define Carmichael number and show that a Carmichael number must be the (7)
product of at least three distinct primes.

OR
10. (a) For the group G = <Z19*, x>, find the primitive roots in the group. (6)

• Consider the elliptic curve y2 = x3+ x + 1 defined over Z23. If P = (3, 10) and (8)
Q = (9,7) are two points on the elliptic curve, find 2P and P + Q.

11. (a) Distinguish the terms vulnerability, threat and control. (4)

• With the help of suitable examples, explain the security problems created by (10)
incomplete mediation and time-of-check to time-of use.

OR
12. (a) Differentiate between man-in-the-browser attack and page-in-the-middle (4)
attack.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the four aspects of malicious code infection. (10)

19. (a) List any six computer security related functions addressed by operating (6)
systems.

(b) How does a kernelized design support in enforcing security mechanisms? (8)

OR
20. (a) Explain any four security requirements of databases. (4)

(b) How can database disclosure be prevented? With the help of suitable (10)
examples, explain any six types of disclosure.

Teaching Plan

No Contents No. of
Lecture
Hrs
Module-1 (Modular Arithmetic) (6 hrs)
1.1 Integer arithmetic, Integer division, Divisibility, Greatest Common 1
Divisor (GCD)
1.2 Euclid's algorithm for GCD, Extended Euclid’s algorithm 1
1.3 Linear Diophantine Equations 1

1.4 Modular arithmetic operations, Properties of modular arithmetic 1

1.5 Groups, Rings and Fields 1

1.6 Finite fields – GF(p), GF(2n) 1
Module-2 (Prime Numbers and Factorization) (7 hrs)

Prime numbers and prime-power factorization

2.1 1
Fermat and Mersenne primes 1
2.2
2.3 Fermat’s theorem, Applications – Exponentiation, Multiplicative 1
inverse

2.4 Euler’s theorem, Euler’s totient function, Applications 1

2.5 Primality testing – Deterministic algorithms – Divisibility algorithm 1

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.6 Primality testing – Probabilistic algorithms-Fermat test, Square root 1

test, Miller - Rabin test

2.7 Factorization - Fermat’s factorization, Pollard p-1 method 1

Module-3 (Linear Congruence, Primitive Roots and Elliptic Curve Arithmetic) (7 hrs)

3.1 Linear congruence, Simultaneous linear congruence 1

3.2 Chinese Remainder Theorem (CRT) 1

3.3 Congruence with a Prime-Power Modulus, Arithmetic modulo p 1

3.4 Pseudo-primes and Carmichael numbers 1

3.5 Solving congruence modulo prime powers 1

3.6 Primitive roots, Existence of primitive roots for primes, Discrete 1

logarithms

3.7 Elliptic curve arithmetic – Prime curves, Binary curves, Addition of 1

two points, Multiplication of a point by a constant

Module-4 (Computer and Program Security) (7 hrs) (Text book2: Chapters 1, 3, 4)

Threats, Vulnerabilities, Controls

4.1 1

4.2 Browser attack types 1

Web attacks targeting users
4.3 1
4.4 Email attack types 1

4.5 Non-malicious programming oversights (Lecture 1) 1

4.6 Non-malicious programming oversights (Lecture 2) 1

4.7 Malware – Four aspects of infection 1

Module-5 (Operating System and Database Security) (8 hrs)(Text book2: Chapters 5, 7)

Security in operating system (Lecture 1)

5.1 1

5.2 Security in operating system (Lecture 2) 1

5.3 Security in design of operating system (Lecture 1) 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.4 Security in design of operating system (Lecture 2) 1

5.5 Security requirements of databases 1

5.6 Reliability & integrity 1

5.7 Database disclosure (Lecture 1) 1

5.8 Database disclosure (Lecture 2) 1

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Concepts in Formal YEAR OF

AIT Category L T P Credit
Languages and INTRODUCTION
342
Automata Theory PEC 2 1 0 3 2020

Preamble: This is a core course in theoretical computer science. It covers automata and grammar
representations for languages in Chomsky Hierarchy. For regular languages, it also covers
representations using regular expression and Myhill-Nerode Relation. The topics covered in this
course have applications in various domains including compiler design, decidability and
complexity theory, software testing, formal modelling and verification of hardware and software.

Prerequisite: Basic knowledge about the following topic is assumed: sets, relations -
equivalence relations, functions, proof by Principle of Mathematical Induction.

Course Outcomes: After the completion of the course the student will be able to

Classify a given formal language into Regular, Context-Free, Context Sensitive,

CO1
Recursive or Recursively Enumerable. [Cognitive knowledge level: Understand]

Explain a formal representation of a given regular language as a finite state

CO2 automaton, regular grammar, regular expression and Myhill-Nerode relation.
[Cognitive knowledge level:Understand]

Design a Pushdown Automaton and a Context-Free Grammar for a given context-

CO3
free language. [Cognitive knowledge level: Apply]

Design Turing machines as language acceptors or transducers. [Cognitive

CO4
knowledge level: Apply]

CO5 Explain the notion of decidability. [Cognitive knowledge level: Understand]

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2

CO3
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Examination Marks
Test 1 (Marks) Test 2 (Marks)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment - Test : 25 marks
Continuous Assessment - Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
CST 301 Formal Languages and Automata Theory
Module - 1 (Introduction to Formal Language Theory and Regular Languages)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Regular Languages - Deterministic Finite State Automata (DFA) (Proof of correctness of

construction not required), Nondeterministic Finite State Automata (NFA), Equivalence of DFA
and NFA, Regular Grammar (RG), Equivalence of RGs and DFA.

Module - 2 (More on Regular Languages)

Regular Expression (RE), Equivalence of REs and DFA, Necessary conditions for regular
languages, Closure Properties of Regular Languages, DFA state minimization (No proof
required).

Module - 3 (Myhill-Nerode Relations and Context Free Grammars)

Myhill-Nerode Relations (MNR)- MNR for regular languages, Myhill-Nerode Theorem (MNT)
(No proof required), Applications of MNT.
Context Free Grammar (CFG)- CFG representation of Context Free Languages (proof of
correctness is required), derivation trees and ambiguity, Normal forms for CFGs.

Module - 4 (More on Context-Free Languages)

Nondeterministic Pushdown Automata (PDA), Equivalence of PDAs and CFGs (Proof not
required), Pumping Lemma for Context-Free Languages (Proof not required), Closure
Properties of Context Free Languages.
Module - 5 (Context Sensitive Languages, Turing Machines)
Context Sensitive Languages - Context Sensitive Grammar (CSG).
Turing Machines - Standard Turing Machine, Universal Turing Machine, Halting Problem,
Recursive and Recursively Enumerable Languages.

Chomsky classification of formal languages.

Text Book
6. Dexter C. Kozen, Automata and Computability, Springer (1999)

Reference Materials
6. John E Hopcroft, Rajeev Motwani and Jeffrey D Ullman, Introduction to Automata Theory,
Languages, and Computation, 3/e, Pearson Education, 2007
7. Michael Sipser, Introduction To Theory of Computation, Cengage Publishers, 2013.

Sample Course Level AssessmentQuestions

Course Outcome 1 (CO1): Identify the class of the following languages in Chomsky Hierarchy:

6.
7.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

8.
9.
10. . Here, is a binary encoding of a Turing Machine and is a binary
input to the Turing Machine.
Course Outcome 2 (CO2):

(i) Design a DFA for the language

(ii) Write a Regular Expression for the

language:
(iii) Write a Regular Grammar for the

language:
(iv) Show the equivalence classes of the canonical Myhill-Nerode relation induced by the

language: .
Course Outcome 3 (CO3):

(i) Design a PDA for the language . Here, the notation represents
the reverse of the string .

(ii) Write a Context-Free Grammar for the language .

Course Outcome 4 (CO4):

(i) Design a Turing Machine for the language

(ii) Design a Turing Machine to compute the square of a natural number. Assume that the
input is provided in unary representation.
Course Outcome 5 (CO5): Argue that it is undecidable to check whether a Turing Machine
enters a given state during the computation of a given input .

Model Question paper

QP CODE: PAGES:3
Reg No:______________ Name :______________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 342
Course Name: Concepts in Formal Languages and Automata Theory
Max.Marks:100 Duration: 3 Hours
PART A
Answer all Questions. Each question carries 3 Marks
1. Design a DFA for the language .

2. Write a Regular Grammar for the language:

3. Write a Regular Expression for the language:

4.
Prove that the language is not regular.

5. List out the applications of Myhill-Nerode Theorem.

6.
Write a Context-Free Grammar for the language: .
Here, the notation represents the number of occurrences of the symbol in
the string .

7. Design a PDA for the language of odd length binary palindromes (no explanation
is required, just list the transitions in the PDA).

8. Prove that Context Free Languages are closed under set union.

9. Write a Context Sensitive Grammar for the language (no

explanation is required, just write the set of productions in the grammar).

10. Differentiate between Recursive and Recursively Enumerable Languages.

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

11. (a) Draw the state-transition diagram showing an NFA for the following 8
language . Obtain the DFA equivalent to by applying the subset (7)
construction algorithm.

(b) Draw the state-transition diagram showing a DFA for recognizing the
following language: (7)

multiple of

OR

12. (a) Write a Regular grammar for the following language defined as: 8
(7)
.

(b) Obtain the DFA over the alphabet set , equivalent to the regular (7)
grammar with start symbol and productions: and .

13. (a) Using Kleen’s construction, obtain the regular expression for the language 8
represented by the following NFA

(8)

(b) Using pumping lemma for regular languages, prove that the language
is not regular. (7)

OR

14. (a) Obtain (8)

the
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

minimum-state DFA from the following DFA.

(b) Using ultimate periodicity for regular languages, prove that the language (6)
is not regular.

15. (a) Show the equivalence classes of the canonical Myhill-Nerode relation for the (7)
language of binary strings with odd number of s and even number of s.

(b) With an example, explain ambiguity in Context Free Grammar (7)

OR

16. (a) Convert the Context-Free Grammar with productions: into

Greibach Normal form. (8)

(b) Convert the Context-Free Grammar with productions: (6)

into Chomsky Normal form.

17. (a) Design a PDA for the language . Also illustrate (7)
the computation of the PDA on a string in the language

(b) With an example illustrate how a multi-state PDA can be transformed into an (7)
equivalent single-state PDA.

OR

18. (a) Using pumping lemma for context-free languages, prove that the language: (6)
is not a context-free language.

(b) With an example illustrate how a CFG can be converted to a single-state PDA (8)

19. (a) Design a Turing machine to obtain the sum of two natural numbers and , (7)
both represented in unary on the alphabet set . Assume that initially the
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

tape contains . The Turing Machine should halt with

as the tape content. Also, illustrate the computation of your
Turing Machine on the input and .

(b) With an example illustrate how a CFG can be converted to a single-state (7)
PDA.

OR

20. (a) Design a Turing machine to obtain the sum of two natural numbers and , (7)
both represented in unary on the alphabet set . Assume that initially the
tape contains . The Turing Machine should halt with
as the tape content. Also, illustrate the computation of your Turing Machine
on the input and .

(b) Write a context sensitive grammar for the language . Also (7 )

illustrate how the the string can be derived from the start symbol of
the proposed grammar.

Teaching Plan

Sl. Topic No. of

No Hours
(36Hrs)
Module - 1 (Introduction to Formal Language Theory and Regular Languages)
8 Hours

Deterministic Finite State Automata (DFA) – Example DFA (Proof of

1.1 1 Hour
correctness of construction not required)
1.2 Formal definition of DFA, Language accepted by the class of DFA 1 Hour

1.3 Nondeterministic Finite State Automata (NFA) – Example NFA 1 Hour

1.4 Formal definition of NFA, NFA with transitions - examples, formal 1 Hour
definition
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Equivalence of DFA and NFA with and without transitions - Subset

1.5 1 Hour
construction

1.6 Regular Grammar (RG) – Example RGs, derivation of sentences 1 Hour

1.7 Formal definition of RG, Language represented by a RG 1 Hour

1.8 Equivalence of RG and DFA 1 Hour

Module - 2 (More on Regular Languages) 7 Hours

2.1 Regular Expression (RE) - Example REs and formal definition 1 Hour

2.2 Conversion of RE to NFA with transition 1 Hour

2.3 Conversion of NFA with transition to RE (Kleen’s construction) 1 Hour

2.4 Pumping Lemma for regular languages 1 Hour

2.5 Ultimate periodicity 1 Hour

2.6 Closure Properties of Regular Languages (proof not required) 1 Hour

2.7 DFA state minimization - Quotient construction 1 Hour

Module - 3 (Myhill-Nerode Relations and Context Free Grammars) 7 Hours

Myhill-Nerode Relations (MNR) - Example, Properties of MyhillNerode

3.1 1 Hour
Relation

Conversion of DFA to MNR, Conversion of MNR to DFA (Proof of

3.2 1 Hour
correctness not required)
3.3 Myhill-Nerode Theorem (MNT), Applications of MNT 1 Hour

3.4 Context Free Grammar (CFG) - Example CFGs and formal definition 1 Hour

3.5 Derivation Trees and ambiguity 1 Hour

3.6 Chomsky Normal Form 1 Hour

3.7 Greibach Normal Form 1 Hour

Module - 4 (More on Context-Free Languages) 7 Hours

Nondeterministic Pushdown Automata (PDA) – Example PDAs, formal

4.1 1 Hour
definition
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.2 Acceptance criteria - equivalence 1 Hour

4.3 Conversion of CFG to PDA (No proof required) 1 Hour

4.4 Conversion of PDA to CGF - Part I (No proof required) 1 Hour

4.5 Conversion of PDA to CGF - Part II (No proof required) 1 Hour

4.6 Pumping Lemma for context-free languages (No proof required) 1 Hour

4.7 Closure Properties of Context Free Languages 1 Hour

Module - 5 (Context Sensitive Languages, Turing Machines ) 7 Hours

5.1 Context Sensitive Grammar (CSG) - Examples, formal definition 1 Hour

Turing Machine (TM) - TM as language acceptors - examples, formal
5.2 1 Hour
definition
5.3 TM as transducers - examples 1 Hour
5.4 Universal Turing Machine 1 Hour

5.5 Halting Problem of TM - proof of its undecidability 1 Hour

5.6 Recursive and Recursively Enumerable Languages 1 Hour

5.7 Chomsky classification of formal languages 1 Hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT Artificial Neural Category L T P Credit Year of

352 Networks Techniques Introduction
PEC 2 1 0 3 2019

Preamble:
This course enables the learners to understand the fundamental concepts regarding Artificial
Neural networks. The course covers basic analogy between ANN and human brain, the basic
learning laws, fundamental ANN algorithms, Back Propagation Feed Forward Network, Self
Organising Maps, RBF net, BAM and ART networks. This course enables the students to apply
techniques and methods to solve real-world problems involving the application of ANN.
Prerequisite: Nil.

Course Outcomes

CO1 Summarize the basic concepts and the learning rules of ANN. (Cognitive Knowledge
Level: Understand)

CO2 Utilize the fundamental learning algorithms namely, Mc-Culloch Pitts, Hebb
Perceptron and Adaline to solve real world problems.(Cognitive Knowledge Level:
Apply)

CO3 Implement Back propagation learning algorithm, Generic Radial Basis Function
network. (Cognitive Knowledge Level: Apply)

CO4 Demonstrate Self Organizing Maps and Adaptive Resonance Theory.(Cognitive

Knowledge Level: Understand)

CO5 Implement training algorithms for pattern association. (Cognitive Knowledge Level:
Apply)

Mapping of course outcomes with program outcomes

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

CO1
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)

Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate

Create
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
Internal Examination Pattern
Two internal examinations of two hours duration has to be conducted out of 50 marks. First series
test shall be preferably conducted after completing the first half of the syllabus and the second
series test shall be preferably conducted after completing remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly completed module), having 3 marks
for each question adding up to 15 marks for part A. Students should answer all questions from
Part A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and
1 question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1 (Basics of Artificial Neural Network and Learning Methods)
Characteristics of the human brain, Neurons, Introduction to Artificial Neural Networks,
Terminology, Models of ANN, Topology, Network Architectures, Knowledge Representation,
Learning Process, Learning Tasks. Categories of learning - Hebbian learning, Perceptron
Learning Rule, Delta Learning Rule, Generalized Delta Learning Rule, Competitive learning,
Error-correction learning, Reinforcement learning, Stability and Convergence.
Module – 2(Basic ANN Models)
McCulloch-Pitts Neuron, Architecture, Algorithm and Applications. Biases and Thresholds,
Linear Separability. Hebb Net - Algorithm, Applications. Perceptron - Architecture, Algorithm,
Applications. Perceptron Learning Rule Convergence Theorem. Adaline - Architecture,
Algorithm, Applications.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module - 3 (Multilayer Perceptrons)

Multi-Layered network architecture, Back propagation Algorithm, Applications, XOR problem,
Replacing and Modifying Back propagation Algorithms Using Heuristics.
Cover’s Theorem on the Separability of patterns, The Interpolation Problem, Radial Basis
Function Networks, Comparison of MLP and RBF Networks( Theory only).
Module – 4 (SOMs and ART Networks)
Self-organizing maps - Building, Training, Evaluating, Interpreting and Visualizing a Self-
organizing Map. Applications of Self Organizing Maps.
Adaptive Resonance Theory -Stability Plasticity Dilemma, ART-1-Architeture, Algorithm,
Applications. ART-2 – Architeture, Algorithm, Applications.
Module – 5 (Training Algorithms for Pattern Association)
Introduction, Hetero associative neural network- Architecture, Applications. Auto Associative
Net -Architecture, Applications. Iterative Auto Associative Net – Architecture, Applications.
Discrete Hopfield Network. Bidirectional Auto-associative Memory – Architecture, Applications.

Text Books
1. Simon Haykin, “Neural Networks, A comprehensive Foundation”(2 nd edition), Pearson
Education (Module - 4)
2. Laurene Faucett, ”Fundamentals of Artificial Neural Networks, architecture algorithm and
applications”(Modules – 2,3,5)
3. Yegnanarayana, “Artificial Neural Networks”, Phi Learning (Module -1)
Reference Books
1. Christopher M Bishop,” Neural networks for Pattern Recognition
2. Mohammad H Hassoun, ”Fundamentals of Artificial Neural Networks”

Course Level Assessment Questions

Course Outcome1 (CO1):
1. What are the different types of competitive learning?
2. Demonstrate the significance of different Activation functions.
3. Explain the terms cell body, axon, synapse, dendrite and neuron with reference to abiological
neural network.
4. Illustrate examples of pattern recognition tasks to demonstrate the superiority of the biological
neural network over a conventional computer system. (Assignment Question)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 2 (CO2):

1. How is training adopted in Adaline network and state the characteristics of weighted
interconnections in Adaline .
2. How is the linear separability concept implemented using Perceptron Network training?
3. Implement NAND logical function using Perceptron Network in Python language(Assignment
Question)
Course Outcome 3(CO3):

1. Find the new weights of Back propagation net shown in the figure for the input pattern
(0,-1) and the target output 1, Use 0.25 as learning rate.
2. Why is gradient descent method adopted to minimize error? Explain in relation to Back
propagation of error phase of BPNN?
3. Implement RBF network using Python language. (Assignment Question)
Course Outcome 4(CO4): .
1. Design an ART1 used to cluster four vectors with low vigilance. The values and description of
the parameters are given in the table. Cluster the vectors, (1,1,0,0), (0,0,0,1), (1,0,0,0),
(0,0,1,1) in at most three clusters.
n=4 Number of components in the input vector
m=3 It was an excellent game.
Ρ=0.4 Vigilence parameter
L=2 Parameter used in update of bottom-up weights
bij(0)=1/n+1 Initial bottom-up weights
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

tij(0)=1 Initial top-down weights

2. Use NeuPy library of Python to implement Adaptive Resonance Theory (ART1) Network
for binary data clustering.
3. Implement Self Organizing Map in Python to demonstrate how does the grid
automatically arrange, using colour patterns and evaluate the effect of Learning Rate and Radius.
(Assignment Question)

Course Outcome 5(CO5):

1. Compare and contrast auto associative and hetero associative networks with examples.
2. Implement Bidirectional Associative Memory using Python without using specific libraries.
(Assignment Question)

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 352

Course Name: Artificial Neural Networks Techniques

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. What are the main differences among the three models of artificial neurons, namely, 3
McCulloch-Pitts, Perceptron and Adaline?
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Compare the stability and convergence of ANN 3

3. Design a Mc-Culloch Pitts neural network to implement AND function. 3

4. Define Perceptron Learning Rule Convergence theorem. 3

5. What is the significance of momentum factor in backpropagation learning? 3

6. Compare RBF network and Multilayer Perceptron network. 3

7. Illustrate the feature mapping models. 3

8. What is the significance of 'resonance' in ART network? 3

9. Explain the hebb rule for pattern association 3

10. Interpret cross talk and perfect recall using suitable examples 3

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Describe any four attractive features of the biological neural network that (8)
make it superior to the most sophisticated Artificial Intelligence computer
system for pattern recognition tasks.

(b) Compare LMS, Perceptron and Delta learning laws. (6)

OR

12. (a) Compare the performance of a computer and that of a biological neural (8)
network in terms of speed of processing, size and complexity, storage, fault
tolerance and control mechanism.

(b) What is reinforcement learning? In what way it is different from supervised (6)
learning?

13. (a) Explain Hebb net algorithm and implement logical AND function using (4)
bipolar inputs.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Use Adaline nerwork to train AND NOT function with bipolar inputs and (10)
targets. Perform one epoch of training.

OR

14. (a) Using the Perceptron Learning rule find the weights required to perform the (10)
following classifications. Vectors (1,1,1,1) and (-1,1,-1,-1) are members of
the class and hence target value 1; vectors (1,1,1,-1) and (1, -1, -1, 1 ) are not
the members of the class and hence target value -1. Use learning rate of 1 and
starting value of weights as 0, test the response of the net.

(b) XOR function is non·linearly separable by a single decision boundary line. (4)
Justify.

15. (a) Analyse Cover’s theorem based on XOR problem. (10)

(b) Explain the learning factors of of Back propagation network algorithm (4)

OR

16. (a) Relate Hidden layer and Output layer error terms with back propagation of (10)
error term phase in Back Propagation Network algorithm.

(b) Explain the architecture and algorithm of RBF network . (8)

17. (a) Explain the statistical properties exhibited by SOM after convergence. (10)

(b) Interpret stability-plasticity dilemma in relation with ART network. (4)

OR

18. (a) Show the architecture of Kohonen’s Self Organising Map and demonstrate (8)
the competitive process in Kohonen’s self organising Map.

(b) Explain the basic architecture of ART-2 and its algorithm. (6)

19. (a) Describe the architecture and algorithm of Discrete Bidirectional Associative (5)
Memory

(b) Use the Hebb rule to store the vetors (1,1,1,1)and (1,1,-1,-1) in an auto i.(9)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

associative neural net.

a. Fnd the weight matrix( Do not set the diagonal terms to zero)
b. Test the net, using the following vectors as input
i. (1,1,1,1)
ii. (1,1,-1,-1)
iii. (1,1,1,0)
Repeat parts a and b with diagonal weight matrix set to zero. Identify the
differences in the response.

OR

20. (a) Design a BAM net to associate the letters”A” and “C” given in bipolar 5X3 (10)
vectors to the bipolar codes (-1,1) and (1,1) respectively.

(b) Compare Iterative Autoassocative with Discrete Hopfield Net. (4)

TEACHING PLAN

No of
No Contents Lecture
Hrs: 35

Module -1 : Basics of Artificial Neural Network and Learning methods (7 hours)

Introduction to Neural Network, The human brain - Characteristics of

1.1 1
Neural Network.

Artificial Neural Network - Terminology, Models of a neuron,

1.2 1
Topology

1.3 Network architectures, Knowledge representation. 1

Learning Process, Learning tasks.Categories of learning- Hebbian
1.4 1
learning, Competitive learning.

1.5 Error-correction learning. 1

1.6 Reinforcement learning. 1

1.7 Stability and Convergence. 1

Module - 2 : Basic ANN Models( 7 hours)

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.1 McCulloch-Pitts Neuron - Architecture, Algorithm and Applications. 1

2.2 Biases and thresholds, Linear separability. 1

2.3 Hebb net - Algorithm , Applications 1

2.4 Perceptron -Architecture, Algorithm 1

Perceptron -Applications, Perceptron learning rule convergence

2.5 1
theorem.
Perceptron learning rule convergence theorem. Adaline -
2.6 1
Architecture, Algorithm
2.7 Adaline - Applications 1
Module 3 : Multilayer Perceptrons (7 hours)

3.1 Multilayered Feed Forward Network Architecture, 1

Back propagation algorithm, Activation functions, Rate of learning,

3.2 1
Stopping criteria
Applications, XOR problem, Heuristics for making the Back
3.3 1
propagation algorthm perform better.

3.4 Cover’s Theorem on the separability of patterns. 1

3.5 Cover’s Theorem on the separability of patterns, XOR problem. 1

3.6 The interpolation problem, Radial Basis Function networks. 1

The interpolation problem, Radial Basis function networks,

3.7 1
Comparison of RBF network and Multi-Layer perceptrons.
Module 4 : SOMs and ART networks (7 hours)

4.1 Two basic feature mapping methods. 1

Self Organizing Map, Competitive process, Cooperative process,

4.2 1
Adaptive process.

4.3 Properties of the feature map. 1

4.4 Stability Plasticity Dilemma, ART-1-Architeture. 1

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.5 ART-1 - Algorithm, Applications. 1

4.6 ART-2 - Architeture-Algorithm 1

4.7 ART-2 - Applications. 1

Module 5 : Training Algorithms for pattern Association (7 hours)

Introduction, Hebb rule for pattern association, Delta rule for pattern
5.1 1
association

5.2 Hetero Associative Neural Network-Architecture , Applications, 1

Auto-associative Net - Architecture, Algorithm, Applications,

5.3 1
Storage capacity.

5.4 Iterative Auto Associative Net - Architecture, Applications 1

5.5 Discrete Hopfield network - Architecture, Algorithm, Applications. 1

5.6 Bidirectional Auto-associative Memory-Architecture, Algorithm. 1

5.7 Bidirectional Auto-associative Memory – Applications. 1

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
PROGRAMMING CATEGORY LT P CREDIT INTRODUCTION
AIT 362
IN R
PEC 2 1 0 3 2019

Preamble:
The objective of this course is to enable the learner to make use of R Programming
language to perform analysis and extraction of information from data irrespective of the
quantity. It encompasses the R programming environment, syntax, data representations,
data processing, statistical analysis and visualization. This course facilitates the learner
to develop modular software solutions to perform statistical analysis and data extraction.

Prerequisite: Fundamental concepts in programming in C and Probability and

Statistical Modeling

Course Outcomes: After the completion of the course the student will be able to:

Illustrate uses of conditional and iterative statements in R programs.

CO 1 (Cognitive Knowledge level: Apply)
Write, test and debug R programs (Cognitive Knowledge level:
CO 2 Apply)

Illustrate the use of Probability distributions and basic statistical functions.

CO 3
(Cognitive Knowledge level: Apply)
Visualize different types of data (Cognitive Knowledge level: Apply)
CO 4
Comprehend regression modeling using R (Cognitive Knowledge level:
CO 5 Understand)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of

Accreditation
PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

End
Bloom’s Category Test1 Test2
Semester
(percentage) (percentage) Examination
Marks
Remember 20 20 20
Understand 40 40 40
Apply 40 40 40
Analyze

Evaluate

Create

Mark distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance: 10 marks

Continuous Assessment Tests : 25 marks

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Assessment Assignment: 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half
of the syllabus and the Second Internal Examination shall be preferably conducted after
completing the remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered
module), having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly covered
module), each with 7 marks. Out of the 7 questions in Part B, a student should answer
any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students should answer
all questions. Part B contains 2 questions from each module of which a student should
answer any one. Each question can have a maximum of 2 subdivisions and carries 14
marks.

Syllabus
Module -1 (Introduction to R)
The R Environment - Command Line Interface and Batch processing, R Packages,
Variables, Data Types, Vectors- vector operations and factor vectors, List- operations,
Data Frames, Matrices and arrays, Control Statements- Branching and looping - For
loops, While loops, Controlling loops. Functions- Function as arguments, Named
arguments
Module -2(Reading and writing data)
Importing data from Text files and other software, Exporting data, importing data from
databases- Database Connection packages, Missing Data - NA, NULL
Combining data sets, Transformations, Binning Data, Subsets, summarizing functions.
Data Cleaning, Finding and removing Duplicates, Sorting.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module -3 (Statistics with R)

Analyzing Data, Summary statistics, Statistical Tests- Continuous Data, Discrete Data,
Power tests, Common distributions- type arguments. Probability distributions, Normal
distributions
Module -4(Data Visualization)
R Graphics- Overview, Customizing Charts, Graphical parameters, Basic Graphics
functions, Lattice Graphics - Lattice functions, Customizing Lattice Graphics, Ggplot.
Module - 5 (Regression Models)
Building linear models - model fitting, Predict values using models, Analyzing the fit,
Refining the model, Regression- types, Unusual observation and corrective measures,
Comparison of models, Generalized linear models - Logistic Regression, Poisson
Regression, Nonlinear least squares

Text Book
1. Joseph Adler, ” R in a Nutshell”, Second edition,O’reilly,2012
Reference Books
1. Jared P Lander, R for Everyone- Advanced analytics and graphics, Addison
Wesley data analytics series, Pearson
2. Norman matloff, The art of R programming, A Tour of Statistical, Software
Design, O’reilly
3. Robert Kabacoff, R in action, Data analysis and graphics with R, Manning
4. Garret Grolemund, Hands-on programming with R, Write your own functions and
simulations, O’reilly

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What is Coercion? How is it done in R?
2. Write a program to find the factorial of a number.
3. Write a program to compute roots of a quadratic equation.
Course Outcome 2 (CO2):
1. Write a program to read data from a table ‘table123’ in a database named
‘db123’ and display the values .
2. Explain Data cleaning in R
3. How missing data is handled in R?
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 3(CO3):

1. Explain summary function in R
2. Illustrate how statistical testing is performed in R
3. Describe about probability distributions.
Course Outcome 4 (CO4):
1. Illustrate the use of ggplot() and various data visualization tools using
appropriate datasets
Course Outcome 5 (CO5):
1. Illustrate the steps to predict the weight of a person when his height is
unknown using linear regression for the data given below.

Height 151 174 138 186 128 136 179 163 152 130

Weight 63 81 56 91 47 57 76 72 62 48

Model Question paper

QP CODE: PAGES:3

Reg No:
Name :

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 362

Course Name: Programming in R

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Write a R program to add element “23” to the vector (24,56,67) in the second position.
2. Discuss the general list operations in R with example.
3. Calculate the cumulative sum and cumulative product for the given data 23, 1,
7,2,8,10, 17 using R Program.
4. Explain aggregate function in R.
5. List the applications of R programming.
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

6. Illustrate summary function.

7. List any three graphics functions.
8. Explain Lattice function.
9. Suppose that you have a dataset D1 and you design a linear regression model of
degree 3 polynomial and you found that the training and testing error is “0” or in
other terms it perfectly fits the data. What will happen when you fit a degree 2
polynomial in linear regression?
10. Explain logistic regression function in R.
(10x3=30)

Part B
Answer any one Question from each module. Each question carries 14
Marks

11.a Write a R program to extract every nth element from a vector. (7 marks)
11.b Find the Nth highest value of a vector in R. (7 marks)
OR
12.a Write a R program to create a data frame using two given vectors and display(7 marks)
the duplicate elements and unique rows of the said data frame.
12.b Write a R program to compare two data frames to find the row(s) in the first(7 marks)
data frame that are not present in the second data frame.

13.a Write a R program to call the (built-in) dataset air quality. Remove the (7 marks)
variables 'Solar.R' and 'Wind' and display the data frame.
13.b Illustrate transformation functions in R. (7 marks)
OR
14.a Write a R program to write the following data to a CSV file. (7 marks)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

14.b Given a file “auto.csv” of automobile data with the fields index, company, (7 marks)
body-style, wheel-base, length, engine-type, num-of-cylinders, horsepower,
average-mileage, and price, write R program to print total cars of all
companies, Find the average mileage of all companies.

15.a Write a note on data analysis using R. (7 marks)

15.b Explain how statistical test are performed using R functions. (7 marks)
OR
16.a Write R code to generate the probability distribution table for number of(7 marks)
successes from a binomial distribution where n=5 and probability of success
in each trial is 0.25.
16.b Fit a Poisson distribution with the following data using the following data (7 marks)

OR

17 Given the sales information of a company as CSV file with the following,
fields month_number, face cream, facewash, toothpaste, bathingsoap,
shampoo, moisturizer, total_units, total_profit. Write R codes to visualize the
data as follows:
a) Toothpaste sales data of each month and show it using a scatter plot. (7 marks)
b) Calculate total sale data for last year for each product and show it using a (7 marks)
Pie chart.
OR
18.a Explain ggplot() with and example. (7 marks)
18.b Describe how categorical data is visualized using R. (7 marks)

19.a Illustrate model fitting in simple linear model. (7 marks)

19.b Explain different types of regression. (7 marks)
OR
20.a Describe the unusual observations in the regression model. (7 marks)
20.b Explain corrective measures of unusual observations in regression modelling. (7 marks)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No of
No Contents Lecture
Hours
(35 Hours)
Module -1 ( Introduction to R) (8 hours)
1.1 The R Environment- Command Line Interface and Batch processing, R
1 hour
Packages
1.2 Variables, Data Types 1 hour
1.3 Vectors- vector operations and factor vectors 1 hour
1.4 List- List operations, Data Frames 1 hour
1.5 Matrices and arrays 1 hour
1.6 Control Statements- If and else, switch, if else 1 hour
1.7 Loops- For loops, While loops, Controlling loops 1 hour
1.8 Functions- Function as arguments, Named arguments 1 hour
Module -2(Reading and writing data) (8 hours)
2.1 Importing data from Text files and other software, Exporting data 1 hour
2.2 Importing data from databases- Database Connection packages 1 hour
2.3 Missing Data-NA, NULL 1 hour
2.4 Combining data sets, Transformations 1 hour
2.5 Binning Data, Subsets, summarizing functions 1 hour
2.6 Data Cleaning 1 hour
2.7 Finding and removing Duplicate 1 hour
2.8 Sorting 1 hour
Module -3 (Statistics with R) (6 hours)
3.1 Analyzing Data 1 hour
3.2 Summary statistics 1 hour
3.3 Statistical Tests- Continuous Data, Discrete Data, Power tests 1 hour
3.4 Common distributions- type arguments 1 hour
3.5 Probability distributions 1 hour
3.6 Normal distributions 1 hour
Module -4(Data Visualization) (6 hours)
4.1 R Graphics- Overview 1 hour
4.2 Customizing Charts 1 hour
4.3 Graphical parameters, Basic Graphics functions 1 hour
4.4 Lattice Graphics - Lattice functions 1 hour
4.5 Customizing Lattice Graphics 1 hour
4.6 ggplot 1 hour
Module - 5 (Regression Models) (7 hours)
5.1 Building linear models - model fitting 1 hour
5.2 Predict values using models, Analyzing the fit, Refining the model 1 hour
5.3 Regression- types of regression 1 hour
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.4 Unusual observations and corrective measures 1 hour

5.5 Comparison of models 1 hour
5.6 Generalized linear models -Logistic Regression, Poisson Regression 1 hour
5.7 Nonlinear least squares 1 hour
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMT372 Machine Learning Category L T P Credit Year of

Models and Storage Introduction
Management
PEC 2 1 0 3 2020

Preamble:
This course enables the learners to understand the basic machine learning models and
different storage concepts. The course covers the standard and most popular supervised
learning algorithms, storage technology, storage architecture, network storage system and
securing and managing storage infrastructures. This course helps the students to choose
the appropriate storage infrastructure for typical real world applications.

Prerequisite: Nil

Mapping of course outcomes with program outcomes

CO1 Illustrate the concepts of machine learning techniques and models(Cognitive

Knowledge Level: Apply)

CO2 Demonstrate various storage management technologies (Cognitive Knowledge Level:

Apply)

CO3 Explain Storage Systems Architecture and interaction of file systems (Cognitive
Knowledge Level: Understand)

CO4 Explain the different Network storage protocols (Cognitive Knowledge Level:
Understand)

CO5 Illustrate the concepts of management metric and standards(Cognitive Knowledge

Level: Understand)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester
Category Examination
Test 1 (%) Test 2 (%) Marks (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. First series
test shall be preferably conducted after completing the first half of the syllabus and the
second series test shall be preferably conducted after completing remaining part of the
syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions
(preferably, 2 questions each from the completed modules and 1 question from the partly
completed module), having 3 marks for each question adding up to 15 marks for part A.
Students should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student should answer
any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions
from each module, having 3 marks for each question. Students should answer all
questions. Part B contains 2 full questions from each module of which student should
answer any one. Each question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module – 1 (MACHINE LEARNING MODELS)

Introduction to Machine Learning, Examples of Machine Learning applications, Linear
Regression: single & multiple variables, Classification: Logistic Regression - Decision
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Trees, Overfitting & Underfitting, Bias -Variance trade-off, Support Vector Machines,
Canonical Cases for Conditional Independence-Naive Bayes’ Classifier.
Module - 2(STORAGE TECHNOLOGY)
Information Storage-Data, Bigdata, Information, evolution of storage Architecture. Data
Centre Infrastructure-Core elements, characteristics, Virtualization and Cloud
Computing, Disk drive components, Physical disk structure, Zone Bit recording, Logical
block addressing, Disk drive Performance, Direct Attached Storage, Storage design
based on application requirements disk performance

Module- 3(STORAGE SYSTEM ARCHITECTURE)

RAID, Implementation methods, RAID -Techniques-Striping, Mirroring, Parity. RAID
Levels, RAID impact on disk performance. Components of an Intelligent Storage
System-Front end, Cache, Back end, Storage provisioning-traditional vs virtual. Types of
Intelligent storage systems
Backup and Archive- Backup Purpose, Backup Granularity, Backup methods , Backup
architectures, Backup topologies
Module - 4 (NETWORK STORAGE SYSTEM)
Fibre Channel Storage Area Networks- SAN and Its Evolution, Components of FC SAN,
Fibre Channel Architecture, Fibre Channel Protocol Stack, FC SAN Topologies,
Virtualization in SAN, IP SAN and FCoE- iSCSI- Components, FCIP Protocol Stack,
Topology, FCoE.

Network-Attached Storage- Benefits of NAS, File Systems and Network File Sharing,
Components of NAS, NAS Implementations-Unified NAS, Unified NAS Connectivity,
Gateway NAS, Connectivity, NAS File-Sharing Protocols.

Module - 5 (SECURING AND MANAGING STORAGE INFRACTURES)

Information Security Framework, Risk Triad, Storage Security Domains- Securing the
Application Access Domain, Securing the Management Access Domain, Securing
Backup, Replication, and Archive. Security Implementations in Storage Networking-FC
SAN, NAS, IP SAN, Monitoring the Storage Infrastructure, Storage Infrastructure
Management Activities, Storage Infrastructure Management Challenges, Information
Lifecycle Management, Storage Tiering.

Text Books
1. Introduction to machine learning, Second Edition, EthemAlpayd The MIT Press
Cambridge, Massachusetts London, England
2. Information Storage and Management: Storing, Managing, and Protecting Digital
Information in Classic, Virtualized, and Cloud Environments, Somasundaram,
Gnanasundaram, Alok Shrivastava Editor: EMC Education Services, Wiley, 2012 .
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ReferenceBooks
1. Information Storage and Management: Storing, Managing, and Protecting Digital
Information, Antonio Cantiago, Wiley, 2009
2. Storage Area Network Essentials: A Complete Guide To Understanding And
Implementing Sans, Richard Barker, Paul Massiglia, 2008
3. Storage Networks Explained: Basics and Application of Fibre Channel SAN,
NAS, ISCSI, InfiniBand and FCoE, Ulf Troppens and Rainer Erkens, Wiley, 2009

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare different machine learning paradigms with suitable examples.
2. Distinguish between overfitting and underfitting. How it can affect model
generalization?
Course Outcome 2 (CO2):
1. What is structured and unstructured data? Research the challenges of storing and
managing unstructured data.
2. Discuss the benefits of information-centric storage
architecture over server-centric storage architecture.
Course Outcome 3 (CO3):
1. What is zoning? Discuss a scenario: a. Where WWN zoning is preferred over
port zoning.
b. Where port zoning is preferred over WWN zoning.
2. Describe the process of assigning an FC address to a node when logging on to
the network for the first time.
3. Seventeen switches, with 16 ports each, are connected in a full mesh topology.
How many ports are available for host and storage connectivity?
Course Outcome 1 (CO4):
1. SAN is configured for a backup–to-disk environment, and the storage
configuration has additional capacity available. Can you have a NAS gateway
configuration use this SAN-attached storage? Discuss the implications ofsharing
the backup-to-disk SAN environment with NAS.
2. Compared to a standard IP packet, what percentage of reduction can be realized
in protocol overhead in an iSCSI, configured to use jumbo frames with an MTU
value of 9,000 bytes?
Course Outcome 5 (CO5):
1. Describe Storage Management strategies for any two real world application
scenarios (Storage Allocation to a New Server/Host, File System Space
Management)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT372

Course Name: Machine Learning Models and Storage Management

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Explain the significance of Naive assumption in Bayesian classifier 3

2. Compare Classification with regression with an example 3

3. What are the advantages of a virtualized data center over a classic data center? 3

4. Which components constitute the disk service time? Which component contributes 3
the largest percentage of the disk service time in a random I/O operation?

5. What is meant by intelligent storage system. 3

6. Why is RAID 1 not a substitute for a backup? 3

7. Compare the topologies of FC-SAN, NAS, IP-SAN. 3

8. What are the Factors affecting NAS performance. 3

9. List the different security goals. 3

10. How does the use of jumbo frames affect the NAS performance? 3
(10x3=30)
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) For the following set of training samples, find which attribute can be chosen as (8)
the root for decision tree classification

(b) Explain the working principles of SVM classifiers. (6)

OR

12. (a) What is overfitting? Explain Bias -Variance trade off. (7)

(b) Use the following data to construct a linear regression model for the auto (7)
insurance premium as a function of number of years the vehicle used.
Years 1 3 5 8 10 12
used
Insurance 9000 7000 6000 5000 4000 3000
Premium

13. (a) The average I/O size of an application is 64 KB. The following specifications are (7)
available from the disk manufacturer: average seek time = 5 ms, 7,200 RPM, and
transfer rate = 40 MB/s. Determine the maximum IOPS that could be performed
with this disk for the application. Using this case as an example, explain the
relationship between disk utilization and IOPS

(b) Illustrate any three Disk Drive Components. (7)

OR

14. (a) Define the following terms (8)

(i)Disk Service Time
(ii)Seek Time
(iii)Rotational Latency
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(iv)Data Transfer Rate

(b) List the benefits and limitations of Direct Attached Storage (6)

15. (a) Explain the terms :Striping, Mirroring, Parity (6)

(b) Describe the Components of an Intelligent Storage System (8)

OR

16. (a) Explain the process of data recovery in case of a drive failure in RAID 5. What (7)
are the benefits of using RAID 3 in a backup application?

(b) Explain the Array caching properties and algorithms. (7)

17. (a) Illustrate the NAS File-Sharing Protocols. (10)

(b) Explain Fibre Channel Architecture and Protocol Stack. (4)

OR

18. (a) Describe the Benefits of CAS? (8)

(b) Explain the Components of IP-SAN? (6)

19. (a) Explain how security is provided in application access domain and management (10)
access domain.

(b) List out the challenges in storage Infrastructure management (4)

OR

20. (a) Describe the secure user access in NAS environment (6)

(b) Discuss different aspects of monitoring the storage infrastructure (8)

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
Lecture
No Contents Hours
(37hrs)
Module – 1 (FUNDAMENTALS) (7 hours)

Introduction to Machine Learning, Examples of Machine Learning

1.1 1 hour
applications

1.2 Linear Regression: single & multiple variables, 1 hour

1.3 Classification: Logistic Regression 1 hour

1.4 Decision Trees 1 hour
1.5 Overfitting & Underfitting, Bias Variance Trade-off 1 hour
1.6 Support Vector Machines 1 hour

1.7 Canonical Cases for Conditional Independence-Naive Bayes’ Classifier. 1 hour

Module - 2(STORAGE TECHNOLOGY) (5 hours)

Information Storage-Data, Bigdata, Information, evolution of storage
2.1 1 hour
Architecture
Data Centre Infrastructure-Core elements, characteristics, Virtualization and
2.2 1 hour
Cloud Computing
Disk drive components, Physical disk structure, Zone Bit recording, Logical
2.3 1 hour
block addressing

2.4 Disk drive Performance, Direct Attached Storage 1 hour

2.5 Storage design based on application requirements disk performance 1 hour

Module - 3 (STORAGE SYSTEM ARCHITECTURE) (8 hours)

3.1 RAID, Implementation methods, RAID -Techniques-Striping, Mirroring,

Parity.
3.2 RAID Levels, RAID impact on disk performance
3.3 Components of an Intelligent Storage System-Front end, Cache, Back end,

3.4 Storage provisioning-traditional vs virtual.

3.5 Types of Intelligent storage systems
3.6 Backup and Archive- Backup Purpose
 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.7 Backup Granularity, Backup methods, Backup architectures

3.8 Backup topologies
Module - 4 (NETWORK STORAGE SYSTEM) (10 hours)
Fibre Channel Storage Area Networks- SAN and Its Evolution, Components
4.1 of FC SAN 1 hour

4.2 Fibre Channel Architecture, Fibre Channel Protocol Stack 1 hour

4.3 Zoning 1 hour
4.4 FC SAN Topologies, Virtualization in SAN 1 hour
4.5 IP SAN- FCoE and iSCSI, Components, topologies 1 hour
4.6 iSCSI Protocol stack 1 hour
4.7 FCoE, Components of FCoE 1 hour
Network-Attached Storage- Benefits of NAS, File Systems and Network File
4.8
Sharing,
Components of NAS, NAS Implementations-Unified NAS, Unified NAS
4.9
Connectivity, Gateway NAS, Connectivity,

4.10 NAS File-Sharing Protocols

Module - 5 (MANAGING AND MONITORING) (7 hours)

5.1 Managing & Monitoring: Management philosophies 1 hour
5.2 Industry management standards (SNMP, SMI-S, CIM) 1 hour
Standard framework applications, Key management metrics (thresholds,
5.3 1 hour
availability, capacity, security, performance)
Standard framework applications, Key management metrics (thresholds,
5.4 1 hour
availability, capacity, security, performance)
5.5 Provisioning & configuration change planning 1 hour
5.6 Problem reporting 1 hour
5.7 prioritization and handling techniques, Management tools overview 1 hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Category L T P Credit Year of

AMT COMPREHENSIVE Introduction
308 COURSE WORK PCC 1 0 0 1 2019

Preamble:
The objective of this Course work is to ensure the comprehensive knowledge of each student in
the most fundamental core courses in the curriculum. Five core courses credited from
semesters 3, 4 and 5 are chosen for the detailed study in this course work. This course helps
the learner to become competent in cracking GATE, placement tests and other competitive
examinations
Prerequisite:
1. Data Structures
2. Operating Systems
3. Introduction to Machine Learning
4. Database Management Systems
5. Introduction to Artificial Intelligence

Course Outcomes: After the completion of the course the student will be able to

CO1: Comprehend the concepts and applications of data structures (Cognitive Knowledge
Level: Understand)
CO2 : Comprehend the concepts, functions and algorithms in operating system (Cognitive
Knowledge Level: Understand))
CO3: Comprehend the concepts of machine learning (Cognitive Knowledge Level:
Understand)

CO4: Comprehend the fundamental principles of database design and manipulation

(Cognitive Knowledge Level: Understand)
CO5: Comprehend the concepts of artificial intelligence (Cognitive Knowledge Level:
Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Assessment Pattern

Bloom’s Category End Semester Examination

Remember 10
Understand 20
Apply 20
Analyse

Evaluate
Create

Mark distribution

Total Marks CIE ESE ESE Duration

50 0 50 1 hour

End Semester Examination Pattern: Objective Questions with multiple choice, a maximum of four
options. Question paper include fifty questions of one mark each, distributed equally from all the five
identified courses.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Full Syllabus of all five selected Courses.
1. Data Structures
2. Operating Systems
3. Introduction to Machine Learning
4. Database Management Systems
5. Introduction to Artificial Intelligence

Course Contents and Lecture Schedule

No Topic No. of
Lectures

1 DATA STRUCTURES

1.1 Mock Test on Module 1, Module 2 and Module 3 1 hour

1.2 Mock Test on Module 4 and Module 5 1 hour

1.3 Feedback and Remedial class

2 OPERATING SYSTEMS

2.1 Mock Test on Module 1 and Module 2 1 hour

2.2 Mock Test on Module 3, Module 4 and Module 5 1 hour

2.3 Feedback and Remedial class 1 hour

3 INTRODUCTION TO MACHINE LEARNING

3.1 Mock Test on Module 1, Module 2 and Module 3 1 hour

3.2 Mock Test on Module 4 and Module 5 1 hour

4 DATABASE MANAGEMENT SYSTEMS

4.1 Mock Test on Module 1, Module 2 and Module 3 1 hour

4.2 Mock Test on Module 4 and Module 5 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.3 Feedback and Remedial class

5 INTRODUCTION TO ARTIFICIAL INTELLIGENCE

5.1 Mock Test on Module 1, Module 2 and Module 3 1 hour

5.2 Mock Test on Module 4 and Module 5 1 hour

5.3 Feedback and Remedial class 1 hour

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 9

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: AMT 308
Course Name: Comprehensive Course Work
Max. Marks: 50 Duration: 1 Hour
Objective type questions with multiple choices. Mark one correct answer for each question.
Each Question Carries 1 Mark

1. Consider the following sequence of operations on an empty stack.

push(22); push(43); pop(); push(55); push(12); s=pop();
Consider the following sequence of operations on an empty queue.
enqueue(32);enqueue(27); dequeue(); enqueue(38); enqueue(12); q=dequeue();
The value of s+q is ___________
(A) 44 (B) 54 (C) 39 (D) 70

2. A B-tree of order (degree)5 and of height 3 will have a minimum of ___ keys.
A. 624
B. 249
C. 124
D. 250

3. Construct a binary search tree by inserting 8, 6, 12, 3, 10, 9 one after another. To make the
resulting tree as AVL tree which of the following is required?
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(A) One right rotation only

(B) One left rotation followed by two right rotations
(C) One left rotation and one right rotation
(D) The resulting tree itself is AVL

4. In a complete 4-ary tree, every internal node has exactly 4 children or no child. The number
of leaves in such a tree with 6 internal nodes is:
(A) 20 (B) 18 (C) 19 (D) 17

5. Select the postfix expression for the infix expression a+b-c+d*(e/f).

(A) ab+c-d+e*f/ (B) ab+c-def/*+
(C) abc-+def/*+ (D) ab+c-def/*+

6. Consider a hash table of size seven, with

starting index zero, and a hash function (2x + 5)mod7. Assuming the hash table is initially
empty, which of the following is the contents of the table when the sequence 1, 4, 9, 6 is
inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the
table.
(A) 9, _, 1, 6, _, _, 4 (B) 1, _, 6, 9, _, _, 4
(C) 4, _, 9, 6, _, _, 1 (D) 1, _, 9, 6, _, _, 4

7. Compute the time complexity of the following function:

void function(int n)
{
int count = 0;
for (int i=n/2; i<=n; i++)
for (int j=1; j<=n; j = j + 2)
for (int k=1; k<=n; k = k * 2)
count++;
}
A. O(n2 logn)
B. O(n log2n)
C. O(n3)
D. O(n logn2)

8. How many distinct binary search trees can be created out of 6 distinct keys?
(A) 7 (B) 36 (C) 140 (D) 132

9. Which tree traversal performed on a binary search tree, results in ascending order listing of
the keys?
A. Pre-order
B. In-order
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

C. Post-order
D. Level-order

10. You are given pointers to first and last nodes of a singly linked list, which of the following
operations are dependent on the length of the linked list?
(A) Delete the first element
(B) Insert a new element as a first element
(C) Add a new element at the end of the list
(D) Delete the last element of the list

11. Suppose a disk has 400 cylinders, numbered from 0 to 399. At some time the disk arm is at
cylinder 58, and there is a queue of disk access requests for cylinder 66, 349, 201, 110, 38,
84, 226, 70, 86. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk
access, the request for cylinder 86 is serviced after servicing ____________ number of
requests.
(A) 1 (B) 2 (C)3 (D)4

12. If frame size is 4KB then a paging

system with page table entry of 2 bytes can address _______ bytes of physical memory.
(A) 2^12 (B) 2^16 (C) 2^18 (D) 2^28

13. Calculate the internal fragmentation if

page size is 4KB and process size is 103KB.
(A) 3KB (B) 4KB (C) 1KB (D) 2KB

14. Which of the following scheduling policy is likely to improve interactiveness?

(A) FCFS (B) Round Robin
(C) Shortest Process Next (D) Priority Based Scgeduling

15. Consider the following program

Semaphore X=1, Y=0
Void A ( ) Void B ( )
{ {
While (1) While (1)
{ {
P(X); P(Y);
Print’1’; P(X);
V(Y); Print’0’;
} V(X);
} }
}
The possible output of the program:
(A) Any number of 0’s followed by any number of 1’s.
(B) Any number of 1’s followed by any number of 0’s.
(C) 0 followed by deadlock
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(D) 1 followed by deadlock

16. In a system using single processor, a new process arrives at the rate of 12 processes per
minute and each such process requires 5 seconds of service time. What is the percentage of
CPU utilization?
(A) 41.66 (B) 100.00 (C) 240.00 (D) 60.00

17. A system has two processes and three identical resources. Each process needs two resources
to proceed. Then
(A) Deadlock is possible (B) Deadlock is not possible
(C) Starvation may be present (D) Thrashing

18. Which of the following is true with regard to Round Robin scheduling technique?
(A) Responds poorly to short process with small time quantum.
(B) Works like SJF for larger time quantum
(C) Does not use a prior knowledge of burst times of processes.
(D) Ensure that the ready queue is always of the same size.

19. Thrashing can be avoided if

(A) the pages, belonging to working set of programs, are in main memory
(B) the speed of CPU is increased
(C) the speed of I/O processor is increased
(D) none of the above

20. The circular wait condition can be prevented by

(A) using thread
(B) defining a linear ordering of resource types
(C) using pipes
(D) all of the above

21. Application of machine learning methods to large databases is called

(A) Data Mining (B) Artificial Intelligence

(C) Big Data Computing (D) Internet of Things
22. If machine learning model output involves target variable, then that model is called as

(A) Descriptive Model (B) Predictive Model

(C) Reinforcement Learning (D) All of the above
23. In what type of learning labelled training data is used

(A) Unsupervised Learning (B) Supervised Learning

(C) Reinforcement Learning (D) Active Learning
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

24. In following type of feature selection method we start with empty feature set

(A) Forward Feature Selection (B) Backward Feature Selection

(C) Both A and B (D) None of the above
25. Which of the following is the best machine learning method?

(A) Scalable (B) Accuracy

(C) Fast (D) All of the above
26. Data used to build a data mining model.

(A) Training data (B) Validation data

(C) Test data (D) Hidden data
27. You are given reviews of few netflix series marked as positive, negative and neutral.
Classifying reviews of a new netflix series is an example of

(A) Supervised learning (B) Unsupervised learning

(C) Semisupervised learning (D) Reinforcement learning
28. Following are the types of supervised learning

(A) Classification (B) Regression

(C) subgroup discovery (D) all of the above
29. The output of training process in machine learning is

(A) machine learning model (B) machine learning algorithm

(C) null (D) accuracy
30. PCA is

(A) forward feature selection (B) backward feature selection

(C) feature extraction (D) all of the above
31. Let E1, E2 and E3 be three entities in an E/R diagram with simple single-valued attributes. R1
and R2 are two relationships between E1 and E2, where R1 is one-to-many, R2 is many-to-
many. R3 is another relationship between E2 and E3 which is many-to-many. R1, R2 and R3
do not have any attributes of their own. What is the minimum number of tables required to
represent this situation in the relational model?
(A) 3 (B) 4 (C) 5 (D) 6
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

32. Identify the minimal key for relational scheme R(U, V, W, X, Y, Z) with functional
dependencies F = {U → V, V → W, W → X, VX → Z}
(A) UV (B) UW (C) UX (D) UY

33. It is given that: “Every student need to register one course and each course registered by many
students”, what is the cardinality of the relation say “Register” from the “Student” entity to the
“Course” entity in the ER diagram to implement the given requirement.
(A) M:1 relationship (B) M:N relationship
(C) 1:1 relationship (D) option (B) or(C)

34. Consider the relation branch( branch_name, assets, branch_city)

SELECT DISTINCT T.branch_name FROM branch T, branch S WHERE T.assets > L.assets
AND S.branch_city = "TVM" .
Finds the names of
(A) All branches that have greater assets than all branches located in TVM.
(B) All branches that have greater assets than some branch located in TVM.
(C) The branch that has the greatest asset in TVM.
(D) Any branch that has greater asset than any branch located in TVM.

35. Consider the following relation instance, where “A” is primary Key.
A1 A2 A3 A4
1 1 1 Null
5 2 5 1
9 5 13 5
13 13 9 15
Which one of the following can be a foreign key that refers to the same relation?
(A) A2 (B) A3 (C) A4 (D) ALL

36. A relation R(ABC) is having the tuples(1,2,1),(1,2,2),(1,3,1) and (2,3,2). Which of the
following functional dependencies holds well?
(A) A → BC (B) AC → B (C) AB → C (D) BC → A

37. Consider a relation R with attributes A, B, C, D and E and functional dependencies A→BC,
BC→E, E→DA. What is the highest normal form that the relation satisfies?
(A) BCNF (B) 3 NF (C) 2 NF (D) 1 NF

38. For the given schedule S, find out the conflict equivalent schedule.
S : r1(x); r2(Z) ; r3(X); r1(Z); r2(Y); r3(Y);W1(X); W2(Z); W3(Y); W2(Y)
(A) T1→T2→T3 (B) T2->T1->T3
(C) T3→T1→T2 (D) Not conflict serializable
39. Specialization is __________ process.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(A) top-down (B) bottom up

(C) Both (A) and (B) (D) none of these

40. If D1, D2, .., Dn are domains in a relational model, then the relation is a table, which is a
subset of
(A) D1+D2+ … +Dn (B) D1×D2× … ×Dn
(C) D1∪D2∪ … ∪Dn (D) D1–D2– … –Dn
41. Artificial Intelligence is about_____.
(A)Playing a game on Computer
(B)Making a machine Intelligent
(C)Programming on Machine with your Own Intelligence
(D)Putting your intelligence in Machine

42. Select the most appropriate situation for that a blind search can be used.
(A)Real-life situation
(B)Small Search Space
(C)Complex game
(D)All of the above

43. The application/applications of Artificial Intelligence is/are

(A)Expert Systems
(B)Gaming
(C)Vision Systems
(D)All of the above

44. Among the given options, which search algorithm requires less memory?
(A)Optimal Search
(B)Depth First Search
(C)Breadth-First Search
(D)Linear Search

45. The component of an Expert system is_________.

(A)Knowledge Base
(B)Inference Engine
(C)User Interface
(D)All of the above

46. Which algorithm is used in the Game tree to make decisions of Win/Lose?
(A)Heuristic Search Algorithm
(B)DFS/BFS algorithm
(C)Greedy Search Algorithm
(D)Min/Max algorithm
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

47. Among the given options, which is not the required property of Knowledge representation?
(A)Inferential Efficiency
(B)Inferential Adequacy
(C)Representational Verification
(D)Representational Adequacy

48. Which of the given language is not commonly used for AI?
(A)LISP
(B)PROLOG
(C)Python
(D)Perl

49. A technique that was developed to determine whether a machine could or could not
demonstrate
the artificial intelligence known as the___
(A)Boolean Algebra
(B)Turing Test
(C)Logarithm
(D)Algorithm

50. The available ways to solve a problem of state-space-search.

(A)1 (B)2 (C)3 (D)4

QNo Ans. Key QNo Ans. Key QNo Ans. Key QNo Ans. Key QNo Ans. Key
1 (C) 11 (C) 21 (A) 31 (C) 41 (B)
2 (B) 12 (D) 22 (B) 32 (D) 42 (B)
3 (A) 13 (C) 23 (B) 33 (A) 43 (D)
4 (C) 14 (B) 24 (A) 34 (B) 44 (B)
5 (D) 15 (D) 25 (D) 35 (B) 45 (D)
6 (D) 16 (B) 26 (A) 36 (D) 46 (D)
7 (A) 17 (B) 27 (A) 37 (A) 47 (C)
8 (D) 18 (C) 28 (D) 38 (D) 48 (D)
9 (B) 19 (A) 29 (A) 39 (A) 49 (B)
10 (D) 20 (B) 30 (C) 40 (B) 50 (B)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AML332 Natural CATEGORY L T P Credit

Language
Processing Lab
LAB 0 0 3 2

Preamble: The course should enable the students to provide theoretical concepts of language
processing that shows how to explore interesting bodies of text. It helps to familiarize with
fundamental topics in language processing that include tagging, classification and information
extraction using Python programs. It covers the understanding of formal grammar to describe the
structure of an unlimited set of sentences and also designing of existing corpora, the typical
workflow for creating a corpus and the life cycle of a corpus
Prerequisite: Sound knowledge in Python programming.

Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

CO1 Apply the concept of natural language processing (NLP) using Natural Language
Toolkit (NLTK).(Cognitive Knowledge Level: Apply)

CO2 Build text corpora with tokenization, Stemming, Lemmatization and apply
visualization techniques.(Cognitive Knowledge Level: Apply)

CO3 Evaluate the classifiers and choose the best classifier. (Cognitive Knowledge
Level: Apply)

CO4 Create Artificial Intelligence applications for text data. (Cognitive Knowledge
Level: Apply)

Program Outcomes ( PO)

Mapping of course outcomes with program outcomes

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO PO PO PO PO5 PO PO PO PO PO PO PO
1 2 3 4 6 7 8 9 10 11 12

CO1

CO2

CO3

CO4

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

PO4 Conduct investigations of complex PO10 Communication

problems

PO5 Modern tool usage PO11 Project Management and

Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Assessment Test End Semester

Bloom’s Category (Internal Exam) Marks in Examination
percentage Marks in percentage

Remember 20 20

Understand 20 20

Apply 60 60

Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE ESE Marks ESE Duration

Marks

150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks

Continuous Evaluation in Lab : 30 marks

Continuous Assessment Test : 15 marks

Viva voce : 15 marks

Internal Examination Pattern:

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

The marks will be distributed as Algorithm 30 marks, Program 20 marks, Output 20 marks
and Viva 30 marks. Total 100 marks which will be converted out of 15 while calculating
Internal Evaluation marks.

End Semester Examination Pattern:

The marks will be distributed as Algorithm 30 marks, Program 20 marks, Output 20 marks
and Viva 30 marks. Total 100 marks will be converted out of 75 for End Semester
Examination.

Operating System to Use in Lab : Linux

Programming Language to Use in Lab : Python
Fair Lab Record:

All the students attending the Natural language processing Lab should have a Fair Record.
Every experiment conducted in the lab should be noted in the fair record. For every experiment,
in the fair record, the right hand page should contain experiment heading, experiment number,
date of experiment, aim of the experiment, procedure/algorithm followed, other such details of
the experiment and final result. The left hand page should contain a print out of the respective
code with sample input and corresponding output obtained. All the experiments noted in the fair
record should be verified by the faculty regularly. The fair record, properly certified by the
faculty, should be produced during the time of End Semester Examination for the verification by
the examiners.

Syllabus
1. Familiarize with Python natural language processing toolkit nltk.
2. Choose an English word, and see how it is used in the different example texts by making concordances.
3. Counting Vocabulary
1. How many words (tokens) are there in the given text.
2. How many different words (types) are there in the given text
3. How many times does the word the occur in the text
4. What is this as a percentage of all the words in the text?
4. Write Python program to perform preprocessing of text (Tokenization, Filtration, Script Validation,
Stop Word Removal, Stemming).
5. Write a Python program to analyze text data using Constituency Parsing and Probabilistic Parsing.
6. Write a Python program to build Bag of Words model (BoW) in NLP.
7. Write a Python program to find the most similar sentence in the file to the given input sentence.
8. Implement Named Entity Recognition using nltk.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

9. Write a Python program to find TF-IDF values of each words in a document.

10.Implement POS tagging using hidden markov model.
11. Implement a basic chatbot using Python.
12. Implement Machine Learning based Text Classification in Python.
13. Implement a chatbot using python.
14. Implement a language translator.

Practice Questions
1. Write a Python program to read a line of text, tokenize it and remove stopwords from it.
2. Write a Python program to tokenize a line of text, perform stemming and lemmatization with WordNet.
3. Write a Python program to replace words with its synonyms and negations with antonyms.
4. Write a Python program to replace words matching regular expressions.
5. Write a Python program to create a word list corpus.
6. Write a Python program to create a part-of-speech tagged word corpus after tokenizing a line of text,
filtering out stopwords, performing lemmatization and then performing part-of-speech tagging.
7. Write a Python program to tag proper names.
8. Write a Python program to perform tagging using regular expressions.
9. Write a Python program to perform classifier-based tagging.
10. Write a Python program to create NER tagged word corpus.
11. Write a Python program to rank the words in a document using TF-IDF.

Reference Books:
1. Steven Bird, Evan Klein and Edward Loper, ―Natural Language Processing with Python‖,
O&#39;Reilly Media, Inc., 2009.
2. Multilingual natural Language Processing Applications: From Theory to Practice – Daniel M. Bikel
and Imed Zitouni, Pearson Publication
3. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary
4.. Python Text processing with NLTK 2.0 Cookbook , Jacob perkins, PACKT Publishing
5. Natural Languaage Processing with Python , Steven Bird, Ewan Klein, and Edward Loper, Oreilly.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMD334 CATEGORY L T P CREDITS

MINI PROJECT
PWS 0 0 3 2

Preamble:

The objective of this course is to apply the fundamental concepts of Artificial Intelligence /
Machine Learning principles for the effective development of an application/research project.
Mini project enables the students to boost their skills, widen the horizon of thinking and their
ability to resolve real life problems. The students are expected to design and develop a
software/hardware project to innovatively solve a real-world problem.
Prerequisite :A sound knowledge in any programming language and Subjects studied up to sixth
semester.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Identify technically and economically feasible problems of social relevance
CO1 (Cognitive Knowledge Level: Apply)

Identify and survey the relevant literature for getting exposed to related
CO2
solutions (Cognitive Knowledge Level: Apply)

Perform requirement analysis and identify design methodologies and develop

CO3 adaptable and reusable solutions of minimal complexity by using modern tools
and advanced programming techniques (Cognitive Knowledge Level: Apply)

Prepare technical report and deliver presentation(Cognitive Knowledge Level:

CO4
Apply)
Apply engineering and management principles to achieve the goal of the project
CO5 (Cognitive Knowledge Level: Apply)
Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 75 75 3

Split-up of Continuous Internal Evaluation :

Attendance 10 marks
Project Guide 15 marks
Project Report 10 marks
Evaluation by the Committee (will be evaluating the level of completion
and demonstration of functionality/specifications, presentation,
oral examination, work knowledge and involvement) 40 marks

Split-up of End Semester Examination:

The marks will be distributed as

Presentation : 30 marks
Demonstration : 20 marks
Viva : 25 marks.
Total : 75 marks.

Course Plan

Student Groups with 3 or 4 members should identify a topic of interest in consultation with
Faculty/Advisor. Review the literature and gather information pertaining to the chosen topic.
State the objectives and develop a methodology to achieve the objectives. Carryout the
design/fabrication or develop codes/programs to achieve the objectives. Innovative design
concepts, performance, scalability, reliability considerations, aesthetics/ergonomic, user
experience and security aspects taken care of in the project shall be given due weight.

The progress of the mini project is evaluated based on a minimum of two reviews. The review
committee may be constituted with the Head of the Department or a senior faculty, Mini Project
coordinator and project guide as the members. Innovative design concepts, reliability
considerations, aesthetics/ergonomic aspects taken care of in the project shall be given due
weight. The internal evaluation shall be made based on the progress/outcome of the project,
reports and a viva-voce examination, conducted internally by a 3-member committee. A project
report is required at the end of the semester. The product/application has to be demonstrated for
its full design specifications.

Guidelines for the Report preparation

A bonafide report on mini project shall be submitted within one week after the final presentation.
Minimum number of pages should be 40.
 Use Times New Roman font for the entire Report – Chapter / Section Title –Times New
Roman 18, Bold; Heading 2 – Times New Roman 16, Bold; Heading 3 – Times New
Roman 14,Bold; Body- Times New Roman12, Normal.
 Line Spacing – Between Heading 2 – 3 lines, between lines in paragraph 1.5 lines.
 Alignments – Chapter / Section Title – Center, Heading 2 & 3 should be LeftAligned.
Ensure that all body text is paragraph justified.
 Figures & Tables – Ensure that all Figures and Tables are suitably numbered and given
proper names/headings. Write figure title under the figure and table title above the table
 Suggestive order of documentation:
i. Top Cover
ii. Title page
iii. Certification page
iv. Acknowledgement
v. Abstract
vi. Table of Contents
vii. List of Figures and Tables
viii. Chapters
ix. Appendices, if any
x. References/Bibliography
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VI
MINOR
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CST INTRODUCTION Category L T P Credits Year of

382 TO SOFTWARE Introduction
TESTING
VAC 3 1 0 4 2019

Preamble:
This is a course in theoretical computer science that includes test cases for white-box, black-
box, and grey-box approaches. This course describes the various techniques for test case design
used to test software artifacts, including requirements, design, and code. The course includes
different techniques for test case design based on graphs, programming language syntaxes and
inputs. The course also covers symbolic execution using PEX tool.

Course Outcomes: After the completion of the course the student will be able to:-

List a range of different software testing techniques and be able to apply specific unit

CO1 testing method to the projects using Junit. (Cognitive Knowledge Level:
Understand)
Explain mutation testing method for a given piece of code to identify hidden defects
CO2 that can’t be detected using other testing methods. (Cognitive Knowledge Level:
Understand)
Explain graph coverage criteria in terms of control flow graph and data flow graph
CO3
for a given program. (Cognitive Knowledge Level: Understand)

Demonstrate the importance of black-box approaches in terms of domain and

CO4
functional testing. (Cognitive Knowledge Level: Understand)

Illustrate the use of PEX tool with symbolic execution. (Cognitive Knowledge
CO5
Level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO 9 PO10 PO11 PO12

CO1

CO2
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester Examination

Test 2 (Marks) Marks

Test 1 (Marks)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate

Create
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment - Test : 25 marks
Continuous Assessment - Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Module - 1 (Introduction to Software Testing)
Some Popular Errors – Ariane 5, Therac 25, Intel Pentium Bug. What is Software testing? Why should it
be tested? Software Quality, Role of Testing. Testing Process - Level 0 thinking, Level 1 thinking, Level 2
thinking, Level 3 thinking, Level 4 thinking. Software Testing Terminologies - Verification, Validation
and Testing, Faults, Error and Bug, Test cases, Coverage Criteria. Types of Testing- Unit testing,
integration testing, System testing, Acceptance testing, Beta testing, Functional testing, Stress testing,
Performance testing, Usability testing and Regression testing. Testing Methods - Black Box testing, White
Box testing, Grey Box testing.

Module - 2 (Unit Testing)

Concept of Unit testing. Static Unit testing. Dynamic Unit testing - Control Flow testing, Data Flow
testing, Domain testing, Functional Program testing. Mutation testing - Mutation and Mutants, Mutation
operators, Mutation score. Junit - Framework for Unit testing. Case Study - Mutation testing using Junit
and Muclipse.

Module - 3 (Unit Testing - White Box Approaches)

Overview of Graph Coverage Criteria. Structural Graph Coverage Criteria - Node/vertex coverage, Edge
coverage, Edge pair coverage, Path coverage, Complete path coverage, Prime path coverage, Complete
round trip coverage, Simple round trip coverage. Data Flow Criteria - du paths, du pairs. Subsumption
Relationships among Graph Coverage Criteria. Graph Coverage for Source Code - Control flow graphs for
code, CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: Loops, CFG: Exceptions
(try-catch). Example program – Statistics. Graph Coverage for Design Elements - Call graphs and classes,
Class inheritance testing: Coverage criteria, Coverage criteria on inheritance graph, Data flow at the design
level, Inter-procedural DU pairs, Coupling du-pairs example. Example - Quadratic Root. Case Study -
Graph Based testing using JUnit Framework.

Module - 4 (Unit Testing - Black Box Approaches)

Domain Testing / Input Space Partitioning - Partitions of a set. Input domain modelling - Interface-based
approach, Functionality-based approach. Identifying values. Multiple partitions of the inputdomain - All
Combinations Coverage (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise Coverage,
Base Choice Coverage, Multiple Base Choices Coverage. TriTyp example. Functional Testing - Functional
Testing Concepts of Howden. Functional testing - Important Steps. Types of Functional testing -
Equivalence Class Partitioning, Boundary Value Analysis, Decision Tables, Random Testing. Case Study -
Black Box testing approaches using JUnit.

Module - 5 (Grey Box Testing Approaches)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Introduction to Grey Box testing - Why Grey Box testing, Gray Box Methodology, Advantages and
Disadvantages. Techniques of Grey Box Testing - Matrix Testing, Regression Testing, Orthogonal Array
Testing or OAT, Pattern Testing. An Introduction to PEX - Parameterized Unit Testing, The Testing
Problem. Symbolic Execution – Example, Symbolic execution tree. PEX application Case Study – PEX.

Text Books
1. Paul Ammann and JeffOffutt ,Introduction to Software Testing.
2. KshirasagarNaik and PriyadarshiTripathy, Software Testing And Quality Assurance: Theory And
Practice.

Reference Materials
1. https://www.csc.ncsu.edu/academics/undergrad/honors/thesis/muclipsebinder.pdf - Muclipse
tutorial.
2. King, James C, “Symbolic Execution and Program Testing”, Association for Computing
Machinery, July 1976.
3.
Sample Course Level Assessment Questions
Course Outcome 1 (CO1): Explain the following types of testing methods with examples.
(i) Balck-box testing.
(ii) White-box testing.
(iii) Grey-box testing.
Course Outcome 2 (CO2): Define 12 mutants for the following method power() using effective mutation
operators. Try to use each mutation operator at least once. Approximately, how many mutants do you think
there would be, if all mutants for power() were created?
public static int power (int left, int right)
{
//**************************************
// Raises Left to the power of Right
// precondition : Right >= 0
// postcondition: Returns Left**Right
//**************************************
intrslt;
rslt = Left;
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

if (Right == 0)
{
rslt = 1;
}
else
{
for (int i = 2; i <= Right; i++)
rslt = rslt * Left;
}
return (rslt);
}
Course Outcome 3 (CO3): Draw the control flow graph and data flow graph of given piece of code.

public static double ReturnAverage(int value[],int AS, int MIN, int MAX){
/*
Function: ReturnAverageComputes the averageof all those numbers in the input array in
the positive range [MIN, MAX]. The maximumsize of the array is AS. But, the array size
could be smaller than AS in which case the endof input is represented by -999.
*/
int i, ti, tv, sum;
doubleav;
i = 0; ti = 0; tv = 0; sum = 0;
while (ti< AS && value[i] != -999) {
ti++;
if (value[i] >= MIN && value[i] <= MAX) {
tv++;
sum = sum + value[i];
}
i++;
}
if (tv> 0)
av = (double)sum/tv;
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

else
av = (double) -999;
return (av);
}
Course Outcome 4 (CO4): Explain the following with examples.
1. Input domain modelling.
2. All Combinations Coverage (ACoC)
3. Each Choice Coverage (ECC)
4. Pair-wise Coverage
5. T-wise Coverage
6. Base Choice Coverage
7. Multiple Base Choices Coverage.

Course Outcome 5 (CO5): Draw the symbolic execution tree for the following program code
and explain the symbolic execution of testme (α1, α2).
1. int twice (int v) {
2. return 2 ∗ v;
3. }
4. void testme (int x, int y ) {
5. z = twice ( y);
6. if ( z == x ){
7. if ( x > y + 10)
8. ERROR;
9. }
10. }
11. int main() {
12. x = sym input();
13. y = sym input();
14. testme ( x , y);
15. return(0);
16. }
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES: 4

Reg No: Name :

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR

Course Code: CST 382

Course Name: Introduction to Software Testing

Max.Marks:100 Duration: 3 Hours

PART A
Answer all Questions. Each question carries 3 Marks

1. Explain the differences between Validation and Verification.

2. Explain the differences between Fault, Error, and Bug?

3. Define Ground string, Mutation score, and Mutants.

4. What are the functions of Test driver and Test stubs in dynamic unit testing?

5. Define Node coverage, Edge coverage and Prime path coverage in a control flow
graph.

6. What are du paths and du pairs in a data flow graph?

7. Explain the two approaches in input domain modelling.

8. Explain the difference between Equivalence Class Partitioning and Boundary

Value Analysis.

9. Briefly explain three techniques of Grey box testing.

10. Explain the concept of symbolic execution with the help of a toy example.
(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the following types of testing

(i) Black Box testing (ii) White Box testing (iii) Grey Box testing (14)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(iv) Unit testing (v) Integration testing (vi) System testing (vii) Acceptance
testing

OR

12. (a) Explain the following coverage criterias based on the code fragment given
below. (i) Functional coverage (ii) Statement coverage (iii)Conditional (8)
coverage (iv)Branch coverage
int foo (int x, int y){
int z = 0;
if ((x > 0) && (y > 0)){
z = x;}
return z;
}

(b) Write positive and negative test cases for an ATM Machine? (6)

13. (a) Explain Dynamic unit test environment with a neat figure.
(8)

(b) Explain the major difference between control flow testing and data flow
testing. (6)

OR

14. Explain seven types of mutation operators with neat examples. (14)

15. (a) Explain touring, side trips and detours with a neat example. (7)

(b) Explain simple path coverage and prime path coverage with the help of CFG (7)
given below. 1

2 3

OR

16. (a) Draw CFG fragment for

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(i) Simple if (ii) Simple while loop (iii) Simple for loop (7)

(b) Explain the following concepts with examples. (7)

(i) Call graph (ii) Inheritance graph (iii) Coupling du-pairs

17. (a) What are the four important steps in functional testing? (7)

(b) Briefly explain input domain modelling approaches. (7)

OR

18. (a) Consider the triangle classification program with a specification: (6)
The program reads floating values from the standard input. The three values
A, B, and C are interpreted as representing the lengths of the sides of
triangle. The program then prints a message to the standard output that states
whether the triangle, if it can be formed, is scalene, isosceles, equilateral, or
right angled. Determine the following for the above program:
(i) For the boundary condition A +B > C case (scalene triangle),
identify test cases to verify the boundary.
(ii) For the boundary condition A = C case (isosceles triangle), identify
test cases to verify the boundary.
(iii) For the boundary condition A = B = C case (equilateral triangle),
identify test cases to verify the boundary.

(b) Develop a decision table to generate test cases for this specification. (8)

19. (a) Explain the importance of grey box testing, its advantages and disadvantages. (9)

(b) Explain the concept of symbolic execution tree. (5)

OR

20. (a) Consider the code fragment given below: - (7)

1. POWER: PROCEDURE(X, Y);

2. Z ← 1;
3. J ← 1;
4. LAB: IF Y ≥ J THEN
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. DO; Z← Z * X;
6. J ← J + 1;
7. GO TO LAB; END;
8. RETURN (Z) ;
9. END;
a) Explain Symbolic execution of POWER (αl, α2).

(b) Explain Execution tree for POWER (αl, α2) in the above code fragment. 7)

TEACHING PLAN

No. of
Index Topics Hours
(45)

Module 1 (Introduction to Software Testing) 9 Hours

1.1 Some Popular Errors– Ariane 5, Therac 25, Intel Pentium Bug. 1 Hour

What is Software testing? Why should it be tested? Software Quality, Role

1.2 1 Hour
of Testing.
Testing Process - Level 0 thinking, Level 1 thinking, Level 2 thinking,
1.3 1 Hour
Level 3 thinking, Level 4 thinking.
Software Testing Terminologies- Verification, Validation and Testing,
1.4 1 Hour
Faults, Error and Bug, Test cases, Coverage Criteria.
Types of Testing- Unit testing, integration testing, System testing,
1.5 1 Hour
Acceptance testing, Beta testing

1.6 Functional testing, Stress testing 1 Hour

1.7 Performance testing, Usability testing and Regression testing. 1 Hour

1.8 Testing Methods - Black Box testing 1 Hour

1.9 Grey Box testing. 1 Hour

Module 2 (Unit testing) 8 Hours

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.1 Concept of Unit testing. 1 Hour

2.2 Static Unit testing. 1 Hour

2.3 Dynamic Unit testing - Control Flow testing, Data Flow testing 1 Hour

2.4 Domain testing, Functional Program testing.

Mutation testing - Mutation and Mutants, Mutation operators, Mutation

2.5 1 Hour
score.

2.6 Junit - Framework for Unit testing. 1 Hour

2.7 Case Study - Mutation testing using Junit 1 Hour

2.8 Case Study - Mutation testing using Muclipse 1 Hour

Module 3 (Unit Testing:- White Box Approaches) 10 Hours

3.1 Overview of Graph Coverage Criteria 1 Hour

Structural Graph Coverage Criteria - Node/vertex coverage, Edge coverage,

3.2 1 Hour
Edge pair coverage, Path coverage
Complete path coverage, Prime path coverage, Complete round trip
3.3 1 Hour
coverage, Simple round trip coverage.

3.4 Data Flow Criteria - du paths, du pairs 1 Hour

3.5 Subsumption Relationships among Graph Coverage Criteria. 1 Hour

Graph Coverage for Source Code - Control Flow Graphs (CFG) for code,
3.6 CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: 1 Hour
Loops, CFG: Exceptions (try-catch). Example program - Statistics
Graph Coverage for Design Elements - Call graphs and classes, Class
3.7 inheritance testing: Coverage criteria, Coverage criteria on inheritance 1 Hour
graph,
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Data flow at the design level, Inter-procedural DU pairs, Coupling du-pairs

3.8 1 Hour
example. Example - Quadratic Root

3.9 Case Study - Graph Based testing using JUnit Framework. (Lecture 1) 1 Hour

3.10 Case Study - Graph Based testing using JUnit Framework. (Lecture 2) 1 Hour

Module 4 (Unit Testing:- Black Box Approaches) 9 Hours

4.1 Domain Testing / Input Space Partitioning - Partitions of a set. 1 Hour

Input domain modelling - Interface-based approach, Functionality-based

4.2 1 Hour
approach.

4.3 Identifying values. 1 Hour

Multiple partitions of the input domain - All Combinations Coverage

4.4 (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise 1 Hour
Coverage, Base Choice Coverage, Multiple Base Choices Coverage.

4.5 TriTyp example. 1 Hour

Functional Testing - Functional Testing Concepts of Howden.

4.6 1 Hour
Important Steps.
Types of Functional testing - Equivalence Class Partitioning, Boundary
4.7 1 Hour
Value Analysis

4.8 Decision Tables, Random Testing. 1 Hour

4.9 Case Study - Black Box testing approaches using JUnit. 1 Hour

Module 5 (Grey Box Testing Approaches) 9 Hours

Introduction to Grey Box testing - Why Grey Box testing, Gray Box
5.1 1 Hour
Methodology, Advantages and Disadvantages.

5.2 Techniques of Grey Box Testing - Matrix Testing, Regression Testing, 1 Hour
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.3 Orthogonal Array Testing or OAT, Pattern Testing. 1 Hour

5.4 An Introduction to Pex - Parameterized Unit Testing, The Testing Problem. 1 Hour

5.5 Symbolic Execution – Example, Symbolic execution tree. 1 Hour

5.6 PEX application. 1 hour

5.7 Case Study – PEX (Lecture 1) 1 Hour

5.8 Case Study – PEX (Lecture 2) 1 Hour

5.9 Case Study – PEX (Lecture 3) 1 Hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CST CONCEPTS IN Year of

Category L T P Credits
384 DEEP Introduction

LEARNING
VAC 3 1 0 4 2019

Preamble:
This course aims to introduce the learner to an overview of the concepts and algorithms involved in
deep learning. Deep learning is a subfield of machine learning, a subfield of artificial intelligence.
Basic concepts and application areas of machine learning, deep networks, convolutional neural
network and recurrent neural network are covered here. This is a foundational program that will
help students understand the capabilities, challenges, and consequences of deep learning and
prepare them to participate in the development of leading-edge AI technology. They will be able to
gain the knowledge needed to take a definitive step in the world of AI.

Prerequisite: Sound knowledge in Basics of linear algebra and probability theory.

CO1 Demonstrate basic concepts in machine learning.(Cognitive Knowledge Level:

Understand)

CO2 Illustrate the validation process of machine learning models using hyper-parameters
and validation sets. (Cognitive Knowledge Level: Understand)

CO3 Demonstrate the concept of the feed forward neural network and its training process.
(Cognitive Knowledge Level: Apply)

CO4 Build CNN and Recurrent Neural Network (RNN) models for different use cases.
(Cognitive Knowledge Level: Apply)

CO5 Use different neural network/deep learning models for practical applications.
(Cognitive Knowledge Level: Apply)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Examination
Test1 (Percentage) Test2 (Percentage) Marks

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyse

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First Internal
Examination shall be preferably conducted after completing the first half of the syllabus and the
Second Internal Examination shall be preferably conducted after completing remaining part of the
syllabus.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3 marks
for each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a
student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which a student should answer any one. Each question can have
maximum 2 sub-divisions and carry 14 marks.

Syllabus

INTRODUCTION TO DEEP LEARNING

(General Instructions: Instructors are to introduce students to any one software platform and
demonstrate the working of the algorithms in the syllabus using suitable use cases and public
datasets to give a better understanding of the concepts discussed. Tutorial hour may be used for this
purpose)

Module-1 (Introduction)

Key components - Data, models, objective functions, optimization algorithms, Learning algorithm.
Supervised learning- regression, classification, tagging, web search, page ranking, recommender
systems, sequence learning, Unsupervised learning, Reinforcement learning, Historical Trends in
Deep Learning. Other Concepts - overfitting, underfitting, hyperparameters and validation sets,
estimators, bias and variance.

Module- 2 (Optimization and Neural Networks)

Neural Networks –Perceptron, Gradient Descent solution for Perceptron, Multilayer perceptron,
activation functions, architecture design, chain rule, back propagation, gradient based learning.
Introduction to optimization– Gradient based optimization, linear least squares. Stochastic gradient
descent, Building ML algorithms and challenges.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module -3 (Convolutional Neural Network)

Convolutional Neural Networks – convolution operation, motivation, pooling, Structure of CNN,

Convolution and Pooling as an infinitely strong prior, variants of convolution functions, structured
outputs, data types, efficient convolution algorithms. Practical challenges of common deep learning
architectures- early stopping, parameter sharing, dropout. Case study: AlexNet, VGG, ResNet.

Module- 4 (Recurrent Neural Network)

Recurrent neural networks – Computational graphs, RNN design, encoder – decoder sequence to
sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs LSTM
and GRU, Practical use cases for RNNs.

Module-5 (Application Areas)

Applications – computer vision, speech recognition, natural language processing, common word
embedding: continuous Bag-of-Words, Word2Vec, global vectors for word representation (GloVe).
Research Areas – autoencoders, representation learning, boltzmann machines, deep belief
networks.

Text Book
1. Ian Goodfellow, YoshuaBengio, Aaron Courville, Deep Learning, MIT Press 2015 ed.
2. Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola, Dive into Deep Learning,
August 2019.
3. Neural Networks and Deep Learning, Aggarwal, Charu C., c Springer International
Publishing AG, part of Springer Nature 2018

Reference Books
1. Neural Smithing: Supervised Learning in Feedforward Artificial Neural Networks by
Russell Reed, Robert J MarksII, A Bradford Book,2014
2. Practical Convolutional Neural Networks by MohitSewak, Md. Rezaul Karim,
PradeepPujari,Packt Publishing 2018
3. Hands-On Deep Learning Algorithms with Python by SudharsanRavichandran,Packt
Publishing 2019
4. Deep Learning with Python by Francois Chollet,Manning Publications Co.,2018
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Compare regression and classification.
2. Define supervised learning? Distinguish between regression and classification.
3. Discuss the different learning approaches used in machine learning.
Course Outcome 2 (CO2):
1. What are hyperparameters? Why are they needed?
2. What issues are to be considered while selecting a model for applying machine
learning in a given problem?
Course Outcome 3 (CO3):
1. Update the parameters V11 in the given MLP using back propagation with learning rate as
0.5 and activation function as sigmoid. Initial weights are given as V11= 0.2, V12=0.1,
V21=0.1, V22=0.3, V11=0.2, W11=0.5, W21=0.2
V
0.6 W

0.9

0.8

2. Draw the architecture of a multi-layer perceptron.

3. Derive update rules for parameters in the multi-layer neural network through the gradient
descent.

Course Outcome 4 (CO4):

1. Give two benefits of using convolutional layers instead of fully connected ones for
visual tasks.
2. Suppose that a CNN was trained to classify images into different categories. It
performed well on a validation set that was taken from the same source as the
training set but not on a testing set. What could be the problem with the training of
such a CNN? How will you ascertain the problem? How can those problems be
solved?
3. Explain how the cell state is updated in the LSTM model from Ct-1 to Ct
4. Show the steps involved in an LSTM to predict stock prices.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 5 (CO5):

1. Explain how the cell state is updated in the LSTM model from Ct-1 to Ct
2. Show the steps involved in an LSTM to predict stock prices.
3. Illustrate the workings of the RNN with an example of a single sequence defined
on a vocabulary of four words.
Course Outcome 6 (CO6):
1. Development a deep learning solution for problems in the domain i) natural
language processing or ii Computer vision (Assignment
2. Illustrate the workings of the RNN with an example of a single sequence defined
on a vocabulary of four words.

Model Question Paper

QP CODE: PAGES:4

Reg No:

Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR

Course Code: CST 384

Course Name: CONCEPTS IN DEEP LEARNING
Max. Marks:100 Duration: 3 Hours

PART A
Answer all Questions. Each question carries 3 Marks
1. Distinguish between supervised learning and Reinforcement learning. Illustrate
with an example.

2. Differentiate classification and regression.

3. Compare overfitting and underfitting. How it can affect model generalization.

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. Why does a single perceptron cannot simulate simple XOR function? Explainhow
this limitation is overcome?

5. Illustrate the strengths and weaknesses of convolutional neural networks.

6. Illustrate convolution and pooling operation with an example

7. How many parameters are there in AlexNet? Why the dataset size (1.2 million) is
important for the success of AlexNet?

8. Explain your understanding of unfolding a recursive or recurrent computation into a

computational graph.

9. Illustrate the use of deep learning concepts in Speech Recognition.

10. What is an autoencoder? Give one application of an autoencoder

(10x3=30

Part B)
(Answer any one question from each module. Each question carries 14
Marks)

11. (a) “A computer program is said to learn from experience E with respect to some
class of (10)
tasks T and performance measure P, if its performance at tasks in T, as
measured by P, improves with experience E.” What is your understanding of
the terms task, performance and experience. Explain with two example

(b) “How does bias and variance trade-off affect machine learning algorithms?
(4)

OR

12. (a) Illustrate the concepts of Web search, Page Ranking, Recommender systems
with suitable examples. (10)

(b) List and discuss the different hyper parameters used in fine tuning the (4)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

traditional machine learning models

13. (a) How multilayer neural networks learn and encode higher level features from
input features. (7)

(b) Explain gradient decent and delta rule? Why stochastic approximation to
gradient descent is needed? (7)

OR

14. (a) Find the new weights for the network using backpropogation algorithm, the (7)
network is given with a input pattern[-1,1] and target output as +1, Use
learning rate of alpha=0.3 and bipolar sigmoid function.

(b) Write an algorithm for backpropgation which uses stochastic gradient descent (7)
method. Comment on the effect of adding momentum to the network.

15. (a) Input to CNN architecture is a color image of size 112x112x3. The first (5)
convolution layer comprises of 64 kernels of size 5x5 applied with a stride
of 2 and padding 0. What will be the number of parameters?

(b) Let X=[-1, 0, 3, 5] W=[.3 ,.5 .2,.1] be the the input of ith layer of a neural (4)
network and to apply softmax function. What should be the output of it?

(c) Draw and explain the architecture of convolutional network (5)

OR

16. (a) Explain the concept behind i) Early stopping ii) dropout iii) weight decay (9)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) How backpropagation is used to learn higher-order features in a convolutional (5)

Network?

17. (a) Explain the working of RNN and discuss how backpropagation through time
is used in recurrent networks. (8)

(b) Describe the working of a long short term memory in RNNs. (6)

OR

18. (a) What is the vanishing gradient problem and exploding gradient problem? (8)

(b) Why do RNNs have a tendency to suffer from exploding/vanishing gradient? (6)
How to overcome this challenge?

19. (a) Explain any two word embedding techniques (8)

(b) Explain the merits and demerits of using Auto encoders in Computer Vision. (6)

OR

20. (a) Illustrate the use of representation learning in object classification. (7)

(b) Compare Boltzmann Machine with Deep Belief Network. (7 )

Teaching Plan

CONCEPTS IN DEEP LEARNING (45 Hours)

Module 1 : Introduction (9 hours)

1.1 Key components - Data, models, objective functions, optimization algorithms. 1 hour
(TB2: Section 1.1-1.2)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1.2 Learning algorithm (TB1: Section 5.1), Supervised learning- regression, 1 hour
classification (TB2: Section 1.3.1)

1.3 tagging, web search, page ranking (TB2: Section 1.3.1) 1 hour

1.4 Recommender systems, Sequence learning, Unsupervised learning, 1 hour

Reinforcement learning(TB2: Section 1.3.2-1.3.4)

1.5 Historical Trends in Deep Learning (TB1: Section 1.2). 1 hour

1.6 Concepts: over-fitting, under-fitting, hyperparameters and validation sets. 1 hour

(TB1: Section 5.2-5.3)

1.7 Concepts: Estimators, bias and variance. (TB1: Section 5.4) 1 hour

1.8 Demonstrate the concepts of supervised learning algorithms using a suitable 1 hour
platform.

1.9 Demonstrate the concepts of unsupervised using a suitable platform. 1 hour

Module 2 : Optimization and Neural Networks (9 hours)

2.1 Perceptron, Stochastic Gradient descent, Gradient descent solution for 1 hour
perceptron (TB3: Section 1.1 - 1.2.1)

2.2 Multilayer perceptron (TB3: Section 1.2.2), (TB1: Section 6.1,6.3) 1 hour

2.3 Activation functions- Sigmoid, tanh, Softmax, ReLU, leaky ReLU (TB3: 1 hour
Section 1.2.1.3 - 1.2.1.5)

2.4 Architecture design (TB1: Section 6.4, TB3: Section 1.6) 1 hour

2.5 Chain rule, back propagation (TB3: Section 1.3) 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.6 Gradient based learning (TB1: Section 6.2) 1 hour

2.7 Gradient based optimization (TB1: Section 4.3) 1 hour

2.8 Linear least squares using a suitable platform. (TB1: Section 4.5) 1 hour

2.9 Building ML Algorithms and Challenges (TB3: 1.4, TB1: 5.10-5.11) 1 hour

Module 3 :Convolution Neural Network (10 hours)

3.1 Convolution operation, Motivation, pooling (TB1:Section 9.1-9.3) 1 hour

3.2 Structure of CNN (TB3: Section 8.2) 1 hour

3.3 Convolution and Pooling as an infinitely strong prior (TB1: Section 9.4) 1 hour

3.4 Variants of convolution functions – multilayer convolutional network, tensors, 1 hour

kernel flipping, downsampling, strides and zero padding. (TB1: Section 9.5)

3.5 Variants of convolution functions - unshared convolutions, tiled convolution, 1 hour

training different networks. (TB1: Section 9.5)

3.6 Structured outputs, data types (TB1: Section 9.6-9.7) 1 hour

3.7 Efficient convolution algorithms. (TB1: Section 9.8,9.10) 1 hour

3.8 Practical challenges of common deep learning architectures- early Stopping 1 hour
(TB3: 4.6)

3.9 Practical challenges of common deep learning architectures- parameter 1 hour

sharing, drop-out (TB3: Section 4.9, 4.5.4)

3.10 Case Study: AlexNet,VGG, ResNet. (TB3: Section 8.4.1-8.4.3,8.4.5) 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 4 :Recurrent Neural Network (8 hours)

4.1 Computational graphs (TB1: Section 10.1) 1 hour

4.2 RNN (TB1: Section 10.2-10.3) 1 hour

4.3 Encoder – decoder sequence to sequence architectures. (TB1: Section 10.4) 1 hour

4.4 Deep recurrent networks (TB1: Section 10.5) 1 hour

4.5 Recursive neural networks , Modern RNNs, (TB1: Section 10.6, 10.10) 1 hour

4.6 LSTM and GRU (TB1: Section 10.10, TB3: Section 7.5-7.6) 1 hour

4.7 Practical use cases for RNNs. (TB1: Section 11.1-11.4) 1 hour

4.8 Demonstrate the concepts of RNN using a suitable platform. 1 hour

Module 5 : Applications and Research (9 hours)

5.1 Computer vision. (TB1: Section 12.2) 1 hour

5.2 Speech recognition. (TB1: Section 12.3) 1 hour

5.3 Natural language processing. (TB1: Section 12.4) 1 hour

5.4 Common Word Embedding -: Continuous Bag-of-Words, Word2Vec (TB3: 1 hour

Section 2.6)

5.5 Common Word Embedding -: Global Vectors for Word 1 hour

Representation(GloVe) (TB3: Section 2.9.1- Pennigton 2014)

5.6 Brief introduction on current research areas- Autoencoders, Representation 1 hour

learning. (TB3: Section 4.10)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.7 Brief introduction on current research areas- representation learning. (TB3: 1 hour
Section 9.3)

5.8 Brief introduction on current research areas- Boltzmann Machines, Deep belief 1 hour
networks. (TB1: Section 20.1, TB3 Section 6.3)

5.9 Brief introduction on current research areas- Deep belief networks. (TB1: 1 hour
Section 20.3)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Year of
WIRELESS Category L T P Credit
CST Introduction
NETWORKS AND
386
IoT APPLICATIONS VAC 3 1 0 4 2019

Preamble:
This course equips the learners with fundamental wireless technologies for the Internet of
Things(IoT) and the IoT ecosystem. It covers the underlying concepts in wireless networks,
communication mechanisms, protocols, hardware, software, and the cloud platforms for IoT. The
students will be able to design smart IoT applications for real world problems..

Prerequisite: Sound knowledge in Data Communication, Computer Networks and

Programming in C

Course Outcomes: After the completion of the course the students will be able to

Recognize wireless technologies required for IoT ecosystem (Cognitive Knowledge

CO1
Level : Understand)
Perceive the concept of IoT and M2M architecture, IoT examples, and Data
CO2
Management in IoT (Cognitive Knowledge Level :Apply)
Outline the hardware components used in IoT including Sensors, Actuators and
CO3
development boards (Cognitive Knowledge Level : understand)

CO4 Explain the software components of IoT (Cognitive Knowledge Level :Understand)
Demonstrate the protocols used in IoT and build IoT Programs (Cognitive
CO5
Knowledge Level : Apply)
Build IoT-based smart real-time applications such as Smart Healthcare, Smart
CO6 Agriculture, Smart Environment and Smart Home (Cognitive Knowledge Level :
Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO3

CO4

CO5

CO6

Abstract POs Defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Blooms Category Continuous Assessment Tests End Semester

Examination Marks

Test 1 (Percentage) Test 2 (Percentage)

Remember 30 30 30

Understand 50 40 40

Apply 20 30 30
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 Hours

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests 25 marks
Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First Internal
Examination shall be preferably conducted after completing the first half of the syllabus, and the
Second Internal Examination shall be preferably conducted after completing the remaining part of
the syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly covered module), each with 7 marks. Out of
the 7 questions in Part B, a student should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer anyone. Each question
can have a maximum 2 subdivisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

ule- 1 ( Introduction to IoT and wireless technologies required for IoT )

Internet of Things, Role of Things and the Internet, Wireless IoT. Wireless Networks -
Network Topologies, Types of Networks. Role of Wireless Standards in IoT. Protocol Stack -
OSI Model, TCP/IP Model, IEEE 802 Reference Model, Protocols for Wireless IoT. Bluetooth
- Transceiver, Frequency Channels, Typical Range, Access and Spread Spectrum, Modulation
and Data Rate, Error Correction and Detection, Network Topology. ITU G.9959, Zwave, IEEE
802.15.4, Zigbee Specification, Thread, WiFi, 6LowPAN, IPv6, LoRaWAN.

Module- 2 (IoT architecture, Data and Device management)

Internet of Things - IoT Architectural View, Technology Behind IoT - Server End Technology,
Sources of Internet of Things, M2M Communication. IoT Application Areas. IoT Examples.
IoT Data Management - Device Management Gateways. Design Principles for Web
Connectivity - Web Communication Protocols for Connected Devices, Web Connectivity for
Connected Devices using Gateways. Internet Connectivity Principles – Internet Connectivity,
Internet based communication, IP addressing in the IoT.
Module- 3 (Data Acquiring and Enabling Technologies)
Data Acquiring and Storage for IoT Sevices- Organization of Data, Big data, Acquiring
Methods, Management Techniques, Analytics, Storage Technologies. Cloud Computing for Data
storage - IoT Cloud based Services using Xively, Nimbits, and Other Platforms. Sensor
Technologies for IoT Devices - Sensor Technology, Participatory Sensing, Industrial IoT and
Automotive IoT, Actuators for Various Devices, Sensor Data Communication Protocols,
Wireless Sensor network Technology
Module-4 (Prototyping the Embedded Devices for IoT)
Embedded Computing Basics, Embedded Hardware Unit. Embedded Platforms for Prototyping -
Arduino, Intel Galileo, Intel Edison, Raspberry Pi, BeagleBone, mBed. Prototyping and
Designing the Software for IoT Applications- Introduction, Prototyping Embedded
DeviceSoftware- Programming using Arduino, Programming for an Arduino Controlled Traffic
Control Lights at a Road Junction, Basic Arduino Programs to Blink LED, Find the Distance
using Ultrasonic Sensor, Estimate Room Temperature, Measuring Soil Moisture Level
Module 5 (Business Models and Case Studies)
Business Models and Processes using IoT. Value Creation in the Internet of Things. Cloud
PaaS- Xively, Nimbits, IBM Bluemix, CISCO IoT, AWS IoT, TCS Connected AWS Platform,
Case studies- Smart Home, Smart Environment, Smart healthcare, Smart agriculture
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Text Books
1. Daniel Chew, “Wireless Internet of Things -A Guide to the lower layers”, IEEE Standards
and Association, IEEE Press, Wiley
2. Rajkamal, “Internet of Things : Architecture and Design Principles”, McGraw Hill (India)
Private Limited.
References
1. ArshadeepBahga, Vijay Madisetti, “Internet of Things: A hands-on approach”, University
Press, 2015 (First edition)
2. Dieter Uckelmann, Mark Harrison, Michahelles Florian (Ed.), Architecting the internet of
things, Springer, 2011
3. Dr. Ovidiu Vermesan, Dr. Peter Friess, Internet of Things: Converging Technologies for
Smart Environments and Integrated Ecosystems, River Publishers, 2013
4. Simon Monk, “Programming Arduino: Getting Started with Sketches”, McGraw Hill
Publications

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare Bluetooth and Bluetooth LE power classes
2. Demonstrate Zigbee Specification Protocol Stack
Course Outcome 2 (CO2):
1. What are the major components of IOT system? Briefly explain each
2. Correlate M2M architectural Levels with IOT architectural Levels
Course Outcome 3 (CO3):
1. Describe the use of GPIO pins ?
2. What are actuators ? Mention the roles of actuators in IoT systems
Course Outcome 4(CO4):
1. Identify the role of HBase in Hadoop File System
2. Differentiate Edge computing and Distributed computing
3. Illustrate open protocols, tools and frameworks generally used in M2M

Course Outcome 5(CO5):

1. What do you mean by Arduino sketches?
2. Write an Arduino program to blink LED
Course Outcome 6(CO6):
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. How IoT technology helps TELEMEDICINE in India?

2. How soil moisture can be detected in Smart Agriculture?

Model Question Paper

QP CODE: PAGES :2
Reg No:
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SIXTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Code: CST 386
Course Name: WIRELESS NETWORKS AND IoT APPLICATIONS

Max.Marks:100 Duration: 3 Hours

PART A
Answer All Questions. Each Question Carries 3 Marks

1. Illustrate Role of things and internet in IoT

2. What is Bluetooth? Explain the range and frequency channels of Bluetooth?

3. List any three the features of Constrained Application Protocol (COAP).

4. Compare Raspberry Pi and BeagleBoard boards.

5. Identify the role of HBase in Hadoop File System.

6. Differentiate Edge computing and Distributed computing.

7. Give an example of Raspberry Pi applications for Industrial IoT.

8. What are the on-board functional units in Intel Galileo?

9. Interpret the concept of value creation in IoT.

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

10. Explain the use of PaaS in IoT Smart applications with any three examples.
(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Compare various Network topologies used in Wireless Networks. (8)

(b) Describe the following wireless technologies on i) Zigbee ii)WiFi

iii) Thread. (6)

OR

12. (a) Explain protocol stacks used in wireless networks for IoT applications. (8)

(b) Illustrate the Architectural design of LoRaWAN. (6)

13. (a) Define M2M. Explain M2M architecture. Correlate M2M architectural levels (8)
with IoT architectural levels.

(b) Compare SOAP and REST protocols. (6)

OR

14. (a)
Summarize different Online Transactions and Processing techniques. (8)

(b) Identify the functions of Device-Management Gateway . (6)

15. (a) Define

actuators ? Describe the roles of actuators in IoT systems. (8)

(b) Explain the usage contexts of analog sensors and digital sensors. (6)

OR

16. (a) How data

collection, storage & computing services done using Nimbits? (10)

(b) List any four features of Xively. (4)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. (a) What do you mean by Arduino sketches? (4)

(b) Write an Arduino program to blink LED (10)

OR

18. (a) Demonstrate an example of Raspberry Pi applications for Industrial IoT. (10)

(b) Compare the features of Arduino-R3 and Arduino Yun boards. (4)

19. (a) Explain various tasks of a smart irrigation monitoring service. (8)

(b) Demonstrate the tasks of Soil-Moisture monitoring service. (6)

OR

20. (a) a) Mr. Kiran Mathew has been a chronic diabetic patient for the past few (10)
years. He was under regular check up at the hospital every two weeks. All of
a sudden the pandemic like COVID-19 arises in the country and the
government issues a lockdown for a period of two months. Illustrate how
Mr. Kiran can be monitored by the health care worker using intelligent
healthcare techniques.

(b) Mention any four sensors used in smart healthcare (4 )

TEACHING PLAN

No Contents No of
Lecture
Hrs(45)

Module – 1 ( Introduction to IoT and wireless technologies required for IoT) (8 hrs) (TB-
1, Chapter 1...)

1.1 Internet Of Things, Role of things and internet ,Wireless IoT 1

1.2 Wireless Networks- Network Topologies-Types of Networks,Role of 1

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Wireless standards in IoT

1.3 Protocol Stack-OSI Model- TCP/IP Model-IEEE 802 reference model 1

Protocols for Wireless IoT-Bluetooth-Transceiver, Frequency Channels-

1.4 1
Typical Range, Access and Spread Spectrum, Modulation and Data Rate

1.5 Error Correction and Detection-Network Topology. 1

1.6 ITU G.9959, Zwave, IEEE 802.15.4, Zigbee Specification 1

1.7 Thread, Wifi, 6LowPAN, IPv6 1

1.8 LoRaWAN 1

Module- 2 (IOT architecture, Data and Device management) (9hrs)

2.1 Internet of Things -IoT Architectural view 1

Technology Behind IOT-Server End Technology,Sources of Internet of

2.2 1
Things

2.3 M2M Communication. 1

2.4 IoT Application Areas. IOT Examples. 1

2.5 IoT Data Management, Device Management Gateways. 1

2.6 Design Principles for Web Connectivity 1

2.7 Web communication protocols for connected devices, 1

2.8 Web connectivity for connected devices using Gateways. 1

Internet connectivity Principles – Internet Connectivity, Internet based

2.9 1
communication, IP addressing in the IoT.

Module- 3 (Data Acquiring and Enabling Technologies (8 hrs)

3.1 Data acquiring and storage for IoT devices- Organization of Data, Big data 1

Acquiring methods, management techniques, Analytics, Storage

3.2 1
technologies.

3.3 Cloud computing for Data storage-IoT Cloud based services using Xively, 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Nimbits, and other platforms.

3.4 Cloud computing-Nimbits 1

Sensor Technologies for IoT Devices-Sensor Technology, Participatory

3.5 1
sensing

3.6 Industrial IoT and Automotive IoT 1

3.7 Actuators for various devices, Sensor data communication protocols 1

3.8 Wireless Sensor network Technology 1

Module 4(Prototyping the Embedded Devices for IoT )(9hrs)

4.1 Introduction, Embedded Computing Basics, Embedded Hardware Unit. 1

1
4.2 Embedded Platforms for Prototyping-Arduino, Intel Galileo

4.3 Intel Edison, Raspberry Pi, BeagleBone, mBed 1

4.4 Prototyping and designing the software for IoT applications-Introduction, 1

Prototyping embedded device software

4.5 Prototyping and designing the software for IoT applications-Introduction, 1

Prototyping embedded device software

4.6 Programming concepts in Arduino 1

4.7 Programming for an arduino controlled traffic control lights at a road junction 1

4.8 Basic Arduino programs to blink LED, Find the distance using ultrasonic 1
sensor

4.9 Estimate room temperature, Measuring soil moisture level 1

Module 5 (higher level protocols and case studies)(9 hrs)

5.1 Business Models and Processes using IOT, Value creation in the Internet of 1
Things.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.2 Xively, Nimbits, IBM Bluemix 1

5.3 CISCO IoT, AWS IoT, TCS Connected AWS Platform 1

5.4 Case Study- Smart Environment 1

5.5 Case Study- Smart Environment 1

5.6 Case study Smart Home 1

5.7 Case study Smart Home 1

5.8 Case study Smart healthcare (Lecture I) 1

5.9 Case study Smart healthcare (Lecture II) 1

5.10 Case study -Smart agriculture (Lecture I) 1

5.11 Case study -Smart agriculture (Lecture II) 1

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VI
HONOURS
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CST NETWORK Year of Introduction

Category L T P Credits
394 SECURITY
VAC 3 1 0 4 2019

Preamble:
The purpose of this course is to create a better understanding of the network security concepts.
This course covers network security standards, email security services, web security mechanisms,
firewalls and wireless security mechanisms. This course helps the learner to gain insight into the
key aspects of secure network communication and enables to apply in real-life scenarios.
Prerequisite: A sound background in Number Theory and Cryptographic Algorithms.
Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

Identify the key aspects of security, intrusion detection systems and digital signature
CO1 schemes (Cognitive Knowledge Level: Apply)

Explain the security standards used in network communication (Cognitive Knowledge

CO2 Level:Understand)

Identify the mechanisms in email security services (Cognitive Knowledge Level:

CO3 Apply)

Summarize the protocols used to provide web security (Cognitive Knowledge Level:
CO4 Understand)

Explain the fundamental concepts of wireless network security and firewalls

CO5 (Cognitive Knowledge Level: Understand)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern
Continuous Assessment Tests End Semester
Bloom’s Category
Test 1 (%) Test 2 (%) Examination (%)

Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Module – 1 (Network Security Basics)
Introduction to network security - Security requirements, Challenges of security, Network
security model. Malicious programs – Worms, Viruses, Trojans, Spyware, Adware. Intrusion
Detection Systems (IDS) - Uses, Techniques. Digital signatures - ElGamal, Schnorr, Digital
Signature Standard (DSS).

Module – 2 (Network Security Standards)

Kerberos v4 – Configuration, Authentication, Encryption, Message formats. Kerberos v5 –
Cryptographic algorithms, Message formats. Public Key Infrastructure (PKI) – Trust models,
Revocation. Real-time communication security – Perfect Forward Secrecy (PFS), Denial-of-
Service protection, Endpoint identifier hiding, Live partner reassurance. Internet Protocol Security
(IPSec) - Authentication Header (AH), Encapsulating Security Payload (ESP), Internet Key
Exchange (IKE) phases.

Module – 3 (Email Security)

Introduction to email security - Security services for email, Establishing keys, Privacy,
Authentication, Message integrity, Non-repudiation. Privacy Enhanced Mail (PEM) – Encryption,
Source authentication and integrity protection, Message formats. Secure/Multipurpose Internet
Mail Extensions (S/MIME) – Messages, Differences from PEM. Pretty Good Privacy (PGP) -
Encoding, Certificate and key revocation, Anomalies, Object formats.

Module – 4 (Web Security)

Introduction to web security - Web security considerations, Threats. Secure Sockets Layer (SSL)
– Architecture, Protocols, Transport Layer Security (TLS) – Differences from SSL. Hypertext
Transfer Protocol Secure (HTTPS) – Connection initiation, Closure. Secure Shell (SSH) –
Transport layer protocol, User authentication protocol, Connection protocol.

Module – 5 (Wireless Network Security and Firewalls)

IEEE 802.11 Wireless LAN - Network components, Architectural model, Services. IEEE 802.11i
wireless LAN security - Services, Phases of operation. Wired Equivalent Privacy (WEP), Wi-Fi
Protected Access (WPA), WPA2, Wireless Application Protocol (WAP) – Services, Protocol
architecture. Firewalls – Need for firewalls, Packet filters, Circuit-level firewalls, Application
layer firewalls.

Text Books
1. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private Communication in a
Public World”, 2/e, PHI.
2. William Stallings, “Cryptography and Network Security Principles and Practice”, 5/e,
Pearson
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Education Asia.

References
1. Behrouz A. Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”, 3/e,
Tata McGraw Hill.
2. Tyler Wrightson, “Wireless Network Security A Beginner’s Guide”, 2012, Tata McGraw Hill.
3. William Stallings, “Network Security Essentials: Applications and Standards”, 4/e, Prentice
Hall.
4. Schiller J., Mobile Communications, 2/e, Pearson Education.
5. Roberta Bragg et. al., “Network Security: The Complete Reference”, Tata McGraw Hill.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Using the Schnorr digital signature scheme, let q = 83, p = 997 and d = 23. Find values for
e1 and e2.
2. The Digital Signature Algorithm (DSA) specifies that if the signature generation process
results in a value of zero, a new value of k should be generated and the signature should be
recalculated. Give reason.

Course Outcome 2 (CO2):

1. In Kerberos v4, the authenticator field is not of security benefit when asking the Key
Distribution Center (KDC) for a ticket for Bob, but useful when logging in as Bob. Give
reasons for your answer.
2. How does the stateless cookie protocol provide clogging protection?

Course Outcome 3 (CO3):

1. If Alice is sending an ENCRYPTED message, she first signs the message digest with her
private key and then encrypts the message digest with the pre-message secret key. Why
this last encryption was considered necessary for encrypted messages and not for MIC-
CLEAR or MIC-ONLY?
2. Which security services are considered desirable in the following cases? (i) Sending a
purchase order (ii) Sending a ransom note. (iii) Sending a mission description to security
officials.
3. Explain the security mechanism used in Gmail communication.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 4 (CO4):

1. possible in SSL for the receiver to reorder SSL record blocks that arrive out of order?If
so, how it can be done? If not, why?
2. Describe any five web security threats, their consequences and countermeasures.

Course Outcome 5 (CO5):

1. Explain the security areas addressed by IEEE 802.11i.
2. Describe the advantages and disadvantages of application layer firewalls.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:
Reg. No: _
Name: PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH. DEGREE (HONORS) EXAMINATION, MONTH &YEAR
Course Code: CST 394

Course Name: Network Security

Max.Marks:100 Duration: 3 Hours

PART A
Answer all Questions. Each question carries 3 Marks
1.
Distinguish between signature-based and anomaly-based intrusion detection
techniques.

2.
A trusted third party is considered as a main component in a network security
model. Why?

3.
How is endpoint identifier hiding achieved in real-time communication?

4.
Show how encryption is used to provide privacy and integrity in Kerberos v5.

5.
End-to-end privacy is essential for e-mail security. How is this achieved?

6.
List the four steps for preparing an EnvelopedData MIME entity.

7.
Show the operation of a Secure Sockets Layer (SSL) Record protocol.

8.
For Secure Shell (SSH) packets, what is the advantage of not including the MAC
in the scope of packet encryption?

9.
List the three security services provided by IEEE 802.11i.

10.
Define the terms Access Point, Basic Service Set, Extended Service Set.
(10x3=30)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a)
Using the ElGamal scheme, let p = 881 and d = 700, find values for e1 and
(8)
e2. Choose r = 17. Find the value of S1 and S2 if M = 400.

(b)
Explain the requirements and challenges of network security.
(6)

OR
12. (a)
In ElGamal, Schnorr and DSS, what happens if an attacker can find the value
(8)
of random secret key used by the signer? Also, what happens if a user uses
the same value of random secret key to sign two messages? Explain your
answer for each scheme separately.

(b) (6)
Explain the network security model with the help of a neat diagram.
13. (a)
Alice wishes to log into Bob’s workstation remotely. List the steps involved
(7)
in this communication if Kerberos v4 is used.

(b)
How does Diffie-Hellman technique provide perfect forward secrecy using
(7)
signature keys?

OR
14. (a) (8)
Explain the algorithm for Message Authentication Code (MAC) calculation
and verification in Kerberos v5 rsa-md5-des.

(b) (6)
Compare the aggressive mode and main mode of Phase 1 Internet Key
Exchange (IKE).
15. (a) (7)
Describe the different methods by which authentication of source is
performed in email communication.

(b) (7)
Explain the Signed data and Clear-signed data functions provided by
S/MIME.

OR
16. (a) (7)
Explain the advantages of Pretty Good Privacy (PGP) over Privacy
Enhanced Mail (PEM).
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) (7)
Define non-repudiation. Describe the different ways by which it is
implemented in email communication.

17. (a) Describe the significance of pseudo-random function of Transport Layer (7)
Security.

(b) (7)
Explain the four different phases of Secure Sockets Layer (SSL)
HandshakeProtocol.

OR

18. (a) Describe how connection initiation and connection closure is done in Hyper (7)
Text Transfer Protocol Secure (HTTPS).

(b) (7)
Illustrate the sequence of events in Secure Shell (SSH) transport layer
protocol packet exchanges.

19. (a) Explain the Discovery phase and Authentication phase of IEEE 802.11i (7)
operation.

(b) (7)
Why are firewalls needed? Compare the features of packet filters and circuit
level firewalls.

OR

20. (a) Explain the two authentication methods used in Wired Equivalent Privacy (7)
(WEP).

(b) (7)
Describe the three transaction classes provided by Wireless Transaction
Protocol.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No of
No Contents Lecture
Hrs

Module - 1 (Network Security Basics) (7 hrs)

1.1 Security requirements, Challenges of security 1

1.2 Network security model 1

1.3 Worms, Viruses, Trojans, Spyware, Adware 1

1.4 Intrusion Detection Systems (IDS) uses, Techniques 1

1.5 ElGamal digital signature 1

1.6 Schnorr digital signature 1

1.7 Digital Signature Standard (DSS) 1

Module - 2 (Network Security Standards) (12 hrs)

2.1 Kerberos v4 configuration, Authentication 1

2.2 Kerberos v4 encryption 1

2.3 Kerberos v4 message formats 1

2.4 Kerberos v5 cryptographic algorithms – rsa-md5-des, des-mac, des-mac-k 1

Kerberos v5 cryptographic algorithms - rsa-md4-des, rsa-md4-des-k, 1

2.5
Encryption for privacy and integrity

2.6 Kerberos v5 message formats 1

2.7 Public Key Infrastructure (PKI) trust models 1

2.8 PKI revocation 1

2.9 Perfect Forward Secrecy (PFS), Denial-of-Service protection 1

2.10 Endpoint identifier hiding, Live partner reassurance 1

Internet Protocol Security (IPSec) Authentication Header (AH), 1

2.11
Encapsulating Security Payload (ESP)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1
2.12 Internet Key Exchange (IKE) phases

Module - 3 (Email Security) (9 hrs)

3.1 Security services for email, Establishing keys, Privacy 1

3.2 Authentication, Message integrity, Non-repudiation 1

3.3 Privacy Enhanced Mail (PEM) encryption, Source authentication 1

3.4 PEM integrity protection, Message formats (Lecture 1) 1

3.5 PEM message formats (Lecture 2) 1

Secure/Multipurpose Internet Mail Extensions (S/MIME) – Messages, 1

3.6
Differences from PEM

Pretty Good Privacy (PGP) encoding, Certificate and key revocation, 1

3.7
Anomalies

3.8 PGP Object formats (Lecture 1) 1

3.9 PGP Object formats (Lecture 2) 1

Module – 4 (Web Security)(9 hrs)

Web security considerations, Threats, Secure Sockets Layer (SSL)

4.1 1
architecture

4.2 SSL protocols (Lecture 1) 1

4.3 SSL protocols (Lecture 2) 1

4.4 Transport Layer Security (TLS) differences from SSL (Lecture 1) 1

4.5 TLS differences from SSL (Lecture 2) 1

4.6 Hypertext Transfer Protocol Secure (HTTPS) connection initiation, Closure 1

4.7 Secure Shell (SSH) transport layer protocol 1

4.8 SSH user authentication protocol 1

4.9 SSH connection protocol 1

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module - 5 (Wireless Security and Firewalls) (8 hrs)

IEEE 802.11 Wireless LAN network components, Architectural model, 1

5.1
Services
IEEE 802.11i wireless LAN security services, Phases of operation (Lecture 1
5.2
1)

5.3 IEEE 802.11i phases of operation (Lecture 2) 1

5.4 Wired Equivalent Privacy (WEP), Wi-Fi Protected Access (WPA), WPA2 1

Wireless Application Protocol (WAP) services, Protocol architecture 1

5.5
(Lecture 1)

5.6 WAP protocol architecture (Lecture 2) 1

5.7 Need for firewalls, Packet filters 1

5.8 Circuit-level firewalls, Application layer firewalls 1

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

MACHINE LEARNING CATEGORY L T P Credit Year of

IN COMPUTATIONAL Introduction
AIT 396 BIOLOGY
Honors 3 1 0 4 2020

Preamble:
This course is intended to provide the learners a outlook towards application of Machine learning
algorithms in the field of computational biology. This course helps the learners to apply the
Machine learning methods - clustering algorithms, dimensionality reduction, decision trees,
Artificial Neural Network, Support Vector Machine to the computational biology problems. Also
the course discuss Challenges of Machine Learning in Computational Biology and Future
directions of Machine Learning in Computational Biology.

Prerequisite: Basic background in Bioinformatics and Machine Leaning

Course Outcomes: After the completion of the course, the student will be able to
CO 1 Describe the basic concepts of Machine Leaning, Classification, regression and
clustering problems, parameters and measures (Cognitive knowledge level:
Understand)
CO 2 Demonstrate the clustering algorithm on computational biology problems
(Cognitive knowledge level: Apply)
CO 3 Explain Dimensionality reduction techniques and Decision Trees in computational
biology (Cognitive knowledge level : Apply)
CO 4 Illustrate Feature Extraction and Pattern recognition and Classification in the domain
of Computational Biology analysis (Cognitive knowledge level: Apply)

CO 5 Explain the role and challenges of Machine Learning in Computational (Cognitive

knowledge level: Understand)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO# Broad PO# Broad

PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work
solutions
Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Bloom’s Category Continuous Assessment Tests End Semester Examination
Test1 (%) Test2 (%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of Series Tests 1& 2) 25 marks
Continuous Assessment Assignment 15 marks
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test
shall be preferably conducted after completing the first half of the syllabus and the second
series test shall be preferably conducted after completing remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly completed
module), having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly completed
module), each with 7 marks. Out of the 7 questions, a student should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contain 10 questions with 2 questions
from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 full questions from each module of which student should answer any
one. Each question can have maximum 2 sub-divisions and carries 14 marks.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Machine Learning in Computational Biology

Module 1 (Overview of Machine Learning)

Overview of Machine Learning, fitting predictive models to data, Supervised and unsupervised
learning, Classification, regression and clustering problems, Loss or cost functions. Parameters
and hyperparameters, Training. validation and testing, Inductive bias and the bias variance
trade-off, Use of clustering models.

Module 2 (Clustering problems Computational Biology)

Hierarchical Clustering, Partition Clustering, Overview Model-Based Clustering, k-Means
clustering, k-Means clustering algorithm, Advantages, Disadvantages, illustrative example of
k-Means clustering, Clustering for creating phylogenetic trees, Using Clustering Approach to
Identify Patients’ Subtypes, Application of clustering algorithms on gene expression data.

Module 3 (Supervised techniques for Computational Biology)

Proteomics Dataset, Data Pre-processing Algorithms, Dimension and Feature Subset Selection,
Dimensionality reduction - Principal Component Analysis (PCA), Partial Least Square (PLS),
Linear Discriminant Analysis (LDA), Protein Classification, Decision Trees in Bioinformatics,
Proteomic Mass Spectra Classification Using Decision Tree Technique.

Module 4 (Machine-Learning Algorithms for Computational Biology)

Machine-Learning Algorithms for Feature Selection from Gene Expression Data, Feature
Extraction and Pattern recognition from sequence data, measures of a Feature. Artificial Neural
Network (ANN) in Bioinformatics, Genetic Algorithms (GA) in Bioinformatics, Designing
ANN for Bioinformatics, ANN in Protein Bioinformatics, Support Vector Machine with
Feature Elimination.

Module 5 (Scope of Machine Learning in Computational Biology)

Role of Machine Learning in Computational Biology, Creation and analysis of sequence data,
Challenges of Machine Learning in Computational Biology, Data Errors, Mean Square Error
Generative versus Discriminative, Approximation Versus Explanation, Single Versus Multiple
Methods, Future directions of Machine Learning in Computational Biology.

Books
1. Statistical Modelling and Machine Learning Principles for Bioinformatics Techniques,
Tools, and Applications. Germany, Springer Singapore, 2020.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Yang, ZhengRong. Machine Learning Approaches to Bioinformatics. Singapore, World

Scientific Publishing Company, 2010.

References
1. Izadkhah, Habib. Deep Learning in Bioinformatics: Techniques and Applications in
Practice. Netherlands, Elsevier Science, 2022.
2. Agapito, Giuseppe, et al. Artificial Intelligence in Bioinformatics: From Omics Analysis
to Deep Learning and Network Mining. Netherlands, Elsevier Science, 2022.
3. Data Analytics in Bioinformatics: A Machine Learning Perspective. United
States, Wiley, 2021.
4. Michailidis, George, et al. Introduction to Machine Learning and Bioinformatics. United
Kingdom, CRC Press, 2008.
5. Zhang, Yanqing, and Rajapakse, Jagath C, Machine Learning in Bioinformatics,
Germany, Wiley, 2009.
6. Baldi, Professor Pierre, et al. Bioinformatics, Second Edition: The Machine Learning
Approach. India, Bradford, 2001.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare and contrast Supervised and unsupervised learning
2. Differentiate Classification with regression with an example
3. Explain the parameters and hyperparameters of a model?
4. Summarize validation and testing in machine learning?

Course Outcome 2 (CO2):

1. Write K-means algorithm and separate {5, 11, 19, 27, 23, 25, 6, 18, 2, 8, 10, 12,
31, 29, 4} into 3 clusters
2. Illustrate application of clustering algorithms on gene expression data
3. Differentiate K-means clustering and hierarchical clustering

Course Outcome 3 (CO3):

1. Illustrate dimensionality reduction methods - Principal Component Analysis (PCA),
Partial Least Square (PLS), Linear Discriminant Analysis (LDA)
2. Explain Decision trees in Bioinformatics with a toy example.

Course Outcome 4 (CO4):

1. Explain the process involved in feature extraction and pattern recognition from
sequence data
2. Design and implement an ANN model for the prediction of relative solvent
accessibility

Course Outcome 5 (CO5):

1. Summarize role of Machine Learning in Computational Biology
2. Explain Challenges of Machine Learning approaches in Computational Biology
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES: 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH (Honors) DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 396

Course Name: MACHINE LEARNING IN COMPUTATIONAL BIOLOGY

Max. Marks: 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. What does the regression line equation tell you? (3)

2. How do you create a predictive data model using machine learning? (3)

3. Write the major differences between K-means clustering and hierarchical (3)
clustering

4. List any three resources of Proteomics Datasets (3)

5. What is the importance of using PCA before applying Machine learning method? (3)

6. Draw example of an ANN architecture including 4 independent variables, one (3)

hidden layer with 3 hidden neurons and 2 dependent variables

7. What is the role of the Activation functions in Neural Networks? (3)

8. What is Hinge Loss in SVM? (3)

9. What is mean square error? how will you evaluate it? (3)

10. What are discriminative machine learning models? (10x3=30

)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) With example, differentiate Supervised and unsupervised learning (7)

(b) What is loss function and cost function in machine Learning. write the (7)
difference and example of loss function and cost function

OR
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

12. (a) Define Train, Validation, and Test Datasets. how do you divide the data into (7)
Train, Validation, and Test Datasets.

(b) Explain Classification, regression and clustering methods with examples of (7)
each

13. (a) Use K Means clustering to cluster the following data into two groups. (7)
Assume cluster centroid are m1=2 and m2=4. The distance function used is
Euclidean distance. { 2, 4, 10, 12, 3, 20, 30, 11, 25 }

(b) Illustrate with a toy example the application of clustering algorithms on gene (7)
expression data

OR

14. (a) Explain the advantages, disadvantages of k-Means clustering (7)

(b) What is the advantage of using hierarchical clustering over K means (7)
clustering? When to use the hierarchical clustering?

15. (a) Explain Dimension and Feature Subset Selection (7)

(b) 20 physicochemical properties of 100 set of proteins were given with the help (7)
of PCA, explain how will you reduce 20x100 in to Five properties (5x100)
for the next level analysis

OR

16. (a) Explain how Linear Discriminant Analysis can be used for the dimensionality (7)
reduction with the help of a scenario in computational biology

(b) How do decision tree classifiers work? what types of problems can they solve (7)
in Computational Biology

17. (a) Explain the process of Feature Extraction and Pattern recognition from (7)
sequence data

(b) Illustrate the design of Artificial Neural Network for solving Computational (7)
Biology question

OR

18. (a) Explain crossover and mutation in genetic algorithm with an example (7)

(b) Explain how to construct a support vector machine (SVM) to classify ovarian (7)
cancer from 30 individuals from the 15 features obtained from each patient.

19. (a)
a What role does machine learning and have to play in Computational Biology? (7)

(b) Explain different kinds of Data Errors in Machine Learning that would (7)
happen in case of applying it in to the Computational Biology domain?

OR

20. (a) What are the advantages and disadvantages of application of machine (7)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

learning in Computational Biology?

(b) “The transformation of huge volume of data into knowledge is the biggest (7 )
challenge faced in computational biology” How can machine learning
techniques help in this?

TEACHING PLAN

No Contents No of Lecture
(45 Hrs)
Module 1 (Overview of Machine Learning) (9 hrs)
1.1 Overview of Machine Learning 1
1.2 Fitting predictive models to data 1
1.3 Supervised and unsupervised learning 1
1.4 Classification, regression and clustering problems 1
1.5 Loss or cost functions 1
1.6 Proteins and peptides 1
1.7 Parameters and hyperparameters 1
1.8 Training. validation and testing 1
1.9 Inductive bias and the bias variance trade-off, Use of 1
clustering models
Module 2 (Clustering problems Computational Biology) (9 hrs)
2.1 Hierarchical Clustering 1
2.2 Partition Clustering, Overview Model-Based Clustering 1
2.3 k-Means clustering, k-Means clustering algorithm 1
2.4 k-Means clustering advantages, disadvantages 1
2.5 illustrative example of k-Means clustering 1
2.6 Clustering for creating phylogenetic trees 1
2.7 Using Clustering Approach to Identify Patients’ Subtypes 1
2.8 Application of clustering algorithms on gene expression data 1
2.9 Application of clustering algorithms on gene expression data 1
Module 3 (Supervised techniques for Computational Biology) (9 hrs)
3.1 Proteomics Datasets 1
3.2 Data Pre-processing Algorithms 1
3.3 Dimension and Feature Subset Selection 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.4 Dimensionality reduction 1

3.5 Principal Component Analysis (PCA) 1
3.6 Partial Least Square (PLS), Linear Discriminant Analysis 1
(LDA)
3.7 Protein Classification case study 1
3.8 Decision Trees in Bioinformatics 1
3.9 Proteomic Mass Spectra Classification Using Decision Tree 1
Technique

Module 4 (Machine-Learning Algorithms for Computational Biology) (8 hrs)

4.1 Machine-Learning Algorithms for Feature Selection from Gene 1
Expression Data
4.2 Feature Extraction and Pattern recognition from sequence data 1
4.3 Measures of a Feature 1
4.4 Artificial Neural Network (ANN) in Bioinformatics 1
4.5 Genetic Algorithms (GA) in Bioinformatics 1
4.6 Designing ANN for Bioinformatics 1
4.7 Designing ANN for Bioinformatics 1
4.8 ANN in Protein Bioinformatics 1
4.9 Support Vector Machine with Feature Elimination. 1

Module 5 (Scope of Machine Learning in Computational Biology) (10 hrs)

5.1 Role of Machine Learning in Computational Biology 1
5.2 Creation and analysis of sequence data 1
5.3 Challenges of Machine Learning in Computational Biology 1
5.4 Data Errors in Machine Learning, Mean Square Error 1
5.5 Generative versus Discriminative 1
5.6 Approximation Versus Explanation 1
5.7 Single Versus Multiple Methods 1
5.8 Future directions of Machine Learning in Computational Biology 1
5.9 Future directions of Machine Learning in Computational Biology 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT IMAGE AND VIDEO Category L T P Credit Year of

398 PROCESSING Introduction
HONORS 3 1 0 4 2020

Preamble:

This course enables the learners to understand how digital images are stored and processed. The learners
are exposed to different spatial and frequency domain methods for image enhancement, image restoration
techniques, morphological operations that could be performed on digital images and also various image
and video compression techniques. The course also gives an introduction to the basics of video processing
and video segmentation.

Prerequisite: Advanced Computer Graphics, Advanced Concepts in Computer Vision

Mapping of course outcomes with program outcomes

CO1 Summarize the steps of digital image processing and pixel relationships. (Cognitive
Knowledge Level: Understand)

CO2 Apply spatial and frequency domain methods for image enhancement. (Cognitive
Knowledge Level: Apply

CO3 Apply restoration techniques and morphological operations on digital images.

(Cognitive Knowledge Level: Apply)

CO4 Compare different methods for digital image and video compression. (Cognitive
Knowledge Level: Apply)

CO5 Understand the basics of video processing and video segmentation. (Cognitive
Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
1 0 2

CO1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester
Categor Examination
y Test 1 (%) Test 2 (%) Marks (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze

Evaluate

Create
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration

150 50 100 3 hrs

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have a maximum of 2 subdivisions and carries 14 marks.

Syllabus
Module – 1
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Fundamentals of Image processing: Basic steps of Image processing system, sampling and
quantization of an Image, basic relationship between pixels and connectivity.
Image Enhancement: Spatial Domain methods - Gray level transformations, Histogram
Processing, Fundamentals of Spatial Filtering, Smoothing Spatial filters, Sharpening Spatial
filters.
Module -2
Image Transforms: Unitary transforms, 2D Discrete Fourier Transform, Discrete Cosine
Transform (DCT), Discrete Wavelet transforms.
Frequency Domain methods: Basics of filtering in frequency domain, image smoothing,
image sharpening, homomorphic filtering.
Module - 3
Image Restoration: Image degradation/Restoration model, Noise models, Restoration in
presence of noise only - spatial filtering, Periodic Noise reduction by frequency domain
filtering.
Morphological Operations: Erosion, Dilation, Opening, Closing, Hit-or-miss transformation,
Boundary extraction.
Module - 4
Image compression fundamentals – Coding Redundancy, spatial and temporal redundancy.
Compression models : Lossy and Lossless, Huffman coding, Arithmetic coding, LZW coding,
run length coding, Bit Plane coding, JPEG standards.
Module - 5
Video processing: Basics of Video Processing: Analog video, Digital Video.
Video segmentation: Introduction to video segmentation, Change detection.
Video Compression: Introduction to video compression, video compression based on motion
compensation, Search for motion vectors, H.261 standard, Transform coding, predictive coding-
MPEG.

Text Books
1. Gonzalez and Woods , “Digital Image Processing”, 3rd edition , Pearson, 2009.
2. Li, Ze-Nian, Mark S. Drew, and Jiangchuan Liu. “Fundamentals of multimedia”, Pearson
Prentice Hall, 2004.
3. Bovik, Alan C. “Handbook of image and video processing”, Academic press, 2010.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Reference Books
1. David A. Forsyth & Jean Ponce, Computer vision – A Modern Approach, Prentice Hall,
2002.
2. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer.
3. Maheshkumar H Kolekar, “Intelligent Video Surveillance Systems: An Algorithmic
Approach”, CRC Press.
4. Francesco Camastra, Alessandro Vinciarelli, “Machine Learning for Audio, Image and Video
Analysis: Theory and Applications”, Springer 2015.
5. M. Tekalp ,”Digital video Processing”, Prentice Hall International
6. Relf, Christopher G.,"Image acquisition and processing with LabVIEW", CRC press
7 Chris Solomon, Toby Breckon ,"Fundamentals of Digital Image Processing A Practical
Approach with Examples in Matlab", John Wiley & Sons,
8. Yao wang, Joem Ostarmann and Ya – quin Zhang, ”Video processing and communication
“,1st edition , PHI

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Illustrate how the image is digitized by sampling and quantization.
2. Let V = {1,2} and compute the length of the shortest 4-, 8-, and m path between p and q.
If a particular path does not exist between these two points explain why.
3 1 2 1q
2 2 0 2
1 2 1 1
p1 0 1 2

Course Outcome 2(CO2):

1. Determine whether the given matrix is unitary or not:

2. Explain any five properties of 2D Fourier Transform.

Course Outcome 3(CO3):

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Discuss how restoration is done in digital images.

2. Explain with examples the different morphological operations applied to images.

Course Outcome 4(CO4): .

1. With suitable examples, clearly bring out the need for compression in images and videos.
2. Discuss any one method for finding motion vectors.

Course Outcome 5(CO5):

1. Explain any one technique used for segmenting a video.

2. Compare and contrast analog video and digital video in multimedia.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 398

Course Name: Image and Video Processing

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1.
Explain bit plane slicing and contrast stretching.

2.
Discuss about pixel relationships.
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Find the 4 order forward and inverse DFT for the following image segment:

1 1 1 1

1 1 1 1

1 1 1 1

1 1 1 1

4. Define DCT. Write the properties of DCT.

5. Discuss hit or miss transformation with appropriate examples.

6. Explain about the morphological operation dilation.

7. Explain the significance of image compression.

8. Distinguish between lossy and lossless compression.

9. Discuss the significance of change detection.

10. Explain how transform coding is used in compression algorithms.

(10x3=30
)

Part B
(Answer any one question from each module. Each question carries 14 Marks)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

11. (a) Perform histogram specification of the following 3 bit gray scale image (9)
whose gray level distribution is given as follows.

(b) Design Laplacian filter for image enhancement in spatial domain. (5)

OR

12. (a) What is histogram equalization? Explain the procedure for histogram (7)
equalization.

(b) Explain the gray level transformation functions: a) image negatives and b) (7)
log transformation c) power law transformation.

13. (a) (4)

Compute the 2D DFT of the 4 X 4 grayscale image given below.

(b) Explain about smoothing and sharpening frequency domain filters. (10)

OR

14. (a) Explain Butterworth filters for image smoothening and image sharpening. (4)

(b) Explain the steps followed in frequency domain filtering? (5)

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

15. (a) Apply opening and closing operation on the image sample A given below (10)
with structuring element B

(b) Explain Morphological operations a) opening b) closing with suitable (4)

examples.

OR

16. (a) Discuss about different noise models. (7)

(b) Explain how periodic noise reduction can be done using frequency domain (7)
filtering.

17. (a) Comment on JPEG compression standard. (8)

(b) Discuss on run-length encoding with the help of an example. (6)

OR

18. (a) Explain LZW coding with the help of a suitable example. (8)

(b) Illustrate the concept of arithmetic coding. (6)

19. (a) Compare and contrast MPEG video coding and H.261 standard. (7)

(b) Explain video segmentation with an example. (7)

OR

20. (a) Illustrate how motion compensation is used in video compression. (7)
 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) With the help of a neat block diagram explain predictive coding methods. (7)

Teaching Plan

No Contents No. of Lecture

Hours
(44 hrs)

Module – 1 (7 hours)

1.1 Fundamentals of Image processing: Basic steps of Image 1 hour

processing system, Sampling and quantization of an Image.

1.2 Basic relationship between pixels and connectivity. 1 hour

1.3 Image Enhancement: Gray level transformations 1 hour

1.4 Histogram, Histogram Equalization 1 hour

1.5 Histogram specification 1 hour

1.6 Fundamentals of Spatial Filtering 1 hour

1.7 Smoothing Spatial filters 1 hour

1.8 Sharpening Spatial filters 1 hour

Module-2 (8 hours)

2.1 Image Transforms: Unitary transforms. 1 hour

2.2 2D Discrete Fourier Transform 1 hour

2.3 Discrete Cosine Transform (DCT) 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.4 Discrete Wavelet transforms 1 hour

2.5 Basics of filtering in frequency domain 1 hour

2.6 Image smoothing 1 hour

2.7 Image sharpening 1 hour

2.8 Homomorphic filtering. 1 hour

Module-3 (9 hours)

3.1 Image Restoration: Image degradation/Restoration model 1 hour

3.2 Noise models 1 hour

3.3 Restoration basics 1 hour

3.4 Restoration in presence of noise only - spatial filtering 1 hour

3.5 Periodic Noise reduction by frequency domain filtering. 1 hour

3.6 Morphological Operations: basics 1 hour

3.7 Erosion, Dilation, Opening, Closing 1 hour

3.8 Hit-or-miss transformation 1 hour

3.9 Boundary extraction. 1 hour

Module-4 (10 hours)

4.1 Image compression fundamentals - Coding Redundancy 1 hour

4.2 Spatial and temporal redundancy. 1 hour

4.3 Compression models : Lossy and Lossless 1 hour

 B TECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.4 Huffman coding 1 hour

4.6 Arithmetic coding 1 hour

4.7 LZW coding 1 hour

4.8 Run length coding 1 hour

4.9 Bit Plane coding, 1 hour

4.10 JPEG standards 1 hour

Module-5 (10 hours)

5.1 Basics of Video Processing: Analog video, Digital Video. 1 hour

5.2 Video segmentation: Introduction to video segmentation 1 hour

5.3 Change detection. 1 hour

5.4 Introduction to video compression 1 hour

5.5 Video compression based on motion compensation 1 hour

5.6 Search for motion vectors 1 hour

5.7 Transform coding 1 hour

5.8 Predictive coding 1 hour

5.9 MPEG standards 1 hour

5.10 H.261 standard 1 hour

 BTECH ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
B TECH ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

SEMESTER –VII
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

AIT FOUNDATIONS OF CATEGOR L T P CREDIT

401 DEEP LEARNING Y

PCC 2 1 0 3

Preamble: Study of this course provides the learners an overview of the concepts and algorithms
involved in deep learning. The course covers the basic concepts in neural networks, deep learning,
optimization techniques, regularization techniques, convolutional neural networks, recurrent neural
networks, autoencoders, generative models. The students will be able to implement deep learning
algorithms to solve real-world problems.

Prerequisite: Machine learning concepts

Course Outcomes: After the completion of the course the student will be able to

Illustrate the basic concepts of neural networks, deep learning and its practical
CO 1 issues (Cognitive Knowledge Level : Apply)

Outline the standard regularization and optimization techniques for the effective
CO 2 training of deep neural networks. (Cognitive Knowledge Level: Understand)

Build convolutional Neural Network (CNN) models for different use cases.
CO 3 (Cognitive Knowledge Level: Apply)

Apply the concepts of Recurrent Neural Network (RNN), Long Short Term
Memory( LSTM), Gated Recurrent Unit (GRU). (Cognitive Knowledge Level:
CO 4 Apply)

Explain the concepts of auto encoder, generative models (Cognitive Knowledge

CO 5 Level: Understand)

Mapping of course outcomes with program outcomes

 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATALEARNING
SCIENCE

PO PO PO PO PO PO6 PO PO PO PO PO1 PO
1 2 3 4 5 7 8 9 10 1 12

CO1

CO2

CO3

CO4

CO5
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

End
Test1 Test2
Semester
Bloom’s Category (percentage) (percentag
Examinati
e)
on Marks

Remember 20 20 20

Understand 40 40 40

Apply 40 40 40

Analyse

Evaluate

Create

Mark distribution
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATALEARNING
SCIENCE

Total Marks CIE ESE ESE

Duratio
Marks Mark
n
s
150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance: 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment: 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly covered module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a student
should answer any 5.

End Semester Examination Pattern:

 BTECH BARTIFICIAL INTELLIGENCE
TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATA LEARNING
SCIENCE

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which a student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module 1: Introduction to Neural Networks and Deep learning

Introduction, The Basic Architecture of Neural Networks - Single Computational Layer: The
Perceptron, Multilayer Neural Networks. Activation functions – Sign, Sigmoid, Tanh, ReLU, leaky
ReLU, Hard Tanh, Softmax. Loss function. Training a Neural Network with Backpropagation.
Practical issues in neural network training. Overfitting, Underfitting, Hyper parameters and Validation
sets, Estimators -Bias and Variance.Introduction to deep learning, Deep feed forward network.

Module 2: Training deep models

Introduction, setup and initialization- Kaiming, Xavier weight intializations, Vanishing and exploding
gradient problems, Optimization techniques - Gradient Descent (GD), Stochastic GD, GD with
momentum, GD with Nesterov momentum, AdaGrad, RMSProp, Adam., Regularization Techniques -
L1 and L2 regularization, Early stopping, Dataset augmentation, Parameter tying and sharing,
Ensemble methods, Dropout, Batch normalization.

Module 3: Convolutional Neural Networks

Convolutional Neural Networks –Architecture, Convolution operation, Motivation, pooling .Variants

of convolution functions, Structured outputs, Data types, Efficient convolution algorithms,
Applications of Convolutional Networks, Pre-trained convolutional Architectures : AlexNet, ZFNet,
VGGnet-19, ResNet-50.
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

Module 4: Recurrent Neural Networks

Recurrent neural networks – Computational graphs. RNN design. Encoder – decoder sequence to
sequence architectures. Language modeling example of RNN. Deep recurrent networks. Recursive
neural networks. Challenges of training Recurrent Networks. Gated RNNs LSTM and GRU.

Case study: BERT, Social Media Sentiment Analysis.

Module 5: Auto-encoders and Generative models.

Autoencoders, Variational Auto-Encoder-under complete Auto-encoder, stochastic encoder,

denoising encoder, Applications of Autoencoders. Generative models - Boltzmann machines, Deep
Belief Networks, Generative Adversarial Networks.

Reference Books

1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Neural Networks and Deep Learning, Aggarwal, Charu C., c Springer International Publishing
AG, part of Springer Nature 2018
3. Deep Learning, Core Conceps, Methods and Applications- M Gopal, Pearson Education
4. Fundamentals of Deep Learning: Designing Next-Generation Machine Intelligence Algorithms
(1st. ed.). Nikhil Buduma and Nicholas Locascio. 2017. O'Reilly Media, Inc.
Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Suppose you have a 3-dimensional input x = (x1, x2, x3) = (2, 2, 1) fully connected with
weights (0.5, 0.3, 0.2) to one neuron which is in the hidden layer with sigmoid activation
function. Calculate the output of the hidden layer neuron.
2. Consider the case of the XOR function in which the two points {(0, 0),(1, 1)} belong to one
class, and the other two points {(1, 0),(0, 1)} belong to the other class. Design a multilayer
perceptron for this binary classification problem.
3. Sketch the typical learning curves for the training and validation sets, for a setting where
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

overfitting occurs at some point. Assume that the training set and the validation set are of the
same size.

Course Outcome 2 (CO2):

1. Explain how L2 regularization improves the performance of deep feed forward neural
networks.
2. Explain how L1 regularization method leads to weight sparsity.
3. Derive update rules for parameters in the multi-layer neural network through the gradient
descent.
Course Outcome 3(CO3):

1. Give two benefits of using convolutional layers instead of fully connected ones for visual tasks.
2. Suppose that a CNN was trained to classify images into different categories. It performed well
on a validation set that was taken from the same source as the training set but not on a testing
set. What could be the problem with the training of such a CNN? How will you ascertain the
problem? How can those problems be solved?
3. Weight sharing allows CNNs to deal with image data without using too many parameters. Does
weight sharing increase the bias or the variance of a model?
Course Outcome 4 (CO4):

1. Illustrate the workings of the RNN with an example of a single sequence defined on a
vocabulary of four words.
2. List the differences between LSTM and GRU
3. Show the steps involved in an LSTM to predict stock prices.Give one advantage of using an
RNN rather than a convolutional network.
Course Outcome 5 (CO5):

1. Is an autoencoder for supervised learning or for unsupervised learning? Explain briefly.

2. List the difference between Boltzmann Machine and Deep Belief Network.
 BTECHB ARTIFICIAL INTELLIGENCE
TECH ARTIFICIAL ANDAND
INTELLIGENCE MACHINE LEARNING
DATA SCIENCE

Model Question paper

QP CODE: PAGES:3
Reg No:
Name :

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: AIT 401

Course Name: Foundations of Deep Learning

Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. Illustrate the limitation of a single layer perceptron with an example

2. Specify the advantages of ReLU over sigmoid activation function.
3. Derive weight updating rule in gradient descent when the error function is a) mean squared
error b) cross entropy
4. List any three methods to prevent overfitting in neural networks
5. Illustrate the strengths and weaknesses of convolutional neural networks.
6. What happens if the stride of the convolutional layer increases? What can be the maximum
stride? Justify your answer
7. List the differences between LSTM and GRU
8. How does a recursive neural network work?
9. List the difference between Boltzmann Machine and Deep Belief Network.
10. How does the variational auto-encoder(VAE) architecture allow it to generate new data points,
compared to auto-encoder, which cannot generate new data points?
(10x3=30)

Part B
Answer any one Question from each module. Each question carries 14 Marks
11.
 BTECH ARTIFICIAL
B TECH INTELLIGENCE
ARTIFICIAL AND
INTELLIGENCE MACHINE
AND LEARNING
DATA SCIENCE

a. Explain back propagation algorithm for neural network training. (9 marks)

b. “How does bias and variance trade-off affect machine learning algorithms? (5 marks)
OR
12.
a. With an example classification problem, explain the following terms:
a) Hyper parameters b) Training set c) Validation sets d) Bias e) Variance (8 marks)
b. Compare overfitting and underfitting. How it can affect model generalization ?
(6 marks)
13.
a. Differentiate gradient descent with and without momentum. Give equations for weight
updation in GD with and without momentum. Illustrate plateaus, saddle points and slowly
varying gradients. (8 marks)
b. Describe the effect in bias and variance when a neural network is modified with more
number of hidden units followed with dropout regularization. (6 marks)
OR
14.
a. Explain how L2 regularization improves the performance of deep feed forward neural
networks. (7 marks)
b. Initializing the weights of a neural network with very small or large random numbers is
not advisable. Justify. (7 marks)
15.
a. Consider an activation volume of size 13×13×64 and a filter of size 3×3×64. Discuss
whether it is possible to perform convolutions with strides 2, 3 and 5. Justify your answer
in each case. (6 marks)
b. Suppose that a CNN was trained to classify images into different categories. It performed
well on a validation set that was taken from the same source as the training set but not on
a testing set. What could be the problem with the training of such a CNN? How will you
ascertain the problem? How can those problems be solved?
(8 marks)
OR
16.
a. Explain the following convolution functions a)tensors b) kernel flipping c) down sampling
d) strides e) zero padding. (10 marks)
b. What is the motivation behind convolution neural networks? (4 marks)

17. a. If we have a recurrent neural network (RNN), we can view it as a different type of network
by "unrolling it through time". Briefly explain what that means. (6 marks)

b. Explain the architecture of GRU. (8 marks)

OR
18.
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

a. The vanishing gradient problem is more pronounced in RNN than in traditional neural
networks. Give reason. Discuss a solution for the problem. (7 marks)
b. Show the steps involved in an LSTM to predict stock prices.Give one advantage of using
an RNN rather than a convolutional network. (7 marks)
19.

a. Generative Adversarial Networks(GANs) include a generator and a discriminator. Sketch

a basic GAN using those elements, a source of real images, and a source of randomness.
(10 marks)
b. The word “adversarial” in the acronym for GANs suggests a two-player game. What are
the two players, and what are their respective goals? (4 marks)
OR
20.

a. Explain auto encoder with an example. (7 marks)

b. Explain Generative Adversarial Networks using suitable diagram. (7 marks)

(14X5=70)
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATALEARNING
SCIENCE

Teaching Plan

No Topic No. of
Lectures
(36 Hours)
1 Module 1: Introduction to neural network and Deep Learning 7

1.1 Introduction, The Basic Architecture of Neural Networks - Single 1 hour

Computational Layer: The Perceptron.

1.2 Multilayer Neural Networks. 1 hour

1.3 Activation functions - Sigmoid, Tanh, ReLU, leaky ReLU, Hard Tanh, 1 hour
Softmax. Loss function.

1.4 Training a Neural Network with Backpropagation. 1 hour

1.5 Practical issues in neural network training 1 hour

1.6 Overfitting, Underfitting, Hyper parameters, Validation sets 1 hour

1.7 Estimators -Bias and Variance, Introduction to deep learning, Deep feed 1 hour
forward network

2 Module 2: Training deep models 8

2.1 Introduction, setup and initialization issues- Kaiming and Xavier weight 1 hour
initializations
2.2 Vanishing and exploding gradient problems 1 hour
2.3 Concepts of optimization, Gradient Descent (GD) 1 hour
2.4 Stochastic GD, GD with momentum, GD with Nesterov momentum 1 hour
2.5 AdaGrad, RMSProp, Adam 1 hour
2.6 Concepts of Regularization, L1 and L2 regularization 1 hour
2.7 Early stopping, Dataset augmentation 1 hour
 BTECH ARTIFICIAL INTELLIGENCE
B TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATALEARNING
SCIENCE

2.8 Parameter tying and sharing, Ensemble methods, Dropout, Batch 1 hour
Normalization
3 Module 3: Convolutional Neural Network 8

3.1 Convolutional Neural Networks, Architecture 1 hour

3.2 Convolution operation 1 hour
3.3 Motivation, pooling 1 hour
3.4 Variants of convolution functions 1 hour
3.5 Structured outputs, Data types 1 hour
3.6 Efficient convolution algorithms 1 hour
3.7 Applications of Convolutional Networks 1 hour
3.8 Case Studies of Convolutional Architectures : AlexNet, ZFNet, VGGNet- 1 hour
19, ResNet-50
4 Module 4 : Recurrent Neural Network 7

4.1 Recurrent neural networks – Computational graphs 1 hour

4.2 RNN design, Encoder – decoder sequence to sequence architectures 1 hour
4.3 Language modeling example of RNN 1 hour
4.4 Deep recurrent networks, Recursive neural networks, Challenges of 1 hour
training Recurrent Networks
4.5 LSTM 1 hour
4.6 GRU 1 hour
4.7 Case Study- BERT, Sentiment Analysis 1 hour
5 Module 5 : Autoencoders and Generative models 6
5.1 A Autoencoders 1 hour

5.2 V VariationalAutoEncoder , Applications of Autoencoders 2 hour

5.3 Boltzmann machines, 1 hour

5.4 Deep Belief Networks, 1 hour
 BTECH BARTIFICIAL INTELLIGENCE
TECH ARTIFICIAL AND MACHINE
INTELLIGENCE AND DATA LEARNING
SCIENCE

5.5 G Generative Adversarial Networks. 1 hour

 CATEGORY L T P CREDIT
MCN401 INDUSTRIAL SAFETY
ENGINEERING MCN 2 1 0 -

Preamble: The course is intended to give knowledge of various safety management principles,
various safety systems, various machine guarding devices, hazard identification techniques,
energy sources, systems & applications and the need in the present context. Learners will be
able to compare different hazard identification tools and choose the most appropriate based on
the nature of industry. It aims to equip students in working with projects and to take up research
work in connected areas

Prerequisite: Nil

Course Outcomes: After the completion of the course the student will be able to

Describe the theories of accident causation and preventive measures of industrial

CO1 accidents. (Cognitive Knowledge level: Understand)

Explain about personal protective equipment, its selection, safety performance &
CO2 indicators and importance of housekeeping. (Cognitive Knowledge level:
Understand)

Explain different issues in construction industries. (Cognitive Knowledge level:

CO3 Understand)

Describe various hazards associated with different machines and mechanical

CO4 material handling. (Cognitive Knowledge level: Understand)

Utilise different hazard identification tools in different industries with the

CO5 knowledge of different types of chemical hazards. (Cognitive Knowledge level:
Apply)

1
Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 2 1
CO2 2 1 2 1 1 1 1 1
CO3 2 2 2 1 1 1 1 1 1 1
CO4 2 2 2 1 1 1 1 1 1 1
CO5 2 2 2 1 1 1 1 1 1 1 1

Abstract POs defined by National Board of Accreditation

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex problems PO10 Communication
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

End Semester Examination
1 2
Remember 10 10 10
Understand 20 20 20
Apply 20 20 70
Analyse
Evaluate
Create

2
Mark distribution:

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment - Test : 25 marks
Continuous Assessment - Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

3
 Syllabus
MCN401- Industrial Safety Engineering (35 hrs)

Module I (Safety introduction- 5 hrs)

Need for safety. Safety and productivity. Definitions: Accident, Injury, Unsafe act, Unsafe
Condition, Dangerous Occurrence, Reportable accidents. Theories of accident causation. Safety
organization- objectives, types, functions, Role of management, supervisors, workmen, unions,
government and voluntary agencies in safety. Safety policy. Safety Officer-responsibilities,
authority. Safety committee-need, types, advantages.

Module II (Personal protection in work environment- 7 hrs)

Personal protection in the work environment, Types of PPEs, Personal protective equipment-
respiratory and non-respiratory equipment. Standards related to PPEs. Monitoring Safety
Performance: Frequency rate, severity rate, incidence rate, activity rate. Housekeeping:
Responsibility of management and employees. Advantages of good housekeeping. 5 s of
housekeeping. Work permit system- objectives, hot work and cold work permits. Typical
industrial models and methodology. Entry into confined spaces.

Module III (Safety issues in construction- 7 hrs)

Introduction to construction industry and safety issues in construction Safety in various

construction operations – Excavation and filling – Under-water works – Under-pinning &
Shoring – Ladders & Scaffolds – Tunneling – Blasting – Demolition – Confined space –
Temporary Structures. Familiarization with relevant Indian Standards and the National Building
Code provisions on construction safety. Relevance of ergonomics in construction safety.
Ergonomics Hazards - Musculoskeletal Disorders and Cumulative Trauma Disorders.

Module IV (Safety hazards in machines- 8 hrs)

Machinery safeguard-Point-of-Operation, Principle of machine guarding -types of guards and

devices. Safety in turning, and grinding. Welding and Cutting-Safety Precautions of Gas

4
welding and Arc Welding. Material Handling-Classification-safety consideration- manual and
mechanical handling. Handling assessments and techniques- lifting, carrying, pulling, pushing,
palletizing and stocking. Material Handling equipment-operation & maintenance. Maintenance
of common elements-wire rope, chains slings, hooks, clamps. Hearing Conservation Program in
Production industries.

Module V (Hazard identification and analysis- 8 hrs)

Hazard and risk, Types of hazards –Classification of Fire, Types of Fire extinguishers, fire
explosion and toxic gas release, Structure of hazard identification and risk assessment.
Identification of hazards: Inventory analysis, Fire and explosion hazard rating of process plants
- The Dow Fire and Explosion Hazard Index, Preliminary hazard analysis, Hazard and
Operability study (HAZOP)) – methodology, criticality analysis, corrective action and follow-up.
Control of Chemical Hazards, Hazardous properties of chemicals, Material Safety Data Sheets
(MSDS).

Text Books:
1. R.K Jain (2000) Industrial Safety, Health and Environment management systems, Khanna
Publications.
2. Paul S V (2000), Safety management System and Documentation training Programme
handbook, CBS Publication.
3. Krishnan, N.V. (1997). Safety management in Industry. Jaico Publishing House, New
Delhi.
4. John V. Grimaldi and Rollin H.Simonds. (1989) Safety management. All India Traveller
Book Seller, Delhi.
5. Ronald P. Blake. (1973). Industrial safety. Prentice Hall, New Delhi.

6. Alan Waring. (1996). Safety management system. Chapman & Hall, England.

7. Vaid, K.N., (1988). Construction safety management. National Institute of Construction

Management and Research, Mumbai.
8. AIChE/CCPS. (1992). Guidelines for Hazard Evaluation Procedures. (second edition).
Centre for Chemical Process Safety, American Institute of Chemical Engineers, New
York.

5
Course Level Assessment Questions:

Course Outcome 1 (CO1):

1. Which are the various accident causation theories? Explain.

2. Define terms: Accident, Reportable accident, Dangerous occurrence.

Course Outcome 2 (CO2):

1. Discuss different types of personal protective equipment

2. Discuss about how to compare the safety performance of two industries.

3. Discuss the significance of work permit system in accident prevention.

Course Outcome 3 (CO3):

1. Distinguish ladders and scaffolds along with their safety features.

2. Discuss the safety requirement for a confined space entry.

3. Explain the important provision in the National Building Code.

Course Outcome 4 (CO4):

1. Explain the various principles used in machine guarding.

2. Explain the issues in mechanical material handling.

Course Outcome 5 (CO5):

1. Selection of different types of fire extinguishers accordance to type of fire.

2. Conduct a HAZOP study for a batch rector of your choice.

3. Determine different types of Chemical hazards associated with industries

6
Model Question Paper

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

VII SEMESTER B. TECH DEGREE EXAMINATION
MCN401- INDUSTRIAL SAFETY ENGINEERING

Maximum: 100 Marks Duration: 3 hours

PART A

Answer all questions, each question carries 3 marks

1. Differentiate Unsafe act and Unsafe conditions with suitable examples

2. Discuss the significance of a safety committee in improving the safety performance of an

industry
3. Which are the different types of permit? Highlight its suitability.

4. Which are five ‘S’ used in housekeeping?

5. List the various safety features of ladders.

6. How safety of the workers can be ensured during a demolition operations.

7. Which are the hazards associated with manual material handling?

8. Discuss the safety issues of Gas welding operations.

9. Differentiate Hazard and Risk.

10. Why MSDS is mandatory for chemical products.

(10 X 3 = 30 Marks)

PART B
Answer one full question from each module
Module 1

11. List the various accident causation theories and explain any one in details. (14 Marks)

12. a) Discuss the significance of safety policy in reducing the accidents. (4 Marks)

b) Safety and productivity are the two sides of a coin’. Are you agreeing with this
statement? Explain with your arguments. (10 Marks)
Module 2
13. a) Classify the personal protective equipment. List the suitability of at least fifteen types of
PPEs. (10 Marks)

7
 b) How will you calculate the frequency rate? Explain with an example. (4 Marks)

14. a) How will you compare the safety performance of two industries? Explain with suitable
example. (10 Marks)
b) Which are the steps to be followed in confined space entry to protect the life a worker.

(4 Marks)

Module 3

15. Discuss the safety and fire protection facilities required for a high rise building as per
National building code. (14 Marks)
16. a) Identify the various hazards during the different stages of building construction.

(7 Marks)

b) Discuss the important types of ergonomic hazards associated with industries.(7 Marks)

Module 4

17. Which are the various types of machine guarding devices used industries. Discuss the
suitability of each machine guarding devices. (14 Marks)
18. With suitable sketches briefly explain seven defects of wire ropes. (14 Marks)

Module 5
19. What is Hazard and Operability Analysis? How do you conduct a HAZOP analysis?

(14 Marks)

20. Discuss about different types of chemical hazards. (14 Marks)

8
Course Contents and Lecture Schedule

No. of Lectures/
Topic Tutorials
No.
L-T

1 Introduction to Industrial safety Engineering

1.1 Need for safety. Safety and productivity. Definitions: Accident, 1

Injury, Unsafe act, Unsafe Condition, Dangerous Occurrence.
Reportable accidents
1.2 Theories of accident causation. Safety organization. 2

1.3 Role of management, supervisors, workmen, unions, 3

government and voluntary agencies in safety.
1.4 Safety Officer-responsibilities, authority. 4
1.5 Safety committee-need, types, advantages. 5
2 Personal protection in the work environment
2.1 Types of PPEs, respiratory and non-respiratory equipment. 6
2.2 Standards related to PPEs 7
2.3 Monitoring Safety Performance: Frequency rate, severity rate 8,
2.4 Monitoring Safety Performance: incidence rate, activity rate. 9
Housekeeping: Responsibility of management and employees. 10
2.5 Advantages of good housekeeping. 5 s of housekeeping.

2.6 Work permit system- objectives, hot work and cold work permits. 11
2.7 Typical industrial models and methodology. Entry into confined 12
spaces.
3 Introduction to construction industry and safety
3.1 Excavation and filling – Under-water works – Under-pinning & 13
Shoring
3.2 Ladders & Scaffolds – Tunneling 14
3.3 Blasting –Demolition – Confined space 15

3.4 Familiarization with relevant Indian Standards and the National 16

Building Code provisions on construction safety.
3.5 Relevance of ergonomics in construction safety. 17
3.6 Ergonomics Hazards 18

9
3.7 Musculoskeletal Disorders and Cumulative Trauma Disorders. 19
4 Machinery safeguard
4.1 Point-of-Operation, Principle of machine guarding - 20
4.2 Types of guards and devices. 21

4.3 Safety in Power Presses, primary & secondary operations - shearing 22

-bending - rolling – drawing.
4.4 Safety in turning, boring, milling, planning and grinding. 23
4.5 Welding and Cutting-Safety Precautions of Gas welding and Arc 24
Welding,
4.6 Cutting and Finishing. 25
Material Handling-Classification-safety consideration-
4.7 manual and mechanical handling. Handling assessments and 26
techniques- lifting, carrying, pulling, pushing, palletizing and
stocking.

4.8 Material Handling equipment-operation & maintenance. 27

Maintenance of common elements-wire rope, chains slings,
hooks, clamps
5 Hazard identification
5.1 Hazard and risk, Types of hazards – Classification of Fire 28
5.2 Types of Fire extinguishers fire, explosion and toxic gas release. 29
5.3 Inventory analysis, Fire and explosion hazard rating of process plants 30
5.4 The Dow Fire and Explosion Hazard Index. 31
5.5 Preliminary hazard analysis, Hazard and Operability study (HAZOP) 32
5.6 Chemical hazard- Classifications, Control of Chemical Hazards. 33
5.7 Hazardous properties of chemicals 34
5.8 Material Safety Data Sheets (MSDS). 35

10
 BTECH ARTIFICIAL
B TECH INTELLIGENCE
ARTIFICIAL & MACHINE
INTELLIGENCE LEARNING
AND DATA SCIENCE

AIL DEEP LEARNING LAB CATEGORY L T P CREDIT

411 LAB 0 0 3 2

Preamble: This course aims to offer students hands-on experience on deep learning
algorithms. Students will be able to familiarize basic python packages for deep learning,
computer vision concepts for deep learning, sequence modelling, recurrent neural network also.
This course helps the learners to enhance the capability to design and implement a deep
learning architecture for a real time application.

Prerequisite: A sound knowledge in python programming, machine learning concepts, deep

learning algorithms.

Course Outcomes: After the completion of the course the student will be able to

CO 1 Implement advanced machine learning concepts using python.(Cognitive Knowledge

Level: Apply)

CO 2 Applybasic data pre-processing and tuning techniques. (Cognitive Knowledge Level:

Apply)

CO 3 Implement basic neural network and CNN on standard datasets. (Cognitive

Knowledge Level: Apply)

CO 4 Design and Implement sequence modelling schemes.(Cognitive Knowledge Level:

Apply)

CO 5 Implement auto encoders on standard datasets and analyse the performance.

(Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12
CO 1

CO 2

CO 3

CO 4

CO 5
Assessment Pattern

Continuous Assessment
Bloom’s Category End Semester Examination %
Test %

Remember 20 20

Understand 20 20

Apply 60 60

Analyze
Evaluate
Create

Mark distribution

Total CIE ESE ESE

Marks Duration

150 75 75 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 15 marks
Continuous Evaluation in Lab : 30 marks
Continuous Assessment Test : 15 marks
Viva-voce : 15 marks

Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks,

Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be
converted out of 15 while calculating Internal Evaluation marks.

End Semester Examination Pattern: The marks will be distributed as Algorithm 30 marks,
Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be converted
out of 75 for End Semester Examination.

Operating System to Use in Lab :Linux/Windows

Programming Language/Software to Use in Lab :matlab or python

Fair Lab Record:

All Students attending the Deep Learning Lab should have a Fair Record. The fair record
should be produced in the University Lab Examination. Every experiment conducted in the lab
should be noted in the fair record. For every experiment in the fair record the right hand page
should contain Experiment Heading, Experiment Number, Date of Experiment, Aim of
Experiment, Details of Experiment including algorithm and Result of Experiment. The left
hand page should contain a print out of the code used for the experiment and sample output
obtained for a set of input.

SYLLABUS

Familiarize python frameworks for deep learning, Data Preprocessing, Supervised

Unsupervised Learning, Design and Implementation of Simple Neural Networks, Back
Propagation, Regularization, Dropout, Build and analyze deep learning architectures like
CNN, RNN, LSTM, GRU, Autoencoders.

.
Reference Books
1. Deep Learning with Python, by François Chollet, Manning, 2021
2. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
3. Neural Networks and Deep Learning, Aggarwal, Charu C., c Springer International Pub-
lishing AG, part of Springer Nature 2018

LIST OF PRACTICE QUESTIONS

1. Basic python programs in machine learning.

2. Implement Simple Linear Regression with Synthetic Data.**
3. Implement basic image enhancement operations such as histogram equalization,
morphological operations. **
4. Data pre-processing operations such as duplicate or missing value management.
5. Implement Feed forward neural network with three hidden layers for classification on
CIFAR-10 dataset. Design and train a neural network that achieves high accuracy in clas-
sifying the images into their respective classes. Test different hyper-parameters
6. Implement a feed forward neural network with three hidden layers for the CIFAR-10
dataset.Train the network using a baseline optimization algorithm, such as stochastic
gradient descent (SGD) or Adam, without any specific weight initialization technique
or regularization technique. Record the accuracy and loss during training. (a) Repeat
 the training process with Xavier initialization for weight initialization. Compare the
convergence speed and accuracy of the network with the baseline results. Analyze the
impact of Xavier initialization on the network's performance. (b) Repeat the training
process with Kaiming initialization for weight initialization. Compare the convergence
speed and accuracy of the network with the baseline results. Analyze the impact of
Kaiming initialization on the network's performance. (c) Implement dropout regulariza-
tion by applying dropout to the hidden layers of the network. Train the network with
dropout regularization and compare its performance with the baseline results. Analyze
the impact of dropout on the network's performance in terms of accuracy and overfit-
ting (d) Implement L1 or L2 regularization techniques by adding a regularization term
to the loss function during training. Train the network with regularization and compare
its performance with the baseline results. Analyze the impact of regularization on the
network's performance in terms of accuracy and prevention of overfitting.**
7. Implement a Convolutional Neural Network (CNN) architecture for digit classification
on the MNIST dataset. Design and train a CNN model that achieves high accuracy in
recognizing handwritten digits.**
8. Digit classification using pre-trained networks like VGGnet-19 for MNIST dataset and
analyse and visualize performance improvement. Explore transfer learning using Con-
volutional Neural Networks (ConvNets) as fixed feature extractors and fine-tuning for
image classification. Analyze their performance on a new image classification task
while comparing the fixed feature extractor approach with fine-tuning.**
9. Implement a Recurrent Neural Network (RNN) for review classification on the IMDB
dataset. Design and train an RNN model to classify movie reviews as positive or nega-
tive based on their sentiment.**
10. Analyze and visualize the performance change while using LSTM (Long Short-Term
Memory) and GRU (Gated Recurrent Unit) instead of a standard RNN (Recurrent Neu-
ral Network) for sentiment analysis on the IMDB dataset. Compare the performance of
different RNN architectures and understand their impact on sentiment classification.**
11. Implement time series forecasting for the NIFTY-50 dataset. Design and train a model
to predict future values of the NIFTY-50 stock market index based on historical data.**
12. Implement a shallow autoencoder and decoder network for machine translation using
the Kaggle English to Hindi Neural Translation Dataset. Design and train a model to
translate English sentences to Hindi by leveraging the power of autoencoders and de-
coders.**
13. Building meaningful machine learning models for Breast Cancer Wisconsin
(Diagnostic) Dataset.
14. Visualize deep learning models and parameters using visual keras, sklearn/dTreeViz,
ANN visualizer, Netron, NN-SVG or any similar tools.
15. Familiarize GUI deep learning frameworks such as deeplearning studio.

Note: Any suitable dataset and deep learning specific packages can be used. Number of
epochs can be reduced to complete the training in the prescribed 3 hour lab sessions

** Mandatory Exercises
 CATEGORY L T P CREDIT
AMQ 413 SEMINAR
PWS 0 0 3 2

Preamble: The course ‘Seminar’ is intended to enable a B.Tech graduate to read, understand,
present and prepare report about an academic document. The learner shall search in the
literature including peer reviewed journals, conference, books, project reports etc., and
identify an appropriate paper/thesis/report in her/his area of interest, in consultation with
her/his seminar guide. This course can help the learner to experience how a presentation can
be made about a selected academic document and also empower her/him to prepare a
technical report.

Course Objectives:

 To do literature survey in a selected area of study.

 To understand an academic document from the literate and to give a presentation
about it.
 To prepare a technical report.

Course Outcomes [COs] :After successful completion of the course, the students will be able
to:

Identify academic documents from the literature which are related to her/his areas of
CO1
interest (Cognitive knowledge level: Apply).
Read and apprehend an academic document from the literature which is related to
CO2
her/ his areas of interest (Cognitive knowledge level: Analyze).
Prepare a presentation about an academic document (Cognitive knowledge
CO3
level: Create).
Give a presentation about an academic document (Cognitive knowledge level:
CO4
Apply).

CO5 Prepare a technical report (Cognitive knowledge level: Create).

Mapping of course outcomes with program outcomes:

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

CO1 2 2 1 1 2 1 3
CO2 3 3 2 3 2 1 3
CO3 3 2 3 1 2 3
CO4 3 2 1 3 3
CO5 3 3 3 3 2 2 2 3 3
 Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
Design/Development
PO3 PO9 Individual and team work
of solutions
Conduct investigations of complex PO10 Communication
PO4 problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

General Guidelines

 The Department shall form an Internal Evaluation Committee (IEC) for the seminar
with academic coordinator for that program as the Chairperson/Chairman and seminar
coordinator & seminar guide as members. During the seminar presentation of a
student, all members of IEC shall be present.

 Formation of IEC and guide allotment shall be completed within a week after the
University examination (or last working day) of the previous semester.

 Guide shall provide required input to their students regarding the selection of topic/
paper.

 Choosing a seminar topic: The topic for a UG seminar should be current and broad
based rather than a very specific research work. It's advisable to choose a topic for the
Seminar to be closely linked to the final year project area. Every member of the project
team could choose or be assigned Seminar topics that covers various aspects linked to
the Project area.

 A topic/paper relevant to the discipline shall be selected by the student during the
semester break.

 Topic/Paper shall be finalized in the first week of the semester and shall be submitted
to the IEC.

 The IEC shall approve the selected topic/paper by the second week of the semester.

 Accurate references from genuine peer reviewed published material to be given in the
report and to be verified.
 Evaluation pattern

Total marks: 100, only CIE, minimum required to pass 50

Seminar Guide: 20 marks (Background Knowledge – 10 (The guide shall give deserving
marks for a candidate based on the candidate's background knowledge about the topic
selected), Relevance of the paper/topic selected – 10).

Seminar Coordinator: 20 marks (Seminar Diary – 10 (Each student shall maintain a

seminar diary and the guide shall monitor the progress of the seminar work on a weekly
basis and shall approve the entries in the seminar diary during the weekly meeting with the
student), Attendance – 10).

Presentation: 40 marks to be awarded by the IEC (Clarity of presentation – 10,

Interactions – 10 (to be based on the candidate's ability to answer questions during the
interactive session of her/his presentation), Overall participation – 10 (to be given based on
her/his involvement during interactive sessions of presentations by other students), Quality
of the slides – 10).

Report: 20 marks to be awarded by the IEC (check for technical content, overall quality,
templates followed, adequacy of references etc.).
 CATEGORY L T P CREDIT
AMD 415 PROJECT PHASE I
PWS 0 0 6 2

Preamble: The course ‘Project Work’ is mainly intended to evoke the innovation and invention
skills in a student. The course will provide an opportunity to synthesize and apply the knowledge
and analytical skills learned, to be developed as a prototype or simulation. The project extends to
2 semesters and will be evaluated in the 7th and 8th semester separately, based on the achieved
objectives. One third of the project credits shall be completed in 7 th semester and two third in 8th
semester. It is recommended that the projects may be finalized in the thrust areas of the respective
engineering stream or as interdisciplinary projects. Importance should be given to address societal
problems and developing indigenous technologies.

Course Objectives
 To apply engineering knowledge in practical problem solving.
 To foster innovation in design of products, processes or systems.
 To develop creative thinking in finding viable solutions to engineering problems.

Course Outcomes [COs] :After successful completion of the course, the students will be able to:
Model and solve real world problems by applying knowledge across domains
CO1
(Cognitive knowledge level: Apply).
Develop products, processes or technologies for sustainable and socially relevant
CO2
applications (Cognitive knowledge level: Apply).
Function effectively as an individual and as a leader in diverse teams and to
CO3
comprehend and execute designated tasks (Cognitive knowledge level: Apply).
Plan and execute tasks utilizing available resources within timelines, following
CO4
ethical and professional norms (Cognitive knowledge level: Apply).
Identify technology/research gaps and propose innovative/creative solutions
CO5
(Cognitive knowledge level: Analyze).
Organize and communicate technical and scientific findings effectively in written
CO6
and oral forms (Cognitive knowledge level: Apply).

Mapping of course outcomes with program outcomes

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

CO1 2 2 2 1 2 2 2 1 1 1 1 2

CO2 2 2 2 1 3 3 1 1 1 1

CO3 3 2 2 1

CO4 2 3 2 2 3 2

CO5 2 3 3 1 2 1

CO6 2 2 2 3 1 1

1
 Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations PO10 Communication
PO4
of complex problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

PROJECT PHASE I
Phase 1 Target

 Literature study/survey of published literature on the assigned topic

 Formulation of objectives
 Formulation of hypothesis/ design/ methodology
 Formulation of work plan and task allocation.
 Block level design documentation
 Seeking project funds from various agencies
 Preliminary Analysis/Modeling/Simulation/Experiment/Design/Feasibility study
 Preparation of Phase 1 report

Evaluation Guidelines & Rubrics

Total: 100 marks (Minimum required to pass: 50 marks).

 Project progress evaluation by guide: 30 Marks.

 Interim evaluation by the Evaluation Committee: 20 Marks.
 Final Evaluation by the Evaluation Committee: 30 Marks.
 Project Phase - I Report (By Evaluation Committee): 20 Marks.

(The evaluation committee comprises HoD or a senior faculty member, Project coordinator
and project supervisor).

2
 Evaluation by the Guide

The guide/supervisor shall monitor the progress being carried out by the project groups on a
regular basis. In case it is found that progress is unsatisfactory it shall be reported to the
Department Evaluation Committee for necessary action. The presence of each student in the group
and their involvement in all stages of execution of the project shall be ensured by the guide.
Project evaluation by the guide: 30 Marks. This mark shall be awarded to the students in his/her
group by considering the following aspects:
Topic Selection: innovativeness, social relevance etc. (2)
Problem definition: Identification of the social, environmental and ethical issues of the project
problem. (2)
Purpose and need of the project: Detailed and extensive explanation of the purpose and need of
the project. (3)
Project Objectives: All objectives of the proposed work are well defined; Steps to be followed to
solve the defined problem are clearly specified. (2)
Project Scheduling & Distribution of Work among Team members: Detailed and extensive
Scheduling with timelines provided for each phase of project. Work breakdown structure well
defined. (3)
Literature survey: Outstanding investigation in all aspects. (4)
Student’s Diary/ Daily Log: The main purpose of writing daily diary is to cultivate the habit of
documenting and to encourage the students to search for details. It develops the students’ thought
process and reasoning abilities. The students should record in the daily/weekly activity diary the
day to day account of the observations, impressions, information gathered and suggestions given,
if any. It should contain the sketches & drawings related to the observations made by the students.
The daily/weekly activity diary shall be signed after every day/week by the guide. (7)
Individual Contribution: The contribution of each student at various stages. (7)

3
 EVALUATION RUBRICS for PROJECT Phase I: Interim
Evaluation

No. Parameters Marks Poor Fair Very Good Outstanding

The team has identified a topic.
Topic The team has failed to come Good evidence of the group The group has brainstormed in an
The originally selected topic
identification, with a relevant topic in time. thinking and brainstorming on excellent manner on what they were
lacks substance and needs to be
selection, Needed full assistance to find a what they are going to build. The going to build. The topic selected is
revised. There were suggestions
formulation of topic from the guide. They do results of the brainstorming are highly relevant, real world problem
given to improve the relevance
objectives not respond to suggestions documented and the selection of and is potentially innovative. The
1­a 10 and quality of the project topic.
and/or from the topic is relevant. The review of group shows extreme interest in the
Only a few relevant
literature evaluation committee and/or related references was good, but topic and has conducted extensive
references were
survey. the guide. No literature there is scope of improvement. literature survey in connection with
consulted/ studied and there is
(Group review was conducted. The Objectives formed with good the topic. The team has come up with
no clear evidence to show the
assessment) team tried to gather easy clarity, however some objectives clear objectives which are feasible.
team's understanding on the
information without verifying are not realistic enough.
same. Some objectives
[CO1] the authenticity. No
identified, but not clear enough.
objectives formed yet.

(0 – 3 Marks) (4 – 6 Marks) (7 ­ 9 Marks) (10 Marks)

Excellent evidence of enterprising
and extensive project planning.Gantt
charts were used to depict detailed
Project project scheduling. A project
Good evidence of planning
Planning, No evidence of planning or Some evidence of a primary management/version
done. Materials were listed and
Scheduling scheduling of the project. plan. There were some ideas on control tool is used to track the
thought out, but the plan wasn't
and The students did not plan the materials /resources project, which shows familiarity with
quite complete.
Resource/ what they were going to required, but not really thought modern tools. All materials /
Schedules were prepared, but
Tasks build or plan on what out. The students have some resources were identified and listed
not detailed, and needs
Identification materials / resources to use idea on the finances required, and anticipation of procuring time is
1­b 10 improvement. Project journal is
and in the project. The students but they have not formalized a done. Detailed budgeting is done. All
presented but it is not complete
allocation. do not have any idea on the budget plan. Schedules were tasks were identified and
in all respect / detailed. There is
(Group budget required. The team not prepared. The project incorporated in the schedule. A well­
better task allocation and
assessment) has not yet decided on who journal has no details. Some kept project journal shows evidence
individual members understand
does what. No project journal evidence on task allocation for all the above, in addition to the
[CO4] about their tasks. There is room
kept. among the team members. interaction with the project guide.
for improvement.
Each member knows well about their
individual tasks.

(0 – 3 Marks) (4 – 6 Marks) (7 ­ 9 Marks) (10 Marks)

Phase 1 Interim Evaluation Total Marks: 20

EVALUATION RUBRICS for PROJECT Phase I: Final Evaluation

Sl.
No. Parameters Marks Poor Fair Very Good Outstanding
 Formulation
None of the team members The students have some The students are comfortable Shows clear evidence of having a well­
of Design
show any evidence of knowledge on the design with design methods adopted, defined design methodology and
and/or
knowledge about the design procedure to be adopted, and and they have made some adherence to it. Excellent knowledge
Methodology
and and the methodology adopted the methodologies. However, the progress as per the plan. The in design procedure and its
1­c 5 till now/ to be adopted in the team has not made much
Progress. methodologies are understood to adaptation. Adherence to project
(Group later stages. The team has progress in the design, and yet a large extent. plan is commendable.
assessment) not progressed from the to catch up with the project
[CO1] previous stage of evaluation. plan.

(0 – 1 Marks) (2 – 3 Marks) (4 Marks) (5 Marks)

The student show some interest The student shows very good
Individual and The student does not show interest in project, and takes up The student takes a leadership
and participates in some of the
any interest in the project tasks and attempts to complete position and supports the other team
Teamwork activities. However, the activities
1­d activities, and is a passive them. Shows excellent members and leads the project.
Leadership are mostly easy and superficial
10 member. responsibility and team skills. Shows clear evidence of leadership.
( Individual in nature.
assessment) Supports the other members
[CO3] well.

(0 – 3 Marks) (4 – 6 Marks) (7 ­ 9 Marks) (10 Marks)

Preliminary The team has not done any The team has started doing some There is some evidence to show Strong evidence for excellent
Analysis/ preliminary work with respect preliminary work with respect to that the team has done good progress in the project. The team
Modeling / to the analysis/modeling/ the project. The students however amount of preliminary has completed the required
1­e
Simulation/ simulation/experiment/desig are not prepared enough for the investigation and design/ preliminary work already and are
10
Experiment / n/feasibility study/ algorithm work and they need to improve a analysis/ modeling etc. poised to finish the phase I in an
Design/ development. lot. They can improve further. excellent manner. They have shown
Feasibility results to prove their progress.
study
[CO1] (0 – 3 Marks) (4 – 6 Marks) (7 ­ 9 Marks) (10 Marks)
 The project stages are extensively
documented in the report.
Professional documentation tools
The team did not document
Some documentation is done, like LaTeX were used to document
Documentatio the work at all. The project
but not extensive. Interaction Most of the project details were the progress of the project along with
1­f n and journal/diary is not
with the guide is minimal. documented well enough. the project journal. The
presentation. 5 presented. The presentation
Presentation include some points There is scope for documentation structure is well­
(Individual & was shallow in content and
of interest, but overall quality improvement. The presentation planned and can easily grow into the
group dull in appearance.
needs to be improved. Individual is satisfactory. Individual project report.
assessment). The individual student has no
performance to be improved. performance is good.
idea on the presentation of
The presentation is done
[CO6] his/her part.
professionally and with great clarity.
The individual’s performance is
excellent.

(0 – 1 Marks) (2 – 3 Marks) (4 Marks) (5 Marks)

Total 30 Phase ­ I Final Evaluation Marks: 30

 EVALUATION RUBRICS for PROJECT Phase I: Report Evaluation
Sl.
No. Parameters Marks Poor Fair Very Good Outstanding

Project report shows

The prepared report is shallow Project report follows the
evidence of systematic
and not as perstandard format. standard format to some The report is exceptionally good. Neatly
documentation. Report is
It does not follow proper extent. However, its organized. All references cited
1­g Report [CO6] 20 following the standardformat
organization.Contains mostly organization is not very good. properly. Diagrams/Figures, Tables and
and there are only a few
Unacknowledged content.Lack Language needs to be equations are properly numbered, and
issues. Organization of the
of effort in preparation is improved. All references are listed and clearly shown. Language is
report is good. Most of
evident. not cited properly in the excellent and follows standard styles.
references are cited
report.
properly.
(0 ­ 7 Marks) (8 ­ 12 Marks) (13 ­ 19 Marks) (20 Marks)
Phase ­ I Project Report Marks: 20
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VII
PROGRAM
ELECTIVE II
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ADVANCED CONCEPTS Category L T P Credit

AIT OF MICROPROCESSOR
Program Elective
413 AND MICRO 2 1 0 3
II
CONTROLLER

Preamble: The course enables the learners capable of understanding the

fundamental architecture of microprocessors and micro controllers. This
course focuses on the architecture, assembly language programming,
interrupts, interfacing of microprocessors with peripheral devices and
microcontrollers and its programming. It helps the learners to extend the
study of latest advanced microprocessors and develop hardware-based
solutions.

Prerequisite: Sound knowledge in Logic System Design and Computer

organization & architecture.

CO# Course Outcomes

CO1 Illustrate the architecture, modes of operation and addressing modes of

microprocessors (Cognitive knowledge: Understand)

CO2 Develop 8086 assembly language programs. Demonstrate interrupts, its

handling in 8086 (Cognitive Knowledge Level: Apply)

CO3 Illustrate how different peripherals are interfaced with 8086

microprocessors (8259,8255,8254,8257) (Cognitive Knowledge Level:
Understand)

CO4 Illustrate the architecture and features of advanced microprocessors

(Cognitive knowledge: Understand)

CO5 Outline features of microcontrollers and develop low level programs.

(Cognitive Knowledge Level: Understand)
 B TECH IN ARTIFICIAL INTELLIGENCE AN
ND MACHINE LEARNING

Mapping of course outc

comes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10
P PO1 PO1
1 2

CO1

CO2

CO3

CO4

CO5

Abstract POs defi

fined by National Board of Accredita
ation

PO# Broad P
PO PO# Broa
ad PO

PO1 Engineering PO7 Environment and

a
Knowledge Sustainability

PO2 Problem Analysis

s PO8 Ethics

PO3 Design/Developm
ment PO9 Individual and
d team work
of solutions

PO4 Conduct PO10 Communicatio

on
investigations off
complex problem
ms

PO5 Modern tool usag

ge PO11 Project Manag
gement and
Finance

PO6 The Engineer an

nd PO12 Lifelong learniing
Society
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Bloom’s Continuous Assessment End Semester

Category Tests Examination
Marks (%)
Test1 (%) Test2 (%)

Remember 20 20 20

Understand 40 40 40

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations must be conducted out of 50

marks
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

First Internal Examination shall be preferably conducted after completing the

first half of the syllabus and the Second Internal Examination shall be
preferably conducted after completing remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions
(preferably, 2 questions each from the completed modules and 1 question from
the partly covered module), having 3 marks for each question adding up to 15
marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules
and 1 question from the partly covered module), each with 7 marks. Out of the
7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of
which a student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module-1(Evolution of microprocessors):

8086 microprocessor – Architecture and signals, Stack structure of 8086,

Physical Memory organization, Minimum and maximum mode of 8086
system and timings. Comparison of 8086 and 8088.

Module-2 (Addressing modes and instructions):

Addressing Modes of 8086. Instruction set – data copy /transfer

instructions, arithmetic instructions, logical instructions, string
manipulation instructions, branch instructions, unconditional and
conditional branch instruction, flag manipulation and processor control
instructions. Assembler Directives and operators. Basic Assembly Language
Programming with 8086.Interrupts - Types of Interrupts and Interrupt
Service Routine- Handling Interrupts in 8086

Module- 3 (Interfacing chips):

Programmable Interrupt Controller - 8259, Architecture (Just mention the

control word, no need to memorize the control word). Programmable
Peripheral Input/output port 8255 - Architecture and modes of operation-
Programmable interval timer 8254-Architecture and modes of operation-
DMA controller 8257 Architecture (Just mention the control word, no need to
memorize the control word of 8254 and 8257).

Module- 4 (Advanced Microprocessors):

Introduction to 32-bit advanced microprocessors- Salient Features and

comparison of 80286, 80386 and 80486. Introduction to Pentium
Microprocessors-Salient features of 80586-System Architecture-Brach
predication-Enhanced Instruction set of Pentium-Journey to Pentium -Pro
and Pentium-II.

Module- 5 (Microcontrollers):

8051 Architecture- Register Organization- Memory and I/O addressing-

Interrupts and Stack- 8051 Addressing Modes- Instruction Set- data transfer
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

instructions, arithmetic instructions, logical instructions, Boolean

instructions, control transfer instructions- Simple programs.

Text Books
1. Bhurchandi and Ray, Advanced Microprocessors and Peripherals,
Third Edition McGraw Hill.
2. Raj Kamal, Microcontrollers: Architecture, Programming, Interfacing
and System Design, Pearson Education.
3. Ramesh Gaonkar, Microprocessor Architecture, Programming, and
Applications with the 8085, Penram International Publishing Pvt.
Ltd.

Reference Books
1. Barry B. Brey, The Intel Microprocessors – Architecture,
Programming and Interfacing, Eighth Edition, Pearson Education.
2. A. NagoorKani, Microprocessors and Microcontrollers, Second
Edition, Tata McGraw Hill
3. Douglas V. Hall, SSSP Rao, Microprocessors and Interfacing, Third
Edition, McGrawHill Education.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome1 (CO1):

1) Describe how pipelining is implemented in 8086 microprocessors

2) Illustrate maximum mode signals in 8086.

Course Outcome 2(CO2):

1) Write an 8086-assembly language program for sorting a sequence

of N, 8-bit numbers. Describe the modifications that can be
done on the above program so that it will sort N, 16-bit
numbers. Rewrite the program with those modifications also.

Course Outcome 3 (CO3):

1) Give the sequence of instructions for setting the IVT for interrupt
type 23H. Assume the Interrupt Service Routine, is present in the
code segment named CODE.

2) Describe the role of Interrupt Request register and In service

register in 8259.

3) Specify the importance of the DMA address register and Terminal

count register in 8257

Course Outcome 4(CO4):

1) What are the four major architectural advancement in 80486 over

80386? What are the data types supported by 80486?

2) Classify the instruction set of Pentium processor?

3) Explain branch prediction mechanism for Pentium processor.

Course Outcome 5(CO5):

1) Write an 8051-assembly language program to count the number

of 1’s and 0’s in each8-bit number

2) Write an 8051-assembly language program for computing the square

root of an 8-bit number.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES: 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT413

Course Name: ADVANCED CONCEPTS OF MICROPROCESSOR AND MICRO

CONTROLLER

Max.Marks:100
Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Describe the functions of following signals in 8086

a) NMI b) ALE

2. The value of Code Segment (CS) Register is 4042H and the value
of different offsets is as follows:
BX:2025H,
IP:0580H,
DI:4247H
Calculate the effective address of the memory location pointed by
the CS register.

3. Explain the following instructions with example.

AAD b. AAS c. AAA

4. Specify the use of following assembler directives - EQU, EVEN

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Differentiate between maskable and non-maskable interrupts?

6. What are the three different I/O modes supported by 8255?

7. Explain the branch prediction in Pentium processors.

8. Compare the features of 80286,80386 and 80486?

9. Differentiate between indirect and indexed addressing modes in

8051.

10. Write the sequence of 8051 instructions to store any two numbers
at two consecutive locations 70H and 71H, multiply them and (10x3=
store the result in location 72H. 30)

Part B

(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Specify the significance of segmentation and how it is (5)

implemented in 8086

(b) Explain the maximum mode signals in 8086. (9)

OR

12. (a) Explain the physical address calculation in 8086 with (4)
example.

(b) Explain the physical memory organization of 8086 with a neat (10)
diagram. How does the 8086 processor access a word from an
odd memory location? How many memory cycles does it
take?

13. (a) Write an 8086-assembly language program for finding the (10)
sum of the squares of first N natural numbers. Calculate the
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

squares of each number using a subroutine SQUARE.

(b) Describe any four control transfer instructions in 8086. (4)

OR

14. (a) Write an 8086-assembly language program for printing the (5)
reverse of a given input string.

(b) Explain the addressing modes for sequential control flow (9)
instructions in 8086.

15. (a) Discuss the following control words of 8259 (5)

a) Initialization command word
b) Operating Command word

(b) Explain the architecture of 8259 with diagram (9)

OR

16. (a) Describe the internal architecture of 8255 with block diagram. (10)

(b) Identify the mode and I/O configuration for ports A, B and C (4)
of an 8255 after its control register is loaded with 86 H?

17. (a) Explain the architecture of Pentium processors with a neat (10)
diagram

(b) Explain the features of Pentium-Pro and Pentium -II. (4)

OR

18. (a) Explain the enhanced instruction sets of Pentium processors (8)
in detail
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the super scalar execution of Pentium processors. (6)

19. (a) Explain the architecture of 8051 microcontroller. (9)

(b) Write an 8051-assembly language program for adding two (5)

matrices whose elements are stored sequentially in some
memory location. Assume suitable locations.

OR

20. (a) Explain the internal data memory organization of 8051. (9)

(b) Describe the control transfer instructions of (5 )

8051microcontroller.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

Contents No of

No Lecture

Hrs

Module 1: (Evolution of microprocessors) (7hours)

1.1 Architecture of 8086 1hour

1.2 Signals in 8086 1hour

1.3 Memory Segmentation 1hour

1.4 Physical Memory organization 1hour

1.5 Minimum and maximum mode 8086 system and timings 1hour
(Lecture 1)

1.6 Minimum and maximum mode 8086 system and timings 1hour
(Lecture 2)

1.7 Comparison of 8086 and 8088 1hour

Module 2 :(programming of 8086) (8 hours)

2.1 Addressing Modes of 8086 1 hour

2.2 Instruction set – data copy/transfer instructions 1hour

2.3 arithmetic instructions, logical instructions 1hour

2.4 unconditional and conditional branch instruction 1hour

2.5 flag manipulation and processor control instructions 1hour

2.6 Assembler Directives and operators 1hour

2.7 Assembly Language Programming with 8086(Lecture 1) 1hour

2.8 Types of interrupts, ISR and handling interrupts in 8086 1hour

Module 3: (Interfacing chips) (7 hours)

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.1 Programmable Interrupt Controller -8259 (Lecture 1) 1hour

3.2 Programmable Peripheral Input/output port- 8255 (Lecture 1hour

1)

3.3 Programmable Peripheral Input/output port- 8255 (Lecture 1hour

2)

3.4 Programmable interval timer 8254 (Lecture 1) 1hour

3.5 Programmable interval timer 8254 (Lecture 2) 1hour

3.6 DMA controller 8257 Architecture (Lecture 1) 1hour

3.7 DMA controller 8257 Architecture (Lecture 2) 1hour

Module 4 :( Advanced Microprocessors) (7 hours)

4.1 Introduction to 32-bit microprocessors 1hour

4.2 Salient features of 808286, 80386 and 80486 and 1hour

comparison (Lecturer 1)

4.3 Salient features of 808286,80386 and 80486 and 1hour

comparison (Lecturer 2)

4.4 80586 -Pentium System Architecture 1hour

4.5 Branch prediction and Enhanced instruction sets 1hour

4.6 MMX architecture, Data types and instruction sets. 1hour

4.7 Journey to Pentium -pro and Pentium -II 1hour

Module 5: (Microcontrollers) (7 hours)

5.1 8051 Architecture (Lecture 1) 1hour

5.2 8051 Architecture (Lecture 2) 1hour

5.3 Register Organization, Memory and I/O addressing 1hour

5.4 Interrupts and Stack,Addressing Modes 1hour

Data transfer instructions, Arithmetic instructions, Logical 1hour

5.5
instructions,
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.6 Boolean instructions, Control transfer instructions 1hour

5.7 Programming of 8051 (Lecture 1) 1hour

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CATEGORY L T P CREDIT
CST423 CLOUD COMPUTING
Program 2 1 0 3
Elective II

Preamble: This course helps the learners to understand cloud computing

concepts. This course includes basic understanding of virtualization,
fundamentals of cloud security, cloud computing based programming
techniques and different industry popular cloud computing platforms. This
course enables the student to suggest cloud based solutions to real world
problems.
Prerequisite: Basic understanding of computer networks and operating systems.
Course Outcomes: After the completion of the course the student will be able to

Explain the various cloud computing models and services. (Cognitive

CO1
Knowledge Level: Understand)

Demonstrate the significance of implementing virtualization

CO2 techniques.
(Cognitive Knowledge Level: Understand)

CO3 Explain different cloud enabling technologies and compare private

cloud platforms
(Cognitive Knowledge Level: Understand)
Apply appropriate cloud programming methods to solve big data
CO4
problems. (Cognitive Knowledge Level: Apply)

Describe the need for security mechanisms in cloud (Cognitive

CO5
Knowledge Level: Understand)

Compare the different popular cloud computing platforms

CO6
(Cognitive Knowledge Level: Understand)
 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

Mapping of course outc

comes with program outcomes

PO1 PO2 PO3 PO4

P PO5 PO6 PO7 PO8 PO9 PO10
P PO1 PO12
1

CO1

CO2

CO3

CO4

CO5

CO6

Absttract POs defined by National

Board of Accreditation

PO# Bro
oad PO PO# Bro
B
ad
PO
P
PO Engineering Kn
nowledge PO7 Environment and
1 y
Sustainability
PO Problem Analys
sis PO8 Ethics
2
PO Design/Develop pme PO9 nd team work
Individual and
3 nt of solutions
Conduct
PO investigations of
o PO1 Communicatiion
4 complex probleems 0
PO Modern tool usa
age PO1 gement and
Project Manag
5 1 Finance
PO The Engineer and
an Society PO1 ning
Life long learn
6 2
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment Tests

End Semester
Bloom’s
Category Test1 Test2 Examination
(Percentage) (Percentage) Marks

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE ESE

Marks Marks Duration
150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance: 10 marks

Continuous Assessment Tests: 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

First Internal Examination shall be preferably conducted after completing the

first half of the syllabus and the Second Internal Examination shall be
preferably conducted after completing the remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions
(preferably, 2 questions each from the completed modules and 1 question from
the partly covered module), having 3 marks for each question adding up to 15
marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules
and 1 question from the partly covered module), each with 7 marks. Out of the
7 questions in Part B, a student should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of
which a student should answer any one. Each question can have a maximum
of 2 subdivisions and carries 14 marks.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module 1: Fundamental Cloud Computing (7 Hours)

Traditional computing- Limitations. Overview of Computing Paradigms-Grid

Computing, Cluster Computing, Distributed Computing, Utility Computing,
Cloud Computing. NIST reference Model-Basic terminology and concepts.
Cloud characteristics, benefits and challenges, Roles and Boundaries. Cloud
delivery (service) models-Infrastructure-as-a-Service (IaaS), Platform-as-a-
Service(PaaS),Software-as-a-Service (SaaS), XaaS (Anything-as-a-service)-Cloud
deployment models- Public cloud, Community cloud, Private cloud, Hybrid
cloud.

Module 2: Virtualization (7 Hours)

Introduction to virtualization-Virtualizing physical computing resources,

Virtual Machines (Machine virtualization), non-virtualized v/s virtualized
machine environments. Types of VMs- process VM v/s system VM, Emulation,
interpretation and binary translation. Hardware-level virtualization-
Hypervisors/VMM. Types of Hypervisors. Full Virtualization, Para-
Virtualization, Hardware-assisted virtualization, OS level virtualization. Basics
of Network Virtualization, Storage Virtualization and Desktop Virtualization,
Pros and cons of virtualization. Case Study- Xen: Para-virtualization, VMware:
full virtualization.
Module 3: Cloud-Enabling Technologies, Private cloud platforms and
programming (7 Hours)

Broadband networks and internet architecture- Internet Service Providers

(ISPs), Data center technology, Web technology, Multitenant technology,
Service technology. Resource provisioning techniques-static and dynamic
provisioning.
Open-source software platforms for private cloud-OpenStack, CloudStack,
Basics of Eucalyptus, Open Nebula, Nimbus.
Cloud Programming- Parallel Computing and Programming Paradigms. Map
Reduce – Hadoop Library from Apache, HDFS, Pig Latin High Level Languages,
Apache Spark.

Module 4: Fundamental Cloud Security (7 Hours)

Basic terms and concepts in security- Threat agents, Cloud security

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

threats/risks, Trust. Operating system security-Virtual machine security-

Security of virtualization- Security Risks Posed by Shared Images, Security

Risks Posed by Management OS. Infrastructure security- Network Level

Security, Host Level Security, Application level security, Security of the
Physical Systems. Identity & Access Management- Access Control.

Module 5: Popular Cloud Platforms (9 Hours)

Amazon Web Services(AWS):- AWS ecosystem- Computing services, Amazon

machine images, Elastic Compute Cloud (EC2), Advanced compute services.
Storage services-Simple Storage System (Amazon S3), Elastic Block Store
(Amazon EBS), Database Services, Amazon CDN Services and Communication
services.
Google Cloud Platform:- IaaS Offerings: Compute Engine (GCE), Cloud
Storage, PaaS Offerings: Google App Engine (GAE), Storage services,
Application services, Compute services, Database Services, SaaS Offerings:
Gmail, Docs, Google Drive.
Microsoft Azure: Azure Platform Architecture, Hyper-V, Azure Virtual
Machine, Compute services, Storage services.

Text Books

1. Thomas, E., Zaigham M., Ricardo P "Cloud Computing Concepts,

Technology & Architecture.", (2013 Edition). Prentice Hall.
2. Buyya, R., Vecchiola, C., & Selvi, S. T. “Mastering cloud computing:
foundations and applications programming”, (2017 Edition), Morgan
Kaufmann.
3. Bhowmik, S., “Cloud computing”, (2017 Edition). Cambridge University Press.

References

1. Marinescu, D. C., “Cloud computing: theory and practice.”, (2017

Edition).
Morgan Kaufmann.
2. Buyya, R., Broberg, J., & Goscinski, A. M., “Cloud computing: Principles and
paradigms”
(2011 Edition). John Wiley & Sons.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. “A hybrid cloud is a combination of two or more other cloud deployment
models”. Justify the statement with an example.
2. What are the main characteristics of a Platform-as-a-Service solution?
3. How does cloud computing help to reduce the time to market for
applications and to cut down capital expenses?
4. Differentiate public and private clouds in terms of flexibility.
Course Outcome 2 (CO2):
1. Define virtualization. What is the role of VMM in virtualization?
2. Explain various implementation levels of Virtualization.
3. State the differences between a traditional computer and a virtual machine.
Course Outcome 3 (CO3):
1. Differentiate between on-premise and cloud-based internetworking.
2. What are the benefits of Data Center Technologies?
3. What are the characteristics of Multi-tenant technology?
4. How can virtualization be implemented at the hardware level?
Course Outcome 4 (CO4):
1. Write a Hadoop MapReduce program that counts the number of
occurrences of each character in a file.
2. Write a Hadoop MapReduce program to find the maximum temperature
in the weather dataset.
Course Outcome 5 (CO5):
1. Why is it harder to establish security in the cloud?
2. Explain in detail about the security issues one should discuss with a
cloud-computing vendor.
3. List and Explain major cloud security challenges.
Course Outcome 6 (CO6):
1. Explain the cloud based databases.
2. With a neat diagram, write about Google App Engine for PaaS applications.
3. Differentiate between amazon SimpleDB and Amazon RDS.
4. “Storage services in the cloud are offered in two different forms as IaaS and
as SaaS”.
Explain.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question
Paper

QP Code: Total Pages :

3
Reg No: Name :

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH &
YEAR

Course Code: CST423

Course Name: Cloud
Computing

Duration: 3 Hrs Max. Marks

:100
PART A
Answer all Questions. Each question carries 3 Marks (10
x 3 = 30 Marks)
1. Is the IT outsourcing model of traditional computing similar to cloud
computing? Justify.
2. Why is grid computing considered as the predecessor of cloud
computing? Explain.
3. What is virtualization and what are its benefits?

4. Explain why a hypervisor is also called a virtual machine monitor?

5. Differentiate between multi-tenancy and virtualization.

6. “The field of service technology is a keystone foundation of cloud

computing”. Explain.
7. Discuss any two identity management techniques used in cloud
computing.
8. Differentiate between mandatory access control (MAC) and discretionary
Access Control (DAC).

9. Differentiate between Amazon S3 and Amazon EBS.

10. Explain the database service offered by google cloud.
 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

(10 x3 =30)
PART
B
e Question from each Module. Each
Answer any one h question carries
14 Marks
11. (a) Discuss the cloud
c computing reference model. (8)
(b) Which are th
he basic components of an IaaS-basedd solution for (6)
cloud computting? Also provide some examples of IaaS
I
implementatiions.
OR

12. (a) List down the

e characteristics and challenges of clo
oud (6)
computing.
(b) Classify the various
v types of clouds. (8)

13. (a) List and discu

uss various types of virtualization. (8)

(b) virtualization.
Differentiate between full virtualization and paravi (6)
OR
14. (a) What is Xen? on.
? Discuss its elements for virtualizatio (8)
(b) Explain the design
d requirements for Virtual Machiine Monitor (6)
(VMM).

15. (a) Explain the broadband

b chitecture.
networks and internet arch (8)

(b) s of data
List and expllain the technologies and components (6)
centers.
OR

16. (a) What are thee major functions of the MapReduce frramework? (8)
Explain the lo on using a
ogical data flow of MapReduce functio
suitable exammple .
(b) Write a Hado
oop MapReduce program that counts (6)
the number of
o occurrences of each word in a file.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. (a) Explain common threats and vulnerabilities in cloud-based (8)

environments with suitable examples.

(b) Discuss the security risks posed by shared images with (6)
suitable examples.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

18. (a) Explain the operating system security in cloud computing. (8)
(b) What do you mean by threat agents?. Explain different types (6)
of threat agents.

19. (a) Describe Amazon EC2 and its basic features. (8)

(b) Illustrate the architecture of Amazon S3. (6)

OR
20. (a) Describe the core components of Google AppEngine. (8)
(b) Explain the architecture of Windows Azure. (6)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No CONTENTS No. of
Lecture Hours
(37 hrs)
Module 1 (Fundamental Cloud Computing) (6 hours)

1.1 Traditional computing: Limitations. 1

1.2 Overview of Computing Paradigms: Grid Computing, 1

Cluster Computing, Distributed Computing, Utility
Computing, Cloud Computing.
1.3 NIST reference Model, Basic terminology and concepts. 1

1.4 Cloud characteristics and benefits, challenges. Roles and 1

Boundaries.
1.5 Cloud delivery (service) models: Infrastructure-as-a-Service 1
(IaaS), Platform-as- a-Service (PaaS), Software-as-a-Service
(SaaS), XaaS (Anything-as-a-service).
1.6 Cloud deployment models: Public cloud, Community cloud, 1
Private cloud, Hybrid cloud.

Module 2( Virtualization)(7 Hours)

2.1 Introduction to virtualization, Virtualizing physical 1

computing resources Virtual Machines (Machine
virtualization):- non-virtualized v/s virtualized machine
environments.
2.2 Types of VMs: process VM v/s system VM, Emulation, 1
interpretation and binary translation.

2.3 Hardware-level virtualization: Hypervisors/VMM, Types of 1

Hypervisors.
2.4 Full Virtualization, Para-Virtualization, Hardware-assisted 1
virtualization, OS level virtualization.

2.5 Basics of Network Virtualization, Storage 1

Virtualization and Desktop
Virtualization, Pros and cons of virtualization.
2.6 Case Study: Xen: Para-virtualization. 1

2.7 Case Study: VMware: full virtualization. 1

 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

Module 3 (Cloud-E
Enabling Technologies, Private clou
ud platforms and
programming)
(9 Hours)
3.1 Broadband netwo orks and internet architecture: In nternet 1
Service Providerss (ISPs), Data center technology, Web
y.
technology, Multittenant technology, Service technology

3.2 Resource provisio

oning techniques: static and dynamic 1
provisioning.
3.3 Open-source softw
ware platforms for private cloud: 1
OpenStack, ClouddStack.
3.4 Basics of Eucalypttus, Open-Nebula, Nimbus. 1

3.5 Cloud Programmin ming

ng: Parallel Computing and Programm 1
Paradigms.
3.6 Map Reduce. 1

3.7 Hadoop Library frrom Apache, HDFS. 1

3.8 Pig Latin High Lev

vel Languages 1

3.9 Apache Spark. 1

Module 4 (Fundamental Cloud Security) (7 Hours)

4.1 Basic terms and concepts

c in security, Threat agents. 1

4.2 Cloud security thrreats/risks, Trust. 1

4.3 Operating system security, Virtual machine security. 1

4.4 Security of virtuallization. 1

4.5 Security Risks po ks

osed by Shared Images, Security Risk 1
posed by Manage ement OS.

4.6 Infrastructure sec

curity: - Network Level Security, 1
Host Level Securiity, Application level security,
Security of the Ph
hysical Systems.
4.7 Identity & Access Management, Access Control. 1

ours)
Modulle 5 (Popular Cloud Platforms) (8 Ho
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.1 Amazon Web Services(AWS):- AWS ecosystem, Computing 1

services: Amazon machine images, Elastic Compute Cloud
(EC2).
5.2 Advanced computing services, Storage services: Simple 1
Storage System (Amazon S3), Elastic Block Store (Amazon
EBS).
5.3 Database Services, Amazon CDN Services and 1
Communication services.
5.4 Google Cloud Platform:- IaaS Offerings: Compute Engine 1
(GCE), Cloud Storage.

5.5 PaaS Offerings: Google App Engine (GAE), Storage services, 1

Application services, Compute services.

5.6 Database Services, SaaS Offerings: Gmail, Docs, Google 1

Drive.
5.7 Microsoft Azure: Azure Platform Architecture, Hyper-V, 1
Azure Virtual Machine.

5.8 Azure Compute services, Storage services. 1

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SECURITY IN CATEGORY L T P CREDIT

CST433
COMPUTING
Program 2 1 0 3
Elective II

Preamble: This course helps the learners to explore various algorithms to offer
confidentiality, integrity, authentication &non-repudiation services and
different attacks on system security with their countermeasures. It covers
classical encryption techniques, symmetric and public key crypto-system, key
distribution techniques, authentication functions, intruders, malicious
software, and DDoS attacks. The concepts covered in this course enable the
learners in effective use of cryptographic algorithms and appropriate
countermeasures for securing real life applications.

Prerequisite: A fundamental knowledge in mathematical foundations of security.

Course Outcomes: After the completion of the course, the student will be able to

CO1 Identify the security services provided against different types of

security attacks. (Cognitive Knowledge Level: Understand)
CO2 Illustrate classical encryption techniques for information
hiding. (Cognitive Knowledge Level: Apply)
CO3 Illustrate symmetric/asymmetric key
cryptosystems for secure communication.
(Cognitive Knowledge Level: Apply)
CO4 Explain message integrity and authentication methods
in a secure communication scenario.
(Cognitive Knowledge Level: Understand)
CO5 Interpret public/secret key distribution techniques for secure
communication.
(Cognitive Knowledge Level: Understand)
CO6 Identify the effects of intruders, malicious software and
distributed denial of service attacks on system security.
(Cognitive Knowledge Level: Understand)
 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

Mapping of course outc

comes with program outcomes

3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1

PO1 PO2 PO3
0 1 2
CO1

CO2

CO3

CO4

CO5

CO6

Abstra
ract POs defined by National Board of
Accreditation
PO# B
Broad PO PO# Br
oa
d
PO
PO1 Engineering Knowledge
K PO7 Environmeent and
Sustainabiility
PO2 Problem Anal
alysis PO8 Ethics

PO3 Design/Deve elopm PO9 Individual and team work

ent of solution
ns
Conduct
PO4 investigation
ns of PO10 cation
Communic
complex prob blems
PO5 Modern tool usage
u PO11 anagement and
Project Man
Finance
PO6 The Engineerr and Society PO12 earning
Life long le
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

End Semester
Bloom’s Category Test 1 Test 2 Examination (%)
(%) (%)
Remember 30 30 3
0
Understand 40 40 4
0
Apply 30 30 3
0
Analyse
Evaluate
Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module),
having 3 marks for each question adding up to 15 marks for part A. Students
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

should answer all questions from Part A. Part B contains 7 questions

(preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with
2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module
of which a student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module-1 (Basics of Security and Traditional Cryptosystems)

OSI security architecture – Security attacks, Services, Mechanisms.
Cryptography vs Cryptanalysis. Classical encryption techniques – Symmetric
cipher model. Substitution ciphers
– Monoalphabetic vs Polyalphabetic ciphers, Caesar cipher, Affine cipher,
Playfair cipher, Vigenere cipher, Hill cipher. Transposition ciphers – Keyless,
Keyed, Double transposition.

Module-2 (Modern Symmetric Key Cryptosystems)

Symmetric key ciphers – Block vs Stream ciphers, Block cipher components,
Product ciphers, Feistel and Non-Feistel ciphers. Data Encryption Standard
(DES) – Structure, Key generation, Design criteria, Weaknesses, Double DES,
Triple DES. Advanced Encryption Standard (AES) – Structure, Key
expansion. Block cipher modes of operation – Electronic Codebook Mode
(ECB), Cipher Block Chaining Mode (CBC), Cipher Feedback Mode (CFB),
Output Feedback Mode (OFB), Counter Mode (CTR). Stream ciphers –
Structure, RC4.

Module-3 (Public Key Cryptosystems)

Introduction to public key cryptosystems – Principles, Applications,
Requirements, Conventional vs Public key cryptosystems. RSA cryptosystem
– Algorithm, Security, Attacks. ElGamal cryptosystem – Algorithm. Diffie-
Hellman key exchange – Algorithm, Man-in-the- middle attack. Elliptic Curve
Cryptography (ECC) – ElGamal ECC, Key exchange using ECC.

Module-4 (Message Integrity and Authentication)

Hash functions – Security requirements, Secure Hash Algorithm (SHA-512).
Message Authentication Code (MAC) – Requirements, Uses, Hash-based MAC
(HMAC), Cipher-based MAC (CMAC). Digital signatures – Attacks, Forgeries,
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Requirements, Direct vs Arbitrated digital signatures, RSA digital signature,

ElGamal digital signature, Digital Signature Standard (DSS).

Module-5 (Key Distribution and System Security)

Key management – Distribution of secret keys using symmetric and
asymmetric encryption, Distribution of public keys. System security –
Intruders, Intrusion detection techniques, Password management. Malicious
software – Viruses, Related threats, Countermeasures. Distributed Denial of
Service (DDoS) attacks – Types, Countermeasures.

Text Books
1. William Stallings, Cryptography and Network Security Principles and
Practice, 4/e, Pearson Ed.
2. Behrouz A Forouzan, Cryptography and Network Security, 3/e, Tata McGraw-
Hill.

References

1. Charles P Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies,

Security in Computing, 5/e, Prentice Hall.
2. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment

Questions Course Outcome 1 (CO1):

1. Define the type of security attack in the following case: A student

breaks into a teacher’s office to obtain a copy of the next day’s exam
question paper.
2. Which security mechanism is provided in the following case: A
bank requires the customer’s signature for a withdrawal.

Course Outcome 2 (CO2):

1. Alice wishes to send the message “COME BACK EARLY” to Bob,

using Playfair cipher. The key to be used is “SAFFRON”. Show the
process of encryption.
2. Using Affine cipher, encrypt “HOT” and decrypt “JDG”. Key is (7, 3).
3. Implement the Vigenere cipher method in a suitable
programming language. (Assignment)

Course Outcome 3 (CO3):

1. If the DES key with parity bit is 0123 ABCD 2562 1456, find the first round
key.
2. In RSA, given p=19, q=23, public key(e)=3, find n, ɸ(n) and private key(d).
3. Implement any two symmetric/asymmetric encryption
techniques in a suitable programming language. (Assignment)

Course Outcome 4 (CO4):

1. Describe the steps involved in generating a Hash-based MAC.

2. Using ElGamal scheme, generate the signatures for the message
M=400 with p=881, d=700 and r=17.
3. A company wishes to implement a secure authentication mechanism
for communication. As a system security admin suggest any two ways
of implementing such a mechanism. (Assignment)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 5 (CO5):

1. List any two ways in which secret keys can be distributed to two
communicating parties.
2. Explain the significance of a public-key authority in the distribution of public
keys.

Course Outcome 6 (CO6):

1. What are false positives and negatives in the context of Intrusion

Detection Systems? How can we reduce these two?
2. Distinguish between a direct DDoS attack and a reflector DDoS attack.
3. Bob works as a network administrator in ABC & Co. On a day of his
absence, he shared his admin password with one of his colleagues,
John, to manage a network issue. Later John started misusing this
privilege by launching DoS attacks in the network. Describe the
ethical issues in this scenario and how can this be avoided?
(Assignment)
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES:

Reg No:
Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH &

YEAR

Course Code: CST433

Course Name: SECURITY IN COMPUTING

Max Marks: 100 Duration: 3 Hours

PART A
(Answer All Questions. Each question carries
3 marks)

1 Differentiate between passive attack and active attack.

.
2 Use an Affine cipher to encrypt the message “SECURITY” with the
. key pair(7,2) in modulus 26.

3 Compare stream cipher and Block cipher with example.

.
4. Differentiate between diffusion and confusion.

5. Define the elliptic curve logarithm problem.

6. Consider an ElGamal scheme with a common prime q = 71 and a primitive root

α
= 7. If B has a public key YB = 3 and A chose the random number k
= 2, what is the ciphertext of the message M = 30?

7. Give the requirements of MAC function.

8. Specify the different types of forgery in digital signature.

9. List three different classes of intruders.

10. Mention the phases of operation of a virus.

 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(10x3=30)

Part B
(Answer any one question from each module. Each
question carries 14 Marks)

11. (a) Illustrate the two approaches to attack a conventional encryption scheme. (4)

(b) A Hill cipher is setup with the key matrix 9 4 .

(10)
57
Encrypt the text “COMPUTER”. Show the calculations for the
corresponding decryption of the ciphertext to recover the
original text back.

OR

12. (a) Encrypt the text “this is an exercise and complete it” using
transposition cipher with the key (3,2,1,4,5). Show decryption (6)
of the ciphertext to recover the original text back.

(b) Encrypt the message “the house is being sold tonight”using (8)
the following ciphers. Ignore the space between words.
i) Vigenere cipher with key = “largest”.
ii) Autokey system of Vigenere cipher with key =“largest”.

13. (a) How is round key generated in DES? (4)

(b) Illustrate AES encryption in detail. (10)

OR
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

CE AND MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENC

14. (a) Explain the consttruction of S-box in AES. (5)

(b) Summarize the prrimitive operations in RC4 algorithm. (9)

15. (a) Compare the Ciph Cipher

her Block Chaining Mode (CBC) and C (6)
Feedback Mode (C
CFB) of block ciphers.

(b) Explain RSA crryptosystem. In an RSA cryptos system a (8)

participant A us ses two prime numbers p=13 and q=17 to
generate public key of A is 35.
k and private key. The public key o
Find the private key
k of A.

OR
16. (a) Illustrate ElGama
al cryptosystem. (6)

(b) Consider a Diffie––Hellman scheme with a common prrime q=11 (8)

and a primitive ro
oot α=2.
i) Show th hat 2 is a primitive root of 11.
ii) If User A has public key YA= 9, what is A’s prrivate key
XA?
iii) If User A has public key YB= 3, what is the s shared
secret ke
ey K, shared with A?

17. (a) Describe differentt types of arbitrated digital signature ttechniques. (6)

(b) Explain Cipher – Based

B Message Authentication Code.. (8)

OR
18. (a) Explain the attack
ks on digital signature. (5)

(b) Describe the work

king of SHA-512 with diagrams. (9)

19. (a) Explain four techn words.

niques used to avoid guessable passw (6)

bution.
(b) Describe the differrent techniques for public key distrib (8)

OR
20. (a) Explain different ttypes of Simple DDoS attack and its (6)
countermeasures s.
(b) Differentiate betw d rule-based
ween statistical anomaly detection and (8)
intrusion detection
n.
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

CE AND MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENC

Teaching Plan

Contents No.of Lecture

No Hours (35Hrs)

Module-1 (Basics off Security and Traditional Cryptosy

ystems) (6 hrs)

1.1 OSI security archite

ecture – Security attacks, Services, 1

Mechanisms

1.2 Cryptography vs Crryptanalysis. Classical 1

encryption techniqu
ues – Symmetric cipher model

1.3 Substitution cipherrs – Monoalphabetic vs 1

Polyalphabetic ciph
hers, Caesar cipher, Affine cipher

1.4 Playfair cipher, Vige

enere cipher 1

1.5 Hill cipher 1

1.6 Transposition ciphe

ers – Keyless, Keyed, Double 1

transposition

Mo
odule-2 (Modern Symmetric Key

Cryptosystems) (9hrs)

Symmetric key ciph

hers – Block vs Stream ciphers,

2.1 Block cipher compo

onents, Product ciphers, Feistel 1

and Non-Feistel ciph

hers

andard (DES) – Structure, Key

Data Encryption Sta 1
2.2
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

generation

2.3 Design criteria, Weaknesses 1

2.4 Double DES, Triple DES 1

2.5 Advanced Encryption Standard (AES) – Overall 1

Structure

2.6 Stages of encryption/decryption 1

2.7 Key expansion 1

2.8 Block cipher modes of operation – Electronic 1

Codebook Mode (ECB), Cipher Block Chaining

Mode (CBC), Cipher Feedback Mode (CFB), Output

Feedback Mode (OFB), Counter Mode (CTR).

2.9 Stream ciphers – Structure, RC4 1

Module-3 (Public Key Cryptosystems)(7hrs)

3.1 Public key cryptosystems – Principles, 1

Applications, Requirements, Conventional vs

Public key cryptosystems

3.2 RSA cryptosystem – Algorithm 1

3.3 RSA Security, Attacks 1
3.4 ElGamal cryptosystem – Algorithm 1
3.5 Diffie-Hellman key exchange – Algorithm, Man-in- 1
the-middle attack
3.6 Elliptic Curve Cryptography (ECC) – ElGamal ECC 1
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.7 Key exchange using ECC 1

Module-4 (Message Integrity and

Authentication) (6 hrs)
4.1 Hash functions – Security requirements, Secure 1
Hash Algorithm (SHA-512)
4.2 Message Authentication Code (MAC) – 1
Requirements, Uses
Hash-based MAC (HMAC), Cipher-based MAC
4.3 1
(CMAC)
4.4 Digital signatures – Attacks, Forgeries, 1
Requirements, Direct Vs Arbitrated digital
signatures
4.5 RSA digital signature, ElGamal digital signature 1
4.6 Digital Signature Standard (DSS) 1

Module-5 (Key Distribution and System

Security) (7hrs)
Key management – Distribution of secret keys
5.1 1
using symmetric and asymmetric encryption

5.2 Distribution of public keys 1

5.3 System security – Intruders, Intrusion detection 1
techniques
5.4 Password management 1
5.5 Malicious software – Viruses, Related threats 1
5.6 Virus countermeasures 1

5.7 Distributed Denial of Service (DDoS) attacks – 1

Types, Countermeasures
 BTECH ARTIFICIAL
B TECH INTELLIGENCE
ARTIFICIAL & MACHINE
INTELLIGENCE AND DATALEARNING
SCIENCE

CONCEPTS IN Category L T P Credit

AIT 443
COMPILER DESIGN PEC 2 1 0 3

Preamble:
The purpose of this course is to create awareness among students about the phases of a compiler and
the techniques for designing a compiler. This course covers the fundamental concepts of different
phases of compilation such as lexical analysis, syntax analysis, semantic analysis, intermediate code
generation, code optimization and code generation. Students can apply this knowledge in design
and development of compilers.
Prerequisite: Sound knowledge in Data Structures and Programming Concepts.
Course Outcomes: After the completion of the course the student will be able to

Explain the phases in compilation process (lexical analysis, syntax analysis, semantic
CO1 analysis, intermediate code generation, code optimization and code generation) and
model a lexical analyzer (Cognitive Knowledge Level: Apply)

Model language syntax using Context Free Grammar and construct Top-Down Parsers.
CO2
(Cognitive Knowledge Level: Apply)

Compare different types of parsers (Bottom-up and Top-down) and construct parser
CO3
for a given grammar (Cognitive Knowledge Level: Apply)

Build Syntax Directed Translation for a context free grammar, compare various storage
CO4 allocation strategies and classify intermediate representations (Cognitive Knowledge
Level: Apply)

Illustrate code optimization and code generation techniques in compilation (Cognitive

CO5
Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

1
CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of complex

PO4 PO10 Communication
problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Continuous Assessment End Semester

Category Tests Examination Marks

Test 1 (Marks) Test 2 (Marks)

Remember 20 20 20

Understand 40 40 40

Apply 40 40 40

Analyze

Evaluate

Create

2
 Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment - Test : 25 marks

Continuous Assessment - Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
full questions from each module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module - 1 (Introduction to compilers and lexical analysis)

Analysis of the source program - Analysis and synthesis phases, Phases of a compiler. Compiler
writing tools.

3
Lexical Analysis - Role of Lexical Analyser, Input Buffering, Specification of Tokens, Recognition
of Tokens.

Module - 2 (Introduction to Syntax Analysis)

Role of the Syntax Analyser- Introduction to Context Free Grammars -Parse Trees and
DerivationsAmbiguous grammar-Eliminating ambiguity, left recursion and Left factoring the
grammar.

Top-Down Parsing - Recursive Descent parsing, First and Follow, Predictive Parsing table constructor
for LL(1) grammar.

Module - 3 (BottomUp Parsing)

Bottom-up parsing - Shift Reduce Parsing,LR parsing - algorithm and working, LR(0) Canonical
items, Constructing LR(0) and SLR Parsing Tables, LR(1) Canonical items ,Constructing Canonical
and LALR Parsing Tables.
Module - 4 (Syntax directed translation and Intermediate code generation)

Syntax directed translation - Syntax directed definitions, S-attributed definitions, L-attributed

definitions, Storage-allocation strategies.

Intermediate Code Generation - Intermediate languages, Graphical representations, Three-Address

code, Quadruples, Triples.

Module 5 – (Code Optimization and Generation)

Code Optimization - Principal sources of optimization, Machine dependent and machine

independent optimizations, Basic Blocks and Program Flow Graph: with Examples, Local and global
optimizations.
Code generation - Issues in the design of a code generator, A simple code generator.

Text Books
1. Aho A.V., Ravi Sethi and D. Ullman. Compilers – Principles Techniques and Tools, Addison
Wesley, 2006.
Reference Books
1. D.M.Dhamdhere, System Programming and Operating Systems, Tata McGraw Hill &
Company, 1996.
2. Kenneth C. Louden, Compiler Construction – Principles and Practice, Cengage Learning
Indian Edition, 2006.
3. Tremblay and Sorenson, The Theory and Practice of Compiler Writing, Tata McGraw Hill
& Company,1984.

4
 4. John E Hopcroft, Jeffrey D Ullman,IntroductionTo Automata Theory, Languages And
Computation

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1) Explain the phases of a compiler with a neat diagram.
2) Define a token. Identify the tokens in the expression a := b + 10.

Course Outcome 2 (CO2):

1) Illustrate the process of eliminating ambiguity, left recursion and left factoring the grammar.
2) Is the following grammar ambiguous? If so, eliminate ambiguity.
E→E + E | E*E |(E) | id
3) Design a predictive parser for the grammar
E→E + T | T
T→T*F | F
F→(E) | id

Course Outcome 3 (CO3):

1. What are the different parsing conflicts in the SLR parsing table?
2. Construct canonical LR(0) collection of items for the grammar below.
S→L=R
S→R
L→*R
L → id
R→L
Also identify a shift reduce conflict in the LR(0) collection constructed above.

Course Outcome 4 (CO4):

1. Write the quadruple and triple representation of the following intermediate code
R1 = C * D
R2 = B + R1
A = R2

5
 B[0] = A
2. Differentiate S-attributed Syntax Directed Translation(SDT) and L-attributed SDT. Write
S - attributed SDT for a simple desktop calculator
3. Discuss the different storage allocation strategies.
Course Outcome 5 (CO5):
1. List out the examples of function preserving transformations.
2. What are the actions performed by a simple code generator for a typical three-address
statement of the form x: = y op z.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SIXTH SEMESTER B.TECH DEGREE EXAMINATION , MONTH & YEAR
Course Code: AIT 443
Course Name: Concepts In Compiler Design
Max.Marks:100 Duration: 3
Hours
PART A
Answer All Questions. Each Question Carries 3 Marks

1. Specify the analysis and synthesis parts of compilation.

2. Define the terms token, lexemes, and patterns with examples.

3. Is the grammar S --> S | (S) S / Ɛ ambiguous? Justify your answer.

4. What is left recursive grammar? Give an example. What are the steps in removing
left recursion?

5. Compare different bottom-up parsing techniques.

6. What are the possible actions of a shift reduce parser.

6
7. Differentiate synthesized and inherited attributes with examples.

8. Translate a[i] = b * c – b * d, to quadruple.

9. What is the role of peephole optimization in the compilation process

10. What are the issues in the design of a code generator

(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Explain the different phases of a compiler with a running example.
(9)

(b) List and explain any three compiler construction tools.

(5)

OR

12. (a) What is a regular definition? Give the regular definition of an unsigned
integer (7)

(b) Express the role of transition diagrams in recognition of tokens. (7)

13. (a) What is Recursive Descent parsing? List the challenges in designing such
a parser? (4)

(b) Consider the following grammar

E-→E or T | T (10)
T→ T and F |F
F→not F | (E) | true | false
(i) Remove left recursion from the grammar.
(ii) Construct a predictive parsing table.
(iii) Justify the statement “The grammar is LL (1)”.

OR

7
14. (a) What is Recursive Descent parsing? List the problems in designing such (4)
a parser

(b) Design a recursive descent parser for the grammar S→cAd, A→ab/ b (5)

Find the FIRST and FOLLOW of the non-terminals S, A and B in the (5)
grammar
S→aABe
A→Abc | b
B→d

15. (a) Construct the LR(0) set of items and their GOTO function for the (10)
grammar
S→S S + | S S * | a

(b) Is the grammar SLR? Justify your answer (4)

OR

16. (a) Identify LR(1) items for the grammar

S→ CC (7)
C→ cC | d

(b) Construct LALR table for the above grammar (7)

17. (a) Design a Syntax Directed Translator(SDT) for the arithmetic expression (8)
(4 * 7 + 19) * 2 and draw an annotated parse tree for the same.

(b) Consider the grammar with following translation rules and E as the start (6)
symbol
E → E1 # T {E.value=E1.value x T.value ;}
| T{E.value=T.value ;}
T → T1 &F{ T.value=T1.value + F.value ;}
| F{T.value= F.value ; }
F → num {F.value=num. lvalue ;}
Compute E.value for the root of the parse tree for the expression
2#3 & 5# 6 &7

8
 OR

18. (a) Write Syntax Directed Translator (SDT) and parse tree for infix to postfix (8)
translation of an expression.

(b) Explain the storage allocation strategies. (6)

19. (a) Describe the principal sources of optimization (7)

(b) Illustrate the optimization of basic blocks with examples. (7)

OR

20. (a) Write the Code Generation Algorithm and explain the getreg function (6)

(b) Generate target code sequence for the following statement (8)
d := (a-b)+(a-c)+(a-c).

Teaching Plan

No. of
No Contents Lecture
Hours
Module - 1(Introduction to Compilers and lexical analyzer) (7 hours)

1.1 Introduction to compilers, Analysis of the source program 1 hour

1.2 Phases of the compiler – Analysis Phases 1 hour
1.3 Phases of the Compiler - Synthesis Phases 1 hour
1.4 Compiler writing tools 1 hour
1.5 The role of Lexical Analyzer, Input Buffering 1 hour
1.6 Specification of Tokens 1 hour
1.7 Recognition of Tokens 1 hour
Module - 2(Introduction to Syntax Analysis) (7 hours)

9
2.1 Role of the Syntax Analyzer- Introduction to Context Free Grammars 1 hour
2.2 Parse Trees and Derivations 1 hour
2.3 Ambiguous grammar- Eliminating ambiguity 1 hour
2.4 Left recursion and left factoring the grammar 1 hour
2.5 Top Down Parsing- Recursive Descent Parsing 1 hour
2.6 First and Follow 1 hour
2.7 Predictive Parsing table constructor for LL (1) grammar 1 hour
Module - 3(Bottom up parsing) (8 hours)
3.1 Bottom-up parsing - Shift Reduce Parsing 1 hour
3.2 LR parsing - algorithm and working- Lecture 1 1 hour
3.3 LR (0) canonical items 1 hour
3.4 Constructing LR (0) Parsing Tables 1 hour
3.5 Constructing SLR Parsing Tables 1 hour
3.6 LR(1) Canonical items 1 hour
3.7 Constructing Canonical LR Parsing Tables 1 hour
3.8 Constructing LALR Parsing Tables 1 hour
Module - 4 (Syntax Directed Translation and Intermediate code Generation) (7 hours)
4.1 Syntax directed definitions 1 hour
4.2 S- attributed definitions, L- attributed definitions 1 hour
4.3 Storage- allocation strategies- Lecture 1 1 hour
4.4 Storage- allocation strategies- Lecture 1 1 hour
4.5 Intermediate languages, Graphical representations 1 hour

4.6 Three-Address code 1 hour

4.7 Quadruples, Triples 1 hour

Module - 5(Code Optimization and Generation) (7 hours)
5.1 Principal sources of optimization- Introduction 1 hour
5.2 Machine dependent optimizations 1 hour

10
5.3 Machine independent optimizations 1 hour
5.4 Basic Blocks and Program Flow Graph: with Examples 1 hour
5.5 Local optimization and Global optimization 1 hour
5.6 Issues in the design of a code generator 1 hour
5.7 Design of a simple code generator. 1 hour

11
 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

AIT 453 GAME PROGRAMMING CATEGORY L T P CREDIT

PEC 3 0 0 3

Preamble: This course introduces game theoretic and practical concepts in various strategic
environments. It covers mathematical foundations of game, strategic form games, mixed
strategies, matrix games and Nash equilibrium and its theoretical concepts. This course helps
the learners to suggest solutions to search and rendering problems through game theoretic
approaches and game programming.

Course Outcomes:
After the completion of the course the student will be able to

CO 1 Make use of the concepts of linear algebra and probability to solve computational
problems. (Cognitive Knowledge Level: Apply)
CO 2 Explain the concepts of Game Theory. (Cognitive Knowledge Level: Understand)
CO 3 Use the concepts of Strategic Form Games, Mixed strategies and Matrix Games in
computational problems.(Cognitive Knowledge Level: Apply)
CO 4 Develop algorithms for path finding in games involving searching. (Cognitive
Knowledge Level: Apply)
CO 5 Develop solutions for strategic games using OpenGL.(Cognitive Knowledge Level:
Apply)

Program Outcomes ( PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

PO6 The Engineer and Society PO12 Life long learning

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2

CO3

CO4

CO5

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 20 20 20

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate
Create

Mark distribution
Total CIE ESE ESE
Marks Duration

150 50 100 3 hours

 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

1. Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall be
preferably conducted after completing remaining part of the syllabus. There will be two parts: Part A
and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed modules
and 1 question from the partly completed module), having 3 marks for each question adding up to 15
marks for part A. Students should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed modules and 1 question from the partly completed
module), each with 7 marks. Out of the 7 questions, a student should answer any5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
full questions from each module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module 1 (Mathematical Preliminaries)

Probability theory – random variable(continuous and discrete), axioms, cumulative

distribution function, probability density function, Bayes rule, joint distribution. Linear
Algebra – vector space, span, independence, basis, rank. Set theory – open set, closed set,
convex sets etc. Optimization – basic concepts, simplex algorithm.

Module 2 (Introduction to Game Theory)

Introduction to game theory – trends and applications of game theory. Introduction to

Strategic form games – preferences, utilities, rationality, intelligence, classification of games.
Introduction to Extensive form games – definition, transform to strategic form.

Module 3 (Strategic Form Games)

Strategic form games – matching pennies, various forms like RPS, BOS, co-ordination,
prisoner dilemma, company dilemma games etc. Dominant strategy equilibria – strong, weak
and very weak dominance and illustrations. Pure strategy Nash equilibria – illustrative
examples, games without pure strategy Nash equilibria(NE), interpretations of NE, maxmin
and minmax values.

Module 4 (AI and Game programming)

 BTECH ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

State Machine Behaviors - Designing a State Machine, Basic State Machine Implementation,
States as Classes. Pathfinding – Graphs, Breadth-First Search, Heuristics, Greedy Best-First
Search, A* Search, Dijkstra’s Algorithm, Following a Path. Game Trees-. Minimax, Alpha-
Beta Pruning

Module 5 (Game programming in OpenGL)

Initializing OpenGL- Setting Up the OpenGL Window, Rendering a Frame. Triangle Basics -
Normalized Device Coordinates, Vertex and Index Buffers, Shaders- Vertex Shaders,
Fragment Shaders. Transformation Basics - Object Space -World Space-Transforming to
World Space. Matrices and Transformations -Matrix Multiplication, Transforming a Point by
Using a Matrix, Transforming to World Space. Texture Mapping- Loading the Texture-
Updating the Shaders-Alpha Blending.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Let λ1, λ2,…, λn be the eigen values of the matrix A ϵ Rnxn. Show that the eigen values of
the matrix In - A are 1 - λ1, 1 - λ2, …, 1 - λn.
2. Solve the following problem using Simplex method (Show the tableau).
Maximize:

Subjected to:

Course Outcome 2 (CO2)

1. Define a game. What is the difference between a non-cooperative game and a cooperative
game?

2. What is intelligence and how is it different from rationality?

Course Outcome 3(CO3):

1. There are n players. Each player announces a number in the set 1,2, ..., m where m is a
fixed positive integer. A prize of One Rupee is split equally between all the people whose
number is closes to two thirds of the average number. Formulate this as a strategic form game.

2. Find the max-min values, min-max values, max-min strategies, min-max strategies of the
following game:
N = {1, 2}; S1 = S2 = {A, B}
U1 is 0,1,1,1 for (A,A), (A,B), (B,A), and (B,B) resp. U2 is 1,1,1,0 for (A,A), (A,B), (B,A),
and (B,B) resp.
 Course Outcome 4 (CO4):

1. What is heuristic search? How it differs from A* search.?

2. Construct game tree using min-max algorithm and apply alpha beta pruning for the
following game tree.

Course Outcome 5 (CO5):

1. Describe steps in transforming a point to world space with matrices.

2. What is texture mapping? How a triangle is mapped using OpenGL?

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 453

Course Name: GAME PROGRAMMING

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1 State the axioms of probability.

2 Illustrate the concept of Bayes theorem.
3 How intelligence differ from rationality?
4 List any three applications of game theory.
5 A strategic form game has 2 players having 3 strategies each. What is the
minimum number and maximum number of pure strategy Nash equilibria for
such a game?
6 Compare weak and strong dominance.
7 What is meant by heuristics? How heuristics help in game searching?
 Model Question Paper

8 Write min-max algorithm for game programming.

9 Differentiate object space and world space.
10 Illustrate normalized device coordinates. (10x3=30)
Part B
(Answer any five questions. Each question carries 7 marks)
Module 1
(a) Define the following terms and an example for each. (7)
1. Vector space
2. Linear independence
3. Basis
(b) Let λ1, λ2,…, λn be the eigen values of the matrix A ϵ R nxn. Show that the
eigen values of the matrix In - A are 1 - λ1, 1 - λ2, …, 1 - λn.

or
12.(a) Solve the following problem using Simplex method (Show the tableau). (7)
Maximize:

Subjected to:

(b) Let S be any finite set with n elements. Show that the set ∆(S), the set of all
probability distributions over S, is a convex set.
Module 2
13. (a) Define a game. What is the difference between a non-cooperative game and (7)
a cooperative game?
(b) There are n players. Each player announces a number in the set 1,2, ..., m
where m is a fixed positive integer. A prize of One Rupee is split equally
between all the people whose number is closes to two thirds of the average
number. Formulate this as a strategic form game.

or
14. (a) Braess paradox game: For the version without the link AB, we showed that (7)
any strategy profile with 500 players playing strategy A and 500 players
playing strategy B is a PSNE. Are there any other PSNEs?
 Model Question Paper

(b) First Price Auction: Assume two bidders with valuations v1 and v2 for an
object. Their bids are in multiples of some unit (that is, discrete). The
bidder with higher bid wins the auction and pays the amount that he has
bid. If both bid the same amount, one of them gets the object with equal
probability 12 . In this game, compute a pure strategy Nash equilibrium of
the game.
Module 3
15. (a) Compute a Nash equilibrium for the two person game with S1 = {0, 1} , S2 (7)
= {3, 4} U1(x, y) = −U2(x, y) = |x − y| ∀ (x, y) ∈ {0, 1} × {3, 4}.

(b) Show that any strictly dominant (mixed) strategy in a strategic form game
must be a pure strategy.

or
16. (a) Find all mixed strategy Nash equilibria, applying the NASC, of the (7)
following game:
N = {1, 2}; S1 = S2 = {A, B};
U1 is 4,0,1,1 for (A,A), (A,B), (B,A), and (B,B) resp. U2 is 1,4,5,1 for
(A,A), (A,B), (B,A), and (B,B) resp.
(b) Find the max-min values, min-max values, max-min strategies, min-max
strategies of the following game:
N = {1, 2}; S1 = S2 = {A, B}
U1 is 0,1,1,1 for (A,A), (A,B), (B,A), and (B,B) resp. U2 is 1,1,1,0 for
(A,A), (A,B), (B,A), and (B,B) resp.
Module 4
17. (a) Write and explain dijkstra’s algorithm with the help of a graph (7)
(b) What is min-max algorithm for game searching? Explain with a tree to find
the game path.

or
 Model Question Paper

18 (a) Consider a game tree with 4 levels in which static evaluation score are all from
the players point of view. Suppose the first player is the maximizing player.
What move should be chosen? Illustrate how min max algorithm is used to
solve this problem. (Static evaluation score range is (+20 to -20))

(b) What is the use of alpha-beta pruning in goal searching? Apply alpha-beta
pruning in the following tree.

Module 5

19 (a) Apply matrix transformations to map a point in object space to world space.

(b) Write note on texture mapping with filtering techniques.

or

20 (a) Explain the steps to apply rendering in OpenGL.

(b) What is the function of shaders in game programming? Elaborate on

different types of shaders.

Course Plan
No Topic No. of
Lectures ( 38)
1 Module 1 (Mathematical Preliminaries)
1.1 Probability theory – random variable(continuous and discrete), axioms, 3
cumulative distribution function, probability density function, Bayes rule,
 joint distribution.
1.2 Linear Algebra – vector space, span, independence, basis, rank. Set 3
theory – open set, closed set, convex sets etc.
1.3 Optimization – basic concepts, simplex algorithm. 2
2 Module 2 (Introduction)
2.1 Introduction to game theory – trends and applications of game theory. 2
2.2 Introduction to Strategic form games – preferences, utilities, rationality, 3
intelligence, classification of games.
2.3 Introduction to Extensive form games – definition, transform to strategic 3
form.
3 Module 3 (Strategic Form Games)
3.1 Strategic form games – matching pennies, various forms like RPS, BOS, 3
coordination, prisoner dilemma, company dilemma games etc.
3.2 Dominant strategy equilibria – strong, weak and very weak dominance 2
and illustrations.
3.3 Pure strategy Nash equilibria – illustrative examples, games without pure 3
strategy Nash equilibria(NE), interpretations of NE, maxmin and minmax
values.
4 Module 4 (AI and Game programming)
4.1 State Machine Behaviors - Designing a State Machine, Basic State 2
Machine Implementation, States as Classes.

4.2 Pathfinding – Graphs, Breadth-First Search, Heuristics, Greedy Best- 3

First Search, A* Search, Dijkstra’s Algorithm, Following a Path.
4.3 Game Trees-. Minimax, Alpha-Beta Pruning 2

5 Module 5 (Game programming using OpenGL)

5.1 Initializing OpenGL- Setting Up the OpenGL Window, Rendering a 1
Frame.

5.2 Triangle Basics - Normalized Device Coordinates, Vertex and Index 2

Buffers, Shaders- Vertex Shaders, Fragment Shaders, Writing Basic
Shaders, Loading Shaders.
5.3 Transformation Basics - Object Space -World Space-Transforming to 2
World Space.Matrices and Transformations -Matrix Multiplication,
Transforming a Point by Using a Matrix, Transforming to World Space.
5.4 Texture Mapping- Loading the Texture- Updating the Vertex Format- 2
Updating the Shaders-Alpha Blending,

Reference Books

1. Y. Narahari. Game Theory and Mechanism Design. IISc Press and the World Scientific.
2014.
2. Michael Maschler, Eilan Solan, and Schmuel Zamir, Game Theory. Cambridge University
Press, 2013.

3. Sheldon M. Ross, A First Course in Probability. Pearson, Eighth Edition, 2010.

4. Game Programming in C++: Creating 3D Games, First Edition, Published by Addison-

Wesley Professional, 2018

5. Vasek Chvatal, Linear Programming. W.H. Freeman & Company, 1983.

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CATEGORY L T P CREDIT
CST463 WEB PROGRAMMING
Program 2 1 0 3
Elective II

Preamble: This course helps the learners to understand the web programming
concepts. It includes the essential frontend and backend technologies needed for
the development of web applications. The learners will have an opportunity to
gain necessary web development skills such as HTML, CSS, JavaScript, PHP,
MySQL integration, JSON and Laravel framework.

Prerequisite: Knowledge of Programming is required.

Course Outcomes: After the completion of the course the student will be able to

CO1 Use HyperText Markup Language (HTML) for authoring web pages and
understand the fundamentals of WWW. (Cognitive Knowledge Level:
Understand)

CO2 Construct and visually format responsive, interactive web pages using
CSS and JavaScript (JS) (Cognitive Knowledge Level: Apply)

CO3 Construct websites using advanced sever side programming tool PHP
(Cognitive Knowledge Level: Apply)

CO4 Develop dynamic web applications using PHP and perform MySQL
database operations. (Cognitive Knowledge Level: Apply)

CO5 Explain the importance of object exchange formats using JSON and the
MVC based web application development frameworks (Laravel)
(Cognitive Knowledge Level: Understand)
 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

Mapping of course outc

comes with program outcomes
P PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
O

CO1

CO2

CO3

CO4

CO5

Abstrract POs defined by National Board of

Accreditation

PO# Bro
oad PO PO# Broad
PO

PO1 Engineering Kn
nowledge PO7 Environment and Sustainability

PO2 Problem Analys

sis PO8 Ethics

PO3 Design/Develop
pment of PO9 nd team work
Individual an
solutions
Conduct
PO4 investigations of
o PO1 Communicatiion
complex proble
ems 0

PO5 Modern tool us

sage PO1 gement and Finance
Project Manag
1

PO6 The Engineer and

a Society PO1 ning
Life long learn
2
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Test Test 2 Marks (%)
1 (%) (%)

Remember 20 20 20

Understand 40 40 40

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing the remaining part of the syllabus. There will be two parts: Part A
and Part B. Part A contains 5 questions (preferably, 2 questions each from the
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have a maximum
of 2 subdivisions and carries 14 marks.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module – 1 (WWW, HTML)

Introduction to the Internet & WWW: Evolution of Internet & World Wide Web-
Web Basics, URI’s & URL-MIME.

Introduction to HTML5: Structuring & editing an HTML5 document,

Fundamentals of HTML - Headings-Hyper Links- Images - Special Characters &
Horizontal Rules-Lists- Tables -Forms - Internal Linking- Meta Elements-HTML5
Form input types -Input and Data List Elements and autocomplete attribute-
Page Structure Elements -Multimedia-HTML5 Audio & video elements..

Module -2 (CSS, JavaScript)

Introduction to Stylesheets : Introduction to CSS-Basic syntax and structure-

Inline Styles, Embedded Style Sheets, Conflict Resolution, Linking External Style
Sheets-Exploring CSS Selectors-Properties, values, Positioning Elements:
Absolute Positioning, Relative Positioning -

Backgrounds-List Styles-Element Dimensions- Table Layouts-Box Model and

Text Flow-div and span -Basics of Responsive CSS, Media port & Media Queries.

Introduction to JavaScript : Introduction to Scripting- Programming fundamentals of

JavaScript
-Obtaining User Input with prompt Dialogs-Arithmetic-Decision Making -Control
Statements - Functions -Arrays -Objects -Document Object Model (DOM) -Form
processing

Module- 3 (PHP Basics)

PHP Language Structure: Introduction- Building blocks of PHP-Variables, Data

Types -simple PHP program-Converting between Data Types- Operators and
Expressions -Flow Control functions - Control statements- Working with
Functions- Initialising and Manipulating Arrays-- Objects- String Comparisons-
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

String processing with Regular Expression

Module -4 (PHP- MySQL, JSON)

Advanced PHP: Form processing and Business Logic-Cookies- Sessions &

MySQL Integration- Connecting to MySQL with PHP- Performing CREATE,
DELETE, INSERT, SELECT and UPDATE operations on MySQL table -Working
with MySQL data-Reading from Database- Dynamic Content.

Module- 5 (JSON, Laravel)

JSON Data Interchange Format: Syntax, Data Types, Object, JSON Schema,
Manipulating JSON data with PHP

Web Development Frameworks: Laravel Overview-Features of Laravel-Setting

up a Laravel Development Environment-Application structure of Laravel-Routing
-Middleware-Controllers- Route Model Binding-Views-Redirections-Request and
Responses.

Text Books

1 Paul J. Deitel, Harvey M. Deitel, Abbey Deitel, Internet & World

Wide Web How to Program 5th Edition [Module 1,2,3,4]
2. Lindsay Bassett, Introduction to JavaScript Object Notation: A To-the-Point
Guide to JSON 1st Edition, O’Reilly [Module 5]
3. Julie C. Meloni, Pearson -PHP, MySQL & JavaScript All in One, Sams Teach
Yourself,5th Ed [Module 4]
4. Matt Stauffer,” LARAVEL up and Running, A framework for building modern
PHP apps”1st Edition, O’REILLY [Module 5]
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Reference Books

1. Robert W Sebesta, Programming the World Wide Web, 7/e, Pearson Education Inc,8th
Edition

2. Larry Ullman, Pearson- PHP 6 and MySQL 5 for Dynamic Web Sites: Visual QuickPro
Guide

3. Eric van der Vlist, Danny Ayers, Erik Bruchez, Joe Fawcett, Alessandro
Vernet",Wrox- Professional Web 2.0 Programming, Wiley-India edition
4. Web Technologies Black Book 2018(As per Mumbai University Syllabus)
HTML, CSS3, JavaScript, iQuery, AJAX,PHP,XML,MVC and Laravel DT
Editorial Services (ISBN: 9789386052490)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment

Questions

Course Outcome 1 (CO1):

1. Construct a valid HTML document for your personal Profile registration page for
a Job Site www.123Jobs.com. Add relevant HTML elements in a table, to accept
a minimum of 10 different fields which includes your name, address, phone,
email address, your picture, your college; your branch, fields for your personal
history (Minimum 3 fields), favourite theory and practical subjects (Checkbox),
Username, Password(password)

2. What is MIME? Give the expansion of MIME. List four examples for MIME
types. State the reason why MIME type specification is necessary in a request-
response transaction between a browser and server.

3. What is codec? Recognize the role of controls attribute in <video> & <audio> tag
in HTML. Use the COVID vaccination promotional video ‘MySafety.mp4’ in a web
page with suitable HTML code, ‘autoplay’ option enabled and displayed in a
standard dimension 750 X500.

Course Outcome 2 (CO2):

1. Organize a sample web page for the event ‘Raagam2021’ at your campus and
use embedded Style sheets to apply a minimum 5 styles. State the Style
Specificationformat of embedded style sheets.

2. Write CSS style rules to implement the following in a web page:

a. to display the content of hyperlinks with yellow background color and in italics

b. to display the contents of unordered lists in bold and in Arial font

c. to display a background image titled “birds.jpg” with no tiling.

3. Write the code for an HTML document with embedded JavaScript scripts, which
initially displays a paragraph with text "Welcome" and a button titled "Click".
When the button is clicked, the message "Hello from JavaScript" in bold should
replace the paragraph text
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 3 (CO3):

1. Write a PHP program to store the name and roll no of 10 students in an

Associative Array and Use for each loop to process the array and Perform a sort,
r sort and k sort in the array. Illustrate with suitable output data

2. Design an HTML page which enters a given number, write a PHP program to
display a message indicating, whether the number is odd or even, when clicking
on the submit button.

3. Write a PHP program to compute the sum of the positive integers up to 100
using do while.

Course Outcome 4 (CO4):

1. Write a PHP form handling program to verify the user authentication credentials
of a web page using MySQL connection and store the userid value as a Session
variable if the userid is valid.

2. Create a valid HTML document for yourself, including your name, address, and
email address. Also add your college; your major and the course. Perform form
handling in PHP and process the output using POST method.

3. Write an embedded PHP script which displays the factorial of all numbers from
1 to 10 in a table in the web page. The factorial should be calculated and
returned from a function. The table headings should be "Number" and
"Factorial"

Course Outcome 5 (CO5):

1. What is Route Model Binding in Laravel? Which types of route

model binding are supported in Laravel?

2. Explain how laravel performs route handling using routes calling controller
methods?

3. List the data types used in JSON? Explain the use of parse () and
stringify() functions in JSON with examples.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question
Paper

QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL

UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code:
CST463

Course Name: Web Programming

Max. Marks : 100 Duration: 3

Hours

PART A

Answer All Questions. Each Question Carries 3

Marks

1. Define WWW. List any two examples of web server & web browser.
Differentiate between URL and a domain?

2. Write the syntax of the URL? Rewrite the default URL of your university
website by adding a sub domain named ‘Research’ and a web page named
‘FAQ.html’. Also link this URL through the logo of ‘kturesearch.png’ placed in
a web page. The FAQ page should be opened in a new window.

3. Illustrate the implementation of a JavaScript function greeting () using

external .js file, to display a welcome message, when you click on a Button in
an HTML page.

4. What are different ways of adjusting spacing in a text with suitable example.
 CE AND MACHINE LEARNING
B TECH IN ARTIFICIAL INTELLIGENC

5. Discuss the various CSS style sheet levels with suitable examples. How are
conflicts resolved when
w multiple style rules apply to a single web page
element?

6. Describe how input from an HTML form is retrieved in a PHP program,

with an example

7. Write a PHP program e number or not.

m to check whether a number is prime

8. Discuss the various steps for establishing PHP-MySQL

L connection with a
MySQL database?

9. Describe the schem n JSON with

ma of a document implemented in
suitable examples

10 Explain the role of Resource

R controllers in Laravel.
.
(10x3=30)

Part B

(Answer any one

o e. Each
question from each module
question carries
s 14 Marks)

11 (a) Design a webpag

ge that displays the following table. (6)
.

(b) What is the diffe heckboxes

ference between radio buttons and ch (8)
nted using HTML? Write HTML code to
when implemen
implement a form
m which has the following elements:
i. A textbox wh aracters
hich can accept a maximum of 25 cha
ii. Three radio buttons
b with valid Label, Names and values
k boxes buttons with valid Label, Names and
iii. Three check
values
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

iv. A selection list containing four items, two which are always
visible
v. A submit button clicking on which will prompt the
browser to send the form data to the server
“http://www..mysite.com/reg.php” using “POST” method
and reset button to clear its contents. You can use any
text of your choice to label the form elements.

OR

12 (a) Write the equivalent HTML code to implement the following in a (6)
. web page:
(i) An image titled “birds.jpg” with a height of 100 pixels and
width of 200 pixels. If the image cannot be accessed, a
message “No image available” should be displayed (ii) A
hyperlink to the URL “www.mysite.com/birds.jpg”. The
hyperlink should have the label “Click Here”.

(b) Create a static HTML document for your portfolio, which (8)
includes the following contents: your name, address, Mobile
Number and email address.Also add the details about your
college, university, your major and the batch
of study. Include a picture of yourself and at least one other
image (friend/pet/role model) to the document with a short
description about that. Add three paragraphs about your personal
history, with links to your social media profile. Also create an
ordered list for describing your Skill Set & an unordered list
showing your Strengths & Weaknesses.

13. (a) Illustrate the usage of JavaScript DOM in event handling and (8)
explain anythree methods with example.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Write CSS and the corresponding HTML code for the following: (6)
i. Set the background color for the hover and active link states to
"green"

ii. Set the list style for unordered lists to "square".

iii. Set "Flower.png" as the background image of the page

and set 3% margin for the pages
iv. Set dashed border for left and right and double border for
top & bottomof a table with 2 rows.

OR

14. (a) List the order of precedence of style levels. Organize a sample web (6)
page for providing ‘KTU BTech Honours Regulation 19’ for KTU
and use embedded Style sheet to apply minimum 5 styles for list,
tables and pages.

(b) Illustrate the different ways of Array declaration in JavaScript. (8)

Describe the function of the following JavaScript Array object
methods with examples.
(i) join (ii) slice

15. (a) Explain any six string handling functions used in PHP with example. (6)

(b) How does a PHP array differ from an array in C? List the different (8)
ways to create an array in PHP with an example. Explain any 4
functions that deals with PHP array.

OR

16. (a) During the process of fetching a web page from a web server to a (6)
client browser, at what point does an embedded PHP script get
executed. What are the two modes that the PHP processor
operates in? Explain

(b) Why is PHP considered to be dynamically typed? Distinguish (8)

between
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

implode and explode function in PHP with suitable examples.

17. (a) Write equivalent PHP statements corresponding to the following: (8)

i. Declare an associative array named “ages” to store the

key-value pairs (“Alice”, 30), (“Bob”, 30), (“Harry”, 35),
(“Mary”, 32).

ii. Modify the value associated with the key “Mary” to 28.

iii. Sort the array according to values maintaining the

key-value relationships and print the sorted key-value
pairs.

iv. The entry identified by the key “Bob”

(b) What are the uses of cookies in web pages? Describe syntax for (6)
setting cookies in PHP. How can you access and delete the
cookie using setcookie() function?

OR

18. (a) Write a PHP form handling program to perform the user (8)
registration of any website with a minimum of 5 different fields
and insert the data into aMySQL table after establishing
necessary connections with the DB,

(b) Design the HTML page which enters a given number and embed (6)
the PHP code to display a message indicating, whether the
number is odd or even, when clicking on the ‘CHECK NUMBER’
button.

19. (a) With a neat diagram, explain about Laravel MVC Framework. (6)

(b) Discuss in detail about Laravel’s Routing mechanisms. (8)

OR
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

20. (a) Enumerate the data types in JSON. Illustrate the document (8)
definition of a‘Student document ‘using JSON Schema.

(b) Discuss the following in Laravel Views (6)

i. Creating & Rendering Views

ii. Passing Data to Views

iii. Sharing Data with All Views
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

CONTENTS No of Lecture Hrs

No (35 hrs)

Module 1 (7 hours)

Introduction to Internet and WWW

1.1 Evolution of Internet &World Wide Web- Web 1

Basics URI’s & URL -MIME [Book 1 - Chapter 1]

Introduction to HTML5

1.2 Structuring & editing an HTML5 document- 1

Fundamentals of HTML, Headings- Images [Book 1 -
Chapter 2]

1.3 Hyper Links, Internal Linking- Lists [Book 1 - Chapter 1

2]

1.4 Special Characters & Horizontal Rules- 1

meta Elements- div and span [Book 1 -
Chapter 2]

1.5 Tables- Forms [Book 1 - Chapter 2] 1

1.6 HTML5 Form input types, input and data 1

list Elements and autocomplete attributes-
Page Structure Elements [Book 1 - Chapter
3]

1.7 Multimedia-HTML5 Audio & video elements [Book 1 - 1

Chapter 9]
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module 2 (10 hours)

Introduction to Cascading Style

Sheets(CSS)

2.1 Introduction to CSS3-Basic syntax and structure- 1

Inline Styles [Book 1 - Chapter 4]

2.2 Embedded Style Sheets-Linking External Style Sheets 1

[Book 1 - Chapter 4]

2.3 Exploring CSS Selectors-Properties-values [Book 1 - 1

Chapter 4]

2.4 Positioning Elements: Absolute Positioning- Relative 1

Positioning -Backgrounds- List Styles- Table Layouts
[Book 1 - Chapter 4]

2.5 Box Model and Text Flow, Basics of Responsive CSS- 1

Media port & MediaQueries [Book 1 - Chapter 4]

Introduction to
JavaScript

2.6 Introduction to Scripting- Programming fundamentals of 1

JavaScript - ObtainingUser Input with prompt Dialogs
[Book 1 - Chapter 6]

2.7 Arithmetic-Decision Making [Book 1 - Chapter 6] 1

2.8 Control Statements [Book 1 - Chapter 7]- Functions [Book 1 - 1

Chapter 9]

2.9 Arrays [Book 1 - Chapter 10] - Objects [Book 1 - Chapter 11] 1

2.1 Document Object Model (DOM)- Form processing [Book 1 - 1

0 Chapter 12,13]

Module 3 (6 hours)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Introduction to PHP

3.1 Building blocks of PHP-Variables, Data Types simple PHP 1

program [Book 3-Chapters 4]

3.2 Converting between Data Types, Operators and Expressions -Flow 1

Controlfunctions [Book 1- Chapters 19]

3.3 Control Statements -Working with Functions [Book 3- Chapters 6] 1

3.4 Initialising and Manipulating Arrays- Objects [Book 1- Chapters 1

19]

3.5 Working with Strings-String processing with Regular expression, 1

Pattern Matching[Book 1- Chapters 19]

3.6 Form processing and Business Logic [Book 1- Chapters 19] 1

Module 4 (6 hours)

PHP -MYSQL

4.1 Cookies- Sessions [Book 1- Chapters 19] 1

4.2 PHP& MySQL Integration-Connecting to 1

MySQL with PHP .[Book 4- Chapters 18]

4.3 Working with MySQL data [Book 4- Chapters 18] 1

4.4 Performing CREATE, DELETE, INSERT operations on MySQL table 1

from PHP Program. [Book 4- Chapters 16]

4.5 Performing SELECT and UPDATE operations on MySQL table 1

from PHP Program. [Book 4- Chapters 16]

4.6 Building Dynamic Content in PHP application [Book1- Chapter19] 1

Module 5 (6
hours)

JSON

5.1 JSON Data Interchange Format -Syntax, Data 1

Types, Object [Book 2 - Chapters 1-2]
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.2 JSON Schema, Manipulating JSON data with PHP [Book 2 - Chapter 1
3,4]

LARAVEL

5.3 Laravel Overview- Design Pattern- Laravel Features [Book 4- 1

Chapters 1] Setting up a Laravel Development Environment-
Application structure of Laravel [Book 4- Chapters 2]

5.4 Laravel Basics Routing -middleware - Controllers [Book 4- Chapters 1

3]

5.5 Route Model Binding-Views-Redirections [Book 4- Chapters 3] 1

5.6 Blade Templating-echoing data, control structures [Book 4- 1

Chapters 4]
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMT OPTIMIZATION Category L T P Credit

473 TECHNIQUES IN
Program 3 0 0 3
MACHINE LEARNING
Elective II

Preamble:

Most problems in machine learning can be viewed as optimizing an objective

function,that is often related to the performance measure used in the given
problem under a given set of constraints. Many of these optimization tasks have
special properties such as sparsity, convexity, smoothness or separability, which
invokes a certain family of efficient solutions. This course focuses on
optimization techniques used in machine learning algorithms and models.
Students will learn various optimization algorithms and methodologies to train
and optimize machine learning models. The course covers both classical and
modern optimization methods applicable to machine learning problems. This
course helps the students to gain a comprehensive understanding of
optimization techniques and their practical implementation in machine learning.
Prerequisite:
 Basic knowledge of linear algebra and calculus.
 Familiarity with machine learning concepts and algorithms.
Mapping of course outcomes with program outcomes

CO1 Understand the basics of optimization techniques and their application

in machine learning.(Cognitive Knowledge Level: Understand)

CO2 Apply gradient descent and its variants to optimize machine learning
models effectively.(Cognitive Knowledge Level: Apply)

CO3 Understand and solve convex optimization problems encountered in

machine learning.(Cognitive Knowledge Level: Understand)

CO4 Apply appropriate methods to handle non-convex optimization

problems in machine learning.(Cognitive Knowledge Level: Apply)
 B TECH
T IN ARTIFICIAL INTELLIGENCE AND MACHINE
M LEARNING

CO5 Utilize advanced optimization techniques to optimize complex machine

learning models.((Cognitive Knowledge Level: Apply))

Mapping of course outc

comes with program outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

1 2 3 4 5 6 7 8 9 0 1 2

CO
1

CO
2

CO
3

CO
4

CO
5

Abstrract POs defined by National Board of

Accreditation

PO# Bro
oad PO PO# Broad
PO

PO1 Engineering Kn
nowledge PO7 Environment and Sustainability

PO2 Problem Analys

sis PO8 Ethics
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of

PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Marks (%)
Test 1 Test 2
(%) (%)

Remember 20 20 20

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contain 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

Module 1(Introduction to Optimization in Machine Learning)

General form of optimization problem, the basic convex optimization problem

formulation. Convex and non-convex optimization problems. Unconstrained and
constrained optimization. Overview of optimization techniques and their role in
machine learning. Introduction to objective functions, constraints, and
optimization problems. Algorithms for solving optimization problems in machine
learning.
Module 2(Gradient Descent and Variants)
Gradient descent algorithm and its variants: gradient descent, stochastic
gradient descent, and mini-batch gradient descent, Adaptive learning rate
algorithms - AdaGrad (Adaptive Gradient), RMSprop (Root Mean Square
Propagation), Adam (Adaptive Moment Estimation). Convergence analysis and
learning rate selection. Regularization techniques for gradient descent - L1
(Lasso), L2 (Ridge), Elastic Net, Dropout, Early Stopping, Batch Normalization,
Data Augmentation.
Module 3(Convex Optimization)
Introduction to convex optimization and its significance in machine learning.
Convex sets, Convex functions, and optimization problems. Convex optimization
algorithms: subgradient method, projected gradient descent, and interior-point
methods. Linear programming, Quadratic programming, Geometric
programming, Semi-definite programming.
Module 4(Non-convex Optimization)
Challenges and techniques for non-convex optimization in machine learning.
Examples of non-convex functions. Local search algorithms: hill climbing,
simulated annealing, and genetic algorithms. Convex relaxations of non-convex
functions and global optimization techniques - Bayesian optimization.
Applications - matrix completion, Image reconstruction, recommendation
systems.
Module 5(Advanced Optimization Techniques)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Newton's method and its variants: Newton-Raphson and Gauss-Newton.

Conjugate gradient method and its applications in machine learning. Quasi-
Newton methods: Broyden-Fletcher-Goldfarb-Shanno(BFGS) and limited-
memory Broyden-Fletcher-Goldfarb-Shanno(L-BFGS).

Reference Books

1. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge

University Press.

2. Bottou, L., Curtis, F. E., & Nocedal, J. (2018). Optimization methods for
large-scale machine learning. SIAM Review, 60(2), 223-311.

3. Goodfellow, I., Bengio, Y., & Courville, A. (2016). Deep learning. MIT
Press.

4. Nocedal, J., & Wright, S. (2006). Numerical optimization. Springer

Science & Business Media.

5. Sra, S., Nowozin, S., & Wright, S. J. (2012). Optimization for machine
learning. MIT Press.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. Suppose that there are m basic nutrients. A healthy diet needs bj units of
jth nutrient per day. There are n different food items available, with one
unit of item i containing aji units of nutrient j. Price of food item i is ci per
unit. Formulate this as an optmization problem to minimize the cost of
food per day, while keeping the diet healthy.
2. In portfolio optimization, we seek the best way to invest some capital in a
set of n assets. The variable xi represents the investment in the ith asset,
so the vector x ∈ Rn describes the overall portfolio allocation across the
set of assets. The constraints might represent a limit on the budget (i.e., a
limit on the total amount to be invested), the requirement that
investments are nonnegative (assuming short positions are not allowed),
and a minimum acceptable value of expected return for the whole portfolio.
The objective or cost function might be a measure of the overall risk or
variance of the portfolio return. Formulate this as an optimization problem
that corresponds to choosing a portfolio allocation that minimizes risk,
among all possible allocations that meet the firm requirements.
3. Consider the task of choosing the width and length of each device in an
electronic circuit. Here the variables represent the widths and lengths of
the devices. The constraints represent a variety of engineering
requirements, such as limits on the device sizes imposed by the
manufacturing process, timing requirements that ensure that the circuit
can operate reliably at a specified speed, and a limit on the total area of
the circuit. A common objective in a device sizing problem is the total
power consumed by the circuit. The optimization problem is to find the
device sizes that satisfy the design requirements (on manufacturability,
timing, and area) and are most power efficient. Formulate this as an
optmization problem.
4. In data fitting, the task is to find a model, from a family of potential
models, that best fits some observed data and prior information. Here the
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

variables are the parameters in the model, and the constraints can
represent prior information or required limits on the parameters (such as
nonnegativity). The objective function might be a measure of misfit or
prediction error between the observed data and the values predicted by
the model, or a statistical measure of the unlikeliness or implausibility of
the parameter values. The optimization problem is to find the model
parameter values that are consistent with the prior information, and give
the smallest misfit or prediction error with the observed data. Formulate
this as an optmization problem.
5. Consider a manufacturing company that produces two products, Product
A and Product B. The company wants to determine the optimal
production quantities of each product to maximize the total profit. The
profit per unit for Product A is Rs 10, and for Product B is Rs 15. The
production of Product A requires 2 units of labor and 3 units of raw
material, while the production of Product B requires 3 units of labor and
4 units of raw material. The company has 100 units of labor and 120
units of raw material available. Formulate the optimization problem to
find the optimal production quantities of Product A and Product B.

Course Outcome 2(CO2):

1. Consider a non-linear regression problem with a single feature (x) and a
target variable (y). The true relationship between x and y is y = sin(x) + ε,
where ε is random noise. Generate a synthetic dataset of 100 samples
from this relationship. Use gradient descent to find the optimal
parameters that fit a sine function to the data by minimizing the mean
squared error loss function. Start with initial guesses for the amplitude,
frequency, and phase of the sine function, and perform 20 iterations of
gradient descent with a learning rate of 0.1.
2. Use mini-batch gradient descent to train a neural network with two
hidden layers on the MNIST dataset for digit classification. Set the batch
size to 64 and the learning rate to 0.001. Perform 100 iterations of mini-
batch gradient descent and monitor the training loss and accuracy.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Implement batch gradient descent to solve a multivariate linear regression

problem with three features (x₁, x₂, x₃) and a target variable (y). Use the
following data points:
(x₁₁, x₁₂, x₁₃, y₁) = (1, 2, 3, 5)
(x₂₁, x₂₂, x₂₃, y₂) = (2, 3, 4, 8)
(x₃₁, x₃₂, x₃₃, y₃) = (3, 4, 5, 12)
Initialize the weights randomly and perform 10 iterations of gradient
descent with a learning rate of 0.01.
4. You are given the function f(x) = 3x^2 + 2x - 5. Use gradient descent to
find the minimum of this function. Start with an initial guess of x = 0 and
a learning rate of 0.01. Perform five iterations of gradient descent and
report the updated value of x after each iteration.

Course Outcome 3(CO3):

1. Given an example of a closed set in R2whose convex hull is not closed.
2. Show that if Si ∈ Rn, i ∈ I is a collection of convex sets, then their
intersection is also convex.
3. Let A ∈ Rm×n. Show that if S ∈ Rn is convex then so is A(S) = {Ax : x ∈ S},
called the image of S under A.
4. Give an example of a strictly convex function that does not attain its
infimum.
5. Show that a set is convex if and only if its intersection with any line is
convex. Show that a set is affine if and only if its intersection with any line
is affine.
6. Give an explicit solution to the following Linear Program.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

7. Provide necessary and sufficient conditions under which a quadratic

optimization problem be written as a linear least squares problem.
8. State the first- and second-order conditions for optimality for Linear least
squares and Quadratic Optimization.
9. A company wants to optimize the production of two products, Product A
and Product B. The profit per unit for Product A is given by f1(x, y) = 5x +
3y, and for Product B is given by f2(x, y) = 4x + 6y, where x and y
represent the production quantities of Product A and Product B,
respectively. The company has constraints on the labor and raw material
availability given by g1(x, y) = 2x + 3y ≤ 10 and g2(x, y) = x + y ≤ 6.
Formulate a convex optimization problem to maximize the total profit
while satisfying the constraints.
10. Solve the following convex optimization problem using the
subgradient method:
Minimize: f(x) = |x - 3| + |x + 2|
Start with an initial guess of x = 0 and iterate until the subgradient norm
falls below a tolerance of 0.01.

Course Outcome 4(CO4): .

1. Consider a traveling salesperson problem where you want to find the
shortest route to visit a set of cities and return to the starting city.
Implement a hill climbing algorithm to solve this problem, starting from a
randomly chosen initial route. Perform iterations of the hill climbing
algorithm until convergence, and report the final shortest route discovered.
2. You are given a two-dimensional landscape represented by a matrix where
each element represents the height at that position. You want to find the
highest point in the landscape using a hill climbing algorithm. Starting
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

from a randomly chosen position, perform iterations of the hill climbing

algorithm until convergence, and report the final highest point discovered.
3. You are given a function f(x) = -x^2 + 3x - 2 and want to find the
maximum value using simulated annealing. Start with an initial solution x
= 0 and perform iterations of simulated annealing until convergence.
Report the final maximum value discovered.
4. You have a function f(x, y) = sin(x) + cos(y) and want to find the maximum
value using simulated annealing. Start with an initial solution (x, y) = (0, 0)
and perform iterations of simulated annealing until convergence. Report
the final maximum value discovered and the corresponding (x, y)
coordinates.
5. You have a function f(x, y) = sin(x) + cos(y) and want to find the maximum
value using a genetic algorithm. Implement the genetic algorithm with
appropriate selection, crossover, and mutation operators. Start with a
randomly generated initial population of solutions, perform iterations until
convergence, and report the final maximum value discovered and the
corresponding (x, y) coordinates.
6. Consider a function f(x) = -x^2 + 3x - 2 and want to find the maximum
value using Bayesian optimization. Start with an initial set of data points,
perform iterations of Bayesian optimization until convergence, and report
the final maximum value discovered.
7. You have a set of design parameters and want to optimize the performance
of a machine learning model using Bayesian optimization. Implement
Bayesian optimization with appropriate acquisition function and surrogate
model. Start with an initial set of design parameters, perform iterations
until convergence, and report the final optimized design parameters.
8. For the following optimization problem, derive the KKT conditions. Find all
solutions that satisfy the KKT conditions. Which pair corresponds to the
optimum?
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 5(CO5):

1. You are given the equation f(x) = e^x - x^2 + 4. Use the Newton-Raphson
method to find a root of this equation, starting with an initial guess of x_0
= 2. Perform four iterations and report the approximate root after each
iteration.
2. Solve the equation f(x) = 2x^3 + 5x^2 - 3x + 1 using the Newton-Raphson
method. Start with an initial guess of x_0 = -1. Perform five iterations and
report the approximate root after each iteration.
3. You are trying to find a root of the equation f(x) = sin(x) - x^2 + 2. Use the
Newton-Raphson method to find an approximate root, starting with an
initial guess of x_0 = 1. Perform three iterations and report the
approximate root after each iteration.
4. You are given a set of data points (x_i, y_i) and want to fit a model of the
form f(x;θ) = θ_1x^3 + θ_2x^2 + θ_3x + θ_4 to the data. Use the Gauss-
Newton method to find the optimal values of the parameters θ = (θ_1, θ_2,
θ_3, θ_4). Start with an initial guess of θ_0 = (1, 1, 1, 1). Perform three
iterations and report the updated values of θ after each iteration.
5. Consider the following system of linear equations: A * x = b where A is a
symmetric positive definite matrix, x is the unknown vector, and b is the
right-hand side vector.
(a) Describe the Conjugate Gradient method for solving the system of
linear equations. (b) Apply the Conjugate Gradient method to solve the
following system of equations: A = [[4, -1, 0], [-1, 4, -1], [0, -1, 4]] b = [2, 3,
5] Start with an initial guess of x_0 = [0, 0, 0] and perform iterations until
convergence. Report the final solution vector x. Make sure to explain the
steps of the Conjugate Gradient method, including the calculation of the
search direction, step size, and updating of the solution vector at each
iteration.

Note: You can assume that the tolerance for convergence is 0.001.

6. Consider the following system of linear equations:

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

A * x = b,
where A is a symmetric positive definite matrix, x is the unknown vector,
and b is a given vector. Solve the system of equations using the Conjugate
Gradient method. Use the initial guess x_0 = [1, 1, 1]T and perform three
iterations of the Conjugate Gradient method. Report the approximate
solution after each iteration. Make sure to provide the necessary steps
involved in the Conjugate Gradient method, such as calculating the
residual, direction vectors, and updating the solution vector at each
iteration.
7. Consider the following function f(x) = x^4 - 2x^2 + 5x + 2. Use the Quasi-
Newton method with BFGS update to find the minimum of the function.
Perform iterations of the Quasi-Newton method until convergence, and
report the final minimum point discovered. Show all the steps and
calculations involved in each iteration, including the initial guess, gradient
calculation, search direction, step size, updated solution, and updated
Hessian approximation.
8. Consider the following unconstrained optimization problem:
Minimize the function f(x) = x^4 + 2x^3 - 5x^2 + x + 1 using the Quasi-
Newton method. Start with an initial guess of x = 1. Perform iterations of
the Quasi-Newton method until convergence, and report the final
minimized value of the function and the corresponding value of x. Show all
the steps and calculations involved in each iteration, including the update
formula used for the Hessian approximation and the update formula used
for the next iterate.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 5

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 473

Course Name: OPTIMIZATION TECHNIQUES IN MACHINE LEARNING

Max.Marks:100
Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. You want to find the maximum value of a function f(x) = sin(x) +

2x on the interval [0, π]. Formulate an unconstrained
optimization problem to find the maximum value and the
corresponding value of x.

2. Describe the difference between a constrained optimization

problem and an unconstrained optimization problem.

3. Explain the intuition behind the Adagrad algorithm

4. Describe the concept of Momentum in Gradient Descent and how

it helps accelerate convergence.

5. Let C ∈ Rn be a convex set, with x 1, . . . , x k ∈ C, and let

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

θ1, . . . , θk ∈ R satisfy θi ≥ 0, θ1 + · · · + θk = 1. Show that θ1x1

+ · · · + θkxk ∈ C.

6. Consider the function f(x) = ex. Is this function convex or

concave? Justify your answer.

7. Consider a function f(x) = x3 - 2x2 + 5x - 6 and want to find the

minimum value using simulated annealing. Start with an initial
solution x = 0 and perform iterations of simulated annealing
until convergence. Report the final minimum value discovered.

8. Explain the concepts of crossover and mutation in the context of

Genetic Algorithms.

9. Explain how to find a steepest descent direction in the ℓ2-norm,

and give a simple interpretation.

10. Describe the convergence properties of the Conjugate Gradient

Method and explain how it relates to the eigenvalues of the (10x3=30)
coefficient matrix.

Part B

(Answer any one question from each module. Each question carries 14
Marks)

11. (a) A farmer wants to determine the optimal allocation of land (10)
for planting two crops: Wheat and Corn. The farmer has a
total of 100 acres of land available. Each acre of Wheat yields
a profit of Rs 200, while each acre of Corn yields a profit of
Rs 300. Additionally, planting Wheat requires 2 units of
labour per acre, and planting Corn requires 3 units of labour
per acre. The farmer has a total of 200 units of labour
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

available. Formulate and solve the optimization problem to

maximize the farmer's profit.

(b) Describe the steps involved in formulating an optimization (4)

problem.

OR

12. (a) You are designing a rectangular garden and want to (8)
maximize the total area while keeping the perimeter less than
or equal to 100 meters. Formulate a constrained optimization
problem to determine the dimensions of the rectangular
garden that maximize the area.

(b) Explain the difference between a single-objective optimization (3)

problem and a multi-objective optimization problem with an
examples.

(c) Describe the role of decision variables in optimization (3)

problems and how they are used to formulate the problem.

13. (a) Consider a simple linear regression problem with a single (8)
feature (x) and a single target variable (y). Given the following
data points:

(x₁, y₁) = (1, 3)

(x₂, y₂) = (2, 5)

(x₃, y₃) = (3, 7)

Use gradient descent to find the best-fit line (y = mx + b) by

minimizing the mean squared error loss function. Start with
an initial guess for the slope (m) and y-intercept (b), and
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

perform 3 iterations of gradient descent with a learning rate

of 0.01.

(b) What is the role of regularization techniques, such as L1 and (6)

L2 regularization, in Gradient Descent algorithms?

OR

14. (a) What is Mini-Batch Gradient Descent, and how does it strike (6)
a balance between Batch Gradient Descent and Stochastic
Gradient Descent?

(b) Consider the function f(x) = x2. Find the minimum of this (8)
function using gradient descent. Start with an initial guess of
x = 3 and a learning rate of 0.1. Perform three iterations of
gradient descent and report the updated value of x after each
iteration.

15. (a) You have a dataset of (x, y) points and want to find the best- (7)
fit line that minimizes the sum of absolute residuals.
Formulate a convex optimization problem to determine the
optimal slope and intercept of the line.

(b) Consider the following constrained optimization problem: (7)

Minimize: f(x) = x^2 + y^2

Subject to: x + y ≥ 1, x ≥ 0, y ≥ 0

Solve this problem using Projected Gradient Descent. Start

with an initial guess of (x, y) = (0, 0) and iterate for 5 steps.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

16. (a) Consider the following convex optimization problem: (7)

Minimize: f(x) = |x - 1| + |x - 2| + |x - 3|
Solve this problem using the subgradient method. Start with
an initial guess of x = 0 and iterate for 5 steps.

(b) Solve the following linear programming problem using the (7)
interior-point method:
Minimize: f(x) = 2x + 3y
Subject to:
x + 2y ≤ 6
3x + y ≤ 9
x, y ≥ 0
Start with an initial guess of (x, y) = (0, 0) and iterate until
the duality gap falls below a tolerance of 0.001.

17. (a) You have a function f(x, y) = x 2 + y2 representing a two- (7)

dimensional landscape. Implement a hill climbing algorithm
to find the minimum point of this function. Start with a
randomly chosen initial point (x, y), perform iterations until
convergence, and report the final minimum point discovered.

(b) Consider a neural network architecture search problem where (7)

the goal is to find the optimal network architecture for a given
task. Use a Genetic Algorithm to evolve the architecture by
selecting and combining different network components. Start
with an initial population of size 50 and iterate for 200
generations.

OR
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

18. (a) Consider a binary string optimization problem where the goal (7)
is to maximize the number of ones in the string. Use
Simulated Annealing to find the optimal binary string of
length 10. Start with a randomly generated initial string and
iterate until the cooling schedule reaches a certain
temperature.

(b) Consider a job scheduling problem where the goal is to (7)

minimize the total completion time of a set of jobs on a single
machine. Use a Genetic Algorithm to find a near-optimal
schedule. Start with an initial population of size 50 and
iterate for 150 generations.

19. (a) Consider the equation f(x) = x3 - 3x + 1. Use the Newton- (7)
Raphson method to find a root of this equation, starting with
an initial guess of x0 = 1. Perform three iterations and report
the approximate root after each iteration.

(b) Solve the following linear system of equations using the (7)
Conjugate Gradient Method:
Ax = b

where A is a symmetric positive-definite matrix and b is a

given vector. Start with an initial guess x (0) and iterate until
the residual norm falls below a certain tolerance.

OR

20. (a) Consider a nonlinear regression problem where you have a (7)
set of data points (xi, yi) and want to fit a model of the form
f(x;θ) = θ1sin(θ2x) + θ3cos(θ4x) to the data. Use the Gauss-
Newton method to find the optimal values of the parameters
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

θ = (θ1, θ2, θ3, θ4). Start with an initial guess of θ0 = (1, 1, 1,

1). Perform five iterations and report the updated values of θ
after each iteration.

(b) Describe a real-world application or problem that can be (7 )

solved using the Conjugate Gradient Method and explain the
steps involved in applying the method to that problem.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No Topic No. of
Lectures
( 40)
1 Module 1 (Introduction to Convex optimization and Convex Sets)

1.1 General form of optimization problem, the basic convex 1

optimization problem formulation
1.2 Important classes of convex optimization, generalized 1
problem, example: semidefinite programming and its
application in portfolio optimization
1.3 Convex and non-convex optimization problems 1

1.4 Unconstrained and constrained optimization 1

1.5 Overview of optimization techniques and their role in 1

machine learning
1.6 Introduction to objective functions, constraints, and 1
optimization problems
1.7 Introduction to objective functions, constraints, and 1
optimization problems

2 Module 2 (Gradient Descent and Variants)

2.1 Gradient descent, stochastic gradient descent, and mini- 1

batch gradient descent
2.2 Gradient descent, stochastic gradient descent, and mini- 1
batch gradient descent
2.3 AdaGrad (Adaptive Gradient). RMSprop (Root Mean Square 1
Propagation), Adam (Adaptive Moment Estimation)
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.4 AdaGrad (Adaptive Gradient). RMSprop (Root Mean Square 1

Propagation), Adam (Adaptive Moment Estimation)
2.5 Convergence analysis and learning rate selection 1

2.6 L1 (Lasso), L2 (Ridge), 1

2.7 L1 (Lasso), L2 (Ridge), 1

2.8 Elastic Net, Dropout, Early Stopping, Batch Normalization, 1

Data Augmentation.
2.9 Elastic Net, Dropout, Early Stopping, Batch Normalization, 1
Data Augmentation.
3 Module 3 (Convex Optimization)

3.1 Convex sets, Convex functions, and optimization problems 1

3.2 Subgradient method, projected gradient descent, and 1

interior-point methods
3.3 Subgradient method, projected gradient descent, and
interior-point methods
3.4 Linear programming 1

3.5 Quadratic programming 1

3.6 Geometric programming 1

3.7 Semi-definite programming 1

4 Module 4 (Non-convex Optimization)

4.1 Challenges and techniques for non-convex optimization in 1

machine learning
4.2 Examples of non-convex functions 1

4.3 Hill climbing, simulated annealing, and genetic algorithms 1

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.4 Hill climbing, simulated annealing, and genetic algorithms 1

4.5 Hill climbing, simulated annealing, and genetic algorithms 1

4.6 Convex relaxations of non-convex functions 1

4.7 Bayesian optimization 1

4.8 Applications - matrix completion, Image reconstruction, 1

recommendation systems.
4.9 Applications - matrix completion, Image reconstruction, 1
recommendation systems.
5 Module 5 (Advanced Optimization Techniques )

5.1 Newton's method and its variants: Newton-Raphson and 1

Gauss-Newton
5.2 Newton's method and its variants: Newton-Raphson and 1
Gauss-Newton
5.3 Newton's method and its variants: Newton-Raphson and 1
Gauss-Newton
5.4 Conjugate gradient method and its applications in machine 1
learning
5.5 Conjugate gradient method and its applications in machine 1
learning
5.6 Quasi-Newton methods: Broyden-Fletcher-Goldfarb- 1
Shanno(BFGS) and limited-memory Broyden-Fletcher-
Goldfarb-Shanno(L-BFGS).
5.7 Quasi-Newton methods: Broyden-Fletcher-Goldfarb- 1
Shanno(BFGS) and limited-memory Broyden-Fletcher-
Goldfarb-Shanno(L-BFGS).
5.8 Quasi-Newton methods: Broyden-Fletcher-Goldfarb- 1
Shanno(BFGS) and limited-memory Broyden-Fletcher-
Goldfarb-Shanno(L-BFGS).
 COMPUTER
BTECH ARTIFICIAL SCIENCE AND
INTELLIGENCE &ENGINEERING
MACHINE LEARNING

YEAR OF
INTRODUCTION TO CATEGORY L T P CREDIT INTRODUCTION
CST415
MOBILE COMPUTING
OEC 2 1 0 3 2019

Preamble: The purpose of this course is to prepare learners to understand the functionalities
and design considerations of mobile computing. The course content is designed to cover the
mobile computing architecture, features of different communication systems and major
elements of mobile security and next generation computer systems. This course enables the
learners to acquire advanced concepts on mobile and ad-hoc networks.

Prerequisite: A good knowledge of data communication and computer networks.

Course Outcomes: After the completion of the course the student will be able to

CO# Course Outcomes

CO1 Describe the mobile computing applications, services, design considerations

and architectures(Cognitive knowledge: Understand)
CO2 Identify the technology trends for cellular wireless networks(Cognitive
knowledge:Understand)
CO3 Summarize the Short Messaging Service and General Packet Radio Service
(Cognitive knowledge: Understand)
CO4 Outline the LAN technologies used in mobile communication (Cognitive
knowledge: Understand)

CO5 Describe the security protocols and apply suitable security algorithm to
secure the communication (Cognitive knowledge: Apply)

CO6 Explain the fundamental concepts of next generation mobile

networks(Cognitive knowledge: Understand)
 BTECH ARTIFICIAL
COMPUTERINTELLIGENCE
SCIENCE AND & MACHINE LEARNING
ENGINEERING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester Examination

Bloom’s Category
Test 1 (%) Test 2 (%) (%)

Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
 BTECH ARTIFICIAL
COMPUTERINTELLIGENCE & MACHINE LEARNING
SCIENCE AND ENGINEERING

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations shall be conducted for 50 marks. First series test shall
be conducted preferably after completing the first half of the syllabus and the second series
test shall be conducted preferably after completing the remaining part of the syllabus. There
shall be two parts for the question paper: Part A and Part B. Part A shall contain five questions
(preferably, two questions each from the fully completed modules and one question from the
partly covered module), having three marks for each question adding up to 15 marks for part
A. A student is expected to answer all questions from Part A. Part B shall contain seven
questions (preferably, three questions each from the fully completed modules and one question
from the partially completed module), each having seven marks. Out of the seven questions, a
student is expected to answer any five.

End Semester Examination Pattern:

There shall be two parts; Part A and Part B. Part A shall contain 10 questions with 2 questions
from each module, having 3 marks for each question. A student is expected to answer all
questions from Part A. Part B shall contain 2 questions from each module, out of which a
student is expected to answer any one. Each question shall have a maximum of two sub-
divisions and shall carry 14 marks.
 COMPUTER
BTECH SCIENCE
ARTIFICIAL AND ENGINEERING
INTELLIGENCE & MACHINE LEARNING

Syllabus

Module-1 (Mobile Computing Architecture)

Introduction to mobile computing – Functions, Devices, Middleware and gateways,
Applications and services, Limitations. Mobile computing architecture – Internet: The
ubiquitous network, Three-tier architecture, Design considerations for mobile computing.

Module-2 (Communication Systems)

Mobile computing through telephony - Evolution of telephony, Multiple access
procedures - Frequency Division Multiple Access (FDMA), Time Division Multiple
Access (TDMA), Code Division Multiple Access (CDMA), Space Division Multiple
Access (SDMA). Satellite communication systems – Basics, Applications, Geostationary
Earth Orbit (GEO), Low Earth Orbit (LEO), Medium Earth Orbit (MEO), Satellite
phones. Mobile computing through telephone – Interactive Voice Response (IVR)
architecture, Overview of voice software, Developing an IVR application. Global System
for Mobile Communication (GSM) - Introduction, Architecture, Entities, Call routing,
Mobility management, Frequency allocation, Authentication and security.

Module-3 (Short Messaging Service and General Packet Radio Service)

Short Message Service (SMS) – Strengths, Architecture, Value added services, Accessing
the SMS bearer. General Packet Radio Service (GPRS) – Architecture, Network
operations, Data services, Applications, Limitations, Billing and charging.

Module-4 (Wireless Local Area Networks)

Wireless Local Area Network (WLAN) - Advantages, Evolution, Applications,
Architecture, Mobility, Security, Deploying WLAN. Wireless Local Loop (WLL) –
Architecture. High Performance Radio Local Area Network (HIPERLAN). WiFi Vs 3G.

Module-5 (Mobile Security and Next Generation Networks)

Security issues in mobile computing - Information security, Security techniques and
algorithms, Security protocols. Next generation networks – The Converged Scenario,
Narrowband to broadband, Orthogonal Frequency Division Multiplexing (OFDM), Multi
Protocol Label Switching (MPLS), Wireless Asynchronous Transfer Mode (WATM),
Multimedia broadcast services.

Text Books
1. Asoke K. Talukder, Hasan Ahmad, Roopa R Yavagal, Mobile Computing
Technology- Application and Service Creation, 2nd Edition, McGraw Hill Education.
2. Schiller J., Mobile Communications, 2/e, Pearson Education, 2009.
 BTECH COMPUTER
ARTIFICIAL SCIENCE
INTELLIGENCE & MACHINE LEARNING
AND ENGINEERING

Reference Books
1. Andrew S. Tanenbaum, Computer Networks, 6/e, PHI.
2. Theodore S. Rappaport, Wireless Communications Principles and Practice, 2/e, PHI,
New Delhi, 2004.
3. Curt M. White, Fundamentals of Networking and Communication 7/e, Cengage learning.

Course Level Assessment Questions

Course Outcome 1 CO1):

1. Describe the design considerations in mobile computing.
2. Give five examples of mobile computing applications.
Course Outcome 2 (CO2):
1. Draw a call flow diagram for a theatre ticket booking system.
2. Illustrate the GSM architecture with figure.
Course Outcome 3 (CO3):
1. Illustrate the billing and charging services in GPRS.
2. Describe the SMS architecture.
Course Outcome 4 (CO4):
1. Compare IEEE 802.11, HIPERLAN with respect to their ad-hoc capabilities.
2. Discuss the security mechanism used in WLAN.
Course Outcome 5 (CO5):
1. With the help of a suitable example, show the working of Diffie-Hellman key
exchange algorithm.
2. Bob chooses 7 and 11 as two prime numbers and chooses e as 13. Find an
appropriate value for d and decrypt the plaintext 5 send by Alice to Bob.
3. Describe the security issues in mobile computing.
Course Outcome 6 (CO6):
1. Describe WATM and Multimedia broadcast services.
2. Describe the significance of Orthogonal Frequency Division Multiplexing
(OFDM) in next generation networks.
 BTECH ARTIFICIAL
COMPUTER INTELLIGENCE
SCIENCE AND&ENGINEERING
MACHINE LEARNING

Model Question Paper

QP CODE: PAGES: 3

Reg No:_______________
Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST415
Course Name : INTRODUCTION TO MOBILE COMPUTING
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)

1. Explain the different types of middleware and gateways required in mobile

computing.

2. List any six limitations of mobile computing.

3. Compare and contrast the satellite systems – GEO, LEO and MEO.

4. How is frequency allocation done in GSM?

5. What are the various strengths of SMS?

6. How is billing and charging done in GPRS?

7. What are the different types of Wireless LANs?

8. Describe the architecture of a Wireless Local Loop.

9. Explain the key features of TLS protocol.

10. How are attacks classified?

(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Describe any four mobile computing functions. (4)

(b) Explain the three-tier architecture of mobile computing with figure. (10)
OR
 BTECH ARTIFICIAL
COMPUTER INTELLIGENCE
SCIENCE & MACHINE LEARNING
AND ENGINEERING

12. (a) Describe the significance and functions of core, edge and access network. (6)

(b) Explain the terms (i) Client Context Manager (ii) Policy Manager (iii) Security (8)
Manager (iv) Adaptability Manager

13. (a) Why is multiple access important? With the help of suitable examples, explain (7)
the various multiple access techniques.

(b) Describe the different algorithms used for security and authentication in GSM. (7)

OR
14. (a) Show how call routing is done in GSM. Give an example. (7)

(b) Explain the process of handover. How does handover differ from roaming? (7)

15. (a) With the help of neat sketches, explain the difference between Short Message (6)
Mobile Terminated (SM MT) and Short Message Mobile Originated (SM MO)
messages.

(b) Explain the network operations in GPRS. (8)

OR

16. (a) How does operator-centric pull differ from operator-independent push and pull? (7)

(b) Describe the data services and applications of GPRS. (7)

17. (a) Compare the HIPERLAN and OSI layered architecture. (4)

(b) Explain the 802.11 architecture. (10)

OR
18. (a) Compare 3G and WiFi. (7)

(b) Explain the HIPERLAN communication models with suitable diagrams. (7)

19. (a) Given p = 7, q = 17 and e = 5. Find the value of d and also encrypt the message (7)
P = 65 using RSA.
(b) Explain the role of MPLS in service provisioning. (7)

OR
20. (a) With the help of a suitable example, show the working of Diffie-Hellman key (7)
exchange algorithm.
(b) Explain the features of any three multimedia broadcast services. (7)
 BTECH ARTIFICIAL
COMPUTER INTELLIGENCE & MACHINE LEARNING
SCIENCE AND ENGINEERING

TEACHING PLAN

No Contents No.of
Lecture Hrs
(35 hrs)

Module-1 (Mobile Computing Architecture) (6 hrs)

1.1 Introduction to mobile computing – Functions, Devices, 1
Middleware and gateways
1.2 Applications, services, limitations, Internet: The ubiquitous 1
network

1.3 Three-tier architecture (Lecture 1) 1

1.4 Three-tier architecture (Lecture 2) 1

1.5 Design considerations for mobile computing (Lecture 1) 1

1.6 Design considerations for mobile computing (Lecture 2) 1

Module-2 (Communication Systems) (7hrs)

Evolution of telephony, Multiple access procedures –
2.1 1
FDMA, TDMA, CDMA, SDMA

Satellite communication systems – GEO, MEO, LEO, 1

2.2
Satellite phones

2.3 Interactive Voice Response (IVR) architecture, Overview of 1

voice software, Developing an IVR application (Call flow
diagram)

2.4 Introduction to GSM,Architecture 1

2.5 GSM entities, Call routing 1

2.6 Mobility management 1

2.7 Frequency allocation, Authentication and security 1

Module-3 (Short Messaging Service and General Packet Radio Service) (8hrs)

3.1 SMS Strengths, Architecture, Short Message Mobile 1

Terminated (SM MT) and Short Message Mobile Originated
(SM MO) messages
3.2 SMS Architecture - Operator-centric pull, operator- 1
 BTECH ARTIFICIAL
COMPUTER INTELLIGENCE
SCIENCE AND&ENGINEERING
MACHINE LEARNING

independent push/pull, Value added services

3.3 Accessing the SMS bearer (Lecture 1) 1

3.4 Accessing the SMS bearer (Lecture 2) 1

3.5 GPRS architecture 1

3.6 Network operations 1

3.7 Data services, Applications 1

3.8 Limitations, Billing and charging 1

Module-4 (Wireless Local Area Networks) (7 hrs)

WLAN Advantages, Evolution, Applications

4.1 1

4.2 WLAN Architecture (Lecture 1) 1

WLAN Architecture (Lecture 2)
4.3 1
4.4 Mobility, Security 1

4.5 Deploying WLAN 1

4.6 WLL Architecture, HIPERLAN 1

4.7 WiFi Vs 3G 1

Module-5 (Mobile Security and Next Generation Networks) (7hrs)

Information security – Attacks, Components

5.1 1

5.2 Security techniques and algorithms – Stream Vs Block cipher, 1

Symmetric Vs Asymmetric cryptography
5.3 Security techniques and algorithms – RSA, Diffie Hellman 1
Key exchange

5.4 Security protocols – Secure Socket Layer, Transport Layer 1

Security, Wireless Transport Layer Security

5.5 The Converged Scenario, Narrowband to broadband 1

5.6 Orthogonal Frequency Division Multiplexing (OFDM) and 1

Multi Protocol Label Switching (MPLS)
5.7 Wireless Asynchronous Transfer Mode (WATM) and 1
Multimedia broadcast services
 COMPUTER
BTECH ARTIFICIAL SCIENCE
INTELLIGENCE & AND ENGINEERING
MACHINE LEARNING

YEAR OF
INTRODUCTION TO CATEGORY L T P CREDIT
INTRODUCTION
CST425
DEEP LEARNING
OEC 2 1 0 3 2019

Preamble: This course aims to introduce the learner to an overview of the concepts and
algorithms involved in deep learning. Basic concepts and application areas of machine learning,
deep networks, convolutional neural network and recurrent neural network are covered in this
course. This is a foundational program that will help students understand the capabilities,
challenges, and consequences of deep learning and prepare them to participate in the
development of leading-edge AI technology. They will be able to gain the knowledge needed to
take a definitive step in the world of AI.

Prerequisite: Basics of linear algebra and probability.

Course Outcomes: After the completion of the course the student will be able to
CO1 Demonstrate basic concepts in machine learning.(Cognitive Knowledge Level:
Understand)

CO2 Illustrate the validation process of machine learning models using hyper-parameters
and validation sets. (Cognitive Knowledge Level: Understand)

CO3 Demonstrate the concept of the feed forward neural network and its training process.
(Cognitive Knowledge Level: Apply)

CO4 Build CNN and Recurrent Neural Network (RNN) models for different use cases.
(Cognitive Knowledge Level: Apply)

CO5 Use different neural network/deep learning models for practical applications.
(Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Bloom’s Continuous Assessment Tests End Semester

Category Examination Marks (%)
Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 30 30 30

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Tests : 25 marks
Continuous Assessment Assignment : 15 marks
 COMPUTER SCIENCE AND ENGINEERING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carry 14 marks.

Syllabus
Module-1 (Introduction)

Key components - Data, models, objective functions, optimization algorithms, Learning

algorithms. Supervised learning- regression, classification, tagging, web search, page ranking,
recommender systems, sequence learning, Unsupervised learning, Reinforcement learning,
Historical Trends in Deep Learning. Other Concepts - overfitting, underfitting , hyperparameters
and validation sets, estimators, bias and variance.

Module- 2 (Optimization and Neural Networks)

Neural Networks –Perceptron, Gradient Descent solution for Perceptron, Multilayer perceptron,
activation functions, architecture design, chain rule, back propagation, gradient based learning.
Introduction to optimization– Gradient based optimization, linear least squares. Stochastic
gradient descent, Building ML algorithms and challenges.

Module -3 (Convolutional Neural Network)

Convolutional Neural Networks – convolution operation, motivation, pooling, Convolution and

Pooling as an infinitely strong prior, variants of convolution functions, structured outputs, data
types, efficient convolution algorithms.
 COMPUTER SCIENCE AND ENGINEERING

Module- 4 (Recurrent Neural Network)

Recurrent neural networks – Computational graphs, RNN design, encoder – decoder sequence to
sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs
LSTM and GRU, Practical use cases for RNNs.

Module-5 (Application Areas)

Applications – computer vision, speech recognition, natural language processing. Research
Areas – Autoencoders, Representation learning, Boltzmann Machines, Deep belief networks.

Text Book

1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press 2015 ed.
2. Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola, Dive into Deep Learning,
August 2019.
3. Neural Networks and Deep Learning: A Textbook by Charu C. Aggarwal. Springer.1st
edition, 2018.
Reference Books

1. Neural Smithing: Supervised Learning in Feed forward Artificial Neural Networks by

Russell Reed, Robert J MarksII, 1st edition, 1999, MIT Press.
2. Practical Convolutional Neural Networks by Mohit Sewak, Md. Rezaul Karim, Pradeep
Pujari, 1st edition, 2018, Packt Publishing Ltd.
3. Hands-On Deep Learning Algorithms with Python by Sudharsan Ravichandran, 1st edition,
2019, Packt Publishing Ltd.
4. Deep Learning with Python by Francois Chollet, 2nd edition, 2018, Manning Publications
Co.

Sample Course Level Assessment Questions

Course Outcome1(CO1):
1. Compare regression and classification.
2. Define supervised learning? Distinguish between regression and classification.
3. Discuss the different learning approaches used in machine learning.
4. You train an initial model that achieves a 90% accuracy on the training dataset. What
kind of problems your model is experiencing, and suggest a possible solution.
5. How does splitting a dataset into train, validation and test sets help identify
overfitting?
6. Consider solving a classification task. You first train your network on 20 samples.
Training converges, but the training loss is very high. You then decide to train this
network on 10,000 examples. Is your approach to fixing the problem correct? If yes,
explain the most likely results of training with 10,000 examples. If not, give a
solution to this problem.
 COMPUTER SCIENCE AND ENGINEERING

7. Describe one advantage of using mini-batch gradient descent instead of full-batch

gradient descent.
8. Sketch the typical learning curves for the training and validation sets, for a setting
where overfitting occurs at some point. Assume that the training set and the validation
set are of the same size

Course Outcome 2(CO2):

1. What are hyperparameters? Why are they needed?
2. What issues are to be considered while selecting a model for applying machine
learning in a given problem?
3. Update the parameters V11 in the given MLP using back propagation with learning
rate as 0.5 and activation function as sigmoid. Initial weights are given as V11= 0.2,
V12=0.1, V21=0.1, V22=0.3, V11=0.2, W11=0.5, W21=0.2
4. Draw the architecture of a multi-layer perceptron.
5. Derive update rules for parameters in the multi-layer neural network through the
gradient descent.
6. Why is it important to place non-linearities between the layers of neural networks?
7. You design a fully connected neural network architecture where all activations are
sigmoids. You initialize the weights with large positive numbers. Is this a good idea?
Explain your answer.
8. You are doing full batch gradient descent using the entire training set (not stochastic
gradient descent). Is it necessary to shuffle the training data? Explain your answer.
9. Consider training a fully-connected neural network with 5 hidden layers, each with 10
hidden units. The input is 20-dimensional and the output is a scalar. What is the total
number of trainable parameters in your network?
10. Consider building a 10-class neural network classifier. Given a cat image, you want
to classify which of the 10 cat breeds it belongs to. What loss function do you use?
Introduce the appropriate notation and write down the formula of the loss function.
11. Why is the sigmoid activation function susceptible to the vanishing gradient
problem?

Course Outcome 3 (CO3):

1. Give two benefits of using convolutional layers instead of fully connected ones for
visual tasks.
2. Suppose that a CNN was trained to classify images into different categories. It
performed well on a validation set that was taken from the same source as the training
set but not on a testing set. What could be the problem with the training of such a
CNN? How will you ascertain the problem? How can those problems be solved?
3. You are given a dataset of 10 x 10 grayscale images. Your goal is to build a 5-class
classifier. You have to adopt one of the following two options: a) the input is
flattened into a 100-dimensional vector, followed by a fully-connected layer with 5
 COMPUTER SCIENCE AND ENGINEERING

neurons, b) the input is directly given to a convolutional layer with five 10 x 10

filters. Explain which one you would choose and why.
4. Weight sharing allows CNNs to deal with image data without using too many
parameters. Does weight sharing increase the bias or the variance of a model?
5. Why do the layers in a deep architecture need to be non-linear?
6. A convolutional neural network has 4 consecutive layers as follows:
3 x 3 conv (stride 2) - 2 x 2 Pool - 3 x 3 conv (stride 2) - 2 x 2 Pool
How large is the set of image pixels which activate a neuron in the 4th non-image
layer of this network?
7. Consider a convolution layer. The input consists of 6 feature maps of size 20 x 20.
The output consists of 8 feature maps, and the filters are of size 5 x 5. The
convolution is done with a stride of 2 and zero padding, so the output feature maps
are of size 10 x 10. Determine the number of weights in this convolution layer

Course Outcome 4(CO4):

1. Explain how the cell state is updated in the LSTM model from Ct-1 to Ct
2. Show the steps involved in an LSTM to predict stock prices.
3. Illustrate the workings of the RNN with an example of a single sequence defined on a
vocabulary of four words.
4. If we have a recurrent neural network (RNN), we can view it as a different
type of network by "unrolling it through time". Briefly explain what that
means.
5. Briefly explain how “unrolling through time” is related to “weight sharing” in
convolutional networks.
6. Explain how the cell state is updated in the LSTM model from Ct-1 to Ct
7. Show the steps involved in an LSTM to predict stock prices.Give one advantage of
using an RNN rather than a convolutional network.

Course Outcome 5 (CO5):

1. Development a deep learning solution for problems in the domain i) natural language
processing or ii Computer vision (Assignment)
2. Is an autoencoder for supervised learning or for unsupervised learning? Explain
briefly.
3. Sketch the architecture of an autoencoder network.
4. Describe how to train an autoencoder network.
5. Write down the formula for the energy function (E) of a Restricted Boltzmann
Machine (RBM).
 COMPUTER SCIENCE AND ENGINEERING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST425

Course Name: Introduction To Deep Learning

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Distinguish between supervised learning and Reinforcement learning. Illustrate

with an example.
2. Differentiate classification and regression.
3. Compare overfitting and underfitting. How it can affect model generalization.
4. Why does a single perceptron cannot simulate simple XOR function? Explain
how this limitation is overcome?
5. Illustrate the strengths and weaknesses of convolutional neural networks.
6. Illustrate convolution and pooling operation with an example
7. How many parameters are there in AlexNet? Why the dataset size (1.2 million) is
important for the success of AlexNet?
8. Explain your understanding of unfolding a recursive or recurrent computation into
a computational graph.
9. Illustrate the use of deep learning concepts in Speech Recognition.
10. What is an autoencoder? Give one application of an autoencoder
(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) “A computer program is said to learn from experience E with respect to some
class oftasks T and performance measure P, if its performance at tasks in T,
(10)
as measured by P, improves with experience E.” What is your understanding
of the terms task, performance and experience. Explain with two example
(b) “How does bias and variance trade-off affect machine learning algorithms? (4)

OR
 COMPUTER SCIENCE AND ENGINEERING

12. (a) Illustrate the concepts of Web search, Page Ranking, Recommender systems (10)
with suitable examples.
(b) List and discuss the different hyper parameters used in fine tuning the (4)
traditional machine learning models
13. (a) How multilayer neural networks learn and encode higher level features from
input features. (7)
(b) Explain gradient decent and delta rule? Why stochastic approximation to (7)
gradient descent is needed?

OR
14. (a) Find the new weights for the network using backpropogation algorithm, the (7)
network is given with a input pattern[-1,1] and target output as +1, Use
learning rate of alpha=0.3 and bipolar sigmoid function.

(b) Write an algorithm for backpropagation which uses stochastic gradient (7)
descent method. Comment on the effect of adding momentum to the
network.
15. (a) Input to CNN architecture is a color image of size 112x112x3. The first (5)
convolution layer comprises of 64 kernels of size 5x5 applied with a stride
of 2 and padding 0. What will be the number of parameters?
(b) Let X=[-1, 0, 3, 5] W=[.3 ,.5 .2,.1] be the the input of ith layer of a neural (4)
network and to apply softmax function. What should be the output of it?

(c) Draw and explain the architecture of convolutional network (5)

OR
16. (a) Explain the concept behind i) Early stopping ii) dropout iii) weight decay (9)
(b) How backpropagation is used to learn higher-order features in a convolutional (5)
Network?
17. (a) Explain the working of RNN and discuss how backpropagation through time
is used in recurrent networks. (8)
 COMPUTER SCIENCE AND ENGINEERING

(b) Describe the working of a long short term memory in RNNs. (6)
OR
18. (a) What is the vanishing gradient problem and exploding gradient problem? (8)

(b) Why do RNNs have a tendency to suffer from exploding/vanishing gradient? (6)
How to overcome this challenge?
19. (a) Explain any two word embedding techniques (8)
(b) Explain the merits and demerits of using Auto encoders in Computer Vision. (6)
OR
20. (a) Illustrate the use of representation learning in object classification. (7)
(b) Compare Boltzmann Machine with Deep Belief Network. (7 )
 COMPUTER SCIENCE AND ENGINEERING

Teaching Plan

No. of
Lecture
No Contents Hours
(37 hrs)
Module 1 : Introduction (8 hours)
1.1 Key components - Data, models, objective functions, optimization algorithms. 1
(TB2: Section 1.1-1.2)
1.2 Learning algorithm (TB1: Section 5.1), Supervised learning- regression, 1
classification, tagging, web search, page ranking (TB2: Section 1.3.1)
1.3 Recommender systems, Sequence learning, Unsupervised learning, 1
Reinforcement learning(TB2: Section 1.3.2-1.3.4)
1.4 Historical Trends in Deep Learning (TB1: Section 1.2). 1

1.5 Concepts: overfit, underfit, hyperparameters and validation sets. (TB1: Section 1
5.2-5.3)
1.6 Concepts: Estimators, bias and variance. (TB1: Section 5.4) 1
1.7 Demonstrate the concepts of supervised learning algorithms using a suitable 1
platform.
1.8 Demonstrate the concepts of unsupervised using a suitable platform. 1
Module 2 : Optimization and Neural Networks (9 hours)

2.1 Perceptron, Stochastic Gradient descent, Gradient descent solution for 1

perceptron (TB3: Section 1.1 - 1.2.1)
2.2 Multilayer perceptron (TB3: Section 1.2.2), (TB1: Section 6.1,6.3) 1

2.3 Activation functions- Sigmoid, tanh, Softmax, ReLU, leaky ReLU (TB3: Section 1
1.2.1.3 - 1.2.1.5)
2.4 Architecture design (TB1: Section 6.4, TB3: Section 1.6) 1
2.5 Chain rule, back propagation (TB3: Section 1.3) 1
2.6 Gradient based learning (TB1: Section 6.2) 1
2.7 Gradient based optimization (TB1: Section 4.3) 1
2.8 Linear least squares using a suitable platform. (TB1: Section 4.5) 1
2.9 Building ML Algorithms and Challenges (TB3: 1.4, TB1: 5.10-5.11) 1
Module 3 :Convolution Neural Network (8 hours)
3.1 Convolution operation (TB1:Section 9.1) 1
3.2 Motivation, pooling (TB1:Section 9.2-9.3) 1
 COMPUTER SCIENCE AND ENGINEERING

3.3 Convolution and Pooling as an infinitely strong prior (TB1: Section 9.4) 1

3.4 Variants of convolution functions – multilayer convolutional network, tensors, 1

kernel flipping, downsampling, strides and zero padding. (TB1: Section 9.5)
3.5 Variants of convolution functions - unshared convolutions, tiled convolution, 1
training different networks. (TB1: Section 9.5)
3.6 Structured outputs, data types (TB1: Section 9.6-9.7) 1
3.7 Efficient convolution algorithms. (TB1: Section 9.8,9.10) 1
3.8 Case Study: AlexNet, VGG, ResNet. (TB3: Section 8.4.1, 8.4.3, 8.4.5) 1

Module 4 :Recurrent Neural Network (7 hours)

4.1 Computational graphs (TB1: Section 10.1) 1
4.2 RNN (TB1: Section 10.2-10.3) 1
4.3 Encoder – decoder sequence to sequence architectures. (TB1: Section 10.4) 1
4.4 Deep recurrent networks (TB1: Section 10.5) 1
4.5 Recursive neural networks , Modern RNNs, LSTM and GRU (TB1: Section 1
10.6, 10.10)
4.6 Practical use cases for RNNs. (TB1: Section 11.1-11.4) 1
4.7 Demonstrate the concepts of RNN using a suitable platform. 1
Module 5 : Applications and Research (5 hours)
5.1 Computer vision. (TB1: Section 12.2) 1
5.2 Speech recognition. (TB1: Section 12.3) 1
5.3 Natural language processing. (TB1: Section 12.4) 1
5.4 Brief introduction on current research areas- Autoencoders, Representation 1
learning. (TB1: Section 14.1-14.2, TB3: 9.3)
5.5 Brief introduction on current research areas- Boltzmann Machines, Deep belief 1
networks. (TB1: Section 20.1, 20.3)
 BTECH ARTIFICIAL INTELLIGENCE
COMPUTER SCIENCE& AND
MACHINE LEARNING
ENGINEERING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST435 COMPUTER GRAPHICS
OEC 2 1 0 3 2019

Preamble: This course helps the learners to make awareness about strong theoretical concept in
computer graphics. It covers the three-dimensional environment representation in a computer,
transformation of 2D/3D objects and basic mathematical techniques and algorithms used to build
applications. This course enables the learners to develop the ability to create image processing
frameworks for different domains and develop algorithms for emerging display technologies.

Prerequisite: A sound knowledge of Mathematics and concepts of any programming language.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge
CO1 level: Understand)

Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)

CO3 Demonstrate geometric representations and transformations on 2D & 3D objects

(Cognitive Knowledge level: Apply)
CO4 Demonstrate the working of line and polygon clipping algorithms(Cognitive
Knowledge level: Apply)
CO5 Summarize visible surface detection methods and illustrate projection
algorithms. (Cognitive Knowledge level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of SeriesTests1& 2) 25 marks
Continuous Assessment Assignment 15 marks
 COMPUTER SCIENCE AND ENGINEERING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one full
question. Each question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module – 1(Basics of Computer graphics)

S
Basics of Computer Graphics and its applications. Video Display devices- Refresh Cathode Ray
Tubes(CRT), Random Scan Displays and systems, Raster scan displays and systems, Color CRT
displays, Flat panel display and its categories.
Module – 2 (Line drawing, Circle drawing and Filled Area Primitives)
Line drawing algorithms- DDA, Bresenham’s algorithm. Circle drawing algorithms- Midpoint
Circle generation algorithm, Bresenham’s algorithm. Filled Area Primitives- Scan line polygon
filling, Boundary filling and flood filling.
Module - 3 (Geometric transformations)
Two dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing,
Composite transformations, Matrix representations and homogeneous coordinates. Basic 3D
transformations.
Module - 4 (Clipping)
Window to viewport transformation. Cohen Sutherland and Midpoint subdivision line clipping
algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping algorithms.
 COMPUTER SCIENCE AND ENGINEERING

Module - 5 (Three dimensional graphics)

Three dimensional viewing pipeline. Projections- Parallel and Perspective projections. Visible
surface detection algorithms- Back face detection, Depth buffer algorithm, Scan line algorithm, A
buffer algorithm

Text Book
1. Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw
Hill, 2019.
2. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
References
1. William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics.
McGraw Hill, 2001
2. David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
3. Donald Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with
OpenGL, PHI, 4e, 2013

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare the working principle of raster scan systems and random scan systems.
2. How much time is spent scanning across each row of pixels during screen refresh on a
raster system with resolution of 1280*1024 and a refresh rate of 60 frames per second?
Course Outcome 2 (CO2):
1. Rasterize the line using Bresenham’s line drawing algorithm with end points (2,3) and
(5,8) accepted from the user and implement it using any appropriate programming
language. (Assignment)
2. Illustrate how the 4-connected boundary filling approach differs from 8-connected
boundary filling and implement it using any appropriate programming language.
(Assignment)
Course Outcome 3 (CO3):
1. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3) , where
the
position vector of the coordinates is given as A(4,1), B(5,2) and C(4,3).
2. Implement the above transformation using any appropriate programming language with
user inputs. (Assignment)
3. Illustrate the steps required for a general 3D rotation if the rotation axis is not parallel to
any one of the principal axis. The rotation axis is defined by the points P1(x1,y1,z1) and
P2(x2,y2,z2). Give its composite matrix representation.
Course Outcome 4 (CO4):
1. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen
Sutherland algorithm, find the visible portion of the line segment joining the points
P(40,80) and Q(120,30).
 COMPUTER SCIENCE AND ENGINEERING

2. Implement Cohen Sutherland clipping algorithm using any appropriate programming

language with user inputs. (Assignment)
Course Outcome 5 (CO5):
1. Explain scan line algorithm for detecting visible surfaces in an object.
2. Derive the matrix for performing perspective projection and parallel projection.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST435

Course Name: Computer Graphics

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Describe Flat Panel display and its categories.

2. Consider a raster system with a resolution of 1024*1024. Compute the size of the
raster needed to store 4 bits per pixel? How much storage is needed if 8 bits per
pixel are to be stored?

3. Justify the usage of integer arithmetic in Bresenham’s line drawing algorithm.

4. How 8-way symmetry of circle can be used for developing circle drawing
algorithms?

5. Show that two successive reflections about either of the coordinate axes is
equivalent to a single rotation about the coordinate origin.

6. Determine a sequence of basic transformations that is equivalent to x-direction

shearing.

7. Find the window to viewport normalization transformation with window lower left
corner at (1,1) and upper right corner at (2,6).
 COMPUTER SCIENCE AND ENGINEERING

8. How does Cohen Sutherland algorithm determine whether a line is visible, invisible or
a candidate for clipping based on the region codes assigned to the end points of the
line?

9. Define the terms (i) Centre of projection (ii) Principal vanishing point

10. Differentiate between the object space and image space method for the hidden surface
removal of an image. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the working principle of beam penetration method and shadow mask (8)
method with suitable illustrations.

(b) Draw the architecture of raster scan display systems and explain its working (6)
principle.

OR

12. (a) Explain the working principle of a Refresh CRT monitor with suitable (8)
diagrams.

(b) Describe random graphics system with suitable illustrations. (6)

13. (a) Differentiate between boundary fill and flood fill algorithms. (5)

(b) Derive the initial decision parameter of Bresenham’s line drawing algorithm (9)
and rasterize a line with endpoints (2,2) and (10,10).

OR

14. (a) Write Midpoint circle drawing algorithm and identify the points in the circle (8)
with radius as 20 and center at (50,30) using the algorithm.

(b) Illustrate the working principle of scan line polygon filling algorithm. (6)

15. (a) Reflect a triangle ABC about the line 3x-4y+8=0, where the coordinates of the (8)
triangle are given as A(4,1), B(5,2) and C(4,3).

(b) A diamond shaped polygon is located at P(-1,0), Q(0,-2), R(1,0) and S(0,2). (6)
Find the transformation matrix which would rotate the triangle by 90 degree
counter clockwise about the point Q. Using the transformation matrix, find
the coordinates of the rotated polygon.

OR
 COMPUTER SCIENCE AND ENGINEERING

16. (a) Describe the steps required for a general 3D rotation if the rotation axis is not (8)
parallel to any one of the principal axis. The rotation axis is defined by the
points P1(x1,y1,z1) and P2(x2,y2,z2). Give its composite matrix
representation.

(b) Consider a triangle at (2,2), (10,2), (2,10). Perform the following 2D (6)
transformations in succession and find the resultant vertices.
i) Scale with respect to (2,2) by scaling factors (2,2) along x
and y directions.
ii) Rotate by 90 degree counter clockwise direction.
iii) Reflection based on y=x

17. (a) Illustrate Weiler – Atherton polygon clipping algorithm. (6)

(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (8)
line with end points P1 (70, 20) and P2(100,10) against a window with lower
left hand corner (50,10) and upper right hand corner (80,40).

OR

18. (a) Describe Sutherland Hodgeman polygon clipping algorithm and list out its (7)
limitations.

(b) Explain the steps involved in clipping a line using Mid point Subdivision (7)
algorithm.

19. (a) Explain how visible surfaces can be detected using depth buffer algorithm. (7)

(b) Define parallel projection. Describe orthographic and oblique parallel (7)
projection.

OR

20. (a) Illustrate the scan line method used in visible surface detection. (7)

(b) Derive the matrix needed for performing perspective projections. (7)
 COMPUTER SCIENCE AND ENGINEERING

TEACHING PLAN

No of Lecture
No Contents
Hrs (35 hrs)

Module – 1 (Basics of Computer Graphics) (6 hrs)

1.1 Basics of Computer Graphics and applications 1
1.2 Refresh Cathode Ray Tubes 1
1.3 Random Scan Displays and systems 1
1.4 Raster scan displays and systems 1
1.5 Color CRT displays 1
1.6 Flat panel display and its categories. 1
Module - 2 (Line drawing, Circle drawing and Filled Area Primitives) (7 hrs)
2.1 DDA Line drawing Algorithm 1
2.2 Bresenham’s line drawing algorithm 1
2.3 Midpoint Circle generation algorithm 1
2.4 Bresenham’s Circle generation algorithm 1
2.5 Illustration of line drawing and circle drawing algorithms 1
2.6 Scan line polygon filling 1
2.7 Boundary filling and flood filling 1
Module - 3 (Geometric transformations) ( 8 hrs)
3.1 Basic 2D transformations-Translation and Rotation 1
3.2 Basic 2D transformations- Scaling 1
3.3 Reflection and Shearing 1
3.4 Illustration of 2D Transformations 1
3.5 Composite transformations 1
3.6 Matrix representations and homogeneous coordinates 1
3.7 Basic 3D transformations 1
3.8 Illustration of basic 3D transformations 1
Module - 4 (2D Clipping) (6 hrs)
4.1 Window to viewport transformation 1
4.2 Cohen Sutherland Line clipping algorithm 1
4.3 Midpoint subdivision Line clipping algorithm 1
4.4 Sutherland Hodgeman Polygon clipping algorithm 1
4.5 Weiler Atherton Polygon clipping algorithm 1
4.6 Practice problems on Clipping algorithms 1
Module - 5 (Three dimensional graphics)( 8 hrs)

5.1 Three dimensional viewing pipeline, Projections-Parallel 1

projections
 COMPUTER SCIENCE AND ENGINEERING

5.2 Projections- Perspective projections 1

5.3 Visible surface detection algorithms- Back face detection. 1
5.4 Depth buffer algorithm 1
5.5 Depth buffer algorithm 1
5.6 Scan line visible surface detection algorithm 1
5.7 Scan line visible surface detection algorithm 1
5.8 A buffer algorithm 1
 BTECH ARTIFICIAL INTELLIGENCE
COMPUTER SCIENCE&AND
MACHINE LEARNING
ENGINEERING

YEAR OF
PYTHON FOR CATEGORY L T P CREDIT INTRODUCTION
CST445 ENGINEERS
OEC 2 1 0 3 2019

Preamble: The objective of the course is to provide learners an insight into Python programming
in a scientific computation context and develop programming skills to solve engineering
problems. It covers programming environment, important instructions, data representations,
intermediate level features, Object Oriented Programming and file data processing of Python.
This course lays the foundation to scientific computing, develop web applications, Machine
Learning, and Artificial Intelligence-based applications and tools, Data Science and Data
Visualization applications.

Prerequisite: NIL
Note : Students who have successfully completed CST 283 - Python for Machine Learning
(Minor) are not eligible to opt this course.
Course Outcomes: After the completion of the course the student will be able to

Write, test and debug Python programs (Cognitive Knowledge level:

CO1
Apply)
Illustrate uses of conditional (if, if-else, if-elif-else and switch-case) and
CO2 iterative (while and for) statements in Python programs (Cognitive
Knowledge level: Apply)
Develop programs by utilizing the modules Lists, Tuples, Sets and
CO3
Dictionaries in Python (Cognitive Knowledge level: Apply)
Implement Object Oriented programs with exception handling (Cognitive
CO4
Knowledge level: Apply)
Analyze, Interpret, and Visualize data according to the target application (Cognitive
CO5
Knowledge level: Apply)
Develop programs in Python to process data stored in files by utilizing the modules
CO6
Numpy, Matplotlib, and Pandas (Cognitive Knowledge level: Apply)
 COMPUTER SCIENCE AND ENGINEERING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

#PO Broad PO #PO Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work
PO4 Conduct investigations of complex problems PO10 Communication
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Test 1 (Marks in Test 2 (Marks End Semester
Bloom’s Category
percentage) in percentage) Examination Marks
Remember 20 20 20
Understand 30 30 30
Apply 50 50 50
Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3
 COMPUTER SCIENCE AND ENGINEERING

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each question
can have a maximum of 2 sub-divisions and carries 14 marks.

Syllabus
Module 1 (Basics of Python)
Getting Started with Python Programming - Running code in the interactive shell, Editing,
Saving, and Running a script. Using editors - IDLE, Jupyter. Basic coding skills - Working with
data types, Numeric data types and Character sets, Keywords, Variables and Assignment
statement, Operators, Expressions, Working with numeric data, Type conversions, Comments in
the program, Input Processing, and Output, Formatting output. How Python works. Detecting
and correcting syntax errors. Using built in functions and modules in math module. Control
statements - Selection structure - if-else, if-elif-else. Iteration structure - for, while. Testing the
control statements. Lazy evaluation.

Module 2 (Functions and Python Data Structures)

Functions - Hiding redundancy and complexity, Arguments and return values, Variable scopes
and parameter passing, Named arguments, Main function, Working with recursion, Lambda
functions. Strings - String function. Lists - Basic list Operations and functions, List of lists,
Slicing, Searching and sorting list, List comprehension. Work with tuples. Sets. Dictionaries -
Dictionary functions, dictionary literals, adding and removing keys, accessing and replacing
values, traversing dictionaries, reverse lookup.
 COMPUTER SCIENCE AND ENGINEERING

Module 3 (Object Oriented Programming)

Design with classes - Objects and Classes, Methods, Instance Variables, Constructor, Accessors
and Mutators. Structuring classes with Inheritance and Polymorphism. Abstract Classes.
Exceptions - Handle a single exception, Handle multiple exceptions.

Module 4 (Visualization and File handling)

Plotting - An Interactive Session with PyPlot, Basic Plotting, Logarithmic Plots, More Advanced
Graphical Output, Plots with multiple axes, Mathematics and Greek symbols, The Structure of
matplotlib, Contour and Vector Field Plots. File Processing - The os and sys modules,
Introduction to file I/O, Reading and writing text files, Working with CSV files.

Module 5 (Scientific Computing)

Numerical Routines. SciPy and NumPy - Basics, Creating arrays, Arithmetic, Slicing, Matrix
Operations, Special Functions, Random Numbers, Linear Algebra, Solving Nonlinear Equations,
Numerical Integration, Solving ODEs. Data Manipulation and Analysis – Pandas : Reading Data
from Files Using Pandas, Data Structures: Series and DataFrame, Extracting Information from a
DataFrame, Grouping and Aggregation.

Text Books:
1. Kenneth A Lambert., Fundamentals of Python : First Programs, 2/e, Cengage Publishing, 2016
2. David J. Pine, Introduction to Python for Science and Engineering, CRC Press, 2021

Reference Books:
1. Wes McKinney, Python for Data Analysis, 2/e, Shroff / O’Reilly Publishers, 2017
2. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2/e, Schroff, 2016
3. Michael Urban and Joel Murach, Python Programming, Shroff/Murach, 2016
4. David M.Baezly, Python Essential Reference. Addison-Wesley Professional; 4/e, 2009.
5. Charles Severance. Python for Informatics: Exploring Information,
6. http://swcarpentry.github.io/python-novice-gapminder/

Sample Course Level Assessment Questions

Course Outcome1(CO1):
1. What is type conversion? How is it done in Python?

Course Outcome 2(CO2):

1. Given is a list of of words, wordlist, and a string, name. Write a Python function which
takes wordlist and name as input and returns a tuple. The first element of the output
tuple is the number of words in the wordlist which have name as a substring in it. The
second element of the tuple is a list showing the index at which the name occurs in each
of the words of the wordlist and a 0 if it doesn’t occur.
 COMPUTER SCIENCE AND ENGINEERING

Course Outcome 3(CO3):

1. Write a Python program to implement the addition, subtraction, and multiplication of
complex numbers using classes. Use constructors to create objects. The input to the
program consist of real and imaginary parts of the complex numbers.

Course Outcome 4(CO4):

1. Plot the function y = 3x2 for −1 ≤ x ≤ 3 as a continuous line. Include enough points so
that the curve you plot appears smooth. Label the axes x and y

Course Outcome 5(CO5):

1. Given a file “auto.csv” of automobile data with the fields index, company, body-style,
wheel-base, length, engine-type, num-of-cylinders, horsepower, average-mileage, and
price, write python code to
i. Clean and Update the CSV file
ii. Print total cars of all companies
iii. Find the average mileage of all companies
iv. Find the highest priced car of all companies.

Model Question Paper

QP CODE: PAGES:

Reg No:_______________
Name:_________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST445
Course name : PYTHON FOR ENGINEERS
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)

1. Explain the basic data types available in Python, with examples.

Write a Python program to reverse a number and also find the sum of digits of the number.
2.
Prompt the user for input.
3. Compare tuples, lists, and dictionaries.
Explain the concept of scope and lifetime of variables in Python programming language,
4.
with a suitable example.
5. What is polymorphism? Give an example in the context of OOP in Python.
6. How is exception handling accomplished in Python programs?
7. Describe the characteristics of the CSV format.
 COMPUTER SCIENCE AND ENGINEERING

Plot the function y = 3x2 for −1 ≤ x ≤ 3 as a continuous line. Include enough points so that
8.
the curve you plot appears smooth. Label the axes x and y
9. Describe random number generation using Python
10. How can a generalized eigen value problem can be solved using Python?

PART-B
(Answer any one full question from each module)
Module -1
11. (a) Compare and contrast interpreted languages and compiled languages. (6)
How does it affect the quality of program development and execution of
the program?
(b) What are the possible errors in a Python program. Write a Python (8)
program to print the value of 22n+n+5 for n provided by the user.
OR
12. (a) Describe Arithmetic operators, Assignment operators, Comparison (6)
operators, Logical operators, and Bitwise operators in detail with examples.
(b) Input 4 integers (+ve and −ve). Write a Python code to find the sum of (8)
negative numbers, positive numbers, and print them. Also, find the averages
of these two groups of numbers and print
Module -2
13. (a) Write a Python code to create a function called list_of_frequency that takes a (5)
string and prints the letters in non-increasing order of the frequency of their
occurrences. Use dictionaries.
(b) Write a Python program to read a list of numbers and sort the list in a non- (9)
decreasing order without using any built in functions. Separate function
should be written to sort the list wherein the name of the list is passed as the
parameter.
OR
14. (a) Illustrate the following Set methods with an example. (8)
i. intersection( ) ii. Union( ) iii. Issubset( ) iv. Difference( ) v. update( ) vi.
discard( )
(b) Write a Python program to check the validity of a password given by the (6)
user.
The Password should satisfy the following criteria:
1. Contains at least one letter between a and z
2. Contains at least one number between 0 and 9
3. Contains at least one letter between A and Z
 COMPUTER SCIENCE AND ENGINEERING

4. Contains at least one special character from $, #, @

5. Minimum length of password: 6
Module -3
15. (a) How can a class be instantiated in Python? Write a Python program to (5)
express the instances as return values to define a class RECTANGLE with
parameters height, width, corner_x, and corner_y and member functions to
find center, area, and perimeter of an instance.
(b) Explain inheritance in Python. Give examples for each type of inheritance. (9)
OR
16. (a) Write a Python class named Circle constructed by a radius and two methods (6)
which will compute the area and the perimeter of a given circle
(b) Define a class in Python to store the details of a ship (name, (8)
source,destination) with the following methods:
i) get_details( ) - to assign values to class attributes
ii) print_details( ) - to display the attribute values
Create an object of the class and invoke the methods
Module -4
17. (a) Plot the functions sin x and cos x vs x on the same plot with x going from −π (10)
to π. Make sure the limits of the x-axis do not extend beyond the limits of
the data. Plot sin x in the color orange and cos x in the color green and
include a legend to label the two curves. Place the legend within the plot,
but such that it does not cover either of the sine or cosine traces. Draw thin
gray lines behind the curves, one horizontal at y = 0 and the other vertical at
x = 0.
(b) Explain semi-log plots and log-log plots along with the functions used in (4)
creating such plots.
OR
18. (a) Explain how matplotlib can be used to create dimensional contour plots and (6)
vector field plots.
(b) Given a file “auto.csv” of automobile data with the fields index, company, (8)
body-style, wheel-base, length, engine-type, num-of-cylinders, horsepower,
average-mileage, and price, write Python codes using Pandas to
1) Clean and Update the CSV file
2) Print total cars of all companies
3) Find the average mileage of all companies
4) Find the highest priced car of all companies.
 COMPUTER SCIENCE AND ENGINEERING

Module -5
19. (a) Write python program to solve the following system of equations (4)
x1 − 2x2 + 9x3 + 13x4 = 1
−5x1 + x2 + 6x3 − 7x4 = −3
4x1 + 8x2 − 4x3 − 2x4 = −2
8x1 + 5x2 − 7x3 + x4 = 5
(b) Given the sales information of a company as CSV file with the following (10)
fields month_number, facecream, facewash, toothpaste, bathingsoap,
shampoo, moisturizer, total_units, total_profit. Write Python codes to
visualize the data as follows
1) Toothpaste sales data of each month and show it using a scatter plot
2) Face cream and face wash product sales data and show it using the
bar chart
Calculate total sale data for last year for each product and show it using a
Pie chart.
OR
20. (a) Write Python program to write the data given below to a CSV file. (9)
SN Name Country Contribution Year

1 Linus Torvalds Finland Linux Kernel 1991

2 Tim Berners-Lee England World Wide Web 1990

3 Guido van Rossum Netherlands Python 1991

(b) Explain how integration is performed with SciPy. Illustrate the same with (5)
the two sample integrals using SciPy function.
 COMPUTER SCIENCE AND ENGINEERING

Teaching Plan
Number of
Sl
Contents Hours (35
No
Hrs)
Module 1: Basics of Python (8 hours)
Getting Started with Python Programming: Running code in the interactive
1.1 1 hour
shell Editing, Saving, and Running a script
1.2 Using editors: IDLE, Jupyter 1 hour
Basic coding skills: Working with data types, Numeric data types and
1.3 Character sets, Keywords, Variables and Assignment statement, Operators, 1 hour
Expressions,
Working with numeric data, Type conversions, Comments in the program,
1.4 1 hour
Input Processing, and Output. Formatting output
How Python works. Detecting and correcting syntax errors. Using built in
1.5 1 hour
functions and modules in math module.
1.6 Control statements : Selection structure, if-else, if elifelse 1 hour
1.7 Iteration structure - for, while 1 hour
1.8 Testing the control statements, Lazy evaluation. 1 hour
Module 2: Functions and Python Data Structures (8 hours)
2.1 Functions: Hiding redundancy and complexity, Arguments and return values 1 hour
2.2 Variable scopes and parameter passing 1 hour
2.3 Named arguments, Main function, 1 hour
2.4 Working with recursion, Lambda functions 1 hour
2.5 Strings - String function 1 hour
Lists - Basic list Operations and functions, List of lists, Slicing, Searching
2.6 1 hour
and sorting list, List comprehension.
2.7 Work with tuples. Sets. 1 hour
Dictionaries - Dictionary functions, dictionary literals, adding and removing
2.8 1 hour
keys, Accessing and replacing values, traversing dictionaries, reverse lookup
Module 3: Object Oriented Programming (6 hours)
3.1 Design with classes : Objects and Classes, Methods, Instance Variables 1 hour
3.2 Constructor, Accessors, and Mutators 1 hour
3.3 Structuring classes with Inheritance 1 hour
3.4 Polymorphism 1 hour
3.5 Abstract Classes 1 hour
3.6 Exceptions: Handle a single exception, Handle multiple exception 1 hour
Module 4: Visualization and File handling (6 hours)
 COMPUTER SCIENCE AND ENGINEERING

4.1 Plotting - An Interactive Session with PyPlot, Basic Plotting, 1 hour

4.2 Logarithmic Plots, More Advanced Graphical Output 1 hour
4.3 Plots with multiple axes, Mathematics and Greek symbols 1 hour
4.4 The Structure of matplotlib, Contour and Vector Field Plots 1 hour
File Processing -The os and sys modules, Introduction to file I/O, Reading
4.5 1 hour
and writing text files
4.6 Working with CSV files 1 hour

Module 5: Scientific Computing (7 hours)

Numerical Routines: SciPy and NumPy - Basics, Creating arrays,
5.1 1 hour
Arithmetic, Slicing
5.2 Matrix Operations, Special Functions, Random Numbers 1 hour
5.3 Linear Algebra, Solving Nonlinear Equations 1 hour
5.4 Numerical Integration, Solving ODEs 1 hour
Data Manipulation and Analysis: Pandas - Reading Data from Files Using
5.5 1 hour
Pandas
5.6 Data Structures - Series and DataFrame 1 hour
5.7 Extracting Information from a DataFrame, Grouping and Aggregation 1 hour
 BTECH ARTIFICIAL INTELLIGENCE
COMPUTER & MACHINE
SCIENCE LEARNING
AND ENGINEERING

YEAR OF
OBJECT ORIENTED CATEGORY L T P CREDIT
CST455 INTRODUCTION
CONCEPTS
OEC 2 1 0 3 2019

Preamble: The purpose of this course is to enable learners to solve problems by breaking it down
to object level while designing software and to implement it using Java. This course covers Object
Oriented Principles, Object Oriented Programming in Java, Exception handling, Event handling,
multithreaded programming and working with window-based graphics. This course provides
learners the basics to develop Mobile applications, Enterprise Applications, Scientific
Applications and Web based Applications.

Prerequisite: A sound background in any of the programming languages like C, C++, Python etc
is mandatory. Students who completed the minor stream course CST 281 Object Oriented
Programming are not allowed to choose this Open Elective Course.

Course Outcomes: After the completion of the course the student will be able to

Develop Java programs using the object-oriented concepts - classes, objects,

CO1 constructors, data hiding, inheritance and polymorphism (Cognitive Knowledge
Level: Apply)

Utilise data types, operators, control statements, built in packages & interfaces,
CO2 Input/Output Streams and Files in Java to develop programs (Cognitive Knowledge
Level: Apply)

Illustrate how robust programs can be written in Java using exception handling
CO3
mechanism (Cognitive Knowledge Level: Apply)

Develop application programs in Java using multithreading (Cognitive Knowledge

CO4
Level: Apply)

Develop Graphical User Interface based application programs by utilising event

CO5
handling features and Swing in Java (Cognitive Knowledge Level: Apply)
 COMPUTER SCIENCE AND ENGINEERING

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
1 0 2

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

 COMPUTER SCIENCE AND ENGINEERING

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester
Category Examination Marks
Test 1 (%) Test 2 (%) (%)

Remember 20 20 20

Understand 40 40 40

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
 COMPUTER SCIENCE AND ENGINEERING

from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1 (Object Orientation and Java basics)
Object Orientation Principles – Object and Class, Data abstraction and Encapsulation,
Inheritance, Polymorphism, Dynamic binding, Message communication, Benefits of using
Object orientation.
Introduction to Java - Java programming Environment and Runtime Environment, Development
Platforms -Standard, Enterprise. Java Virtual Machine (JVM), Java compiler, Bytecode, Java
applet, Java Buzzwords, Java program structure, Comments, Garbage Collection, Lexical Issues.

Primitive Data types - Integers, Floating Point Types, Characters, Boolean. Literals, Type
Conversion and Casting, Variables, Arrays, Strings, Vector class.

Module – 2 (Core Java Fundamentals)

Operators - Arithmetic Operators, Bitwise Operators, Relational Operators, Boolean Logical
Operators, Assignment Operator, Conditional (Ternary) Operator, Operator Precedence.
Control Statements - Selection Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring Objects, Object
Reference, Introduction to Methods, Constructors, this Keyword, Method Overloading, Using
Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members,
Command-Line Arguments, Variable Length Arguments.

Module - 3 (More features of Java)

Inheritance - Super Class, Sub Class, The Keyword super, protected Members, Calling Order of
Constructors, Method Overriding, the Object class, Abstract Classes and Methods, Using final
with Inheritance.

Packages and Interfaces - Defining Package, CLASSPATH, Access Protection, Importing

Packages, Interfaces.
 COMPUTER SCIENCE AND ENGINEERING

Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block and catch Clause,
Multiple catch Clauses, Nested try Statements, throw, throws and finally.

Module - 4 (Advanced features of Java)

Input/Output - I/O Basics, Reading Console Input, Writing Console Output, PrintWriter Class,
Reading and Writing Files.

Java Library - String Handling – String Constructors, String Length, Special String Operations -
Character Extraction, String Comparison, Searching Strings, Modifying Strings, Using
valueOf(), Comparison of String Buffer and String.

Module - 5 (GUI Programming, Event Handling and Multithreaded Programming)

Multithreaded Programming - The Java Thread Model, The Main Thread, Creating Thread,
Creating Multiple Threads, Suspending, Resuming and Stopping Threads.

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

Swing Fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls,
Components and Containers, Exploring Swing - JFrame, JLabel, JButton, JTextField.

Text Books
1. Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.
2. Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.

Reference Books
1. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11/e, Pearson, 2018.
2. Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013.
3. Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008.
4. Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005.
5. Sierra K., Head First Java, 2/e, O'Reilly, 2005.
 COMPUTER SCIENCE AND ENGINEERING

Course Level Assessment Questions

Course Outcome1 (CO1):
1. Three types of employees work in an organization: Regular, Contract and Hourly.
Regular employees are permanent workers of the organization. Their salary is computed
as the sum of basic pay, DA (50% of basic pay) and HRA. Contract employees work for
the organization only for the contract period and earn a fixed salary. Hourly employees
work for a fixed number of hours each day. Their salary is computed based on the total
number of hours worked.
Using object oriented principles, write a Java program to prepare pay roll of the
organization.
2. Write a java program to create an abstract class named Shape that contains two integers
and an empty method named printArea(). Provide three classes named Rectangle, Square,
Triangle and Circle with proper class hierarchy. Each one of the classes contain only the
method printArea( ) that prints the area of the given shape.

Course Outcome 2(CO2):

1. Write a Java program that reads a file and displays the file on the screen, with a line
number before each line.
2. Write a Java program to prepare the rank list of computer science students based on
their performance in the first Semester B.Tech. Degree examination at APJ Abdul
Kalam Technological University. The output should be stored in a file.

Course Outcome 3(CO3):

1. Write a program to demonstrate the use of throws clause to handle an exception occurred
within a method.
2. Write a program to demonstrate how exception handling is supported in Java.

Course Outcome 4(CO4):

1. Write a program to compute the sum of elements in an array using two threads in a parallel
way. The first thread sums up the first half of the array and the second thread sums up the
second half of the array. Finally, the main thread adds these partial sums and prints the
result.
2. Write a java program that implements a multi-thread application that has three threads.
First thread generates random integer every 1 second and ifthe value is even, second
thread computes the square of the number and prints. If the value is odd, the third thread
will print the value of cube of the number.
 COMPUTER SCIENCE AND ENGINEERING

Course Outcome 5(CO5):

1. Write a GUI based program to convert temperature from degree Celsius to Fahrenheit.
2. Write a java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green with buttons. On selecting a button, an appropriate
message with “stop” or “ready” or “go” should appear above the buttons in a selected
color. Initially there is no message shown.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES :4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST455

Course Name: Object Oriented Concepts

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Java is considered to be secure and portable. Justify this statement.

2. Describe the concept of dynamic binding.

3. Explain the different arithmetic operators in Java.

4. What does the following Java function compute? Justify your answer.
intgreater(int a, int b)
{
while(a!=b)
{
 COMPUTER SCIENCE AND ENGINEERING

if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}

5. Explain the use of CLASSPATH with an example.

6. What are the different types of exceptions?

7. Explain file handling features available in Java.

8. Write a simple program to read an integer value from console and print it.

9. Explain the concept of main thread in multi-threading.

10. Explain any two Event classes in Java. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Describe in detail polymorphism, abstraction and inheritance with suitable (9)
examples.

(b) What is Java Virtual Machine? (5)

OR

12. (a) Explain the salient features of Java language. How does Java Enterprise (9)
Edition (J2EE) differ from Java Standard Edition (Java SE)?

(b) Explain the declaration and use of multi-dimensional array variables in Java, (5)
with example.

13. (a) Explain iteration control statements in Java. Give examples. (8)
 COMPUTER SCIENCE AND ENGINEERING

(b) Write a recursive program to compute the factorial of a number. (6)

OR

14. (a) Using a suitable Java program, explain the concept of methods and (6)
constructors.

(b) Write a Java program that prompts the user for an integer and then prints out (8)
all the prime numbers up to that number.

15. (a) In a table format, show the effect of access specifiers within and outside (6)
packages in Java.

(b) Describe exception handling using try block and catch clause in Java with the (8)
help of a suitable Java program.

OR

16. (a) What is an interface in Java? Explain with a suitable example. (6)

(b) Write a program that perform integer divisions. The user enters two input data (8)
(any data type) through console into variables Num1 and Num2. If Num1 or
Num2 were not an integer, the program would throw a Number Format
Exception. If Num2 were Zero, the program would throw an Arithmetic
Exception. Display the appropriate exception or result.

17. (a) Write a Java program that displays the number of characters, lines and words (8)
in a text file.

(b) Explain any three String constructors with the help of sample code for each. (6)

OR

18. (a) Write a program to demonstrate the usage of the PrintWriter class. (7)

(b) Write a Java program for sorting a given list of names in ascending order. (7)

19. (a) Explain Delegation Event model for event handling in Java. (7)

(b) Write a program to compute the sum of elements in an array using two (7)
 COMPUTER SCIENCE AND ENGINEERING

threads in a parallel way. The first thread sums up the first half of the array
and the second thread sums up the second half of the array. Finally, the main
thread adds these partial sums and prints the result.Use Runnable interfacefor
the creation of a thread.

OR

20. (a) What are the differences between a process and a thread? (4)

(b) Write a Graphical User Interface (GUI) based Java program to implement a (10)
simple calculator supporting the operations addition, subtraction,
multiplication and division. Use Swing controls to implement GUI. There
may be three text boxes, the first two for accepting the operands and the last
for displaying the result. Add four buttons for the above operations. Write
neat comments in your program to show how you handle events.

Teaching Plan

No. of
Lecture
No Contents Hours
(36hrs)

Module – 1 (Object Orientation and Java basics) (7 hrs)

Object Orientation Principles – Object and Class, Data abstraction and

1.1 1 hour
Encapsulation

1.2 Inheritance, Polymorphism 1 hour

Dynamic binding, Message communication, Benefits of using Object

1.3 1 hour
orientation.
Java programming Environment and Runtime Environment,
1.4 Development Platforms -Standard, Enterprise. JVM, Java compiler, 1 hour
Bytecode

Java applet, Java Buzzwords, Java program structure, Comments, Garbage

1.5 1 hour
Collection, Lexical Issues

1.6 Primitive Data types - Integers, Floating Point Types, Characters, Boolean 1 hour

1.7 Literals, Type Conversion and Casting, Variables, Arrays, Strings, Vector 1 hour
 COMPUTER SCIENCE AND ENGINEERING

class.

Module - 2 (Core Java Fundamentals) (7 hrs)

Operators - Arithmetic Operators, Bitwise Operators, Relational
2.1 Operators, Boolean Logical Operators, Assignment Operator, 1 hour
Conditional (Ternary) Operator, Operator Precedence.

Control Statements - Selection Statements, Iteration Statements and Jump

2.2 1 hour
Statements.
Object Oriented Programming in Java - Class Fundamentals,
2.3 1 hour
Declaring Objects

2.4 Object Reference, Introduction to Methods, Constructors, this Keyword 1 hour

2.5 Method Overloading, Using Objects as Parameters, Returning Objects 1 hour

2.6 Recursion, Access Control, static Members 1 hour

2.7 Command-Line Arguments, Variable Length Arguments 1 hour

Module - 3 (More features of Java) (8 hrs)

3.1 Inheritance - Super class, Sub class, the keyword super, protected Members 1 hour

3.2 Calling Order of Constructors, Method Overriding, the Object class 1 hour

3.3 Abstract Classes and Methods, Using final with Inheritance 1 hour

Packages and Interfaces - Defining Package, CLASSPATH, Access

3.4 1 hour
Protection

3.5 Importing Packages, Interfaces 1 hour

Exception Handling - Checked Exceptions, Unchecked Exceptions, try

3.6 1 hour
Block and catch Clause

3.7 Multiple catch Clauses, Nested try Statements 1 hour

3.8 throw, throws and finally 1 hour

Module - 4 (Advanced features of Java) (6 hrs)

4.1 Input/Output - I/O Basics, Reading Console Input 1 hour

4.2 Writing Console Output, PrintWriter Class 1 hour

4.3 Working with Files (Lecture-1) 1 hour

 COMPUTER SCIENCE AND ENGINEERING

4.4 Working with Files (Lecture-2) 1 hour

4.5 Java Library - String Handling – String Constructors, String Length 1 hour

Special String Operations - Character Extraction, String Comparison,

4.6 Searching Strings, Modifying Strings, Using valueOf( ), Comparison of 1 hour
StringBuffer and String.
Module - 5 (GUI Programming, Event Handling and Multithreaded
Programming) ( 8hrs)

Multithreaded Programming - The Java Thread Model, The Main Thread,

5.1 1 hour
Creating Thread

5.2 Creating Multiple Threads 1 hour

5.3 Suspending, Resuming and Stopping Threads. 1 hour

Event handling - Event Handling Mechanisms, Delegation Event
5.4 1 hour
Model

5.5 Event Classes,Sources of Events, Event Listener Interfaces 1 hour

5.6 Using the Delegation Model, Swing fundamentals, Swing Key Features 1 hour

Model View Controller (MVC), Swing Controls, Components and

5.7 1 hour
Containers

5.8 Exploring Swing –JFrame, JLabel, JButton, JTextField 1 hour

 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VIII
 Year of
CONCEPTS IN Category L T P Credit
Introduction
AMT402 REINFORCEMEN
T LEARNING
PCC 2 1 0 3 2019

Preamble:
This course covers fundamental principles and techniques in reinforcement learning. The course
discusses topics including Markov Decision Processes, dynamic programming, Monte Carlo
methods, temporal-difference methods, and applications of reinforcement learning. This course
enables the learners to apply reinforcement learning to real-world applications and research
problems.

Course Outcomes: After the completion of the course, the graduate will be able to:

CO 1 Solve computational problems using probability and random variables. (Cognitive

Knowledge Level: Apply)
CO 2 Apply the Markov Decision Process approach to agent’s learning. (Cognitive
Level:Apply)
CO 3 Apply policy iteration and value iteration algorithms in reinforcement learning.
(Cognitive Knowledge Level: Apply)
CO 4 Employ the Monte Carlo approach in reinforcement learning algorithms. (Cognitive
Knowledge Level: Apply)
CO 5 Apply the temporal-difference method in reinforcement learning
algorithms.(Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12
1

CO 1

CO 2

CO 3

CO 4

CO 5
 Abstract POs defined by National Board of Accreditation
PO# Broad PO PO# Broad PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex PO10 Communication

problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Examination
1 2

Remember
30% 30% 30%
Understand
30% 30% 30%
Apply
40% 40% 40%
Analyse

Evaluate

Create
Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Tests : 25 marks

Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks

First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3 marks
for each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a
student should answer any 5.

End Semester Examination Pattern:There will be two parts; Part A and Part B. Part A contain
10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which student should
answer anyone. Each question can have maximum 2 sub-divisions and carry 14 marks.
 Syllabus
Module 1 (Review Of Probability Concepts)
Probability concepts review - Axioms of probability, concepts of random variables, probability
mass function, probability density function, cumulative density functions, Expectation. Concepts
of joint and multiple random variables, joint, conditional and marginal distributions. Correlation
and independence.
Module 2 (Basic Concepts in Reinforcement Learning)
Introduction to Reinforcement Learning(RL) terminology - Examples of RL, Elements of RL,
Limitations and Scope of RL.
Module 3 (Markov Decision Process)
Finite Markov Decision Processes - The Agent–Environment Interface, Goals and Rewards,
Returns and Episodes, Policies and Value Functions, Optimal Policies and Optimal Value
Functions.
Module 4 (Prediction and Control)
Dynamic Programming - Policy Evaluation (Prediction), Policy Improvement, Policy Iteration,
Value Iteration.
Monte Carlo (MC) for model free prediction and control - Monte Carlo Prediction, Monte Carlo
Estimation of Action Values, Monte Carlo Control, Monte Carlo Control without Exploring
Starts, Off-policy Prediction via Importance Sampling, Incremental Implementation, Off-policy
Monte Carlo Control.

Module 5 (Temporal-Difference (TD) Methods For Model-Free Prediction And Control)

TD Methods - TD Prediction, Advantages of TD Prediction Methods, Optimality of TD(0),
SARSA: On-policy TD Control, Q-learning: Off-policy TD Control, Expected SARSA.
n-step Bootstrapping- n-step TD Prediction, n-step SARSA, n-step Off-policy Learning, Off-
policy Learning Without Importance Sampling: The n-step Tree Backup Algorithm.

Text book:
1 Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, , 2nd
Edition
2 Alberto Leon-Garcia, Probability, Statistics, and Random Processes for Electrical
Engineering, 3rd Edition,
Reference books:
1 Reinforcement Learning: State-of-the-Art, Marco Wiering and Martijn van Otterlo, Eds
2 Algorithms for Reinforcement Learning, Szepesvari (2010), Morgan & Claypool.
3 Artificial Intelligence: A Modern Approach, Stuart J. Russell and Peter Norvig
4 Mathematical Statistics and Data Analysis by John A. Rice,University of California,
Berkeley, Third Edition, published by Cengage.
5 Machine Learning: A Probabilistic Perspective, Kevin P. Murphy

Sample Course Level Assessment Questions.

Course Outcome 1 (CO1):

1 Let Jand Tbe independent events, where P(J)=0.4and P(T)=0.7. Find P(J∩T), P(J∪T)
and P(J∩T′)

2 Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A∪B)=0.5. Find
P(A∣B).

3 A random variable Rhas the probability distribution as shown in the following table:

Given that E(R)=2.85, find a and b and P(R>2).

4 A biased coin (with probability of obtaining a head equal to p > 0) is tossed repeatedly
and independently until the first head is observed. Compute the probability that the first
head appears at an even numbered toss.

5 Two players A and B are competing at a quiz game involving a series of questions. On
any individual question, the probabilities that A and B give the correct answer are p and q
respectively, for all questions, with outcomes for different questions being independent.
The game finishes when a player wins by answering a question correctly. Compute the
probability that A wins if
(i) A answers the first question,
 (ii) B answers the first question.

6 A coin for which P(heads) = pis tossed until two successive tails are obtained. Find the
probability that the experiment is completed on thenthtoss.

7 An urn contains p black balls, q white balls, and r red balls; and n balls are chosen
without replacement.
i. Find the joint distribution of the numbers of black, white, and red balls in the
sample.
ii. Find the joint distribution of the numbers of black and white balls in the
sample.
iii. Find the marginal distribution of the number of white balls in the sample.
8 Suppose that two components have independent exponentially distributed lifetimes,
T1and T2, with parameters αand β, respectively. Find (a) P( T1> T2)and (b) P( T1> 2
T2).
9 Let Z1 and Z2 be independent random variables each having the standard normal
distribution. Define the random variables X and Y by X = Z1 + 3Z2 and Y = Z1+ Z2.
Argue that the joint distribution of (X, Y) is a bivariate normal distribution. What are the
parameters of this distribution?
10 Given a continuous random variable x, with cumulative distribution function Fx(x),
show that the random variable y = Fx(x) is uniformly distributed.
11 Roll a fair dice twice. Let the random variable X be the product of the outcomes of the
two rolls. What is the probability mass function of X? What are the expected values and
the standard deviation of X?
12 Show that if two events Aand Bare independent, then Aand B'are independent

13 Prove that Xand Yare independent if and only if fX|Y (x|y) = fX(x)for all xand y

14 A random square has a side length that is a uniform [0, 1] random variable. Find the
expected area of the square.Let X be a continuous random variable with the density
function f (x) = 2x, 0 ≤ x ≤ 1

i. Find E(X).
ii. Find E(X2)and Var(X).

Course Outcome 2 (CO2):

1. Define reinforcement learning and explain how it differs from supervised learning.
 2. What are the key elements of reinforcement learning, and what roles do they play in the
learning process?
3. Provide an example of a real-world problem where reinforcement learning can be applied
and briefly describe how RL approaches it.
4. What are the main limitations of reinforcement learning, and how do they impact its
application to complex problems?
5. Explain the concept of the agent-environment interaction in RL, and identify the primary
components involved in this interaction.
6. Describe the elements of reinforcement learning in detail. For each element (agent,
environment, reward, state, and action), explain its role in the reinforcement learning
framework and how these elements interact with one another. Provide examples to
illustrate your explanation.
7. Using an example from robotics, game-playing, or another domain, explain the steps
involved in applying reinforcement learning to solve a problem. Include a discussion on
how the agent learns through trial and error and adjusts its actions based on rewards.
8. Discuss the scope and limitations of reinforcement learning. Highlight the types of
problems for which RL is most suitable, the challenges faced in scaling RL to real-world
problems, and potential strategies for overcoming these challenges.
9. Explain the concept of the agent-environment interface in reinforcement learning.
Discuss how the interaction between the agent and the environment is modeled
mathematically and how it forms the foundation for RL algorithms.
10. Compare reinforcement learning to other learning paradigms such as supervised learning
and unsupervised learning. Discuss the unique features of RL, including its emphasis on
sequential decision-making and learning from feedback. Provide specific examples to
illustrate these differences.

Course Outcome 3 (CO3):

1 What are the main differences between supervised learning and reinforcement learning?
2 Give examples of Markovian and non-Markovian environments?
3 What are the advantages and disadvantages of value methods vs policy methods?
4 Define the optimal state-value function V*(s) for an MDP.
5 Imagine that the rewards are at most 1 everywhere. What is the maximum value that the
discounted return can attain ? Why ?
6 Write down the Bellman optimality equation for state-value functions
7 Suppose that you are in a casino. You have Rs 20 and will play until you lose it all or as soon
as you double your money. You can choose to play two slot machines: 1) slot machine A
costs Rs 10 to play and will return Rs 20 with probability 0.05 and Rs 0 otherwise; and 2)
slot machine B costs Rs 20 to play and will return Rs30 with probability 0.01 and Rs 0
 otherwise. Until you are done, you will choose to play machine A or machine B in each turn.
Describe the state space, action space, rewards and transition probabilities. Assume the
discount factor γ = 1. Rewards should yield a higher reward when terminating with Rs 40
than when terminating with Rs 0. Also, the reward for terminating with Rs 40 should be the
same regardless of how we got there (and equivalently for Rs 0).
Course Outcome 4 (CO4):

1 Explain policy iteration and value iteration? What are their similarities and differences?

2 Why Monte Carlo methods for learning value functions require episodic tasks? How is it
that n-step TD methods avoid this limitation and can work with continuing tasks?

3 List any three uses of the depth parameter in the Monte-Carlo tree search procedure.

4 Given that qπ(s, a) > vπ(s), can we conclude that π is not an optimal policy. Justify

Course Outcome 5 (CO5):

1 Draw the backup diagram for 2-step SARSA. Write the corresponding learning rule for 2-
step SARSA.
2 Why is SARSA an on-policy algorithm while Q-learning is an off-policy algorithm?
3 How would you differentiate between learning algorithms using on-policy from those that
use off-policy?
4 When using Temporal Difference learning, why is it better to learn action values (Q-values)
rather than state values (V-values)?
5 Suppose that a Q-learning agent always chooses the action which maximizes the Q-value.
What is one potential problem with that approach?
6 Describe any two ways that will force a Q-learning agent to explore.
7 Why and when do we need importance sampling?
 Model Question paper

QP Code : Total Pages: 4

Reg No.:_______________ Name:__________________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION (HONOURS), MONTH and
YEAR
Course Code: AMT402
Course Name: CONCEPTS IN REINFORCEMENT LEARNING
Max. Marks: 100 Duration: 3 Hours
PART A
Answer all questions, each carries 3 marks.

1 The first three digits of a telephone number are 452. If all the sequences of the
remaining four digits are equally likely, what is the probability that a randomly
selected telephone number contains seven distinct digits?
2 If X is a discrete uniform random variable, i.e., P(X = k) = 1/n for k = 1, 2, ... ,
n, find E(X)and Var(X).
3 Define the discounted return Gt. Give an expression for Gtin terms of Gt+1.

4 Write down the Bellman expectation equation for state-value functions.

5 Suppose that we are doing value iteration with γ = 0. How many iterations will
it take for value iteration to converge to the optimal value function?
6 List any three advantages of Monte Carlo methods over dynamic programming
techniques?
7 Draw the backup diagram for 2-step Q-learning. Write the corresponding
learning rule for 2-step Q-learning.
8 Why Monte Carlo methods for learning value functions require episodic tasks.
How does n-step TD methods avoid this limitation and can work with
continuing tasks?
9 In using policy gradient methods, if we make use of the average reward
 formulation rather than the discounted reward formulation, then is it necessary
to consider, for problems that do not have a unique start state, a designated start
state, s0? Justify.
1 Why is SARSA considered an on-policy algorithm, whereas Q-learning is
categorized as an off-policy algorithm?
0

10 x 3 =
30

PART B
Answer any one Question from each module. Each question carries 14 Marks
1 a Three players play 10 independent rounds of a game, and each player has (7)
1 ) probability 1/3 of winning each round. Find the joint distribution of the
numbers of games won by each of the three players.

b Find the joint density of X + Y and X/Y, where X and Y are independent (7)
) exponential random variables with parameter λ. Show that X + Y and X/Yare
independent.

OR

1 a An experiment consists of throwing a fair coin four times. Find the probability (7)
2 ) mass function and the cumulative distribution function of the following random
variables:
i the number of heads before the first tail
ii the number of heads following the first tail
iii the number of heads minus the number of tails
iv the number of tails times the number of heads.
b Let X be a continuous random variable with probability density function on (7)
) 0 <= x <= 1 defined by f(x) = 3x2. Find the pdf of Y = X2.

1 a What is the difference between a state value function V(s) and a state-action (4)
3 ) value function Q(s,a)?

b Consider designing a recycling robot whose job is to collect empty bottles (10)
 ) around the building. The robot has a sensor to detect when a bottle is in front
of it, and a gripper to pick up the bottle. It also senses the level of its battery.
The robot can navigate, as well as pick up a bottle and throw a bottle it is
holding in the trash. There is a battery charger in the building, and the robot
should not run out of battery.
i. Describe this problem as an MDP. What are the states and actions?
ii. Suppose that you want the robot to collect as many bottles as possible,
while not running out of battery. Describe what rewards would enable
it to achieve this task.
OR

1 a Define the state-value function Vπ(s) for a discounted MDP. (5)

4 )

b Consider a 4x4 gridworld where the agent starts in the top left, the bottom right (10)
) state is terminal, rewards are always -1, γ = 1, and state transitions are
deterministic. Consider the policy that always chooses the action to move down,
except when it is on the bottom row, at which point it chooses the action to move
right. Starting with v0(s) = 0 for all s, compute v1, v2, ... , v7.
1 a During a single iteration of the Value Iteration algorithm, we typically iterate (5)
5 ) over the states in S in some order to update Vt(s) to Vt+1(s) for all states s. Is it
possible to do this iterative process in parallel? Explain why or why not.
b Consider an undiscounted Markov Reward Process with two states A and B. (9)
) The transition matrix and reward function are unknown, but you have observed
two sample episodes:
A +3 --> A +2 --> B -4 --> A +4 --> B -3
B -2 --> A +3 --> B -3
i. Using first-visit Monte-Carlo evaluation, estimate the state-value
function V(A),V(B).
ii. Using every-visit Monte-Carlo evaluation, estimate the state-value
function V(A),V(B).
iii. Draw a diagram of the Markov Reward Process that best explains these
two episodes. Show rewards and transition probabilities on your
diagram.
OR

1 a Suppose you are given a finite set of transition data. Assuming that the Markov (4)
model that can be formed with the given data is the actual MDP from which the
6 ) data is generated, will the value functions calculated by the MC and TD
methods necessarily agree? Justify.
b With respect to the expected SARSA algorithm, is exploration required as it is (5)
) in the normal SARSA and Q-learning algorithms? Justify.

c For a specific MDP, suppose we have a policy that we want to evaluate through (5)
) the use of actual experience in the environment alone and using Monte Carlo
methods. We decide to use the first-visit approach along with the technique of
always picking the start state at random from the available set of states. Will
this approach ensure complete evaluation of the action value function
corresponding to the policy?
1 a Consider the following Q[S,A] table (9)
7 )

Assume the discount factor, γ= 0.5, and the step size, α = 0.1. After the
experience (s, a, r, s')=(1, 1, 5, 2), which value of the table gets updated and
what is its new value?
b What is the difference between Q-learning and SARSA? (5)
)

OR

1 a Consider the following Q[S,A] table (9)

8 )

Assume the discount factor, γ= 0.5, and the step size, α = 0.1. After the
experience (s, a, r, s', a')=(1, 1, 5, 2, 1), which value of the table gets updated
and what is its new value?
 b For Q-learning to converge we need to correctly manage the exploration vs. (5)
) exploitation tradeoff. What property needs to be hold for the exploration
strategy?
1 a Given the following sequence of states observed from the beginning of an (8)
9 ) episode, s2, s1, s3, s2, s1, s2, s1, s6, what is the eligibility value, e7(s1), of state s1at
time step 7 given trace decay parameter λ, discount rate γ, and initial value,
e0(s1) = 0, when accumulating traces are used? What is the eligibility value if
replacing traces are used?
b Suppose that we are using a policy gradient method to solve a reinforcement (6)
) learning problem and the policy returned by the method is not optimal. Give
three plausible reasons for such an outcome?
OR

2 a When using Temporal Difference learning, why is it better to learn action (8)
values (Q-values) rather than state values (V-values)? Justify your answer with
0 )
proper reasoning with reference to a valid context.

b Suppose that in a particular problem, the agent keeps going back to the same
) state in a loop. What is the maximum value that can be taken by the eligibility (6)
trace of such a state if we consider accumulating traces with λ = 0.25 and γ =
0.8?
 TEACHING PLAN

No Topic No. of Lectures

(32)

Module-1 (Review Of Probability Concepts) TB-2 (Ch 2, 3, 4,5)

(6 hours)
1.1 Axioms of probability, concepts of random variables
1 hour

1.2 Probability mass function (pmf) and Probability density

1 hour
function (pdf)
1.3 Cumulative density functions (cdf) and problems related
1 hour
to pmf,pdf and cdf
1.4 Expectation of random variables 1 hour

1.5 Multi-variate random variable, conditional and marginal

1 hour
distributions
1.6 Expectation and independence of random variables
1 hour

2.1 Basic concepts in Reinforcement learning- relationship

with psychology and practical implications in advanced 1 hour
learning
2.2 Elements of reinforcement learning (RL)- agent,
1 hour
environment, action, reward, return, goal etc.,
2.3 The agent-environment interface
1 hour

2.4 Relationships, episodes, policies and values

1 hour

2.4 Simple examples of RL models with proper state-action 1 hour

diagrams
Module-3 (Markov Decision Process) TB-1(Ch 1, 3) (6 hours)

3.1 Markov Decision Process (MDP)- states, transition 1 hour

probability matrix, Bellman’s equation
3.2 Bellman’s optimality condition and its relevance in RL 1 hour

3.2 Policies and Value Functions 1 hour

2.6. Optimal Policies and Optimal Value Functions 1 hour

2.7 Simple problems 1 hour
2.8 State diagram of MDP, simple examples 1 hour

Module-4 (Prediction And Control) TB-1(Ch 4,5) (6 hours)

4.1 Policy Evaluation (Prediction) and Policy Improvement 1 hour

4.2 Policy Iteration and Value Iteration 1 hour

4.3 Monte Carlo Prediction- estimation of action values 1 hour
4.4 Monte Carlo Control, Monte Carlo Control without 1 hour
Exploring Starts
4.5 Off-policy Prediction via Importance Sampling 1 hour
4.6 Off-policy Monte Carlo Control 1 hour
Module-4 (Temporal-Difference ( TD) Methods) TB-1 (Ch 6, 7) (8 hours)
4.1 TD Prediction, Advantages of TD Prediction Methods 1 hour
4.2 Optimality of TD(0) 1 hour
4.3 SARSA: On-policy TD Control 1 hour
4.4 Q-learning: Off-policy TD Control 1 hour
4.5 Expected S 1 hour
4.6 n-step TD Prediction, n-step SARSA 1 hour
4.7 n-step Off-policy Learning 1 hour
4.8 Off-policy Learning Without Importance Sampling: The 1 hour
n-step Tree Backup Algorithm
5.6 n-step Truncated Lambda-return Methods, 1 hour
SARSA(Lambda)
5.7 Policy Approximation and its Advantages 1 hour
5.8 The Policy Gradient Theorem, REINFORCE: Monte 1 hour
Carlo Policy Gradient
5.9 REINFORCE with Baseline, Actor–Critic Methods 1 hour
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VIII

PROGRAM
ELECTIVE III

15
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMT GPU Category L T P Credit

414 COMPUTING
Program 2 1 0 3
Elective III

Preamble: The course equips the students to understand the benefit of massive
parallelisation algorithms and use GPU-based computing to implement it. The
student will appreciate the underlying GPU architecture, programming model,
and how solutions can be designed to use the architecture for better
performance.

Prerequisite: Basic Concepts in Computer Organization and architecture

Mapping of course outcomes with program outcomes

CO1 Explain the massive parallelization of programs and GPU-based

computing. (Cognitive Knowledge Level: Understand)

CO2 Explain CUDA architecture and programming model for parallel

computing. (Cognitive Knowledge Level: Understand)

CO3 Describe memory and performance considerations for CUDA-based

parallel computing. (Cognitive Knowledge Level: Understand)

CO4 Illustrate the parallel floating point arithmetic using CUDA

(Cognitive Knowledge Level: Understand)

CO5 Appreciate the application of GPU-based parallel computation in

multiple domains. (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO8 PO PO PO1 PO
1 2 3 4 5 6 7 9 10 1 12

16
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of

PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

17
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Marks (%)
Test 1 Test 2
(%) (%)

Remember 20 20 20

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
18
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

19
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module 1 – (Introduction)

Introduction - GPUs as Parallel Computers- Architecture of a Modern GPU-

Why More Speed or Parallelism? - Parallel Programming Languages and
Models.

History of GPU Computing- Evolution of Graphics Pipelines - The Era of Fixed-

Function Graphics Pipelines- Evolution of Programmable Real-Time Graphics-
Unified Graphics and Computing Processors- GPU Computing- Scalable GPUs

Module 2 – (CUDA Parallelism and Threads)

Introduction to CUDA- Data Parallelism- CUDA Program Structure- A Matrix–

Matrix Multiplication Example - Device Memories and Data Transfer - Kernel
Functions and Threading

CUDA Threads - CUDA Thread Organization- Using blockIdx and threadIdx -

Synchronization and Transparent Scalability - Thread Assignment - Thread
Scheduling and Latency Tolerance

Module 3 – (CUDA Memories and Performance Considerations)

CUDA Memories Importance of Memory Access Efficiency- CUDA Device

Memory Types - A Strategy for Reducing Global Memory Traffic- Memory as a
Limiting Factor to Parallelism

Performance Considerations- More on Thread Execution- Global Memory

Bandwidth - Dynamic Partitioning of SM Resources- Data Prefetching-
Instruction Mix- Thread Granularity

Module 4 – (Floating Point Considerations and Parallel Thinking)

Floating Point Considerations- Floating-Point Format – Normalized

Representation of M- Excess Encoding of E - Representable Numbers- Special
Bit Patterns and Precision- Arithmetic Accuracy and Rounding - Algorithm
Considerations

20
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Parallel Programming and Computational Thinking- Goals of Parallel

Programming - Problem Decomposition - Algorithm Selection - Computational
Thinking

Module 5 – (Case Studies)

Application Case Study: Advanced MRI Reconstruction Application Background

- Iterative Reconstruction- Computing FHd- Determine the Kernel Parallelism
Structure - Getting Around the Memory Bandwidth Limitation - Using
Hardware Trigonometry Functions- Experimental Performance Tuning

Application Case Study: Molecular Visualization and Analysis Application

Background - A Simple Kernel Implementation - Instruction Execution
Efficiency - Memory Coalescing - Additional Performance Comparisons - Using
Multiple GPUs

Text Books

1. Kirk, David B., and W. Hwu Wen-Mei. Programming massively parallel

processors: a hands-on approach. Morgan Kaufmann, 2016.
2. Cook, Shane. CUDA programming: a developer's guide to parallel computing
with GPUs. Newnes, 2012.
Reference Book
1. Bandyopadhyay. Avimanyu, Hands-On GPU Computing with Python Explore
the capabilities of GPUs for solving high performance computational
problems, Packt Publishing, 2019

21
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. Illustrate the speed up in computing achieved by parallelizing matrix

multiplication.

2. Explain how the architecture of a GPU provides for high performance

compared to a CPU.

Course Outcome 2(CO2):

1. Explain the structure of a CUDA program and how it gets executed.
2. Explain the CUDA device memory model.

Course Outcome 3(CO3):

1. Use a real life problem to illustrate how a problem can be decomposed for
parallel execution and illustrate the speedup achieved by parallelization.

2. Illustrate with algorithm, the use of tiling and prefetching to improve the
performance of matrix multiplication.

Course Outcome 4(CO4):

1. Assume that in a new processor design, due to technical difficulty, the
floating-point arithmetic unit that performs addition can only do “round to
zero” (rounding by truncating the value toward 0). The hardware
maintains a sufficient number of bits that the only error introduced is due
to rounding. What is the maximal ulp error value for add operations on
this machine?
2. How is the arithmetic accuracy and rounding achieved in GPUs?
Course Outcome 5(CO5):
1. Explain the linear-solver-based iterative reconstruction algorithm for non-
Cartesian MRI scan data.
2. Describe the major computational challenges involved in visualizing
molecular orbitals.

22
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 414

Course Name: GPU Computing

Max. Marks : 100

Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Compare many-core and multi-core processors.

2. Explain how the architecture of a GPU facilitates for high

performance compared to a CPU.

3. Illustrate data parallelism using matrix-matrix multiplication.

4. Explain how a CUDA program is compiled to run on both CPU

and GPU.

5. Given a variable declared in a CUDA program with the following

keywords - __device__, __constant__, int ConstVar; - describe the
type of memory, the scope and lifetime of the variable.

23
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

6. Explain the factors that limit performance in thread execution.

7. Illustrate the Excess Encoding of E and explain the advantage of

excess representation.

8. Illustrate Amdahl’s law with an example.

9. Describe the challenges involved in MRI image reconstruction

from non-Cartesian trajectory data.

10. Describe the major computational challenges involved in

visualizing molecular orbitals. (10x3=
30)

Part B
(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Explain with the help of a figure, the architecture of a CUDA- (6)
capable GPU.

(b) Compare the following parallel programming language (8)

models:

(i) Message Passing Interface (MPI)

(ii) OpenMP

(iii) CUDA
(iv) OpenCL

OR

12. (a) Describe the evolution of Three-dimensional (3D) graphics (10)

24
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

pipeline hardware

(b) Explain the technological factors that resulted in high (4)

scalability in GPU computing.

13. (a) List the keywords used by a CUDA programmer to introduce (4)
parallelism into a traditional C program.

(b) Explain the structure of a CUDA program and how it gets (10)
executed.

OR

14. Explain the CUDA thread organization and illustrate how the (14)
code identifies the part of the input data to read from and the
part of the output data structure to write to.

15. (a) Explain the CUDA device memory model. (10)

(b) Illustrate how a single global memory can limit the (4)
performance of a GPU processor.

OR

16. (a) Illustrate with algorithm, the use of tiling and prefetching to (10)
improve the performance of matrix multiplication.

(b) Illustrate how instruction mixture limits the achievable (4)

performance of programs on CUDA to no more than 1/3 of
the peak bandwidth.

17. (a) Explain the issues with representation of representable (7)

numbers.

25
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Illustrate the representation of representable numbers in IEEE (7)

format and show how the issues in representation can be
resolved.

OR

18. (a) Use a real life problem to illustrate how a problem can be (8)
decomposed for parallel execution.

(b) Illustrate how the speedup is achieved by parallelization. (6)

19. (a) Explain the linear-solver-based iterative reconstruction (14)

algorithm for non-Cartesian MRI scan data.

OR

20. Explain the kernel design for Direct Coulomb summation (14)
(DCS).

26
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
Lecture
No Contents
Hours

(40 hrs)

Module 1 – (Introduction)

(8 hours)

1.1 Introduction - GPUs as Parallel Computers 1 hour

Architecture of a Modern GPU- Why More Speed or

1.2 1 hour
Parallelism?

1.3 Parallel Programming Languages and Models 1 hour

1.4 History of GPU Computing 1 hour

Evolution of Graphics Pipelines - The Era of Fixed-Function

1.5 1 hour
Graphics Pipelines

1.6 Evolution of Programmable Real-Time Graphics 1 hour

1.7 Unified Graphics and Computing Processor 1 hour

1.8 GPU Computing- Scalable GPUs 1 hour

Module-2 (CUDA Parallelism and Threads) (9 hours)

2.1 Introduction to CUDA 1 hour

2.2 Data Parallelism- CUDA Program Structure 1 hour

2.3 A Matrix–Matrix Multiplication Example 1 hour

2.4 Device Memories and Data Transfer 1 hour

27
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.5 Kernel Functions and Threading 1 hour

2.6 CUDA Threads - CUDA Thread Organization 1 hour

2.7 Using blockIdx and threadIdx 1 hour

Synchronization and Transparent Scalability - Thread

2.8 1 hour
Assignment

2.9 Thread Scheduling and Latency Tolerance 1 hour

Module-3 (CUDA Memories and Performance Considerations) (6 hours)

CUDA Memories Importance of Memory Access Efficiency-

3.1 1 hour
CUDA Device Memory Types

A Strategy for Reducing Global Memory Traffic- Memory as a

3.2 1 hour
Limiting Factor to Parallelism

Performance Considerations- More on Thread Execution-

3.3 1 hour
Global Memory Bandwidth

3.4 Dynamic Partitioning of SM Resources 1 hour

3.5 Data Prefetching 1 hour

3.6 Instruction Mix- Thread Granularity 1 hour

Module-4 (Floating Point Considerations and Parallel Thinking) (7 hours)

Floating Point Considerations- Floating-Point Format –

4.1 1 hour
Normalized Representation of M- Excess Encoding of E

4.2 Representable Numbers 1 hour

Special Bit Patterns and Precision- Arithmetic Accuracy and

4.3 1 hour
Rounding

4.4 Algorithm Considerations 1 hour

28
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Parallel Programming and Computational Thinking- Goals of

4.5 1 hour
Parallel Programming

4.6 Problem Decomposition 1 hour

4.7 Algorithm Selection - Computational Thinking 1 hour

Module-5 (Case Studies) (10 hours)

Application Case Study: Advanced MRI Reconstruction

5.1 1 hour
Application Background

5.2 Iterative Reconstruction 1 hour

5.3 Computing FHd 1 hour

5.4 Determine the Kernel Parallelism Structure 1 hour

5.5 Getting Around the Memory Bandwidth Limitation 1 hour

Using Hardware Trigonometry Functions- Experimental

5.6 1 hour
Performance Tuning

Application Case Study: Molecular Visualization and Analysis

5.7 1 hour
Application Background

5.8 A Simple Kernel Implementation 1 hour

5.9 Instruction Execution Efficiency - Memory Coalescing 1 hour

5.1
Additional Performance Comparisons - Using Multiple GPUs 1 hour
0

29
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PROGRAMMING CATEGORY L T P CREDIT

CST424
PARADIGMS
Program 2 1 0 3
Elective III

Preamble:: The course provides the learners a clear understanding of the main
constructs of contemporary programming languages and the various systems of
ideas that have been used to guide the design of programming languages. This
course covers the concepts of Names, Bindings & Scope, Statement-Level
Control Structures, Sub Programs, Support for Object Oriented
Orien Programming,
Exception Handling, Concurrency Control, Functional Programming and Logic
Programming. This course helps the learners to equip with the knowledge
necessary for the critical evaluation of existing and upcoming programming
languages. It also enables the learner to choose the most appropriate language
for a given programming task, apply that language's approach to structure or
organize the code, classify programming languages based on their features and
to design new generation languages.

Prerequisite: Sound knowledge in Programming in C and Object-Oriented

Programming.

Mapping of course outcomes with program outcomes

Explain the criteria for evaluating programming languages and

CO1 compare Imperative, Functional and Logic programming languages

(Cognitive Knowledge Level: Understand)

Illustrate the characteristics of data types and variables (Cognitive

CO2 Knowledge Level: Apply)

Comprehend how control flow structures and subprograms help in

CO3 developing the structure of a program to solve a computational problem

(Cognitive Knowledge Level: Apply)

Explain the characteristics of Object-Oriented Programming

CO4 Languages (Cognitive
Cognitive Knowledge Level: Understand)

30 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Compare concurrency constructs in different programming languages

CO5 (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
1 0 1 2

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions
Conduct
PO4 investigations of PO10 Communication
complex problems

31 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
Bloom’s
Tests End Semester
Category
Examination
Test 1 Test 2
Marks (%)
(%) (%)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 3
0

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

32 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing the remaining part of the syllabus. There will be two parts: Part A
and Part B. Part A contains 5 questions (preferably, 2 questions each from the
two completed modules and 1 question from the partly completed module),
having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed two modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.
End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

33 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. Compare any three programming languages based on the language

evaluation criteria. Prepare a list of characteristics that affect the
language evaluation criteria.
2. Identify the advantages and disadvantages of imperative, functional and
logic programming languages.

Course Outcome 2 (CO2):

1. Two most important design issues that are specific to character string types
are
(1) whether a string is simply a special kind of character array or a primitive
type.
(2) whether strings have static or dynamic length.
Identify the implementations options for the above two cases.
2. Consider the following records of a particular language. Let the size of
each char variable be 1 byte, int be 4 bytes and and Boolean be 1 bit.
Struct Student
{
int id;
char
name[2];
int age;
boolean scholarship;
}
Draw and comment on the possible memory layouts for the record for a 32-
bit aligned machine

Course Outcome 3(CO3):

1. Explain three situations where a combined counting and logical
looping statement is needed.

34 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

reference parameters.
2. Describe the ways that aliases can occur with pass-by-reference

3. Identify the two fundamental design considerations for parameter-passing

methods.

4. What will be the output of the given program segment if it uses the
following parameter passing mechanisms:
a) call by reference
b) call by value

x : integer – – global
procedure foo(y :
integer) y := 3
print x
...

x := 2
foo(x)
print x

Course Outcome 4 (CO4):

1. Describe the role of a virtual method table in implementing dynamic method
binding.

2. Identify the merits and demerits of inheritance.

Course Outcome 5 (CO5):

1. Evaluate the use of semaphores and monitors for providing competition
synchronization and cooperation synchronization.

35 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS
Module 1

Introduction – Role of Programming Languages, Programming Domains,

Language Evaluation Criteria, Influence on Language Design, Language Design
Trade-offs, Implementation Methods. Names, Bindings & Scope – Names,
Variables, Concept of Binding, Scope and Lifetime, Referencing Environments.

Module - 2

Data Types – Primitive Data Types, Character String Types, User-Defined

Ordinal Types, Array Types, Record Types, List Types, Pointer & Reference
Types, Type Checking, Strong Typing, Type Equivalence. Expressions –
Arithmetic Expressions, Overloaded Operators, Type Conversions, Relational
and Boolean Expressions, Short-Circuit Evaluation. Assignment - Assignment
Statements, Mixed-mode Assignment.

Module - 3

Statement-Level Control Structures – Selection Statements, Iterative

Statements, Unconditional Branching, Guarded Commands. Subprograms –
Design Issues of Subprograms, Local Referencing Environments, Parameter
Passing Methods, Subprograms as Parameters, Overloaded Subprograms,
Closures, Co-routines

Module - 4

Support for Object Oriented Programming – Inheritance, Dynamic Binding,

Design Issues for Object Oriented Languages, Support for Object Oriented
Programming in C++, Implementation of Object-oriented Constructs. Exception
Handling – Basic Concepts, Design Issues.

Module - 5

Concurrency – Subprogram Level Concurrency, Semaphores, Monitors,

Message Passing. Functional Programming Languages – Introduction to LISP
and Scheme, Comparison of

36 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Functional and Imperative Languages. Logic Programming Languages – Basic

Elements of Prolog, Applications of Logic Programming.

Text Books

1. Robert W Sebesta, Concepts of Programming Languages, 10th Edition, Pearson.

2. Scott M L, Programming Language Pragmatics, 3rd Edition, Morgan

Kauffman Publishers.
Publishers

ReferenceBooks

1. Kenneth C. Louden, Programming Languages: Principles and Practice,

2nd Edition, Cengage Learning.

2. Tucker A. B. and R. E. Noonan, Programming Languages: Principles and

Paradigms, 2nd Edition. –TMH.

3. Ravi Sethi, Programming Languages: Concepts & Constructs, 2nd

Edition., Pearson Education.

4. David A. Watt, Programming Language Design Concepts, Wiley Dreamtech.

37 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question
Paper
QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST424

Course Name: Programming Paradigms

Max. Marks : 100 Duration: 3

Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate between readability and writability.

2. Define binding and binding time.

3. What are the advantages of user-defined enumeration types?

4. Define narrowing and widening conversions.

5. Why for statement in C language is more flexible than that of older languages?
6. What are the advantages and disadvantages of dynamic local
variables i subprograms?

7. Illustrate the concept of dynamic method binding with an example.

8. Is it mandatory to use constructors in object-oriented languages?

Justify your answer.

9. What are the applications of logic programming languages?

1 Explain the working of let and let-rec constructs in Scheme.

0.
(10x3=30)

38 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B

(Answer any one question from each module. Each question

carries 14 Marks)

1 (a) Explain different criteria used for evaluating languages. (7)

1.

(b) Consider the following pseudocode: (7)

x : integer
:= 3 y :
integer := 4
procedure
add x := x +
y
procedure second(P :
procedure) x : integer := 5
P()
procedure
first y :
integer := 6
second(add)
first()
write integer(x)
(a) What does this program print if the language uses static
scoping? Give reasons.
(b) What does it print if the language uses dynamic scoping? Give
reasons.

OR

1 (a) With respect to storage binding, explain the meanings, purposes, (7)
2. advantages and disadvantages of four categories of scalar

39 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

variables.

(b) What is meant by referencing environment of a statement? (7)

Show the

referencing environment at the indicated program points (1), (2),

(3) & (4) for the following program segment. Assume that the
programming language is statically scoped.
program example;

var a, b :
integer;
procedure
sub1;
var x, y: integer;

begin { sub1 }

……….. (1)

end {
sub1 } procedure
sub2;
var x : integer;

……..
procedure
sub3;
var x: integer;

begin { sub3 }

……….. (2)
end { sub3 }
begin { sub2 }

……….. (3)

end {
sub2} begin
40 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

{example}
……….. (4)

end {example }

13. (a) Explain any two issues associated with the pointer data types and (7)
also indicate how dangling pointer problem can be solved.

(b) Describe the lazy and eager approaches for reclaiming garbage. (7)

OR

14. (a) What is meant by side effect and illustrate the advantages of (8)
referential transparency?

(b) Explain the terms: compound assignment operator, coercion and (6)
short circuit evaluation.
15. (a) Illustrate the different categories of iteration control statements. (8)

41 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the techniques used for identifying the correct referencing (6)
environment for a subprogram that was sent as a parameter.

OR

16. (a) Describe the implementation models of Parameter passing. (10)

(b) Differentiate coroutines from conventional subprograms. (4)

17. (a) What is meant by an exception handler? Explain how exceptions (7)
are handled in object-oriented languages.

(b) Describe the design issues in object-oriented languages. (7)

OR

18. (a) Illustrate how a virtual method table can be used for (7)
implementing dynamic method binding.

(b) Explain the different categories, merits and demerits of inheritance. (7)

19. (a) Compare functional and imperative programming languages. (7)

(b) Explain the role of monitors in concurrency. (7)

OR

20. (a) Explain the searching strategies used in Prolog. Why backward (10)
chaining is preferred over forward chaining in Prolog?

(b) (let ((a 6) (4)

(b 8)
(square (lambda (x) (* x
x))) (plus +))
(sqrt (plus (square a) (square b))))
Write the output of the above code? Explain how let and
lambda construct works?

42 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan
CONTENTS No. of Lecture
Hours
No
(36 hrs.)

Module-1 (7 hours)

Introduction: Reasons for studying Concepts of

1. 1 hour
programming languages, Programming Domains
1

1. Language Evaluation Criteria 1 hour

2

1. Influence on Language Design, Language Design 1 hour

3 Trade-offs

1. Implementation Methods 1 hour

4

1. Names, Variables 1 hour

5

1. Concept of Binding 1 hour

6

1. Scope and Lifetime, Referencing Environments 1 hour

7

Module-2 (7 hours)

2. Primitive Data Types, Character String Types 1 hour

1

2. User-Defined Ordinal Types, Array Types 1 hour

2

2. Record Types, List Types, Pointer and Reference 1 hour

3 Types

Implementation of pointer and reference types,

2. 1 hour
Type Checking, Strong Typing, Type Equivalence
4

2. Expressions and Assignment Statements, 1 hour

43 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5 Arithmetic Expressions

2. Overloaded Operators, Type Conversions 1 hour

6

Relational and Boolean Expressions, Short-

2. 1 hour
Circuit Evaluation, Assignment Statements,
7
Mixed-mode Assignment

Module-3 (8 hours)

3.1 Selection Statements, Iterative Statements 1 hour

3.2 Unconditional Branching 1 hour

3.3 Guarded Commands 1 hour

3.4 Subprograms: Design Issues of Subprograms 1 hour

3.5 Local Referencing Environments 1 hour

3.6 Parameter Passing Methods 1 hour

3.7 Subprograms as Parameters, Overloaded Subprograms 1 hour

3.8 Closures, Co-routines

routines 1 hour

Module-4 (7 hours)

4.1 Inheritance 1 hour

4.2 Dynamic Binding 1 hour

4.3 Design Issues for Object Oriented Languages 1 hour

4.4 Support for Object Oriented Programming in C++ 1 hour

4.5 Implementation of Object-Oriented Constructs 1 hour

4.6 Exception Handling – Basic Concepts 1 hour

4.7 Exception Handling - Design Issues 1 hour

Module-5 (7 hours)

5.1 Subprogram Level Concurrency 1 hour

5.2 Semaphores, Monitors 1 hour

5.3 Message Passing 1 hour

5.4 Introduction to LISP and Scheme 1 hour

44 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.5 Comparison of Functional and Imperative Languages 1 hour

5.6 Basic Elements of Prolog 1 hour

5.7 Applications of Logic Programming 1 hour

45 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

NETWORK SECURITY CATEGORY L T P CREDIT

CST434
PROTOCOLS Program 2 1 0 3
Elective III

Preamble: This course helps the learners to explore various network and
system security protocols. This course covers authentication protocols,
firewalls and security protocols from different layers such as data link,
network, transport and application. The concepts covered in this course
enable the learners in effective use of security protocols for securing network
applications.
Prerequisite: A fundamental knowledge in the concepts of Security in Computing.
Course Outcomes: After the completion of the course, the student will be able to

CO1 Explain authentication protocols, X.509 authentication

(Cognitive
service and Public Key Infrastructure (PKI).(Cognitive
Knowledge Level: Understand)

CO2 Identify the security mechanisms in E mail security services.

(Cognitive Knowledge Level: Understand)

CO3 Summarize the network and transport layer security services

provided in a secure communication scenario. (Cognitive
Knowledge Level: Apply)

CO4 Describe real time communication security and application

layer security protocols. (Cognitive Knowledge Level: Apply)

CO5 Explain the concepts of firewalls and wireless network

security. (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
0 1 2

CO1

46 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO# Broad

PO PO

PO Engineering Knowledge PO7 Environment and Sustainability

1

PO Problem Analysis PO8 Ethics

2

PO Design/Development of solutions PO9 Individual and team work

3

PO Conduct investigations of PO10 Communication

4 complex problems

PO Modern tool usage PO11 Project Management and

5 Finance

PO The Engineer and Society PO12 Life long learning

6

47 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

End
Bloom’s Category Test 1 Test 2 Semester
(%) (%) Examination
(%)

Remember 20 20 2
0

Understand 50 50 5
0

Apply 30 30 3
0

Analyse

Evaluate

Create

Mark Distribution

Total CIE Marks ESE ESE

Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance : 10 marks

Continuous Assessment Test : 25 marks

Continuous Assessment Assignment : 15 marks

48 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module),
having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with
wi
2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module
of which a student should answer any one. Each question can have
maximum 2 sub-divisions
divisions and carries 14 marks.

49 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module-1 (Authentication Protocols)

Authentication Protocols – Mutual authentication, One way authentication.

Kerberos – Kerberos Version 4, Kerberos Version 5. X.509 Authentication
service. Public Key Infrastructure (PKI) – Trust models, Revocation.

Module-2 (E-mail Security)

Pretty Good Privacy (PGP) – Operational Description, Cryptographic keys and

key rings, Message format, PGP message generation, PGP message reception,
Public key management. S/MIME – Functionality, Messages,
Messa Certificate
processing, Enhanced security services.

Module-3 (Network Layer Security and Web Security)

Internet Protocol Security (IPSec) – Overview, IP security architecture,

Authentication Header (AH), Encapsulating Security Payload (ESP),
Combining Security Associations, Key management. Internet Key Exchange
(IKE) - Phases. Web Security – Web security considerations. Secure Socket
Layer and Transport Layer Security (SSL/TLS) – SSL Architecture, SSL
protocols,
otocols, Cryptographic computations, Transport layer security.

Module-4 (Real-time Security and Application Layer Security)

Real-time communication security – Perfect Forward Secrecy (PFS), Denial-

of-Service protection, Endpoint identifier hiding, Live partner reassurance.
Hypertext Transfer Protocol Secure (HTTPS) – Connection initiation, Closure.
Secure Shell (SSH) – Transport layer protocol, User authentication protocol,
Connection protocol. Secure Electronic Transaction (SET) – Overview,
Features, Participants, Dual signature, Payment processing.

Module-5 (System Security and Wireless Security)

Firewalls – Firewall characteristics, Types of Firewalls, Firewall

configurations, Encrypted Tunnels, Trusted systems – Data access control,
The concept of Trusted Systems, Trojan horse defense. IEEE 802.11i
wireless LAN security - Services, Phases of operation, Wired Equivalent
50 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Privacy (WEP), Wi-Fi Protected Access (WPA), WPA2.

Text Books
1. William Stallings, Cryptography and Network Security Principles and
Practice, 4/e, Pearson Ed.
2. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private
Communication in a Public World”, 2/e, PHI.
References

1. Behrouz A. Forouzan, DebdeepMukhopadhyay, “Cryptography and Network

Security”, 3/e, Tata McGraw Hill.
2. Tyler Wrightson, “Wireless Network Security A Beginner’s Guide”, 2012, Tata
McGraw Hill.
3. William Stallings, “Network Security Essentials: Applications and
Standards”, 4/e, Prentice Hall.
4. Schiller J., Mobile Communications, 2/e, Pearson Education.
5. Roberta Bragg et. al., “Network Security: The Complete Reference”, Tata McGraw
Hill

51 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Identify the threats associated with user authentication over a network or

Internet.

2. In the context of Kerberos, mention the significance of a realm.

Course Outcome 2 (CO2):

1. Mention the use of R64 conversion for an e-mail application.

2. Give the general structure of Private and Public Key rings in PGP.

Course Outcome 3 (CO3):

1. In AH protocol, identify the fields in an IP header which are

included in MAC calculation. For each of the fields in the IP header,
indicate whether the field is immutable, mutable but predictable, or
mutable. Justify your decision for each field.

reorder SSL record blocks that

2. Is it possible for the receiver to reorder
arrive out of order? If so, explain how it can be done. If not, why?
Course Outcome 4 (CO4):

1. Devise a protocol based on a pre shared secret key that hides

pre-shared
identities and gives Perfect Forward Secrecy (PFS) for identity
hiding. Make two variants, one in which an active attacker can
learn only the initiator’s identity, and one in which an active
attacker can learn only the target’s identity.
2. Explain the tasks performed by the payment gateway during
Payment Authorization in SET.
Course Outcome 5 (CO5):

1. List the weaknesses of a packet-filtering router.

2. Give the relevance of pair wise keys and group keys in IEEE 802.11i.

3. State the design goals of firewalls.

52 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES:

Reg No:
Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST434

Course Name: NETWORK SECURITY PROTOCOLS

Max Marks: 100 Duration: 3 Hours

PART A
(Answer All Questions. Each question carries 3 marks)

1. List any three requirements of Kerberos.

2. Specify the significance of key pair recovery. When is the key pair updated?

3. Why does PGP generate signature before applying compression?

4. List the four principal services provided by S/MIME.

5. Explain the significance of Alert protocol in SSL and list out

any three Alert messages with their uses.
6. Specify the purpose of MAC during the change cipher spec TLS exchange.

7. What is the advantage, if any, of not including the MAC in the

scope of packet encryption in SSH packets?

8. Givethe significance of dual signature in SET.

53 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

9. List the IEEE 802.11i services.

10. How is the concept of association related to that of mobility in wireless

networks? (10x3=30)

Part B

(Answer any one question from each module. Each

question carries 14 Marks)

11. (a) Describe the requirements for a public-key certificate scheme. (8)

(b) Explain the significance of chain of certificates. (6)

OR

12. (a) Specify the purpose of the X.509 standard. How is an X.509 certificate
revoked? (8)

(b) Describe the management functions of a PKI. What is a cross certificate?

(6)

13. (a) List the services provided by PGP and explain how (8)
authentication and confidentiality are provided.

(b) Explain the functionalities provided by S/MIME. (6)

OR

14. (a) Give the format of a PGP message and specify the
(8)
significance of each field in the message.

54 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the enhanced security services provided in S/MIME. (6)

15. (a) Explain the parameters that identify an SSL session state. (8)

(b) Differentiate
between
transport mode
and tunnel mode
in IPSec. (6)OR

16. (a) The IPsec architecture document states that when two transport mode SAs
arebundled to allow both AH and ESP protocols on the same end-to-end
end
flow, only one ordering of security protocols seems appropriate: performing
the ESP protocol before performing the AH protocol. Why is this approach
recommended rather than authentication before encryption? (8)

(b) List and explain the purpose each Alert Codes supported by SSL. (6)

17. (a) Illustrate the significance ofperfect forward secrecy. (6)

(b) Explain the key features provided by SET. (8)

OR

18. (a) List and explain the SSH protocols. (8)

(b) “The HTTPS capability is built into all modern web browsers”. Justify. (6)

19. (a) Explain the phases of operations in IEEE 802.11i. (8)

(b) Give the significances of Encrypted Tunnels (6)

OR
55 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

20. (a) Compare the features of three types of firewalls. (8)

(b) Compare the Wireless LAN protocols WEP, WPA and WPA2 (6)

56 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN

CONTENTS No: of
N Lecture
O hours
(35)

Module-1
1 (Authentication Protocols)(7hrs)

1.1 Authentication Protocols – Mutual 1

authentication, One way authentication

1.2 Kerberos –Version

Version 4 1

1.4 Differences between Kerberos Version 4 and 1

Version 5, Kerberos Version 5

1.5 X.509 Authentication service – 1

Certificates, Authentication Procedures,
X.509 Version 3

1.6 Public Key Infrastructure (PKI) – Trust models 1

1.7 Public Key Infrastructure (PKI) – Revocation 1

Module-2
Module (E-mail Security) (6 hrs)

1
Pretty Good Privacy (PGP) – Operational Description
2.1

Cryptographic keys and key rings, Message format 1

2.2

2.3 PGP message generation, PGP message reception 1

2.4 PGP -Public key management 1

2.5 S/MIME – Overview of MIME, Functionality, Messages 1

2.6 S/MIME - Certificate processing, Enhanced security 1

services

57 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module-3 (Network Layer Security and Web Security)(8

hrs)

3.1 Internet Protocol Security (IPSec) – Overview, IP 1

security architecture

3.2 Authentication Header (AH) 1

3.3 Encapsulating Security Payload (ESP) 1

3.4 Combining Security Associations, Key management 1

3.5 Internet Key Exchange (IKE) – Phases 1

3.6 Web Security – Web security considerations. Secure 1

Socket Layer and Transport Layer Security (SSL/TLS)
– SSL Architecture

3.7 SSL Protocols - Record Protocol, Change Cipher 1

Spec Protocol, Alert Protocol

3.8 SSL Handshake Protocol, Cryptographic 1

computations, Transport Layer Security

Module-4 (Real-time
(Real Security and Application Layer
Security) (8hrs)

4.1 Real-time communication security – Perfect Forward 1

Secrecy (PFS)

4.2 Denial-of-Service
Service protection, Endpoint identifier 1
hiding, Live partner reassurance

Hypertext Transfer Protocol Secure (HTTPS) – 1

4.3
Connection initiation, Closure

4.4 Secure Shell (SSH) – Transport layer protocol 1

4.5 User authentication protocol 1

4.6 Connection protocol 1

4.7 Secure Electronic Transaction (SET) – Overview, 1

Features, Participants

58 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.8 Dual signature, Payment processing 1

Module-5 (System Security and Wireless Security) (6

hrs)

Firewalls – Firewall characteristics, Types of Firewalls 1

5.1

5.2 Firewalls – Firewall configurations, Encrypted Tunnels 1

5.3 Trusted systems – Data Access Control, The Concept 1

of Trusted Systems, Trojan Horse Defense

5.4 IEEE 802.11i wireless LAN security - Services, 1

Phases of operation

5.5 Wired Equivalent Privacy (WEP) 1

5.6 Wi-Fi Protected Access (WPA), WPA2 1

59 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CATEGORY L T P CREDIT
CST444 SOFT COMPUTING
Program 2 1 0 3
Elective III

Preamble: This course enables the learners to understand the concepts of Soft
Computing techniques and its applications. It covers Artificial Neural Networks,
operations and models of fuzzy logic, genetic algorithms and multi objective
optimization techniques. This course helps the students to develop algorithms
and solutions for different real world applications.

Prerequisite: NIL.
Mapping of course outcomes with program outcomes

CO1 Describe soft computing techniques and the basic models of Artificial
Neural Network
(Cognitive Knowledge Level: Understand)

CO2 Solve practical problems using neural networks (Cognitive Knowledge

Level: Apply)

CO3 Illustrate the operations, model and applications of fuzzy logic

(Cognitive Knowledge Level: Apply)

CO4 Illustrate the concepts of Genetic Algorithm (Cognitive Knowledge

Level: Apply)

CO5 Describe the concepts of multi-objective optimization models and the

(Cognitive Knowledge
need for using hybrid soft computing approaches(Cognitive
Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
0 1 2

CO1

CO2

60 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO3

CO4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions
Conduct
PO4 investigations of PO10 Communication
complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
Bloom’s End
Tests
Category Semester
Test 1 Test 2 Examinati
(%) (%) on Marks
(%)

Remember 30 30 30

Understand 30 30 30

61 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Apply 40 40 40

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous AssessmentAssignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining partart of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.
End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

62 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment

Questions Course Outcome 1
(CO1):
1. Describe the necessity of Activation function? Examine the various aspects of
sigmoidal
activation function. List the drawbacks. Calculate the net output of the
following neural network using the bipolar and binary sigmoidal activation
function.

2. Explain the architecture of McCulloch-Pitts Neuron network model.

Implement NAND(NOT-AND)
NAND(NOT gate function using M-P Neuron Model(with
binary input).
Course Outcome 2(CO2):
1. Find the weights required to perform classification of patterns shown
below using perceptron network. The patterns (1,1,-1) and ( 1, -1,-1) are
belonging to the target class
1,1,1) and (-1,-1,1) are belonging to the target class +1.
-1. The patterns (-1,1,1)
Assume suitable learning rate and initial weights.

2. Explain the architecture and training algorithm of Adaline network . Use

Adaline nerwork to train NOR logic function with bipolar inputs and
targets. Perform 2 epochs of training.

63 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 3(CO3):

1. There is an imprecise relationship between the ambient temperature for
clay masonry bricks and their compressive strengths. Let X be a fuzzy set

of fracture strengths and Y be a fuzzy set of temperatures with the

following membership functions:

(a) Find the Cartesian Product of X and Y and represent it as relation R.

Suppose there is a second fuzzy set of masonry lengths given as

(b) Find S=ZoR using max-min composition (c) Find T=ZoR using max-product
composition

2. Given two universes X={x1,x2,x3,x4,x5} and Y={y1,y2,y3,y4,y5},the fuzzy

sets A defined on X and fuzzy set B defined on Y are given below:

0. + 1+ + � 𝐵 = �0. + 1 0.9 0.7

+ + + �
4 0.7 0.8 0.6 2 0.6
𝑥 𝑦 + 𝑦5
𝐴=� 𝑥 𝑥 𝑥 𝑦 𝑦
3 3 𝑦4
𝑥 2 4 5 1 2
1

(i) Find the relation R = A × B

0.8
Consider another fuzzy
f set C defined on the universe V={v1,v2,v3},
V= + �

0.4 1
𝐶 =� +
F i n
(ii) Find P = B × C. Using max-min composition,

64 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

d RoP. 𝑣1 𝑣 𝑣3
2

65 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 4(CO4):

1. Illustrate the various types of cross over with suitable examples.

2. Using Genetic algorithm with Roulette wheel selection method maximize

the function f(x)=x2 over {0, 1, 2, ..., 31} with initial x values of (13, 24, 8,
19). Show one crossover and mutation.

Course Outcome 5(CO5):

1. Explain strong dominance and weak pareto-optimality.

2. What are the different classifications of neuro-fuzzy hybrid systems?

66 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Introduction to Soft Computing & Artificial Neural Network)

Module – 1 (Introduction

Introduction to Soft Computing. Difference between Hard Computing & Soft

Computing. Applications of Soft Computing. Artificial Neurons Vs Biological
Neurons. Basic models of artificial neural networks – Connections, Learning,
Activation Functions. McCulloch and Pitts Neuron. Hebb network.

Module – 2 (Supervised Learning Network)

Perceptron Networks– Learning rule, Training and testing algorithm. Adaptive

hitecture, Training and testing algorithm. Back propagation
Linear Neuron– Architecture,
Network – Architecture, Training and testing algorithm.

Module - 3 (Fuzzy Logic & Defuzzification)

Fuzzy sets – properties, operations on fuzzy set. Fuzzy membership functions,

Methods of membership value assignments – intuition, inference, Rank
relations operations on fuzzy relation. Fuzzy Propositions.
Ordering. Fuzzy relations–
Defuzzification Lamda cuts, Defuzzification methods.
Fuzzy implications. Defuzzification–

Module - 4 (Fuzzy Inference System & Genetic Algorithm)

Fuzzy Inference Systems - Mamdani and Sugeno types. Fuzzy Logic Controller.
Concepts of genetic algorithm. Operators in genetic algorithm - coding, selection,
cross over, mutation. Stopping condition for genetic algorithm.

Module - 5 (Multi Objective Optimization & Hybrid Systems)

Multi objective optimization,

Multi objective optimization problem. Principles of Multi-
optimality. Optimality conditions. Neuro-fuzzy
Dominance and pareto--optimality. Neuro hybrid
systems. Genetic – neuro hybrid systems.
Text Books

1. S.N.Sivanandam and S.N. Deepa, Principles of Soft Computing ,

2ndEdition, John Wiley & Sons.
2. Kalyanmoy Deb, Multi-objective Optimization using Evolutionary
Algorithms, 1st Edition, John Wiley & Sons.
ReferenceBooks

67 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Timothy J Ross, Fuzzy Logic with Engineering Applications, John Wiley &
Sons, 2016.

2. T.S.Rajasekaran, G.A.Vijaylakshmi Pai “Neural Networks, Fuzzy Logic &

Genetic Algorithms Synthesis and Applications”, Prentice-Hall India.
3. Simon Haykin, “Neural Networks- A Comprehensive Foundation”, 2/e,
Pearson Education.

4. Zimmermann H. J, “Fuzzy Set Theory & Its Applications”, Allied Publishers

Ltd.

68 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST

444

Course Name: Soft Computing

Max. Marks : 100 Duration: 3

Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Explain the architecture of a simple Artificial Neural network?

Compare it with a biological neuron.

2. A 4-input neuron has weights 1, 2, 3 and 4. The transfer function

is linear with the constant of proportionality being equal to 2. The
inputs are 4, 10, 5 and 20 respectively. Predict the output?

3. Explain the Widrow--Hoff learning rule for supervised learning in

neural networks with help of an example. Why is it sometimes
called the LMS learning rule?

4. Implement one epoch of Adaline algorithm for AND logic function

with binary inputs and bipolar outputs. Initial weights are
w1=0.2, w2=0.1 and learning rate parameter η=0.2.

69 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. 0.2 0.3 1 0.1 0.5 0.1 0.25 0.9

Consider two fuzzy sets
s 𝐴= + + + + �𝐵 = � + +
0.7
+ +

�
0 1 2 3 4 0 1 2 3
0.3
� Find the following: (a) Algebraic sum (b) Algebraic product(c) Bounded
sum.
4

6. Using your own intuition and definition of universe of discourse, plot

membership

functions for liquid level (Empty, very less, less, full, very full) in a tank.

7. Explain Stochastic Universal Sampling with an example.

8. Explain any two mutation methods.

9. Differentiate between linear and nonlinear Multi Objective Optimization

Problem.

10. What are the characteristics of neuro fuzzy hybrid systems?

(10x3=30)

Part B

(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Implement XOR function using M P Neuron Model (with binary
M-P (8)
input).Why M-P neuron is widely used in processing binary
data?

70 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Using Hebb Network calculate the weight required to perform (6)
the following classification of given input pattern.

L belongs to the members of the class(+)target

value +1 Udoes not belongs to members of
class(.)target value -1

L U

OR

12. (a) Compare the three learning approaches in Artificial Neural (8)
Network. How is the critic information used in learning
process.

(b) Define Hebb Law. Design a Hebb Network to implement

logical AND function. Use bipolar input and targets.(7)

71 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

13. (a) Discuss the training algorithm and explain the weight (10
updates in back propagation networks. )

(b) Implement one epoch of Perceptron training algorithm for OR (4)

logic function with binary input and bipolar output.

OR

14. (a) Explain how synaptic weights are adapted iteration by (10
iteration using error correction rule in Perceptron convergence )
algorithm for an OR gate with bipolar inputs and outputs.
Initial weights are all zero and learning rate parameter η=0.1.

(b) Explain Perceptron convergence theorem and discuss (4)

Perceptron algorithm based on XOR logic function.

15. (a) Three fuzzy sets are defined as follows: (10

0.1 0.2 0.3 0.4 1 0.2 0.5 0.7 0.3 0 )
𝐴= + + + },𝐵 = + + + + + },

� �
30 60 90 120 1 2 3 4 5 6

0.33 0.65 0.92 0.21

𝐶=� + + + �
100 200 300 400

Min
Find: (i) = 𝐴 × 𝐵 (ii)𝑆 = 𝐵 × 𝐶 (iii)𝑇 = 𝑅𝑜𝑆, using Max-Min
𝑇 = 𝑅𝑜𝑆, using Max-Product composition.
composition (iv)𝑇

(b) (4)
0.5 0.2 0.9 1 0.5 1
For the fuzzy sets given 𝐴 = � + + 𝐵=�
} and𝐵 +
+ }. Find
𝑥1 𝑥2 𝑥3 𝑦1 𝑦2 𝑦3

72 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

relation R by performing Cartesian product over the given fuzzy

sets.

OR

16. (a) Using inference approach, find the membership values (8)
for each of the triangular shapes (I, R, IR, T) for a triangle
with angles 120°, 50°, 10°.

(b) Using Zadeh’s notation, determine the ʎ - cut sets for the given (6)
fuzzy sets:

0 0.5 0.65 0.85 1.0 1.0

𝑆1 = � + + + + + �
0 20 40 60 80 100

0 0.45 0.6 0.8 0.95 1.0

𝑆2 = � + + + + + �
0 20 40 60 80 100

73 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Express the follo

ollowing for ʎ = 0.5: a) 𝑆1 𝖴 𝑆2 b) 𝑆´2 c) 𝑆1 ∩´ 2

17. (a) Differentiate between value encoding and permutation encoding. (8)

(b) Explain the stopping conditions for genetic algorithm. (6)

OR

18. (a) Apply Mamdani fuzzy model to design a controller to determine (10)
the wash time of a domestic washing machine. Assume input
is dirt and grease of the cloth. Use three descriptors for input
variable and five descriptors for output variables .Derive the
set of rules for controller action and defuzzification. Design
should be supported by figure wherever possible.

(b) Explain Single-Point Crossover and Two-Point Crossover with example. (4)

19. (a) Explain convex and non convex MOOP? How to find a non dominated set.
(10)

(b) What are the properties of dominance relation? (4)

OR

20. (a) Explain Genetic Neuro-Hybrid

Neuro System with block diagram. (8)
Also write the advantages of Genetic- Neuro Hybrid systems.

(b) Discuss the classification of Neuro-Fuzzy Hybrid System. (6)

74 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

CONTENTS No. of
Lecture
No Hours

(35 hrs)

Module-1 (Introduction to Soft Computing & Artificial Neural Network)

(6 hours)

1. Introduction to Soft Computing 1 hour

1

Difference between Hard Computing & Soft Computing &

1. 1 hour
Applications of Soft Computing
2

Artificial Neurons Vs Biological Neurons, Basic models of

1. 1 hour
artificial neural networks
3

1. Activation Functions 1 hour

4

1. McCulloch and Pitts Neuron 1 hour

5

1. Hebb network 1 hour

6

Module-2 (Supervised Learning Network) (7 hours)

2. Perceptron networks – Learning rule, Training and testing 1 hour

1 algorithm

2. Perceptron networks – Problems 1 hour

2

2. Adaptive Linear Neuron (Lecture I) 1 hour

3

2. Adaptive Linear Neuron (Lecture II) 1 hour

4
75 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Adaptive Linear Neuron-Problems

Neuron (Lecture III) 1 hour
5

2. Back propagation Network (Lecture I) 1 hour

6

2. Back propagation Network (Lecture II) 1 hour

7

Module-3 (Fuzzy Logic & Defuzzification) (8 hours)

3.1 Introduction to Fuzzy Set, Properties & operations on 1 hour

fuzzy sets

3.2 Fuzzy membership functions, Fuzzification 1 hour

3.3 Methods of membership value assignments 1 hour

3.4 Fuzzy relations, Operations on Fuzzy Relation 1 hour

3.5 Fuzzy Propositions & Fuzzy Implications 1 hour

3.6 Lamda cuts for fuzzy sets 1 hour

3.7 Defuzzification methods(Lecture I) 1 hour

3.8 Defuzzification methods(Lecture II) 1 hour

Module-4 (Fuzzy Inference System & Genetic Algorithm)

(6 hours)

4.1 Fuzzy Inference Systems - Mamdani type 1 hour

4.2 Fuzzy Inference Systems - Sugeno type 1 hour

4.3 Fuzzy Logic Controller 1 hour

4.4 Introduction to genetic algorithm, operators in genetic 1 hour

algorithm - coding

4.5 Selection, Cross over 1 hour

4.6 Mutation, stopping condition for genetic algorithm 1 hour

Module-5 (Multi-Objective Optimization & Hybrid

System) (8 hours)

5.1 MOOP-Linear &Non linear, Convex & Non Convex 1 hour

76 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Principles of MOO-Illustrating Pareto Optimal Solutions,

5.2 1 hour
Objectives in MOO

5.3 Dominance & Pareto-Optimality-Concept of Domination 1 hour

5.4 Properties of Dominance Relation, Pareto Optimality 1 hour

5.5 Procedure for finding a non dominated set 1 hour

5.6 Optimality Conditions 1 hour

5.7 Neuro Fuzzy hybrid system-Classification& characteristics 1 hour

5.8 Genetic –neuro hybrid systems 1 hour

77 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

FUZZY SET THEORY CATEGORY L T P CREDIT

CST454
AND APPLICATIONS Program 2 1 0 3
Elective III

Preamble:: This course equips the students to understand the concepts of

fuzziness and its use in building better solutions to problems. The course covers
basic concepts of fuzzy sets, fuzzy relations, fuzzy logic and building of fuzzy
based solutions. It helps students to design and develop fuzzy
approximation-based
based solutions to real world applications.
application

Prerequisite: Basic knowledge in set theory.

Course Outcomes: After the completion of the course, the student will be able to

CO1 Explain fuzzy logic based problem solving (Cognitive Knowledge

Level: Understand)

CO2 Summarize the concepts of crisp sets, crisp relations, crisp logic with
fuzzy sets, fuzzy relations and fuzzy logic(Cognitive Knowledge Level:
Apply)

CO3 Develop fuzzy systems by selecting appropriate membership

functions, fuzzification and defuzzification methods (Cognitive
Knowledge Level: Apply)

CO4 Develop solutions using graphical and rule-based methods

methods(Cognitive
Knowledge Level: Apply)

CO5 Make use of fuzzy logic inference to solve real world

(Cognitive Knowledge Level: Apply)
problems(Cognitive

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO1 PO

1 1 1 1
0 2

CO
1

78 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO
2

CO
3

CO
4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct
PO4 investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
Bloom End Semester
Tests
’s Examination
Catego Test 1 Test 2 Marks (%)
ry (%) (%)

Remember 20 20 20

79 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous AssessmentAssignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks.
First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
question from the partly completed module), having 3
completed modules and 1 question
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 questionquestion from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.
End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
having 3 marks for each question. Students
questions from each module, having
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

80 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module – ( Basic Fuzzy Set Theory)

The case for imprecision, Utility and Limitations of Fuzzy Systems, Fuzzy Sets
and Membership, Classical Sets – Properties, Operations, Fuzzy Sets –
Properties and Operations, Classical Relations – Cartesian Product, Operations
and Properties of Crisp Relations, Composition, Fuzzy Relations – Cardinality,
Operations, Properties, Fuzzy Cartesian Product and Composition.

Module – 2 (Fuzzy Membership Functions)

Tolerance and Equivalence Relations – Crisp and Fuzzy, Similarity Methods –

Cosine, Min-max, Fuzzy Membership Functions – Features, Fuzzification,
Defuzzification to Crisp Sets, λ-Cutsfor
λ Fuzzy Relations, Linguistic Hedges.

Module - 3 ( Fuzzification and Defuzzification Methods)

Intuition, Inference, Rank ordering,

Development of Membership Functions –Intuition,
Inductive reasoning. Defuzzification to Scalars - Max membership principle,
Centroid method, Weighted average method, Mean max membership, Center of
sums, Center of largest area, First (or last) of maxima.

Module - 4 (Fuzzy Inference)

Inference

Classical Logic, Fuzzy Logic, Approximate Reasoning, Fuzzy (Rule-Based)

(Rule
Systems - Multiple conjunctive antecedents, Multiple disjunctive antecedents,
Inference.
Aggregation of fuzzy rules, Graphical Techniques of Inference

Module - 5 (Fuzzy Applications)

Applications

Applications of Fuzzy Systems - Fuzzy Classification, Fuzzy Pattern Recognition,

Fuzzy Control Systems, Fuzzy Systems and Neural Networks, Fuzzy Clustering,
Fuzzy Databases and Information retrieval systems.

Text Books

1. Fuzzy Logic with Engineering Applications – Timothy J. Ross, Third

Edition, John Wiley and Sons, 2010
2. Fuzzy Sets and Fuzzy Logic: Theory and Applications - George J. Klir

81 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

and Bo Yuan , Prentice Hall, 1995.

Reference Books

1. Kenneth H. Rosen, Discrete Mathematics and Its Applications with

Combinatorics and GraphTheory, Seventh Edition, MGH,2011

2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with

Applications to Computer Science”, TataMc Graw Hill Pub. Co. Ltd., New
Delhi,2003.

3. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete

Mathematical Structures”, Pearson Education Pvt Ltd., New Delhi,2003

4. Kenneth H .Rosen, “Discrete Mathematics and its Applications”, 5/e,

TataMc Graw Hill Pub. Co. Ltd, New Delhi2003

82 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. What are the limitations of crisp systems?

2. Explain the difference between randomness and fuzziness.

3. Find some examples of prospective fuzzy variables in daily life.

Course Outcome 2(CO2):

1. The strength of two types of concrete needs to be compared. Four concrete

masonry units (CMUs) from each type of concrete are stressed until they
fail. The lowest stress at failure of a CMU is denoted 1, and the highest
stress at failure is denoted 4,so the CMUs are rank ordered by failure
stress, that is, X = {1, 2, 3, 4}. Since “failure” of CMUs is fuzzy, the
membership value for a specific CMU represents the judgment that the
CMU really failed. The following fuzzy sets represent the failure estimates
for the two different concrete types:

83 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

0 ⋅ 15 0.25 0⋅ 0.9
𝐴=� + + 6 + �
1 2 4

0.2 0. 0. 0.8
𝐵=� +3 5 + �
1 =+ 4
3
2

Calculate the union, intersection and difference for the two concrete types.

properties, strength and weight of steel.

2. An engineer is testing the properties,
Suppose he has two fuzzy sets A , defined on a universe of three discrete
strengths, {s1, s2,, s3},
s and B, defined on a universe of three discrete
weights, {w1,w2,w3}. Suppose A and B represent a “high-
,w3}. “high strength steel”
optimum weight,” respectively, as shown below
and a “near-optimum

1 0.5 0.
𝐴=�
𝑠 + + 2

1
𝑠2 �

𝐵=� 1 𝑠3
0.5
+ + 0.
2
�
𝑤1 𝑤 𝑤3
2

a) Find the fuzzy relation for the Cartesian product, R, of A and B

b) Introducing another fuzzy set, C, which represents a set of
“moderately good” steel strengths
84 | P a g e
B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

0.1 0.6 1
𝐶=�
+ + �
𝑠1 𝑠2 𝑠3

85 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Find C◦R
◦R using max–min composition

Course Outcome 3(CO3):

1. Using your own intuition and your own definitions of the universe of
discourse,plot fuzzy membership functions for “age of people” who are:
(i) very young
(ii) young
(iii) middle-aged
aged
(iv) old
2. a) Define membership functions for approximately isosceles triangle,
angled triangles.
approximately equilateral and approximately right-angled

b) Find the membership value for the triangle represented by the angles 80◦,

75◦, 25◦, in the above triangles.

3. In metallurgy, materials are made with mixtures of various metals and other
elements to achieve certain desirable properties. In a particular preparation
of steel, three elements, namely, iron, manganese, and carbon, are mixed in
two different proportions. The samples obtained from these two different
proportions are placed on a normalized scale and are represented as fuzzy
sets A1 and A2. Do a logical union of the membership functions A1 and A2
and find the defuzzified value of the resulting membership function.

Course Outcome 4(CO4): .

1. Consider the following two discrete fuzzy sets, which are defined on universeX
= {−5, 5}:
86 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

0 0.5 1 0.5 0
𝐴 = "𝑧ⅇ𝑟𝑜" = � + + + + �
−2 −1 0 1 2

0 0.6 0.6 0
𝐵 = "𝑝𝑜𝑠𝑝𝑝𝑡𝑝𝑝𝑣𝑒 𝑚𝑒𝑑𝑝𝑝𝑢𝑚" = � + + �
+ 1 3 4
0 +
1

Construct the relation for IF x is “zero” THEN y is “positive medium”

2. A metro train system uses fuzzy logic in ensuring smooth ride on the
train. The metro train system has fixed stops and the distance between the
stops are known. The system uses fuzzy logic in deciding the pressure
applied on the brakes. The amount of pressure applied depends on the
distance to the next stop and the speed of the train. Design appropriate
membership functions for the input and illustrate the use of Mamdani
Inference in arriving at the brake pressure.
Course Outcome 5(CO5):

1. A fuzzy systems needs to be designed to provide a rating for a web store as

“excellent”, “good” or “poor”. The web store can be rated based on the
products available, the customer service and the discount provided.
Design appropriate membership functions and fuzzy rules for generating
the fuzzy based rating system.

2. Design a fuzzy control system for an air-conditioning application. Make

appropriate decisions regarding inputs and outputs.

87 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL

UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST454

Course Name: Fuzzy Set Theory and

Applications

Max.Marks:100 Duration: 3
Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Illustrate where a fuzzy logic based application is suitable.

2. Consider a LAN using Ethernet protocol with maximum bandwidth

of 10 Mbps. Traffic rates can be represented using two fuzzy
variables, Quiet and Congested. If the universal set X =
{0,1,2,3,4,5,6,7,8,9,10} represents bandwidth usage in Mbps, then
draw possible membership functions for the fuzzy variables.

3. Define fuzzy tolerance and equivalence relations.

4. Given two data points, illustrate how a similarity measure

between them can be computed.
88 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Define a convex normalized fuzzy set.

6. How does augmented query help in information retrieval.

7. Given the propositions

(i) C˅D

(ii) ~H => (A ˄ ~B)

(iii) (C ˅ D) => ~H
(iv) (A ˄ ~B) => (R ˅ S)

Infer (R ˅ S) from the above propositions and state the tautologies used.

8. Write a predicate logic statement for “Ram likes all kinds of food”.

9. Given the relation R below, find λ-cut for the relation using suitable λ
value.

1 0.8 0 0.1 0.2

𝖥0.8 1 0.4 0 0.9⎤
0 0.4 1 0 0
⎢0.1 0 0 1 0.5⎥
⎣0.2 0.9 0 0.5 1 ⎦

10 Define maximum approaching degree.

.
(10x3=30)

Part B

(Answer any one question from each module. Each question

carries 14 Marks)

89 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

11 (a) An engineer is testing the properties, strength and weight of (4)

. steel. Suppose he has two fuzzy sets A, defined on the universe
of three discrete strengths { s1, s2, s3 } and B, defined on the
universe of discrete weights { w1, w2, w3}.
Suppose A represents a “high-strength steel” and B a “near-
optimum weight”.

1 0.5 0.2 1 0.5 0.3

A=� + + �, B = � + + �
𝑠1 𝑠2 𝑠3 𝑤1 𝑤2 𝑤3

Find fuzzy Cartesian product, R, of A and B.

(b) 0.1 0.6 1 (5)

Let a fuzzy set C= �+ + � be introduced, which represents a
set of
𝑠1 𝑠2 𝑠3
“moderately good” steel strength. Find the max-min composition
of C and R.

(c) Define 5 operations associated with crisp relations. (5)

OR

12 (a) How is excluded middle axiom different for crisp and fuzzy sets? (4)
.

(b) Differentiate between crisp and fuzzy sets with respect to their (4)
membership functions.

(c) Illustrate any 4 operations associated with a fuzzy relation. (6)

90 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

13. (a) A structural designer is considering four different kinds of

(10)
structural beams
{ S1, S2, S3, S4} for a new building. Laboratory experiments on
the deflection resistance for these four kinds of beams have
been performed, and the engineer wants to determine their
suitability in the new structure. The following data have been
observed based on the overall deflection capacity of each beam
type:

S1 S2 S3 S4
No deflection X1 0.3 0.6 0. 0.8
5
Some X2 0.6 0.3 0. 0.2
deflecti 5
on
Excessi X3 0.1 0.1 0 0
ve
deflecti
on

Use cosine amplitude method to determine the similarity of

the four beam types.

(b) Given a fuzzy se 0.1 0.6 1 (4)

et “tall” = � + + te how the
�, illustrate
fuzzy set “very
𝑠1 𝑠2 𝑠3
tall” be
defined?

91 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

(4)
14. (a) Define tolerance and equivalence relations. Check whether
the relation R given below is tolerance or equivalence relation.

1 0.8 0 0.1 0.2

𝖥0.8 1 0.4 0 0.9⎤
0 0.4 1 0 0
0.1 0 0 1 0.5
⎢0.2 0.9 0 0.5 1 ⎥

(10
(b) Given the following data regarding three cities and the quality
)
of their bridges, find the similarity between the cities using
max-min method.
C1 C2 C3
Poor Q1 0.00 0.10 0.10
Fair Q2 0.04 0.04 0.08
Good Q3 0.02 0.04 0.06

92 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

15. (a) Explain the process of developing membership functions (6)

using the inference method.

(8)
(b) The following raw data were determined in a pair wise
comparison of new
premium car preferences in a poll of 100 people. When it was
compared with a Porsche (P), 79 of those polled preferred a
BMW (B), 85 preferred a Mercedes (M), 59 preferred a Lexus (L),
and 67 preferred an Infinity (I). When a BMW was compared,
the preferences were 21 – P, 23 – M, 37 – L, and 45 – I. When a
Mercedes was compared, the preferences were 15 – P, 77
– B, 35 – L, and 48 – I. When a Lexus was compared, the
preferences were 41
– P, 63 – B, 65 – M, and 51 – I. Finally, when an Infinity was
compared, the preferences were 33 – P, 55 – B, 52 – M, and
49 – L. Using rank ordering, plot the membership function for
“most preferred car.”

OR

16. (a) 1. Defuzzify the following region using

centroid method. (9)

(b) 2. Defuzzify the region given in 16(a) using weighted average method. (5)

93 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. (a) For a distillation process, the objective is to separate (8)

components of a mixture in the input stream. The relationship
between the input variable, temperature,
and the output variable, distillate fractions, is not precise
but the human operator of this process has developed an
intuitive understanding of this relationship. The universe
for each of these variables is

X = universe of temperatures (degree fahrenheit) = {160, 165,

170, 175, 180,
185, 190, 195}.
Y = universe of distillate fractions (percentage) = {77, 80, 83, 86,
89, 92, 95,
98}.
Given two fuzzy sets
A = “temperature of input steam is + 1 0.4
+ + �
0 0.7
hot”= � 1 190
175 1
8
8
5
0

94 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

B = “separation
tion of mixture is + + 1
+ �.
0 0.5 0.8
good” =� 98
89 9 9
2 5
Find the fuzzy relation
re THE y is 𝐵�
corresponding to “ IF x is 𝐴̃, THEN

(b) Show how inference is done using Generalized Modus Ponens (6)

OR

18. (a) Illustrate how graphical inference is done using Mamdani method. (6)

(b) A restaurant uses a fuzzy inference system to calculate the tips (8)
given to its employees. The tips are based on the timeliness of
service and quality of service of the waiters. Design appropriate
membership functions for the input and illustrate the use of
Sugeno Inference in arriving at the tip amount.

19. (a) Explain fuzzy pattern recognition using multiple features. (7)

(b) Describe how fuzziness in information retrieval can enhance (7)

the quality of search results.

95 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

20. (a) Design a fuzzy control system for an air-conditioning system. (7)

(b) Illustrate how the join operation is performed in fuzzy databases. (7 )

96 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan
CONTENTS No. of
Lecture
No
Hours

(36 hrs)

Module-1(Basic
Module Fuzzy Set Theory)
(6 hours)

Introduction to Fuzzy Concepts – Case for imprecision-

imprecision
1.1 1 hour
utility and limitations of Fuzzy Systems

1.2 Classical Sets – Properties, Operations 1 hour

1.3 Fuzzy Sets – Properties, Operations 1 hour

1.4 Class Relation – Properties, – Cartesia Prod 1 hour

ical s Operatio n uct,

ns
Composition

1.5 Fuzzy Relations – Properties, Operations, Cardinality 1 hour

1.6 Fuzzy Cartesian Product, Fuzzy Composition 1 hour

Module-2 (Fuzzy Membership Functions) (6 hours)

2.1 Tolerance and Equivalence Relations - Crisp 1 hour

2.2 Tolerance and Equivalence Relations - Fuzzy 1 hour

2.3 Similarity Methods – Cosine, Minmax 1 hour

2.4 Fuzzy Membership Functions- Features 1 hour

2.5 Fuzzification, Defuzzification to crisp sets – λ-cuts 1 hour

2.6 Linguistic Hedges 1 hour

Module-3 (Fuzzification and Defuzzification Methods) (7

hours)

3.1 Development of Membership Functions – Intuition, Inference 1 hour

3.2 Development of Membership Functions – Rank Ordering 1 hour

3.3 Development of Membership Functions – Inductive reasoning 1 hour

97 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Defuzzification – Max membership principle, weighted

3.4 1 hour
average method, mean max membership

3.5 Defuzzification – Centroid method 1 hour

Defuzzification – Center of Sums, Center of Largest area,

3.6 1 hour
First/Last of maxima

3.7 Defuzzification - exercises 1 hour

Module (Fuzzy Inference) (9 hours)

Module-4

4.1 Classical Logic – Propositional Logic 1 hour

4.2 Classical Logic – Predicate Logic 1 hour

4.3 Fuzzy Logic 1 hour

4.4 Fuzzy Approximation based reasoning 1 hour

4.5 Fuzzy Rule based systems 1 hour

4.6 Multiple conjunctive and disjunctive antecedents, 1 hour

aggregation

4.7 Graphical Techniques for Inference 1 hour

4.8 Illustration of Graphical Techniques for Inference 1 hour

4.9 Fuzzy Inference - Exercises 1 hour

Module (Fuzzy Applications) (8 hours)

Module-5

5.1 Fuzzy Control Systems 1 hour

5.2 Illustration of Fuzzy Control Systems 1 hour

5.3 Fuzzy Classification 1 hour

5.4 Fuzzy Pattern Recognition 1 hour

5.5 Fuzzy Systems and Neural Networks 1 hour

5.6 Fuzzy Clustering 1 hour

5.7 Fuzzy Databases 1 hour

5.8 Fuzzy Information Retrieval Systems 1 hour

98 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AMT SOCIAL AND Category L T P Credit

464 INFORMATION
Program 2 1 0 3
NETWORKS
Elective III

Preamble:

By the end of the course, students should have a solid understanding of the
significance and applications of social network analysis. They should be able to
comprehend and analyze social networks using appropriate terminology, grasp
the fundamentals of graph theory and network representation, and visualize and
explore networks to gain insights into their structure and characteristics. They
should be able to apply community detection algorithms and modularity
optimization techniques to identify and analyze communities in networks.
Prerequisite: Nil.
Mapping of course outcomes with program outcomes

CO1 Understand the significance and applications of social network

analysis in various domains, and demonstrate knowledge of the
fundamental concepts and terminology used in social network
analysis.(Cognitive Knowledge Level: Understand)

CO2 Explain the basic terminology and concepts of graph theory in the
context of social networks, as well as understand the fundamental
concepts of network formation and random graph models.(Cognitive
Knowledge Level: Understand)

CO3 Explain the concept of centrality in social networks and its

significance in identifying influential nodes.(Cognitive Knowledge
Level: Understand)

CO4 Apply network analysis techniques to model and analyze markets and
incentives in networks, as well as apply resilience analysis techniques
to identify critical nodes and edges in a network.(Cognitive

99 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Knowledge Level: Apply)

CO5 Understand the concept of communities in networks and their

analysis.(Cognitive Knowledge Level:
importance in social network analysis.(Cognitive
Understand)

CO6 Apply data mining techniques to extract meaningful insights and

patterns from network data.(Cognitive Knowledge Level: Apply)
data.(Cognitive

Mapping
apping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO8 PO PO PO1 PO
1 2 3 4 5 6 7 9 10 1 12

CO1

CO2

CO3

CO4

CO5

CO6

tract POs defined by National Board of

Abstract
Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

100 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of

PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Marks (%)
Test 1 Test 2
(%) (%)

Remember

Understand 70 50 50

Apply 30 50 50

Analyze

Evaluate

Create

101 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.
First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

102 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module – 1 (Introduction to Social Network Analysis and Graph Theory)

Introduction to Social Network Analysis - Overview of social networks and their

importance, Basic network terminology and concepts. Graph Theory and
Network Basics: Graph representation and terminology, Types of networks-
directed, undirected, weighted, Network visualization and exploration.

Module - 2(Random Graphs and Centrality Measure)

Measures of Centrality and Influence: Degree centrality and eigenvector

centrality, Betweenness centrality and closeness centrality, Hubs and
authorities. Network Formation and Random Graphs: Random graph models:
Erdos-Renyi and preferential attachment, Small-world networks and the Watts-
Strogatz model, Scale-free networks and the Barabasi-Albert model

Module - 3 ( Game Theory, Strategic and Cascading Behaviour in Networks)

Cascading Behavior in Networks: Diffusion and contagion in networks,

Threshold models and cascades, Influence maximization and viral marketing.
Game Theory and Strategic Behavior: Strategic interactions on networks,
Network games and the prisoner's dilemma, Evolutionary game theory and
network effects.

Module - 4 (Markets and Incentives in Networks)

Markets and Incentives in Networks- The influence of network structure on

market dynamics, Information cascades and herding behavior, Network
externalities and network markets. Network Resilience and Robustness-
Vulnerability and robustness of networks, Attack strategies and network
resilience, Cascading failures and network recovery.

Module - 5 (Communities and Data Analysis and Mining in Networks)

Communities and Clustering in Networks- Community detection algorithms,

Modularity optimization, Structural balance and triadic closure. Network Data
Analysis and Mining- Data collection and pre-processing techniques, Link
103 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

prediction and recommendation systems, Visualization and analysis of large-

scale networks

Text Books

1. Wasserman, Stanley, and Katherine Faust. "Social network analysis: Methods

and applications." (1994).

2. Easley, David, and Jon Kleinberg. Networks, crowds, and markets:

Reasoning about a highly connected world. Cambridge university press,
2010.

3. Jackson, Matthew O. Social and economic networks. Vol. 3. Princeton:

Princeton university press, 2008.

ReferenceBooks

1. Kadushin, Charles. Understanding social networks: Theories, concepts, and

findings. Oxford university press, 2012.

104 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. Explain the significance of social network analysis in various domains

and provide examples of its applications in real-world scenarios.

2. Define the fundamental concepts of social network analysis, including

nodes, edges, and ties. Illustrate these concepts with a practical example.

3. Describe the role of social network analysis in understanding information

flow and influence within a network. Provide an example to support your
explanation.

4. Provide an overview of the key measures used in social network analysis,

such as degree centrality and betweenness centrality. Explain how these
measures help in identifying important nodes within a network.

5. Describe the concept of network motifs in social network analysis.

Discuss their significance in uncovering recurring patterns and
understanding network dynamics.

6. Discuss the process of network data collection and the challenges

associated with it. Explain the importance of data pre-processing in social
network analysis.

Course Outcome 2(CO2):

1. Define and explain the basic terminology of graph theory in the
context of social networks. Illustrate your explanation with a simple
example of a social network graph.
2. Explain the concept of nodes and edges in the context of graph
theory and how they relate to individuals and relationships in social
networks.
3. Discuss the concept of clustering coefficient in graph theory and its
significance in identifying tightly-knit groups or communities in
social networks.

105 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4. Explain the concept of network formation and its role in

understanding the emergence and evolution of social networks.
Provide examples of real-world scenarios where network formation
principles apply.
5. Describe the small-world phenomenon and its relevance to social
networks. Explain the Watts-Strogatz model and how it captures the
characteristics of small-world networks.
6. Explain the concept of scale-free networks and the Barabási-Albert
model. Discuss the mechanisms behind the formation of scale-free
networks and their implications in social network analysis.
Course Outcome 3(CO3):

1. Discuss the importance of studying network structure in social network

analysis. Explain the concepts of density, centrality, and clustering
coefficient in relation to network analysis.

2. Define centrality in the context of social networks and explain its

significance in understanding network dynamics and identifying
influential nodes.

3. Discuss the concept of degree centrality and its role in measuring node
importance in a social network. Provide an example to illustrate your
explanation.

4. Explain the concept of betweenness centrality and how it identifies nodes

that control information flow in a social network. Discuss its applications
in real-world scenarios.

5. Discuss the concept of degree centrality and its role in measuring node
importance in a social network. Provide an example to illustrate your
explanation.

6. Explain the concept of betweenness centrality and how it identifies nodes

that control information flow in a social network. Discuss its applications
in real-world scenarios.

106 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 4(CO4):

1. Define network analysis techniques and their application in
modeling and analyzing markets and incentives in networks. Provide
examples to support your explanation.
2. Explain the concept of resilience analysis and its relevance in
identifying critical nodes and edges in a network. Discuss why this
analysis is important in understanding network robustness.
3. Discuss the role of network analysis techniques in uncovering
market dynamics and understanding the influence of network
structure on market behavior. Provide real-world examples to
illustrate your explanation.
4. Imagine you have a social network representing a market. Apply
network analysis techniques to identify influential nodes that can
potentially drive market behavior. Justify your choices based on the
analysis results.
5. Design a recommendation system for an online social network based
on network analysis principles. Explain the techniques you would
use and how they contribute to providing relevant recommendations
to users.
6. Given a network representing a supply chain, apply resilience
analysis techniques to identify critical nodes and edges that, if
disrupted, would have the most significant impact on the entire
network's functionality. Explain the implications of your findings for
supply chain management.
Course Outcome 5(CO5):
1. Define the concept of communities in the context of social networks
and explain their significance in social network analysis. Provide
examples to support your explanation.
2. Discuss the characteristics of communities in social networks and
how they contribute to understanding the structure and dynamics of

107 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

the network. Provide real-world examples to illustrate your

explanation.
3. Describe the concept of modularity optimization and how it is used
to partition a network into communities. Discuss its advantages and
potential challenges.
4. Analyze a given social network and identify the communities present
within it. Discuss the characteristics of each community and their
implications for understanding the network.
5. Discuss the challenges and limitations in identifying communities in
large-scale social networks. Provide strategies or techniques that can
be employed to overcome these challenges.
6. Explain the concept of overlapping communities in social networks
and their significance in capturing the multi-faceted nature of
relationships. Provide examples to illustrate your explanation.
Course Outcome 6(CO6):
1. Given a social network dataset, apply data mining techniques to
identify influential nodes or communities within the network.
Explain the techniques you would use and interpret the insights
obtained.
2. Given a large-scale network dataset, apply data mining
techniques to detect anomalous behavior or outliers within the
network. Describe the techniques you would employ and discuss
the potential applications of identifying such anomalies.
3. Compare and contrast different data mining techniques
commonly used in network analysis, such as clustering,
classification, and link prediction. Discuss their respective
strengths and limitations.

108 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

MODEL QUESTION PAPER

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AMT 464

Course Name: Social andInformation Networks

Max.Marks:100
Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. What is social network analysis?

2. Compare and contrast directed and undirected networks,

highlighting their characteristics and applications.

3. Explain the concept of degree centrality and its significance in

network analysis.

4. Explain the Erdos-Renyi model of random graph formation and

discuss its properties.

5. Discuss the role of social norms and cooperation in network games

and their implications.

109 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

6. Provide examples of real-world applications where network effects

play a significant role.

7. Discuss the influence of network structure on market dynamics and

provide example.

8. Explain the concept of network markets and how they differ from
traditional markets.

9. Explain the process of data collection and pre-processing

techniques for network analysis.

10. Discuss the challenges and considerations in collecting and

handling large-scale network data. (10x3=
30)

Part B

(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Explain the significance of network visualization in social (9)

network analysis and discuss different visualization techniques.

(b) Provide an overview of the key metrics used in social network (5)
analysis.

OR

12. (a) Discuss the importance of social network analysis and its (9)
applications in various fields.

(b) What are the basic concepts and terminology used in social (5)
network analysis?

110 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

13. (a) Discuss the small-world phenomenon and explain how the (7)
Watts-Strogatz model generates small-world networks.

(b) Explain the concept of scale-free networks and the power-law (7)
degree distribution associated with them.

OR

14. (a) Define eigenvector centrality and discuss its interpretation in (7)
terms of influence and importance.

(b) Describe the process of network evolution and growth in the (7)
Barabási-Albert model.

15. (a) Explain the concept of diffusion and contagion in networks and (6)
how it affects the spread of information or behaviors.

(b) Explain the concept of influence maximization and its (8)

applications in viral marketing strategies.

OR

16. (a) Explain the concept of network formation games and how they (9)
contribute to the study of network evolution.

(b) Discuss the limitations and challenges in applying game theory (5)
to study strategic behavior in real-world networks.

17. (a) Explain the process of network recovery after cascading failures (8)
and the factors influencing it.

(b) Discuss the importance of network resilience in critical (6)

infrastructure systems

111 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR

18. (a) Explain how network topology and node characteristics affect (6)
network resilience.

(b) Discuss the role of redundancy and resilience strategies in (8)

enhancing network robustness.

19. (a) Discuss community detection algorithms in networks and (7)

explain how they identify clusters of nodes with similar
connectivity patterns.

(b) Explain the concept of modularity optimization and its role in (7)
community detection.

OR

20. (a) Explain the concept of link prediction in network analysis and (7)
discuss common techniques used for link prediction.

(b) How can recommendation systems be built based on network (7 )

analysis and mining techniques?

112 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
Lecture
No Contents
Hours

(35 hrs)

Module – 1 (Introduction to Social Network Analysis and Graph Theory) (5

hours)

1.1 Introduction to Social Network Analysis 1 hour

1.2 Overview of social networks and their importance 1 hour

Graph Theory and Network Basics: Graph representation and

1.3 1 hour
terminology

1.4 Types of networks- directed, undirected, weighted 1 hour

1.5 Network visualization and exploration. 1 hour

Module - 2(Random Graphs and Centrality Measure) (8 hours)

2.1 Measures of Centrality and Influence: Degree centrality 1 hour

2.2 Eigenvector centrality 1 hour

Betweenness centrality and closeness centrality, Hubs and

2.3 1 hour
authorities.

Random graph models: Erdős-Rényi and preferential

2.4 2 hours
attachment

2.5 Small-world networks and the Watts-Strogatz model 1 hour

113 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.6 Scale-free networks and the Barabási-Albert model 2 hours

Module - 3 ( Game Theory, Strategic and Cascading Behaviour in

Networks) (7 hours)

Cascading Behavior in Networks: Diffusion and contagion in

3.1 1 hour
networks

3.2 Threshold models and cascades 2 hours

3.3 Influence maximization and viral marketing 1 hour

Game Theory and Strategic Behavior: Strategic interactions on

3.4 1 hour
networks

3.5 Network games and the prisoner's dilemma 1 hour

3.6 Evolutionary game theory and network effects. 1 hour

Module - 4 (Markets and Incentives in Networks)(7 hours)

Markets and Incentives in Networks- The influence of network

4.1 1 hour
structure on market dynamics

4.2 Information cascades and herding behaviour 1 hour

4.3 Network externalities and network markets 1 hour

Network Resilience and Robustness- Vulnerability and

4.4 1 hour
robustness of networks

4.5 Attack strategies and network resilience 2 hours

4.6 Cascading failures and network recovery. 1 hour

Module - 5 (Communities and Data Analysis and Mining in Networks) (8

114 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

hours)

5.1 Communities and Clustering in Networks 1 hour

5.2 Community detection algorithms, 1 hour

5.3 Modularity optimization 1 hour

5.4 Structural balance and triadic closure 1 hour

Network Data Analysis and Mining- Data collection and pre-

5.5 1 hour
processing techniques

5.6 Link prediction and recommendation systems 1 hour

5.7 Visualization and analysis of large-scale networks 2 hours

115 | P a g e
 B COMPUTER SCIENCE
TECH IN ARTIFICIAL AND ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

YEAR OF
CATEGORY L T P CREDIT
CST474 COMPUTER VISION INTRODUCTION

PEC 2 1 0 3 2019

Preamble: Computer vision is a field of artificial intelligence (AI) that enables computers and
systems to derive meaningful information from digital images, videos and other visual inputs. The
curriculum covers the basics of image formation, key computer vision concepts, methods,
techniques, pattern recognition, various problems in designing computer vision and object
recognition systems. This course enables the learners to understand the fundamentals of computer
vision and develop applications in computer vision.

Prerequisite: Nil

Course Outcomes: After the completion of the course, the student will be able to

Summarize basic concepts, terminology, theories, models and methods in the field of
CO1
computer vision.
(Cognitive Knowledge Level: Understand)
Explain basic methods of computer vision related to multi-scale representation, edge
CO2
detection, detection of other primitives, stereo, motion and object recognition.
(Cognitive Knowledge Level: Understand)
Describe principles of Segmentation, Motion Segmentation and Classification
CO3
(Cognitive Knowledge Level: Understand)

Select appropriate object Tracking and detection methods for computer vision
CO4
applications (Cognitive Knowledge Level: Understand).

Implement a computer vision system for a specific problem (Cognitive Knowledge

CO5
Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

Page 116
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 50 50 50

Apply 20 20 20

Analyze

Evaluate
Create

Page 117
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus
Module – 1 (Image Formation and Filtering)
Geometric Camera Models - Pinhole perspective, Intrinsic and Extrinsic Parameters, Geometric
Camera Calibration. Linear Filters- Linear Filters and Convolution, Shift Invariant Linear
Systems. Filters as Templates - Normalized Correlation and Finding Patterns.

Page 118
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Module - 2(Local Image Features and Stereo Vision)

Image Gradients - Computing the Image Gradient, Gradient Based Edge and Corner Detection.
Stereopsis- Binocular Camera Geometry, Epipolar Constraint, Binocular Reconstruction, Local
Methods for Binocular Fusion, Global Methods for Binocular Fusion.
Module - 3 (Segmentation)
Segmentation - Background subtraction, Interactive segmentation, Forming image regions.
Segmentation by clustering - Watershed Algorithm. Motion Segmentation by Parameter
Estimation- Optical Flow and Motion, Flow Models, Motion Segmentation with Layers.
Module- 4 (Classification and Tracking)
Classification - Classification Basics, Two-class and Multiclass classifiers, Error, Overfitting and
Regularization, Cross Validation, Classifying Images of Single Objects.
Tracking - Tracking Basics, Simple Tracking Strategies, Tracking by detection, Tracking Linear
Dynamical models with Kalman filters.
Module - 5 (Finding Objects and other Applications)
Object detection - The Sliding Window Method. Object Recognition -Goals of Object Recognition
System. Applications - Robot Navigation by stereo vision, Face detection, Face recognition,
Activity Recognition, Tracking people.
Text Books
1. Forsyth, David, and Jean Ponce. Computer vision: A modern approach. Prentice hall,
2011.
Reference Books
1. Szeliski, Richard, Computer vision: algorithms and applications. Springer Science &
Business Media, 2010.
2. Medioni, Gerard, Emerging topics in computer vision. and Sing Bing Kang. Prentice Hall
PTR, 2004.
3. Trucco, Emanuele, and Alessandro Verri, Introductory techniques for 3-D computer vision.
Vol. 201. Englewood Cliffs: Prentice Hall, 1998.
4. Faugeras, Olivier, and Olivier Autor Faugeras, Three-dimensional computer vision: a
geometric viewpoint. MIT press, 1993.
Course Level Assessment Questions
Course Outcome 1 (CO1):
1. Explain the relationship between coordinates involved in a pinhole camera imaging setup.
2. Explain the basic principle behind geometric camera calibration.
3. Describe how linear filters can be used for smoothing digital images.
4. How does normalised correlation help in matching patterns in images?

Page 119
 COMPUTER SCIENCE AND ENGINEERING
B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE
LEARNING

Course Outcome 2 (CO2):

1. Describe edge detection methods for computer vision.
2. List any five applications of object recognition.
3. Explain how the epipolar constraint simplifies the correspondence search between
two stereo images.
4. List and explain the different methods used for binocular fusion.
5. Explain the different corner detection methods.
Course Outcome 3 (CO3):
1. Explain the principle of background subtraction.
2. Describe the watershed algorithm for image segmentation.
3. What is meant by optical flow? How can it be utilized for segmenting images?
4. Describe motion segmentation with layers.
5. What is overfitting in the context of classification?
6. Explain the principle behind classification of single images.
Course Outcome 4 (CO4):
1. Explain ‘Mean Shift Algorithm’ to track an object using matching.
2. Describe an algorithm to track a moving object (dynamic object).
3. Explain the sliding window method for object detection.
4. Assume that we have the dynamics
𝑥𝑥𝑖𝑖 ~ 𝑁𝑁(𝑑𝑑𝑖𝑖 𝑥𝑥𝑖𝑖−1 , 𝜎𝜎𝑑𝑑2𝑖𝑖 )
𝑦𝑦𝑖𝑖 ~𝑁𝑁(𝑚𝑚𝑖𝑖 𝑥𝑥𝑖𝑖 , 𝜎𝜎𝑚𝑚2 𝑖𝑖 )
a. 𝑃𝑃(𝑥𝑥𝑖𝑖 |𝑥𝑥𝑖𝑖−1 ) is a normal density with mean 𝑑𝑑𝑖𝑖 𝑥𝑥𝑖𝑖−1 and variance 𝜎𝜎𝑑𝑑2𝑖𝑖 . Whatis(𝑥𝑥𝑖𝑖−1 |𝑥𝑥𝑖𝑖 ) ?
b. Show how to obtain a representation of 𝑃𝑃(𝑥𝑥𝑖𝑖 |𝑦𝑦𝑖𝑖+1 , . . . , 𝑦𝑦𝑁𝑁 ) usinga KalmanFilter.

Course Outcome 5(CO5):

1. Explain how to implement a computer vision system.
2. Illustrate a computer vision system with the help of a neat diagram.
3. Discuss the components of a computer vision system for object recognition.
4. Explain how activity recognition can be done using computer vision.
5. Illustrate a face recognition system with the help of a diagram.
Assignment Questions
6. Implement a voxel-based approach to visual hull construction.
7. Implement a computer vision system for object recognition.

Page 120
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST474

Course Name: COMPUTER VISION

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. State three properties of shift invariant linear systems.

2. Explain the term normalized correlation.

3. What is image rectification? Mention its significance?

4. Illustrate epipolar geometry and showepipolar lines and epipoles.

5. Explain the term flow model.

6. How does background subtraction help in segmenting an image?

7. What is a Kalman filter? Give its applications.

8. State any three simple tracking strategies.

9. State the goals of an object recognition system.

10. Explain the task of face recognition. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

Page 121
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

11. (a) Demonstrate the relationship between a point in the world coordinate frame (9)
and its corresponding image point using camera parameters.
(b) Show that convolving a function with a δ function simply reproduces the (5)
original function.

OR

12. (a) What is linear filtering? Explain two applications of linear filtering to image (7)
processing.
(b) Explain an application of normalised correlation to find patterns. (7)

13. (a) Show that smoothing an image and then computing the gradient is same as (5)
convolving an image with the derivative of a smoothing function.

(b) State the epipolar constraint and derive its representations using the Essential (9)
matrix and the Fundamental matrix.

OR
14. (a) Explain the algorithm for computing edges using gradients. (9)

(b) Define binocular fusion. Explain two local methods for binocular fusion. (5)

15. (a) Discuss the different interactive segmentation approaches. (7)

(b) What is meant by optical flow? How can it be utilized for segmenting (7)
images?

OR
16. (a) Explain the Watershed algorithm. (7)

(b) How can we perform motion segmentation by parameter estimation? (7)

17. (a) Explain tracking algorithm using Kalman filtering. (7)

(b) Illustrate the tracking by detection algorithm. (7)

OR
18. (a) Explain the various kinds of errors in classification and the relationship (7)
between them.

(b) What is overfitting and how does regularization help to minimise it? (7)

19. (a) Explain human activity recognition with appearance features. (7)

Page 122
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

(b) Describe the Sliding window method for detecting objects in images. (7)

OR
20. (a) Explain the principle of detecting faces in an image. (7)

(b) What are the various strategies for object recognition? (7)

Teaching Plan

No. of Lecture
No Contents Hours
(36hrs)
Module 1 Image Formation and Filtering (7)
1.1 Geometric Camera model - Pinhole perspective 1
1.2 Geometric Camera model - Intrinsic Parameters 1
1.3 Geometric Camera model - Extrinsic Parameters 1
1.4 Geometric Camera Calibration – Linear Approach 1
1.5 Linear Filters and Convolution 1
1.6 Shift Invariant Linear Systems - Discrete convolution 1
1.7 Normalized Correlation and Finding patterns 1
Module 2 Local Image Features and Stereo Vision (8)
2.1 Local Image Features - Computing the Image Gradient 1
2.2 Gradient Based Edge Detection 1
2.3 Gradient Based Corner Detection 1
2.4 Stereopsis - Binocular Camera Geometry and Epipolar 1
Constraint
2.5 Essential Matrix and Fundamental Matrix 1
2.6 Binocular Reconstruction 1
2.7 Local Methods for Binocular Fusion 1
2.8 Global Methods for Binocular Fusion 1
Module 3 Segmentation (6)

Page 123
 COMPUTER SCIENCE AND ENGINEERING

3.1 Segmentation basics 1

3.2 Applications - Background Subtraction, Interactive 1
Segmentation
3.3 Forming Image Regions 1
3.4 Segmentation by clustering - The Watershed Algorithm 1
3.5 Motion Segmentation by Parameter Estimation - Optical 1
Flow and Motion
3.6 Flow Models and Motion Segmentation with Layers 1
Module 4 Classification and Tracking (8)
4.1 Classification Basics, Two-class and Multiclass classifier 1
4.2 Error, Overfitting and Regularization 1
4.3 Cross Validation, Classifying Images of Single Objects 1
4.4 Tracking Basics, Simple Tracking Strategies 1
4.5 Tracking by detection 1
4.6 Linear Dynamical models 1
4.7 The Kalman Filter background 1
4.8 Kalman filter algorithm 1
Module 5 Finding Objects and other Applications (7)
5.1 Detecting Objects in Images- The Sliding Window Method 1
5.2 Object Recognition - Goals of Object Recognition System 1
5.3 Application of binocular stereo vision - Robot Navigation 1
5.4 Face detection 1
5.5 Face recognition 1
5.6 Activity recognition 1
5.7 Tracking people 1

Page 124
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VIII

PROGRAM
ELECTIVE IV

125 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

HUMAN CATEGORY L T P CREDIT

AMT 416
COMPUTER Program 2 1 0 3
INTERACTION Elective IV

Preamble:.This course provides an overview of Human-Computer

Interaction (HCI), with an understanding of user interface design in
general. The course covers topics which include user-centered design,
human cognitive and physical abilities, prototyping and evaluation
techniques, graphical design fundamentals and emerging areas of HCI
research including mobile interaction, augmented-reality and
ubiquitous computing. This course helps the learners to design and
evaluate interactive systems by following the fundamental principles of
human-computer interaction.
Prerequisite: Skill in any programming language. Exposure to web
designing is preferred.
Course Outcomes: After the completion of the course the student will be
able to
Describe the usability based on a variety of classic universal
user-centric models. (Cognitive Knowledge level:
CO 1
Understand)
Comprehend the different interaction styles and the
methodologies for designing interactive systems.
CO 2
(Cognitive Knowledge level: Understand)
Investigate the core and complex user experience design
CO 3 issues. (Cognitive Knowledge level: Understand)

Examine the evaluation methodologies of interactive system

CO 4 design. (Cognitive Knowledge level: Apply)

Explore the different contexts and suggest suitable designs for

applications related to web, mobile and wearable computing.
CO 5
(Cognitive Knowledge level: Apply)

126 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

1 2 3 4 5 6 7 8 9 0 1 2

CO
1

CO
2

CO
3

CO
4

CO
5

Abstract POs defined by National Board

of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and

Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

PO4 Conduct investigations of PO10 Communication

complex problems

127 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO5 Modern tool usage PO11 Project Management and

Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

End
Test1 Test2
Bloom’s Semester
(percentage (percentag
Category Examinati
) e)
on Marks

Remember 20 20 20

Understand 60 60 60

Apply 20 20 20

Analyse

Evaluate

Create

Mark distribution

Total CIE ESE ESE

Marks Marks Marks Duratio
n
150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance: 10 marks
Continuous Assessment Tests :25 marks
Continuous Assessment Assignment: 15
marks

128 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50
marks
First Internal Examination shall be preferably conducted after
completing the first half of the syllabus and the Second Internal
Examination shall be preferably conducted after completing remaining
part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions
(preferably, 2 questions each from the completed modules and 1
question from the partly covered module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the
partly covered module), each with 7 marks. Out of the 7 questions in
Part B, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions
with 2 questions from each module, having 3 marks for each question.
Students should answer all questions. Part B contains 2 questions from
each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.

129 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module -1(Introduction to HCI and Usability)

Introduction- - Components of Interaction – Ergonomics Designing
Interactive systems – Understanding Users cognition and cognitive
frameworks, User Centered approaches, Usability goals and measures,
Universal Usability-Diverse Cognitive and Perceptual abilities,
Personality differences, Cultural and International diversity, Users with
disabilities- Older Adult users and Children. Guidelines, Principles and
Theories.

Module -2 (Design Process and Interaction Styles)

HCI patterns, Design frameworks, Design methods, Prototyping.
Understanding interaction styles - Direct Manipulation and Immersive
environments, Fluid navigation -Navigation by Selection, Small
Displays, Content Organization, Expressive Human and Command
Languages-Speech Recognition, Traditional Command Languages,
Communication and Collaboration-Models of Collaboration, Design
considerations.

Module -3 (User Experience Design)

Frameworks for User Centric Computing, Computational models of
users, Advancing the User Experience- Display Design, View (Window)
Management, Animation, Webpage Design, Color. Timely user
Experience-Models of System Response Time (SRT) Impacts, Frustrating
Experiences, Information Search- Five Stage Search Framework, Data
Visualization-Tasks in Data Visualization, Challenges

Module -4 (Cognitive Systems and Evaluation of HCI)

Cognitive Models- Goal and task hierarchies, GOMS Model. Introducing
Evaluation- Types of Evaluation, Other Issues to Consider When Doing
Evaluation. Conducting Experiments. Usability testing – Heuristic

130 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

evaluation and walkthroughs, Analytics and predictive models.

Module -5 (Contexts for Designing UX)

Designing apps and websites – Website and app development, The
information architecture of apps and websites. Social media -Social
Networking, Sharing with others. Collaborative environments- Issues for
cooperative working, Technologies to support cooperative working, AI
and Interface Agents, Ubiquitous computing -Blended Spaces. Mobile
Computing – Designing for Mobiles. Wearable Computing- Smart
Materials, Material Design.

Text Book
1. Ben Shneiderman, Catherine Plaisant, Maxine Cohen, Steven Jacobs,
NiklasElmqvist“Designing the User Interface: Strategies for Effective
Human-Computer Interaction”, Sixth Edition, Pearson Education,
2017.
2. Preece, J., Sharp, H., Rogers, Y., “Interaction Design: Beyond Human-
Computer Interaction”, Fifth Edition, Wiley, 2019.
3. David Benyon, “Designing User Experience: A guide to HCI, UX and
interaction design”, 4th Edition, Pearson, 2018.
Reference Books
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human
Computer Interaction”, Third Edition, Prentice Hall, 2004.
2. The essential guide to user interface design, Wilbert O Galitz, Wiley
Dream Tech
3. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, “Research
Methods in Human-Computer Interaction”, Wiley, 2010.
4. Samit Bhattacharya, “Human-Computer Interaction: User-Centric
Computing for
Design”, McGraw-Hill India, 1st Edition, 2019.

131 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What are the general principles of user interface design?
2. How can designers encourage novice users to use a system?
3. Define user interface. List and explain the benefits of good
design.
Course Outcome 2 (CO2):
1. Design a touch screen music jukebox, which allows the user to
select from a
menu of the five most popular songs of the week. Draw a sketch
of this interface for each of the following menu types—binary
menu, multiple-item menu, check boxes, pull-down menus.
Argue which design serves the user best.
2. List several situations when command languages can be
attractive for users.
Course Outcome 3(CO3):
1. Explain how data visualization caters to the perceptual
abilities of humans.
2. Demonstrate the five stage framework in designing the
advanced search interface.
Course Outcome 4 (CO4):
1. Discuss the GOMS Model
2.Explain how Fitt’s Law predictive model has been influential in
HCI and Interaction design.
Course Outcome 5 (CO5):
3. Distinguish between GUI and Web user interface.
4. List the issues faced for cooperative working.

132 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question paper

Total Pages: 2
Reg
Name:__________________________
No.:_______________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: AMT 416
Course Name: HUMAN COMPUTER INTERACTION
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 3 marks. Marks
1 Define Principles, Standards, Guidelines and Rules. (3)
2 Explain the term Universal Usability. (3)
3 Prototyping will solve all problems associated with user (3)
interface design. Justify this statement.
4 List the three principles of direct manipulation. (3)
5 Describe frustrating experiences. (3)
6 List any three reasons for using animation in display (3)
design.
7 Explain how Fitt’s Law predictive model has been influential (3)
in HCI and Interaction design.
8 Coordination is a task concept that describes how (3)
information objects change based on user actions. Cite any
two coordination that should be supported by interface
designers.
9 Discuss any three principles of designing rich web interface. (3)
10 Summarize three guidelines for developing applications for (3)
pocket PCs.
PART B

133 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Answer any one full question from each module, each carries 14 marks.

Module I
11 a) Explain the relationship between the user experience and (7)
usability.
b) Describe user-centered design. What are its benefits? (7)
OR
12 a) Explain the difference between good and poor interaction (4)
design.
b) What is cognitive and perceptual ability? Discuss with an (10)
example cognitive perception.
Module II
13 a) Outline the various interface styles used in interactive systems. (7)
b) Discuss the obstacles to speech recognition and production. (7)
OR
14 a) Data entry is challenging for small devices. Explain the ways in (7)
which this issue can be addressed?
b) Explain the different phases involved in an interactive design (7)
process.
Module III
15 a) How do rule and heuristics help interface designers in (8)
taking account of cognitive psychology? Illustrate your
answer with the design of Microsoft Office Word.
b) Discuss three human values that are necessary to be (6)
understood by interface designers in order to ensure a timely
user experience. State any three system response time (SRT)
guidelines.
OR
16 a) Explain how data visualization caters to the perceptual abilities (9)
of humans.
b) Colour displays are attractive to users and can often improve (5)
task performance, but the danger of misuse is high. List five
guidelines for using colour and give an example of each.
134 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module IV
17 a) What is meant by design evaluation? Describe the approaches (8)
to expert analysis.
b) What is a cognitive model? Classify cognitive models and (6)
discuss the same.
OR
18 a) How are download delays masked by well-designed websites? (7)
b) Discuss the GOMS Cognitive task analysis model. (7)
Module V
19 a) List and explain the key attributes of wearable computing. (8)
b) Describe how the UCAMP framework helps designers of (6)
wearable systems to focus on the key design issues.
OR
20 a) Illustrate any two applications of agent-based interaction. (8)
b) Describe the main types of technologies that support (6)
cooperative working.
****

135 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

Topics No. of
Lecture
Hours

(36
Hours)

Module -1 (Introduction to HCI and Usability) (8 hours)

Introduction- - Components of Interaction – Ergonomics 1 hour

1.1
1.2 Designing Interactive systems – Understanding Users 1 hour
cognition and cognitive frameworks
1.3 User Centered approaches, Usability goals and measures
1 hour
1.4 Universal Usability 1 hour

1.5 Diverse Cognitive and Perceptual abilities 1 hour

1.6 Personality differences, Cultural and International diversity, 1 hour

1.7 Users with disabilities- Older Adult users and Children. 1 hour

1.8 Guidelines, Principles and Theories. 1 hour

Module -2 Design Process and Interaction Styles (6 hours)
HCI patterns, Design frameworks. Design
2.1
considerations. 1 hour
2.2 Understanding interaction styles- Direct Manipulation and 1 hour

Immersive environments,

2.3 Fluid navigation -Navigation by Selection, Small Displays,

Content Organization 1 hour

2.4 Expressive Human and Command Languages-Speech 1 hour

Recognition, Traditional Command Languages
2.5 Communication and Collaboration-Models of Collaboration 1 hour

136 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.6 Design methods, Prototyping 1 hour

Module -3 User Experience Design (7 hours)

3.1 Frameworks for User Centric Computing 1 hour

3.2 Computational models of users, 1 hour
3.3 Advancing the User Experience- Display Design, View 1 hour
(Window) Management,
3.4 Animation, Webpage Design, Color 1 hour

3.5 Timely user Experience-Models of System Response 1 hour

Time (SRT) Impacts, Frustrating Experiences.
3.6 Information Search- Five Stage Search Framework, 1 hour
3.7 Data Visualization-Tasks in Data Visualization, 1 hour
Challenges
Module -4 Cognitive Systems and Evaluation of HCI (7 hours)

Cognitive Models- Goal and task hierarchies.

4.1 1 hour
GOMS Model.
4.2 1 hour

4.3 Introducing Evaluation- Types of Evaluation 1 hour

4.4 Other Issues to Consider When Doing Evaluation. 1 hour

Conducting Experiments
4.5 1 hour
Usability testing – Heuristic evaluation and walkthroughs
4.6 1 hour
Analytics and predictive models
4.7 1 hour
Module -5 Contexts for Designing UX (8 hours)
Designing apps and websites – Website and app
5.1 1 hour
development

5.2 The information architecture of apps and websites. 1 hour

5.3 Social media -Social Networking, Sharing with others. 1 hour

5.4 Collaborative environments- Issues for cooperative working, 1 hour

Technologies to support cooperative working

137 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.5 AI and Interface Agents 1 hour

5.6 Ubiquitous computing -Blended Spaces. 1 hour

5.7 Mobile Computing – Designing for Mobiles. 1 hour

5.8 Wearable Computing- Smart Materials, Material Design. 1 hour

138 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CLIENT SERVER CATEGORY L T P CREDIT

CST426
ARCHITECTURE PEC 2 1 0 3

Preamble: The syllabus is prepared with the view of preparing the Engineering
Graduates to build effective Client/Server applications. This course aims at
providing a foundation in decentralized computer systems, using the
client/server model. The course content is decided to cover the essential
fundamentals which can be taught within the given slots in the curriculum.
Prerequisite: Computer Networks
Course Outcomes: After the completion of the course the student will be able to

Explain the basics of client/server systems and the driving force

behind the development of client/server systems (Cognitive
CO 1
Knowledge Level: Understand)

Outline the architecture and classifications of client/server

CO 2 systems (Cognitive Knowledge Level: Understand)

Choose the appropriate

CO 3 client/server network services for a typical
application
(Cognitive Knowledge Level: Understand)

Describe management services and issues in network

CO 4 (Cognitive Knowledge Level: Understand)

Compare and summarize the web extensions and choose

CO 5
appropriate web services standards for an application (Cognitive
Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO PO4 PO5 PO PO PO PO PO1 PO1 PO1

3 6 7 8 9 0 1 2

CO
1

CO
2

139 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO
3

CO
4

CO
5

Abstract POs defined by National

Board of Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and

Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct
PO4 investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and

Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment End Semester

Bloom’s Category Tests Examination

Test 1 (Marks) Test 2 Marks

(Marks)

Remember 30 30 30

Understand 70 70 50

Apply
140 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Analyse

Evaluate

Create

Mark distribution

Total CIE ESE ESE

Marks Duration
Marks Marks
150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test 1 (for theory, for 2 hrs) : 20
marks Continuous Assessment Test 2 (for lab, internal
examination, for 2hrs) : 20 marks

Internal Examination Pattern: There will be two parts; Part A and Part
B. Part A contains 5 questions with 2 questions from each module (2.5
modules x 2 = 5), having 3 marks for each question. Students should
answer all questions. Part B also contains 5 questions with 2 questions
from each module (2.5 modules x 2 = 5), o
off which a student should
answer any one. The questions should not have sub
sub- divisions and each
one carries 7 marks.

End Semester Examination Pattern: There will be two parts; Part A

and Part B. Part A contain 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all
questions. Part B contains 2 questions from each module of which a
student should answer any one. Each question can have maximum 2
sub-divisions and carry 14 marks.

141 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment

Questions

Course Outcome 1 (CO1):

1. Explain the driving forces behind the development of Client/
Server system from different perspectives.

Course Outcome 2 (CO2):

1. How two-tier computing and three-tier computing improves the
performance of Client/Server system.

Course Outcome 3(CO3):

1. Explain the role of client in Client/Server computing and also
explain the various services provided by client.
2. What is the primary motivation behind the RPC facility ? How does
a RC facility makes the job of distributed application programmers
simpler?
3. Implement RPC concept using suitable language/tool(Assignment)

Course Outcome 4 (CO4):

1. Explain Connectivity and Communication Interface Technology in
Client/Server application. How does transmission protocol work in
Client/Server application?

Course Outcome 5 (CO5):

1. Discuss the role of web browser for providing web service in
Client/Server environment.
2. Identify and explain the social relevance of web services (Assignment)

142 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module – 1 (Introduction)

Introduction to Client/Server computing - Driving forces behind Client/

Server, Client/ Server development tools, Development of client/server
systems, Client/Server security, Organizational Expectations, Improving
performance of client/server applications, Single system image,
Downsizing and Rightsizing, Advantages of client server computing,
Applications of Client/Server.

Module -2 (Client/Server Application Components)

Classification of Client/Server Systems

Systems- Two-Tier
Tier Computing, Middleware,
Three-Tier Computing
Computing- Model View Controller (MVC), Principles behind
Client/Server Systems. Client/Server Topologies. Existing Client/Server
Architecture. Architecture for Business Information System.

Module -3 (Client/Server Network)

Client- Services, Request for services, RPC, Windows services, Print

services, Remote boot services, other remote services, Utility Services.
Dynamic Data Exchange (DDE). Object Linking and Embedding (OLE).
Common Object Request Broker Architecture (CORBA).

Server- Detailed server functionality, Network operating system, Available

platforms, Server operating system.

Module -4 (Client/ Server Systems Development)

Services and Support

Support- System administration, Availability, Reliability,
Scalability, Observability, Agility, Serviceability. Software Distribution,
Performance, Network management. Remote Systems Management-
Management RDP,
Telnet, SSH, Security. LAN and Network Management issues, Training,

143 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Connectivity, Communication interface technology, Interprocess
communication, Wide area network technologies, Network Acquisition, PC-
level processing unit, X-terminals, Server hardware.

Module -5 (Client/Server Technology and Web Services)

Web Services History. Web Server Technology- Web Server, Web Server
Communication, Role of Java for Client/Server on Web. Web Services-
MicroServices, APIs, API Gateway, Authentication of users/clients,
Tokens/Keys for Authentication, Service Mesh, Message Queues, SaaS,
Web Sockets.
Client/Server/Browser – Server Technology, Client/Server Technology and
Web Applications, Balanced Computing and the Server’s Changing Role.
Thin client computing
- Computing models-Comparison-Computing Environment.

Future of client/ server Computing Enabling Technologies, Transformational

system.

Text Books

1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI

2. Dawna Travis Dewire, “Client/Server Computing”, TMH
Reference Books

1. Jeffrey D.Schank, “Novell’s Guide to Client-Server Application &

Architecture” Novell Press
2. Robert Orfali, Dan Harkey, Jeri Edwards, Client/Server Survival
Guide, Wiley- India Edition, Third Edition
3. W. H. Inman, Developing Client Server Applications, BPB

144 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST426

Course Name : Client Server

Architecture

Max. Marks : 100 Duration: 3

Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

How client/server computing environment is different from

1.
mainframe based computing environment?

2. Write short notes on single system image and downsizing.

3. Discuss the topologies of Clients/Server system with suitable examples.

4. Discuss the relevance of Clients/Server system in adopting open system

standards. Justify your answer.
5. Enumerate the services provided in a client/server system.

6. List out the features of network operating system.

7. How interposes communication is established?.

8. Write short note on x-terminals.

9. Explain the history of web services.

145 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

10 With an example, explain the role of java for client/server on web (10x3=
. 30)

Part B

(Answer any one question from each module. Each question

carries 14 Marks)

Explain the driving forces behind the development of Client/

11 (a) (10)
Server system from different perspectives.
.

(b) Explain the various Clients/Server system development tools. (4)

OR

12 Explain Client/Server System development methodology and

(a) (10)
. explain various phases and their activities involved in System
Integration Life Cycle.

(b) Write short notes on the following. (a) Single system image. (b) (4)
Downsizing and Client/Server computing.

13 (a) How two-tier computing and three-tier computing improves (10)

. the performance of Client/Server system.

(b) List out the principles behind client/server systems . (4)

OR

14 (a) Explain the architecture of Business Information System. (10)

.

(b) Explain different ways to improve performance in (4)

Client/Server developed applications.

15 (a) In Client/Server computing, explain the following with example (10)

. in detail (a)
Dynamic Data Exchange (b) RPC (c) Remote Boot Service (d)
Object- linking and embedding.

146 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the role of client in Client/Server computing and (4)

also explain the various services provide by client.

O
R

16. (a) Explain the architecture of CORBA. (10)

(b) Explain the server functionality in detail, for Client/Server (4)

computing.

17. (a) Explain Connectivity and Communication Interface (10)

Technology in Client/Server application. How does
transmission protocol work in Client/Server
application?

(b) Comment on the network service acquisition mechanism for (4)

the client/service model.

O
R

18. (a) In client server architecture, what do you mean by (10)

Availability, Reliability, Serviceability and Security? Explain
with examples

(b) How remote systems management security is ensured in a (4)

Client/Server application.

19. (a) What is the future of Client/Server computing in the following (10)
technologies
(i) Electronic Document Management. (ii) Full Text
Retrieval. (iii) Geographic Information System.

(b) Discuss the role of web browser for providing web service in (4)
Client/Server environment.

O
R

20. (a) Explain end-to-end

end working of Client/Server web model. (10)

147 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the architecture of Transformational system. (4 )

148 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Teaching Plan

Sl Conten No. of
N ts Lecture
o Hours
(35)

Module- 1( Introduction) (7 hours)

Driving forces behind Client/ Server

1.1 1
hour

1.2 Client Server development tools 1

hour

1.3 Development of client/server systems

1
hour

1.4 Client/Server security, Organizational Expectations 1

hour

1.5 Improving performance of client/server applications 1

hour

1.6 Single system image, Downsizing and Rightsizing 1

hour

1.7 Advantages and Applications of client server computing 1

hour

Module- 2(Client/Server Application Components) (8

hours)

2.1 Classification of Client/Server Systems

1
hour

2.2 Open System Standards 1

hour

2.3 Two-Tier Computing 1

hour

149 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
2.4 Three-Tier Computing, Middleware 1
hour

2.5 Principles behind Client/Server Systems 1

hour

2.6 Client/Server Topologies 1

hour

2.7 Existing Client/Server Architecture 1

hour

2.8 Architecture for Business Information System 1

hour

Module-- 3(Client/Server Network) (6 hours)

3.1 The client: Services, Request for services, RPC, Windows 1

services, Print services hour

3.2 Remote boot services, Utility Services & Other Services 1

hour

3.3 Dynamic Data Exchange (DDE), Object Linking and Embedding 1

(OLE) hour

3.4 Common Object Request Broker Architecture (CORBA) 1

hour

3.5 The server: Detailed server functionality, the network operating 1

system hour

3.6 Available platforms, the server operating system 1

hour

Module- 4( Client Server Systems Development) (7

hours)

4.1 Services and Support, System administration 1

hour

4.2 Availability, Reliability, Scalability, Observability, Agility 1

Serviceability, Software Distribution, Performance hour

4.3 Network management, Remote Systems Management, 1

RDP,Telnet,SSH hour

4.4 Security ,LAN and Network Management issues 1

hour

150 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
4.4 Training, Connectivity, Communication interface technology 1
hour

4.5 Interposes communication, wide area network technologies 1

hour

4.6 Network Acquisition, PC-level processing unit, x-terminals, 1

server hour

Hardware

Module -5(Client/Server Technology And Web

Services) (7 hours)

5.1 Web Services History , Web Server Technology , Web Server 1

hour

5.2 Web Server Communication , Role of Java for Client/Server on 1

Web hour

5.3 Web Services , MicroServices, APIs, API Gateway, 1

Authentication of users/clients hour

5.4 Tokens/Keys for Authentication ,Service Mesh, Message Queues 1

hour

5.5 SaaS, Web Sockets ,Client/Server Technology and Web

Applications 1
hour

5.6 Balanced Computing and the Server’s Changing Role ,Thin 1

client computing , Computing models, Computing Environment hour

5.7 Future of client/ server Computing Enabling Technologies,

Transformational system 1
hour

151 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PARALLEL CATEGORY L T P CREDIT

CST436
COMPUTING
Program 2 1 0 3
Elective IV

Preamble: This course helps the learners to understand basic and advanced
concepts of parallel computing. It covers Principles of Parallel Algorithm Design,
Communication operations, Programming Using the Message Passing Paradigm,
Programming Shared Address Space Platforms Thread Basics, and GPU
Programming. This course enables a learner to design solutions to complex real
world problems using parallel computing paradigms including thread
parallelism, shared memory program, message passing interfaces, and vector
processing.
Prerequisite: Knowledge in Computer Organization and Architecture.
Course Outcomes: After the completion of the course the students will be able to

CO1 Summarize the key parallel computational models (Cognitive

Knowledge Level
: Understand)

CO2 Appreciate and apply parallel and distributed algorithms in problem

Solving (Cognitive Knowledge Level :Apply)

CO3 Appreciate the communication models for parallel algorithm

Cognitive Knowledge Level : Understand)
development (Cognitive Understand

CO4 Develop parallel algorithms using message passing paradigm

(Cognitive Knowledge Level : Apply)

CO5 Formulate parallel algorithms for shared memory

architectures. (Cognitive Knowledge Level : Apply)

CO6 Demonstrate the fundamental skills of heterogeneous computing with

(Cognitive Knowledge Level : Apply)
GPUs(Cognitive

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
0 1 2

152 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs Defined by National Board of

Accreditation

PO# Broad PO# Broad

PO PO

PO1 Engineering Knowledge PO7 Environment and

Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and teamwork

solutions

Conduct
PO4 PO10 Communication
investigations of
complex problems

PO5 Modern tool usage PO11 Project Management and

Finance

153 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Blooms Continuous Assessment End

Category Tests Semester
Examination
Marks

Test 1 Test 2
(Percentage) (Percentage)

Rememb 30 20 2
er 0

Understa 5 4 4
nd 0 0 0

Apply 20 40 4
0

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3 Hours

154 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests 25 marks
Continuous Assessment Assignment 15 marks
Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First Internal Examination shall be preferably conducted after completing the
first half of the syllabus, and the Second Internal Examination shall be
preferably conducted after completing the remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly
covered module), having 3 marks for each question adding up to 15 marks for
part A. Students should answer all questions from Part A. Part B contains 7
questions (preferably, 3 questions each from the completed modules and 1
question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.
End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of
which a student should answer anyone. Each question can have a maximum 2
subdivisions and carries 14 marks.

155 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

Module- 1 (Principles of Parallel Algorithm Design)

Basic Introduction to Parallel Processing platforms. Preliminaries,
Decomposition Techniques, Characteristics of Tasks and Interactions, Mapping
Techniques for Load Balancing, Methods for Containing Interaction Overheads,
Parallel Algorithm Models.
Module- 2 (Communication Operations)
Basic Communication Operations - One-to-All All
All Broadcast and All-to-One
Reduction, All-to-All Broadcast and Reduction, All Reduce and Prefix-Sum
All-Reduce Prefix
Operations, Scatter and Gather, All-to-All
All Personalized Communication,
Circular Shift, Improving the Speed of Some Communication Operation
Module-3 (Programming Using the Message Passing Paradigm)
Principles of Message--Passing Programming, The Building Blocks: Send and
Receive Operations, MPI: The Message Passing Interface, Overlapping
Communication with Computation, Collective Communication and
Computation Operations, Groups and Communicators.
Module 4 (Programming Shared Address Space Platforms Thread Basics)
pplication Programme
Thread Basics, Why Threads? The POSIX Thread Application
Interface, Synchronization Primitives in POSIX, Controlling Thread and
Synchronization Attributes, Thread Cancellation, Composite Synchronization
Constructs, OpenMP: a Standard for Directive Based Parallel Programming,
Specifying Concurrent Tasks in OpenMP, Synchronization Constructs in
OpenMP, Data Handling in OpenMP, OpenMP Library Functions, OpenMP
Applications: Parallel algorithm development for Matrix multiplication
Module 5 (GPU Programming)

Heterogeneous Parallel Computing, Architecture of a Modern GPU, Speeding up

Real Applications, Data parallel computing, CUDA C Program Structure, A
Vector Addition Kernel, Device Global Memory and Data Transfer, Kernel
Functions and Threading, Kernel Launch, CUDA Thread Organization, Mapping
Mappi
Threads to Multidimensional Data, Synchronization and Transparent
Scalability, Resource Assignment, Querying Device Properties, Thread
Scheduling and Latency Tolerance, Importance of Memory Access Efficiency,
156 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Cuda Memory Types, Tiling for Reduced Memory Traffic, Tiled Matrix
Multiplication Kernel, Boundary Checks

Text Books

1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar,

Introduction to Parallel Computing, 2nd Ed, Addison-Wesley,
Addison 2003

2. David B. Kirk, Wen-mei

Wen W. Hwu, Programming Massively Parallel
Processors: A Hands-on
Hands Approach, 3rd Ed., Morgan Kaufman, 2016.

References

1. Steven Brawer, Introduction to Parallel Computing, Academic Press, (1989)

2. Barbara Chapman, Gabriele Jost, Ruud van der Pas, Using

OpenMP: Portable Shared Memory Paralwlel Programming , MIT Press,
2008.

3. William Gropp, Ewing Lusk, Anthony Skjellum Using MPI:

Passing Interface, 3rd Ed,
Portable Parallel Programming with the Message-Passing
MIT Press, 2014.

4. Thomas Rauber, Gudula Rünger, Parallel Programming for Multicore

and Cluster Systems, Springer, 2010

157 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Differentiate between static and dynamic task mapping

2. Explain partitioning of data with an example

Course Outcome 2 (CO2):

Buffered
1. Explain the handshaking sequence of Blocking Non-Buffered
Send/Receive operation with a neat diagram.
2. In the algorithm, assume a decomposition such that each execution of
Line 7 is a task. Draw a task-dependency graph and a task-interaction
graph.
1. procedure FFT_like_pattern(A, n)
2. begin
3. m := log2 n;
4. for j := 0 to m - 1 do
5. k := 2j;
6. for i := 0 to n - 1 do
7. A[i] := A[i] + A[i XOR 2j];
8. end // for

9. end // FFT_like_pattern

Course Outcome 3 (CO3):

1. Write a procedure for performing all-to-all reduction on a mesh

2. Give a hypercube algorithm to compute prefix sums of n numbers if p is
the number of nodes and n/p is an integer greater than 1. Assuming that
it takes time tadd to add two numbers and time ts to send a message of
unit length between two directly-connected
directly nodes, give an exact
expression for the total time taken by the algorithm.

Course Outcome 4(CO4):

1. Show how the two vector multiplication program

two-dimensional matrix-vector
158 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

needs to be changed so that it will work correctly for a matrix of size n x m

on a q x r process grid

2. One of the advantages of non-blocking communication operations is that

they allow the transmission of the data to be done concurrently with
computations. Discuss the type of restructuring that needs to be
performed on a program to allow for the maximal overlap of computation
with communication. Is the sending process in a better position to benefit
from this overlap than the receiving process

Course Outcome 5(CO5):

1. Implement a multi-access threaded queue with multiple threads inserting

and multiple threads extracting from the queue. Use mutex-locks to
synchronize access to the queue. Document the time for 1000 insertions
and 1000 extractions each by 64 insertion threads (producers) and 64
extraction threads (consumers).

2. Implement a producer-consumer framework in OpenMP using sections to

create a single producer task and a single consumer task. Ensure
appropriate synchronization using locks.

Course Outcome 6 (CO6):

1. Consider a hypothetical block with 8 threads executing a section of code

before reaching a barrier. The threads require the following amount of
time (in microseconds) to execute the sections: 2.0, 2.3, 3.0, 2.8, 2.4, 1.9,
2.6, and 2.9 and to spend the rest of their time waiting for the barrier.
What percentage of the total execution time of the thread is spent waiting
for the barrier?

2. Write and explain the CUDA program for vector addition.

159 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE: PAGES :3

Reg No:
Name:
APJ ABDUL KALAM TECHNOLOGICAL
UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH &

YEAR

Course Code: CST436

Course Name: PARALLEL COMPUTING

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Explain partitioning of data with an example

2. Which are the characteristics of tasks influencing the selection of mapping

scheme?

3. Describe the scatter - gather communication.

4. Explain the Circular Shift operation.

5. Explain the handshaking sequence of Blocking Non Buffered

Non-Buffered
Send/Receive operation with a neat diagram.

6. Describe the six fundamental routines of MPI.

160 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

7. Explain thread cancellation.

8. Explain how concurrent tasks are specified in openMP

9. Explain the architecture of modern GPU with a diagram.

10 Describe how the data transfer between GPU device and the (10x3=
. host memories are managed. 30)

Part B

(Answer any one question from each module. Each

question carries 14 Marks)
(8)
11 (a)
Describe recursive decomposition with an example.
.
Compare various parallel algorithm models (6)
(b)

OR

Differentiate between static and dynamic task mapping (8)

12 (a)

(6)
(b) In the algorithm, assume a decomposition such that each
execution of Line 7 is a task. Draw a task-dependency graph
and a task-interaction graph.
procedure FFT_like_pattern(A, n)
begin
m := log2 n;
for j := 0 to m
- 1 do5. k := j;
for i := 0 to n - 1 do
A[i] := A[i] + A[i XOR 2j];

161 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

end // for
end // FFT_like_pattern

Illustrate the All-to-All Broadcast and Reduction with an (6)

13 (a)
example

Explain any three techniques to improve the speed of (8)

(b)
communication operations

OR

Explain the One-to-All Broadcast and All-to-One Reduction (8)

14 (a)
with an example

Explain the Ring and Mesh techniques of All-to-All Personalized (6)

(b)
communication
Explain Collective Communication and Computation (9)
15 (a)
Operations in MPI
Show the impact of finite buffers in message passing. (5)
(b)

OR

Write algorithm for Collective Communication and (9)

16 (a)
Computation Operations using MPI.

How is deadlock avoided in MPI_Send and MPI_Recv (5)

(b)

17. (a) Explain how mutual exclusion for shared variables are (6)
accomplished in threads.

(b) Explain the nesting of parallel directives with a suitable example. (8)

162 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

18. (a) Explain the compilation operations of an example openMP (4)

program along with its pThread translations.

(b) Explain the parallel matrix multiplication using openMP (10

)

19. (a) (6)

Describe the CUDA Kernel functions.

(b) (8)
How is synchronization between CUDA threads achieved?

O
R

20. (a) Explain the two-level hierarchical organization of CUDA threads. (10
)

(b) Write and explain the CUDA program for vector addition. (4 )

163 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN

No Cont No
ents of
Lectur
e Hrs
(37)

Module – 1 (Basic Introduction to Parallel Processing ) (TB-1, Ch. 3)

(7 hrs)

1.1 Basic Introduction to Parallel Processing platforms. 1

Preliminaries

1.2 Decomposition Techniques – Recursive, Data 1

1.3 Decomposition Techniques – Exploratory, Speculative, Hybrid 1

1.4 Characteristics of Tasks and Interactions 1

1.5 Mapping Techniques for Load Balancing -Static 1

1.6 Mapping Techniques for Load Balancing - Dynamic 1

1.7 Methods for Containing Interaction Overheads, Parallel 1

Algorithm Models.

Module- 2 (Basic Communication Operations ) (TB-1,

Ch. 4) (6hrs)

2.1 One-to-All Broadcast and All-to-One Reduction 1

2.2 All-to-All Broadcast and Reduction 1

2.3 All-Reduce and Prefix-Sum Operations, Scallter Gather 1

2.4 All-to-All Personalized Communication 1

2.5 Circular Shift 1

2.6 Improving the Speed of Some Communication Operation 1

164 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module- 3 ( Programming Using the Message Passing Paradigm) (TB-1, Ch.

6 ) (7 hrs)

Principles of Message-Passing Programming, The Building

3.1 1
Blocks: Send and Receive Operations

3.2 MPI: The Message Passing Interface 1

3.3 MPI: The Message Passing Interface : Illustration 1

3.4 Overlapping Communication with Computation 1

3.5 Overlapping Communication with Computation : Illustration 1

3.6 Collective Communication and Computation Operations 1

3.7 Collective Communication and Computation Operations : 1

Illustration

Module 4 (Programming Shared Address Space Platforms) (TB-1, Ch. 7, 8 )

(8hrs)

4.1 Thread Basics, Why Threads? The POSIX Thread API 1

4.2 Synchronization Primitives in POSIX 1

4.3 Controlling Thread and Synchronization Attributes 1

4.4 Thread Cancellation, Composite Synchronization Constructs, 1

4.5 OpenMP: a Standard for Directive 1

Based Parallel Programming

4.6 Specifying Concurrent Tasks in OpenMP, Synchronization 1

Constructs in OpenMP

4.7 Data Handling in OpenMP, OpenMP Library Functions 1

4.8 OpenMP Applications: Parallel algorithm development for 1

Matrix multiplication

Module 5 (GPU Programming) (TB-2, Ch. 1, 2 ) (9 hrs)

165 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5.1 Heterogeneous Parallel Computing, Architecture of a Modern 1

GPU, Speeding up Real Applications

5.2 Data parallel computing – CUDA C Program Structure 1

5.3 Vector Addition Kernel, Device Global Memory and Data 1

Transfer

5.4 Kernel Functions and Threading, Kernel Launch 1

5.5 CUDA Thread Organization, Mapping Threads to 1

Multidimensional Data

5.6 Synchronization and Transparent 1

Scalability, Resource Assignment,
Querying Device Properties, Thread Scheduling and Latency
Tolerance

5.7 Importance of Memory Access Efficiency, Cuda Memory Types 1

5.8 Tiling for Reduced Memory Traffic 1

5.9 Tiled Matrix Multiplication Kernel, Boundary Checks 1

166 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

DATA COMPRESSION CATEGORY L T P CREDIT

CST446
TECHNIQUES Program 2 1 0 3
Elective IV

Preamble:: This course helps the learners to understand compression

techniques on text, image, audio and video data. It covers lossy &lossless
compression, RLE, JPEG, MPEG and its variants. This course enables the
students to develop and implement compression algorithms on different
domains.
Prerequisite: Knowledge of probability theory, computation on matrices,
basic topics in data structures, storage and efficiency
Course Outcomes: After the completion of the course the student will be able to

CO# CO
Describe the fundamental principles of data
CO1 (Cognitive Knowledge level: Understand)
compression(Cognitive
Make use of statistical and dictionary based compression
CO2 techniques for various applications (Cognitive Knowledge level:
Apply)
Illustrate various image compression standards. (Cognitive
CO3 Knowledge level: Apply)
Summarize video compression mechanisms to reduce the
CO4 redundancy in video.(Cognitive Knowledge level:
Understand)
Use the fundamental properties of digital audio to
CO5 compress audio data.(Cognitive Knowledge level:
Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
0 1 2
CO1
CO2

CO3
CO4

167 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO# Broad

PO PO

PO Engineering Knowledge PO7 Environment and Sustainability

1

PO Problem Analysis PO8 Ethics

2

PO Design/Development of PO9 Individual and team work

3 solutions
Conduct investigations of
PO complex problems PO1 Communication
4 0

PO Modern tool usage PO1 Project Management and Finance

5 1

PO The Engineer and Society PO1 Life long learning

6 2

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Test Test 2 Marks (%)
1 (%) (%)
Remember 30 30 3
0
Understand 40 40 40
Apply 3 3 30
0 0
Analyze
Evaluate
Create

168 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), havi
having
3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed modules and 1 question from
the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any5.
End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each
module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

169 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module-1 (Modelling and types of compression)) 1

Introduction to Compression Techniques- Lossy compression & Lossless
compression, Measures of Performance, Modeling and coding. Mathematical
modelling for Lossless and lossy compression
- Physical models and probability models.

Module – 2 (Basic Compression Methods)

Basic Compression Technique
Technique- Run length encoding, RLE Text compression.
Statistical Methods- Prefix Codes, Binary Huffman coding, non-binary
non Huffman
Algorithms, Arithmetic Coding.

Module - 3 (Text & Image Compression)

Dictionary based Coding- LZ77, LZ78 and LZW compression.Image Compression-
Image standards, JPEG image Compression- Baseline JPEG, JPEG-LS.
JPEG

Module - 4 (Video Compression)

Video Compression- Analog video, Digital Video, Motion Compensation. MPEG
standards- MPEG 1, MPEG 4

Module - 5 (Audio Compression)

Audio Compression- Basics of Digital Audio, Basic Audio Compression
Techniques, MPEG Audio Compression
Compression-Layer 1 coding, Layer 2 coding and Layer
3 coding.

Text Book

1. David Solomon, Data compression: the complete reference, 4/e, Springer,

January 2007

2. Khalid Sayood, Introduction to data compression, Morgan Kaufmann

Publishers,2003.

References
1) Stephen Welstead, Fractal and wavelet Image Compression techniques, PHI,
1999.
2) Sleinreitz, Multimedia System, Addison Wesley.
3) Mark Nelson and Jean
Jean-loup Gailly, The Data Compression Book, M&T Books.

170 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment

Questions

Course Outcome 1 (CO1):

1. Discuss different types of compression performance metrics

2. Explain mathematical model for lossless compression
Course Outcome 2 (CO2):
1. Explain RLE based text compression and identify a example with compression
ratio of 2.
2. Given the eight symbols A, B, C, D, E, F, G, and H with probabilities
1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30, and 12/30, draw three
different Huffman trees with heights 5 and 6 for these symbols and
calculate the average code size for each tree.
Course Outcome 3 (CO3):
1. Differentiate the LZ77 and LZ78 performance with the
input given as ‘sirsideastmaneasilyteasesseasickseals’
2. Explain why the continuous-tone images is required for JPEG and the
main steps used in image compression.
Course Outcome 4 (CO4):
1. Briefly explain MPEG-4 video compression standard
2. How H.261 video compression is completed.
Course Outcome 5 (CO5):
1. Explain critical bands, thresholding and masking related to audio
compression
2. Explain the working of -law encoder and decoder with an example

171 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST446

Course Name: Data Compression

Techniques

Max.Marks:100 Duration: 3
Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Specify different quantities used to measure the

performance of a data compression technique

2. Explain mathematical model for lossless compression

3. State and prove Kraft-McMillan

McMillan inequality

4. Compare Huffman and Arithmetic coding

5. Describe LZ77 approach of encoding a string with the help of an example

6. Compare and contrast JPEG and JPEG-LS differences in working.

7. Discuss different components of video

8. Identify the advantage of MPEG

MPEG-4 over MPEG

9. Explain critical bands, thresholding and masking related to audio compression

10 Explain the working of --law encoder and decoder with an example

.
(10x3=30)

172 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B

(Answer any one question from each module. Each question

carries 14 Marks)

11. (a) Explain mathematical model for lossy compression and lossless (10)
compression

(b) Define compression ratio with an example (4)

OR

12. (a) Discuss any probability model and identify the shortcoming of the (7)
solution.

(b) Identify the mathematical preliminaries for Lossless Compression (7)

13. (a) With a help of flowchart discuss the RLE text compression for (10)
text data given below
‘ABBBBBBBBBCDEEEEF’
ABBBBBBBBBCDEEEEF’

(b) calculate the compression ratio for the example while taking (4)
repetitions = 4

OR

14. (a) Illustrate with a example why Huffman coding is preferred (10)
than Shannon Fano Algorithm for compression

(b) How Huffman coding is handling the unpredictability of input (4)

data stream

15. (a) Explain in detail the working of LZ78 with example and dictionary (10)
Tree

(b) Illustrate with example, how the compression factor LZW (4)
differ from the LZ78

OR

16. (a) How quantization and coding helps in compression and their role (6)
in JPEG.

(b) With the help of the given example illustrate the compression (8)
ratio of JPEG and JPEG
JPEG-LS

173 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. (a) With the help of equations discuss Composite and Components (7)
Video

(b) Differentiate the major changes in MPEG - 2 and MPEG-4 Video (7)

OR

18. (a) Describe in details about functionalities for MPEG-4 (8)

(b) How Motion Compensation help in video compression (6)

19. (a) How The Human Auditory System limitations can be taken in (7)
audio
compressions

(b) Discuss the complexity of Layer III compared to others in (7)

MPEG Audio Coding

OR

20 (a) Discuss Format of Compressed Data and encoding in layer I (9)

. and II

(b) Differentiate Spectral and Temporal Masking (5)

174 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN

No CONTE No of
NTS Lectur
e Hrs
(36
Hours
)

Module – 1 (Modelling and types of

compression) (7 hrs)

1.1 Introduction to Compression Techniques- Lossy 2

compression & Lossless compression, Measures of
Performance

1.2 Modelling and coding. 1

1.3 Physical model for lossless compression 1

1.4 Physical model for lossy compression 1

1.5 Probability model for lossless compression 1

1.6 Probability model for lossly compression 1

Module - 2 (Basic Compression Methods) (8

hrs)

2.1 Run length encoding, RLE Text compression 1

2.2 Statistical methods-Prefix Codes 1

2.3 Binary Huffman coding 1

2.4 Illustration of Binary Huffman coding 1

2.5 Non-binary Huffman Algorithms 1

2.6 Arithmetic Coding algorithm 1

2.7 Illustration of Arithmetic Coding algorithm 2

Module - 3 (Text & Image Compression) (8 hrs)

3.1 LZ77 compression 2

175 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.2 LZ78 Compression 1

3.3 LZW Compression 1

3.4 Basics of Image compression and Image standards 1

3.5 Baseline JPEG Image compression 1

3.6 JPEG-LS Image compression 1

Module - 4 (Video Compression) (7 hrs)

4.1 Basics of Video Compression- Analog video and Digital Video. 2

4.2 Motion Compensation 1

4.3 MPEG-1 standard and Video Syntax 1

4.4 MPEG-1 Pel Reconstruction 1

4.5 MPEG-4 standard 1

4.6 Functionalities for MPEG-4 1

Module - 5 (Audio Compression) ( 6 hrs)

5.1 Basics of Audio Compression, Digital Audio 1

5.2 Basic Audio Compression Techniques 1

5.3 MPEG Audio Compression basics- Frequency Domain Coding 1

5.4 Encoding: Layers I and II 1

5.5 Encoding: Layer II -Psychoacoustic Models 1

5.6 Psychoacoustic Models - Encoding: Layer III 1

176 | P a g e
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST466 DATA MINING
PEC 2 1 0 3 2019

Preamble: This course helps the learner to understand the concepts of data mining and data
warehousing. It covers the key processes of data mining, data preprocessing techniques,
fundamentals and advanced concepts of classification, clustering, association rule mining, web
mining and text mining. It enables the learners to develop new data mining algorithms and apply
the existing algorithms in real-world scenarios.
Prerequisite: NIL

Course Outcomes: After the completion of the course the student will be able to

CO# CO

CO1 Employ the key process of data mining and data warehousing concepts in application
domains. (Cognitive Knowledge Level: Understand)

CO2 Make use of appropriate preprocessing techniques to convert raw data into suitable
format for practical data mining tasks (Cognitive Knowledge Level: Apply)

CO3 Illustrate the use of classification and clustering algorithms in various application
domains (Cognitive Knowledge Level: Apply)

CO4 Comprehend the use of association rule mining techniques. (Cognitive Knowledge
Level: Apply)

CO5 Explain advanced data mining concepts and their applications in emerging domains
(Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
1 0 2

CO1

CO2

CO3

192
 BCOMPUTER SCIENCE
TECH IN ARTIFICIAL AND ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

CO4

CO5

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 20 20 20

Understand 30 30 30

Apply 50 50 50

Analyze

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

193
 BCOMPUTER SCIENCE
TECH IN ARTIFICIAL AND ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Test(Average of Internal Test1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the seven questions, a student
should answer any five.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have a maximum 2 subdivisions and carries 14 marks.

Syllabus
Module – 1 (Introduction to Data Mining and Data Warehousing)
Data warehouse-Differences between Operational Database Systems and Data Warehouses,
Multidimensional data model- Warehouse schema, OLAP Operations, Data Warehouse
Architecture, Data Warehousing to Data Mining, Data Mining Concepts and Applications,
Knowledge Discovery in Database Vs Data mining, Architecture of typical data mining system,
Data Mining Functionalities, Data Mining Issues.

Module - 2 (Data Preprocessing)

Data Preprocessing-Need of data preprocessing, Data Cleaning- Missing values, Noisy data, Data
Integration and Transformation, Data Reduction-Data cube aggregation, Attribute subset selection,
Dimensionality reduction, Numerosity reduction, Discretization and concept hierarchy generation.

194
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Module - 3 (Advanced classification and Cluster analysis)

Classification- Introduction, Decision tree construction principle, Splitting indices -Information
Gain, Gini indexDecision tree construction algorithms-ID3, Decision tree construction with
presorting-SLIQ, Classification Accuracy-Precision, Recall.
Introduction to clustering-Clustering Paradigms, Partitioning Algorithm- PAM, Hierarchical
Clustering-DBSCAN, Categorical Clustering-ROCK

Module 4: (Association Rule Analysis)

Association Rules-Introduction, Methods to discover Association rules, Apriori(Level-wise
algorithm), Partition Algorithm, Pincer Search Algorithm, Dynamic Itemset Counting Algorithm,
FP-tree Growth Algorithm.

Module 5 (Advanced Data Mining Techniques)

Web Mining - Web Content Mining, Web Structure Mining- Page Rank, Clever, Web Usage
Mining- Preprocessing, Data structures, Pattern Discovery, Pattern Analysis. Text Mining-Text
Data Analysis and information Retrieval, Basic measures for Text retrieval, Text Retrieval
methods, Text Indexing Techniques, Query Processing Techniques.

Text Books

1. Dunham M H, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New
Delhi, 2003.
2. Arun K Pujari, “Data Mining Techniques”, Universities Press Private Limited,2008.
3. Jaiwei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Elsevier,
2006
Reference Books

1. M Sudeep Elayidom, “Data Mining and Warehousing”, 1st Edition, 2015, Cengage
Learning India Pvt. Ltd.
2. MehmedKantardzic, “Data Mining Concepts, Methods and Algorithms”, John Wiley and
Sons, USA, 2003.
3. Pang-Ning Tan and Michael Steinbach, “Introduction to Data Mining”, Addison Wesley,
2006.

195
 B COMPUTER SCIENCE
TECH IN ARTIFICIAL AND ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. (a) Explain the OLAP operations in a multidimensional model.

(b) Compare the techniques used in ROLAP, MOLAP and HOLAP
2. Explain the various data mining issues with respect to mining methodology, user
interaction and diversity of data types.
3. Suppose that a data warehouse consists of the three dimensions time, doctor, and patient,
and the two measures count and charge, where charge is the fee that a doctor charges a
patient for a visit.
a) Draw star and snowflake schema diagrams for the data warehouse.
b) Starting with the base cuboid [day; doctor; patient], what specific OLAP operations
should be performed in order to list the total fee collected by each doctor in 2004?

Course Outcome 2 (CO2):

1. Use the methods below to normalize the following group of data:100, 200, 300, 400,550,
600, 680, 850, 1000
(a) min-max normalization by setting min = 0 and max = 1
(b) z-score normalization
(c) Normalization by decimal scaling
Comment on which method you would prefer to use for the given data, givingreasons as to
why.
2. Identify a suitable dataset from any available resources and apply different preprocessing
steps that you have learned. Observe and analyze the output obtained. (Assignment)

Course Outcome 3 (CO3):

1. Illustrate the working of ID3 algorithm with the following example

2. Illustrate the working of K medoid algorithm for the given dataset. A1=(3,9), A2=(2,5),
A3=(8,4), A4=(5,8), A5=(7,5), A6=(6,4), A7=(1,2), A8=(4,9).

196
 COMPUTER SCIENCE INTELLIGENCE
B TECH IN ARTIFICIAL AND ENGINEERING
AND MACHINE
LEARNING

3. Take a suitable dataset from available resources and apply all the classification and clustering
algorithms that you have studied on original and preprocessed datasets. Analyze the
performance variation in terms of different quality metrics. Give a detailed report based on
the analysis. (Assignment)

Course Outcome 4 (CO4):

1. A database has five transactions. Let min sup = 60% and min con f = 80%.

a) Find all frequent item sets using Apriori and FP-growth, respectively. Compare the
efficiency of the two mining processes.
b) List all of the strong association rules (with support s and confidence c) matching the
following metarule, where X is a variable representing customers, and𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖 denotes
variables representing items (e.g., “A”, “B”, etc.)
∀𝑥𝑥 ∈ 𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡, 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖1 ) ∧ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖2 ) ⇒ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 (𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖3 ) [𝑠𝑠, 𝑐𝑐]

2. Identify and list some scenarios in which association rule mining can be used, and then use at
least two appropriate association rule mining techniques in one of the two scenarios.
(Assignment)

Course Outcome 5 (CO5):

1. Consider an e-mail database that stores a large number of electronic mail (e-mail)
messages. It can be viewed as a semi structured database consisting mainly of text data.
Discuss the following.
a. How can such an e-mail database be structured so as to facilitate multidimensional
search, such as by sender, by receiver, by subject, and by time?
b. What can be mined from such an e-mail database?
c. Suppose you have roughly classified a set of your previous e-mail messages as junk,
unimportant, normal, or important. Describe how a data mining system may take this
as the training set to automatically classify new e-mail messages or unclassified ones.
2. Precision and recall are two essential quality measures of an information retrieval system.
(a) Explain why it is the usual practice to trade one measure for the other.
(b) Explain why the F-score is a good measure for this purpose.

197
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

(c) Illustrate the methods that may effectively improve the F-score in an information
retrieval system.
3. Explain HITS algorithm with an example.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST466

Course Name: Data Mining

Max.Marks:100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate between OLTP and OLAP.

2. Compare the techniques of ROLAP, MOLAP and HOLAP

3. Explain Concept hierarchy with an example.

4. Explain heuristic methods of attribute subset selection techniques.

5. Consider a two-class classification problem of predicting whether a photograph

contains a man or a woman. Suppose we have a test dataset of 10 records with
expected outcomes and a set of predictions from our classification algorithm.

198
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

Calculate precision, recall of the data.

6. Given two objects represented by the tuples (22,1,42,10) and (20,0, 36,8).
Compute the Euclideanand Manhattan distance between the two objects.

7. The pincer search algorithm is a bi-directional search, whereas the level wise
algorithm is a unidirectional search. Express your opinion about the statement.

8. Define support, confidence and frequent set in association data mining context.

9. Distinguish between focused crawling and regular crawling.

10. Describe any two-text retrieval indexing techniques. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Suppose a data warehouse consists of three measures: customer, account (7)
and branch and two measures count (number of customers in the branch)
and balance. Draw the schema diagram using snowflake schema and star
schema.

(b) Explain three- tier data warehouse architecture with a neat diagram. (7)

OR

12 (a) Illustrate different OLAP operations in multidimensional data model (7)

(b) Describe different issues in data mining (7)

13 (a) Suppose that the data for analysis includes the attribute age. The age values (8)
for the data tuples are (in increasing order) 13, 15, 16, 16, 19, 20, 20, 21, 22,
22, 25, 25, 25, 25, 30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70.
(a) Use min-max normalization to transform the value 35 for age onto

199
 COMPUTER SCIENCE INTELLIGENCE
B TECH IN ARTIFICIAL AND ENGINEERING
AND MACHINE
LEARNING

the
range [0-1].
(b) Use z-score normalization to transform the value 35 for age, where
the standard deviation of age is 12.94 years.
(c) Use normalization by decimal scaling to transform the value 35 for
age.
(d) Use smoothing by bin means to smooth the above data, using a bin
depth of 3. Illustrate your steps. Comment on the effect of this
technique for the given data.

(b) With proper illustration, explain how PCA can be used for dimensionality (6)
reduction? Explain

OR

14 (a) Suppose a group of 12 sales price records has been sorted as follows: 5, 10, (8)
11, 13, 15, 35, 50, 55, 72, 92, 204, 215. Sketch examples of each of the
following sampling techniques: SRSWOR, SRSWR, cluster sampling,
stratified sampling. Use samples of size 5 and the strata “youth,” “middle-
aged,” and “senior.”
(b) Partition the above data into three bins by each of the following methods: (6)
(i) equal-frequency (equi-depth) partitioning
(ii) equal-width partitioning

15 (a) Explain the concept of a cluster as used in ROCK. Illustrate with examples (9)

(b) Consider the following dataset for a binary classification problem. (5)

A B Class
Label
T F +
T T +
T T +
T F -
T T +
F F -
F F -
F F -
T T -
T F -
Calculate the gain in Gini index when splitting on A and B respectively.
Which attribute would the decision tree induction algorithm choose?

200
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

OR

16 (a) For a sunburn dataset given below, find the first splitting attribute for the (10)
decision tree by using the ID3 algorithm.

Name Hair Height Weight Lotion Class

Sarah Blonde Average Light No Sunburn
Dana Blonde Tall Average Yes None
Alex Brown Tall Average Yes None
Annie Blonde Short Average No Sunburn
Emily Red Average Heavy No Sunburn
Pete Brown Tall Heavy No None
John Brown Average Heavy No None
Katie Blonde Short Light Yes None

(b) Explain the working of SLIQ algorithm. (4)

17 (a) Illustrate the working of Pincer Search Algorithm with an example. (7)

(b) Describe the working of dynamic itemset counting technique? Specify when (7)
to move an itemset from dashed structures to solid structures?

OR

18 (a) A database has six transactions. Let min_sup be 60% and min_conf be (9)
80%.

TID items_bought

T1 I1, I2, I3

T2 I2, I3, I4

T3 I4, I5

T4 I1, I2, I4

T5 I1, I2, I3, I5

T6 I1, I2, I3, I4

Find frequent itemsets using FP Growth algorithm and generate strong

association rules from a three item dataset.

(b) Write partitioning algorithm for finding large itemset and compare its (5)
efficiency with apriori algorithm

201
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

19 (a) Describe web content mining techniques. (7)

(b) Write an algorithm to find maximal frequent forward sequences to mine log (7)
traversal patterns. Illustrate the working of this algorithm.

OR

20 (a) Explain how web structure mining is different from web usage mining and (7)
web content mining? Write a CLEVER algorithm for web structure mining.
(b) Describe different Text retrieval methods. Explain the relationship between (7)
text mining and information retrieval and information extraction.

Teaching Plan

No. of
No Contents lecture
hours
(36
Hrs)

Module 1(Introduction to Data Mining and Data Warehousing) (Text3) (6 hours)

1.1 Data warehouse-Differences between Operational Database Systems and

Data Warehouses, Multidimensional data model- Warehouse schema 1

1.2 OLAP Operations 1

1.3 DataWarehouse Architecture, Data Warehousing to Data Mining 1

1.4 Datamining Concepts and Applications, Knowledge Discovery in Database 1

Vs Data mining

1.5 Architecture of typical data mining system,Data Mining Functionalities 1

1.6 Data Mining Functionalities, Data Mining Issues 1

Module 2(Data Preprocessing) (6 hours) (Text3)

2.1 Data Preprocessing: Need of Data Preprocessing, Data Cleaning- Missing 1

values, Noisy data.

2.2 Data integration 1

2.3 Data transformation 1

2.4 Data Reduction-Data cube aggregation, Attribute subset selection 1

2.5 Data Reduction-Dimensionality reduction 1

202
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

2.6 Numerosity reduction, Discretization and concept hierarchy generation 1

Module 3(Advanced classification and Cluster analysis)(9 hours)(Text2,Text3)

3.1 Classification- Introduction, Decision tree construction principle, Splitting 1

indices-Information Gain, Gini index

3.2 Decision Tree- ID3 1

3.3 Decision Tree- ID3 1

3.4 Decision tree construction with presorting- SLIQ 1

3.5 Accuracy and error measures, evaluation 1

3.6 Introduction to clustering, Clustering Paradigms 1

3.7 Partitioning Algorithm- PAM 1

3.8 Hierarchical Clustering-DBSCAN 1

3.9 Categorical Clustering-ROCK 1

Module 4(Association Rule Analysis) (8 hours) (Text2,Text3,Text1)

4.1 Association Rules: Introduction, Methods to discover association rules 1

4.2 A priori algorithm (Level-wise algorithm) 1

4.3 A priori algorithm (Level-wise algorithm) 1

4.4 Partition Algorithm 1

4.5 Pincer Search Algorithm 1

4.6 Pincer Search Algorithm 1

4.7 Dynamic Itemset Counting Algorithm 1

4.8 FP-tree Growth Algorithm 1

Module 5(Advanced Data Mining Techniques) (7 hours) (Text1, Text3

5.1 Web Mining - Web Content Mining 1

5.2 Web Structure Mining- Page Rank 1

5.3 Web Structure Mining –Clever algorithm 1

5.4 Web Usage Mining- Preprocessing, Data structures 1

203
 COMPUTER SCIENCE AND
B TECH IN ARTIFICIAL ENGINEERING
INTELLIGENCE AND MACHINE
LEARNING

5.5 Web Usage Mining -Pattern Discovery, Pattern Analysis 1

5.6 Text Mining-Text Data Analysis and information Retrieval, Basic 1

measures for Text retrieval

5.7 Text Retrieval methods, Text Indexing Techniques 1

Query Processing Techniques

204
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT BIO-INSPIRED Category L T P Credit

476 OPTIMIZATION
Program 3 0 0 3
TECHNIQUES
Elective
IV

Preamble:

The aim of this course is to provide the students with the knowledge and skills
required to design and implement Bio-inspired optimization techniques to
problems for which a direct solution is impractical or unknown. This course
covers concepts of evolutionary algorithms like genetic algorithms and various
swarm optimization techniques like ACO, PSO. The learners will be able to
provide Bio-inspired optimization solutions to real world problems.
Course Outcomes: After the completion of the course the student will be able to

CO1 Understand the fundamentals in bio-inspired optimization techniques

which influence computing (Cognitive Knowledge Level: Understand)

CO2 Make use of the concepts of Evolutionary Algorithms, genetic algorithms

in various domains. (Cognitive Knowledge Level: Apply)

CO3 Comprehend the concepts of Swarm Intelligence and collective systems

such as ACO, PSO (Cognitive Knowledge Level: Understand)

CO4 Illustrate the concepts of biologically inspired algorithmic

design(Cognitive Knowledge Level: Understand)

CO5 Select the most appropriate types of algorithms for different data
analysis problems (Cognitive Knowledge Level: Understand)

205 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping
apping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO8 PO PO PO1 PO
1 2 3 4 5 6 7 9 10 1 12

CO1

CO2

CO3

CO4

CO5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of

PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

206 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Marks (%)
Test 1 Test 2
(%) (%)

Remember 20 20 20

Understand 70 70 70

Apply 10 10 10

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of

207 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and
Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module
of which student should answer any one. Each question can have maximum 2
sub-divisions and carries 14 marks.

208 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module – 1 (Optimization Techniques) (7 hours)

Optimization Techniques: Understanding optimization process- Objective

function, minima & maxima, convergence. Optimization methods- conventional
methods, Gradient descent algorithm- drawbacks. Introduction to Optimization
Problems – classification- Single and Muti- objective Optimization – Classical
Techniques – Overview of various Optimization methods . Bio- inspired
Computing (BIC): Motivation – Overview of BIC – usage of BIC – merits and
demerits of BIC.

Module– 2(Evolutionary Computing ) (7 hours)

Evolutionary Computing: Motivation, Genetic Algorithm and Genetic

Programming: Basic concept – encoding – representation – fitness function –
Population, Operators – Selection, Mutation, Crossover, Reproduction – Types of
Evolutionary Algorithms, Differences between GA and Traditional optimization
methods – Applications.

Module- 3 (Ant Colony Systems) (8 hours)

Swarm intelligent systems – Background. Ant colony systems – Biological

systems, Development of the ant colony system- - Working of ACO Algorithm -
Pheromone updating- Types of ant systems- ACO algorithms for TSP.

Module- 4 (Particle Swarm Optimization) (7 hours)

Foraging for food – Clustering of objects – Collective Prey retrieval –Scope of

Swarm Robotics –Social Adaptation of Knowledge: Particle Swarm – Particle
Swarm Optimization (PSO) – Particle Swarms for Dynamic Optimization
Problems – Bee-inspired optimization, Artificial Bee Colony (ABC) Optimization ,
applications.

Module- 5 (Case Studies) (6 hours)

Other Swarm Intelligence algorithms: Fish Swarm – Bacteria foraging –

Intelligent Water Drop Algorithms – Applications of biologically inspired
209 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

algorithms in engineering. Case Studies: ACO for NP-hard problems – Routing

problems – Assignment problems –Scheduling problems.

ReferenceBooks

1. A. E. Elben and J. E. Smith, “Introduction to Evolutionary Computing”,

Springer,2010.

2. S. N. Sivanandam and S.N. Deepa, Principles of Soft Computing , 2nd

Edition, John Wiley & Sons.

3. Marco Dorigo and Thomas Stutzle, “Ant Colony optimization”, Prentice

Hall of India, New Delhi,2005.

4. FloreanoD. and Mattiussi C., "Bio-Inspired Artificial Intelligence:

Theories,Methods, and Technologies", MIT Press, Cambridge, MA, 2008.

5. Leandro Nunes de Castro, " Fundamentals of Natural Computing,

BasicConcepts, Algorithms and Applications", Chapman & Hall/ CRC,
Taylor andFrancis Group, 2007.

6. SatyobrotoTalukder, Blekinge Institute of Technology, Mathematical

Modelling and Applications of Particle Swarm Optimization, February
2011.

7. Christian Blum and Daniel Merkle, “Swarm Intelligence Introduction and

Application”, Springer 2008.

210 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. Explain the need for bio-inspired computation algorithms.

2. Differentiate between Bio-inspired optimization and other optimization
techniques.

Course Outcome 2(CO2):

1. Describe how the Roulette wheel is used for selection. Draw the Roulette
wheel for six chromosomes corresponding to the table given below.

Chromosome # Fitness
1 10
2 5
3 25
4 15
5 30
6 20

Course Outcome 3(CO3):

1. Consider an Ant Colony System based on the Ant Quantity model for solving
the following Travelling Salesman Problem. Compute the pheromone content
at each of the edges after 4 steps (1 iteration). Assume pheromone decay
factor ρ= 0.1, Q = 120. Assume an initial pheromone of 50 units at each of
the edges and that three ants k1, k2 and k3 follow the paths given below in
the first iteration. k1= a b c d a; k2=a c b d a; k3=a d c b a

211 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 4(CO4): .

1. Consider a particle swarm optimization system composed of three
particles and maximum velocity 10. Assume that both the random
numbers r1 and r2 used for computing the movement of the particle
towards the individual best position and social best position are 0.5. Also
assume that the space of solutions is the two dimensional real valued
space and the current state of swarm is as follows: Position of particles: x1
= (4,4); x2 = (8,3); x3 = (6,7) Individual best positions : x14,4 = (‫ ;)٭‬x2 = (‫٭‬
7,3); x35,6 = (‫ )٭‬Velocities: v1 = (2,2); v2 = (3,3); v3 = (4,4) .What would be
the next position of each particle after one iteration of the PSO algorithm if
the inertia parameter ω that is used along with current velocity update
formula is 0.8 ?

Course Outcome 5(CO5):

1. Discuss applications of bio-optimization techniques (ACO) for solving
NP-hard problems.

212 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 476

Course Name: Bio-Inspired Optimization Techniques

Max.Marks:100
Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate Optimization and Constraint Satisfaction problems.

2. Define bio-Inspired Optimization.

3. Specify the importance of objective (fitness) function in genetic

algorithm.

4. Compare Single-Point Crossover and Two-Point Crossover.

5. Describe how pheromone is updated.

6. Define Swarm Intelligence and list the algorithms under SI.

7. What is the significance of pbest and gbest particles in solving

213 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

problems with particle swarm optimization?

8. List the scope of swarm robotics.

9. What is Fish Swarm optimization algorithm.

10. Define an assignment problem? List the different types of

Assignment problems. (10x3=
30)

Part B

(Answer any one question from each module. Each question carries 14
Marks)

11. (a) Discuss about Optimization, modelling, and simulation (7)

problems.

(b) Differentiate between Bio-inspired optimization and other (7)

optimization techniques

OR

12. (a) What is Bio-Inspired Computing? Explain the working of BIC (7)
algorithms.

(b) Discuss the merits and demerits of BIC. (7)

13. (a) Explain any procedure to map a solution to the corresponding (7)
chromosome and vice versa in genetic algorithms. Also
illustrate it with an example:

214 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Describe two methods used to select individuals from a (7)

population for the mating pool in Genetic Algorithms.

OR

14. (a) Explain any two mutation methods. (4)

(b) Differentiate between value encoding and permutation (10)

encoding.

15. (a) Describe Ant Colony System. What are the different types of Ant (7)
systems?

(b) Using the equation Tij(t+1)=(1-ρ)Tij(t) + ∆Tij(t,t+1), compute (7)

the Tij of the edge when 10 ants uses the edges, using the
following models:
i. Ant Density Model (Constant Q=10)
ii. Ant Quantity Model(Constant Q=100) , where Q is the
constant related to the pheromone updation

OR

16. (a) Consider the TSP with the following edge costs. Given the (4)
evaporation factor ρ =0.02 and initial pheromone at all

215 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

edges Tij=100.
Compute the cost of the best tour?

(b) Describe ACO algorithm for TSP problems. (10)

17. (a) Illustrate Artificial Bee Colony optimization (10)

(b) List the advantages of Particle Swarm Optimization (PSO). (4)

OR

18. (a) Discuss Particle Swarm Optimization (PSO). (6)

(b) Explain the working of Particle Swarm Optimization (PSO) (8)

Algorithm.

19. (a) Describe the working of Bacteria Foraging Algorithms. (7)

(b) Explain Intelligent Water Drop Algorithms . (7)

OR

20. (a) Discuss the different types of routing problems. (6)

(b) Discuss any four Applications of biologically inspired (8 )

algorithms in engineering.

216 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
Lecture
No Contents
Hours

(35hrs)

Module-1(Optimization Techniques) (7 hours)

Understanding optimization process- Objective function,

1.1 minima & maxima, convergence. Optimization methods- 2hour
Gradient descent algorithm- drawbacks.

Introduction to Optimization Problems – classification- Single

1.2 1 hour
and Muti- objective Optimization

1.3 Classical Techniques 1 hour

1.4 Overview of various Optimization methods 1 hour

1.5 Bio- inspired Computing (BIC): Motivation – Overview of BIC 1 hour

1.6 Usage of BIC – merits and demerits of BIC. 1 hour

Module-2 (Evolutionary Computing) (7hours)

Evolutionary Computing: Motivation, Genetic Algorithm and

2.1 1 hour
Genetic Programming: Basic concepts

2.2 Encoding – Representation 1 hour

2.3 Fitness function, Population, Reproduction 1 hour

2.4 Operators - Selection, Mutation 1 hour

2.5 Crossover, Reproduction 1 hour

2.6 Types of Evolutionary Algorithms 1 hour

217 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Differences between GA and Traditional optimization methods

2.7 1 hour
– Applications.

Module-3 (Ant colony systems) (8 hours)

3.1 Swarm intelligent systems 1 hour

3.2 Background… 1 hour

3.3 Ant colony systems – Biological systems 1 hour

3.4 Development of the ant colony system 1 hour

3.5 Working of ACO Algorithm 1 hour

3.6 Pheromone updating 1 hour

3.7 Types of ant systems 1 hour

3.8 ACO algorithms for TSP 1 hour

Module-4 (Particle Swarm Optimization)) (7 hours)

4.1 Foraging for food 1 hour

4.2 Clustering of objects 1 hour

4.3 Collective Prey retrieval 1 hour

4.4 Scope of Swarm Robotics 1 hour

Particle Swarm –– Particle Swarms for Dynamic Optimization

4.5 1 hour
Problems

4.6 Particle Swarm Optimization (PSO) 1 hour

Bee-inspired optimization, Artificial Bee Colony (ABC)

4.7 Optimization , 1 hour

Applications

218 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module-5 (CASE STUDIES) (6 hours)

5.1 Other Swarm Intelligence algorithms: Fish Swarm 1 hour

5.2 Bacteria foraging 1 hour

5.3 Intelligent Water Drop Algorithms 1 hour

5.4 Applications of biologically inspired algorithms in engineering 1 hour

Case Studies: ACO for NP-hard problems – Routing problems –

5.5 1 hour
Assignment problems

5.6 Scheduling problems 1 hour

219 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VIII
PROGRAM ELECTIVE V

Page 220
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
HIGH PERFORMANCE CATEGORY L T P CREDIT INTRODUCTION
CST418
COMPUTING
PEC 2 1 0 3 2019

Preamble: This course helps the learners to understand the different architectural features of
high-end processors. This course discusses the Basics of high-end processors Architecture,
Instruction-Level Parallelism, Data-Level Parallelism, Thread Level Parallelism, and GPU
Architectures. This course enables the students to provide solutions to real-world problems
making use of the capabilities of HPC systems.
Prerequisite: Basic knowledge in Computer System architecture, Microprocessors, Operating
systems, and System software.

Course Outcomes: After the completion of the course the student will be able to

CO1 Describe different types of modern processing environments and parallel computing
hardware (Cognitive Knowledge Level: Understand)

CO2 Summarize the concepts of Instruction Level Parallelism (Cognitive Knowledge

Level: Understand)

CO3 Appreciate the idea of Data Level Parallelism (Cognitive Knowledge Level: Apply)

CO4 Demonstrate the concept of Thread Level Parallelism (Cognitive Knowledge Level:
Apply)

CO5 Describe the basics of GPU architecture. (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

C05

Page 221
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and teamwork

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 20 20 20

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks. ESE Duration

150 50 100 3

Page 222
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations have to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which students should answer anyone. Each
question can have a maximum of 2 sub-divisions and carries 14 marks.

Syllabus
Module-1 ( Basics of Architecture )
Classes of Computers - Classes of Parallelism and Parallel Architectures – Defining Computer
Architecture – Dependability – Quantitative Principles of Computer Design – Basics of Memory
Hierarchies – Virtual Memory and Virtual Machines – Pipelining

Module-2 ( Instruction-Level Parallelism)

Instruction-Level Parallelism: Concepts and Challenges – Basic Compiler Techniques for
Exposing ILP – Reducing Branch Costs With Advanced Branch Prediction – Hardware-Based
Speculation – Multithreading: Exploiting Thread-Level Parallelism to Improve Uniprocessor
Throughput

Page 223
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module-3 (Data-Level Parallelism)

Vector Architecture – SIMD Instruction Set Extensions for Multimedia – Graphics Processing
Units – Detecting and Enhancing Loop-Level Parallelism

Module-4 ( Thread Level Parallelism)

Multiprocessor Architecture: Issues and Approach – Centralized Shared-Memory Architectures –
Performance of Symmetric Shared-Memory Multiprocessors– Distributed Shared-Memory and
Directory-Based Coherence – Synchronization: The Basics – Introduction to Memory
Consistency

Module-5 (GPU Architectures)

The CPU-GPU system as an accelerated computational platform – The GPU and the thread
engine – Characteristics of GPU memory spaces – The PCI bus: CPU to GPU data transfer
overhead – Multi-GPU platforms – Potential benefits of GPU – accelerated platforms
Text Books
1. John L. Hennessy, David A. Patterson Computer Architecture, Sixth Edition A
Quantitative Approach, Morgan Kaufman, Fifth Edition, 2012.
2. Robert Robey, Yuliana Zamora, Parallel and High-Performance Computing, Manning
Publications, First Edition, 2021.
Reference Books
1. Thomas Sterling, Matthew Anderson, and MaciejBrodowicz, High-Performance
Computing – Modern Systems and Practices, First Edition, 2017.
2. Charles Severance, Kevin Dowd,High-Performance Computing, O'Reilly Media, Second
Edition, 1998.
3. Kai Hwang, Faye Alaye Briggs, Computer Architecture and Parallel Processing,
McGraw-Hill, 1984.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Differentiate different classes of computer-based on features like microprocessor cost,
system cost, and system design issues.
2. Explain the different methods by which computer hardware exploits application-level
parallelism.
3. Explain in detail the instruction set architecture
4. Describe the encoding scheme specified as part of ISA

Page 224
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Outcome 2 (CO2):

1. Differentiate data, name, and control dependencies with suitable examples.
2. Explain loop unrolling with suitable coding demonstration
3. Explain in detail about Tournament Predictors.
4. Describe the unique features of very long instruction word processors.

Course Outcome 3 (CO3):

1. What are the three things conveyed through a data dependence? Explain the Data
Dependencies of the following code:

2. Assume a single-issue pipeline. Unroll the loop as many times as necessary to schedule it
without any stalls, collapsing the loop overhead instructions. How many times must the
loop be unrolled? Show the instruction schedule. What is the execution time per element of
the result?
3. Explain the SIMD Instruction Set Extensions for Multimedia.

Course Outcome 4 (CO4):

1. With the help of a neat diagram illustrate a single-chip multicore with a distributed
cache.
2. Demonstrate the Implementation of cache coherence in a distributed-memory
multiprocessor by adding a directory to each node with a suitable diagram.
3. Consider the following code segments running on two processors P1 and P2.
Assume A, and B, are initially 0. Explain how an optimizing compiler might make it
impossible for B to be ever set to 2 in a sequentially consistent execution model.

Course Outcome 5 (CO5):

1. Explain the benefits of potential GPU.
2. Illustrate GPU system as an accelerated computational platform.
3. Discuss CPU to GPU data transfer overhead.

Page 225
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST418

Course Name: High Performance Computing

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Differentiate between Data level parallelism and Task level parallelism

2. Explain the principle of locality

3. Define Instruction Level Parallelism with an example.

4. Devise the importance of loop unrolling with an example.

5. What is the equation of CPI (cycles per instruction) for a pipelined processor? How
can we set the ideal pipeline CPI?

6. Explain the two types of name dependencies between an instruction i that precedes
instruction j in program order.

7. Differentiate between module reliability and module availability measures with

suitable examples.

8. Why SMP architectures are called UMA multiprocessors and DSM multiprocessors
as NUMA processors.

Page 226
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

9. Explain the need for GPU.

10. List the characteristics of GPU memory spaces.

3x10=30

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Describe the quantitative principle of computer design with Amdahl's law. (8)

(b) Discuss in detail the importance of considering processor performance for (6)
the design of an efficient computer system.

OR

12. (a) Illustrate how processes are protected with the help of virtual memory. (7)

(b) Discuss the role played by virtual machines in providing protection for (7)
processes.

13. (a) Explain in detail data dependence and hazards. (8)

(b) With neat sketches explain how data-level parallelism is achieved in vector, (6)
and SIMD architectures.

OR

14. (a) Describe the unique features of very long instruction word processors. (8)

(b) Consider a three-way superscalar machine renaming these three instructions (6)
concurrently:

Page 227
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

If the value of x1 starts at 5, then what will be its value when after this
sequence is executed?

15. (a) The following loop has multiple types of dependences. Find all the true (8)
dependences, output dependencies, and anti-dependencies, and eliminate the
output dependencies and anti-dependencies by renaming.

(b) Describe the limitations of Symmetric Shared-Memory Multiprocessors and (6)

Snooping Protocols

OR

16. (a) Demonstrate the different types of hardware approaches required for the (8)
working of multithreading.

(b) Consider the following loop: (6)

Are there exist dependencies between S1 and S2? Determine whether the
above loop is parallel? If not, show how to make it parallel.

17. (a) Consider an 8-processor multicore where each processor has its own L1 and (8)
L2 caches. Here snooping is performed on a shared bus among the L2
caches. Assume that the average L2 request is 15 cycles for a coherence
miss or other miss and a clock rate of 3.0 GHz, a CPI of 0.7, and a load/store
frequency of 40%. If the goal set is that no more than 50% of the L2
bandwidth is consumed by coherence traffic, then what is the maximum
coherence miss rate per processor?

(b) Explain the basic structure of a centralized shared-memory multiprocessor (6)

Page 228
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

based on a multicore chip.

OR

18. (a) Suppose an application running on a 100-processor multiprocessor use 1, (6)

50, or 100 processors. If for 95% of the time all 100 processors are used,
illustrate how the remaining 5% of the execution time employs 50
processors for a speedup of 80?

(b) With a neat diagram, demonstrate invalidate cache coherence protocol for a (8)
private write-back cache, showing the states and state transitions for each
block in the cache.

19. (a) Explain the multi-GPU platform. (8)

(b) Explain some of the benefits of GPU. (6)

OR

20. (a) Discuss in detail the characteristics of GPU memory spaces. (8)

(b) Explain about GPU thread engine. (6)

Teaching Plan

No. of
Lecture
No Contents Hours
(36 hrs)
Module 1 - Basics of Architecture (7 hours)

1.1 Classes of Computers 1 hour

1.2 Classes of Parallelism and Parallel Architectures 1 hour
1.3 Dependability 1 hour
1.4 Quantitative Principles of Computer Design. 1 hour

Page 229
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1.5 Basics of Memory Hierarchies 1 hour

1.6 Virtual Memory and Virtual Machines 1 hour
1.7 Pipelining 1 hour

Module -2 (Introduction to Syntax Analysis) (7 hours)

2.1 Instruction-Level Parallelism: Concepts and Challenges 1 hour

2.2 Basic Compiler Techniques for Exposing ILP 1 hour
2.3 Reducing Branch Costs With Advanced Branch Prediction 1 hour
2.4 Hardware-Based Speculation 1 hour
2.5 Multithreading 1 hour
Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput – 1 hour
2.6
Lecture 1.
Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput – 1 hour
2.7
Lecture 2.

Module- 3 - Data-Level Parallelism (7 hours)

3.1 Vector Architecture -Lecture 1 1 hour

3.2 Vector Architecture -Lecture 2 1 hour
3.3 SIMD Instruction Set Extensions for Multimedia – Lecture 1 1 hour

3.4 SIMD Instruction Set Extensions for Multimedia – Lecture 2 1 hour

3.5 Graphics Processing Units 1 hour
Detecting and Enhancing Loop-Level Parallelism – Lecture 1 1 hour
3.6

Detecting and Enhancing Loop-Level Parallelism – Lecture 2 1 hour

3.7

Module 4– Thread Level Parallelism (8 hours)

4.1 Multiprocessor Architecture: Issues and Approach 1 hour

4.2 Centralized Shared-Memory Architectures – Lecture 1 1hour
4.3 Centralized Shared-Memory Architectures – Lecture 2 1hour
4.4 Performance of Symmetric Shared-Memory Multiprocessors 1hour
4.5 Distributed Shared-Memory 1hour
4.6 Directory-Based Coherence 1hour
4.7 Synchronization 1hour

Page 230
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

4.8 Introduction to Memory Consistency 1hour

Module 5 – GPU Architectures (7 hours)

5.1 The CPU-GPU system as an accelerated computational platform 1 hour

5.2 The GPU and the thread engine – Lecture 1 1 hour
5.3 The GPU and the thread engine – Lecture 2 1 hour
5.4 Characteristics of GPU memory spaces 1hour
5.5 PCI bus: CPU to GPU data transfer overhead 1hour
5.6 Multi-GPU platforms 1hour
Potential benefits of GPU-accelerated platforms 1hour
5.7

Page 231
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
BLOCKCHAIN CATEGORY L T P CREDIT INTRODUCTION
CST428
TECHNOLOGIES
PEC 2 1 0 3 2019

Preamble: The purpose of this course is to create awareness and understanding among students
on the foundation of blockchain technology. The course introduces the cryptographic principles
behind blockchain and helps the students understand concepts like consensus, crypto-currency,
smart contracts, use cases etc. The course enables students to develop simple decentralized
applications using blockchain networks such as Ethereum.
Prerequisite: Basic knowledge in data structures and operating systems.

Course Outcomes: After the completion of the course the student will be able to

CO1 Illustrate the cryptographic building blocks of blockchain technology. (Cognitive

Knowledge Level: Understand)

CO2 Explain the fundamental concepts of blockchain technology. (Cognitive Knowledge

Level: Understand)

CO3 Summarize the classification of consensus algorithms. (Cognitive Knowledge Level:

Understand)

CO4 Explain the concepts of first decentralized cryptocurrency bitcoin. (Cognitive

Knowledge Level: Understand)

CO5 Explain the use of smart contracts and its use cases. (Cognitive Knowledge Level:
Understand)

CO6 Develop simple applications using Solidity language on Ethereum platform.

(Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
0 2

CO1

CO2

Page 232
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests

Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)

Remember 30 30 30

Understand 50 50 50

Apply 20 20 20

Analyze

Evaluate
Create

Page 233
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1 (Fundamentals of Cryptography)
Introduction to Cryptography, Symmetric cryptography – AES. Asymmetric cryptography –
RSA. Elliptic curve cryptography, Digital signatures – RSA digital signature algorithms. Secure
Hash Algorithms – SHA-256. Applications of cryptographic hash functions – Merkle trees,
Distributed hash tables.

Module – 2 (Fundamentals of Blockchain Technology)

Blockchain – Definition, architecture, elements of blockchain, benefits and limitations, types of
blockchain. Consensus – definition, types, consensus in blockchain.

Page 234
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Decentralization – Decentralization using blockchain, Methods of decentralization, Routes to

decentralization, Blockchain and full ecosystem decentralization.

Module - 3 (Consensus Algorithms and Bitcoin)

Consensus Algorithms, Crash fault-tolerance (CFT) algorithms – Paxos, Raft. Byzantine fault-
tolerance (BFT) algorithms – Practical Byzantine Fault Tolerance (PBFT), Proof of work (PoW),
Proof of stake (PoS), Types of PoS.
Bitcoin – Definition, Cryptographic keys – Private keys, public keys, addresses. Transactions –
Lifecycle, coinbase transactions, transaction validation. Blockchain – The genesis block.
Mining – Tasks of miners, mining algorithm, hash rate. Wallets – Types of wallets.
Module - 4 (Smart Contracts and Use cases)
Smart Contracts – Definition, Smart contract templates, Oracles, Types of oracles, Deploying
smart contracts. Decentralization terminology – Decentralized applications, Decentralized
Autonomous Organizations.
Use cases of Blockchain technology – Government, Health care, Finance, Supply chain
management.
Blockchain and allied technologies – Blockchain and Cloud Computing, Blockchain and
Artificial Intelligence.
Module - 5 (Ethereum and Solidity)
Ethereum – The Ethereum network. Components of the Ethereum ecosystem – Keys and
addresses, Accounts, Transactions and messages. The Ethereum Virtual Machine, Blocks and
blockchain.
The Solidity language – The layout of a Solidity source code, Structure of a smart contract,
variables, data types, control structures, events, inheritance, libraries, functions, error handling.
Smart contracts Case study: Voting, Auction.

Text Book
1. Imran Bashir, Mastering Blockchain: A deep dive into distributed ledgers, consensus
protocols, smart contracts, DApps, cryptocurrencies, Ethereum, and more, Packt Publishing,
Third edition, 2020.
References
2. Ritesh Modi, Solidity Programming Essentials: A beginner's guide to build smart contracts
for Ethereum and blockchain, Packt Publishing, First edition, 2018.
3. Kumar Saurabh, Ashutosh Saxena, Blockchain Technology: Concepts and Applications,
First Edition, Wiley Publications, First edition, 2020.
4. Chandramouli Subramanian, Asha A George, et al, Blockchain Technology, Universities
Press (India) Pvt. Ltd, First edition, August 2020.

Page 235
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5. Lorne Lantz, Daniel Cawrey, Mastering Blockchain: Unlocking the Power of

Cryptocurrencies, Smart Contracts, and Decentralized Applications, O'Reilly Media, First
edition, 2020.
6. Andreas M. Antonopoulos, Gavin Wood, Mastering Ethereum: Building Smart Contracts
and DApps, O'Reilly Media, First edition, 2018.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Distinguish between Symmetric cryptography and asymmetric cryptography.
2. Explain the working of AES algorithm.

Course Outcome 2 (CO2):

1. Categorize consensus mechanism used in blockchain.
2. Define Blockchain. Explain how decentralization of computing or processing power is
achieved by a blockchain.

Course Outcome 3 (CO3):

1. Explain how Proof of Stake can achieve consensus among peers.
2. Explain the working of Raft protocol.

Course Outcome 4 (CO4):

1. Describe the use of genesis block.
2. Explain the mining algorithm used in bitcoin.

Course Outcome 5 (CO5):

1. Illustrate how blockchain technology can be used in supply chain management.
2. What are oracles in a blockchain ecosystem? Explain the generic data flow from a smart
contract to an oracle.
Course Outcome 6 (CO6):
1. Develop a smart contract for voting process. In this application, delegated voting is
allowed and the counting is automatic and completely transparent at the same time.
2. Develop a smart contract for auction process. The contract should be a blind auction
where it is not possible to see the actual bid until the bidding period ends.

Page 236
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST428

Course Name: BLOCK CHAIN TECHNOLOGIES

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Discuss the role of secure hash functions in blockchain.

2. List out the properties of digital signatures.

3. Illustrate the blockchain based decentralized system.

4. Explain how Proof of Stake can achieve consensus among peers.

5. If your blockchain network has 5 Byzantine nodes, what is the minimum number of
nodes that are required to ensure Byzantine fault tolerance using PBFT protocol?

6. How are transactions verified in a Bitcoin network?

7. Explain how smart contracts can be used for enforcing agreements between parties
in the form of business logic.

8. Explain the concept of blockchain-based digital identity cards.

9. Explain error handling in Solidity language.

Page 237
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

10. With the help of a figure show the relationship between the transaction, transaction (10x3=30)
trie, and block header in Ethereum.

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the design of SHA-256 and its compression function using a (9)
diagram.

(b) Explain how hash functions are used to build Merkle trees in blockchain. (5)

OR

12. (a) Explain public and private keys. Perform encryption and decryption using (7)
RSA for p=3, q=11, e= 7 and M=5.

(b) Explain elliptic curve digital signature algorithm. (7)

13. (a) Illustrate and explain how blockchain works using a neat diagram. (7)

(b) Explain the benefits, features and limitations of blockchain. (7)

OR

14. (a) Explain consensus mechanisms used in blockchain. List out any six (7)
consensus algorithms used in the context of blockchain.

(b) Define blockchain. Explain how decentralization of computing or processing (7)

power is achieved by a blockchain.

15. (a) Explain and illustrate how Paxos protocol can be used to achieve consensus. (7)

(b) Show how Practical Byzantine Fault Tolerance can achieve consensus in the (7)
presence of Byzantine faults.

OR

16. (a) Describe the various fields that make up a transaction in Bitcoin. (7)

(b) What is the role of a Bitcoin miner? Explain the mining algorithm used in (7)

Page 238
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Bitcoin with the help of a flowchart.

17. (a) Illustrate how blockchain technology can be implemented in finance sector. (7)

(b) Discuss oracles in a blockchain ecosystem. Explain the generic data flow from (7)
a smart contract to an oracle.

OR

18. (a) Explain the design process of decentralized applications with diagrams. (7)

(b) Explain the use of blockchain technology in supply chain management. (7)

19. (a) Using Solidity language, create a simple bank contract that allows a user to (7)
deposit, withdraw and view balance.

(b) Define block difficulty. Explain how block difficulty is adjusted in Ethereum (7)
blockchain network.

OR

20. (a) Using Solidity language, create a simple voting smart contract where a (7)
chairperson will give the right to vote to each address individually.

(b) Explain the concept of Gas in Ethereum. Explain how transaction cost can be (7)
calculated in an Ethereum blockchain network.

Page 239
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan
No. of
Lecture
No Contents Hours
(35 hours)
Module-1 (Fundamentals of Cryptography) (7 hours)

1.1 Introduction to cryptography 1 hour

1.2 Symmetric cryptography, AES 1 hour
1.3 Asymmetric cryptography, RSA 1 hour
1.4 Elliptic curve cryptography 1 hour
1.5 Digital signatures – RSA digital signature algorithm 1 hour
1.6 Secure Hash Algorithms – SHA-256 1 hour
Applications of cryptographic hash functions – Merkle trees, Distributed
1.7 1 hour
hash tables
Module-2 (Fundamentals of Blockchain Technology) (6 hours)
2.1 Blockchain – definition and architecture 1 hour
2.2 Elements of blockchain. 1 hour
2.3 Blockchain – benefits and limitations, types. 1 hour
2.4 Consensus – definition, types, consensus in blockchain 1 hour
2.5 Decentralization using blockchain, Methods of decentralization 1 hour
2.6 Routes to decentralization, Blockchain and full ecosystem decentralization 1 hour
Module-3 (Consensus Algorithms and Bitcoin) (7 hours)
Consensus Algorithms – Crash fault-tolerance (CFT) algorithms – Paxos,
3.1 1 hour
Raft (working is expected).
Byzantine fault-tolerance (BFT) algorithms – Practical Byzantine Fault
3.2 1 hour
Tolerance (PBFT) (working is expected).
3.3 Proof of work (PoW), Proof of stake (PoS), Types of PoS 1 hour
Bitcoin – Definition, Cryptographic keys – Private keys, public keys,
3.4 1 hour
addresses.
3.5 Transactions – Lifecycle, coinbase transactions, transaction validation 1 hour

Page 240
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.6 Blockchain – The genesis block. Mining – Tasks of miners 1 hour

3.7 Mining – mining algorithm, hash rate. Wallets – Types of wallets. 1 hour
Module-4 (Smart Contracts and Use cases) (6 hours)
4.1 Smart Contracts – Definition, Smart contract templates 1 hour
4.2 Oracles, Types of oracles, Deploying smart contracts. 1 hour
Decentralization terminology –Decentralized applications, Decentralized
4.3 1 hour
Autonomous Organizations.
4.4 Use cases of Blockchain technology – Government, Health care. 1 hour
4.5 Use cases of Blockchain technology – Finance, Supply chain management. 1 hour
Blockchain and Allied Technologies – Blockchain and Cloud Computing,
4.6 1 hour
Blockchain and Artificial Intelligence.
Module-5 (Ethereum and Solidity) (9 hours)
Ethereum - The Ethereum network,
5.1 1 hour
Components of the Ethereum ecosystem – Keys and addresses, Accounts
5.2 Components of the Ethereum ecosystem – Transactions and messages 1 hour
5.3 The Ethereum Virtual Machine 1 hour
5.4 Ethereum Blocks and blockchain 1 hour
The Solidity language – The layout of a Solidity source code, Structure of a
5.5 1 hour
smart contract, variables, data types
5.6 The Solidity language – control structures, events, inheritance, libraries 1 hour
5.7 The Solidity language – functions, error handling. 1 hour
5.8 Smart contracts Case study: Voting. 1 hour
5.9 Smart contracts Case study: Auction. 1 hour

Page 241
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
IMAGE PROCESSING CATEGORY L T P CREDIT INTRODUCTION
CST438
TECHNIQUE
PEC 2 1 0 3 2019

Preamble: This course helps the learners understand the core concepts and applications of Digital
Image Processing. It covers Digital Image Fundamentals, Image Transforms, Image Enhancement
in Spatial and Frequency Domain, Image Restoration & Image Segmentation and Morphological
Operations & Representation and Description. The learners will be able to develop new
algorithms, tools, and application software for real-world applications involving image processing.
Prerequisite: A basic knowledge of Computer Graphics and Image representation
Course Outcomes: After the completion of the course, the student will be able to

CO1 Explain the concepts of image formation and the basis of digital image processing.
(Cognitive Knowledge Level: Understand)

CO2 Demonstrate the role of image transforms in representing, highlighting, and modifying
image features. (Cognitive Knowledge Level: Apply)
Solve image enhancement problems using spatial and frequency domain techniques.
CO3
(Cognitive Knowledge Level: Apply)

CO4 Make use of the concept of image restoration and image segmentation techniques in
real-world problems. (Cognitive Knowledge Level: Apply)

CO5 Interpret morphological operations, image representation, and description techniques.

(Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5

Page 242
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and teamwork

solutions
Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Examination
Category Marks (%)
Test 1 Test 2
(%) (%)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate
Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration

150 50 100 3

Page 243
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern
Each of the two internal examinations has to be conducted out of 50 marks. The first series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.
End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which students should answer anyone. Each
question can have a maximum 2 subdivisions and carries 14 marks.

Syllabus
Module – 1 (Digital Image Fundamentals)

Elements of Visual Perception, A Simple Image Formation Model. Spatial and Intensity
Resolution. Image Interpolation. Classification of Digital Images. Image Types. Image Storage
Mechanisms. Arithmetic and Logical Operations. Geometric Spatial Transformations and Image
Registration. Image File Formats. Colour Fundamentals and Colour Models.
Module - 2 (Image Transforms)
Basic concept of spatial domain and frequency domain, Unitary transform, Discrete Fourier
Transform- 2D DFT, 4 order DFT Transform coefficients, Forward and inverse transform,
Discrete Cosine Transform- 2D DCT, 4 order DCT Transform Coefficients(No derivation
needed), Forward and Inverse DCT, Hadamard Transform.
Module - 3 (Image Enhancement in Spatial and Frequency Domain)

Point operations- Clipping and Thresholding, Digital Negative, Intensity Level Slicing, Bit
Extraction, Range Compression. Spatial Operations- Fundamentals of spatial convolution and

Page 244
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

correlation, Spatial averaging and spatial Low pass filtering, Directional Smoothing, Median
Filtering, Unsharp masking and Crispening.

Basics of Filtering in Frequency Domain, Filters, Smoothing Frequency Domain Filters-

Sharpening Frequency Domain Filters

Module - 4 (Image Restoration & Image Segmentation)

Image degradation model, Noise models, Mean Filters, Order Statistic filter, Adaptive filters.
Edge Detection, gradient operators, Laplace operators and zero crossings. Thresholding, Basic
Global Thresholding, Optimum global thresholding using Otsu method, Multiple thresholds,
Variable thresholding, Multivariable thresholding. Region-Based Approach to Segmentation.

Module - 5 (Morphological Operations & Representation and Description)

Structuring Element, Dilation and Erosion, Opening and Closing, Hit or Miss Transformation.

Boundary Following. Chain Codes. Polygonal Approximation. Boundary Descriptors. Regional

Descriptors. Relational Descriptors.
Text Books
1. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing (English) 3rd Edition,
Pearson India, 2013
2. A K. Jain, Fundamentals of digital image processing, Prentice Hall of India, 1989.
Reference Books
1. Al Bovik, The Essential Guide to Image Processing, Academic Press, 2009.
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing, Analysis, and Machine
Vision, Thomson Learning, 2008.
3. S Jayaraman, S Esakkirajan and T Veerakumar, Digital Image Processing, McGraw Hill
Education, 2009.
Course Level Assessment Questions
Course Outcome1 (CO1) :
1. Find the number of bits required to store a 256 X 256 image with 32 gray levels.
2. Explain the reasons for blocking artifacts and false contours in an image.
Course Outcome 2 (CO2) :
1. Compare different image transforms based on their roles, properties and applications.
2. Compute the inverse 2D DFT of the transform coefficients F(k,l) given below.

Page 245
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Use Discrete Fourier transform to construct 2D DFT for a 4x4 image given below. Assume that
indices start from (0,0)

Course Outcome 3 (CO3) :

1. Perform intensity level slicing on the 3 BPP (Bit Per Pixel) image. Let r1=3 and r2=5. Draw
the modified image with/without background transformations.

2. Let y(m) = {2,3,8,4,2}. Obtain the median filter output for the window W = [-1,0,1,2] and
show how salt and pepper noise is reduced.
3. Consider a 3*3 spatial mask that averages the four closest neighbors of a point(x,y), but
excludes the point itself from the average.

(a) Find the equivalent filter H(u,v) in the frequency domain.

(b) Show that H(u,v) is a lowpass filter (ASSIGNMENT)

Course Outcome 4 (CO4) :

1. Compare Region and Edge-based techniques in segmentation.

Page 246
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2. Consider a noisy image that is restored using arithmetic mean filter of size 3x3 and
using the geometric mean filter of the same size. Which image will be less blurred and
why?
3. Suppose that you want to help a radiologist to extract the tumor portion from an MRI
image for volumetric analysis. This volumetric analysis determines the effect of
treatment on the patient, which can be judged from the extracted size and shape of the
abnormal portion. Manual tracing of the tumor regions is very difficult since the tumor
portion on the MRI image is inhomogeneous, with complex shapes and ambiguous
boundaries. Suggest a sequence of steps that you may use to automate this process as an
image processing student. (ASSIGNMENT)

Course Outcome 5 (CO5) :

4. Explain the significance of structuring elements in morphological operations with
example.
5. Explain how chain codes are used to represent boundaries of a region with examples.

Page 247
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST438
Course Name: IMAGE PROCESSING TECHNIQUE
Max. Marks : 100 Duration: 3 Hours
PART A
Answer All Questions. Each Question Carries 3 Marks
1. Give an image representation model and describe how the representation changes
in different types of images.
2. Describe any three types of color models.

3. Obtain the HADAMARD basis matrix for N=8.

4. Prove that DFT is a unitary transform.

5. Sketch perspective plot of a 2-D ideal low pass filter transfer function and filter
cross-section. List its usefulness in Image enhancement.
6. Explain the significance of directional smoothing technique.
7. Specify the significance of the Zero crossing detector.

8. Describe region growing technique for image segmentation.

9. Define ‘Structuring Element’ used in morphological operations. Give samples for
Structuring Elements.
10. Explain image boundary representation using polygonal approximation.
(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14 Marks)
11. (a) (7)
Explain a Simple Image Formation Model with the help of a neat diagram.
(b) Explain the relationship between image size, spatial resolution, and image (7)
quality. Compare gray level and intensity resolution.
OR
12. (a) Describe arithmetic, logical and geometrical operations on Image. (7)

Page 248
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(b) Explain the significance of image interpolation and describe its various types. (7)
13. (a) State the advantages of Discrete Cosine Transform over Discrete Fourier (4)
Transform.
(b) You are given a 4 X 4 image patch Compute 2D DCT for the image patch. (10)
Reconstruct the original image patch by neglecting the last four coefficients in
2D DCT. Comment on the observed result.

OR
14. (a) Discuss the concept of sequency in Hadamard transform. (4)
(b) Find the 2D forward DFT of the image segment (10)
1 1 1 1
1 1 1 1
1 1 1 1
Prove the unitary property of the given image segment.
15. (a) Explain the output and application of the following point processing (9)
techniques
(i)Range Compression (ii) Bit Extraction (iii) Thresholding
(b) State and explain the features of median filtering. Compute the output of the (5)
median filtering for Y(m)={2,4,8,3,2} , w={-1,0,1,2} where Y(m) is an array
and w is a window.
OR
16. (a) Describe the role of Unsharp masking with its applications (4)
(b) Explain and compare the basic frequency domain filters for image sharpening (10)

17. (a) A 4×4 image is given by (8)

2 4 8 7
12 6 9 8
13 7 4 3
8 12 4 9

Page 249
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Filter the above image using

(a) MIN filter (b) MAX filter using the filter mask
0 1 0
1 1 1
0 1 0
(Assume replicate padding of the input image)
(b) Explain any two types of thresholding techniques. Describe the threshold (6)
detection algorithm using Otsu’s method.
OR
18. (a) Explain Image degradation model with the help of a neat diagram. (8)

(b) Illustrate the split and merge algorithm for image segmentation using neat (6)
sketches.
19. (a) Explain the purpose of morphological operations in digital image? Describe (7)
the opening and closing operations with examples.
(b) Illustrate Hit or Miss Transformation. (7)
OR
20. (a) Explain the concept of the chain coding scheme with its applications. (6)
(b) Describe in detail any two boundary representation schemes and illustrate (8)
with examples.

Teaching Plan

No. of
Lecture
No Contents Hours
(36 hrs)
Module-1 (Digital Image Fundamentals) (7 hours)

1.1 Elements of Visual Perception, A Simple Image Formation Model 1

1.2 Spatial and Intensity Resolution, Image Interpolation, Classification of 1

Digital Image.
1.3 Image Types, Image Storage Mechanisms. 1
1.4 Arithmetic and Logical Operations. 1
1.5 Geometric Spatial Transformations and Image Registration. 1
1.6 Image File Formats. 1

Page 250
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1.7 Colour Fundamentals and Colour Models. 1

Module-2 (Image Transforms) (8 hours)
2.1 Basic concept of spatial domain and frequency domain. 1
2.2 Need of Image Transform, Basic properties of unitary transform. 1
2.3 Discrete Fourier transform, Proof DFT is Unitary. 1
2.4 4 order DFT Transform coefficients (Derivation). 1
2.5 Problems ( 4 order DFT). 1
2.6 Discrete Cosine Transform- 2D DCT. 1
2.7 4 order DCT Transform Coefficients(No derivation needed). 1
2.8 Hadamard Transform. 1
Module-3 (Image Enhancement in spatial and frequency domain) (8 hours)

Point operations- Clipping and Thresholding, Digital Negative. Intensity

3.1 1
Level Slicing.

3.2 Bit Extraction, Range Compression + (Work out problems). 1

3.3 Spatial Operations-Fundamentals of spatial convolution and correlation. 1

3.4 Spatial averaging and spatial Low pass filtering, Directional Smoothing. 1

3.5 Median Filtering, Unsharp masking and Crispening. 1

3.6 Basics of Filtering in Frequency Domain. 1

3.7 Smoothing Frequency Domain Filters : Ideal Low Pass Filter; Gaussian Low 1
Pass Filter; Butterworth Low Pass Filter;

3.8 Sharpening Frequency Domain Filters: Ideal High Pass Filter; Gaussian High 1
Pass Filter; Butterworth High Pass filter.
Module-4 (Image Restoration & Image Segmentation) ( 6 hours)
4.1 Image degradation model, Noise models. 1
4.2 Mean Filters – Order Statistic filter – Adaptive filters. 1

4.3 Edge Detection, Gradient operators, Laplace operators and zero crossings. 1

Page 251
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Thresholding- Basic Global Thresholding, Optimum global thresholding

4.4 using Otsu method. 1

4.5 Multiple thresholds, Variable thresholding, Multivariable thresholding. 1

4.6 Region-Based Approach to Segmentation. 1
Module-5 (Morphological Operations & Representation and Description) (7 hours)
5.1 Structuring Element. Dilation and Erosion, 1
5.2 Morphological Opening, Closing. 1
5.3 Hit or Miss Transformation. 1
5.4 Boundary Following. Chain Codes, Polygonal Approximation. 1
5.5 Boundary Descriptors. 1
5.6 Regional Descriptors. 1
5.7 Relational Descriptors. 1

Page 252
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

AIT Speech Processing and Category L T P Credit

458 Analytics
Program 2 1 0 3
Elective V

Preamble:

This course equips the students to understand the concepts of speech

production, speech analysis and speech perception. The course covers speech
production, feature extraction and hearing mechanism fundamentals. It helps
students to apply speech processing methodologies to real world applications.

Prerequisite: Basic knowledge in signal processing.

Mapping of course outcomes with program outcomes

CO1 Explain speech production and acoustic phonetics (Cognitive

Knowledge Level: Understand)

CO2 Illustrate time domain and frequency domain analysis (Cognitive

Knowledge Level: Apply)

CO3 Articulate speech production and feature extraction (Cognitive

Knowledge Level: Apply)

CO4 Use the applications of speech processing in enhancement, coding and

recognition (Cognitive Knowledge Level: Apply)

CO5 Explain Signal Processing models of audio perception (Cognitive

Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

1 2 3 4 5 6 7 8 9 0 1 2

CO

253 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO
2

CO
3

CO
4

CO
5

Abstract POs defined by National Board of

Accreditation

PO# Broad PO PO# Broad

PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

Conduct investigations of

PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

254 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Assessment Pattern

Continuous Assessment
Bloom’s End Semester
Tests
Category Examination
Marks (%)
Test 1 Test 2
(%) (%)

Remember 20 20 20

Understand 50 50 50

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE Marks ESE Marks ESE

Marks Duration

150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of InternalTests1&2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern

Each of the two internal examinations has to be conducted out of 50 marks.

First series test shall be preferably conducted after completing the first half of
the syllabus and the second series test shall be preferably conducted after
completing remaining part of the syllabus. There will be two parts: Part A and

255 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B. Part A contains 5 questions (preferably, 2 questions each from the

completed modules and 1 question from the partly completed module), having
3 marks for each question adding up to 15 marks for part A. Students should
answer all questions from Part A. Part B contains 7 questions (preferably, 3
questions each from the completed modules and 1 question from the partly
completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2
questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each
module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.

256 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SYLLABUS

Module 1

Speech Production:- Acoustic theory of speech production- -Source/Filter

model - Pitch, Formant, Spectrogram-- Discrete model for speech production,
Articulatory Phonetics -Acoustic Phonetics- Basic speech units and their
classification.

Module 2

Short-Time Speech Analysis, Windowing, STFT, spectra of windows- Wide and

narrow band spectrogram -Time domain parameters (Short time energy, short
time zero crossing Rate, ACF). Frequency domain parameters-Filter bank
analysis. STFT Analysis. Prosody of speech.

Module 3

Mel-frequency cepstral coefficient (MFCC)-computation -Pitch Estimation

ACF/AMDF approaches, Cepstral analysis- Pitch and Formant estimation
using cepstral analysis. LPC Analysis -LPC model, Auto correlation method-
Levinson Durbin Algorithm

Module 4

Speech Enhancement: Spectral subtraction and Filtering, Harmonic filtering,

parametric resynthesis. Speech coding: fundamentals, class of coders -Time
domain/spectral domain/vocoders. Sub band coding, adaptive transform
coding, phase vocoder. Speaker Recognition: Speaker verification and speaker
identification- log-likelihood. Language identification-implicit and explicit
models. Machine learning models in Speaker Recognition

Module 5

Signal Processing models of audio perception: Basic anatomy of hearing

System: Basilar membrane behaviour. Sound perception: Auditory Filter

257 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Banks, Critical Band Structure, Absolute Threshold of Hearing, Masking-

Simultaneous Masking, Temporal Masking. Models of speech perception

Text Books

1. Douglas O'Shaughnessy, Speech Communications: Human & Machine,

IEEE Press,

Hardcover 2nd edition, 1999; ISBN: 0780334493.

2. Thomas F. Quatieri, Discrete-Time Speech Signal Processing: Principles

and Practice,

Prentice Hall,1 edition,2001.

Reference Books

1. Rabiner and Schafer, Theory and Application of Digital Processing of

Speech Signals,

Prentice Hall, 2010

2. Nelson Morgan and Ben Gold, Speech and Audio Signal Processing:
Processing and

Perception Speech and Music, July 1999, John Wiley & Sons, 2nd edition,
2011

3. Rabiner and Juang, Fundamentals of Speech Recognition, Prentice Hall,

1994.

258 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Level Assessment Questions

Course Outcome1 (CO1):

1. What are liquids and glides. Give one example for each.

2. What is the range of pitch values for male and female speakers

Course Outcome 2(CO2):

1. Explain the difference between narrowband and wideband spectrogram

2. What is prosody of speech?

Course Outcome 3(CO3):

1. What is MFCC?
2. Apply ACF/AMDF approaches for pitch estimation
Course Outcome 4(CO4): .
1. Apply sub-band approach for speech coding

2. What is the latest trends in machine learning for speech recognition?

Course Outcome 5(CO5):

1. What is absolute threshold of hearing?.

2. Explain two models for speech perception.

259 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B. TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: AIT 458

Course Name: Speech Processing and Analytics

Max.Marks:100
Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Define vowel triangle with a neat illustration. Mark the vertices in Hz.

2. Explain narrow-band spectrogram. What is the typical window length

used for computing narrow-band spectrogram?

3. Give equation to compute ZCR? Why it is not considered as a robust

parameter ?

4. How silence can be discriminated from speech using time domain

parameters?

5. What is Mel scale? What is frequency warping?

6. Explain autocorrelation method of LPC parameter estimation?

7. What is the concept of phase vocoder?

260 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

8. What is log-likelihood in speaker recognition model?

9. Differentiate spectral and temporal masking.

10. What is absolute threshold of hearing ?.

(10x3=30)

Part B

(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain speech production mechanism with a neat diagram (10)

(b) What are the basic speech units? How can you distinguish a voiced (4)
speech segment from an unvoiced speech segment?

OR

12. (a) Why speech signal is considered to be highly redundant? Assuming (10)
a speaker is producing 10 phonemes per second and there are 64
distinct phonemes, find the average information rate of speech
signal.

(b) Explain source filter model of speech production. What are the (4)
limitations of this model?

13. Give the equation for STFT. How can you use it to measure the (14)
formant frequencies of speech signal?

OR

14. a Explain with equations (9)

(a) Short time energy (b) ACF

261 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

b Are Short time energy and ACF parameters dependent on the (5)
window length used during analysis? Justify your answer.

15. a Derive Levinson-Durbin algorithm for LPC coefficients. How will (10)
you fix order of LPC?

b What is the effect of using a very high order for LPC? (4)

OR

16. What is liftering in cepstral processing? (4)

Explain the steps involved in MFCC computation. (10)

17. (a) How doesparametric resynthesis achieve speech enhancement? (8)

(b) Explain adaptive transform coding (6)

OR

18. (a) What is harmonic filtering? (6)

(b) What is implicit and explicit models of Language identification? (8)

19. (a) Explain basic anatomy of hearing system with a neat diagram. (7)
What you mean by tonotopic behaviour of basilar membrane?

(b) What is critical band structure? Differentiate between (7)

simultaneous and non-simultaneous masking.

OR

20. (a) Explain any three models of speech perception (7)

(b) Explain auditory filter banks with neat illustrations (7 )

262 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Plan

No. of
Lecture
No Contents Hours
(36 hrs)

Module-1 (6 hours)

1.1 1 hour
Speech Production:- Acoustic theory of speech production
1.2 Source/Filter model 1 hour

1.3 Pitch, Formant, Spectrogram 1 hour

1.4 Discrete model for speech production 1 hour

1.5 Articulatory Phonetics 1 hour

Acoustic Phonetics- Basic speech units and their

1.6 1 hour
classification.

Module-2 (6 hours)

2.1 Short-Time Speech Analysis, Windowing, STFT, 1 hour

2.2 Spectra of windows- Wide and narrow band spectrogram 1 hour

Time domain parameters (Short time energy, short time
2.3 1 hour
zero crossing Rate, ACF).
2.4 Frequency domain parameters 1 hour

2.5 Filter bank analysis. STFT Analysis 1 hour

2.6 Prosody of speech. 1 hour

Module-3 (7 hours)

3.1 Mel-frequency cepstral coefficient (MFCC)-computation 1 hour

3.2 Pitch Estimation ACF/AMDF approaches, 1 hour

Cepstral analysis- Pitch and Formant estimation using
3.3 1 hour
cepstral analysis
3.4 LPC Analysis -LPC model 1 hour

3.5 Auto correlation method 1 hour

3.6 Levinson Durbin Algorithm 2hours

263 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module-4 (9 hours)

4.1 Speech Enhancement: Spectral subtraction and Filtering, 1 hour

4.2 Harmonic filtering, parametric resynthesis. 1 hour

Speech coding: fundamentals, class of coders -Time
4.3 1 hour
domain/spectral domain/vocoders.
Sub band coding, adaptive transform coding, phase
4.4 1 hour
vocoder

4.5 Speaker Recognition: Speaker verification 1 hour

4.6 Speaker identification- log-likelihood. 1 hour

4.7 Language identification-implicit and explicit models. 1 hour

4.8 Machine learning models in Speaker Recognition -I 1 hour

4.9 Machine learning models in Speaker Recognition-II 1 hour

Module-5 (8 hours)

5.1 signal Processing models of audio perception 1 hour

Basic anatomy of hearing System: Basilar membrane

5.2 1 hour
behavior.

5.3 Sound perception: Auditory Filter Banks 1 hour

5.4 Critical Band Structure, Absolute Threshold of Hearing, 1 hour

5.5 Masking-Simultaneous Masking, 1 hour

5.6 Temporal Masking. 1 hour

5.7 Models of speech perception-I 1 hour

5.8 Models of speech perception-II 1 hour

264 | P a g e
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST458 SOFTWARE TESTING
PEC 2 1 0 3 2019

Preamble: This is a course in theoretical computer science that introduces the concepts and
methods in software testing. It covers various techniques for test case design used to test software
artifacts, including requirements, design, and code, the different techniques for test case design
based on graphs, programming language syntaxes and symbolic execution using PEX tool. It
enables the learners to follow a systematic software testing approaches while developing
applications.

Prerequisite: Nil

Course Outcomes: After the completion of the course the student will be able to:-

List a range of different software testing techniques and be able to apply specific unit
CO1 testing method to the projects using Junit.(Cognitive Knowledge Level:
Understand)
Illustrate using appropriate tools the mutation testing method for a given piece of code
CO2 to identify hidden defects that can’t be detected using other testing
methods.(Cognitive Knowledge Level: Apply)

CO3 Explain graph coverage criteria in terms of control flow graph and data flow graph
for a given program.(Cognitive Knowledge Level: Understand)

CO4 Demonstrate the importance of black-box approaches in terms of domain and

functional testing.(Cognitive Knowledge Level: Apply)

CO5 Illustrate the use of PEX tool with symbolic execution.(Cognitive Knowledge Level:
Apply)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO 9 PO10 PO11 PO12

CO1

CO2

CO3

CO4

CO5
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work

PO4 Conduct investigations of complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester Examination

Marks
Test 1 (Marks) Test 2 (Marks)

Remember 30 30 30

Understand 40 40 40

Apply 30 30 30

Analyze

Evaluate

Create

Mark Distribution

Total CIE ESE ESE

Marks Marks Marks Duration

150 50 100 3 hours

Page 266
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 questions from each module of which a student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Page 267
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Module - 1 (Introduction to Software Testing)
Some Popular Errors – Ariane 5, Therac 25, Intel Pentium Bug. What is Software testing? Why should it
be tested? Software Quality, Role of Testing. Testing Process - Level 0 thinking, Level 1 thinking, Level 2
thinking, Level 3 thinking, Level 4 thinking. Software Testing Terminologies - Verification, Validation
and Testing, Faults, Error and Bug, Test cases, Coverage Criteria. Types of Testing- Unit testing,
integration testing, System testing, Acceptance testing, Beta testing, Functional testing, Stress testing,
Performance testing, Usability testing and Regression testing. Testing Methods - Black Box testing, White
Box testing, Grey Box testing.

Module - 2 (Unit Testing)

Concept of Unit testing. Static Unit testing. Dynamic Unit testing - Control Flow testing, Data Flow
testing, Domain testing, Functional Program testing. Mutation testing - Mutation and Mutants, Mutation
operators, Mutation score. Junit - Framework for Unit testing. Case Study - Mutation testing using Junit
and Muclipse.

Module - 3 (Unit Testing - White Box Approaches)

Overview of Graph Coverage Criteria. Structural Graph Coverage Criteria - Node/vertex coverage, Edge
coverage, Edge pair coverage, Path coverage, Complete path coverage, Prime path coverage, Complete
round trip coverage, Simple round trip coverage. Data Flow Criteria - du paths, du pairs. Subsumption
Relationships among Graph Coverage Criteria. Graph Coverage for Source Code - Control flow graphs for
code, CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: Loops, CFG: Exceptions
(try-catch). Example program – Statistics. Graph Coverage for Design Elements - Call graphs and classes,
Class inheritance testing: Coverage criteria, Coverage criteria on inheritance graph, Data flow at the design
level, Inter-procedural DU pairs, Coupling du-pairs example. Example - Quadratic Root. Case Study -
Graph Based testing using JUnit Framework.

Module - 4 (Unit Testing - Black Box Approaches)

Domain Testing / Input Space Partitioning - Partitions of a set. Input domain modelling - Interface-based
approach, Functionality-based approach. Identifying values. Multiple partitions of the input domain - All
Combinations Coverage (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise Coverage,
Base Choice Coverage, Multiple Base Choices Coverage. TriTyp example. Functional Testing - Functional
Testing Concepts of Howden. Functional testing - Important Steps. Types of Functional testing -
Equivalence Class Partitioning, Boundary Value Analysis, Decision Tables, Random Testing. Case Study -
Black Box testing approaches using JUnit.

Page 268
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module - 5 (Grey Box Testing Approaches)

Introduction to Grey Box testing - Why Grey Box testing, Gray Box Methodology, Advantages and
Disadvantages. Techniques of Grey Box Testing - Matrix Testing, Regression Testing, Orthogonal Array
Testing or OAT, Pattern Testing. An Introduction to PEX - Parameterized Unit Testing, The Testing
Problem. Symbolic Execution – Example, Symbolic execution tree. PEX application Case Study – PEX.

Text Books
1. Paul Ammann and JeffOffutt , Introduction to Software Testing, Cambridge University Press
2. Kshirasagar Naik and Priyadarshi Tripathy, Software Testing And Quality Assurance: Theory And
Practice, Wiley.

Reference Materials
1. King, James C, “Symbolic Execution and Program Testing”, Association for Computing Machinery,
July 1976.

Sample Course Level Assessment Questions

Course Outcome 1 (CO1):
Explain the following types of testing methods with examples.
(i) Balck-box testing.
(ii) White-box testing.
(iii) Grey-box testing.
Course Outcome 2 (CO2):
Define 12 mutants for the following method power() using effective mutation operators. Try to use each
mutation operator at least once. Approximately, how many mutants do you think there would be, if all
mutants for power() were created?

public static int power (int left, int right)

{
//**************************************
// Raises Left to the power of Right
// precondition : Right >= 0
// postcondition: Returns Left**Right
//**************************************

Page 269
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

intrslt;
rslt = Left;
if (Right == 0)
{
rslt = 1;
}
else
{
for (int i = 2; i <= Right; i++)
rslt = rslt * Left;
}
return (rslt);
}
Course Outcome 3 (CO3):
Draw the control flow graph and data flow graph of given piece of code.
public static double ReturnAverage(int value[],int AS, int MIN, int MAX){
/*
Function: ReturnAverageComputes the averageof all those numbers in the input array in
the positive range [MIN, MAX]. The maximum size of the array is AS. But, the array size
could be smaller than AS in which case the end of input is represented by -999.
*/
int i, ti, tv, sum;
doubleav;
i = 0; ti = 0; tv = 0; sum = 0;
while (ti< AS && value[i] != -999) {
ti++;
if (value[i] >= MIN && value[i] <= MAX) {
tv++;
sum = sum + value[i];
}
i++;
}

Page 270
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

if (tv> 0)
av = (double)sum/tv;
else
av = (double) -999;
return (av);
}
Course Outcome 4 (CO4):
Explain the following with examples.
1. Input domain modelling.
2. All Combinations Coverage (ACoC)
3. Each Choice Coverage (ECC)
4. Pair-wise Coverage
5. T-wise Coverage
6. Base Choice Coverage
7. Multiple Base Choices Coverage.
Course Outcome 5 (CO5):
Draw the symbolic execution tree for the following program code and explain the symbolic
execution of testme (α1, α2).
int twice (int v) {
return 2 ∗ v;
}
void testme (int x, int y ) {
z = twice ( y);
if ( z == x ){
if ( x > y + 10)
ERROR;
}
}
int main() {
x = sym input();
y = sym input();
testme ( x , y);

Page 271
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

return(0);

Model Question Paper

QP CODE: PAGES: 3

Reg No: Name :

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST458

Course Name: Software Testing

Max.Marks:100 Duration: 3 Hours

PART A
Answer all Questions. Each question carries 3 Marks

1. Explain the differences between Validation and Verification?

2. Explain the differences between Fault, Error, and Bug?

3. Define Ground string, Mutation score, and Mutants?

4. What are the functions of Test driver and Test stubs in dynamic unit testing?

5. Define Node coverage, Edge coverage and Prime path coverage in a control flow
graph?

6. What are du paths and du pairs in a data flow graph?

7. Explain the two approaches in input domain modelling?

8. Explain the difference between Equivalence Class Partitioning and Boundary

Value Analysis?

9. Briefly explain three techniques of Grey box testing?

10. Explain the concept of symbolic execution with the help of a toy example?
(10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Explain the following types of testing

Page 272
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

(i) Black Box testing (ii) White Box testing (iii) GreyBox testing (14)
(iv) Unit testing (v) Integration testing (vi) System testing (vii) Acceptance
testing

OR

12. (a) Explain the following coverage criterias based on the code fragment given
below? (i) Functional coverage (ii) Statement coverage (iii)Conditional (8)
coverage (iv)Branch coverage
int foo (int x, int y){
int z = 0;
if ((x > 0) && (y > 0)){
z = x;}
return z;
}

(b) Write positive and negative test cases for an ATM Machine? (6)

13. (a) Explain Dynamic unit test environment with a neat figure.
(8)

(b) Explain the major difference between control flow testing and data flow
testing. (6)

OR

14. (a) Explain seven types of mutation operators with neat examples? (14)

15. (a) Explain touring, side trips and detours with a neat example (7)

(b) Explain simple path coverage and prime path coverage with the help of CFG (7)
given below? 1

2 3

OR

Page 273
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

16. (a) Draw CFG fragment for

(7)
(i) Simple if (ii) Simple while loop (iii) Simple for loop

(b) Explain the following concepts with examples? (7)

(i)Call graph (ii) Inheritance graph (iii) Coupling du-pairs
17. (a) What are the four important steps in functional testing? (7)

(b) Briefly explain input domain modelling approaches? (7)

OR

18. (a) Consider the triangle classification program with a specification: (6)
The program reads floating values from the standard input. The three values
A, B, and C are interpreted as representing the lengths of the sides of
triangle. The program then prints a message to the standard output that states
whether the triangle, if it can be formed, is scalene, isosceles, equilateral,
orright angled. Determine the following for the above program:
(i) For the boundary condition A +B > C case (scalene triangle),
identify test cases to verify the boundary.
(ii) For the boundary condition A = C case (isosceles triangle), identify
testcases to verify the boundary.
(iii) For the boundary condition A = B = C case (equilateral triangle),
identify testcases to verify the boundary.

(b) Develop a decision table to generate test cases for this specification. (8)

19. (a) Explain the importance of grey box testing, its advantages and disadvantages? (9)

(b) Explain the concept of symbolic execution tree? (5)

OR

20. (a) Consider the code fragment given below: - (7)

1. POWER: PROCEDURE(X, Y);

2. Z ← 1;

Page 274
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. J ← 1;
4. LAB: IF Y ≥ J THEN
5. DO; Z← Z * X;
6. J ← J + 1;
7. GO TO LAB; END;
8. RETURN (Z) ;
9. END;
a) Explain Symbolic execution of POWER (αl, α2).

(b) Explain Execution tree for POWER (αl, α2). (7 )

TEACHING PLAN

No Contents No of
Lecture Hrs
(35 hrs)

Module 1 (Introduction to Software Testing) -(7 Hours)

1.1 Some Popular Errors– Ariane 5, Therac 25, Intel Pentium Bug. 1 Hour

What is Software testing? Why should it be tested? Software Quality,

1.2 Role of Testing. 1 Hour

Testing Process - Level 0 thinking, Level 1 thinking, Level 2 thinking,

1.3 Level 3 thinking, Level 4 thinking. 1 Hour

Software Testing Terminologies- Verification, Validation and Testing,

1.4 Faults, Error and Bug, Test cases, Coverage Criteria. 1 Hour

Types of Testing- Unit testing, integration testing, System testing,

1.5 Acceptance testing, Beta testing 1 Hour

Functional testing, Stress testing, Performance testing, Usability testing

1.6 and Regression testing. 1 Hour

Testing Methods - Black Box testing, White Box testing, Grey Box
1.7 testing. 1 Hour

Module 2 (Unit testing)- (6 Hours)

2.1 Concept of Unit testing, Static Unit Testing 1 Hour

Page 275
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Dynamic Unit testing - Control Flow testing, Data Flow testing, Domain
2.2 testing, Functional Program testing. 1 Hour

Mutation testing - Mutation and Mutants, Mutation operators, Mutation

2.3 score. 1 Hour

2.4 Junit - Framework for Unit testing. 1 Hour

2.5 Case Study - Mutation testing using Junit 1 Hour

2.6 Case Study - Mutation testing using Muclipse 1 Hour

Module 3 (Unit Testing:- White Box Approaches)- (8 Hours)

Structural Graph Coverage Criteria - Node/vertex coverage, Edge

3.1 coverage, Edge pair coverage, Path coverage 1 Hour

Complete path coverage, Prime path coverage, Complete round trip

3.2 coverage, Simple round trip coverage. 1 Hour

3.3 Data Flow Criteria - du paths, du pairs 1 Hour

3.4 Subsumption Relationships among Graph Coverage Criteria 1 Hour

Graph Coverage for Source Code – Control Flow Graphs (CFG) for code,
3.5 CFG: If statement, CFG: If statement with return, CFG: Switch-case, 1 Hour
CFG: Loops, CFG: Exceptions (try-catch). Example program - Statistics
Graph Coverage for Design Elements – Structural graph coverage and
3.6 data flow graph coverage for design elements 1 Hour

3.7 Case Study - Graph Based testing using JUnit Framework. (Lecture 1) 1 Hour

3.8 Case Study - Graph Based testing using JUnit Framework. (Lecture 2) 1 Hour

Module 4 (Unit Testing:- Black Box Approaches) -(7 Hours)

4.1 Domain Testing / Input Space Partitioning - Partitions of a set. 1 Hour

Input domain modelling - Interface-based approach, Functionality-based

4.2 approach. 1 Hour

Page 276
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Multiple partitions of the input domain - All Combinations Coverage

4.3 (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise 1 Hour
Coverage, Base Choice Coverage, Multiple Base Choices Coverage.
Functional Testing - Functional Testing Concepts of Howden.
4.4 Important Steps. 1 Hour

Types of Functional testing - Equivalence Class Partitioning, Boundary

4.5 Value Analysis 1 Hour

4.6 Decision Tables, Random Testing. 1 Hour

4.7 Case Study - Black Box testing approaches using JUnit. 1 Hour

Module 5 (Grey Box Testing Approaches)- (7 Hours)

Introduction to Grey Box testing - Why Grey Box testing, Gray Box
5.1 Methodology, Advantages and Disadvantages. 1 Hour

Techniques of Grey Box Testing - Matrix Testing, Regression Testing,

5.2 Orthogonal Array Testing or OAT, Pattern Testing. 1 Hour

An Introduction to Pex - Parameterized Unit Testing, The Testing

5.3 Problem. 1 Hour

5.4 Symbolic Execution – Example, Symbolic execution tree. 1 Hour

5.5 Case Study – PEX (Lecture 1) 1 Hour

5.6 Case Study – PEX (Lecture 2) 1 Hour

5.7 Case Study – PEX (Lecture 3) 1 Hour

Page 277
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
CATEGORY L T P CREDIT
CST468 BIOINFORMATICS INTRODUCTION

PEC 2 1 0 3 2019

Preamble: This course helps the learners to understand the fundamental concepts in Molecular
Biology, Genomics, Proteomics and Modelling. This course introduces bio macromolecules such
as genes and proteins, different biological databases, and tools and algorithms for biological data
processing, analysis and interpretation, and the elements of the systems approach to Molecular
Biology. This course enables the learners to contribute towards drug discovery and
computational analysis and modelling of biological process.

Prerequisite: Basic background in higher secondary biology

Course Outcomes: After the completion of the course, the student will be able to

CO 1 Describe the basic concepts of Bioinformatics with an emphasis on structure, function

and synthesis of biomolecules (Cognitive knowledge level : Understand)

CO 2 Identify biological data formats and databases, retrieve bio-sequences, and align bio-
sequences to identify similarity (Cognitive knowledge level : Apply)

CO 3 Employ similarity searching tools and algorithms to align sequences to highlight the
similarity, and describe the structure of genes (Cognitive knowledge level : Apply)

CO 4 Demonstrate Protein Structure, visualize protein structure using tools, and explain how
proteins interact (Cognitive knowledge level : Apply)

CO 5 Explain the fundamental aspects of Systems Biology, Computational Modeling and

properties of models (Cognitive knowledge level : Understand)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

Page 278
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CO4

CO5

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Bloom’s Category Continuous Assessment Tests End Semester

Test1 (%) Test2 (%) Examination
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create

Mark Distribution

Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Page 279
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Continuous Internal Evaluation Pattern:

Attendance 10 marks

Continuous Assessment Tests (Average of Series Tests 1& 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test
shall be preferably conducted after completing the first half of the syllabus and the second
series test shall be preferably conducted after completing remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly completed module), each with 7 marks. Out
of the 7 questions, a student should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Page 280
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus
Module-1 (Introduction to bioinformatics)

Introduction to bioinformatics, Nature & Scope of Bioinformatics, DNA, RNA, and Protein: The
Central Dogma, Messenger RNA, tRNA, rRNA, Genetic code, Gene Structure and Control,
Transcription, translation

Module-2 (Introduction to bio sequences and analysis)

Introduction to Biological Databases, NCBI, Genbank, Bio sequence formats- FASTA, Sequence
alignment- Global Alignment and Local Alignment, Dot Matrix Method, Dynamic Programming
Method, Gap Penalties, Amino Acid Scoring Matrices - PAM and BLOSUM

Module-3 (Database Similarity Searching and genomics)

Database Similarity Searching, BLAST – Variants -BLASTN, BLASTP, BLASTX, Statistical

Significance, Needleman and Wunsch and Smith–Waterman Method, Multiple Sequence
Alignment, scoring function, Clustal, introduction to structure of prokaryotic and eukaryote
gene

Module-4 (Proteomics)

Protein Structure, Ramachandran Plot, Hierarchies of Protein Structure, Determination of Protein

three-dimensional structure, protein structure database-PDB, Protein structure visualization,
introduction to Protein protein interaction, STRING database

Module-5 (Systems Biology)

Introduction to Systems Biology, Models and Modelling, Properties of models, Systems state
and steady state, Variables, Parameters, and Constants in modelling, Purpose and Adequateness
of Models, Advantages of Computational Modelling, Model Development, Network Versus
Elements, Modularity, Robustness and Sensitivity, Data Integration

Text books

1. Zvelebil, Marketa J., and Jeremy O. Baum. Understanding bioinformatics. Garland Science,
2007.
2. Xiong, Jin. Essential bioinformatics. Cambridge University Press, 2006.
3. Klipp, E., Herwig, R., Kowald, A., Wierling, C., &Lehrach, H. Systems biology in practice:
concepts, implementation and application. John Wiley & Sons. 2005
References

1. Baxevanis, Andreas D., Gary D. Bader, and David S. Wishart, eds. Bioinformatics. John
Wiley & Sons, 2020.
2. Shaik, Noor Ahmad, et al. Essentials of Bioinformatics, Volume I. Springer, 2019

Page 281
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3. Selzer, Paul M., Richard J. Marhöfer, and Andreas Rohwer, Applied bioinformatics. An
introduction–Springer, Verlag,, 2008.
4. S C Rastogi, N Mendiratta and PRastogi, Bioinformatics: Methods and Applications , PHI
Learning Private Limited, New Delhi, 2015.
5. D E Krane and M L Raymer, Fundamental Concepts of Bioinformatics, Pearson Education,
2006.
6. Andreas D.Baxevanis, B F Francis Ouellette, Bioinformatics - A Practical Guide to the
Analysis of Genes and Proteins, Third Edition, John Wiley & Sons INC. , U.K. 2006
7. Neil C Jones and Pavel A Pevzner, An Introduction to Bioinformatics Algorithms, MIT press,
2004.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Compare and contrast the DNA and RNA on the basis of structure and functions.
2. Demonstrate with the help of a flow diagram the generation of protein using the
transcription and translation process.
Course Outcome 2 (CO2):
1. Download DNA sequence of human insulin form NCBI
2. Identify the following qualifiers for GenBank and give their definitions: [ACCN],
[ALL], [AUTH], [ECNO], [FKEY], [GENE], [JOUR], [KYWD]
3. Construct a dot plot and find the sequence alignment between the following two
sequences:
Sequence1: GATTCTATCTAACTA, Sequence2: GTTCTATTCTAAC
Course Outcome 3 (CO3):
1. Apply Needleman-Wunsch Algorithm to perform sequence alignment for the following
sequences: CGTGAATTCAT (sequence #1), GACTTAC (sequence #2)
2. Construct a BLAST procedure for sequence alignment(HSP) if a sequence and its
corresponding database sequence are given. Assume the necessary data and demonstrate
the procedure.
Course Outcome 4 (CO4):
1. Differentiate between the different protein molecular structure visualizations. Also
mention the advantages and uses of each visualization technique.
2. Make use of an example and demonstrate the steps in protein comparison. Show how
root mean square deviationis calculated while comparing two proteins.
Course Outcome 5 (CO5):
1. Explain how systems biology is used in data integration.
.
2. Explain the process of model development

Page 282
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:
Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST468
Course Name: Bioinformatics
Max. Marks : 100 Duration: 3 Hours
PART A
Answer All Questions. Each Question Carries 3 Marks
1. Differentiate DNA, Gene, genome and chromosome.

2. What are the functions of mRNA, tRNA and rRNA?

3. What do you mean by Gene expression?

4. Write difference between local and global alignment.

5. Write short note on Gap penalties and its usage in comparing Biological
sequences.

6. List any three typesof BLAST and make short description on each.

7. What are the principle underlying the formation of Ramachandran plot?.

8. What are the experimental methods for determining protein structure?

9. What do you mean by steady state in a biological system.

10. Justify the statement - systems are modular. (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)
11. (a) What is the central dogma of molecular biology? (6)
(b) Explain the steps involved in the process of transcription. How is the primary (8)
transcript produced by a prokaryote different from that produced by a
eukaryotic cell?

Page 283
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

OR
12. (a) Discuss translation process in protein synthesis. (6)
(b) Explain bio-molecules involved in central dogma, its structure and types. (8)
13. (a) Explain the importance of Primary and secondary databases in (6)
Bioinformatics

(b) Illustrate the methods of pairwise sequence alignment. What is the use of (8)
assigning gap penalties in alignment?

OR
14. (a) Illustrate sequence alignment. What are the applications of sequence (7)
alignment in Bioinformatics?
(b) What is the use of scoring matrices? Differentiate between PAM and (7)
BLOSUM matrices and its usage in alignment.

15. (a) Using Needleman and Wunsch dynamic programming method, construct the (9)
partial alignment score table for the following two sequences, using the
scoring parameters: match score: +5, mismatch score: -1, gap penalty: -2.
CCATGCU
GATTACA
Also write down the optimal global alignment between these sequences along
with the optimal score.
(b) Interpret the blast result and statistical significance of the alignment by (5)
analyzing the results.

OR
16. (a) Using Smith Waterman method construct the partial alignment scoring table (9)
and obtain the optimal local alignment of the following two sequences:
ACGTATCGCGTATA
GATGCTCTCGGAJAA
(b) Illustrate multiple sequence alignment. (5)
17. (a) Discuss hierarchies of protein structure. (6)
(b) Explain how the protein structure is determined by using experimental (8)
techniques.

OR
18. (a) Discuss protein interaction. How it contributes to the complexity of an (9)
organism?

(b) Discuss on Protein Structure Database. (5)

Page 284
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

19. (a) Discuss systems biology approach of understanding complex biological (6)
systems.
(b) Explain on Variables, Parameters, and Constants in modeling biological (8)
systems.

OR
20. (a) Explain on advantages of Computational Modeling of biological system. (7)
(b) What are the properties of models in biological system? (7 )

TEACHING PLAN

No Contents No of Lecture
(36 Hrs)
Module-1 (Introduction to bioinformatics)(8 hrs)
Text 1 (Relevant topics from chapter 1.1, 1.2, 1.3)

1.1 Introduction to bioinformatics 1

1.2 Nature & Scope of Bioinformatics 1

1.3 DNA, RNA, and Protein 1

1.4 The Central Dogma introduction 1

1.5 Messenger RNA, tRNA, rRNA, 1

1.6 Genetic code, 1

1.7 Gene Structure and Control 1

1.8 Transcription, Translation 1

Module-2 (Introduction to bio sequences and analysis) (7 hrs)

Text 2 (Relevant topics from chapter 2, 3)

2.1 Introduction to Biological Databases 1

2.2 NCBI Sequence retrieval 1

2.3 Genbank, Bio sequence formats- FASTA 1

2.4 Sequence alignment- Global Alignment and Local Alignment 1

2.5 Dot Matrix Method, Dynamic Programming Method 1

Page 285
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

2.6 Gap Penalties 1

2.7 Amino Acid Scoring Matrices – PAM, BLOSUM 1

Module-3 (Database Similarity Searching and genomics) (7 hrs)

Text 2 (Relevant topics from chapter 4 5 and 8)

3.1 Database Similarity Searching, BLAST, Variants of BLAST - 1

BLASTN, BLASTP, BLASTX

3.2 BLAST Analysis - Statistical Significance 1

3.3 Needleman and Wunsch Method 1

3.4 Smith–Waterman Method 1

3.5 Multiple Sequence Alignment, scoring function 1

3.6 Clustal tool 1

3.7 Gene Structure of prokaryotic, eukaryote 1

Module-4 (Proteomics) (7 hrs)

Text 2 (Relevant topics from chapter 12, 13 and 19)
4.1 Protein Structure, Ramachandran Plot 1
4.2 Hierarchies of Protein Structure 1
4.3 Determination of Protein three-dimensional structure 1
4.4 protein structure database-PDB 1
4.5 Protein structure visualization 1
4.6 Protein protein interaction 1
4.7 Protein protein interaction networks, STRING database 1
Module-5 (Systems Biology) (7 hrs)
Text 3 (Relevant topics from Section 1.1-1.4)

5.1 Introduction to Systems Biology, Properties of models 1

5.2 Systems state and steady state 1
5.3 Variables, Parameters, and Constants in modelling 1
5.4 Purpose and Adequateness of Models 1
5.5 Advantages of Computational Modelling ,Model Development 1
(introduction only)
5.6 Network Versus Elements, Modularity, 1
5.7 Robustness and Sensitivity, Data Integration 1

Page 286
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
COMPUTATIONAL CATEGORY L T P CREDIT INTRODUCTION
CST478 LINGUISTICS
PEC 2 1 0 3 2019

Preamble: The course aims to teach the basics of Computational Linguistics to the students
viewing language phenomena from a computational/statistical standpoint. This involves ideas about
statstical and computational models and how these could be linked with various language
processing tasks. The course helps the learner to appreciate the complexities involved in language
processing tasks using a machine, in contrast with the ease with which human beings handle them.
Some practical aspects are also discussed using the Python and NLTK framework to equip the
student with the capability to design solutions to linguistic problems.

Prerequisite: Nil
Course Outcomes: After the completion of the course the student will be able to

CO# CO

Explain the fundamental concepts of language processing (Cognitive

CO1 Knowledge Level: Understand)

CO2 Demonstrate the concepts of probability, statistical inference and hidden

Markov model. (Cognitive Knowledge Level: Apply)

Compare and summarize the various methods of word sense disambiguation,

lexical acquisition and selectional preferences. (Cognitive Knowledge
CO3
Level: Apply)

Make use of different Part-of-Speech Tagging methods for language

CO4 modelling. (Cognitive Knowledge Level: Apply)

Examine Probabilistic Context Free Grammars and various probabilistic

CO5 parsing methods (Cognitive Knowledge Level: Apply)

Develop simple systems for linguistic tasks using Python and NLTK.
CO6
(Cognitive Knowledge Level: Apply)

Page 288
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5

CO6

Abstract POs defined by National Board of

Accreditation
PO# Broad PO# Broad
PO PO
PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work
solutions
Conduct investigations of
PO4 complex problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern
Continuous Assessment Tests
Bloom’s End Semester Examination
Category Marks (%)
Test 1 Test 2
(%) (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate

Page 289
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Create

Mark Distribution

Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3Hrs

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Page 290
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Syllabus

Module- 1 (Preliminaries)
Introduction: Rationalist and Empiricist Approaches to Language-Questions that linguistics
should answer-Noncategorical phenomena in language-Language and cognition as
probabilistic phenomena
The Ambiguity of Language: Why natural language processing is difficult-Lexical resources-
Word counts-Zipf’s laws-Collocations-Concordances
Linguistic Essentials:
Parts of Speech and Morphology -Nouns and pronouns-Words that accompany nouns:
Determiners and adjectives-Verbs-Other parts of speech-Phrase Structure-Phrase structure
grammars -Semantics and Pragmatics-Corpus Based Work

Module -2 (Mathematical Essentials:)

Probability Theory-Probability spaces-Conditional probability and independence-Bayes'
theorem-Random variables-Expectation and variance-Notation-Joint and conditional
distributions-Standard distributions-Bayesian statistics
Statistical Inference: n-gram Models over Sparse Data-Bins: Forming Equivalence Classes-
Reliability vs discrimination-n gram models
Markov Models-Hidden Markov Models-Why use HMMs?-General form of an HMM-
Finding the probability of an observation-Finding the best state sequence

Module -3 (Word Sense Disambiguation)

Methodological Preliminaries- Supervised and unsupervised learning-Pseudowords-Upper
and lower bounds on performance-Supervised Disambiguation-Bayesian classification-
Dictionary based Disambiguation-Disambiguation based on sense definitions-Thesaurus
based disambiguation
Lexical Acquisition-Evaluation Measures-Verb Subcategorization -Attachment
Ambiguity-PP attachment- Selectional Preferences
Semantic Similarity: Vector space measures-Probabilistic measures

Module -4 (Grammar)
Part-of-Speech Tagging-The Information Sources in Tagging-Markov Model Taggers-
Hidden Markov Model Taggers-Applying HMMs to POS tagging-The effect of initialization
on HMM training-Transformation Based Learning of Tags

Probabilistic Context Free Grammars-Some Features of PCFGs-Questions for PCFGs -The

Probability of a String -Using inside probabilities-Using outside probabilities-Finding the
most likely parse for a sentence-parsing for disambiguation-parsing model versus language
model

Page 291
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Module -5 (Language Processing with Python)

Introduction to NLTK, Text Wrangling and Text cleansing : Sentence Splitter, Tokenization,
Stemming, Lemmatization, Stop word removal , Rare word Removal, Spell Correction. Part
of Speech Tagging and NER. Parsing Structure in Text: Shallow versus deep parsing,
different types of parsers and dependency parsing.

Text Books :
1. C.D. Manning and H. Schutze. Foundations of Statistical Natural Language
Processing. MIT Press.
2. Steven Bird, ‎Ewan Klein, ‎Edward Loper, Natural Language Processing with Python and
NLTK. O’reilly Pub.
References:
1. D. Jurafsky and J.H. Martin: Speech and Language Processing: Introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition, PHI.
2. James Allen: Natural Language Understanding. Pearson Pub.
3. Nitin Hardeniya, Jacob Perkins, Deepti Chopra, Nisheeth Joshi, ItiMathur: Natural
Language Processing: Python and NLTK., 1stEdition. Packt Publishing

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. What do you understand by the term collocations? List their properties.
2. Define the term phrase structure grammar formally.
Course Outcome 2 (CO2):
1. State Bayes’ theorem and explain briefly. Comment on it’s usefulness in NLP.
2. How can n-grams be used to model natural language statistically?
Course Outcome 3 (CO3):
1. What is meant by attachment ambiguity? Show it using English sentences
2. What is meant by Word Sense Disambiguation (WSD)? Outline any one WSD
algorithm
Course Outcome 4 (CO4):
1. How can HMM be used for Parts of speech tagging?
2. Outline an implementation procedure for HMM
Course Outcome 5 (CO5):
1. Show with an example how can probabilistic grammars be used to model human
preferences in parsing.
2. Give the technique of Transformation-Based Learning of Tags
Course Outcome 6 (CO6):
1. Implement a python program for stop word removal in a simple paragraph.
2. Write a code to access a weather site and extract the forecast top temperature for your
town or city today.

Page 292
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST478

Course Name: Computational Linguistics

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1. Define Zipf's law.

2. List the uses of a corpus in language processing?

3. What is a Hidden Markov Model?

4. State Bayes’ theorem and explain briefly. Comment on its usefulness in NLP.

5. What is meant by supervised disambiguation? What are its prerequisites ?

6. Consider the sentence: "the children ate the cake with a spoon". Construct the
parse tree for it and explain the attachment ambiguity.

7. Discuss the properties of Markov chain useful in POS tagging.

8. Explain the features of PCFG.

9. What is NLTK? How is it useful in text processing ?

10. Write a Python program to extract different date formats from a text document.
(10x3=30)

Page 293
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11. (a) Write a note on the following terms with example: (9)
(i) Collocations (ii) Concordances (iii) Phrase structure grammars

(b) Differentiate stemming and lemmatization with examples. (5)

OR

12. (a) Write a note on all parts of speech tags of English language (9)

(b) What are the differences between Rationalist and Empiricist to Language (5)
approaches

13. (a) What do you mean by a probability distribution? (5)

What are the approaches used in SNLP to estimate probability distribution of
linguistic events?

(b) Give a formal definition of Hidden Markov Model (HMM) and state the (9)
relevant assumption while using HMM for language modeling

OR

14. (a) Assume that a particular type of syntactic error detected by a system A occurs (5)
once in 1,00,000 sentences on an average. This system detects an error
correctly with a probability 0.05. Suppose the system reports an error in a test
sentence. What is the probability that this is true?

(b) List some of the problems associated with sparse data in SNLP. (9)
Write a note on n-gram Models over Sparse Data

15. (a) What do you understand by Disambiguation based on sense definitions. (9)
Write and explain any one algorithm for this.

(b) With the help of Bayes’ rule, explain the Bayesian disambiguation algorithm. (5)

OR

16. (a) Write a note on selectional preferences with an example (5)

(b) What is meant by attachment ambiguity? List different attachment issues. (9)

Page 294
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

17. (a) Write a note on Transformation-Based Learning of tags. Give it’s algorithm (9)

(b) How can HMM be used for parts of speech tagging (5)

OR

18. (a) Write the formal definition of PCFG. (5)

Apply probabilistic parsing on the following sentence and find the
correct parsing using the given grammar
Sentence: Astronomers saw stars with ears.
Probabilistic grammar:

(b) How do you find the probability of a string using inside and outside (9)
probabilities ?

19. (a) Write a Python program for PoS tagging using the necessary Python (9)
packages.

(b) Explain the process of Named Entity Recognition. (5)

List its uses and challenges involved.

OR

20. (a) Write a regular expression for removing punctuations, numbers and white (9)
spaces in a piece of text.

(b) Write a Python program to count the number of sentences, words and line (5)
numbers in a given piece of text. Display each sentence along with that.

Page 295
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

TEACHING PLAN

No Contents No of
Lecture Hrs
(36 hrs)
Module - 1 (Preliminaries) (9 hrs)

1.1 Introduction: Rationalist and Empiricist Approaches to Language- 1

Questions that linguistics should answer-
1.2 Non-categorical phenomena in language-Language and cognition as 1
probabilistic phenomena
1.3 The Ambiguity of Language: Why natural language processing is 1
difficult
1.4 Lexical resources-Word counts 1
1.5 Zipf’s laws-Collocations-Concordances 1
1.6 Linguistic Essentials: Parts of Speech and Morphology -Nouns and 1
pronouns
1.7 Words that accompany nouns: Determiners and adjectives-Verbs-Other 1
parts of speech
1.8 Phrase Structure-Phrase structure grammars 1
1.9 Semantics and Pragmatics-Corpus Based Work 1
Module – 2 (Mathematical Essentials) (7 hrs)
2.1 Probability Theory-Probability spaces 1
2.2 Conditional probability and independence-Bayes' theorem 1
2.3 Random variables-Expectation and variance-Notation 1
2.4 Joint and conditional distributions-Standard distributions- 1
Bayesian statistics
2.5 Statistical Inference: n-gram Models over Sparse Data-Bins: Forming 1
Equivalence Classes
2.6 Markov Models-Hidden Markov Models: Why use HMMs? 1
2.7 General form of an HMM-Finding the probability of an observation- 1
Finding the best state sequence
Module – 3 (Word Sense Disambiguation) (7 hrs)
3.1 Methodological Preliminaries-Supervised and unsupervised learning 1
3.2 Upper and lower bounds on performance-Supervised Disambiguation 1
3.3 Bayesian classification-Dictionary based Disambiguation- 1
3.4 Disambiguation based on sense definitions-Thesaurus based 1
disambiguation
3.5 Lexical Acquisition-Evaluation Measures 1

Page 296
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3.6 Verb Subcategorization-Attachment Ambiguity, PP attachment- 1

Selectional Preferences
3.7 Semantic Similarity:Vector space measures-Probabilistic measures 1

Module – 4 (Grammar) (8 hrs)

4.1 Part-of-Speech Tagging-The Information Sources in Tagging 1
4.2 Markov Model Taggers-Hidden Markov Model Taggers- 1
4.3 Applying HMMs to POS tagging-The effect of initialization on 1
HMM training-
4.4 Transformation-Based Learning of Tags 1
4.5 Probabilistic Context Free Grammars-Some Features of PCFGs 1
4.6 Questions for PCFGs 1
4.7 The Probability of a String -Using inside probabilities 1
Using outside probabilities
4.8 Finding the most likely parse for a sentence-parsing for 1
disambiguation, parsing model vs. language model
Module - 5 (Language Processing with Python) ( 5 hrs)
5.1 Introduction to NLTK 1
5.2 Text Wrangling and Text cleansing : Sentence Splitter, 1
Tokenization, Stemming,
5.3 Lemmatization, Stop word removal , Rare word Removal, Spell 1
Correction.
5.4 Part of Speech Tagging and NER. 1
5.5 Parsing Structure in Text: Shallow versus deep parsing, types of 1
parsers

Page 297
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CATEGORY L T P CREDIT YEAR OF

AMT 404 COMPREHENSIVE INTRODUCTION
COURSE VIVA PCC 1 0 0 1 2019

The objective of this Course viva is to ensure the basic knowledge of each student in the most
fundamental core courses in the curriculum. The viva voce shall be conducted based on the core
subjects studied from third to eighth semester. This course helps the learner to become competent in
placement tests and other competitive examinations.

Guidelines

1. The course should be mapped with a faculty and classes shall be arranged for practicing
questions based on the core courses listed in the curriculum.
2. The viva voce will be conducted by the same three member committee assigned for final
project phase II evaluation. It comprises of Project coordinator, expert from
Industry/research Institute and a senior faculty from a sister department.
3. The pass minimum for this course is 25.
4. The mark will be treated as internal and should be uploaded along with internal marks of
other courses.
5. Comprehensive Viva should be conducted along with final project evaluation by the three
member committee.

Mark Distribution
Total marks: 50, only CIE, minimum required to pass : 25

298
Page 298
296
7
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

CATEGORY L T P CREDIT
AMD416 PROJECT PHASE II
PWS 0 0 12 4

Preamble: The course ‘Project Work’ is mainly intended to evoke the innovation and invention
skills in a student. The course will provide an opportunity to synthesize and apply the knowledge
and analytical skills learned, to be developed as a prototype or simulation. The project extends to
2 semesters and will be evaluated in the 7th and 8th semester separately, based on the achieved
objectives. One third of the project credits shall be completed in 7th semester and two third in 8th
semester. It is recommended that the projects may be finalized in the thrust areas of the
respective engineering stream or as interdisciplinary projects. Importance should be given to
address societal problems and developing indigenous technologies.

Course Objectives
 To apply engineering knowledge in practical problem solving.
 To foster innovation in design of products, processes or systems.
 To develop creative thinking in finding viable solutions to engineering problems.

Course Outcomes [COs]: After successful completion of the course, the students will be able to:

Model and solve real world problems by applying knowledge across domains
CO1
(Cognitive knowledge level: Apply).
Develop products, processes or technologies for sustainable and socially relevant
CO2
applications (Cognitive knowledge level: Apply).
Function effectively as an individual and as a leader in diverse teams and to
CO3
comprehend and execute designated tasks (Cognitive knowledge level: Apply).
Plan and execute tasks utilizing available resources within timelines, following ethical
CO4
and professional norms (Cognitive knowledge level: Apply).
Identify technology/research gaps and propose innovative/creative solutions
CO5
(Cognitive knowledge level: Analyze).
Organize and communicate technical and scientific findings effectively in written and
CO6
oral forms (Cognitive knowledge level: Apply).

Mapping of course outcomes with program outcomes

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

CO1 2 2 2 1 2 2 2 1 1 1 1 2

CO2 2 2 2 1 3 3 1 1 1 1

CO3 3 2 2 1

CO4 2 3 2 2 3 2

CO5 2 3 3 1 2 1

CO6 2 2 2 3 1 1

Page 299
299 297
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO # Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics
PO3 Design/Development of solutions PO9 Individual and team work

Conduct investigations of
PO4 complex problems PO0 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

PROJECT PHASE II

Phase 2 Targets

 In depth study of the topic assigned in the light of the report prepared under Phase - I;
 Review and finalization of the approach to the problem relating to the assigned topic.
 Preparing a detailed action plan for conducting the investigation, including teamwork.
 Detailed Analysis/ Modeling / Simulation/ Design/ Problem Solving/Experiment as
needed.
 Final development of product/ process, testing, results, conclusions and future
directions.
 Preparing a paper for Conference Presentation/ Publication in Journals, if possible.
 Presenting projects in Project Expos conducted by the University at the cluster level
and/ or state level as well as others conducted in India and abroad.
 Filing Intellectual Property Rights (IPR) if applicable.
 Preparing a report in the standard format for being evaluated by the Department
Assessment Board.
 Final project presentation and viva voce by the assessment board including the
external expert.

Evaluation Guidelines & Rubrics

Total: 150 marks (Minimum required to pass: 75 marks).

 Project progress evaluation by guide: 30 Marks.
 Two interim evaluations by the Evaluation Committee: 50 Marks (25 marks for each
evaluation).
 Final evaluation by the Final Evaluation committee: 40 Marks
 Quality of the report evaluated by the evaluation committee: 30 Marks

(The evaluation committee comprises HoD or a senior faculty member, Project coordinator
and project supervisor. The final evaluation committee comprises of Project coordinator,
expert from Industry/research/academic Institute and a senior faculty from a sister
department).

300Page 300
298
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Evaluation by the Guide

The guide/supervisor must monitor the progress being carried out by the project groups on
regular basis. In case it is found that progress is unsatisfactory it should be reported to the
Department Evaluation Committee for necessary action. The presence of each student in the
group and their involvement in all stages of execution of the project shall be ensured by the
guide. Project evaluation by the guide: 30 Marks. This mark shall be awarded to the students in
his/her group by considering the following aspects:

Project Scheduling & Distribution of Work among Team members: Detailed and extensive
Scheduling with timelines provided for each phase of project. Work breakdown structure well
defined. (5)

Literature survey: Outstanding investigation in all aspects. (4)

Student’s Diary/ Daily Log: The main purpose of writing daily diary is to cultivate the habit of
documenting and to encourage the students to search for details. It develops the students’ thought
process and reasoning abilities. The students should record in the daily/weekly activity diary the
day to day account of the observations, impressions, information gathered and suggestions given,
if any. It should contain the sketches & drawings related to the observations made by the
students. The daily/weekly activity diary shall be signed after every day/week by the guide. (7)

Individual Contribution: The contribution of each student at various stages. (9)

Completion of the project: The students should demonstrate the project to their respective
guide. The guide shall verify the results and see that the objectives are met. (5)

Page 301
301 299
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

EVALUATION RUBRICS for PROJECT Phase II: Interim Evaluation - 1

No. Parameters Marks Poor Fair Very Good Outstanding
Good evidence of an implementable
Some of the aspects of the proposed
The project is not addressing any project. There is some evidence for The project has evolved into incorporating
idea can be implemented. There is
useful requirement. The idea is the originality of the work done by the an outstandingly novel idea. Original work
still lack of originality in the work
Novelty of idea, and evolved into a non-implementable team . There is fresh specifications/ which is not yet reported anywhere else.
done so far by the team. The project
Implementation scope one. The work presented so far is features/improvements suggested by Evidence for ingenious way of innovation
2-a 5 is a regularly done theme/topic
[CO5] lacking any amount of original work the team. The team is doing a design which is also Implementable. Could be a
without any freshness in terms of
[Group Evaluation] by the team. from fundamental principles, and patentable / publishable work.
specifications, features, and/or
there is some independent learning
improvements.
and engineering ingenuity.

(0 – 1 Marks) (2 – 3 Marks) (4 Marks) (5 Marks)

Good evidence of task allocation Excellent display of task identification and

being done, supported by project distribution backed by documentary
No task distribution of any kind. Task allocation done, but not journal entries, identification of tasks evidence of team brainstorming, and
Effectiveness of task
Members are still having no clue on effectively, some members do not through discussion etc. However, the project journal entries. All members are
2-b distribution among 5 what to do. have any idea of the tasks assigned. task distribution seems to be skewed, allocated tasks according to their
team members. Some of the tasks were identified but and depends a few members heavily capabilities, and as much as possible in an
[CO3] not followed individually well. than others. Mostly the tasks are being equal manner. The individual members are
[Group Evaluation]
followed by the individual members. following the tasks in an excellent manner.

(0 – 1 Marks) (2 – 3 Marks) (4 Marks) (5 Marks)

Little or no evidence of continued There is some improvement in the Good evidence of planning done and Excellent evidence of enterprising and
planning or scheduling of the primary plan prepared during phase I. being followed up to a good extent extensive project planning and follow-up
project. The students did not stick to There were some ideas on the since phase I. Continued use of project
after phase I. Materials were listed
Adherence to project the plan what they were going to materials /resources required, but not and thought out, but the plan wasn't management/version control tool to track
schedule. build nor plan on what materials / really thought out. The students have the project. Material procurement if
2-c 5 followed completely. Schedules were
[CO4] resources to use in the project. The some idea on the finances required, prepared, but not detailed, and needs applicable is progressing well. Tasks are
[Group Evaluation] students do not have any idea on the but they have not formalized a budget improvement. Project journal is updated and incorporated in the schedule.
budget required even after the end of plan. Schedules were not prepared. presented but it is neither complete A well-kept project journal showed
phase - I. No project journal kept or The project journal has no useful nor updated regularly. evidence for all the above, in addition to
the journal. details on the project. the interaction with the project guide.

(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

302Page 302
300
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

The team showed some interim The interim results showed were good
There were significant interim results
Interim Results. results, but they are not complete / and mostly consistent/correct with
There are no interim results to show. presented which clearly shows the progress.
2-d [CO6] 5 consistent to the current stage, Some respect to the current stage. There is
[Group assessment] corrections are needed. room for improvement.
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)
Very poor presentation and there is Presentation is average, and the Good presentation. Student has good Exceptionally good presentation. Student
Presentation
no interim results. The student has student has only a feeble idea about idea about the team's project. The has excellent grasp of the project. The
2-e [Individual 5 no idea about the project proposal. the team work. overall presentation quality is good. quality of presentation is outstanding.
assessment]
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Phase-II Interim Evaluation - 1 Total Marks: 25

303303
Page 301
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

EVALUATION RUBRICS for PROJECT Phase II: Interim Evaluation – 2

No Parameters Marks Poor Fair Very Good Outstanding

The student does not show any The student appears to apply some The student is able to show some Excellent knowledge in design procedure
Application of evidence of applying engineering basic knowledge, but not able to evidence of application of engineering and its adaptation. The student is able to
engineering knowledge on the design and the show the design procedure and the knowledge in the design and apply knowledge from engineering
knowledge methodology adopted. The student's methodologies adopted in a development of the project to good domains to the problem and develop
2-f [CO1] 10 contribution in application of comprehensive manner. extent. solutions.
[Individual engineering knowledge in the project
Assessment] is poor.

(0 – 3 Marks) (4 – 6 Marks) (7 - 9 Marks) (10 Marks)

The individual contribution is evident.

Involvement of No evidence of any Individual There is evidence for some amount Evidence available for the student acting
The student has good amount of
individual participation in the project work. of individual contribution, but is as the core technical lead and has excellent
5 involvement in core activities of the
members limited to some of the superficial contribution to the project.
2-g [CO3] project.
tasks.
[Individual
Assessment] (0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

None of the expected outcomes are Many of the expected outcomes are Most of the stated outcomes are met.
Only a few of the expected outcomes
Results and achieved yet. The team is unable to achieved. Many observations and Extensive studies are done and inferences
are achieved. A few inferences are
inferences upon derive any inferences on the failures/ inferences are made, and attempts to drawn. Most of the failures are addressed
5 made on the observed failures/issues.
execution [CO5] issues observed. Any kind o f identify the issues are done. Some and solutions suggested. Clear and valid
2-h No further work suggested.
[Group Assessment] observations or studies are not made. suggestions are made for further work. suggestions made for further work.

(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Documentatio n and The individual student has no idea on The individual's presentation is done
Presentation's overall quality needs The individual’s presentation
presentation. the presentation of his/her part. The professionally and with great clarity. The
5 to be improved. performance is satisfactory.
2-i .[CO6] presentation is of poor quality. individual’s performance is excellent.
[Individual assessment]
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Phase-II Interim Evaluation - 2 Total Marks: 25

Page 304
302
304
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

EVALUATION RUBRICS for PROJECT Phase II: Final Evaluation

No Parameters Marks Poor Fair Very Good Outstanding
The team is able to show evidence of Excellent knowledge in design procedure
Engineering The team does not show any evidence The team is able to show some of the
application of engineering knowledge and its adaptation. The team is able to
2-j knowledge. [CO1] of applying engineering knowledge design procedure and the
10 in the design and development of the apply knowledge from engineering
[Group Assessment] on the design and the methodology methodologies adopted, but not in a
project to good extent. There is scope domains to the problem and develop an
adopted. comprehensive manner.
for improvement. excellent solution.

(0 – 3 Marks) (4 – 6 Marks) (7 - 9 Marks) (10 Marks)

Relevance of the The project has some relevance with The project is relevant to the society The project is exceptionally relevant to
project with respect to The project as a whole do not have respect to social and/or industrial and/or industry. The team is mostly society and/or industry. The team has
2-k societal and/or any societal / industrial relevance at application. The team has however successful in translating the problem made outstanding contribution while
5 all.
industrial needs. made not much effort to explore into an engineering specification and solving the problem in a professional and/
[Group Assessment] further and make it better. managed to solve much of it. or ethical manner.
[CO2]
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)
Some of the aspects of the proposed Good evidence of an implementable
The project is not addressing any The project has evolved into incorporating
idea appears to be practical. There is project. There is some evidence for the
useful requirement. The idea is an outstandingly novel idea. Original work
still lack of originality in the work originality of the work done by the
evolved into a non-implementable which is not yet reported anywhere else.
done. The project is a regularly done team. There is fresh specifications/
Innovation / novelty / one. The work presented so far is Evidence for ingenious way of innovation
theme/topic without any freshness in features/improvements suggested by the
lacking any amount of original work which is also Implementable. Could be a
2-i Creativity 5 terms of specifications, features, and/ team. The team is doing a design from
[CO5] by the team. patentable publishable work.
or improvements. fundamental principles, and there is
[Group Assessment] some independent learning and
engineering ingenuity. Could be
translated into a product / process if
more work is done.

(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Only a few of the expected outcomes
None of the expected outcomes are are achieved. A few inferences are Many of the expected outcomes are Most of the stated outcomes are met.
Quality of results / achieved. The team is unable to made on the observed failures/issues. achieved. Many observations and Extensive studies are done and inferences
conclusions / 10 derive any inferences on the No further work suggested. inferences are made, and attempts to drawn. Most of the failures are addressed
2-m solutions. [CO1] failures/issues observed. Any kind of identify the issues are done. Some and solutions suggested. Clear and valid
[Group Assessment] observations or studies is not made. suggestions are made for further work. suggestions made for further work.

(0 – 3 Marks) (4 – 6 Marks) (7 - 9 Marks) (10 Marks)

Page 305
305 303
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Presentation slides follow a good style

Presentation slides follow professional The presentation slides are exceptionally
The presentation slides are shallow style formats to some extent. However, format and there are only a few issues.
Organization of the slides is good. Most good. Neatly organized. All references
Presentation - Part I and in a clumsy format. It does not its organization is not very good.
of references are cited properly. The cited properly. Diagrams/Figures, Tables
Preparation of slides. 5 follow proper organization. Language needs to be improved. All and equations are properly numbered,
flow is good and team presentation is
[CO6] references are not cited properly, or and l i s ted. Results/ inferences clearly
neatly organized. Some of the results
[Group Assessment]. acknowledged. Presentation slides highlighted and readable.
are not clearly shown. There is room
needs to be more professional.
for improvement.

2-n (0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Good presentation/ communication by
Presentation - Part The student is able to explain some of Clear and concise communication
the student. The student is able to
II: Individual The student is not communicating the content. The student requires a lot exhibited by the student. The
explain most of the content very well.
Communication 5 properly. Poor response to of prompts to get to the idea. There are presentation is outstanding. Very
There are however, a few areas where
[CO6] questions. language issues. confident and tackles all the questions
the student shows lack of preparation.
[Individual without hesitation. Exceptional traits of
Language is better.
Assessment]. communicator.
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Phase-II Final Evaluation, Marks: 40

306
Page 306
304
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

EVALUATION RUBRICS for PROJECT Phase II: Report Evaluation

Sl.
No. Parameters Marks Poor Fair Very Good Outstanding

The prepared report is shallow and not Project report shows evidence of
Project report follows the standard The report is exceptionally good. Neatly
as per standard format. It does not systematic documentation. Report is
format to some extent. However, its organized. All references cited properly.
follow proper organization. Contains mostly following the standard style
organization is not very good. Diagrams/Figures, Tables and equations
mostly unacknowledged content. Lack format and there are only a few issues.
2-o Report [CO6] 30 Language needs to be improved. All are properly numbered, and listed and
of effort in preparation is evident. Organization of the report is good.
references are not cited properly in the clearly shown. Language is excellent and
References are not cited. Mostly consistently formatted. Most of
report. There is lack of formatting follows professional styles. Consistent
Unprofessional and inconsistent references/sources are cited/
consistency. formatting and exceptional readability.
formatting. acknowledged properly.

(0 - 11 Marks) (12 - 18 Marks) (19 - 28 Marks) (29 - 30 Marks)

Phase - II Project Report Marks: 30

307
Page 307
305
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

SEMESTER VIII
MINOR
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
CATEGORY L T P CREDIT
INTRODUCTION
CMD482 MINI PROJECT
PWS 0 0 3 4 2019

Preamble: The objective of this course is to apply the fundamental concepts of different courses
learned in respective Minor Streams: Software Engineering, Machine Learning and Networking.
This course helps the learners to get an exposure to the development of application
software/hardware solutions/ software simulations in the field of Computer Science and
Engineering. It enables the learners to understand the different steps to be followed such as
literature review and problem identification, preparation of requirement specification &design
document, testing, development and deployment. Mini project enables the students to boost their
skills, widen the horizon of thinking and their ability to resolve real life problems.

Prerequisite: A sound knowledge in courses studied in respective minor stream.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Identify technically and economically feasible problems (Cognitive
CO1 Knowledge Level: Apply)

Identify and survey the relevant literature for getting exposed to related
CO2 solutions. (Cognitive Knowledge Level: Apply)

Perform requirement analysis, identify design methodologies and develop

CO3 adaptable & reusable solutions of minimal complexity by using modern tools
& advanced programming techniques (Cognitive Knowledge Level: Apply)
Prepare technical report and deliver presentation (Cognitive Knowledge
CO4 Level: Apply)
Apply engineering and management principles to achieve the goal of the
CO5 project (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO# Broad

PO PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern
Mark Distribution
Total CIE ESE Marks
Marks Marks
150 75 75

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Project Guide 15 marks
Project Report 10 marks
Evaluation by the Committee (will be evaluating the level of completion
and demonstration of functionality/specifications, presentation,
oral examination, work knowledge and involvement) : 40 marks

Student Groups with 4 or 5 members should identify a topic of interest in consultation with a
Faculty Advisor/Project Coordinator/Guide. Review the literature and gather information
pertaining to the chosen topic. State the objectives and develop a methodology to achieve the
objectives. Carryout the design/fabrication or develop codes/programs to achieve the objectives
by strictly following steps specified in the teaching plan. Innovative design concepts,
performance, scalability, reliability considerations, aesthetics/ergonomic, user experience and
security aspects taken care of in the project shall be given due weight.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

The progress of the mini project is evaluated based on a minimum of two reviews. The review
committee may be constituted by a senior faculty member, Mini Project coordinator and project
guide. The internal evaluation shall be made based on the progress/outcome of the project,
reports and a viva-voce examination, conducted internally by a 3-member committee. A project
report is required at the end of the semester. The project has to be demonstrated for its full design
specifications.

End Semester Examination Pattern:

The marks will be distributed as

Presentation : 30 marks
Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.

TEACHING PLAN

Students are expected to follow the following steps.

1. Review of Literature and Identification of a problem
2. Create an abstract with a problem statement, solution approach, technology stack, team,
etc.
3. Create Requirements Specification
4. Create Design Document . This may include designs like,
a. System Architecture Design
b. Application Architecture Design
c. GUI Design
d. API Design
e. Database Design
f. Technology Stack
5. Deployment, Test Run & Get Results
6. Prepare Project Report

Guidelines for the Report preparation

A bonafide report on the mini project shall be submitted within one week after the final
presentation. Minimum number of pages should be 40.
● Use Times New Roman font for the entire report – Chapter/Section Title – Times New
Roman18, Bold; Heading 2 – Times New Roman16, Bold; Heading 3 – Times New
Roman14, Bold; Body- Times New Roman 12, Normal.
● Line Spacing – Between Heading 2 – 3 lines, between lines in paragraph 1.5 lines.
● Alignments – Chapter/Section Title – Center, Heading 2 & 3 should be Left Aligned.
Ensure that all body text is paragraph justified.
● Figures & Tables – Ensure that all Figures and Tables are suitably numbered and given
proper names/headings. Write figure title under the figure and table title above the table.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

● Suggestive order of documentation:

i. Top Cover
ii. Title page
iii. Certification page
iv. Acknowledgement
v. Abstract
vi. Table of Contents
vii. List of Figures and Tables
viii. Chapters
ix. Appendices, if any
x. References/Bibliography
SEMESTER VIII
HONOURS
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

YEAR OF
CATEGORY L T P CREDIT
INTRODUCTION
AMD496 MINI PROJECT
PWS 0 0 3 2 2019

Preamble: The objective of this course is to apply the fundamental concepts of courses
learned in respective Honors Streams: Security in Computing, Machine Learning and Formal
Methods. This course helps the learners to get an exposure to the development of application
software/hardware solutions/ software simulations in the field of Computer Science and
Engineering. It enables the learners to understand the different steps to be followed such as
literature review and problem identification, preparation of requirement specification &design
document, testing, development and deployment. Mini project enables the students to boost
their skills, widen the horizon of thinking and their ability to resolve real life problems.

Prerequisite: A sound knowledge in courses studied in respective honor stream.

Course Outcomes: After the completion of the course the student will be able to

CO# CO
Identify technically and economically feasible problems (Cognitive
CO1 Knowledge Level: Apply)
Identify and survey the relevant literature for getting exposed to related
CO2 solutions. (Cognitive Knowledge Level: Apply)
Perform requirement analysis, identify design methodologies and develop
CO3 adaptable & reusable solutions of minimal complexity by using modern tools
& advanced programming techniques (Cognitive Knowledge Level: Apply)
Prepare technical report and deliver presentation (Cognitive Knowledge
CO4 Level: Apply)
Apply engineering and management principles to achieve the goal of the
CO5 project (Cognitive Knowledge Level: Apply)

Mapping of course outcomes with program outcomes

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

CO1

CO2

CO3

CO4

CO5
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Abstract POs defined by National Board of Accreditation

PO# Broad PO# Broad

PO PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of PO9 Individual and team work

solutions

PO4 Conduct investigations of PO10 Communication

complex problems

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Lifelong learning

Assessment Pattern
Mark Distribution

Total CIE ESE Marks

Marks Marks
150 75 75

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Project Guide 15 marks
Project Report 10 marks
Evaluation by the Committee (will be evaluating the level of completion
and demonstration of functionality/specifications, presentation,
oral examination, work knowledge and involvement) : 40 marks

Student Groups with 4 or 5 members should identify a topic of interest in consultation with a
Faculty Advisor/Project Coordinator/Guide. Review the literature and gather information
pertaining to the chosen topic. State the objectives and develop a methodology to achieve the
objectives. Carryout the design/fabrication or develop codes/programs to achieve the objectives
by strictly following steps specified in the teaching plan. Innovative design concepts,
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

performance, scalability, reliability considerations, aesthetics/ergonomic, user experience and

security aspects taken care of in the project shall be given due weight.

The progress of the mini project is evaluated based on a minimum of two reviews. The review
committee may be constituted by a senior faculty member, Mini Project coordinator and project
guide. The internal evaluation shall be made based on the progress/outcome of the project,
reports and a viva-voce examination, conducted internally by a 3-member committee. A project
report is required at the end of the semester. The project has to be demonstrated for its full design
specifications.

End Semester Examination Pattern:

The marks will be distributed as

Presentation : 30 marks
Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.

TEACHING PLAN

Students are expected to follow the following steps.

1. Review of Literature and Identification of a problem
2. Create an abstract with a problem statement, solution approach, technology stack, team,
etc.
3. Create Requirements Specification
4. Create Design Document . This may include designs like,
a. System Architecture Design
b. Application Architecture Design
c. GUI Design
d. API Design
e. Database Design
f. Technology Stack
5. Deployment, Test Run & Get Results
6. Prepare Project Report

Guidelines for the Report preparation

A bonafide report on the mini project shall be submitted within one week after the final
presentation. Minimum number of pages should be 40.
● Use Times New Roman font for the entire report – Chapter/Section Title – Times New
Roman18, Bold; Heading 2 – Times New Roman16, Bold; Heading 3 – Times New
Roman14, Bold; Body- Times New Roman 12, Normal.
● Line Spacing – Between Heading 2 – 3 lines, between lines in paragraph 1.5 lines.
 B TECH IN ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

● Alignments – Chapter/Section Title – Center, Heading 2 & 3 should be Left Aligned.

Ensure that all body text is paragraph justified.
● Figures & Tables – Ensure that all Figures and Tables are suitably numbered and given
proper names/headings. Write figuretitle under the figure and table title above the table.

● Suggestive order of documentation:

i. Top Cover
ii. Title page
iii. Certification page
iv. Acknowledgment
v. Abstract
vi. Table of Contents
vii. List of Figures and Tables
viii. Chapters
ix. Appendices, if any
x. References/Bibliography