AMITY INSTITUTE OF INFORMATION

TECHNOLOGY

PROGRAMME STRUCTURE
MASTER OF COMPUTER
APPLICATIONS(MCA)
2020 –2022

AMITY UNIVERSITY HARYANA

Overview

Master of Computer Applications (MCA) is a two-year (four semesters) professional Master's

Degree in Computer Applications. The programme is designed to meet the growing demand for
qualified professionals in the field of Computer Applications. It is a postgraduate course that can
be taken up after obtaining a Bachelor's Degree in any stream. The MCA programme is focused
more toward Application Development and thus has more emphasis on latest programming
language and tools to develop better and faster applications.
The curriculum is designed in such a way that it covers theoretical as well as practical courses of
relevant areas. As the IT and the software industry are dynamic and fast growing, all the courses
are designed keeping in view the requirements of industry.
During the summer break, after 2nd semester student has to undergo the industrial internship.
The last semester includes major project.
The major part of the curriculum includes Design & Analysis of Algorithms, Application
Software Development, Software Engineering, Software Project Management, Computer
Communication & Networks, Mobile Computing, Cloud Computing, Soft Computing, Computer
Graphics & Multimedia Systems Web Development, Data Mining and Warehousing, Artificial
Intelligence, Machine Learning etc.
MCA students are often in demand for the famous multinational companies like TCS, Cognizant
Technology Solutions, Infosys, Wipro, Google, IBM, Yahoo, Aricent etc.
After successful completion of MCA degree one can work as a Software Developer/Programmer,
System Analysts, Systems Designers, Software Consultant, Technical Writer, Web Designer and
Developer in any field related to IT in Private as well as Govt. sectors. One can also start his/her
own venture.
Programme Objectives (PO’s)
The graduates will
• PO1. Engineering knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.

• PO2. Problem analysis: Identify, formulate, research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
• PO3. Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

• PO4. Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.

• PO5. Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.

• PO6. The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

• PO7. Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.

• PO8. Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.

• PO9. Individual and team work: Function effectively as an individual, and as a

member or leader in diverse teams, and in multidisciplinary settings.

• PO10. Communication: Communicate effectively on complex engineering activities

with the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.

• PO11. Project management and finance: Demonstrate knowledge and understanding of

the engineering and management principles and apply these to one‟s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.
 • PO12. Life-long learning: Recognize the need for, and have the preparation and ability
to engage in independent and lifelong learning in the broadest context of technological
change.

Programme Specific Objectives (PSO’s)

PSO-1: Able to use fundamentals concept of software, hardware and networking to learn and
apply advanced technologies.

PSO-2: Apply formal and practical methods of Software Development using the concepts of
programming languages, database and design principles.

PSO-3: Able to use current technologies, skills and models of computing practices to solve
industrial problems.

PSO-4: Exhibit team work with the ability of leadership, analytical reasoning for solving time
critical problems and strong human values for responsible professional.
 PSO1 PSO2 PSO3 PSO4
Able to use fundamentals concept Apply formal and practical Able to use current Exhibit team work
of software, hardware and methods of Software technologies, skills and models with the ability of
networking to learn and apply Development using the concepts of computing practices to solve leadership,
advanced technologies. of programming languages, industrial problems. analytical
database and design principles. reasoning for
solving time
critical problems
and strong human
values for
responsible
professional.
Problem
Solving Comm
Advance
Basic Data unicati
& Program Programmin Advance Behavioral
Hardware Basic Software base on
Software ming g/Software Technology NTCC Science/Manag
Networking Courses Cour skills
Develop Courses Managemen Courses ement Courses
Courses ses t Courses
ment
Courses
Computer
Relational Interpe
Data Fundaments
Computer Fundaments and Design & Database Software rsonal
Communication & and Computer Mobile Summer Leading through
Computer Programming Analysis of Managem Project Comm
Computer Programming Computing Internship Teams
using C Language Algorithm ent Management unicati
Networks using C
System on
Language
Cross
Cultur
Major
Software Programming Android Artificial Professional al
Operating System Project/Di
Engineering with Java Programming Intelligence Excellence Comm
ssertation
unicati
on

Computer Foreig
Programming Machine Digital
Graphics & Business n
with .NET Learning Image
Multimedia Management Langu
Framework using Python Processing
Systems age

Data
Warehousing
& Data
Mining
Network
Security &
Cryptograph
y
Soft
Computing
Cloud
Computing

Big Data
Amity Institute of Information Technology | Master of Computer
Applications | Total Credits : 100 | 2 Years / 4 Semesters

Master of Computer Applications

Credit Summary Sheet
Total Credits : 100

Total Total Total Total Total

S.NO. Courses
Subject (L) (T) (P) Credit

1 0 0 0 0 0
Basic Sciences Courses

2 16 48 2 0 50
Core Courses

3 11 0 0 28 14
Laboratory Courses
2 2 0 0 2
4 Communication Skills

5 2 2 0 0 2
Behavioral science

6 0 0 0 0 0
Environmental Science

7 3 6 0 0 6
Foreign Language
0 0 0 0 0
8 Open Elective (Flexi credit)

9 1 0 0 0 5
Summer Internship

10 1 0 0 0 15
Major Project
2 0 0 0 6
11 NTCC
38 58 2 28 100
Total

Bridge Course 4 12 0 8 16
Eligibility

a) Passed BCA/B.Sc.(Hons.)Computer Science/ B.Sc(IT)/ B.E. or B.Tech.(CSE/IT)/ B.Voc.(Software

Development/IT) or an equivalent degree with having at least 50% marks in aggregate.

Or

b) Passed B.Sc/ B.Com/ B.A with Mathematics at 10+2 level or at Graduation level with having at least
50% marks in aggregate, along with the students admitted with this eligibility will have to simultaneously
undertake additional bridge course as prescribed by the University during the first year.

BRIDGE COURSE
Tutorial Practical
Lecture
(T) (P)
Course (L) Total
Course Title Hours Hours
Code Hours Credits
Per Per
Per Week
Week Week
Core Courses
Computer Fundamentals and 3 - - 3
Programming in C
Data Structure 3 - - 3
Operating System 3 - - 3
Relational Database 3 - - 3
Management System
Laboratory Courses
Programming in C Lab - - 2 1

Data Structure Lab - - 2 1

Operating System Lab - - 2 1

Relational Database - - 2 1
Management System Lab
TOTAL 16
 FIRST SEMESTER

Tutorial Practical
Lecture
(T) (P)
Course (L) Total
Course Title Hours Hours
Code Hours Credits
Per Per
Per Week
Week Week
Engineering Sciences Courses
Data Communication & 3 - - 3
Computer Networks
Design & Analysis of Algorithm 3 1 - 4
Software Engineering 3 - - 3
Computer Graphics & 3 - - 3
Multimedia Systems
Laboratory Courses
Data Communication & - - 2 1
Computer Networks Lab
Design & Analysis of Algorithm - - 2 1
Lab
Computer Graphics & - - 2 1
Multimedia Systems Lab
Value Added Courses
CSS4351 Interpersonal Communication 1 - - 1
BEH4351 Leading through Teams 1 - - 1
st
Foreign Language – III (As opted in 1 Semester)
LAN4351 French-III
LAN4352 German-III
LAN4353 Spanish-III
LAN4354 Russian-III
LAN4355 Chinese-III 2 - - 2
LAN4356 Portuguese-III
LAN4357 Korean-III
LAN4358 Japanese-III
LAN4359 Hindi-III
TOTAL 20
 SECOND SEMESTER

Lecture Tutorial
(L) (T) Practical
Course Total
Course Title Hours Hours (P) Hours
Code Credits
Per Per Per Week
Week Week
Engineering Sciences Courses
Mobile Computing 3 0 - 3
Programming with Java 3 0 - 3
Software Project Management 3 0 - 3
Artificial Intelligence 3 0 - 3
Business Management 3 0 - 3
Laboratory Courses
Programming with Java Lab - - 4 2
Software Project Management - - 2 1
Lab
Artificial Intelligence Lab - - 2 1
Seminar
Seminar - - - 3
Value Added Courses
CSS4451 Cross Cultural Communication 1 - - 1
BEH4451 Professional Excellence 1 - - 1
Foreign Language – IV (As opted in 1st Semester)
LAN4451 French-IV
LAN4452 German-IV
LAN4453 Spanish-IV
LAN4454 Russian-IV
LAN4455 Chinese-IV 2 - - 2
LAN4456 Portuguese-IV
LAN4457 Korean-IV
LAN4458 Japanese-IV
LAN4459 Hindi-IV
TOTAL 26
 THIRD SEMESTER

Lecture Tutorial Practical

(L) (T) (P)
Course Total
Course Title Hours Hours Hours
Code Credits
Per Per Per
Week Week Week
Engineering Sciences Courses
Data Warehousing & Data 3 0 - 3
Mining
Programming with .NET 3 0 - 3
Framework
Network Security & 3 1 - 4
Cryptography
Soft Computing 3 - - 3
Laboratory Courses
Data Warehousing & Data - - 2 1
Mining Lab
Programming with .NET - - 4 2
Framework
Soft Computing Lab - - 2 1
Summer Internship
Summer Internship Evaluation - - - 5
Term Paper
Term Paper - - - 3
Concentration Electives (Any One Set)
Android Programming 3 - - 3
Android Programming Lab - - 2 1
Digital Image Processing 3 - - 3
Digital Image Processing Lab - - 2 1
Big Data 3 - - 3
Big Data Lab - - 2 1
Foreign Language – V (As opted in 1st Semester)
LAN4551 French-V
LAN4552 German-V
LAN4553 Spanish-V
LAN4554 Russian-V
LAN4555 Chinese-V 2 - - 2
LAN4556 Portuguese-V
LAN4557 Korean-V
LAN4558 Japanese-V
LAN4559 Hindi-V
TOTAL 31
 FOURTH SEMESTER

Course Course Title Lecture Tutorial Practical (P) Total

Code (L) (T) Hours Per Credits
Hours Hours Week
Per Per
Week Week
Major Project
Major Project/ Dissertation - - - 15
Machine Learning using Python 3 - - 3
Cloud Computing 3 - - 3
Laboratory Courses
Machine Learning using Python Lab - - 4 2
TOTAL 23
 L T P C
CSE2104 Computer Fundamentals and Programming in C

Version: 2020.1 Date of Approval: 19, July 2020 3 - - 3

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

The objective of this course module is to acquaint the students with the basics of computers
system, its components, data representation inside computer and to get them familiar with
various important features of procedure-oriented programming language i.e. C.

Course Objectives

The objective of this course is to

1. Equip the students with basic concepts of computer

2. Equip the students with concepts of Programming through C Language

3. Provide an overview of advanced programming concepts like Structure, Union and File
Handling

Course Outcomes

On completion of this course, the students will be able to

After the completion of course, the students will be able to,

CO1: Understand the basic architecture of computer and software concepts.

CO2: Define the purpose and structure of C Program for programming; identify and distinguish
various datatypes and operators; conditional and control statement; Apply if-else, Switch
and loops to rewrite basic C program for problem solving.

CO3: Compare and contrast various Array types, its declaration and implementation;
differentiate between Call by Value and Reference if Functions; apply the concepts to
rewrite C Programs
CO4: Differentiate between various String Handling Functions; describe the concept of Pointers
in C Language

CO5: Explain the concept of Structure and Union; apply the concept of File Handling to provide
data storage support to the programs.

Blooms Number
Modules
level* of hours

Module I: Introduction
Introduction to computer, history, von-Neumann architecture, memory system
(hierarchy, characteristics and types), H/W concepts (I/O Devices), S/W concepts L1, L2
(System S/W & Application S/W, utilities). Data Representation: Number 7
systems, character representation codes, Binary, octal, hexadecimal and their inter and L3
conversions. Binary arithmetic, floating point arithmetic, signed and unsigned
numbers, Memory storage unit, logic gates.

Module II: Programming in C

History of C, Introduction of C, Basic structure of C program, Concept of
variables, constants and data types in C, Operators and expressions: Introduction, L2, L3
arithmetic, relational, Logical, Assignment, Increment and decrement operator, and L4
7
Conditional, bitwise operators, Expressions, Operator precedence and
associativity. Managing Input and output Operation, formatting I/O.

Module III: Fundamental Features in C

C Statements, conditional executing using if, else, nesting of if, switch and break L2, L3
Concepts of loops, example of loops in C using for, while and do-while, continue 7
and break. Storage types (automatic, register etc.), predefined processor, and L4
Command Line Argument.

Module IV: Arrays and Functions

One dimensional arrays and example of iterative programs using arrays, 2-D
arrays Use in matrix computations.
Concept of Sub-programming, functions Example of user defined functions. L2 and
7
Function prototype, Return values and their types, calling function, function L3
argument, function with variable number of argument, recursion.

Module V: Advanced features in C

Pointers, relationship between arrays and pointers Argument passing using
pointers, Array of pointers. Passing arrays as arguments.Strings and C string L2, L3
library.Structure and Union. Defining C structures, Giving values to members, and L4
8
Array of structure, Nested structure, passing strings as arguments.
File Handling.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6:Evaluation

Text Books

1. P. S. Pradeep K. Sinha, Computer Fundamentals, BPB Publications, 2017.

2. E Balagurusamy, “Programming in ANSI C”, Seventh Edition, Tata McGraw Hill Education
private limited, July 2017.

3. Yashwant Kanetkar, “Let Us C”, 16th Edition, BPB Publication, June 2017.

Reference Books

1. Brain W Kernighan and Dennis M Ricchie, “The C Programming Language”, 2nd Edition,
Pearson Publication, Jan 2015.

2. Byron Gottfried, “Programming with C”, Third Edition, Tata McGraw Hill Education private
limited, July 2017.

3. E Balagurusamy, “Computer Concepts & Programming in C”, Seventh Edition, Tata

McGraw Hill Education private limited, July 2011.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE

Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; Att:
Attendance
CO, PO and PSO mapping

PO PO PO PSO PSO PSO PSO

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9
10 11 12 1 2 3 4

CO1 1 -- -- 2 -- -- -- -- -- -- -- -- 1 -- 1 --

CO2 1 1 2 2 -- -- -- -- -- -- -- -- 1 -- 1 --

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

CO4 1 1 2 2 3 -- -- -- -- -- -- -- 1 -- 1 --

CO5 1 1 2 2 3 -- -- -- -- -- -- -- 1 -- 1 --

1: strongly related, 2: moderately related and 3: weakly related

 CSE 2107 L T P C
Programming In C Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

The primary objective of this course is to understand all the components of C, including the C language,
the C Preprocessor, and the C Standard Library. An understanding of some advanced practical issues,
including memory management, testing and debugging, complex declarations and expression evaluation,
building and using libraries, and evaluating tradeoffs, such as size vs. speed and speed vs. complexity.
The ability to write C code and create and manipulate logical programs.

Course Objectives

The objective of this course is to

1. Equip the students with concepts of Programming through C Language
2. Provide an overview of advanced programming concepts like Structure, Union and
File Handling.
Course Outcomes

After the completion of course, the students will be able to,

CO 1:Demonstrate the use of various data types and operators in C programs; Solve various
problems using conditional control statements (if-else, Switch case).

CO 2: Construct C programs related to problems involving the usage of loops, arrays and
functions.

CO 3: Apply the concept of Pointers for efficient memory management and construct C
programs using string handling functions.

CO 4: Demonstrate the use of Structure, Union and concept of File Handling to provide data
storage support to the programs.

Blooms Number
Modules
level* of hours

LABORATORY SESSSION 1 L3 5
OPERATORS, EXPRESSIONS and DECISION MAKING
 1. Write a program to calculate simple interest and amount.
2. Write a program to swap two numbers using third variable.
3. Write a program to demonstrate Greatest of 3 nos and to print the given
no in ascending order.
4. Write a program to check if the number is even or odd.
5. Write a program to perform arithmetic operations using Switch Case
statement.
6. Write a program to calculate area of circle, rectangle, square and triangle
using Switch Case statement.

LABORATORY SESSSION 2
LOOPING
1. Write a program to find factorial of given no using do while statement.
2. Write a program to print prime numbers up to „n‟.
3. Write a program to sum of n natural no.
4. Write a program to print Fibonacci series.
5. Write a program to reverse a number.
6. Write a program to print the following pattern using for loop L3 6
1
22
333
4444
7. Write a program to print the following pattern using for loop
A
AB
ABC
ABCD
LABORATORY SESSSION 3
ARRAYS and FUNCTIONS
1. Write a program to read n num of students and 5 subjects marks.
2. Write a program to swap two numbers using call by value.
L3 5
3. Write a program to convert all lower case to uppercase characters
4. Write a program to find the factorial of a number using recursion.
5. Write a program to print the add/product of two matrices of any order.

LABORATORY SESSSION 4
POINTERS AND STRING
1. Write a program to perform operations on strings using string
handling in-built functions (concatenation, reversal, copy etc.)
2. Write a program to swap two numbers using call by reference. L3 4
3. Write a program to perform dynamic memory allocation and
deallocation.
4. Write a program to print elements of array using pointers.

LABORATORY SESSSION 5
L3 4
STRUCTURE,UNION & FILE HANDLING
 1. WAP program to display student information by initializing
structures.
2. WAP program to find the total salary of employee and employee
details using structure.
3. Write a program to store and display information using Union.
4. Program to write data into file and read data from file.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. E Balagurusamy, “Programming in ANSI C”, Seventh Edition, Tata McGraw Hill

Education private limited, July 2017.

2. Yashwant Kanetkar, “Let Us C”, 16th Edition, BPB Publication, June 2017.

Reference Books

1. Brain W Kernighan and Dennis M Ricchie, “The C Programming Language”, 2nd

Edition, Pearson Publication, Jan 2015.

2. Byron Gottfried, “Programming with C”, Third Edition, Tata McGraw Hill Education
private limited, July 2017.

3. E Balagurusamy, “Computer Concepts & Programming in C”, Seventh Edition, Tata

McGraw Hill Education private limited, July 2011.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V
70
5 10 10 5

Note: IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V – Viva.
CO, PO and PSO mapping

PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2 3 4

CO1 1 2 -- 2 -- -- -- -- -- -- -- -- 1 -- 2 --

CO2 1 1 2 2 -- -- -- -- -- -- -- -- 1 -- 2 --

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

CO4 1 1 2 2 3 -- -- -- -- -- -- -- 1 -- 2 --

1: strongly related, 2: moderately related and 3: weakly related

IFT4213 L T P C
Data Structure

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Hands on knowledge of C Programming

Co-requisites Basic concepts of C Programming

Catalog Description

This course is an introduction to the use, design, and analysis of data structures in computer
programs. The very commonly used data structures like arrays, stacks, queues, lists, trees,
graphs, hashing and file structure will be discussed in detail. Sorting and hashing are important
topics in the study of algorithms. They are also closely related to the design of data structures.
Several algorithms to implement these techniques are included in the syllabus.

Course Objectives

The objective of this course is to

1. Equip the students with the basic concepts of data structures and algorithms

2. Provide the overview about searching and sorting techniques

3. Equip the students with basic concepts about stacks, queues, lists, trees, graphs and hashing
Course Outcomes

On completion of this course, the students will be able to

CO1: Explain basic concepts of C language and various dynamic memory allocation techniques;
Time and space complexities of algorithms.

CO2: Explain fundamental data structures and algorithms and summarize their typical uses,
strengths, and weaknesses; Applications and various operations applied on arrays; Explain Stack
and Queue data structure, various types of Queues; Applications of stack and queue. Compare
and contrast link list with other linear data structure; Advantage, disadvantages, types and
application link list.

CO3: Explain Binary search tree and its types; Applying in-order, pre-order and post order
traversal to create the tree; application of tree in searching and storing huge amount of data;
Explain different types of graphs and their representation in memory. Applying BFS and DFS
graph traversal scheme to find shortest path; Determine minimum spanning tree using Kruskal‟s
and Prim‟s method.

CO4: Compare and contrast hashing technique with other traditional searching techniques;
differentiate among various file access methods.

CO5: Analyze and compare the complexity different searching and sorting algorithms. Evaluate
algorithms and data structures in terms of time and memory complexity of basic operations.

Blooms Number
Modules
level* of hours

MODULE 1:

BASIC CONCEPTS L1, L2

Dynamic Memory Allocation & Deallocation (new & delete). 5
and L3
Performance Analysis and Measurement (Time and space analysis of
algorithms-Average, best and worst case analysis), Types of Data
Structures- Linear & Non Linear Data Structures.
MODULE 2:

LINEAR DATA STRUCTURE

Arrays :Basic Concepts, Operations on Arrays. Stack-Definitions & L2, L3
Concepts, Operations On Stacks, Applications of Stacks, Polish and L4 7
Expression, Reverse Polish Expression And Their Compilation,
Recursion, Tower of Hanoi
Queue Definition & Concepts. Representation Of Queue, Operations On
Queue, Circular Queue, Priority Queue, Array representation of Priority
Queue, Double Ended Queue, Applications of Queue
Linked List: Singly Linked List, Doubly Linked list, Circular linked list,
Operations on different types of Linked List: Insertion & deletion. Linked
implementation of Stack & Queue using C++.
MODULE 3:

NONLINEAR DATA STRUCTURE

Tree-Definitions and Concepts, Representation of binary tree, Binary tree
traversal (In-order, post-order, preorder), Threaded binary tree, Binary L2, L3
search trees: Insertion & deletion. Conversion of General Trees to Binary and L4 7
Trees, Applications of Trees.. AVL trees
Graph-Basic Concepts. Matrix & Linked List Representation Of Graphs,
Elementary Graph operations,(Breadth First Search, Depth First Search,
Spanning Trees, Shortest path, Constructing A Spanning Tree(Prim
Algorithm, Kruskal‟s Algorithm)
MODULE 4:

HASHING AND FILE STRUCTURES

L2, L3,
Hashing: The symbol table, Hashing Functions, Collision Resolution
Techniques, L4and 6
File Structure: Concepts of fields, records and files, Sequential, Indexed L5
and Relative/Random File Organization, Indexing structure for index
files, hashing for direct files, Multi-Key file organization and access
methods
MODULE 5:

SORTING & SEARCHING

Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort Searching – L2, L3 5
Sequential Search and Binary Search. Finding Complexities of Sorting and L4
and Searching Algorithms.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Seymour Lipschutz , “Data Structures”, Schaum outlines, Revised 1st Edition

2. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data structure and program design in C”, PHI
3. A.V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, 1st Edition,
Pearson Education, Reprint 2003.

Reference Books

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

McGraw – Hill Computer Science Series, Mc-Graw – Hill New York, 1984
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,” Algorithms”, Prentice-Hall
India(1999).

3. Yeddidyah Langsam, Moshe J.Augenstein, Aaron M. Tenen Baum, “Data Structures Using C
and C++”, 2nd Edition, Prentice-Hall India

1. Mark Allen Weiss,”Data Structures and Algorithm analysis in C++ “,Addison Wesley (3 rd
Indian Reprint 2000).

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

CO1 1 2 2 -- -- -- -- -- -- -- -- -- 1 1 -- --

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

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

CO4 1 2 1 -- -- -- -- -- -- -- -- -- 1 2 -- --

CO5 1 2 1 -- -- -- -- -- -- -- -- -- 1 1 2 3

1: strongly related, 2: moderately related and 3: weakly related

 IFT4217 L T P C
Data Structure Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Hands on knowledge of C Programming

Co-requisites Basic concepts of C Programming

Catalog Description

The course is designed to develop skills to design and analyze simple linear and non linear data
structures like arrays, stacks, queues, lists, trees, and graphs. It strengthen the ability of the
students to identify and apply the suitable data structure for the given real world problem. It
enables them to gain knowledge in practical applications of data structures

Course Objectives

The objective of this course is to

1. Equip the students to apply knowledge of basic concepts of data structures in solving complex
problems.

2. Provide demonstration of the data structure concepts like stacks, queues, lists, trees, graphs
and various searching and sorting techniques

Course Outcomes

On completion of this course, the students will be able to

CO1: Apply the knowledge of basic fundamentals of data structures in order to analyze the time
and space efficiency of the data structure

CO2: Demonstrate the use and applications of Stack and Queue data structure along with various
types of Queues.

CO3: Demonstrate and compare link list with other linear data structure; Advantage,
disadvantages, types and application of link list.

CO4: Apply the knowledge of trees and heaps and demonstrate the application of tree in
searching and storing huge amount of data. Demonstrate the usage of graphs and their
applications of BFS and DFS to find shortest path

CO5: Apply algorithm for solving problems like sorting, searching,hasing, insertion and
deletion of data.
 Blooms Number
Modules
level* of hours

1. Sample programs of 1D and 2-D arrays

(a) Write a program to insert an element at any position in an array L1, L2
(b) Write a program to perform addition of matrix for order 3*3 4
and L3
(c) Write a program to perform multiplication of matrix of any order

2. Sample Programs of stack and queues.

(a) Write a program that perform the following function

i) Create stack of integers.
ii) PUSH operation on stack
iii) POP operation on stack

(b) Write a program that perform the following function L2, L3 4

i) Create Queue of integers.
ii) Insert operation on Queue
iii) Delete operation on Queue

(c) Write a program that perform the following function

i) Create Circular Queue of integers.
ii) Insert operation on Circular Queue
iii) Delete operation on Circular Queue
3. Sample Programs of Linked List

(a) Write a C program that perform the following:

i) Create a singly linked list of integers.
ii) Delete a given integer from the above linked list.
iii) Display the contents of the above list after deletion L2, L3
6
and L4
(b) Write a C program that performs the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion
.

4. Sample Programs of trees

L2, L3,
(a) Write a C program that uses functions to perform the following: L4and 2
i) Create a binary search tree of characters. L5
ii) Traverse the above Binary search tree recursively in Postorder.

5. Sample programs on sorting and searching 6

(a) Write C programs for implementing the Bubble Sort L2, L3
 (b) Write C programs for implementing the Selection Sort and L4
(c) Write C programs for implementing the Insertion Sort
(d) Write a program to perform linear Search
(e) Write a program to perform binary Search

6. Sample programs on graphs

(a) Write C programs for implementing the graph traversal

algorithms: Depth first traversal L3, L4
(b) Write C programs for implementing the graph traversal 6
algorithms: Breadth first traversal and L6

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Seymour Lipschutz , “Data Structures”, Schaum outlines, Revised 1st Edition

2. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data structure and program design in C”, PHI

3. A.V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, 1st Edition,
Pearson Education, Reprint 2003.

Reference Books

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

McGraw – Hill Computer Science Series, Mc-Graw – Hill New York, 1984

2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,” Algorithms”, Prentice-Hall

India(1999).

3. Yeddidyah Langsam, Moshe J.Augenstein, Aaron M. Tenen Baum, “Data Structures Using C
and C++”, 2nd Edition, Prentice-Hall India

4. Mark Allen Weiss,”Data Structures and Algorithm analysis in C++ “,Addison Wesley (3rd
Indian Reprint 2000).
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

Components A PR LR V

Weightage 5 10 10 5 70
(%)

Note: IA –Internal Assessment, A – Attendance, PR – Performance, LR – Lab Record, V – Viva,

EE- External Exam

CO, PO and PSO mapping

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

CO1 1 2 2 -- -- -- -- -- -- -- -- -- 1 1 2 --

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

CO3 1 -- 1 -- -- -- -- -- -- -- -- -- 1 2 -- --

CO4 1 2 1 -- -- -- -- -- -- -- -- -- 1 2 -- --

CO5 1 2 1 -- -- -- -- -- -- -- -- -- 1 1 2 2

CO6 1 1 2 2 -- -- -- -- -- -- -- -- 1 1 2 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4110 L T P C
Operating Systems

Version: 2020.1 Date of Approval:19, July 2020 3 0 0 3

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description
This course is aimed at providing the basic knowledge of the concepts involved in designing and
working of an operating system, how it acts as a resource manager of the system as a whole, how
various issues such as Memory conflicts, resource conflicts are resolved by an operating system
and a study of various types of operating systems.

Course Objectives

The objective of this course is to

1. Equip the students with the knowledge about categories of operating systems and their
functions.

2. Provide detailed knowledge about functions of operating system like process, memory and
device management along with file system security and protection.

Course Outcomes

On completion of this course, the students will be able to

CO1: Define and explain operating systems and their evolution also differentiate among its
various types.
CO2: Explain concepts of process and inter-process communication and synchronization.
Identify solutions to detect, prevent and handle deadlocks occurring in the operating systems.
Solve synchronization and CPU scheduling problems related to processes.
CO3: Define and explain concepts of memory management like fragmentation, paging and
segmentation. Solve problems related to memory management using page replacement
algorithms.
CO4: Describe the concepts of device management and list various disk allocation methods.
Determine solutions for disk scheduling problems using available disk scheduling algorithms.
CO5: State the concept of file and file system security, also distinguish among various file
allocation methods.
 Blooms Number
Modules
level* of hours

MODULE 1:

INTRODUCTION
What is an Operating System, Types of Operating Systems, Simple Batch
Systems, Multiprogramming Systems, Time-Sharing Systems, Parallel L1, L2
Systems, Distributed Systems, Real-time Systems, Operating System and L4 4
Structures:
System Components, System Calls, Types of System Calls, System
Programs, System Structure, Virtual Machines, Operating System
debugging and Generation, System Boot

MODULE 2:

PROCESS MANAGEMENT
Process Concept, Process Scheduling, Operation on processes,
Cooperating Processes, Interprocess Communication with Examples, L1, L2 4
Client-Server Systems, Background process, Overview of Multithreaded and L3
Programming, Multithreading Models, Process Scheduling:Basic
Concepts, Scheduling Criteria, Scheduling Algorithms, Multi-Processor
Scheduling, Thread Scheduling, Multi-Processor Scheduling

MODULE 3:

PROCESS COORDINATION
Synchronization: Critical section Problem, classic problems of L1, L2
synchronization, semaphores, monitors & its implementation. Deadlocks: and L3 4
System Model, Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection, Deadlock Recovery

MODULE 4:

MEMORY MANAGEMENT L1, L2

Background of Memory Management, Swapping, Contiguous Memory and L3 4
Allocation, Segmentation, Virtual Memory management concepts:
Demand Paging, Page Replacement, Allocation of Frames, Thrashing

MODULE 5:

STORAGE MANAGEMENT
File System: File Concept, Access Methods, Directory and Disk Structure, L1 and 4
File Sharing, Protection, File System Structure, Allocation Methods, Free L2
Space Management, Secondary Storage Structure: Disk Scheduling, Swap
Space Management, RAID Structure, I/O Systems: Overview and I/O
Hardware

MODULE 6:

PROTECTION AND SECURITY

L1 and
4
System Protection: Goals ,Principles and Domain of Protection, Access L2
Matrix, System Security: The security problem, Program Threats, System
and Network Threats, Overview of Cryptography, User Authentication,
Firewalls
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Milenekovic, “Operating System Concepts”, McGraw Hill

2. Silberschatz, P.B. Galvin “Operating System Concepts”, John Willey & son
Reference Books

1. Dietel, “An introduction to operating system”, Addision Wesley

2. Tannenbaum, “Operating system design and implementation”, PHI

3. Operating System, A Modern Perspection, Gary Nutt, Pearson Edu. 2000

4. A. S Tanenbaum, Modern Operating System, 2nd Edition, PHI

5. Willam Stalling “ Operating system” Pearson Education

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components CT1 HA ATTD. EE

Weightage (%) 10 15 5 70

CT: Class Test, HA: Home Assignment, Attd: Attendance , EE: End Semester Examination
CO, PO and PSO mapping

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

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- -- --

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

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

CO4 1 2 3 -- -- -- -- -- -- -- -- -- 1 -- -- --

CO5 1 -- 2 -- -- -- -- -- -- -- -- -- 1 -- -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4112 Operating System Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basic knowledge of Operating System

Co-requisites

Catalog Description

This course introduces the UNIX operating system commands, shell programming. Explores
the use of operating system utilities such as vi text editors, filters, process handling etc.

Course Objectives

The objective of this course is to

1. Provide knowledge of working on Unix OS.

2. Provide sound foundation of writing Shell scripts.
3. Implement features like piping, filters and redirection.

Course Outcomes

On completion of this course, the students will be able to

CO1: To implement various UNIX commands.

CO2: To demonstrate the use of Vi Editor and other editors of UNIX.
CO3: To write simple Shell scripts.

Blooms Number
Modules
level* of hours

1. UNIX structure, history, basic commands. L1,L3 4

2. Working of Vi Editor and its commands. L1,L3 4

Shell Script
1. Write a Shell Script that takes a search string and filename from the
terminal & displays the results.
2. Write a Shell Script that takes pattern and filename as command line L1,L3 16
arguments and displays the results appropriately i.e. pattern found/pattern
not found.
3. Write a Shell Script that accepts only three arguments from the
command line. The first argument is the pattern string, the second
argument is the filename in which the pattern is to be searches and the
third argument is the filename in which the result is to be stored.
4. Write a Shell Script which creates the following menu and prompts for
choice from user and runs the chosen command.
Today's date
Process of user
List of files
Quit to UNIX

5. Write a Shell Script that computes the factorial of a given number

6. Write a Shell Script that changes the extension of a group of files from
txt to doc
7. Write a Shell Script that accepts both filename and a set of patterns as
positional parameters to a script.
8. Write a Shell Script which will redirect the output of the date command
without the time into a file.
9. Write a Shell Script (using while loop) to execute endlessly (until
terminated by user) a loop which displays contents of current directory,
disk space status, sleep for 30 seconds and display the users currently
logged in on the screen.
10. Write a Shell Script that receives two filenames as arguments. It
should check whether content of the two files is same or not. If they are
same, second file should be deleted.
11. If a number is input through the keyboard, WASS to calculate sum of
its digits.
12. Write a Shell Script which takes a command line argument of Kms
and by default converts that number into meters. Also provide options to
convert km to dm and km to cm.
13. Write a Shell Script using for loop, which displays the message
"Welcome to the UNIX System"
14. Write a Shell Script to change the filename of all files in a directory
from lower-case to upper-case.
15. Write a Shell Script that examines each file in the current directory.
Files whose names end in old are moved to a directory named old files
and files whose names end in .c are moved to directory named
cprograms.
16. Write a Shell Script which searches all files in the given directory (to
be taken as command line argument) for the file having the title (to be
taken as command line argument), as the first line in the file.
a) Display the contents of the searched file.
b) In the end, printthe the file is ###, where
### is small-sized if total no. of lines is <50
### is medium-sized if total no. of lines between 50&100
### is large-sized.
17. Write a shell script which reports names and sizes of all files in a
directory (directory would be supplied as an argument to the shell script)
whose size is exceeding 1000 bytes. The filenames should be printed in
descending order of their sizes. The total number of such files should also
be reported.
18. Write a shell script to calculate and print the first m Fibonacci
numbers.
19. Write a shell script to compute the GCD and LCM of two numbers.
20. Write a shell script to generate all combinations of 1, 2 and 3 using for
loop.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. “ Unix Concepts and application” Das Sumitabha Tata Mcgraw Hill

Reference Books

1. “Unix Programming Environment” The Kernighan and Pike Prentice – Hall of

India

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35

Note: IA –Internal Assessment,A- Attendance, LR – Lab Record, V – Viva, PR- Performance,

EE- External Exam

CO, PO and PSO mapping

PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2 3 4

CO1 1 -- 1 -- -- -- -- -- -- -- -- -- 1 -- -- --

CO2 1 -- 1 -- -- -- -- -- -- -- -- -- 1 -- -- --

CO3 1 -- 1 -- -- -- -- -- -- -- -- -- 1 -- -- --

1: strongly related, 2: moderately related and 3: weakly related

IFT4214 Relational Database Management System L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Computer Fundamentals and Mathematics Set Theory

Co-requisites Nil

Catalog Description

This course is design to get students familiar with the fundamentals & basic concepts in Data
Base Management Systems and their use. The primary aim of the subject is to provide the
students a deeper understanding of the relational database model by exposing the students to a
variety of important issues of data base management, e.g., database design, physical storage,
query optimization, database recovery, concurrency control, security and data integrity.

Course Objectives

The objective of this course is

 To make students familiar with the fundamental concepts of DBMS.

 Provide an overview of Normalization, concurrency techniques and database recovery with

examples.
Course Outcomes

On completion of this course, the students will be able to

CO1. Differentiate between traditional data processing system and database management system
and understand characteristics and applications of DBMS in real world.

CO2. Explain and use different data models such as Entity Relationship Model and Relational
Model.

CO3. Solve queries using relational algebra, relational calculus and SQL.

CO4. Illustrate normalization concepts and apply them in real database applications.

CO5. Explain database concurrency techniques and recovery mechanisms.

Blooms Number
Modules
level* of hours

Module I: Introduction to DBMS

L1, L2
Introduction to DBMS, Architecture of DBMS, Components of DBMS, 6
Traditional data Models (Network, Hierarchical and Relational), Database and L6
Users, Database Languages, Schemas and Instances, Data Independence
Module II: Data Modeling
Entity sets attributes and keys, Relationships (ER), Database modeling L1and
using entity, Weak and Strong entity types, Enhanced entity-relationship 2
L2
(EER), Entity Relationship Diagram Design of an E-R Database schema,
Object modeling, Specialization and generalization
Module III: Relational Database Model L1 and
Basic Definitions, Properties of Relational Model, Keys, Constraints, 4
L3
Integrity rules, Relational Algebra, Relational Calculus.
Module IV: Relational Database Design
Functional Dependencies, Normalization, Normal forms (1st, 2nd, 3rd, L2, L3
BCNF), Lossless decomposition, Join dependencies, 4th& 5th Normal 5
and L4
form, Database Design and Implementation Process, Physical database
design and Tuning.
Module V: Transaction Management and Concurrency Control
Techniques
L2, L3
Transaction concept, ACID properties, Schedules and recoverability, 4
Serial and Non-serial schedules, Serializability, Concurrency Techniques: and L4
Locking Protocols, Timestamping Protocol, Multiversion Technique,
Deadlock Concept - detection and resolution, 2 – Phase Locking.
Module VI: Backup and Recovery L1 and
Database recovery techniques based on immediate and deferred update, L2 3
Shadow pages and Write-ahead Logging.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Korth, Silberschatz, “Database System Concepts”, TMH,4th Ed., 2000.

2. Elmsari and Navathe, “Fundamentals of Database Systems”, A. Wesley, 6th Ed., 2004

Reference Books

1.Date C. J., “An Introduction to Database Systems”, Narosa Publishing, 7th Ed., 2004

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- - -

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

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

CO4 -- 1 2 -- -- 2 -- 3 -- -- -- -- 1 -- - 2

CO5 1 1 3 -- -- -- -- -- 2 -- -- -- 1 -- - -

1: strongly related, 2: moderately related and 3: weakly related

 IFT4218 Relational Database Management System L T P C
Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basic Concepts of DBMS

Co-requisites Relational Algebra and Relational Calculus

Catalog Description

This course is design to get students familiar with the basic concepts of SQL including DDL,
DML and DCL statements. The course also explains the basic concepts of PL/SQL. Students will
learn practical on Oracle software and hence can work on any RDBMS software.

Course Objectives

The objective of this course is

 To make students familiar with the concepts and working of SQL.

 Provide an overview of PL/SQL.

Course Outcomes

On completion of this course, the students will be able to

CO1. Illustrate SQL basic concepts like languages DDL, DML etc., data types and working.
CO2.Explain concepts of database creation, manipulation of data and data retrieval and apply
them in real database applications.
CO3.Design and implement various data constraints on a database for a given problem.
CO4. Solve queries using concepts like joins, sub queries, aggregate functions, triggers etc.
CO5.Prepare PL/SQL blocks.
 Blooms Number
Modules
level* of hours

Lab Session 1 L1 and

2
L2
Introduction of RDBMS, Oracle, SQL and data types.
Lab Session 2 L1and
2
L3
Basic concept of database creation and manipulation of data.
Lab Session 3 L1 and
2
L3
Working with SELECT query.
L1 and
Lab Session 4 2
To apply data constraints on a table-Primary Key, Not Null, Unique. L3

Lab Session 5 L1 and

2
L3
Working with Foreign Key and Check Constraint.
L1 and
Lab Session 6 2
To implement the basic concept of Aggregate and Grouping Functions. L3

L1 and
Lab Session 7 2
To apply various set operators on data. L3

L1 and
Lab Session 8 2
Concept of Nested queries in database and its application in database. L3

L1 and
Lab Session 9 2
Implementation different types of JOINS in database. L3

L1 and
Lab Session 10 2
Basic concepts of Triggers and Procedures and related queries. L3

L1 and
Lab Session 11 2
Introduction to PL/SQL and basic syntax. L3

Lab Session 12 L3 2
Write programs in PL/SQL Using Control Structures.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation
Text Books

1. Ivan Bayross , “SQL, PL/SQL the Programming Language of Oracle”, 4th Ed.,BPB
Publications,2009.

2. Lynn Beighley, “Head First SQL”, 1st Ed., O′Reilly, 2007.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35

IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V – Viva.

CO, PO and PSO mapping

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- - -

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

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

CO4 1 - 2 -- -- -- -- -- -- -- -- -- --- 1 1 --

CO5 1 - 2 -- -- -- -- -- 2 -- -- -- -- 1 -- -

1: strongly related, 2: moderately related and 3: weakly related

 IFT4305 Data Communication and Computer L T P C
Networks

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basics of Computer Network

Co-requisites Nil

Catalog Description

In this course the concepts of basic data communication and networking concepts are discussed
in details. The concepts related to routing/switching hardware, security, distributed client/server
applications and architecture, intranets and intranet servers and browsers, networks and network
servers, LANs/WANs, internetworking technologies will be introduced. The studies will be
made on impact of the OSI reference model for networking protocols, CSMA/CD, TCP/IP
implementation, frame relay, FDDI, X-25, ISDN services This course will assist in developing
the skills in basics of computer networks. The outcome of this course implicitly and explicitly
affects the abilities to understand and analyze the networking concepts

Course Objectives

The objective of this course is to

 Equip the students with concepts of data communication and computer network.

 Provide an overview of networking OSI, TCP/IP models, devices, media, protocols and layer
concepts.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain OSI model, Layers in OSI model and TCP/IP protocol suit. Describe topologies
with their advantages and disadvantages and transmission media.

CO2: Describe data transmission and data encoding schemes. Elaborate multiplexing and types
of spread spectrum.

CO3: Demonstrate various switching techniques. Also explain Frame Relay, ATM, Error
Detection Correction techniques, Flow Control- Stop and Wait mechanisms..
CO4: Describe the meaning of routers and issues in designing Routing Algorithms; Discuss
logical addressing, Ipv4 and IPv6.

CO5: Describe Transport Services, TCP, UDP, SCTP. Explain Congestion control and Quality of
Service.

Blooms Number
Modules
level* of hours

MODULE 1:

Introduction

Computer Network, Advantages and Disadvantages of Computer

Network, Communication system, Classification of networks, Network L1 and
models- OSI model, Layers in OSI model, TCP/IP protocol suite, L2 6
Transmission mode, LAN Architecture, LAN topologies-Bus, Tree, Ring,
Star, Mesh, Wireless LAN, Transmission Media- Twisted pair cable,
Coaxial cable, Optical Fiber, Wireless transmission media.

MODULE 2:

Data Transmission: Analog and Digital Signals, Periodic and Aperiodic

Signals, Transmission impairments, Data rate limits-noiseless channel and
noisy channel, Performance characteristics.

Data Encoding: Digital data-digital signals, Digital data-Analog signals,

Analog data- Digital signals, Analog data- Analog signals.
L1, L2 8
Multiplexing: Frequency Division Multiplexing, Wavelength Division
Multiplexing, Synchronous Time Division Multiplexing, Statistical Time
Division Multiplexing.

Spread Spectrum: Frequency Hopping Spread Spectrum (FHSS), Direct

Sequence Spread Spectrum (DSSS).

MODULE 3:

Data Link Layer L1, L2 8

Switching- Circuit switching Vs Packet Switching, Virtual Circuits-
Permanent Virtual Circuit Vs Switched Virtual Circuit, Frame Relay,
ATM, Error Detection and Correction, Flow Control- Stop and Wait,
Sliding Window, Error Detection, Error Control, HDLC,PPP

MODULE 4:

Network Layer

Routers, Routing Algorithms-Unicast routing algorithms-Distance vector L1, L2 8

routing, Link state routing, Path vector routing, multicast routing
algorithms, Logical addressing- IPv4, IPv6, transition from IPv4 to IPv6,
Address mapping, ICMP, IGMP.

Module V:

Transport layer L1, L2

6
Transport Services, TCP, UDP, SCTP, Congestion control, Quality of
Service (QoS).

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text :

1. B.Forouzan, Data Communications and Computer Networks, TH McGraw-Hill, 4th

edition,2006.
References:

1. K. Feher , Wi reless Digi tal Communicat ion, Jochen Schiller, Mobile

Communication, Pearson Education, PH 1995.

2. Data and Computer Communications, William Stallings Publisher:Prentice Hall, Seventh

Edition, 2005.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components CT1 A/C/Q Attd EE

Weightage (%) 15 10 5 70
CO, PO and PSO mapping

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

CO1 1 2 2 -- -- -- -- -- -- -- -- -- 1 1 - -

CO2 1 2 2 - -- -- -- -- -- -- -- -- 1 2 - -

CO3 1 2 - -- -- -- -- -- -- -- -- -- 1 2 - --

CO4 1 2 3 -- -- -- -- -- -- -- -- -- 1 2 - -

CO5 1 2 2 -- -- -- -- -- -- -- -- -- 1 2 - -

1: strongly related, 2: moderately related and 3: weakly related

 Data Communication and Computer
IFT4320 L T P C
Networks Lab

Version: 2020.1 Date of Approval : 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basics of CISCO router

Co-requisites NIL

Catalog Description

The course familiarizes with the equipment applications and protocols installed in enterprise
networks, with a focus on switched networks, IP Telephony requirements, and security. It also
introduces advanced routing protocols such as Enhanced Interior Gateway Routing Protocol
(EIGRP) and Open Shortest Path First (OSPF) Protocol. Hands-on exercises include
configuration, installation, and troubleshooting.

Course Objectives

The objective of this course is to

1. Make the students understand configuration of routing protocols.

2. Provide a demonstration of troubleshooting of different protocols.

Course Outcomes

On completion of this course, the students will be able to

CO1. Apply the knowledge of CISCO router to understand its basic configuration, Enterprise
network and implement inter-VLAN routing.

CO2. Demonstrate the configuration of OSPF and RIP protocol.

CO3. Demonstrate the configuration of EIGRP and BGP protocol.

CO4. Apply the knowledge of basic WAN connections using HDLC and PPP protocol.

CO5. Demonstrate the standard and extended ACL on router.

 Blooms Number
Modules
level* of hours

1. Drawing an Enterprise Network for Amity University showing

its different campuses
across the country.
2. Configuring all the devices (PCs, Servers, Switches) to create a
LAN within campuses L3, L5 4
of the Enterprise Network.
3. Configuring Virtual LANs (VLANs) in an Enterprise Network.
4. Configuring Trunking and Inter-VLAN Routing in an Enterprise
Network.
5. Implementing RIP (Routing Information Protocol) to enable L3, L5
communication between different LANs. 2
6. Implementing OSPF (Open Shortest Path First) to enable
communication between different LANs.
7. Implement EIGRP (Interior Routing Protocol) to establish L3, L5
connectivity within domestic campuses of the Enterprise Network.
8. Implement BGP (Border Gateway Protocol) and Redistribution 2
to establish connectivity etween different campuses of the
Enterprise Network.
9. Configuring WAN connectivity using protocols-HDLC and PPP. L3, L5
10. Implementing Frame-Relay to configure WAN service provider 2
cloud.
11. Configuring Standard and Extended ACLs on a Router. L3, L5
2
12. Troubleshooting Switching, Routing and ACL issues.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Data Communication and Networking by BehrouzForouzan,FourthEdition,TMH.

2. Computer Networks by A.S. Tanenbaum, Fifth Edition, Prentice Hall.
References Books

1. Data and Computer Communications by W. Stallings, Prentice Hall.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35
Note: IA –InternalAssessment, EE- ExternalExam, PR- Performance, LR – Lab Record, V –
Viva.

Software : Packet tracer.

CO, PO and PSO mapping

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

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

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

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

CO4 1 1 2 3 -- -- -- -- -- -- -- -- 1 1 2 --

CO5 1 1 2 3 -- -- -- -- -- -- -- -- 1 2 1 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4310 Design & Analysis of Algorithm L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 1 - 4

Pre-requisites/Exposure Basic knowledge of Data Structure

Co-requisites Nil

Catalog Description

The designing of algorithm is an important component of computer science. The objective of this
course is to make students aware of various techniques used to evaluate the efficiency of a
particular algorithm. Students eventually should learn to design efficient algorithm for a
particular problem.

Course Objectives

The objective of this course is to

1. Analyze the asymptotic performance of algorithms.

2. Introduce with major algorithms strategies and data structures.
3. Apply important algorithmic design paradigms and methods of analysis.
4. Provide efficient algorithms in technical design situations.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain use of asymptotic notations and analysis of various sorting techniques.

CO2: Explain the basic concepts of advanced data structures like Red Black Trees, Heapetc.

CO3: Describe principles of Greedy Algorithms and Dynamic Programming and apply the
strategy to solve various problems to analyze the complexity of algorithm.

CO4: Explain basic concepts of graphs and apply various design strategies to solve graph related
problems to analyze the complexity of algorithm.

CO5: Apply the various algorithms indifferent areas of Computer Science.

 Blooms Number
Modules
level* of hours

Module I : Introduction
Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity
L1, L2
of Algorithms, Asymptotic Notations, Growth of function, Recurrences 6
and their solution methods. Sorting in polynomial Time: Insertion sort, and L3
Merge sort, Heap sort, and Quick sort Sorting in Linear Time: Counting
sort, Radix Sort, Bucket Sort, Medians and order statistics
Module II : Advanced Data Structures
Red Black Trees, Augmenting Data Structure, Binomial Heap, B-Tree, L2, L3
Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of and L4 8
Algorithms on these data structures, Dictionaries and priority Queues,
mergeable heaps, concatenable queues
Module III : Advanced Design and Analysis Techniques L2, L3
8
Dynamic programming, Greedy Algorithm, Backtracking, Branch-and- and L4
Bound, Amortized Analysis
Module IV : Graph Algorithms
Elementary Graph Algorithms, Breadth First Search, Depth First Search,
Minimum Spanning Tree, Kruskal‟s Algorithms, Prim‟s Algorithms, L1, L3 8
Single Source Shortest Path, All pair Shortest Path, Maximum flow and
Traveling Salesman Problem
Module V: Advanced Topics
Randomized Algorithms, String Matching, NP-Hard and NP- L1,L2 6
Completeness, Approximation Algorithms, Sorting Network, Matrix
Operations, Polynomials and FFT, Number Theoretic Algorithms
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5:Synthesis,
L6:Evalllluation

Text Books

1. T. H. Cormen, Leiserson, Rivest and Stein, “Introduction of Computer algorithm”

2. E. Horowitz, S. Sahni, and S. Rajsekaran, “Funadmentals of Computer Algorithms,”
Galgotia Publication

Reference Books

1. Sara Basse, A. V. Gelder, “Computer Algorithms,” Addison Wesley

2. J.E Hopcroft, J.D Ullman, “Design and analysis of algorithms”., Addison Wesley
3. D. E. Knuth, “ The art of Computer Program, Addison Wesley
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 15 5 5 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

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

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 2 -- --

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

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

CO4 1 1 2 -- -- -- -- -- -- -- -- -- 1 2 -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4316 Design & Analysis of Algorithm Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure C Programming

Co-requisites Basic knowledge of Data Structure

Catalog Description

This course is intended to implement the various algorithm strategies for solving the problems
using programming language.

Course Objectives

The objective of this course is to

 Equip the students with implementation of various algorithms.

 Provide sound foundation of design strategies for problem solving.
 Measure and compare the performance of different algorithms.

Course Outcomes

On completion of this course, the students will be able to

CO1: Implement the concept of Divide and Conquer algorithms to solve various problems.

CO2: Demonstrate the use of Greedy Algorithms to solve various problems.

CO3: Apply the principle of Dynamic Programming to solve various problems.

CO4: Apply various design strategies to solve graph related problems.

 Blooms Number
Modules
level* of hours

1. Programs on sorting algorithms using Divide and Conquer

technique. L1,L3 2
 To implement Merge Sort.
 To implement Quick Sort.
2. Programs on algorithm based on Greedy Method.
L1,L3 4
 Implement Fractional knapsack.
 Demonstrate the Activity Selection Problem.
3. Programs on algorithm based on Dynamic programming.
 Implement 0/1 Knapsack problem.
 Compute the minimum number of multiplication for given L1,L3 6
set of matrices using Matrix Chain Multiplication.
 Compute the length of longest common subsequence for
given sequences using LCS.
4. Programs on Graph Algorithms.
 Print all the nodes reachable from a given starting node in
a digraph using BFS method.
 Check whether a given graph is connected or not using
DFS Method.
 Find minimum spanning tree of a given graph using Prim‟s L1,L3 10
algorithm.
 Find minimum spanning tree of a given graph using
Kruskal‟s algorithm.
 Implement Single Source Shortest Path problem using
Dijkstra‟s algorithm.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5:Synthesis, L6:Evaluation

Text Books

 T. H. Cormen, Leiserson, Rivest and Stein, “Introduction of Computer algorithm”

 E. Horowitz, S. Sahni, and S. Rajsekaran, “Funadmentals of Computer Algorithms,”
Galgotia Publication
Reference Books

 Sara Basse, A. V. Gelder, “Computer Algorithms,” Addison Wesley

 J.E Hopcroft, J.D Ullman, “Design and analysis of algorithms”., Addison Wesley
 D. E. Knuth, “ The art of Computer Program, Addison Wesley
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V
70
5 10 10 5

Note: IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V –
Viva.

CO, PO and PSO mapping

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

CO1 1 -- 1 -- -- -- -- -- -- -- -- -- -- 1 -- --

CO2 1 -- 1 -- -- -- -- -- -- -- -- -- -- 1 -- --

CO3 1 -- 1 -- -- -- -- -- -- -- -- -- -- 1 -- --

CO4 1 -- 1 -- -- -- -- -- -- -- -- -- -- 1 -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4313 L T P C
Software Engineering

Version: 2020.1 Date of Approval: 19, July 2020 3 - - 3

Pre-requisites/Exposure Basic Knowledge of software development

Co-requisites Nil

Catalog Description

In this course the concepts of Software development are discussed in detail. Various models of
SDLC are introduced along with its application. Students will be able to apply these concepts in
real time software project development.

Course Objectives

The objective of this course is to

 Gain the knowledge of how Analysis, Design, Implementation, Testing and Maintenance
processes are conducted in a software project.

 Apply their foundations in software engineering to adapt to readily changing environments

using the appropriate theory, principles and processes
Course Outcomes

On completion of this course, the students will be able to

CO1: Apply current theories, models, and techniques that provide a basis for the software
Lifecycle.

CO2: Enable the students to apply a systematic application of scientific knowledge in creating
and building cost effective software solutions to business and other types of problems.

CO3:Be able to elicit, analyze and specify software requirements through a productive
Working relationship with various stakeholders of a software development

CO4:Be able to evaluate the impact of potential solutions to software engineering problems in a
global society, using the knowledge of contemporary issues and emerging software engineering
trends, models, tools, and techniques.

CO5:Work as an individual and as part of a multidisciplinary team to design, develop and deliver
quality software
 Blooms Number
Modules
level* of hours

MODULE 1:
L1, L2
Introduction Software life cycle models: Waterfall, Prototype, 5
Evolutionary and Spiral models, Overview of Quality Standards like ISO and L4
9001, SEI-CMM

MODULE 2:

Software Metrics and Project PlanningSize Metrics like LOC, Token L2, L3
Count, Function Count, Design Metrics, Data Structure Metrics, and L6 7
Information Flow Metrics. Cost estimation, static, Single and multivariate
models, COCOMO model, Putnam Resource Allocation Model, Risk
management
MODULE 3:

Software Requirement Analysis, design and coding Problem Analysis,

L2, L3
Software Requirement and Specifications, Behavioural and non- 8
behavioural requirements, Software Prototyping Cohesion & Coupling, and ,L5
Classification of Cohesiveness & Coupling, Function Oriented Design,
Object Oriented Design, User Interface Design Top-down and bottom-up
Structured programming, Information hiding
MODULE 4:

Software Reliability, Testing and Maintenance Failure and Faults,

Reliability Models: Basic Model, Logarithmic Poisson Model, Software L2, L3
process, Functional testing: Boundary value analysis, Equivalence class and 10
testing,Structural testing: path testing, Data flow and mutation testing, L4,L6
unit testing, integration and system testing, Debugging, Testing Tools, &
Standards.Management of maintenance, Maintenance Process,
Maintenance Models, Reverse Engineering, Software RE-engineering

MODULE 5:

UML Introduction to UML,Use Case Diagrams, Class Diagram: State

Diagram in UMLActivity Diagram in UMLSequence Diagram in
UMLCollaboration Diagram in UML, Domain, Component Diagram and
Deployment Diagram L3,L4,L5 6

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation
Text Books:

1. K. K. Aggarwal&Yogesh Singh, “Software Engineering”, 2nd Ed, New Age International,

2005.
2. R. S. Pressman, “Software Engineering – A practitioner‟s approach”, 5th Ed., McGraw Hill
Int. Ed., 2001.

Reference Books:

 R. Fairley, “Software Engineering Concepts”, Tata McGraw Hill, 1997.

 P. Jalote, “An Integrated approach to Software Engineering”, Narosa, 1991.
 Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN, 1996.
 James Peter, W. Pedrycz, “Software Engineering”, John Wiley & Sons.
 Sommerville, “Software Engineering”, Addison Wesley, 1999.
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

CO1 -- 1 2 -- -- -- -- -- -- -- -- -- 1 -- -- --

CO2 1 -- 2 3 -- -- -- -- -- -- 4 -- 1 2 -- --

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

CO4 - 1 - -- 2 -- -- -- -- -- -- -- 2 1 -- --

CO5 -- -- 1 -- -- -- -- -- 2 -- -- -- -- -- -- 1

1: strongly related, 2: moderately related and 3: weakly related

 IFT4314 L T P C
Computer Graphics & Multimedia Systems

Version: 2020.1 Date of Approval: 19, July 2020 3 - - 3

Pre-requisites/Exposure Basic Knowledge of C Programming

Co-requisites NIL

Catalog Description

This course presents basic principles for the design, use and understanding of computer graphics
systems. This course includes various algorithms and their complexity to draw graphics objects.
This course also teaches the students about different algorithms for 2D /3D transformation,
clipping operations on objects, hidden surface removal and detection. This course is intended to
describe technical characteristics and performance of multimedia system and terminals.

Course Objectives

The objective of this course is to

 Equip the students with mathematical concepts of graphics algorithm and their
implementation to draw objects using C language.
 Provide an overview of various color filling algorithms, 2D & 3D transformation, clipping
operations, algorithms related to hidden surface detection and elimination and their
implementation.
 Provide an overview of different multimedia technologies like audio and video including
multimedia devices. The course also includes some practical sessions on these technologies.

Course Outcomes

On completion of this course, the students will be able to

CO1: Define various standards and components in development of computer graphics.

CO2: Explain generation of graphics primitives and analyse their problems and solutions.

CO3: Demonstrate solid filling using polygon fill algorithm with interior region testing
methods.

CO4: Apply 2D geometric transformations on 2D graphics objects with their practical

implementation.
CO5: Illustrate use of coordinate mapping and their transformation and analyse use of line and
polygon clipping algorithms.

CO6: Apply 3D geometric transformations on 3D objects with their practical implementation and
assess logic behind visible surface detection algorithms with practical implementation of 3D
transformations.

CO7: Describe basic principles of multimedia systems, animation and graphics library functions
used in animation design.

Blooms Number
Modules/Topics Covered**
level* of hours

Module I: Overview of Graphics System

Application of computer graphics, Video Display Devices, Raster Scan
Display, Random Scan Display, Input Devices, Graphic Software and L1, L2
graphics standards, Numerical based on Raster and Random scan display, and L3 5
Frame buffer, Display processor, picture construction technique in
interactive computer graphics.

Module II: Output Primitives

Scan conversion, Points and Lines, Line-Drawing Algorithm, Circle
Generation Algorithms, Ellipse Generation Algorithm, Area fill
L1, L2
algorithms for various graphics primitives: Scan line fill algorithm, 5
boundary fill algorithm, flood fill algorithm, Polygon representation, and L3
various method of Polygon Inside test: Even-Odd method, winding
number method, Various techniques for character generation.

Module III: Two Dimensional Geometric Transformations

Basic Transformations, Composite Transformation, Translation, Rotation, L2, L3
Scaling, General Pivot-Point Rotation, General Fixed Point Scaling, 5
and L4
General Scaling Directions, Reflection, Shear, Raster Methods for
Transformations.
Module IV: Two-Dimensional Viewing
Window to view Port Co-ordinate Transformation, Anti aliasing and
filtering techniques, Clipping Operations, Cohen Sutherland Line L2, L3
Clipping algorithm, Sutherland Hodgeman Polygon Clipping algorithm, 6
and L4
fractal geometry methods, fractal dimensions, Geometric construction of
deterministic self-similar fractals, Iterated function system to generate
fractals.
Module V: Three Dimensional Geometric and Modeling Transformations 6
L2, L3
3D viewing: 3 dimensional viewing parameters, Homogeneous coordinate
representation, Advantages and disadvantages of homogeneous coordinate and L4
system, Translation, Rotation, Scaling, Other 3DTransformations,
Composite Transformation, and Projections: Parallel projections,
perspective projections, and oblique projection.
Module VI: Visible- Surface Detection Methods
Bezier curves and Bezier surfaces, B-spline curves and surfaces,
Overview of Visible Surface Detection Algorithm, Concept of light
L2, L3
source, secular and diffuse reflection, Illumination through light source, 6
Shadow and its types, Depth-Buffer Method, A Buffer Method, Scan-Line and L4
Method, Binary search partition method, painter‟s algorithm or depth
sorting method.

Module VII: Introduction to multimedia

Elementary image processing techniques, Introduction to Animation, L1, L2
software used in animation, Design of animation sequence, graphics and L3 3
library functions used in animation design.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.

Text Books

 Computer Graphics, Donald Hearn, M Pauline Baker, 2nd Edition, PHI 1999
 Schaum Series, Computer Graphics

Reference Books

 Computer Graphics, N. Krishnamurthy, TMH

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components CT1 PR. ATTD. EE

Weightage (%) 15 10 5 70
CO, PO and PSO mapping

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

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

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

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

CO4 1 1 2 2 2 -- -- -- -- -- -- -- 2 2 2 --

CO5 1 3 2 1 1 -- -- -- -- -- -- -- 3 2 2 --

CO6 1 3 2 1 1 -- -- -- -- -- -- -- 2 2 2

CO7 1 3 1 -- -- -- -- -- -- -- -- -- 2 -- -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4319 Computer Graphics & Multimedia Systems L T P C
Lab
Version: 2020.1 Date of Approval: 19, July 2020 - - 2 1

Pre-requisites/Exposure Basic Knowledge of C Programming

Co-requisites Nil

Catalog Description

This course presents basic principles for the design, use and understanding of computer graphics
and multimedia systems. This course includes various algorithms and their complexity to draw
graphics objects. This course also teaches the students about different algorithms for 2D /3D
transformation, clipping operations on objects, hidden surface removal and detection.

Course Objectives

The objective of this course is to

 Equip the students with mathematical concepts of graphics algorithm to draw objects using C
language.
 Provide an overview of various 2D & 3D transformation, clipping operations, algorithms
related to hidden surface detection and elimination and their implementation.

Course Outcomes

On completion of this course, the students will be able to

CO 1: Define various standards and components in development of computer graphics.

CO 2: Explain generation of graphics primitives and analyze their problems and solutions.
Demonstrate solid filling using polygon fill algorithm with interior region testing methods.

CO 3: Apply 2D geometric transformations on 2D graphics objects with their practical

implementation.

CO4: Illustrate use of coordinate mapping and their transformation and analyze use of line and
polygon clipping algorithms.

CO 5: Apply 3D geometric transformations on 3D objects with their practical implementation

and assess logic behind spline curves and surfaces.
 Blooms Number
Modules
level* of hours

Module I: Introduction of Graphics

1. Demonstrate the use of graphics library functions to draw various

graphics objects. L3,L5 2
2. Demonstrate the use of graphics library functions to draw pie chart.
3. Demonstrate the use of graphics library functions to draw bar chart
on screen.

Module II: Graphics Primitives

1. Demonstrate the use of DDA line drawing algorithm to draw line

on the screen when m<=1 and m>1.
2. Demonstrate the use of DDA line drawing algorithm to draw line
on the screen when m<=1 and m>1.
3. Demonstrate the use of Breshenham‟s line drawing algorithm to
L3,L5 6
draw line on the screen when m<=1 and m>1.
4. Demonstrate the use of circle drawing algorithm to draw circle on
the screen.
5. Write a program to draw characters on screen using bitmap
character generation method.
6. Write a program to fill a polygon using boundary fill algorithm.
7. Write a program to fill a polygon using flood fill algorithm.

Module III: Transformation

1. Write a program to translate a triangle where translation factors

are tx=20 and ty=30.
2. Write a program to rotate a triangle in clock-wise and anti-clock-
wise direction where rotation angle is 300.
3. Write a program to scale a square where scaling factors are Sx=2 L3,L5 6
and Sy=3.
4. Write a program to reflect a triangle about X axis.
5. Demonstrate combine 2D transformation after applying
translation, rotation and scaling transformations.
6. Write a program to demonstrate fix point scaling where scaling
factors are Sx=2 and Sy=3.
Module IV: Segment

1. Write a program to demonstrate line clipping algorithm to clip a L3,L5 4

line where line slop is m<=1.
2. Write a program to demonstrate window to viewport
 transformation and liner mapping of the object coordinates in
viewport where size of viewport is half to the size of window.
3. Write a program to clip a polygon using Sutherland hodgeman
polygon clipping algorithm.
Module V: 3-D Transformation and Visible surface detection

1. Write a program to translate a 3D triangle where translation

factors are tx=20 and ty=30.
2. Write a program to rotate a 3D triangle in clock-wise and anti-
clock-wise direction where rotation angle is 300. 6
3. Write a program to scale a 3D square where scaling factors are L3,L5
Sx=2 and Sy=3.
4. Demonstrate combine 3D transformation after applying
translation, rotation and scaling transformations.
5. Write a program to draw Bezier curve and spline curve on the
screen with 4 control points.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6: Evaluation

Text Books

1. Computer Graphics, Donald Hearn, M Pauline Baker, 2nd Edition, PHI 1999

2. Schaum Series, Computer Graphics

Reference Books

1. Computer Graphics, N. Krishnamurthy, TMH

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35

Note: IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V –
Viva.
CO, PO and PSO mapping

1: strongly related, 2: moderately related and 3: weakly related

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

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

CO2 1 1 1 -- -- -- -- -- -- -- -- -- 2 1 -- --

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

CO4 1 1 2 2 2 -- -- -- -- -- -- -- 2 -- 1 --

CO5 1 3 2 1 1 -- -- -- -- -- -- -- 2 3 2 --

IFT4415 Mobile Computing L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basic knowledge of Computer Networks

Co-requisites Nil

Catalog Description

The objective of this consortium is to shape and expand a full-scale and sound mobile computing
system market. To achieve this, cooperation is required of interests related to communication
(network), computer hardware/software, system integrators (including service providers), and the
media.

Course Objectives

The objective of this course is to

 Give a general overview of the cellular technology and the associated terms and discuss the
generations of the mobile technologies starting from 1G to 3G techniques.
 Illustrate the GPRS and WAP model for 2G internet connectivity in detail.
 Elaborate the third-generation mobile services
 Describe the Global Mobile Satellite Systems in detail and basic architecture of Bluetooth
technology and advanced topics in mobile computing.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain the basic concepts mobile technology, computing and basic architecture of PCS
and GSM.
CO2: Describe the mobile networking Infrastructure through 2G technologies (GSM, GPRS,
WAP).
CO3: Explain the basic concepts of 3G technologies (WCDMA, CDMA 2000) and WLL.
CO4: Discuss the working of mobile satellite systems like IRIDIUM and GLOBALSTAR.
CO5: Explain the concepts of Bluetooth technology, its working and protocols, virtual networks
and enterprise networks.

Blooms Number
Modules
level* of hours

Module I:Introduction to Personal Communications Services (PCS)

L1, L2
PCS Architecture, Mobility management, Networks signaling. 8
Global System for Mobile Communication (GSM) system overview: and L3
GSM Architecture, Mobility management, Network signaling.
Module II: General Packet Radio Services (GPRS) &Wireless
Application Protocol (WAP)
GPRS Architecture, GPRS Network Nodes. L1 and
Mobile Data Communication: WLANs (Wireless LANs) IEEE 802.11 10
L2
standard, Mobile IP.
Wireless Application Protocol (WAP): The Mobile Internet standard,
WAP Gateway and Protocols, wireless mark up Languages (WML).
Module III:Third Generation (3G) Mobile Services
Introduction to International Mobile Telecommunications 2000 (IMT
2000) vision, Wideband Code Division Multiple Access (W-CDMA), and L1 and
7
CDMA 2000, Quality of services in 3G. L2
Wireless Local Loop(WLL): Introduction to WLL Architecture, wireless
Local Loop Technologies.
Module IV: Global Mobile Satellite Systems L1 and
Global Mobile Satellite Systems; case studies of the IRIDIUM and 7
L2
GLOBALSTAR systems.
Module V:Enterprise Networks L1 and 4
Introduction to Virtual Networks, Blue tooth technology, Blue tooth
Protocols. Advanced techniques in mobile computing. L2

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5:Synthesis,
L6:Evalllluation

Text Books

1. “Wireless and Mobile Networks Architectures”, by Yi-Bing Lin &ImrichChlamtac, John

Wiley & Sons, 2001.
2. “Mobile and Personal Communication systems and services”, by Raj Pandya, Prentice Hall
of India, 2001.

Reference Books

1. “Wireless Web Development”, Ray Rischpater, Springer Publishing, 2000.

2. “The Wireless Application Protocol”, by Sandeep Singhal, Pearson Education Asia, 2000.
3. “Third Generation Mobile Telecommunication systems”, by P.Stavronlakis, Springer
Publishers, 2001.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 15 5 5 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

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

CO2 1 1 2 -- -- -- -- -- -- -- -- -- 1 -- 1 --

CO3 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- 2 --

CO4 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- 1 --

CO5 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- 1 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4312 L T P C
Programming With Java

Version: 2020.1 Date of Approval: 19, July 2020 3 0 - 3

Pre-requisites/Exposure Hands on Knowledge of C Programming

Co-requisites Basic concepts of C Programming

Catalog Description

The objective is to impart programming skills used in this object oriented language java.The
course explores all the basic concepts of core java programming like object,classes,data types,
features, operators, control structures, interfaces, packages, applets, awt, swings and socket
programming. The students are expected to learn it enough so that they can develop the basic
applications as well as web solutions like creating applets etc.

Course Objectives

The objective of this course is to

1. Equip the students with the basic feature of contemporary java required in solving complex
problems.

2. Provide a practical knowhow and implementation of java programming concepts like classes
, objects, packages, swings.

Course Outcomes

On completion of this course, the students will be able to

CO1: Define and explain concept of byte code and platform independence, demonstrate basic
java based application development using operators, if-else, loops and arrays. Distinguish
between various types of inheritances, polymorphisms and other concepts and able to solve
complex programming problems involving class objects, inheritances, and packages.

CO2: Explain event delegation model and describe AWT class hierarchy; Apply knowledge of
event handling and AWT controls create some new dynamic graphical applications.
CO3: Describe hierarchy of exception classes and thread life cycle along with demonstrate and
design solutions for some simple and complex applications using exception and multithreading
concepts.
CO4: Explain the JDBC architecture, ODBC and JDBC Drivers, Connecting to Database with
the java.sql Package, Using JDBC Terminology.
CO5: Explain the steps of user defined packages ; Explain the concept of swings, swing
package. Demonstrate applications based on java applets and swings. Descibe Servlets, Servlet
Life Cycle, Servlet based Applications, jdbc with servelets.

Blooms Number
Modules/Topics Covered**
level* of hours

Module I: Overview of Java

Introduction to Java, Java features, An Overview of Java, Data Types,
Variables, Arrays, Operators, and Control Statements, Introducing L1, L2
Classes, A Closer look at Methods and Classes, Inheritance, Packages and and L3 7
Interfaces, Exception Handling, Multithreaded Programming, I/O, and
Applets, Creating threads, implementing threads, threads priorities,
suspending, stopping & resuming threads, String Handling.
Module II: Java AWT and Swings
L1, L2
Introducing the AWT: AWT Controls, Working with Windows, Layout 7
Managers, and working with Swing, Event Handling Mechanism, Events, and L3
classes, sources of events, Networking, and Event Handling.

Module III: Collections and Generics

What are Generics? A Generic Class with Two Type Parameters, The
General Form of a Generic Class, Bounded Types, Creating a Generic L2, L3
8
Method, Generic Constructors, Generic Interfaces, Generic Class and L4
Hierarchies, Collections Overview, The Collection Interfaces, The
Collection Classes, Accessing a Collection via an Iterator, The Random
access Interface.
Module IV: JDBC L2, L3
Overview of JDBC architecture, ODBC and JDBC Drivers, Connecting to and L4 7
Database with the java.sql Package, Using JDBC Terminology.
Module V: JSP and servlets
Introduction to Servlets, Servlet Life Cycle, Servlet based Applications, L2, L3
7
jdbc with servelets, session Management techniques in detail, JSP: and L4
Introduction to JSP, JSP implicit objects, JSP based Applications, Java.
Net. Login & Logout Example, jdbc with jsp.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.
Text Books

1. Patrick Naughtan and Herbert Scheldt The Complete Reference, Java 2, TMH

Reference Books

1. Java 2 Unleashed (Techmedia – SAMS), Jamie Jaworski

2. Developing Java Servlets (Techmedia – SAMS), James Goodwill sing Java 1.2
Special Edition (PHI), Webber

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components CT1 PR. ATTD. EE

Weightage (%) 15 10 5 70

CO, PO and PSO mapping

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

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

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

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

CO4 1 3 2 -- -- -- -- -- -- -- -- -- 2 2 2 --

CO5 1 3 -- -- -- -- -- -- -- -- -- -- 1 1 -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4317 L T P C
Programming with Java Lab

2017.1 __ 0 - 4 2

Pre-requisites/Exposure Hands on knowledge of C and C++ Programming

Co-requisites Basic concepts of OOP Programming

Catalog Description

The objective is to impart programming skills used in this object oriented language java. The
course explores all the basic concepts of core java programming like object, classes, data types,
features, operators, control structures, interfaces, packages, applets, awt, swings and socket
programming. The students are expected to learn it enough so that they can develop the basic
applications as well as web solutions like creating applets etc.

Course Objectives

The objective of this course is to

 Equip the students with the basic feature of contemporary java required in solving complex
problems.

 Provide a practical knowledge of implementation/demonstration of java programming

concepts like classes, objects, packages, swings.

Course Outcomes

On completion of this course, the students will be able to

CO1: Demonstrate the basic java based application development using operators, if-else, loops
and arrays.

CO2: Demonstrate the concept of inheritances, polymorphisms and other concepts and able to
solve complex programming problems involving class objects.
CO3: Apply knowledge of event handling and AWT controls create some new dynamic
graphical applications.
CO4: Demonstrate and design solutions for some simple and complex applications using
exception and multithreading concepts, Database connectivity.
CO 5: Apply the knowledge of swing, io packages to implement various application programs.
Demonstrate applications based on java applets and swings.
 Blooms Number
Modules
level* of hours

1. Sample programs of basic java

a) Write a program & execute to display “hello java” in java.

b) Write a program & execute to demonstrate command line

L1, L2
arguments in java. 4
and L3
c) Write a program & execute to find maximum of command line
arguments in java.

d) Write a program & execute to find sum of two numbers in java,

take input from user.

2. Sample programs of Inheritance, String classes, abstract function

and interface

a) Write a program & execute in java to perform area and volume

calculations in java using concept of inheritance.

b) Write a program & execute in java to demonstrate abstract class in L2, L3

java 4
and L4
c) Write a program & execute in java to perform complex number
arithmetic using class and object.

d) Write a program & execute to make use of interface in java

Write a program & execute in java to sort an array of strings using string
class functions.

3. Sample programs of AWT and event handling

a) Write your first applet in java

b) Write a program & execute to find maximum of two numbers in L2, L3,
L4 and 4
java using applet.
L5
c) Write a program & execute to draw basic shapes in java using
graphics

d) Write a program & execute to handle various mouse events

4. Sample programs of exception handling, multithreading and JDBC L2, L3 6
Connectivity
 and L4
a) Write a program & execute to demonstrate threads in java
b) Write a program & execute to demonstrate synchronization in
threads in java.
c) Write a program & execute to create your own exception and use
it in java
d) WAP to connecting a database using user-id and password.
c) WAP to insert data into the database using the prepared statement
5. Sample programs on java packages and Servlets
a) Create your own package to create two simple functions in
different/same classes and access them in and outside the
package.
b) Write a program to create servlets based applications. L2, L3 6
c) WAP for authentication, which validate the login-id and and L4
password by the servlet code
d) WAP to include a HTML page into a JSP page,WAP to handle
the JSPException

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6: Evaluation

Text Books

3. Computer Graphics, Donald Hearn, M Pauline Baker, 2nd Edition, PHI 1999

4. Schaum Series, Computer Graphics

Reference Books

2. Computer Graphics, N. Krishnamurthy, TMH

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35

Note: IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V –
Viva.
CO, PO and PSO mapping

1: strongly related, 2: moderately related and 3: weakly related

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

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

CO2 1 1 1 -- -- -- -- -- -- -- -- -- 2 1 -- ---

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

CO4 1 1 2 2 2 -- -- -- -- -- -- -- 2 -- 1 ---

CO5 1 3 2 1 1 -- -- -- -- -- -- -- 2 3 2 --

IFT4418 L T P C
Software Project Management

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Software Engineering Concepts

Co-requisites Nil

Catalog Description

This course introduces the concepts to understand the fundamental principles of Software Project
management & provides a good knowledge of responsibilities of project manager and how to
handle these. It also discusses the different methods and techniques/tools used for project
management.

Course Objectives

The objective of this course is to

 To understand the working and functioning of the process of the software development so
that the project can be managed accordingly.
 To understand the engineering activities in the project life cycle
 To implement the management tools and quality standards
Course Outcomes

On completion of this course, the students will be able to

CO1: Describe fundamental principles of Software project management

CO2: Identify the key activities in managing a software project

CO3: evaluate and relate different software processes, system models

CO4: Plan software projects, including risk and quality management

CO5: Utilize technology tools for communication, collaboration, information management, and
decision support.

CO6: Apply software quality practices in software project.

Blooms Number
Modules
level* of hours

MODULE 1:

INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT

Definition of a Software Project (SP), SP Vs. other types of projects L1, L2 6
activities covered by SPM, categorizing SPs, project as a system,
management control, requirement specification, information and control
in organization.

MODULE 2:

STEPWISE PROJECT PLANNING

Introduction, selecting a project, identifying project scope and objectives, L1, L2
identifying project infrastructure, analyzing project characteristics, and L3 8
identifying project products and activities, estimate efforts each activity,
identifying activity risk, allocate resources, review/ publicize
plan.
.
MODULE 3:
L3,
PROJECT EVALUATION & ESTIMATION L4,and 9
Cost benefit analysis, cash flow forecasting, cost benefit evaluation L6
techniques, risk evaluation. Selection of an appropriate project report;
Choosing technologies, choice of process model, structured methods,
rapid application development, water fall-, V-process-, spiral- models,
Prototyping, delivery. Albrecht function point analysis.

MODULE 4:

ACTIVITY PLANNING & RISK MANAGEMENT

Objectives of activity planning, project schedule, projects and activities,
sequencing and scheduling activities, network planning model, L2, L3
representation of lagged activities, adding the time dimension, backward and L5 10
and forward pass, identifying critical path, activity throat, shortening
project , precedence networks. Risk Management: Introduction, the nature
of risk, managing risk, risk identification, risk analysis, reducing the risks,
evaluating risks to the schedule, calculating the z values.

MODULE 5:

RESOURCE ALLOCATION & MONITORING THE CONTROL

Introduction, the nature of resources, identifying resource requirements,
scheduling resources creating critical paths, counting the cost, being
specific, publishing the resource schedule, cost schedules, the scheduling L2, L3 10
sequence. Monitoring the control: Introduction, creating the frame work, and L5
collecting the data, visualizing progress, cost monitoring, earned value,
prioritizing monitoring, getting the project back to target, and change
control.

MODULE 6:

SOFTWARE QUALITY
L2,L3
Introduction, the place of software quality in project planning, the and L6 5
importance of software quality, defining software quality, ISO 9126,
Practical software quality measures, product versus process quality
management, external standards, techniques to help enhance software
quality.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Software Project Management (2nd Edition), by Bob Hughes and Mike Cotterell, 1999,
TMH
2. Software Engineering – A Practitioner‟s approach, Roger S. Pressman (5th edi), 2001, MGH
3. Software Project Management, Walker Royce, 1998, Addison Wesley.
Reference Books

1. Nasib Singh Gill, “Software Engineering”, Khanna Book Publishing Co. (P) Ltd.
2. Jumpstart to Software Quality Assurance by Vishnuvarthanan Moorthy -
Smashwords , 2013

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO mapping

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4

CO1 1 - -- -- -- -- -- -- -- -- -- -- 1 - -- -

CO2 - 1 2 - -- -- -- -- -- -- -- -- -- 2 -- --

CO3 -- - 1 2 - -- -- -- -- -- -- -- -- 2 -- ----

CO4 - 1 - 2 -- -- -- -- -- -- -- -- -- -- 3 --

CO5 - - - -- -- -- -- -- -- 1 1 2 ---- -- -- 4

CO6 -- - - - - - - 2 - - - - -- -- -- 4

1: strongly related, 2: moderately related and 3: weakly related

 IFT4421 L T P C
Software Project Management Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Software Engineering Concepts

Co-requisites NIL

Catalog Description

Study practical approaches for managing, planning, organizing and implementing Information
Systems projects using modern management techniques. Complete hands-on projects requiring
management of project resources, scope, time-line, cost, scheduling, human and other resources.
Use Microsoft Project and other project monitoring tools. In this Lab course MS Project tool is
used

Course Objectives

The objective of this course is to

 Demonstrate students to Manage the phases and infrastructure of IT projects

 Use project management software to control the design, implementation, closure, and
evaluation of IT projects

 Estimate, plan, calculate, and adjust project variables

Course Outcomes

On completion of this course, the students will be able to

CO1: Create plans at the level of detail that is appropriate for software project

CO2: Create and manage tasks, costs, work, and resources in a software project

CO3: Track and monitor project performance throughout its life-cycle

CO4: Explain quality management and process improvement in the context of software
development projects.
 Blooms Number
Modules/Topics Covered**
level* of hours

1. Introduction of tool including creating project

(a) Set file properties and calendar settings L3, L4 8

(b) Create Gantt Chart for SDLC process.
(c) Create Pert chart for SDLC process
.
2. Key activities of software Project Management

(a) Create a Gantt chart of wedding planning event management which

L3, L4 4
includes minimum of 12 activities..

(b) In the same Gantt chart split the tasks,copy ,move and paste tasks.

3. Checkpoints , milestones and Critical path concepts

(a) Create Gantt Chart of all testing activities which includes checkpoints
and milestones L3,
4
L4,L5
(b) In the same project review critical path.

4. Work Breakdown Structure

(a) Create Gantt chart of Agile approaches, also create work breakdown
structure of same
L3,
8
(b) Add different type of resources in same project L5,L6

(c) Perform the time estimations of tasks and set task dependencies.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.

Text Books

 Software Project Management (2nd Edition), by Bob Hughes and Mike Cotterell, 1999, TMH
 Software Engineering – A Practitioner‟s approach, Roger S. Pressman (5th edi), 2001, MGH
 Software Project Management, Walker Royce, 1998, Addison Wesley.
Reference Books

 Step By Step Microsoft Project 2010 by Carl S. Chatfield, Timothy D. Johnson,2002

 Jumpstart to Software Quality Assurance by Vishnuvarthanan Moorthy - Smashwords , 2013

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

Components A PR LR V

Weightage 5 10 10 5 70
(%)

Note: IA –Internal Assessment, A – Attendance, PR – Performance, LR – Lab Record, V – Viva,

EE- External Exam

CO, PO and PSO mapping

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

CO1 - 1 2 3 -- -- -- -- -- -- 4 -- 1 -- -- --

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

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

CO4 - 2 -- -- -- -- -- -- -- -- 1 -- -- -- 1 3

1: strongly related, 2: moderately related and 3: related

 IFT4419 L T P C
Artificial Intelligence

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basic Knowledge of Searching Techniques

Co-requisites Nil

Catalog Description

In this course the concepts of basic principles, techniques, and applications of Artificial
Intelligence are discussed in detail. As a precursor to the study of the course it provide an in
depth understanding of basic areas of artificial intelligence, search techniques, knowledge
representation, learning and their applications in design and implementation of intelligent agents
for a variety of task. The concepts further enhances the understanding of key components of
intelligent agents of moderate complexity in Prolog and evaluate their performance.

Course Objectives

The objective of this course is to

1. Equip the students with concepts of Artificial Intelligence, its application, importance and
characteristics.

2. It Provide an overview of different concepts such as searching, knowledge, Learning,

Robotics, Expert System and Prolog

1. Course Outcomes

On completion of this course, the students will be able to

CO1: Explain the concept of Artificial Intelligence, its application, importance of Artificial
Intelligence.

CO2: Analyze the different searching technique and understanding their applications.

CO 3: Explain the concept of knowledge representation, the different techniques, handling

uncertainty in knowledge and making different types of decisions.

CO4: Explain the concept of Expert System and its application areas.

CO5: Explain the concept of NLP and the functionality of Robots

 Blooms Number
Modules
level* of hours

MODULE 1:

Problem solving and Scope of AI: Introduction to Artificial Intelligence.

L1 and
AI-Applications- Games, theorem proving, natural language processing 8
(NLP), vision and speech processing, robotics, expert systems. Solving L2
Problems by Searching, beyond classical search, adversarial Search,
constraint satisfaction problems

MODULE 2:

Knowledge and Representation: Logical Agents, First-Order Logic,

Inference in First-Order Logic, Classical Planning, Planning and Acting in L2, L3
the Real World, Knowledge Representation. 14
and L4
Uncertain Knowledge and Reasoning- Quantifying Uncertainty,
Probabilistic Reasoning , Probabilistic Reasoning over Time , Making
Simple Decisions, Making Complex Decisions.

MODULE 3:

Expert System:
L2, L3
Need and justification for expert systems, knowledge acquisition, Case 10
studies: MYCIN, RI. and L4
Learning:-Learning from Examples, Knowledge in Learning, Learning
Probabilistic Models, Reinforcement Learning.

MODULE 4:

Module IV: Communicating, Perceiving, and Acting

L3,L4
NLP-Natural Language Processing, Natural Language for and L5 10
Communication, Perception.
Robotics:- Fundamentals of Robotics, Sensors and vision system, Robot
Programming languages & systems

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation
Text Books:

1. Stuart Russell, Peter Norvig “Artificial Intelligence: A Modern Approach”,3 rd

Edition,Pearson Publication,Edinburgh,2014.
2. E. Rich and K. Knight, “Artificial intelligence”,3rd Edition, McGraw-Hill Education
Publication,Delhi,2009

Reference Books:

1. P. H. Winston, "Artificial Intelligence",3rd Edition, Pearson Education Publication , 2002.

2. R. J. Schalkoff, “Artificial Intelligence – An Engineering Approach”, 1st Edition,McGraw
Hill Int. Ed. Publication, Singapore, 1992.
.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

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

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

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

CO4 1 1 2 -- -- -- 2 -- -- -- -- -- 2 1 3 --

CO5 1 1 2 -- -- -- 2 -- -- -- -- -- 3 1 3 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4422 Artificial Intelligence Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basics of C Concepts

Co-requisites NIL

Catalog Description

In this Lab course Prolog programs are implemented and demonstrated. The Concepts that are
covered would enable them to achieve the desired goal by creating facts and rules. Programs will
be related to concepts of creating facts, facts with argument, backtracking, arithmetic operations
in prolog, nesting condition, looping condition and List handling.

Course Objectives

The objective of this course is to

1. Make the students apply knowledge of Prolog to attain goal by creating and matching rules
and facts developed in the knowledge base.
2. Provide a demonstration of Prolog programming concepts like facts with
arguments,Backtracking
Course Outcomes

On completion of this course, the students will be able to

CO1: Apply the knowledge of Prolog programming to provide solution to the given AI problem.

CO2: Demonstrate the use of List handling in Prolog by performing various functions which are
based on finding the element, replacing an element and appending the two lists.

CO3: Apply the knowledge of Facts and Rules in Prolog to reach a particular goal by
implementing different concepts such as facts with arguments, backtracking, and looping
conditions.
 Blooms Number
Modules/Topics Covered**
level* of hours

5. Sample Programs using Basic of Prolog Programming

(d) Write a program to understand the basic structure of Prolog

L1,L3,
programming. 4
(e) Write a program to create simple facts using prolog. L5
(f) Demonstrate an application of facts with arguments by showcasing
the use of facts to reach a particular goal.

6. Sample Programs using Rules based Programming in Prolog

(c) Create an rule based programs in Prolog

L3, L5 4
(d) Write a program to implement the concept of backtracking which
matches each rules with a query

7. Sample Programs to implement the concept of input/output operation

in Prolog

(c) Create a Prolog program which accept a user input and display back
the result.

(d) Design an application to fetch data in the form of numeric data and
L3, L5 6
display the given result

(e) Demonstrate the process of arithmetic operations in Prolog

Programming.

(f) Demonstrate the working of menu driven calculator to perform

different arithmetic operations.

8. Sample Programs to implement the concept of nesting and looping

condition in Prolog

(d) Write a prolog program to demonstrate the looping condition by

implementing the concept of finding out the factorial of a given
L3, L5 6
number.

(e) Write a prolog program to demonstrate the conditional statement in

Prolog by implementing the concept of finding out the maximum of
three numbers, to calculate the area of a cube.

9. Sample Programs using List Handling in Prolog L3, L5 4

 (a) Demonstrate the use of List handling in Prolog which include finding
an element, replacing an element

(b) Write a program to append two givsen list created in Prolog

Programming.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.

Text Books:

1. Stuart Russell, Peter Norvig “Artificial Intelligence: A Modern Approach”,3rd

Edition,Pearson Publication,Edinburgh,2014.
2. E. Rich and K. Knight, “Artificial intelligence”,3rd Edition, McGraw-Hill Education
Publication,Delhi,2009

Reference Books:

1. P. H. Winston, "Artificial Intelligence",3rd Edition, Pearson Education Publication , 2002.

2. R. J. Schalkoff, “Artificial Intelligence – An Engineering Approach”, 1st Edition,McGraw
Hill Int. Ed. Publication, Singapore, 1992.
.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

Components A PR LR V

Weightage 5 10 10 5 70
(%)

Note: IA –Internal Assessment, A – Attendance, PR – Performance, LR – Lab Record, V – Viva,

EE- External Exam
CO, PO and PSO mapping

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

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

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

CO3 2 1 2 -- -- -- -- -- -- -- -- -- 2 1 -- --

1: strongly related, 2: moderately related and 3: weakly related

IFT4315 L T P C
Business Management

Version: 2020.1 __ 3 0 0 3

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

 The basic management concepts and use of management principles in the organization will
be introduced to student. Student gain understanding of the functions and responsibilities of
the manager and understand Human Behaviour in organizations which improves their
managerial effectiveness.
 Provide the students exposure to modern marketing concepts, tools, and techniques, and help
them develop abilities and skills required for the performance of marketing functions.
 The financial aspect of business and management will be taught to student through this
subject. This will benefit student in understanding and analyzing financial statements of a
business. Student will learn Financial Accounting
 To provide a thorough understanding of the essential characteristics and the basic tenets of
research methodology and report preparation. The course will focus research methods and
techniques that are essential for the validity and reliability of the research process. The
course will identify and review the components essential for preparation of research
proposals, research reports, business proposals and feasibility studies in order to develop
report writing and formal presentation skills of the research projects undertaken.
Course Objectives

The objective of this course is to

1. Acquire the basic knowledge of business management into the HR functional levels and application
of knowledge to understand the fundamentals of organization..

2. Impart knowledge about how to Marketing plays an important role into the business growth and
functions of marketing in details

3. Understand the financial accounting and process of making the financial records for the business
needs.

4. Provide the fundamental understanding of the business research, the various approaches and
hypothesis for the product.

Course Outcomes

On completion of this course, the students will be able to

CO1: Outline and distinguish various management functions and different type of organization,
along with the various functional leadership and motivational theories which are essential for the
business growth.

CO2: Identify the various marketing functions, 4P‟s and their roles and interpret the functional
attribute of each P‟s in detail which will help the student to learn more of the business needs and
requirements.

CO3:Identify the various entries that need to be recorded in the accounting records and their
posting, estimate the impact of them on the business growth, in the form of either Gross /Net –
Profit/Loss and the capability to interpret various business financial entireties and problem and
challenges into domains accounting environment and demonstrate the skill to handle the issues
related to trading account, manufacturing account, profit and loss account by analyzing and
summarizing using principles and formats studied and generating the balance sheets to final
positions of the company at that moment of time. Acquire the knowledge of the financial
accounting process and procedures which will further help to understand the bookkeeping and
accounting of the business line.

CO4: Define and explain importance of business research , the process and the hypothesis
testing, that helps the students to under stake any new research either academic or professional,
into the business or real world, thus giving the information about the different types parametric
and non-parametric testing and further making the research level environment
CO5: Assess the various steps into the report writing and determine the types of formats of the
report writing required into the professional world.

Course Contents:

Blooms Number of
Modules
level* hours

Module I : Principles Of Management And Organizational Behaviour

Management – Need, Scope and Process; Managerial Levels; Managerial

Functions – Planning, Organizing, Staffing, Directing and Control ; Types of L1, L2 and
7
Managers – Functional, Specific, Line, Generic; Organization – Need, L3
Process and Types of Organizational Structure

Organizational Behavior : Need and Importance, Johari Window

Module II : Marketing Management - Fundamentals of Marketing

Philosophies of Marketing Management, Scanning the Marketing
Environment, Marketing Mix Elements, Difference between marketing and
Selling, The factors influencing consumer behavior, Market Segmentations,
Levels of Market Segmentations,
L2, L3 and
Product Mix - Classification of products, New Product development, stages L4
7
of product development product life cycle ; Promotion Mix - Advertising,
Personal Selling, Sales Promotion and Publicity and Public Relations, Direct
Marketing ; Place Mix - Channel functions and flows, Logistics and
Distribution decisions, Types of Channel Partners ; Price Mix - Setting the
price, adapting the price, initiating and responding the price changes.

Module III : Financial Accounting - Double Entry Accounting system,

Concepts and conventions in accounting, Accounting process; Journalisation L2, L3 and
: Rules for Journalisation, posting in a Ledger, subsidiary books, preparation 7
of Trial balance; Final Accounts Preparation of Trading and profit and loss L4
Account and Balance sheet.

Module IV : Research Methodology - Objective, significance and types of

research, Research Process, Identifying and Defining the Research Problem,
Developing the Hypotheses, Steps to Design the Research, Sampling Design L1, L2 and
Methods and Scaling 6
L3
Techniques, Common sources of Error in the Field Work, Data Collection –
Types and sources, Format of the Research Report

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text:
1. Module 1st : Luthans, F. (2005), Organizational Behaviour, McGraw – Hill International Edition.
2. Module 2nd : RajanSaxena, (2010) , Marketing Management,Tata McGraw
3. Module 3rd :Maheshwari S N and SK Maheshwari (2006), Accounting for Management, Vikas Pub.
House
4. Module 4th: Kothari C R, (1990) Research Methodology: Methods & Techniques, Vikas Publishing
House Pvt.Ltd., 1978.

References:

1. Kotler, Keller, Koshy, Jha, (2008), Marketing Management– A South Asian Perspective, Pearson
India Pvt.
2. Kurtz, (2008) Principles of Marketing, Cengage Learning, India,
3. S. Neelamegham, (2009), Marketing In India,Vikas publishing house,
4. Cooper, Donald R and Schindler, Ramela (2000) Business Research Methods, Tata Mc Graw Hill
5. Srivastava, Shenoy and Sharma (2002)., Quantitative Techniques for Business Decisions, 4th Ed ,
Allied Publishers
6. Dr .S. Shajahan ( 2004) , Research Methods for Management 2nd Edition, Jaico Publishers

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components CT1 HA ATTD. EE

Weightage (%) 10 15 5 70

CT: Class Test, HA: Home Assignment, Attd: Attendance , EE: End Semester Examination

CO, PO and PSO mapping

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

CO1 1 1 2 -- -- -- -- -- -- -- -- -- 1 -- 2 --

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

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

CO4 1 1 1 -- 3 -- -- -- -- -- -- -- 1 -- 2 --

CO5 1 1 1 -- 3 -- -- -- -- -- -- -- 1 -- 2 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4545 L T P C
Seminar

Version: 2020.1 Date of Approval: 19, July 2020 0 0 0 3

Pre-requisites/Exposure Basics of Networks

Co-requisites Nil

Catalog Description

The educational process in the internship course seeks out and focuses attention on many latent
attributes, which do not surface in the normal classroom situations. These attributes are
intellectual ability, professional judgment and decision-making ability, inter-disciplinary
approach, skills for data handling, ability in written and oral presentation, sense of responsibility
etc. In this course the concepts of different new ideas will be explored by the seminar
presentation.

Course Objectives

The objective of this course is to

1. Equip the students with concepts of new technologies.

2. Equip students with Report writing and Presentation skills.

Course Outcomes

On completion of this course, the students will be able to

CO1: Make a report on relevant topic by the study of literatures.

CO2: Demonstrate the topic of seminar by use of power presentation.

CO3: Demonstrate the challenges and applications of the topic of the seminar.

Text Books

As per topic of seminar.

Reference Books
As per topic of seminar.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components V PPT R IM

Weightage (%) 20 20 30 30

V – Viva, PPT-Power Point Presentation, R – Report, IM-Internal Marks

CO, PO and PSO mapping

PO PO PO PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO 7 PO 8 PO 9
10 11 12 1 2 3 4

CO1 2 1 2 -- -- -- -- -- 2 -- -- -- 2 2 2 2

CO2 -- -- -- -- -- -- -- -- 2 -- -- -- 2 2 1 2

CO3 2 2 2 -- -- -- -- -- 2 1 -- -- 2 2 2 2

1: strongly related, 2: moderately related and 3: weakly related

IFT4512 L T P C
Data Warehousing and Data Mining

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basic Knowledge on Database

Co-requisites Nil

Catalog Description
In this course the concepts of Data warehouse and Data Mining are discussed in detail. The
different data mining techniques such as clustering, classification, association are introduced. As
a precursor to the study of data warehouse its architecture, types of OLAP Servers, and usage of
OLAP are studied in detail. The concepts further enhances the concept of different attributes
supported by data mining process, application of data mining in marketing,banking,retail sector
and other areas are analyzed. .

Course Objectives

The objective of this course is to

 Equip the students with concepts of data mining techniques namely classification, clustering
and association.

 Provide an overview of data warehouse which include the usage of OLAP, its characteristics,
OLAP architecture.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain the concept of Datawarehouse, its characterstics, Metadata concepts and its
importance, The schemas of Data warehouse with their application areas.

CO2: Explain the architectural components of data warehouse and the challenges the data
warehousing is facing.

CO3: Explain the indexing of OLAP, the different OLAP operations performed on the data
cube.

CO4: Explain the concept of different data mining techniques like association, clustering and
classification and analyze these techniques on the different data sets.

CO5: Explain the concept of Web Mining and understanding the features of different types of
database.

Blooms Number
Modules
level* of hours

MODULE 1:
L1, L2
Data Warehousing: Data Warehouse definition & Characteristics, The 8
need for data ware housing, Operational and Informational Data Stores, and L3
Difference between Data warehouse and DBMS, Benefits of Data
warehousing, Data mart, Meta Data, Conceptual Modeling of Data
Warehouses: star schemas, Snowflake, Fact Constellations with example
each.

MODULE 2:

On Line Analytical Processing (OLAP) L2, L3

Definition: OLAP, Difference between OLTP and OLAP, OLAP Server 10
Architecture, OLAP Operations, Multi Relational & Multi Dimensional: and L4
MOLAP, ROLAP, OLAP Tools, Metadata Repository, Data Warehouse
Back-End Tools and Utilities.

MODULE 3:

Data Mining

Introduction to Data Mining, Applications, Limitations, Techniques, L2, L3 10

Association Rules: Priori Algorithm, Direct Hashing and Pruning (DHP), and L4
Classification: Decision Tree, Split Algorithm based on Information
Theory, Bayes Method.

Module 4:
Cluster Analysis: Concepts and Methods
Cluster Analysis: Features, Types of Cluster Analysis Methods:
8
Partitional, Hierarchical, Density Based, Grid based Methods, , Web Data
Mining, Search Engine, Case Study, Limitations.

Module 5:

Web Mining
Introduction, Classifying Web pages, extracting knowledge from the web.
Multidimensional Analysis and Descriptive Mining of Complex Data
6
Objects, Spatial Databases, Multimedia Databases, Time Series and
Sequence Data, Text Databases, World Wide Web, Applications and
Trends in Data Mining

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books:

1. Jiawei Han &Micheline Kamber,“Data Mining Concepts And Techniques”,3 rd

 Edition,Morgan Kaufmann Publication,An Imprint of Elsevier, 2015.
2. Vipin Kumar,Pang Ning “Introduction to Data Mining”,3rd Edition,Pearson
Publication,Chennai, 2016.
3. Mohammed,Wagner “ Data Mining and Analysis”, 4th Edition, Cambridge University
Press,Brazil, 2018.

Reference Books:

1. Daneil,D. Larose “Data Mining and Predictive Analytics”, 2nd Edition, John wiley and
Sons,Canada, 2015.
2. Paulraj “Data Warehousing Fundamental for IT Professional”, 2nd Edition, John Wiley
and Sons, Canada, 2010.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- -- --

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

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

CO4 1 1 2 -- -- -- -- -- -- -- -- -- 1 3 -- 1

CO5 1 1 2 -- -- -- -- -- -- -- -- -- 1 3 -- 1

1: strongly related, 2: moderately related and 3: weakly related

 IFT4523 Dataware Housing & Data Mining Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basics of Statistics Concepts

Co-requisites NIL

Catalog Description

In this Lab course Data Mining programs are implemented and demonstrated using a Weka Tool.
The Concepts that are covered would enable them to analyze the working of different data
mining techniques namely clustering, association, regression. Programs will be related to
concepts of understanding the architecture of data warehouse ,creating a knowledge base in
Weka and apply preprocessing on the dataset, developing programs to specify the different types
of attributes supported by Weka tool, Performing the implementation of clustering, association
techniques.

Course Objectives

The objective of this course is to

 Make the students apply knowledge of Data Mining by analyzing the different data mining
techniques.

 Provide a demonstration of Preprocessing technique on the data set by removing noisy data

Course Outcomes

On completion of this course, the students will be able to

CO1: Apply the knowledge of Data Mining to gain analysis on different data sets and their
related attributes.

CO2: Demonstrate the use of Data preprocessing technique by handling the data efficiently by
removing noise and outliers from the given data sets.

CO3: To implement the different data mining concepts namely binning, histogram analysis,
numeric transform and discretization.

CO4: Demonstrate the working of different data mining techniques namely clustering,
association analysis, regression, classification techniques.
 Blooms Number
Modules/Topics Covered**
level* of hours

1. To understand the basic feature of Data warehouse and Introduction to

Weka Tool
a) Understanding the concept of importance of data warehouse and its L1,L2 4
characteristics
b) Applications of Data warehouse and 3-tier Architecture of Data
warehouse
c) Weka tool installation and basic introduction
2.Sample Programs to apply Pre-Processing technique on the data set
a) Apply a pre-processing technique on the weather.arff dataset L3,
4
L4,L5
b) Create a student data set into arff format and then apply pre-
processing on the data set.

3. Sample Programs to implement the concept of Numeric transform

and Discretization
(a) Create a Weka program to apply a numeric transform on Iris dataset.
L3,
(b) Design an application program to apply a feature selection method L4,L5 6
for game playing. arff dataset.
(c) Write a program to implement the concept of Equal frequency and
Equal width binning for the given dataset.

4. Sample Programs to implement the concept of Training and

Validating the dataset
L3,L4,
(a) Write a prolog program to demonstrate the concept of validation in 6
L5
Weka dataset.
(b) Design an CSV dataset using Weka.

5. Sample Programs to analyze the different data mining techniques

a) Write a program to implement the concept of clustering in Weka.
L3,
b) Write a program to apply Apriori technique on the dataset and to L4,L5 4
generate association rules.
c) Write a program to apply classification technique on the given dataset.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.
Text Books:

1. Jiawei Han &Micheline Kamber,“Data Mining Concepts And Techniques”,3 rd

Edition,Morgan Kaufmann Publication,An Imprint of Elsevier, 2015.
2. Vipin Kumar,Pang Ning “Introduction to Data Mining”,3rd Edition,Pearson
Publication,Chennai, 2016.
3. Mohammed,Wagner “ Data Mining and Analysis”, 4th Edition, Cambridge University
Press,Brazil, 2018.

Reference Books:

1. Daneil,D. Larose “Data Mining and Predictive Analytics”, 2nd Edition, John wiley and
Sons,Canada, 2015.
2. Paulraj “Data Warehousing Fundamental for IT Professional”, 2nd Edition, John Wiley
and Sons, Canada, 2010.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35

Note: IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V –
Viva.

CO, PO and PSO mapping

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

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

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

CO3 2 1 2 -- -- -- -- -- -- -- -- -- 2 1 -- --

CO4 2 1 3 -- -- -- -- -- -- -- -- -- 2 1 -- --

1: strongly related, 2: moderately related and 3: weakly related

 Programming with .NET Framework L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basic Programming, HTML and CSS

Co-requisites Nil

Catalog Description

.NET framework is most commonly used framework for developing various applications and it
supports many languages. C#.NET is one of the most commonly used languages in the software
industries. Students in this course will study to develop; Console and GUI based applications
using C#.NET. The course also provides knowledge regarding Creating Dynamic Web Pages
with the help of ASP.NET framework. Various topics included in this course impart the
knowledge of ASP.NET framework concepts at implementation level. The major topic covered
includes theme, state management, web controls, AJAX, database connectivity using ADO.NET,
web services and deploying web applications.

Course Objectives

The objective of this course is to

Course Objectives

The objective of this course is to

 Equip the students with .NET framework and its programming constructs.

 Provide knowledge to develop to console based and GUI based applications using C#.NET
language.

 Equip the students with concepts of ASP.NET web applications including State management,
Web Controls and ADO.NET.

 Provide knowledge to develop, configure and deploy secure ASP.NET web applications
using C#.NET programming language.

Course Outcomes

On completion of this course, the students will be able to

CO1: Understand the components of .NET framework.

CO2: Use object-oriented concepts to write programs using C#.NET programming language.

CO3: Develop GUI based applications.

CO4: Use various standard and advance web controls for developing ASP.NET dynamic web
pages and also create custom controls.

CO5: Establish database connectivity and perform various operations on database through
ASP.NET web pages.

Blooms Number
Modules
level* of hours

MODULE I:

NET FRAMEWORK: Overview of .NET and .NET Framework, .NET

Compliant Languages, Common Language Specification (CLS),Common
Type System (CTS),Framework Class Library (FCL),Base Class Library
(BCL),Common Language Runtime (CLR)
Visual Studio IDE, Microsoft Intermediate Language (MSIL),
Understanding CLR and Execution of .NET Application, Components of L1, L2 4
CLR.
C#.NET BASICS
C# Programming Language Features, Hello World Program, General
Structure of a C# Program, Conceptual Overview of C#.Net, Data Types,
Modifiers (Access Modifiers),Casting and Type Conversion, Boxing and
Unboxing Modifiers, Selection Statements, Looping Statement, Array-
Single Dimensional and Multi-Dimensional, Declaring Arrays, Initializing
Arrays, Accessing Array Members, Arrays are Objects, Using for each
with Arrays, Jagged Arrays
MODULE II:

OOP: Class, Interfaces: Defining and Implementing Single & Multiple

Interfaces, Abstract Class, Delegates, Exception Handling, Reflection, L2 and 14
Assembly, Types of Assemblies, Components of Assemblies. L3

COLLECTIONS:
Non-Generic Collection: Array List, Stack, Queue, Hash Table. Generic
Collection: List, Dictionary, Queue, Stack.

Module III:

WINDOWS FORMS
Create and populate Windows Forms,
controls in a Windows Forms application, Menus in a Windows Forms
application,
Multiple Document Interface (MDI) applications, L2 and
User input validation in a Windows Forms application 7
L3
ASP.NET FRAMEWORK & WEB FORMS
Introduction to Microsoft ASP.NET, ASP.NET execution model, Themes,
Creating an ASP.NET Web application user interface, Implementing
event handlers by using code-behind files, Clint-side and Server-side
controls, events, Using Controls, Validating Data, Navigating Between
Forms , Custom and User Controls, Implementing Master Pages

MODULE IV:

AJAX: Introduction to AJAX, AJAX Toolkit, Partial page update using

AJAX, Extending an ASP.NET Web Forms Application by Using the
Ajax Control Toolkit.
STATE MANAGEMENT: The Various Means to Manage State, L2 and 2
Request object, Application object, Cache object, Session object, Server- L3
side state management, using session for server-side and client-side state
management.
XML WEB SERVICES: Need of XML Web services, Understanding
the Web Service Model, Creating an ASP.NET Web Service, Creating &
Consuming Web Services with Visual Studio .NET.
MODULE V:

ADO.NET 5
Architecture of ADO.NET: Connected, Disconnected, Sql Connection L2, L3
class, SqlCommand class, Data Reader class, Sql Data Adapter class, Data and L4
Set class, Data grid view with DML Operations like sorting, paging etc.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

 Professional C#.NET 4.5 , Wrox Publications

 Stephen Walther, ASP.NET Unleashed, SAMS Publication

Reference Books

 Andrew Stellman and Jennifer Greene, Head First C#, O‟Reilly

 E. Balagurusamy, Programming in C#.Net, Tata McGraw-Hill Publisher

 Matthew MacDonald, Beginning with ASP.NET 4.5 in C#, Apress Publications

 Imar Spaanjaars, Beginning with ASP.NET 4.5.1 in C# and VB, Worx Publication

 Jesse Liberty, Dan Hurwitz, Programming ASP.NET, OReilly.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

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

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

CO2 2 2 1 2 1 -- -- -- -- -- -- -- -- 1 2 --

CO3 2 2 1 2 2 -- -- -- -- -- -- -- -- 1 2 --

CO4 2 1 1 2 1 -- -- -- -- -- -- -- -- 1 1 --

CO5 2 1 1 2 2 -- -- -- -- -- -- -- -- 1 1 --

CO6 2 2 2 2 1 --- -- -- -- -- -- -- -- 2 1 --

1: strongly related, 2: moderately related and 3: weakly related

 Programming with .NET Framework Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 - - 4 2

Pre-requisites/Exposure Basic Programming, HTML and CSS

Co-requisites Nil

Catalog Description

.NET framework is most commonly used framework for developing various applications and it
supports many languages. C#.NET is one of the most commonly used languages in the software
industries. Students in this course will study to develop; Console and GUI based applications
using C#.NET. The course also provides knowledge regarding Creating Dynamic Web Pages
with the help of ASP.NET framework. Various topics included in this course impart the
knowledge of ASP.NET framework concepts at implementation level. The major topic covered
includes theme, state management, web controls, AJAX, database connectivity using ADO.NET,
web services and deploying web applications.

Course Objectives

The objective of this course is to

Course Objectives

The objective of this course is to

 Equip the students with .NET framework and its programming constructs.

 Provide knowledge to develop to console based and GUI based applications using C#.NET
language.

 Equip the students with concepts of ASP.NET web applications including State management,
Web Controls and ADO.NET.

 Provide knowledge to develop, configure and deploy secure ASP.NET web applications
using C#.NET programming language.

Course Outcomes

On completion of this course, the students will be able to

CO1: Understand the components of .NET framework.

CO2: Use object-oriented concepts to write programs using C#.NET programming language.

CO3: Develop GUI based applications.

CO4: Use various standard and advance web controls for developing ASP.NET dynamic web
pages and also create custom controls.

CO5: Establish database connectivity and perform various operations on database through
ASP.NET web pages.

Blooms Number
Modules/Topics Covered**
level* of hours

Module-I:
I/O, Selection and Looping Statements Sample Programs
a) Program to get a number and display the number with its reverse
b) Program to check inputted no. is prime or composite.
1. Array, Jagged Array, String & Command Line Arguments L2, L3
Sample Programs 4
and L4
a) Write a program to sort an array of n strings in ascending order.
b) Program to find out sum of numbers passed through command line
arguments.
c) Program to Demonstrate Jagged Arrays
d) Program to Search an element from an Array.
e) Program to find the frequency of alphabet in a string.
Module-II:
Class & Properties, Overloading Sample Programs
a) Define a class student with MarksofCS, MarksofJava, MarksofDBMS,
name as its data member. Enter the marks, find average and
percentage for that. Use appropriate properties.
L2, L3
b) Define a class „Number‟and define overloaded method add () with 6
one, two and three arguments to implement method overloading. and L4
c) Define a class with two datamembers: num1 as constant and num2 as
readonly. Display the values of both on the console and state the
difference between them.
Constructor, Garbage Collector, Static Members Sample Programs
a) Create a class distance have km and m as its data members and create
 various constructors to initialize the data members.
b) Program to demonstrate static data members.
Operator Overloading , Delegates Sample Programs
a) Create a class ComplexNumber with two data members real and
imaginary. Overload +,–,>,<, >=,<= and == operators for it.
b) Program to implement delegate.
Inheritance, Interface, Abstract class Dynamic Polymorphism Sample
Programs
a) Create a class Student and inherit two classes UgStudent and
Pgstudent from it to illustrate the concept of inheritance. Use
appropriate data members, constructors, methods and properties.
b) Write a program to implement the concept of dynamic binding using
appropriate classes.
Exception Handling, Custom Exceptions Sample Programs
a) Write a program to find out square root of number. Handel all
exceptions that may occur in this program.
b) Create a „NegativeValueException‟ that should be raised when a
function received negative value in parameter.
Generic Class, Collections (Non Generic & Generic) Sample Programs
a) Create a generic class with an array of n elements. Write the method
to find out greatest and average of elements of array.
b) Write a program to store the City name and its temperature. Access
the temperature using city name. Use appropriate collection.
Assembly, Reflection Sample Programs
a) Program to create and use private and shared assembly.
b) Program to display methods of a class at runtime.
Module-III:
Developing GUI Applications & Controls Sample Programs
a) Design a calculator and implement its operations.
b) Program to move the contents of a list box to another list box. Also
write code to add and delete elements from any list box.
c) To display message box for confirmation while closing a form.
ASP.NET Forms Sample Programs L2, L3
6
a) Design a Login Page, which displays a Welcome Page on successful and L4
Login and an error message in case of invalid Id/Passward.
b) Design a form and apply themes (design time and dynamically).
c) Design any web form and apply various validation controls.
d) Create a web form which can work in Hindi and English language
both.
e) Design a web form to upload an image to server.
f) Design a custom control, Numeric Textbox, which should accept only
integer value for a particular range. The range should be customizable.
Module-IV:
a) Implement state management for Login page which move to welcome
page when credentials are correct. The welcome page displays a
welcome message along with the user Id. L2, L3
4
b) Implement various state management methods using a suitable web and L4
form.
c) Create a web service and demonstrate its use in any web application.
d) Design a Web forma and implement partial refreshing using AJAX.
Module-V:
a) Create a database table and design appropriate form for it. Implement
basic operations like insert, delete and update using ADO.NET.
b) Implement various methods of execution of SQL command.
c) Display data in a Grid and perform basic database operations. L2, L3
4
d) Develop any web application to illustrate SQL Injection attack and and L4
redesign it to prevent the attack.
e) Develop a web application to illustrate XSS attack and redesign it to
prevent the attack

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

 Professional C#.NET 4.5 , Wrox Publications

 Stephen Walther, ASP.NET Unleashed, SAMS Publication

Reference Books

 Andrew Stellman and Jennifer Greene, Head First C#, O‟Reilly

 E. Balagurusamy, Programming in C#.Net, Tata McGraw-Hill Publisher

 Matthew MacDonald, Beginning with ASP.NET 4.5 in C#, Apress Publications

 Imar Spaanjaars, Beginning with ASP.NET 4.5.1 in C# and VB, Worx Publication

 Jesse Liberty, Dan Hurwitz, Programming ASP.NET, OReilly.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:
Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

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

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

CO2 2 2 1 2 1 -- -- -- -- -- -- -- -- 1 2 --

CO3 2 2 1 2 2 -- -- -- -- -- -- -- -- 1 2 --

CO4 2 1 1 2 1 -- -- -- -- -- -- -- -- 1 1 --

CO5 2 1 1 2 2 -- -- -- -- -- -- -- -- 1 1 --

CO6 2 2 2 2 1 --- -- -- -- -- -- -- -- 2 1 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4526 L T P C
Network Security & Cryptography

Version: 2020.1 Date of Approval: 19, July 2020 3 1 0 4

Pre-requisites/Exposure Basic Mathematics

Co-requisites Nil

Catalog Description

In this course the concepts of cryptography and network security are discussed in detail.
Substitution and transposition techniques, symmetric and asymmetric cryptographic algorithms,
their applications, differences will be introduced. As a precursor to the study of cryptography
studies will be made on impact of various network and web security protocols. The concepts
learnt in the studies of cryptography & network security will be applied in the studies and
analysis of authentication, integrity and security related protocols.

Course Objectives

The objective of this course is to

 Equip the students with concepts of cryptography & network security through problem
solving and analytical approach.

 Provide an overview of various network attacks and related security mechanism , various
algorithms for modular arithmetic, symmetric and asymmetric cryptography and web and
network security

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain, describe and distinguish various security attacks; Describeand solve block and
stream ciphers and its applications in cryptography; Solve problems based on substitution and
transposition ciphers.

CO2: Explain the basic mathematics of cryptography; Solve problems of groups, modular
arithmetic ,gcd and inverse algorithm, chinese remainder theorem and its application in
cryptography; Applying algorithms for solving problems in cryptography
CO3: Describing the concept of public key cryptosystems and its related algorithm; Explain and
solve problems related to hash functions, digital signature and its applications in
cryptography; Compare symmetric and asymmetric key cryptography.

CO4: Explain management, distribution ,secure exchange of keys and authentication certificate
and its applications in real life. Explain , compare various authentication protocols used in
cryptography and network security, also solve problems based on these protocols.

CO5: Explain various security protocols : IPSec, SSL,TLS,SET; Describing malicious softwares
and illustrating various design approaches to Firewell

Blooms Number
Modules
level* of hours

MODULE 1:

Introduction to security attacks, services and mechanism, Classical

encryption techniques: substitution ciphers and transposition ciphers,
cryptanalysis, steganography, Stream and block ciphers. Modern Block L1, L2
9
Ciphers: Block ciphers principles, Shannon‟s theory of confusion and and L3
diffusion, fiestal structure, Data encryption standard (DES), Strength of
DES, Idea of differential cryptanalysis, block cipher modes of operations,
Triple DES

MODULE 2:

Introduction to group, field, finite field of the form GF(p), modular

arithmetic, prime and relativeprime numbers, Extended Euclidean L1,L2,
Algorithm,Advanced Encryption Standard (AES) encryption and 9
decryption, Fermat‟s and Euler‟s theorem, Primaliry testing, Chinese L3
Remainder theorem, DiscreteLogarithmicProblem,Principals of public
key crypto systems, RSA algorithm, security of RSA,ECC

MODULE 3:

Message Authentication Codes: Authentication requirements, L1,L2,

authentication functions, messageauthentication code, hash functions,
L3 and 9
birthday attacks, security of hash functions, Secure hashalgorithm
(SHA)Digital Signatures: Digital Signatures, Elgamal Digital Signature L5
Techniques, Digital signaturestandards (DSS).
MODULE 4:

Key Management and distribution: Symmetric key distribution, Diffie- L1, L2

Hellman Key Exchange, Public key distribution, X.509 Certificates, 9
Public key Infrastructure. Authentication Applications: and L3
Kerberos,Needham Schroeder protocol

MODULE 5:

IP Security: Architecture, Authentication header, Encapsulating security 12

payloads, SSL, HTTPS,SET,3-D Secure , Viruses, Worms, Malware, L1, L2
Botnets, Firewall and its types.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. William Stallings,“Cryptography & Network Security”,4th Edition, Pearson

Education,NewDelhi, 2017.
2. Behrouz A. Forouzan, “Cryptography & Network Security”, 2ndEdition,Tata
McgrawHills,New Delhi, 2015
Reference Books

1. Douglas R.Stinsons, “Cryptography Theory and Practice”, 3rd Edition, McMillan

Publications, Londan, 2003
2. Atul Kahate, “Cryptography & Network Security”, 3rd Edition, Tata McgrawHills,New
Delhi, 2017

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2 3 4
CO1 1 1 1 -- -- -- -- -- -- -- -- -- 1 1 3 -

CO2 1 1 1 -- -- -- -- -- -- -- -- -- 1 1 3 -

CO3 1 1 1 -- - -- -- -- -- -- -- -- 1 1 3 -

CO4 1 2 3 -- -- -- -- -- -- -- -- -- 1 1 3 -

CO5 1 2 3 -- -- -- -- -- -- -- -- -- 2 2 3 -

1: strongly related, 2: moderately related and 3: weakly related

IFT4527 Soft Computing L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

To develop semantic-based and context-aware systems to acquire, organize process, share and
use the knowledge embedded in multimedia content. Research will aim to maximize automation
of the complete knowledge lifecycle and achieve semantic interoperability between Web
resources and services. The field of Robotics is a multi disciplinary as robots are amazingly
complex system comprising mechanical, electrical, electronic H/W and S/W and issues germane
to all these

Course Objectives

The objective of this course is to

1. To provide an overview of problem solving skills methods using Soft Computing.

2. To serve as a foundation for the study of programming languages that is used to develop an
Intelligence System

Course Outcomes

On completion of this course, the students will be able to

CO1. Understand the concept of artificial intelligence.

CO2. Differentiate between linear and non-linear problems and Learn various problem solving
techniques using neural networks

CO3. Understand the concept of fuzzy logic and apply to various problems

CO4. Illustrate concepts of genetic algorithm

Blooms Number
Modules
level* of hours

Module I: Soft Computing

Introduction of soft computing, soft computing vs. hard computing,
various types of soft computing techniques, applications of soft
computing. Artificial Intelligence : Introduction, Various types of
production systems, characteristics of production systems, breadth first
search, depth first search techniques, other Search Techniques like hill L1, L2 12
Climbing, Best first Search, A* algorithm, AO* Algorithms and various
types of control strategies. Knowledge representation issues, Prepositional
and predicate logic, monotonic and non monotonic reasoning, forward
Reasoning, backward reasoning, Weak & Strong Slot & filler structures,
NLP.
Module II: Neural Network
Structure and Function of a single neuron: Biological neuron, artificial
neuron, definition of ANN, Taxonomy of neural net, Difference between
ANN and human brain, characteristics and applications of ANN, single
L2, L3
layer network, Perceptron training algorithm, Linear separability, Widrow 10
& Hebb;s learning rule/Delta rule, ADALINE, MADALINE, AI v/s and L4
ANN. Introduction of MLP, different activation functions, Error back
propagation algorithm, derivation of BBPA, momentum, limitation,
characteristics and application of EBPA

Module III
Counter propagation network, architecture, functioning & characteristics
of counter Propagation network, Hopfield/ Recurrent network,
L2, L3
configuration, stability constraints, associative memory, and 8
characteristics, limitations and applications. Hopfield v/s Boltzman and L4
machine. Adaptive Resonance Theory: Architecture, classifications,
Implementation and training. Associative Memory.
Module IV: Fuzzy Logic
Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzzy
relations, Fuzzy systems: crisp logic, fuzzy logic, introduction & features L2, L3
of membership functions, Fuzzy rule base system : fuzzy propositions, and L4 7
formation, decomposition & aggregation of fuzzy rules, fuzzy reasoning,
fuzzy inference systems, fuzzy decision making & Applications of fuzzy
logic.
Module V: Genetic algorithm
Fundamentals, basic concepts, working principle, encoding, fitness
function, reproduction, Genetic modeling: Inheritance operator, cross
over, inversion & deletion, mutation operator, Bitwise operator, 3
L2, L4
Generational Cycle, Convergence of GA, Applications & advances in GA,
Differences & similarities between GA & other traditional methods.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

 S, Rajasekaran& G.A. VijayalakshmiPai, Neural Networks, Fuzzy Logic &

GeneticAlgorithms, Synthesis & applications, PHI Publication.
Reference Books :

 Rich E and Knight K, Artificial Intelligence, TMH, New Delhi.

 Bose, Neural Network fundamental with Graph , Algo.&Appl, TMH
 Kosko: Neural Network & Fuzzy System, PHI Publication
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

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

CO2 1 -- 1 2 -- -- -- -- -- -- -- -- 1 - 1 -
CO3 1 -- 1 2 -- -- -- -- -- -- -- -- 1 - 1 -

CO4 1 -- -- 2 -- -- -- -- -- -- -- -- 1 - 1 -

1: strongly related, 2: moderately related and 3: weakly related

IFT4540 L T P C
Soft Computing Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

This lab course covers development and designing of implementing basic neural networks, fuzzy
systems, and optimization algorithms concepts and their relations. It aims to develop the
concepts and techniques and foster the students‟ abilities in designing and implementing soft
computing based solutions for real-world and engineering problems.

Course Objectives

The objective of this course is to

 Equip the students with concepts of Soft Computing which includes Neural networks, Fuzzy
logic and genetic algorithms.

 Provide knowledge to develop Soft computing programs in Matlab.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain and apply concepts of MATLAB.

CO2: Implement various neural networks using MATLAB.

CO3: Illustrate use of fuzzy in real applications.

CO4: Apply genetic algorithm to basic problems.

Blooms Number
Modules
level* of hours

Fuzzy Logic
a) Write a program in MATLAB to perform Union, Intersection and
Complement operations. L1,
b) Write a program in MATLAB to implement De-Morgan‟s Law. 4
c) Write a program in MATLAB to plot various membership functions. L2,L3
d) Generate XOR function using McCulloch-Pitts neural net by
MATLAB program.

Neural Network
a) Write a MATLAB program for Hebb Net to classify two dimensional
input patterns in bipolar with targets.
b) Generate ANDNOT function using McCulloch-Pitts neural net by
MATLAB program. L2,L3and
2
c) Write a MATLAB program for Perceptron net for an AND function L4
with bipolar inputs and targets.
d) Write a M-file to calculate the weights for the following patterns
using hetero-associative neural net for mapping
e) Write an M-file to store the vector, find the weight matrix with no
self-connection. Test this using a discrete Hopfield net.
Genetic Algorithm
a) Solve travelling salesman problem using Genetic algorithm. L2, L3
6
b) Solve clustering problem using GA. and L4
c) Solve classification using GA.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

Text Book.

 S.N. Sivanandam & S.N. Deepa, Principles of Soft Computing, Wiley Publications
 Matthew MacDonald, Beginning with MATLAB, Apress Publications

Reference Books

 S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic & Genetic
Algorithms, Synthesis & Applications, PHI Publication.
 Bose, Neural Network fundamental with Graph , Algo.& Appl, TMH
 Kosko: Neural Network & Fuzzy System, PHI Publication
 Klir & Yuan, Fuzzy sets & Fuzzy Logic: Theory & Appli.,PHI Pub.
 Hagen, Neural Network Design, Cengage Learning
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70
CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

CO1 2 1 -- -- -- -- -- -- -- -- -- -- 2 2 1 --

CO2 2 1 -- -- -- -- -- -- -- -- -- -- 2 2 1 --

CO3 1 1 -- -- -- -- -- -- -- -- -- -- 2 1 1 --

CO4 1 1 -- -- -- -- -- -- -- -- -- -- 2 1 1 --

1: strongly related, 2: moderately related and 3: weakly related

IFT4335 L T P C
Summer Internship Evaluation

Version: 2020.1 Date of Approval: 19, July 2020 0 0 0 5

Pre-requisites/Exposure Basics of Networks

Co-requisites Nil

Catalog Description

There are certain phases of every Intern‟s professional development that cannot be effectively
taught in the academic environment. These facets can only be learned through direct, on-the-job
experience working with successful professionals and experts in the field. The internship
program can best be described as an attempt to institutionalize efforts to bridge the gap between
the professional world and the academic institutions. Entire effort in internship is in terms of
extending the program of education and evaluation beyond the classroom of a university or
institution. The educational process in the internship course seeks out and focuses attention on
many latent attributes, which do not surface in the normal classroom situations. These attributes
are intellectual ability, professional judgment and decision-making ability, inter-disciplinary
approach, skills for data handling, ability in written and oral presentation, sense of responsibility
etc. In order to achieve these objectives, each student will maintain a file (Internship File). The
Internship File aims to encourage students to keep a personal record of their learning and
achievement throughout the Programme. It can be used as the basis for lifelong learning and for
job applications. Items can be drawn from activities completed in the course modules and from
the workplace to demonstrate learning and personal development. The report will assess the
student‟s analytical skills and ability to present supportive evidence, whilst demonstrating
understanding of their organization, its needs and their own personal contribution to the
organization.

Course Objectives

The objective of this course is to

1. Equip the students with concepts of new technologies.

2. Provide project management and presentation skills.

Course Outcomes

On completion of this course, the students will be able to

CO1: Make a report on relevant topic by the study of literatures.

CO2: Demonstrate the topic of summer project topic by use of power presentation.

CO3: Demonstrate the aim, challenges, applications, literatures, result and analysis of the
topic of project report

CO4: Explain the meaning of references/Bibiliography.

Text Books

As per topic of summer internship project.

Reference Books
As per topic of summer internship project.

Examination Scheme:

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Components V PPT R Exe IM

Weightage (%) 12 15 18 15 40

V – Viva, PPT-Power Point Presentation, R – Report, IP-Internal Marks, Exe-Execution, IM: Internal
Marks by Guide

CO, PO and PSO mapping

PO PO PO PSO PSO PSO PSO

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9
10 11 12 1 2 3 4

CO1 1 2 2 -- -- -- -- -- -- -- -- -- - 1 1

CO2 1 2 2 - -- -- -- -- -- -- -- -- - - 1 1

CO3 1 2 - -- -- -- -- -- -- -- -- -- - - 1 1

CO4 1 2 3 -- -- -- -- -- -- -- -- -- - - 1 2

1: strongly related, 2: moderately related and 3: weakly related

 IFT4423 Android Programming L T P C

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Java Programming

Co-requisites Database concepts

Catalog Description

This course introduces mobile application development for the Android platform. Android is a software
stack for mobile devices that includes an operating system, middleware and key applications. The
Android SDK provides the tools and APIs necessary to begin developing applications on the Android
platform using the Java programming language. Students will learn skills for creating and deploying
Android applications.

Course Objectives

The objective of this course is to

1. To introduce Android platform and its architecture.

2. Provide the knowledge of mobile apps development.

Course Outcomes

On completion of this course, the students will be able to

CO1: Describe Android platform, Architecture and features.

CO2: Design User Interface and develop activity for Android App.

CO3: Design and implement Database Application and Content providers.

CO4: Use Intent, Broadcast receivers and Internet services in Android App.

CO5: Use Internet, multimedia, camera and Location based, SMS services etc, in Android App.

CO6: Manage, Develop and Implement Mobile app project.

 Blooms Number
Modules Level of hours

MODULE 1: Introduction to Android

Introduction to Android Platform, Android Stack Android Versions and
Installing Android SDK and updating SDK components, Eclipse, IDEs and ADT L1 and
plug-in Using the Emulator, Android vs. Other mobile platforms Your First L2 4
Android Application: Application Life Cycle, Application Components,
Activity life cycle, Manifest File, Layout XML Code Strings, The R File, Java
Source Code, Java based layout vs. xml based layout Eclipse Visual Layout
Editor, Logging.

MODULE 2: UI Design for Android

Using different layouts – LinearLayout, TableLayout and others, Drawable
Resources

Resolution and density independence, Working with common widgets, Working L1,L2and 8
with ListView and Adapters, Creating and using option menu, Working with L3
preferences

Working with Dialogs and Toasts, Working with Graphics and Animation,
Intents ,Intent filters, Invoking activities by class name and URI, Sharing data
using Extras Bundle and URI parameters,Working with Tabs and Fragments,

MODULE 3: Files, Database & Working in Background

Using File System, Introducing SQLite on Android, Database Connectivity,
Cursors and content values, Using ContentProvider to share data,Understanding L1, L2 8
Security model, Introducing Service and its life cycle,Creating and starting a and L3
service, Types of services, Working with multi-threading and
AsyncTask,Broadcast receivers,Triggering receivers with intents,Responding to
system events using Broadcast receivers,Using Alarm.

MODULE 4: Using System Services and Web Services

Using Location based Services,Telephony and SMS services,Bluetooth, L1, L2
Network and WiFi, 6
and L3
Multimedia and Camera,Accessing Internet and Web Services from Android
Applications.
MODULE 5: Project

Understanding the requirement, Designing the interface and architecture, Best L3, L4
practices regarding application design and development, Writing code and and L5 6
testing it, Preparing application for Publishing, Publishing to Play Store and
Physical device.

Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. “Android Programming: The Big Nerd Ranch Guide” By Bill Phillips & Brian Hardy, Big
Nerd Ranch, Inc. Pearson Technology Group.
2. “Head First Android Development”, By Anthony J.F. Griffiths and David Griffiths, Oreilly.

Reference Books

1. “Android Programming for Beginners”, By John Horton,Packt Publishing

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE

Weightage (%) 5 10 8 7 70
CO, PO and PSO mapping

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PS PS PSO

1 2 3 4 5 6 7 8 9 0 1 2 O1 O2 O3 4

CO --
1
3 -- -- -- -- -- -- -- -- -- -- -- 2 1 1

CO --
2
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO --
3
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO --
4
1 2 1 -- -- -- -- -- -- -- -- -- -- -- --

CO --
5
1 2 1 -- -- -- -- -- -- -- -- -- -- -- --

CO --
6
1 1 1 2 -- -- -- -- -- -- -- -- -- -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4424 L T P C
Android Programming Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Java Programming

Co-requisites Nil

Catalog Description

This lab course provides a platform to the students for understanding the basic concepts of
Android. This practical background will help students to gain confidence in creating /developing
Android Applications.

Course Objectives

The objective of this course is to

 Equip the students with concepts of Android Programming UI Design, Database

connectivity, File System, System Services and Web Services

 Provide knowledge to develop secure Android Mobile applications.

Course Outcomes

On completion of this course, the students will be able to

On completion of this course, the students will be able to

CO1: Describe Android platform, Architecture and features.

CO2: Design User Interface and develop activity for Android App.

CO3: Design and implement Database Application and Content providers.

CO4: Use Intent, Broadcast receivers and Internet services in Android App.

CO5: Use Internet, multimedia, camera and Location based, SMS services etc, in Android App.

CO6: Manage, Develop and Implement Mobile app project.

 Blooms Number
Modules
level* of hours

MODULE 1: Introduction to Android

L1, L2
g) Introduction to Android Operating System 4
and L3
h) Hello world program using android
i) Program to demonstrate Activity life cycle of android.

MODULE 2: UI Design for Android

e) Working with different layouts – LinearLayout, TableLayout and
others.
programs related to Drawable Resources. L2 and
4
f) Working with common widgets L3
g) Working with ListView and Adapters, Creating and using option
menu, Working with preferences
h) Working with Dialogs and Toasts,
i) Working with Graphics and Animation, Intents ,Intent filters,

L2 and
MODULE 3: Files, Database & Working in Background 6
L3
a) Database programming in android

MODULE 4: Using System Services and Web Services

a) Program related to Service and its life cycle
L2 and
b) ProgramsUsing Location based Services,Telephony and SMS 4
L3
services,Bluetooth, Network and WiFi,
c) Programs related to Multimedia and Camera,
a) Programs related to Accessing Internet and Web Services from
Android Applications.

MODULE 5: Project L2, L3

6
and L4
a) Small application to understand complete application development
and management based on specific requirements.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation
Text Books

1. “Android Programming: The Big Nerd Ranch Guide” By Bill Phillips & Brian Hardy, Big
Nerd Ranch, Inc. Pearson Technology Group.
2. “Head First Android Development”, By Anthony J.F. Griffiths and David Griffiths, Oreilly.

Reference Books

1. “Android Programming for Beginners”, By John Horton,Packt Publishing

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE

Weightage (%) 5 10 8 7 70

CO, PO and PSO mapping

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PS PS PSO

1 2 3 4 5 6 7 8 9 0 1 2 O1 O2 O3 4

CO --
1
3 -- -- -- -- -- -- -- -- -- -- -- 2 1 1

CO --
2
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO --
3
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO --
4
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO --
5
1 2 1 -- -- -- -- -- -- -- -- -- 2 1 1

CO
6
1 1 1 2 -- -- -- -- -- -- -- -- 2 1 1 1

1: strongly related, 2: moderately related and 3: weakly related

 Digital Image Processing L T P C
IFT4427

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basics of Computer Graphics

Co-requisites NIL

Catalog Description

This course gives students an insight into the basics of Image Processing along with visualization of real
concept of Image processing. Concepts covered would enable students to define and differentiate among
various types of image refinement. Further they would be able to gain insights about various Image
restoration and modification technique.

Course Objectives

The objective of this course is to

Give provide knowledge of powerful collection of fundamental and advanced image processing tools on
the desktop by taking advantage of the computational technology of Mathematics.

Course Outcomes

On completion of this course, the students will be able to

CO1: Define and explain Digital Image Processing.

CO2: Apply Image Enhancement techniques in the Spatial Domain.

CO3: Use the concepts of Image Enhancement in the Frequency Domain.

CO4: Understand the architecture Image Compression.

CO5: Apply algorithms of Image Representation and Description and Object Recognization.
 Blooms Number
Modules
level* of hours

MODULE 1:

Introduction and Digital Image Fundamentals

The origins of Digital Image Processing, Examples of Fields that Use L1 and
Digital Image Processing, Fundamentals Steps in Image Processing, L2 4
Elements of Digital Image Processing Systems, Image Sampling and
Quantization, Some basic relationships like Neighbors, Connectivity,
Distance Measures between pixels, Linear and Non Linear Operations.

MODULE 2:

Image Enhancement in the Spatial Domain

L2 and
Some basic Gray Level Transformations, Histogram Processing, 6
Enhancement Using Arithmetic and Logic operations, Basics of Spatial L3
Filters, Smoothening and Sharpening Spatial Filters, Combining Spatial
Enhancement Methods.

MODULE 3:

Image Enhancement in the Frequency Domain L1 and

8
Introduction to Fourier Transform and the frequency Domain, Smoothing L2
and Sharpening Frequency Domain Filters, Homomorphism Filtering.

MODULE 4:

Image Compression
Coding, Interpixel and Psychovisual Redundancy, Image Compression
models, Elements of Information Theory, Error free comparison, Lossy L2 and
10
compression, Image compression standards. L3
Image Segmentation
Detection of Discontinuities, Edge linking and boundary detection,
Threshold, Region Oriented Segmentation, Motion based segmentation.

MODULE 5:

Representation and Description 8

L2 and
Representation, Boundary Descriptors, Regional Descriptors, Use of L3
Principal Components for Description, Introduction to Morphology, Some
basic Morphological Algorithms.
Object Recognition
Patterns and Pattern Classes, Decision-Theoretic Methods, Structural
Methods.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books
1. Rafael C. Conzalez & Richard E. Woods, “Digital Image Processing”, 2 nd edition, Pearson Education.
2. A. K. Jain, “Fundamental of Digital Image Processing”, PHI.

References:
1. Rosefield Kak, “Digital Picture Processing”,
2. W.K. Pratt, “Digital Image Processing”,

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

A: Attendance, CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End
Semester Examination
CO, PO and PSO mapping

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

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

CO2 1 1 1 2 1 -- -- -- -- -- -- -- 1 1 1 --

CO3 1 1 1 2 1 -- -- -- -- -- -- -- 1 1 1 --

CO4 1 2 2 -- 1 -- -- -- -- -- -- -- 1 2 2 --

CO5 1 1 1 1 1 -- -- -- -- -- -- -- 1 1 1 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4428 Digital Image Processing Lab L T P C

Version 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basics of MATLAB

Co-requisites NIL

Catalog Description

This course gives students an insight into the basics of Image Processing along with visualization of real
concept of Image processing. In this Lab course student will learn practicals of image processing using
MATLAB programming.

Course Objectives

The objective of this course is to

1. Make the students apply knowledge of various Image processing techniques & pattern
recognition required for solving complex problems.

2. Provide demonstration of different types of image processing techniques through MATAB

toolbox.

Course Outcomes

On completion of this course, the students will be able to

CO1: Acquiring knowledge of Basics of High-end calculation software and need in Computer
Science & engineering

CO2: Demonstrate the All preliminary functions in MATLAB

CO3: Apply the knowledge of all the basics function and toolbox knowledge of MATLAB

CO4: Demonstrate the Use of MATLAB in image Processing

 Blooms Number
Modules/Topics Covered**
level* of hours

Introduction of MATLAB
L3, L5 4
(g) Basic Variable deceleration & its operation
(h) Function use & its application

Sample Programs in MATLAB

L3, L5 6
a) Basic use of Matrix and Graph Plotting
b) Different type of graph plotting with use of different -2 type of data
Sample Programs using MATLAB functions

a) Create a basic program MATLAB using functions L3, L5 6

b) Use of basic function Image processing
c) Practice on Basic function of Image processing tool box.
Programs of ANN functions
L3, L5 6
a) Practice on Pattern Recognition functions in MATLAB
b) Write a program for training a small network in MATLAB
Programs using ANN toolbox& Image processing toolbox

a) Demonstrate the useof ANN tool box& Image processing toolbox and L3, L5 2
write a program after combining it.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

** Sample Programs provided are not limited to these only, can include others as desired.

Text Books
1.Rafael C. Conzalez & Richard E. Woods, “Digital Image Processing”, 2 nd edition, Pearson Education.
2.K. Jain, “Fundamental of Digital Image Processing”, PHI.

References:
1.Rosefield Kak, “Digital Picture Processing”,
2.W.K. Pratt, “Digital Image Processing”,
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

Components A PR LR V
70
Weightage (%) 5 10 10 5

Note: IA –Internal Assessment, A – Attendance, PR – Performance, LR – Lab Record, V – Viva, EE- External
Exam

CO, PO and PSO mapping

PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2 3 4

CO1 2 1 -- -- -- -- -- -- -- -- -- -- 2 -- -- --

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

CO3 2 1 2 -- -- -- -- -- -- -- -- -- 1 2 -- --

CO4 1 3 2 -- -- -- -- -- -- -- -- -- 2 -- 2 --

CO5 1 3 -- -- -- -- -- -- -- -- -- -- 1 -- -- --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4543 L T P C
BIG DATA

Version: 2020.1 Date of Approval:19, July 2020 3 0 0 3

Pre-requisites/Exposure Basics of DBMS

Co-requisites SQL

Catalog Description

This course brings together several key big data technologies used for storage, analysis and
manipulation of data. It also introduces the students the key concepts of Hadoop framework,
MapReduce, Pig, Hive, and No-SQL. Students will learn to work on Hadoop platform. The
concepts learnt will make students capable of working on big data projects easier.

Course Objectives

The objective of this course is

 To make students familiar with big data technologies.

 Provide an overview of Hadoop architecture and its working with other open source
technologies.

Course Outcomes

On completion of this course, the students will be able to

CO1. Explain importance, applications and challenges of Big Data Analytics.

CO2. Differentiate among various analytics technologies.

CO3. Demonstrate architecture of Hadoop and Mapreduce framework.

CO4. Illustrate Hadoop commands.

CO5. Introduce concepts of Hive, HBase and Pig.

 Blooms Number
Modules
level* of hours

Module I: Introduction to Big Data

L1 and
Big Data : Definition, Sources, Importance & Applications, 5 V‟s of Big 5
Data, Complexity of Big Data, Big data processing architecture, Big Data L2
Analytics, Big data problems & challenges.
Module II: Working with Hadoop
Hadoop concepts : History, comparison with other systems : RDBMS,
Grid computing, Cluster Computing, Cloud Computing, Hadoop L2and
4
Architecture, Hadoop Distributed file system : Data node, Name node, job L5
tracker, task tracker, Moving data in and out of Hadoop, Common
Hadoop shell commands.

Module III: Working with Map Reduce

L1 and
Map Reduce framework,Working of MapReduce: Job Scheduling, Shuffle L3 8
and Sort, Task Execution, MapReduce Types, Formats and Features.

Module IV: Working with Hive, HBase, PIG

Working with Pig: Pig Latin, User Defined Functions and Operators L2and
9
Hive: Architecture, Comparison with traditional database, Hive QL- L3
querying data, sorting & aggregation, joins & subqueries
HBase : Fundamentals of HBase, HBase Versus RDBMS, Schema design
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

1. Michael Minelli, Michehe Chambers, Ambiga Dhiraj, “Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today‟s Business”, 1st Edition, Wiley CIO
Series, 2013.
2. Tom White, “Hadoop: The Definitive Guide”, 3rd Edition, O‟reilly, 2012.
3. Arvind Sathi, “Big Data Analytics: Disruptive Technologies for Changing the Game”, 1st
Edition, IBM Corporation, 2012.
4. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams
with Advanced Analytics”, 1st Edition, Wiley and SAS Business Series, 2012.

Reference Books
1.Anil Maheshwari, “Big Data”, McGraw Hill
2.Mayank Bhushan,“Big Data and Hadoop- Learn by Example”, BPB Publications

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:
Components CT1 A/C/Q Attd EE
Weightage (%) 15 10 5 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance
CO, PO and PSO mapping

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

CO1 1 -- 2 -- -- -- -- -- -- -- -- -- 1 -- 2 -

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

CO3 1 -- 1 2 -- -- -- -- -- -- -- -- 1 -- 2 -

CO4 1 1 2 -- -- 2 -- -- -- -- 3 -- - -- 1 3

CO5 1 -- 1 -- 1 3 -- -- -- -- 3 -- 1 - - -

1: strongly related, 2: moderately related and 3: weakly related

 IFT4544 Big Data Lab L T P C

Version: 2020.1 Date of Approval: 19, July 2020 0 0 2 1

Pre-requisites/Exposure Basic Concepts of DBMS

Co-requisites Relational Algebra and Relational Calculus

Catalog Description

This course brings together several key big data technologies used for storage, analysis and
manipulation of data. It also introduces the students the key concepts of Hadoop framework,
MapReduce, Pig, Hive, and No-SQL. Students will learn to work on Hadoop platform. The
concepts learnt will make students capable of working on big data projects easier.

Course Objectives

The objective of this course is

 To make students familiar with big data technologies.

 Provide an overview of Hadoop architecture and its working with other open source
technologies.

Course Outcomes

On completion of this course, the students will be able to

CO1. Install and configure Hadoop and various tools like Pig, Hive etc.

CO2.Explain concepts of files and directories in HDFS and apply them in real database
applications.

CO3. Design and implement mapreduce programs for a given problem.

CO4. Solve queries using concepts of Hive and Pig.

CO5. Perform operations using HBase.

 Blooms Number
Modules
level* of hours
Lab Session 1
L1 and
2
L2
1. Installation & Configuration steps of Hadoop
Lab Session 2-3
L1and
1. Working with HDFS commands :mkdir, rmdir, rm, mv, ls, du, put, 4
L3
rm-r, cat, tail etc
2. Working with vi editor
Lab Session 4-5
L1 and
1. Working with Java Map Reduce : Map Class, Reduce Class, Drier 4
L3
Class, map side joins, reduce side joins
Lab Session 6-8
Working with Hive : Queries for Hive : Create table, describe database,
describe table, describe extended table, describe formatted table, drop
table, drop database, display table, where clause
L1 and
1. Commands : Load Files on table : Load from HDFS, load from local 4
L3
2. Command :CTAS Create table as select
3. Queries to create external tables
4. Working with commands like : Order by, group by, like, upper, lower,
max, min
Lab Session 9-10
L1 and
1. Working with PIG : Order by, group by, co group, like, upper, 6
L3
lower,Joins, Union, Cartesian, Product, Pig Scripts
Lab Session 11-12
Working with HBase : Start the hbase, data insert, modify, multiple L1 and
4
version insertion, describe, delete truncate, drop etc. Working with L3
Foreign Key and Check Constraint.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books
 Jeffrey Aven, “SAMS Teach Yourself Hadoop in 24 Hours”, 1stEd., Pearson ,2017.
 Tom White, “Hadoop: The Definitive Guide”, 3rd Edition, O‟reilly, 2012.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

A PR LR V PR V

5 10 10 5 35 35
IA –Internal Assessment, EE- External Exam, PR- Performance, LR – Lab Record, V – Viva.

CO, PO and PSO mapping

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4

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

CO2 1 - -- -- 2 -- -- -- -- -- -- 2 -- 1 1 -

CO3 1 - 1 -- -- -- -- -- -- -- -- 2 -- 1 1 -

CO4 1 - 2 -- -- -- -- -- -- -- -- -- --- 1 1 --

CO5 1 - 2 -- -- -- -- -- -- -- -- -- -- 1 -- -

1: strongly related, 2: moderately related and 3: weakly related

IFT4431 L T P C
TERM PAPER

Version: 2020.1 Date of Approval: 19, July 2020 0 0 0 3

Pre-requisites/Exposure Nil

Co-requisites Nil

Catalog Description

Term paper evaluation course requires the students to study about the current technology topic in
detail. The students have to read research papers, books and other study sources and finalize the
topics for their presentation, Student has to prepare it in detail research paper mentioning all the
content related to the topic. The evaluation is later done and a presentation is also to be prepared.

Course Objectives

The objective of this course is to

1. To increase the knowledge and the understanding of a particular phenomenon/topic.

2. To introduce student about how to write technical papers/research papers.

Course Outcomes

On completion of this course, the students will be able to

CO1: Study the literature and identify the current technical topic

CO2: Study the identified topic in detail

CO3:Prepare a detailed report including the introduction, architecture, advantages, disadvantages

etc

CO4: Prepare a brief presentation of the concerned topic

Text Books

As per topic of summer internship project is chosen and discussion with guide.

Reference Books

As per topic of summer internship project is chosen and discussion with guide.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components V PPT R IM EM

Weightage (%) 20 20 30 30 70

V – Viva, PPT-Power Point Presentation, R – Report, IP-Internal Marks, EM-External Marks

CO, PO and PSO mapping

 PO PO PO PSO PSO PSO PSO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9
10 11 12 1 2 3 4

CO1 1 2 2 -- -- -- -- -- -- -- -- -- - 1 2

CO2 1 2 2 - -- -- -- -- -- -- -- -- - - 1 1

CO3 1 2 - -- -- -- -- -- -- -- -- -- - - 1 1

CO4 1 2 3 -- -- -- -- -- -- -- -- -- - - 1 1

1: strongly related, 2: moderately related and 3: weakly related

IFT4425 L T P C
Machine Learning using Python

Version: 2020.1 Date of Approval: 19, July 2020 3 - - 3

Pre-requisites/Exposure Basic Knowledge of Programming

Co-requisites Nil

Catalog Description

Python is a general-purpose high level programming language that is being increasingly used in
data science and in designing machine learning algorithms. This course provides an introduction
to Python and its libraries like numpy, pandas, matplotlib and explains how it can be applied to
develop machine learning algorithms that solve real world problems.

This course starts with Python language followed by machine learning and covers concepts of
python and all important concepts such as exploratory data analysis, data preprocessing, data
visualization and clustering, classification, regression and model performance evaluation etc.
This course covers all three types of machine learning algorithms including Supervise,
Unsupervised and Reinforcement learning.

Course Objectives

The objective of this course is to

 Equip the students with concepts of programming and problem solving and develop
proficiency in creating applications using the Python Programming Language.
 Provide knowledge of various types of machine learning models, its algorithms and
development of the models using Python programming language.

Course Outcomes

On completion of this course, the students will be able to

CO1: Develop programs in Python to develop algorithmic solutions to computational problems.

CO2: Manage data in python using available data structures such as string, list, and
dictionaryand file handling operations.

CO3: Apply functions to decompose python program and develop modules and packages.

CO4: Preprocess and analyze data before applying suitable machine learning models.

CO5: Understand basic concepts and techniques of Machine Learning and apply machine
learning algorithms to develop machine learning models for solving real word problems.

Blooms Number
Modules
level* of hours

Module-I
Python basis:Installing Python; basic syntax, interactive shell, editing,
saving, and running a script. The concept of data types; variables,
assignments; immutable variables; numerical types; arithmetic operators
and expressions; comments in the program; understanding error messages
L1, L2
Conditions, boolean logic, logical operators; ranges; Control statements: 6
if-else, loops (for, while); short-circuit (lazy) evaluation and L3
Data handling: String, Lists, tuples, and dictionaries; basic list operators,
replacing, inserting, removing an element; searching and sorting lists;
dictionary literals, adding and removing keys, accessing and replacing
values; traversing dictionaries.

Module-II
Files Handling: manipulating files and directories, os and sys modules;
text files: reading/writing text and numbers from/to a file; creating and
reading a formatted file (csv or tab-separated). L1, L2
Design with functions: hiding redundancy, complexity; arguments and and L3 7
return values; formal vs actual arguments, named arguments. Program
structure and design. Recursive functions.
Python Modules and Packages:designing modules and package,
Different ways to import Packages.
OOP: classes, objects, attributes and methods, persistent storage of
objects , constructor, inheritance, polymorphism, operator overloading
(_eq_, _str_, etc); abstract classes, exception handling
Module-III
Arrays and Matrices: The NumPy Module, Creating Arrays and
Matrices, Copying, Arithmetic Operations, Cross product & Dot product ,
Saving and Restoring, Matrix inversion, Vectorized Functions L2, L3
Data Visualization: The Matplotlib Module, Histograms, Bar charts and L4 6
Density Plots, Box Plots, Scatter Plots, Heat Maps etc.
DataFrames: Pandas , Loading data from different sources, Concept of
DataFrames,Working with Dataframes such as selecting, filtering,
grouping, joining etc. Dealing with missing values
Module-IV
Introduction to Machine Learning: Introduction, Applications,
Framework for developing machine learning models
L2, L3
Supervised Learning:Linear regression, Multiple linear regression, 7
logistic regression, classification and regression trees,Support Vector and L4
Machines, K-nearest neighbors
Preprocessing and Scaling , Different Kinds of Preprocessing ,Applying
Data Transformations Overfitting, underfitting, bias-variance tradeoff.
Module-V
Unsupervised Learning: Introduction to Clustering, k-means clustering
Hierarchical clusting, Dimensionality Reduction, Feature Selection, PCA, L2, L3 6
factor analysis, manifold learning.
Reinforcement Learning: Value iteration; policy iteration; TD learning; and L4
Q learning; actor-critic
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6: Evaluation

Text Books

1. Pilgrim, Dive, “Introduction to Python”, 3rd Edition, Apress, 2009.

2. Allen Downey, Jeffrey Elkner, Chris Meyers, “How to Think Like a Computer Scientist
Learning with Python” 2nd Edition Green Tea Press,2002.
3. Manaranjan Pradhan and U Dinesh Kumar, “Machine Learning using Python” , Wiley
Publication

Reference Books

1. John V. Guttag, “Introduction to Computation and Programming using Python”, Prentice

Hall of India, 2014.
2. Mark Lutz, “Learning Python: Powerful Object-Oriented Programming‖”, Fifth Edition,
O„Reilly, Shroff Publishers and Distributors, 2013.
3. Michale Bowles “Machine Learning in Python: Essential Techniques for Predictive
Analysis” Wiley Publication.
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

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

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

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

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

CO4 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 --

CO5 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 ---

1: strongly related, 2: moderately related and 3: weakly related

 IFT4425 L T P C
Machine Learning using Python

Version: 2020.1 Date of Approval: 19, July 2020 3 - - 3

Pre-requisites/Exposure Basic Knowledge of Programming

Co-requisites Nil

Catalog Description

Python is a general-purpose high level programming language that is being increasingly used in
data science and in designing machine learning algorithms. This course provides an introduction
to Python and its libraries like numpy, pandas, matplotlib and explains how it can be applied to
develop machine learning algorithms that solve real world problems.

This course starts with Python language followed by machine learning and covers concepts of
python and all important concepts such as exploratory data analysis, data preprocessing, data
visualization and clustering, classification, regression and model performance evaluation etc.
This course covers all three types of machine learning algorithms including Supervise,
Unsupervised and Reinforcement learning.

Course Objectives

The objective of this course is to

 Equip the students with concepts of programming and problem solving and develop
proficiency in creating applications using the Python Programming Language.
 Provide knowledge of various types of machine learning models, its algorithms and
development of the models using Python programming language.

Course Outcomes

On completion of this course, the students will be able to

CO1: Develop programs in Python to develop algorithmic solutions to computational problems.

CO2: Manage data in python using available data structures such as string, list, and
dictionaryand file handling operations.

CO3: Apply functions to decompose python program and develop modules and packages.

CO4: Preprocess and analyze data before applying suitable machine learning models.
CO5: Understand basic concepts and techniques of Machine Learning and apply machine
learning algorithms to develop machine learning models for solving real word problems.

Blooms Number
Modules
level* of hours

Module-I
Python basis:Installing Python; basic syntax, interactive shell, editing,
saving, and running a script. The concept of data types; variables,
assignments; immutable variables; numerical types; arithmetic operators
and expressions; comments in the program; understanding error messages
L1, L2
Conditions, boolean logic, logical operators; ranges; Control statements: 6
if-else, loops (for, while); short-circuit (lazy) evaluation and L3
Data handling: String, Lists, tuples, and dictionaries; basic list operators,
replacing, inserting, removing an element; searching and sorting lists;
dictionary literals, adding and removing keys, accessing and replacing
values; traversing dictionaries.

Module-II
Files Handling: manipulating files and directories, os and sys modules;
text files: reading/writing text and numbers from/to a file; creating and
reading a formatted file (csv or tab-separated).
Design with functions: hiding redundancy, complexity; arguments and
L1, L2
return values; formal vs actual arguments, named arguments. Program 7
structure and design. Recursive functions. and L3
Python Modules and Packages:designing modules and package,
Different ways to import Packages.
OOP: classes, objects, attributes and methods, persistent storage of
objects , constructor, inheritance, polymorphism, operator overloading
(_eq_, _str_, etc); abstract classes, exception handling
Module-III
Arrays and Matrices: The NumPy Module, Creating Arrays and
Matrices, Copying, Arithmetic Operations, Cross product & Dot product ,
Saving and Restoring, Matrix inversion, Vectorized Functions L2, L3
6
Data Visualization: The Matplotlib Module, Histograms, Bar charts and L4
Density Plots, Box Plots, Scatter Plots, Heat Maps etc.
DataFrames: Pandas , Loading data from different sources, Concept of
DataFrames,Working with Dataframes such as selecting, filtering,
grouping, joining etc. Dealing with missing values
Module-IV
Introduction to Machine Learning: Introduction, Applications, L2, L3
7
Framework for developing machine learning models and L4
Supervised Learning:Linear regression, Multiple linear regression,
logistic regression, classification and regression trees,Support Vector
Machines, K-nearest neighbors
Preprocessing and Scaling , Different Kinds of Preprocessing ,Applying
Data Transformations Overfitting, underfitting, bias-variance tradeoff.
Module-V
Unsupervised Learning: Introduction to Clustering, k-means clustering
Hierarchical clusting, Dimensionality Reduction, Feature Selection, PCA, L2, L3 6
factor analysis, manifold learning.
Reinforcement Learning: Value iteration; policy iteration; TD learning; and L4
Q learning; actor-critic
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6: Evaluation

Text Books

4. Pilgrim, Dive, “Introduction to Python”, 3rd Edition, Apress, 2009.

5. Allen Downey, Jeffrey Elkner, Chris Meyers, “How to Think Like a Computer Scientist
Learning with Python” 2nd Edition Green Tea Press,2002.
6. Manaranjan Pradhan and U Dinesh Kumar, “Machine Learning using Python” , Wiley
Publication

Reference Books

4. John V. Guttag, “Introduction to Computation and Programming using Python”, Prentice

Hall of India, 2014.
5. Mark Lutz, “Learning Python: Powerful Object-Oriented Programming‖”, Fifth Edition,
O„Reilly, Shroff Publishers and Distributors, 2013.
6. Michale Bowles “Machine Learning in Python: Essential Techniques for Predictive
Analysis” Wiley Publication.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester
Examination; Att: Attendance

CO, PO and PSO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 1 3 2 2 -- -- -- -- -- -- -- -- 1 1 2 --

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

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

CO4 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 --

CO5 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 ---

1: strongly related, 2: moderately related and 3: weakly related

IFT4426 L T P C
Machine Learning using Python Lab

Version: 2020.1 Date of Approval: 19, July 2020 0 - 4 2

Pre-requisites/Exposure Basic Knowledge of Programming

Co-requisites Nil

Catalog Description

Python is a language with a simple syntax, and a powerful set of libraries. It is an interpreted
language, with a rich programming environment, including a robust debugger and profiler. While
it is easy for beginners to learn, it is widely used in many scientific areas for data exploration.
This course is an introduction to the Python programming language for students without prior
programming experience. We cover data types, control flow, object-oriented programming, and
graphical user interface-driven applications. The examples and problems used in this course are
drawn from diverse areas such as text processing, simple graphics creation and image
manipulation, HTML and web programming.

Course Objectives

The objective of this course is to

 Equip the students with concepts of programming and problem solving and develop
proficiency in creating applications using the Python Programming Language.
 Provide an overview of various control statements, data structures, object oriented
programming, packages related to image processing, graphics, event driven programming,
socket applications.

Course Outcomes

On completion of this course, the students will be able to

CO1: Explain various operators and control structures in python and their uses to develop
algorithmic solutions to simple computational problems.

CO2: Describe string, python packages and related functions for various file handling operations.

CO3: Apply functions to decompose python program and represent compound data using Python
lists, tuples, and dictionaries.

CO4: Analyze graphics, image processing and object oriented programming concept to create
applications and analyze exceptions during program execution.

CO5: Create GUI based applications using python packages and network client/server
programming.

Blooms Number
Modules level* of hours

Module-I

1. Write a program to read and store the name of three different cities
in three different variables and print all the contents of variables on
the console. L3,L5 4
2. Write a program to read the radius of a circle and print the area of
circle.
3. Write a program to calculate the distance between two points using
distance formula.
 4. Write a program to reverse a four digit number using % and //
operators.
5. Apply control statements of python to create following pattern.
1
12
123
1234
12345
6. Apply control statement in python to construct a program to
prompt a user to read the marks of five different subjects.
Calculate the total marks and percentage of the marks and display
the message according to the range of percentage given table.
Percentage Message

Per>=90 Distinction

Per>=80 && per<90 First Class

Per>=70 && per<80 Second Class

Per>=60 && per<70 Third Class

Per<60 Fail

Module-II

1. Write the function replacevowels(word) which removes all the

vowels („a‟,‟e‟,‟i‟,‟o‟,‟u‟) in a word and returns the remaining
letters in the word.
2. Write a function Eliminate_Letter (Word, Letter) which takes a
word and a letter as arguments and removes all the occurrence of L3,L5 6
that particular letter from the word. The function will return the
remaining letters in the world.
3. Write a program to count number of characters from a file.
4. Generate 50 random numbers within a range 500 to 1000 and write
them to file using function.
5. Write a program to insert a string like “1, 2, 3, 4” and print sum of
all the numbers of the list using split function.
 6. Write a program to write in excel file in following format using
python.

Module-III

1. Creating 1-D, 2-D , 3-D numpy arrays and performing arithmetic

on them.
2. Program on Boolean arrays and conditional selecting items from
array.
3. Stacking and reshaping array
4. Selecting common items between two arrays
5. Plotting simple plots in matplotlib: line, scatter, boxplot, bar, L3,L5 6
6. Working with various parameters available in plot function
7. Using magic commands in jupyter notebook
8. Working with series and data frames in pandas
9. Reading and writing CSV and excel files
10. Conditional selection and indexing in DataFrame
11. Adding and removing columns in DataFrame
12. Cleaning data columns using regular expressions

Module-IV

1. Write python program for following image processing operations

 Convert image in to grayscale image L3,L5 4
 Display size of image
 Rotate an image
 Paste one image on another image.
  Crop an image.
2. Implement logistic regression and knn classification on iris dataset
using scikit-learn
3. Perform linear regression and multiple feature linear regression on
any dataset using scikit-learn
4. Implement gradient descent algorithm to optimize linear regression
and logistic regression algorithm
5. Apply various evaluation metrics on breast cancer data set from
scikit learn after performing logistic regression.
6. In exercise 5 plot decision boundary using matplotlib
7. Implement RandomForest and Decision tree algorithms on external
and internal data sets
8. Show use of Scalers techniques available in scikit-learn

Module V

1. Implement feature scaling in scikit learn

2. Implement PCA on breast cancer dataset using scikit learn 4
3. Draw two-dimensional scatter plot of the Breast Cancer dataset L3,L5
using the first twoprincipal components as done in exercise 2.
4. Apply TSNE algorithm to mnist dataset (manifold learning)
5. Implement MDP and Q-learning in python.

*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4: Analysis; L5: Synthesis, L6: Evaluation

Text Books

1. Pilgrim, Dive, “Introduction to Python”, 3rd Edition, Apress, 2009.

2. Allen Downey, Jeffrey Elkner, Chris Meyers, “How to Think Like a Computer Scientist
Learning with Python” 2nd Edition Green Tea Press,2002.
3. Manaranjan Pradhan and U Dinesh Kumar, “Machine Learning using Python” , Wiley
Publication

Reference Books

1. John V. Guttag, “Introduction to Computation and Programming using Python”, Prentice

Hall of India, 2014.
2. Mark Lutz, “Learning Python: Powerful Object-Oriented Programming‖”, Fifth Edition,
O„Reilly, Shroff Publishers and Distributors, 2013.
3. Michale Bowles “Machine Learning in Python: Essential Techniques for Predictive
Analysis” Wiley Publication.
Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

IA EE

Components A PR LR V

Weightage 5 10 10 5 70
(%)

Note: IA –Internal Assessment, A – Attendance, PR – Performance, LR – Lab Record, V – Viva,

EE- External Exam
CO, PO and PSO mapping

1: strongly related, 2: moderately related and 3: weakly related

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

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

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

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

CO4 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 --

CO5 1 1 1 1 1 2 -- -- -- -- -- -- 1 -- 1 ---

IFT4528 L T P C
Cloud Computing

Version: 2020.1 Date of Approval: 19, July 2020 3 0 0 3

Pre-requisites/Exposure Basics of Distributed Computing

Co-requisites NIL

Catalog Description
This course gives students an insight into the basics of cloud computing along with
virtualization. Concepts covered would enable students to define and differentiate among various
distributed computing platforms. Further they would be able to gain insights about various cloud
simulators like CloudSim, GreenCloud and VMWare for simulating cloud and virtualization
based environments.

Course Objectives

The objective of this course is to

 Equip the students with the featuresand concepts of Virtualization and Cloud Computing.

 Provide basic knowhow about cloud implementation, deployment models or layers and about
cloud simulators like CloudSim, GreenCloud and VMWare.

Course Outcomes

On completion of this course, the students will be able to

CO1: Define and explain Cloud Computing with its characteristics, benefits and limitations.

CO2: List and distinguish among various cloud deployment models along with service delivery
layers.

CO3: Explain concepts of Virtualization with its need and limitations, distinguish between types
of hardware virtualization and list types of desktop virtualization.

CO4: Describe the architecture and demonstrate working mechanism for CloudSim and Green
Cloud simulators.

CO5: Explain the basics of VMWare Simulator and demonstrate implementation of Virtual
machines.

Blooms Number
Modules
level* of hours

MODULE 1:

CLOUD COMPUTING OVERVIEW

Origins of Cloud computing – Cloud components - Essential L1 and
characteristics – On-demand self-service, Broad network access, Location L2 8
independent resource pooling, Rapid elasticity, measured service, Roots
of cloud computing, Architectural influences – High-performance
computing, Utility and Enterprise grid computing, Cloud scenarios –
Benefits: scalability, simplicity, vendors, security, Limitations
MODULE 2:

CLOUD ARCHITECTURE- LAYERS AND MODELS

The cloud reference model: Architecture, Software as a Service (SaaS), L1 and
features of SaaS and benefits, Platform as a Service (PaaS), features of L2 8
PaaS and benefits, Infrastructure as a Service (IaaS), features and benefits
of IaaS, Service providers, challenges and risks in cloud adoption, Cloud
deployment model: Public clouds – Private clouds – Community clouds -
Hybrid clouds - Advantages of Cloud computing .
MODULE 3:

VIRTUALIZATION
Virtualization and cloud computing - Need of virtualization – cost,
L1 and
administration, fast deployment, reduce infrastructure cost – limitations, 10
Characteristics of virtualized environments L2
Types of hardware virtualization: Full virtualization - partial virtualization
- para virtualization.
Desktop virtualization: Software virtualization – Memory virtualization –
Storage virtualization – Data virtualization – Network virtualization
MODULE 4:
L2 and
CLOUD SIMULATORS- CLOUDSIM AND GREENCLOUD 12
Introduction to Simulator, understanding CloudSim simulator, CloudSim L3
Architecture(User code, CloudSim, GridSim, SimJava) Understanding
Working platform for CloudSim, Introduction to GreenCloud.
MODULE 5:

INTRODUCTION TO VMWARE SIMULATOR

Basics of VMWare, advantages of VMware virtualization, using Vmware L2 and 10
workstation, creating virtualmachines-understanding virtual machines, L3
create a new virtual machine on local host, cloning virtual machines,
virtualize a physical machine, starting and stopping a virtual machine.
*Bloom’s Level:
L1-Knowledge; L2-Comprehension; L3-Application; L4:Analysis; L5:Synthesis, L6:Evaluation

Text Books

 Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter,
TATA McGraw- Hill , New Delhi – 2010
 Mastering Cloud Computing- Foundations and Applications Programming -
RajkumarBuyya , Christian Vecchiola and S. ThamaraiSelvi, Tata McGraw Hill, New
Delhi, India, 2013
 Cloud Computing: Web-Based Applications That Change the Way You Work and
Collaborate Online - Michael Miller - Que 2008
Reference Books

 Cloud computing for dummies- Judith Hurwitz , Robin Bloor , Marcia Kaufman ,Fern
Halper, Wiley Publishing, Inc, 2010

 Cloud Computing (Principles and Paradigms), Edited by RajkumarBuyya, James Broberg,

AndrzejGoscinski, John Wiley & Sons, Inc. 2011

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components A CT S/V/Q HA EE
Weightage (%) 5 10 8 7 70

A: Attendance, CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End
Semester Examination
CO, PO and PSO mapping

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

CO1 1 2 -- -- -- -- -- -- -- -- -- -- 1 -- -- --

CO2 1 -- 2 -- -- -- -- -- -- -- -- -- 1 2 -- --

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

CO4 3 -- 2 -- 1 -- -- -- -- -- -- -- 1 -- 2 --

CO5 3 -- 2 -- 1 -- -- -- -- -- -- -- 1 -- 2 --

1: strongly related, 2: moderately related and 3: weakly related

 IFT4637 L T P C
Major Project/ Dissertation

Version: 2020.1 Date of Approval: 19, July 2020 0 0 0 30

Pre-requisites/Exposure Programming/Networking/Testing etc.

Co-requisites Nil

Catalog Description

There are certain phases of every Intern‟s professional development that cannot be effectively
taught in the academic environment. These facets can only be learned through direct, on-the-job
experience working with successful professionals and experts in the field. The internship
program can best be described as an attempt to institutionalize efforts to bridge the gap between
the professional world and the academic institutions. Entire effort in internship is in terms of
extending the program of education and evaluation beyond the classroom of a university or
institution. The educational process in the internship course seeks out and focuses attention on
many latent attributes, which do not surface in the normal classroom situations. These attributes
are intellectual ability, professional judgment and decision-making ability, inter-disciplinary
approach, skills for data handling, ability in written and oral presentation, sense of responsibility
etc. In order to achieve these objectives, each student will maintain a file . The Report aims to
encourage students to keep a personal record of their learning and achievement throughout the
Programme. It can be used as the basis for lifelong learning and for job applications. Items can
be drawn from activities completed in the course modules and from the workplace to
demonstrate learning and personal development. The report will assess the student‟s analytical
skills and ability to present supportive evidence, whilst demonstrating understanding of their
organization, its needs and their own personal contribution to the organization.

Course Objectives

The objective of this course is to

1. Equip the students with new technologies and industrial requirements.

2. Equip students with Project Management, Documentation and Presentation skills.

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

CO1: Demonstrate skill and knowledge of current information and technological tools
and techniques specific to the field of study.

CO2: Identify, analyze, and solve problems creatively through sustained critical investigation.

CO3: Use effectively oral, written and visual communication.

CO4: Understand Project management and team work skills.

Text Books

As per topic of major project.

Reference Books

As per topic of major project.

Modes of Evaluation: Quiz/Assignment/ Seminar/Written Examination

Examination Scheme:

Components V PPT R Exe IM

Weightage (%) 16 8 12 14 50

V – Viva, PPT-Power Point Presentation, R – Report, IM-Internal Marks, Exe-Execution

CO, PO and PSO mapping

PO PO PO PSO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3 4

CO1 1 1 1 1 1 -- -- -- -- -- -- -- - -- 1 2

CO2 2 2 2 2 1 -- -- -- -- -- -- -- - - 1 2

CO3 2 2 2 -- -- -- -- -- 1 1 -- -- - - 1 2

CO4 1 2 3 -- -- -- -- -- 1 1 -- -- - - 1 1

1: strongly related, 2: moderately related and 3: weakly related