Bachelor of Technology (Information Technology) - Second Year - Semester III

Teaching
Cours Assessment Structure Hours
Sr. Structur
e Title of the Course Marks Credits per
No. e
Code L T P Mid Test CA ESE TW PR week

1 MA301 Engineering Mathem atics -III 3 2 0 20 20 60 - - 100 4 5

2 IT302 Switching Theory and Logic Des ign 3 0 0 20 20 60 - - 100 3 3

3 IT302L Switching Theory and Logic Des ign Lab 0 0 2 - - - 25 25 50 1 2

4 IT303 Microproces s ors and Microcontroller 3 0 0 20 20 60 - - 100 3 3

5 IT303L Microproces s ors and Microcontroller Lab 0 0 2 - - - 25 25 50 1 2

6 IT304 Object Oriented Paradigm with C++ 3 0 0 20 20 60 - - 100 3 3

7 IT304L Object Oriented Paradigm with C++ Lab 0 0 2 - - - 25 25 50 1 2

8 BH01 Bas ic Hum an Rights 3 2 0 20 20 60 - - 100 4 5

Ins titute Elective I

- NSS-1
9 IT305 3 2 0 20 20 60 - - 100 4 5
- Developm ental Engineering
- Engineering Phys ics - II

Summary of Semester Assessment Marks, Credit & Hours 18 6 6 120 120 360 75 75 750 24 30

Bachelor of Technology (Information Technology) - Second Year - Semester IV

Cours Teaching Hours

Sr. Assessment Structure
e Title of the Course Structur Marks Credits per
No.
Code L T P Mid Test CA ESE TW PR week

1 IT401 Data Com m unications 3 0 0 20 20 60 - - 100 3 3

2 IT401L Data Com m unications Lab 0 0 2 - - - 25 25 50 1 2

3 IT402 Data Structures and Applications 3 0 0 20 20 60 - - 100 3 3

4 IT403 Program m ing in Java 3 0 0 20 20 60 - - 100 3 3

5 IT402L Data Structures and Applications Lab (in Java) 0 0 2 - - - 25 25 50 1 2

6 IT404 Com puter Organization and Architecture 3 2 0 20 20 60 - - 100 4 5

7 MA401 Num erical Methods 3 2 0 20 20 60 - - 100 4 5

Ins titute Elective II

- NSS-2
8 IT405 3 2 0 20 20 60 - - 100 4 5
- Environm ental Sciences
- Engineering Chem is try - II

9 IT406L Program m ing Lab (Phython) 0 0 2 - - - 25 25 50 1 2

Summary of Assessment Marks, Credit & Hours 18 6 6 120 120 360 75 75 750 24 30
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Title: Engineering Mathematics - III SEMESTER –III

Course Code: MA301 Credits: 04
Prerequisite: M I, M II

Course Objectives:
• To provide in depth knowledge of complex numbers

• To find the solution of differential equations

• To find an in depth knowledge of Fourier series analysis of periodic function

Course Outcomes:
At the end of course student will able:

• Develop an ability to use characteristics of complex numbers in problem pertaining to electric circuits

• To develop an acquaintance with the method of finding solution of di fferential equations

• To develop an in depth knowledge of vector differentiation and vector integration

• To develop Fourier series expansion of different periodic functions

UNIT-I

Laplace Transform
Definition – Conditions for existence, Transforms of elementary functions, Properties of Laplace transforms
- Linearity property, First shifting property, Second shifting property, Transforms of functions multiplied by
N
T , Scale change property, Transforms of functions divided by t, Transforms of integral of functions,
Transforms of derivatives, Evaluation of integrals by using Laplace transform, Transforms of some special
functions- Periodic function, Error function, Unit step function .

UNIT-II

Inverse Laplace Transform

Introductory remarks , Inverse transforms of some elementary functions, General methods of finding inverse
transforms, Partial fraction method and Convolution Theorem for finding inverse Laplace transforms, Appli-
cations to find the solutions of linear differential equations and simultaneous linear di fferential equations with
constant coefficients.

UNIT-III

Fourier Transform
Definitions – Integral transforms, Fourier integral theorem (without proof),Fourier sine and cosine integrals,
Complex form of Fourier integrals, Fourier sine and cosine transforms, Properties of Fourier transforms,
Con-volution theorem for Fourier transforms, Application to boundary value problems.

UNIT-IV

Series Solutions of Differential Equations and Special Functions

Validity of series solution, Series solutions about ordinary and singular point, Frobenius method, Series so-
lution of Bessel equation, Recurrence relations for Bessel function, Generating function for Bessel function,
Orthogonality of Bessel function.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

1
 UNIT-V

Partial Differential Equations and Their Applications Formation of Partial di fferential equations, Solutions of
Partial differential equations – Direct integration, Linear equations of first order (Lagrange’s linear equations),
Homogeneous linear equations with constant coefficients, Method of separation of variables – Application to
find solutions of wave equation, One dimensional heat equation and Laplace equation.

UNIT-VI

Calculus of Complex Functions Limit and continuity of f(z), Derivative of f(z) – Cauchy-Riemann equations,
Analytic functions, Harmonic functions - Orthogonal system, Conformal transformations, complex integration –
Cauchy’s theorem, Integral formula, Residue theorem.

TEXT/REFERENCE BOOKS

Text Books:
1. B. S. Grewal, “ Higher Engineering Mathematics” , Khanna Publishers, New Delhi.
2. P. N. Wartikar , J. N. Wartikar, “A Text Book of Applied Mathematics (Vol I & II) ”, Pune Vidyarthi
Griha Prakashan, Pune.
3. N. P. Bali , N. Ch. Narayana Iyengar, “ A Text Book of Engineering Mathematics”, Laxmi Publications
(P) Ltd. , New Delhi.
4. Dr. B. B. Singh, “A course in Engineering Mathematics (Vol II & III)”, Synergy Knowledgeware, Mumbai.
Reference Books:
1. B. V. Ramana, “Higher Engineering Mathematics”, Tata McGraw-Hill Publications, New Delhi.
2. Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley and Sons, New York.
3. Peter O’ Neil, “ A Text Book of Engineering Mathematics”, Thomson Asia Pvt. Ltd., Singapore.
4. C. R. Wylie, L. C. Barrett,“ Advanced Engineering Mathematics”, Tata McGraw-Hill Publishing
Company Ltd., New Delhi.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

2
 Course Title: Switching Theory and Logic Design SEMESTER –III
Course Code: IT302 Credits: 04
Prerequisite: Nil

Course Objectives:
1. To learn numbering systems used in digital world and its representation, arithmetic operations, error
detection and correction methods.

2. To learn Boolean algebra, logic gates, logic families, realization of Boolean expressions and
minimization techniques.

3. To study the sequential logic circuits design used in synchronous and Asynchronous modes

4. To describe various programmable logic devices

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

1. Illustrate theory of Boolean Algebra & the underlying features of various numbering systems.

2. Design various combinational & sequential logic circuits.

3. Demonstrate working of flip-flop

UNIT-I

Number Systems and Codes

Number systems: Binary, Octal, Hexa-decimal number systems, Binary arithmetic, Codes: Binary code,
Excess-3 code, Gray code, Error detection and correction codes.

UNIT-II

Boolean Algebra and Logic Functions

Boolean algebra: Postulates and theorems, Logic functions, Minimization of boolean functions using
algebra, Karnaugh map and Quine – McClusky methods, Realization using logic gates.

UNIT-III

Logic Families
Logic families: Characteristics of logic families, TTL, CMOS, and ECL families.

UNIT-IV

Combinational Functions
Realizing logical expressions using different logic gates, Design of combinational circuits using
combinational ICs, Realization of adders and subtractors, Design of code converters, Comparators and
decoders, Design of multiplexers, Demultiplexers.

UNIT-V

Introduction to Sequential Circuits

Moore and mealy machines, Introduction to flip-flops like SR, JK, D and T with truth tables, Logic diagrams
and timing relationships, Conversion of flip-flops, Excitation table, State tables, Realization of state stables.

UNIT-VI

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

3
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Programmable Logic Devices

Semiconductor memories, RAM, ROM, PLA, PAL, Memory System design.

TEXT/REFERENCE BOOKS

Text Books:

1. M. M. Mano, “Digital Logic and Computer Design”, Prentice Hall of India Publication, 4TH edition, 2006.
2. R.P. Jain “Modern Digital Electronics”, Tata McGraw Hill Publication, 4TH edition, 2010.

Reference Books:

1. D. P. Leach, A. P. Malvino, G. Saha, “Digital Principles and Applications”, Tata McGraw Hill
Publication, 8TH edition, 1993.
2. Comer, “Digital Logic & State Machine Design”, Oxford Universities Press, 3RD edition, 2014.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

4
 Course Title: Switching Theory and Logic Design Lab SEMESTER –III

Course Code: IT302L Credits: 0

1. Implementation of Boolean functions using Gates.

2. Implementation of following code conversions:

• Binary to gray

• Gray to binary
• Excess –3 to BCD
• BCD to Excess –3.
3. Implementation of half adder, full adder.

4. Implementation of half subtractor, full subtractor.

5. Implementation of K-map examples.
6. Implementation of Quine-Mc’Clusky examples.
7. Implementation of :
• 3 bit odd Parity Checker

• 4 bit odd Parity Checker

• 3 bit even Parity Checker
• 4 bit even Parity Checker
8. Implementation of Multiplexer and Demultiplexer.

9. Implementation of BCD adder using 4 bit adder IC.

10. Study of flip flops:
• RS flip-flop
• D flip-flop
• T flip-flop
• J-K flip-flop
11. Implementation of following counters:
• Synchronous counter
• Asynchronous counter
• Up / down counter
• Ring counter
• Johnson Counter

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

5
 Course Title: Microprocessors and Microcontroller SEMESTER –III
Course Code: IT303 Credits: 04
Prerequisite: Nil

Course Objectives:
1. To understand 8086 microprocessor Architecture
2. To understand design aspects of I/O and Memory Interfacing circuits
3. To acquaint with instruction set and logic required to build assembly language programs
4. To learn microcontroller architecture, its instruction set & interfaces

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

1. Design and implement programs on 8086 microprocessor

2. Design I/O circuits and Memory Interfacing circuits

3. Exhibit knowhow on microcontroller interfaces & programming

4. Experiment with MCS51 and PIC18 microcontroller

UNIT-I

Intel 8086/8088 Microprocessor Family

Architecture and organization of 8086/8088 microprocessor family, Instruction set, Assembly language
pro-gramming, Introduction to mixed language programming using C and Assembly language, 8086
family min-imum and maximum mode operation, Timing diagram for 8086 family, Detailed study of
maximum mode connection: Study of 8288 bus controller, 8086 interrupt structure.

UNIT-II

8086 Instruction Set and Programming

Addressing modes, Instruction Set, ALP, Mixed language programming, Stacks, Strings, Procedures,
Macros, Timers, Counters and delay, Programming examples using DOS and BIOS Interrupts, Device
Drivers Pro-gramming.

UNIT-III

8086 Interrupt System

8086 Interrupt structure, Types and applications: Study of Interrupt Controller 8259A and Interrupt
Priority Management using 8259A.

UNIT-IV

Memory System Design and I/O Interfacing

Interfacing SRAM, ROM and DRAM to 8086, Address decoding and Timing Considerations, I/O
interfacing in 8086: Serial communication interface includes Synchronous and Asynchronous, Protocols,
Parallel com-munication interface includes I/O Mapped I/O, Memory Mapped I/O, and Handshaking
Signals, 8087 Math Co-processor: Study of architecture of 8087, Floating point co- processor, Data types
supported by 8087, Host and co - processor interface, Assembly language Programming for 8086 - 8087
based systems.
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
6
UNIT-V
Intel MCS 51 Family
Introduction to Single chip microcontrollers of Intel MCS 51 family, Architectural and operational features,
Instruction set, CPU timing and machine cycles, Interrupt structure and priorities, Internal Timer / counters,
Serial interface, Connection of external memory, Power saving modes, Interfacing of 8051 with EPROM,
Programming for EPROM versions, 8051 variation.

UNIT-VI

Introduction to the PIC18 Microcontroller

Overview of the PIC18 MCU, The PIC18 Memory Organization, The PIC18 CPU Register, The PIC18
Pipelin-ing, PIC18 Instruction Format, Addressing Modes, A Sample of PIC18 Instruction, Overview of the
8-Bit MCU Market.

TEXT/REFERENCE BOOKS

Text Books:

1. Douglas Hall, “Microprocessors and Interfacing: Programming and Hardware”, Tata McGraw-Hill,
2ND Edition.
2. Han-Way Huan, “An Introduction to Software and Hardware Interfacing”.
Reference Books:
1. Peter Norton, “IBM PC, Assembly Language programming”, BPB publication.
2. John Uffenback, “8086/8088 Interfacing, Programming and Design”,Prentice Hall of India Publication.
3. A. K. Ray, K. M. Bhurchandi, “Advanced Microprocessors and Peripherals”, Tata McGraw Hill, 2000.
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
7

Course Title: Microprocessor and Microcontroller Laboratory SEMESTER –III

Course Code: IT303L Credits: 0

List of Practicals:

1. 8085 and 8086 kit familiarization and basic experiments

2. Arithmetic operation of 16 bit binary numbers
3. Programming exercise : sorting ,searching and string
4. Interfacing with A/D and D/A converters
5. Interfacing with stepper motors
6. keyboard interfacing to 8086
7. 8255 interface to 8086
8. Assembly language programming of 8051
9. Timer programming of 8051,using interrupts
10. LCD interfacing to 8051 –project

12. 11. DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

8
 Course Title: Object Oriented Paradigm with C++ SEMESTER –III
Course Code: IT304 Credits: 03
Prerequisite: BCP

Course Objectives:
• This course focuses on principles of object oriented programming paradigm. The course also includes
practice of writing programs in C++ and Java.

Course Outcomes:
At the end of course student will able:
• Draw the control flow of a program.
• Understand the storage concepts in a simple program.
• Program using basic concepts of OO languages i.e. objects, encapsulation, data hiding etc.

• Program using advanced concepts of OO languages i.e. associations, packages, interfaces, exception
han-dling etc.
• Work with functional, Logic programming paradigms.

UNIT-I

Elements of computer systems, DOS commands and Linux environment, Language processors, Algorithms,
Flowcharts, Object-Oriented Programming Paradigm : Benefits, Applications. Object-Oriented Systems
Development
Object-Oriented Analysis: Static and dynamic modeling, Object-Oriented Design: Class design and
algorithm design, Case studies design, Case studies.

UNIT-II

Beginning with C++: Tokens, Data types, Operators, Expressions, Control structures, Array, Functions,
Structures and Unions.
Class and Objects
Specifying a class, Defining member functions, Private member functions, Static data and member
functions, Arrays of objects, Friend functions.

UNIT-III

Constructors and Destructors

Constructor, Parameterized constructors, Multiple constructors in a class, Copy constructors, Dynamic con-
structors, Destructors. Programming for class diagram and relationship.

UNIT-IV

Inheritance
Single inheritance, Multilevel inheritance, Multiple inheritance, Hierarchical inheritance, Hybrid inheritance,
Virtual base classes, Abstract classes.

UNIT-V

Polymorphism
Operator overloading, Function overloading. Virtual functions, Pure virtual functions. Abstract class.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

9
 UNIT-VI

Working with Files

Classes for file stream operations and I/O stream operation, Opening and closing a file, Detecting end-of-file,
More about Open(): File Modes, Sequential input and output operations.

TEXT/REFERENCE BOOKS

Text Books:

1. Robert Lafore, “Object Oriented Programming in C++”, Pearson Education, 4TH edition, 2008. Reference
Books
2. B. B. Meshram, “Object Oriented Paradigm with C++”, Shroff Publisher.

Reference Books:

1. J. R. Hubbard, “Programming with C++:Schaum’s outlines”, Tata McGraw-Hill publication, 2005.

2. B. B. Meshram, “Programming Workbook for Object Oriented Paradigm with C++”, Shroff Publisher.
3. P. J. Deitel, H..M..Deitel, “C++ How to Program”, Pearson Education, 9TH edition, 2016.
4. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill Publication, 6TH edition,
2013.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

10
 Course Title: Object Oriented Paradigm with C++ Lab SEMESTER –III
Course Code: IT304L Credits: 0

1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called
power () that takes a double value for n and an int value for p, and returns the result as double value. Use
a default argument of 2 for p, so that if this argument is omitted, the number will be squared. Write a main
() function that gets values from the user to test this function.

2. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coor-
dinate. For example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units
up the Y axis. The sum of two points can be defined as a new point whose X coordinate is the sum of the
X coordinates of the points and whose Y coordinate is the sum of their Y coordinates.
Write a program that uses a structure called point to model a point. Define three points, and have the user
input values to two of them. Then set the third point equal to the sum of the other two, and display the
value of the new point. Interaction with the program might look like this:
Enter coordinates for P1: 3 4
Enter coordinates for P2: 5 7
Coordinates of P1 + P2 are : 8, 11

3. Create the equivalent of a four function calculator. The program should request the user to enter a
number, an operator, and another number. It should then carry out the specified arithmetical operation:
adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select
the op-eration). Finally it should display the result. When it finishes the calculation, the program should
ask if the user wants to do another calculation. The response can be Y or N . Some sample interaction
with the program might look like this:

Enter first number, operator, second number: 10/ 3

Answer = 3.333333
Do another (Y/ N)? Y
Enter first number, operator, second number 12 + 100
Answer = 112
Do another (Y/ N) ? N

4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212),
the exchange (767) and the number (8900). Write a program that uses a structure to store these three
parts of a phone number separately. Call the structure phone. Create two structure variables of type
phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The
interchange might look like this:

Enter your area code, exchange, and number: 415 555 1212
My number is (212) 767-8900
Your number is (415) 555-1212

5. Create two classes DM and DB which store the value of distances. DM stores distances in meters and
centimeters and DB in feet and inches. Write a program that can read values for the class objects and add
one object of DM with another object of DB. Use a friend function to carry out the addition operation. The
object that stores the results maybe a DM object or DB object, depending on the units in which the results
are required. The display should be in the format of feet and inches or meters and centimeters depending
on the object on display.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

11
6. Create a class rational which represents a numerical value by two double values- NUMERATOR and
DENOMINATOR. Include the following public member Functions: constructor with no arguments (de-
fault),constructor with two arguments, void reduce() that reduces the rational number by eliminating the
highest common factor between the numerator and denominator.

Overload + operator to add two rational number

Overload ≪operator to enable input through cin
Overload ≫operator to enable output through cout

Write a main ( ) to test all the functions in the class.

7. Consider the following class definition:
class father {
protected:int age;
public;
father (int x) {age = x;}
virtual void iam()
{
cout≪“I AM THE FATHER ” ;
cout ≪“My age is : ” ≪age≪endl;}
};

Derive the two classes son and daughter from the above class and for each, define iam () to write similar but
appropriate messages. You should also define suitable constructors for these classes. Now, write a main
( ) that creates objects of the three classes and then calls iam ( ) for them. Declare pointer to father.
Successively, assign addresses of objects of the two derived classes to this pointer and in each case, call iam
( ) through the pointer to demonstrate polymorphism in action.

8. Write a program that creates a binary file by reading the data for the students from the terminal. The data
of each student consist of roll no., name ( a string of 30 or lesser no. of characters) and marks.
9. A hospital wants to create a database regarding its indoor patients. The information to store include
a. Name of the patient
b. Date of admission
c. Disease
d. Date of discharge

Create a structure to store the date (year, month and date as its members). Create a base class to store
the above information. The member function should include functions to enter information and display a
list of all the patients in the database. Create a derived class to store the age of the patients. List the
information about all the patients to store the age of the patients. List the information about all the
pediatric patients (less than twelve years in age).

10. Imagine a tollbooth with a class called toll Booth. The two data items are a type Unsigned int to hold the
total number of cars, and a type double to hold the total amount of money collected. A constructor
initializes both these to 0. A member function called payingCar ( ) increments the car total and adds 0.50
to the cash total. Another function, called nopayCar ( ), increments the car total but adds nothing to the
cash total. Finally, a member function called display() displays the two totals i.e. total cars and total cash
Include a program to test this class. This program should allow the user to push one key to count a
paying car, and another to count a nonpaying car. Pushing the ESC key should cause the program to
print out the total cars and total cash and then exit.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

12
 Course Title: Basic Human Rights SEMESTER –III
Course Code: BH301 Credits: 04
Prerequisite: Nil

Course Objectives:
1. To work for ensuring that basic human rights are respected everywhere.

2. To cooperate to avoid compromising on human rights for economic or political expediency.

3. To recognize democratic institutions as a fundamental human right.

4. To work towards the sovereignty and self-determination of entities with historical, cultural and
ecological identity.

5. To actively engage with the Government of India and other countries to promote human rights education.

6. To bring diplomatic and commercial pressures on regimes that violates human rights, to ensure that
they respect the basic rights of their citizens.

7. To keep the interests of disempowered communities foremost in all dealings with countries in which
human rights violations occur.

8. To develop a more distinctive and effective role for the International Court of Justice in the field of
human rights.

9. To promote a culture for educating the citizenry that cultivation and promotion of human rights culture is
the sine qua non for the smooth functioning of the organs of a democratic State and for the kind of
development that results into overall development of the society.

10. To train the young men and women for facing the challenges of the pluralistic society and the rising
conflicts and tensions in the name of particularistic loyalties to caste, religion, region and culture.

11. To study the effects of draconian laws and unlawful use of State’s machinery and force by the
enforcement agencies

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

1. Appreciate the importance of the values of human rights.

2. Strengthen respect for human rights and fundamental freedoms and respect others caste, religion,
region and culture.

3. Know about regional, national, state, and local law that reinforces international human rights law.

4. Understand being able to use global, regional, national, and local human rights instruments and mecha-
nisms for the protection of human rights.

5. Be aware of rights as Indian citizen.

6. Understand the importance of groups and communities in the society.

7. Realize the philosophical and cultural basis and historical perspectives of human rights.

8. Make students aware of their responsibilities towards the nation.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

13
 UNIT-I
Introduction
Magna Carta, English bill of rights, American/French declaration, Universal declaration of human rights:
background, Content and relevance.
Theories/Justification/Perspectives on Human Rights
Natural, Moral, Legal and human rights, Natural rights, Positivist, Liberal, Marxist, Feminist, Asian perspec-
tives.

UNIT-II
Debates
Universality of rights, Rights vs duties, Individual vs group rights, Civil and political rights vs social, The notion of
rights in various religious traditions (Hindu, Muslim, Buddhist traditions), Western Influence (especially the impact of
the british rule), National freedom movement, The roles of Gandhi, Ambedkar and Nehru.
UNIT-III
Constitutional Developments in India
Constitutional provisions (especially fundamental rights vs directive principles of state policy and emergency).
Intergovernmental Organization
The united nations (study of specific UN agencies related to human rights), Regional instruments.

UNIT-IV

International NGO
Amnesty international: Its working and impact on India, Case studies of selected national NGOs, Case studies
of selected regional NGOs, The government: Role and effort of some of its agencies including the army, police,
and paramilitary forces.

UNIT-V

National Human Rights Commission of India

Background, Structure and functioning, International humanitarian law, International refugee law, The judi-ciary
including public interest litigation, The medical profession and human rights, The role of the media in human
rights.

UNIT-VI

Some Issues in Human Rights

Violence and terrorism, Women’s rights, Child rights, Dalit rights, Minority rights, Tribal rights, Refugee rights,
Capital punishment, Euthanasia, Rights of the elderly, Gay Rights.

TEXT/REFERENCE BOOKS
Text Books:

1. D. D. Basu, V. R. Manohar, B. P. Banerjee, S.A. Khan, “Introduction to the Constitution of India”,

20TH edition, Lexis Nexis Butterworths publication, 2008.
2. A. R. Desai, “Violation of Democratic Rights in India”, Bombay Popular Prakashan.
Reference Books:
1. M. Mohanty, P. N. Mukherji, O. Tornquist, “People’s Rights: Social Movements and the State in the Third
World ”, New Delhi: Sage Publications, 1998.
2. Nanda, P. Ved, J. R. Scarritt, G. W. Shepherd, “Global Human Rights: Public Policies, Comparative
Measures and NGO Strategies”, Boulder: Westview Press Inc., 1981.
3. Nirmal, J. Chiranjivi, “Human Rights in India: Historical, Social and Political Perspectives”, New Delhi:
Oxford University Press, 2000.
4. Kothari, Smitu, Harsh Sethi, “Rethinking Human Rights: Challenges for Theory and Action”, Delhi :
Lokayan, 1991.
5. A. J. M. Milne, “Human Rights and Human Diversity: An Essay in The Philosophy of Human Rights”,
New York: State University of New York Press, 1986.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

14
 Course Title: NSS-1 (Elective I) SEMESTER –III
Course Code: IT305 Credits: 04
Prerequisite:

Course Objectives:
1. Understanding the community

2. Understanding the needs & problems of the community.

3. Develop civic & social responsibility.

4. Acquire leadership quality & democratic attitude.

5. Develop competence in group living

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

1. To create awareness in social issues.

2. To participate in mass education program.

3. To develop some proposals for local slum area development and waste disposal.

4. To create environmental awareness.

5. To participate in relief and rehabilitation work during natural calamities.

UNIT-I

Introduction to NSS
Introduction to National Service Scheme(NSS) Orientation and structure of National Ser-
vice Scheme(NSS)
National Service Scheme(NSS)- its objectives The historical perspective of National Ser-
vice Scheme(NSS)
National Service Scheme(NSS)- Symbol and its meaning National Service Scheme(NSS)-
its hierarchy from national to college level National Service Scheme(NSS) Regular activi-
ties Distribution of working hours- Association between issues and programs community
project- urban rural activities, Association- modes of activity
evaluation

UNIT-II

Concept of Society
History and philosophy of social sciences in India Concept of society- Development of In-
dian society – Features

UNIT-III

Indian Constitution
Indian Constitution Features of Indian Constitution - Provisions related to social integrity
and development
 UNIT-IV

Social Justice
Social Justice- the concept and its features Inclusive growth- the concept and its features

UNIT-V

Human Personality
Dimensions of human personality Social Dimension of Human personality- Understanding
of the socity Physical Dimension of Human personality- Physical Exercise, Yoga, etc.

UNIT-VI

National Integration
National integration & Communal Harmony National Integration- its meaning, importance
and practice Communal Harmony- its meaning, importance and practice

TEXT/REFERENCE BOOKS

Text Books:
1. “National Service Scheme Manual (Revised) 2006”, Government of India, Ministry of Youth Af-
fairs and Sports, New Delhi.
2. “University of Mumbai National Service Scheme Manual 2009”.
3. “Avhan Chancellor’s Brigade – NSS Wing”, Training camp on Disaster Preparedness Guidelines,
March
2012

Reference Books:
1. “National Service Scheme Manual for NSS District Coordinators”, National Service Scheme
Cell, Dept. of Higher and Technical Education, Mantralaya,
2. “ Annual report of National Service Scheme (NSS)” published by Dept. of Higher and Technical
Education,
Mantralaya,

Course Title: Development Engineering (Elective I) SEMESTER –III

Course Code: IT305 Credits: 04
Prerequisite:

Course Objectives:
1. Students will use multiple qualitative and quantitative methods to learn about user
needs.

2. To come up with new ideas, and to understand how new products and services
achieve or fail to achieve their goals in a development setting.

3. Students will consider solutions in context and devise business plans and plans for
continuous improvement.

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

1. The primary goal is to provide students with a set of skills that will allow them to flour -
ish in a climate of complex problem solving and design challenges in development engi-
neering.

2. Students will learn to participate in and lead innovation and creativity in collaborative
settings.

3. Students will learn how to learn from users using qualitative and quantitative tools in-
cluding surveys, interviews, new monitoring technologies, statistical analyses and experi-
mental designs.

4. Students will be able to apply these skills to current challenges in development engi-
neering.
 UNIT-I

Introduction to Development Engineering

MBA elective classes begin on 8/25 and engineering on 8/28. As a compromise for this
mixed disciplinary class, we will start on W 8/27 with an introduction to the course and
the field of development engineering. What are the key issues and challenges? Who are
the stakeholders? We will also discuss capstone project
UNIT-II

Needs Assessment with Primary, Secondary & Tertiary Sources

Review of needs assessment methods in development engineering and introduction of
one case study. Where are problems in different locations? To design a “Safe water solu-
tion” you have to know more than water. The solution to a development challenge must
be based on knowledge of: Market segments (urban/rural, high/low education), ability to
pay (levels and timing of income; access to credit and costs of credit), information
sources for consumers, household decision making structures (role of women), existing
social groups (e.g., formal, informal, NGO government), distribution channels, and so
forth. We will first discuss research methods using tertiary data (e.g., published data) and
secondary sources first (e.g., individuals or organizations working in the area, organiza-
tions that work in similar areas).

UNIT-III

Analyzing Qualitative Data

Building on qualitative research methods, this unit will focus on analyzing data from de-
sign research. Students should bring all of their data on customer and user needs– inter-
view notes, photographs, etc. – to class. We’ll also use this class time to work with stu-
dents on applying some of the framing and reframing tools to a case or on real data.
Techniques will include personas, scenarios, 2x2 matrices, and journey maps.

UNIT-IV

Quantitative and Mixed methods Needs Assessment

Review and comparison of quantitative and mixed (qualitative and quantitative) methods
in research design: surveys, phone and internet tools. Reflections and instruction on hu-
man subjects and ethical considerations.

UNIT-V

Integrating Needs Assessment Findings to Develop Solutions

The goal is to gain insights from the qualitative and quantitative data from the needs as -
sessment. This is sometimes called “Telling today’s story” to understand the context and
users’ most important challenges and needs.

UNIT-VI

Designing Concepts
This session will focus on really diverging – or in other words generating a LOT of ideas
for your project. We’ll use a variety of methods to get you to view your situation from dif -
ferent perspectives, and thus be able to generate different contextual ideas.

TEXT/REFERENCE BOOKS

Text Books:

1. Whitesides, George. “The Frugal Way: The promise of cost--conscious science,” Science, pp.
154.(bCourses), 2012

2. T. Brown and J. Wyatt. “Design Thinking for Social Innovation (SSIR),” 2010

Reference Books:
1. “Jenkins, Carol, and Peter Howard. “The use of ethnography and structured observations in
the study of risk factors for the transmission of diarrhea in highland Papua New Guinea.” Medi-
cal anthropology 15.1(1993): 1--16. Note on Observation on bSpace.

Course Title: Engineering Physics-II (Elective I) SEMESTER –III

Course Code: IT305 Credits: 04
Prerequisite:

Course Objectives:
1. To enrich the understanding of various types of materials and their applications in en-
gineering and technology

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

1. The students will have the knowledge on physics of materials and that knowledge will
be used by them in different engineering and technology applications

UNIT-I
CONDUCTING MATERIALS
Conductors – classical free electron theory of metals – Electrical and thermal conductivity
– Wiedemann – Franz law – Lorentz number – Draw backs of classical theory – Quantum
theory – Fermi distribution function – Effect of temperature on Fermi Function – Density
of energy states – carrier concentration in metals.

UNIT-II
SEMICONDUCTING MATERIALS PART-I
Intrinsic semiconductor – carrier concentration derivation – Fermi level – Variation of Fer-
mi level with temperature – electrical conductivity – band gap determination.

UNIT-III

SEMICONDUCTING MATERIALS PART-II

compound semiconductors -direct and indirect band gap- derivation of carrier concentra-
tion in n-type and p-type semiconductor – variation of Fermi level with temperature and
impurity concentration –– Hall effect–Determination of Hall coefficient – Applications.

UNIT-IV

MAGNETIC AND SUPERCONDUCTING MATERIALS

Origin of magnetic moment – Bohr magneton – comparison of Dia, Para and Ferro mag -
netism – Domain theory – Hysteresis – soft and hard magnetic materials – antiferromag -
netic materials – Ferrites and its applications Superconductivity : properties – Type I and
Type II superconductors – BCS theory of superconductivity(Qualitative) – High Tc super-
conductors – Applications of superconductors – SQUID, cryotron, magnetic levitation.

UNIT-V

DIELECTRIC MATERIALS
Electrical susceptibility – dielectric constant – electronic, ionic, orientational and space
charge polarization frequency and temperature dependence of polarisation – internal
field – Claussius – Mosotti relation (derivation) – dielectric loss – dielectric breakdown –
uses of dielectric materials (capacitor and transformer) – ferroelectricity and applications.

UNIT-VI

ADVANCED ENGINEERING MATERIALS

Metallic glasses: preparation, properties and applications. Shape memory alloys (SMA):
Characteristics, properties of NiTi alloy, application, Nanomaterials– Preparation -pulsed
laser deposition – chemical vapour deposition – Applications – NLO materials –Birefrin-
gence- optical Kerr effect – Classification of Biomaterials and its applications

TEXT/REFERENCE BOOKS
Text Books:
1. Arumugam M., “Materials Science”. Anuradha publishers, 2010

2. Pillai S.O., “Solid State Physics”. New Age International(P) Ltd., publishers, 2009

Reference Books:

1. Palanisamy P.K. “Materials Science”. SCITECH Publishers, 2011.

2. Senthilkumar G. “Engineering Physics II”. VRB Publishers, 2011.

3. Mani P. “Engineering Physics II”. Dhanam Publications, 2011.

4. Marikani A.“ Engineering Physics”. PHI Learning Pvt., India, 2009
 Course Title: Data Communications SEMESTER –IV
Course Code: IT401 Credits: 04
Prerequisite: Nil

Course Objectives:
• To understand network and transmission models, multiplexing and reception
techniques.

• To identify different types of mediums for transmission, resource sharing and

access tech-niques.
• To list issues with flow control, error detection and correction methods.

• To explore different types of network.

Course Outcomes:
At the end of course student will able:
• Identify basic components of data communication system
• Distinguish data transmission and modulation techniques
• Analyse the impact of channel impairments on data transmission
• Describe medium access methods used for communication

UNIT-I

Introduction to Network Models

Components of communication, Data representation, Data flow, Communication
model, Net-work, Network topologies, Network connection, LAN, WAN, MAN,
Internet, Layered tasks, OSI Model - layered architecture, Layers in OSI model,
TCP/IP model, Comparison.
Data and signals: Analog and digital data, Analog and digital signals, Periodic
and non-periodic signals, Sine wave, Parameters of sine wave, Time and
frequency domain, Composite signals, Bandwidth, Digital signal - bit rate,
Baseband and broadband transmission, Trans-mission impairments, Nyquist bit
rate, Shannon capacity, Performance: Throughput, latency, bandwidth, delay,
jitter.

UNIT-II

Analog Transmission and Multiplexing

Digital to analog conversion, Amplitude shift keying, Frequency shift keying, Phase
shift

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

16
keying, Quadrature amplitude modulation, Analog to analog Conversion, Amplitude modu-
lation, Frequency modulation, Phase modulation, Need of multiplexing, Multiplexer and de-
multiplexer, Frequency division multiplexing, Wavelength division multiplexing, Time division
multiplexing - Statistical TDM, Synchronous TDM, Data rate management in TDM.

UNIT-III

Digital Transmission
Digital to digital conversion, Signals element, Data element, Signal rate, Data rate, DC
com-ponent, Self synchronization, Line coding schemes, NRZ, NRZI, Bipolar AMI,
Pseudoternary, Manchester, Differential Manchester, Block coding schemes - 4B/5B,
8B/10B, Scrambling, HDB3, B8ZS, Analog to digital conversion, Pulse code modulation,
Delta modulation, Trans-mission modes - Serial and parallel transmission.
UNIT-IV

Transmission Media
Guided Media, Twisted pair cable, Co-axial cable, Fiber optic cable, Performance of guided
media, Unguided media, Radio waves, Microwaves, Infrared, Introduction to fiber optics,
Nature of light, Fiber characteristics, Sources and detectors, Connectors and splices.

UNIT-V

Error Detection and Correction

Types of errors, Redundancy, Detection versus correction, Forward error correction and
re-transmission, Modular arithmetic, Block Coding , Error detection, Error correction,
Hamming distance, Minimum hamming distance, Linear block codes, Cyclic codes, Cyclic
redundancy check, Hardware implementation, Polynomials, Cyclic code analysis,
Checksum concept, One’s component.

UNIT-VI

Introduction to Multiple Access

Random Access Protocol: ALOHA, CSMA, CSMA/CD, CSMA/CA, Controlled access:
Reser-vation, Polling, Token passing, Channelization, FDMA, TDMA, CDMA. Cellular
Phones and Satellite Networks
Frequency reuse principle, Roaming, Satellite networks, Orbits, GEO, MEO, LEO
satellite.
TEXT/REFERENCE BOOKS

Text Books:
1. W. L. Schweber,“Data Communications”, Tata McGraw Hill Publication, 1STedition,
2009.
2. B. Forouzan,“Data Communications and Networking”, McGraw Hill Publication, 5TH edi-
tion, 2013.
Reference Books:

1. W. Stallings,“Data and Computer Communications”, Prentice Hall of India Publication,

10TH edition, 2013.
2. Trivedi, “Data Communication and Networks”, Oxford University Press, 2016.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

17
 Course Title: Data Communications Lab SEMESTER –
IV
Course Code: IT401L Credits: 0

List of Practical:

1. Implementation of sampling theorem.

2. Implementation of amplitude modulation, frequency modulation, phase modulation.
3. Implementation of frequency division multiplexing and demultiplexing.
4. Implementation of time division multiplexing and demultiplexing.
5. Implementation of Amplitude Shift Keying (ASK).
6. Implementation of Frequency Shift Keying (FSK).
7. Implementation of Phase Shift Keying (PSK).
8. Study of stop and wait protocol.
9. Study of ALOHA (Pure and Slotted) and CSMA.
10. Study of CSMA/CD.
11. Study of token passing access method.
Note:Practical 1 to 7 may be implemented with the help of kits. List of Practical:

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

 18

Course Title: Data Structure and Algorithms SEMESTER –IV

Course Code: IT402 Credits: 04
Prerequisite: IT305

Course Objectives:
• Assess how the choice of data structures and algorithm design methods impacts
the per-formance of programs.
• Choose the appropriate data structure and algorithm design method for a specified
appli-cation.
• Solve problems using data structures such as linear lists, stacks, queues, hash
tables, binary trees, heaps, tournament trees, binary search trees, and graphs and
writing programs for these solutions.
• Solve problems using algorithm design methods such as the greedy method, divide
and conquer, dynamic programming, backtracking, branch and bound and writing
programs for these solutions.

Course Outcomes:
At the end of course student will able:
• Write neat code by selecting appropriate data structure and demonstrate a working
solu-tion for a given problem.
• Think of all possible inputs to an application and handle all possible errors properly.
• Analyze clearly different possible solutions to a program and select the most e fficient
one.

• Write an application requiring an effort of at least 1000 lines of code to demonstrate

a good working solution.

• Demonstrate the ability to write reusable code and abstract data types in C, using
object-based way of thinking.

UNIT-I

Introduction to Data Structures and Analysis of Algorithms

Need of data structures, Types of data structures, Recursion, ADT (Abstract Data Types),
Basics of algorithm, Analysis of algorithm through time complexity and space complexity,
Asymptotic notations, Pseudo code analysis, Recurrence relations and solving
recurrences using substitution, Recursion tree and master method.
UNIT-II

Stack and Queue

Stack: Representation, Stack operation, Application.
Queue: Representation, Queue operation, Circular and priority queue, Applications.
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
19

UNIT-III

Linked List
Linked list: Operation on linked list, Linked stacks and Queues, Array implementation of
linked list, Linked list using dynamic variable, Doubly linked list, Circular linked list.
UNIT-IV

Binary Tree
Basic tree concept, Binary tree operations, Binary tree representation, Binary tree traversals,
Binary search tree and operations on it, Balanced tree: AVL trees and operations,
Applications of binary trees, Implementing priority queue using binary heap data structure.
UNIT-V

Graphs
Basics concepts of graphs, Representation of graphs, Graph traversals BFS and DFS, Minimum
spanning tree algorithms: Kruskal’s algorithm and Prim’s algorithm, Applications of graphs.

UNIT-VI

Searching Techniques and Hashing

Linear search and binary search, Hashing: Direct-address tables, Hash tables, Open addressing,
Perfect Hashing.
Sorting techniques
Various sorting methods and their time complexity analysis: Insertion sort, Selection sort,
Merge sort, Quick sort, Heap sort.
TEXT/REFERENCE BOOKS

Text Books:

1. E. Horowitz, D. Mehta, S. Sahni, “Fundamentals of Data Structures in C++”, Silicon

Press, 2ND edition, 2008.
2. R.S. Bichkar, “Programming with C and Data structures”, Universities Press, 1STedition,
2014.

Reference Books:

1. Goodrich, Tamassia, “Data Structures and Algorithm in Java”, Wiley publication, 6TH
edi-tion, 2014.
2. T. H. Cormen, C. E. Leiserson, R. L.Rivest, C. Stein, “Introduction to Algorithms”, MIT
Press,3RD edition, 2009.
3. Y. Langsam, M. J.Augenstein and A. M. Tanenbaum , “Data structures using Java”,
Pear-son Education, 2003.
4. J. Murach, “Murach’s Java Programming”, Shroff Publishers, 4TH edition, 2012.
5. V. Goyal, L. Goyal, P. Kumar, “A Simplified Approach to Data Structures”, Shroff Pub-
lishers, 1ST Edition, 2014
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
20

Course Title: Programming in Java SEMESTER –IV

Course Code: IT403 Credits: 04
Prerequisite: BCP, IT305

Course Objectives:
• To use the Java SDK environment to create, debug and run simple Java programs.
• To demonstrate knowledge of Java technology and the Java programming
language struc-ture of classes and methods.
• To understand the fundamentals of Java programming such as variables,
statements and values
• To understand and code control structures such as conditional and iterative
execution and methods
• To understand fundamentals of object-oriented programming in Java, including
defining classes, invoking methods, using class libraries, etc.
• To define interfaces and learn to manage exception
• To learn input and putput string manipulation
• To understand the concept of inheritance and polymorphism
• To learn the definition of data structures in Java programming language

Course Outcomes:
At the end of course student will able:
• Write java programs based OOP concepts.
• Create animation & events based upon advanced java concepts.
• Connect an application with database.
• Develop programs using java collection API as well as java Standard Library.
• Write, debug & document well structured java application

UNIT-I

Introduction to Java
Fundamentals of Object-Oriented Programming, Evolution of Java, Overview of java
language: Data types in Java, Operators and expressions, Decision making and branching:
Control statements such as if-else, do statement, for statement, The else if ladder, jumps in
loops, labeled loops, while repetition statement, Switch statement, Break and continue
statement, Arrays, Strings ,Vectors, Wrapper classes, Enumerated types, Annotations.

UNIT-II
Object Oriented Programming
Classes, Objects and methods: Defining class, Methods, Creating objects, Accessing
class members, Static methods, Finalize methods, Visibility control, Method overloading,
Method overriding, Recursion, Interfaces, Constructors

UNIT-III

Packages and Applet Programming

Java API packages, Using system packages, Naming conventions, Creating packages
and jar files, Accessing and using a package, Hiding classes, Applet programming
UNIT-IV

Multithreading
Creating threads, Extending thread class, Stopping and blocking a thread, Life cycle of a
thread, Using thread method, Thread exceptions, Implementing the run able interface, Inter
thread communication.
Managing errors and exceptions
Types of errors, Exceptions, Syntax of exception handling code, Multiple catch
statements, Throwing your own exception, Using exceptions for debugging.
UNIT-V

Graphics Programming
The graphics class, Lines and rectangles, Circles, Arc and ellipses, Polygons, Drawing
bar charts, AWT package and swings.
UNIT-VI

Managing Files and I/O Handling

Files and streams, Stream classes, Byte stream classes, Character stream classes,
Using streams, Reading / writing bytes and characters, Interactive input and output, Other
stream classes.

TEXT/REFERENCE BOOKS

Text Books:
1. Steven Holzner, “Java 8 Programming: Black Book ”, Dreamtech Press, 2015.
2. H.M. Deitel, P.J. Deitel , “Java : How to Program (Early Objects)”, Pearson Publication,
10TH edition, 2014.
Reference Books:
1. B. Eckel , “Thinking in Java”, Prentice Hall of India Publication, 2ND Edition, 2000.
2. P. Naughton, “The Java Handbook ”, McGraw Hill Publication, 1996.
3. T. Lindholm, F. Yellin, “The Java Virtual Machine Specification”, Addison Wesley Publi-
cation, 1996.
4. E. Balagurusamy, “Programming with Java: A Primer ”, Tata McGraw Hill Publication,
5TH Edition, 2014.
5. J. Murach, M. Urban, “Murach’s Beginning Java with Eclipse”, Shroff Publishers, 1ST
edi-tion, 2016.
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
22

Course Title: Data Structures and Algorithms Lab in Java SEMESTER –

IV
Course Code: IT402L Credits: 0
List of Practicals

1. Write a program to compute sine(x) using series for sine function.

2. Implement a hashing scheme for string data where on a hash collision, the empty
slot is searched at each second subsequent location.
3. Implement a character stack data type and use it to reverse a string.
4. Implement an integer stack data type that grows on demand.
5. Write a program using appropriate stacks for evaluating an infix expression with
parenthesis.
6. Implement a stack using a queue.
7. Write a program, using a queue data type, to simulate a bank where customers are
served on a first-come-first-serve basis.
8. Write one program for each of the following operations with singly linked lists:

a. concatenate two linked list and create third one.

b. free all nodes in a linked list
c. reverse a linked list
d. given two linked list, create a third list which is set-intersection of the elements in
the two.
e. delete every third element from the linked list.
f. copy a given linked list into another (new) list

9. Implement a queue using a doubly linked list.

10. Write the following recursive functions for a singly-linked NULL-terminated list:
insert(), traverse(), search().
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
23

Course Title: Computer Organization and Architecture SEMESTER –III

Course Code: IT404 Credits: 04
Prerequisite: Nil

Course Objectives:
• To understand the structure, functions and characteristics of computer systems
• To learn basics of Parallel Computer Architecture.
• To study hierarchical memory system including cache memories and virtual memory.
• To identify input / output devices and their data transfer mechanism.

Course Outcomes:
At the end of course student will able:
• Identify components of a computer system, including CPU, memory, and
input/output units.
• Explain instruction types, its execution and interrupt mechanism.
• Illustrate numerical and character representations in digital logic and floating point
arith-metic.

UNIT-I

Computer Evolution and Arithmetic

Computer structure and function, Designing for performance, Von Neumann
architecture, Hardware architecture, Interconnection structures, Bus interconnection,
Arithmetic and logic unit, Scalar data types, Fixed and floating point numbers, Booths
algorithm, Hardware im-plementation, Division, Restoring and non restoring algorithms.
UNIT-II

The Central Processing Unit

Machine instruction characteristics, Types of operands, Types of operations, Instruction
for-mats, Instruction types, Processor organization, Register organization, Instruction
cycle, In-struction pipelining.
UNIT-III

The Control Unit

Single bus organization, Control unit operations: Instruction sequencing, Micro operations
and register transfer, Hardwired implementation, Micro-programmed control, Control unit
design, Microinstructions and micro- program sequencing, Microinstruction execution.
 DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
24

UNIT-IV

Memory Organization
Characteristics of memory systems, Internal and external Memory, Types of memories,
High-speed memories: Cache memory, Organization and mapping techniques,
Replacement algo-rithms, Cache coherence, Virtual memory, Address translation: virtual
to physical, Secondary storage devices.
UNIT-V

I/O Organization
Input/output Systems, Programmed I/O, Interrupt driven I/O, Direct memory
access(DMA), Input/Output Channels and processors.
UNIT-VI

Parallel Organization
Parallelism in uniprocessor systems, Instruction level pipelining, Pipeline computers,
Array computers, Multiple processor organizations, Closely and loosely coupled
multiprocessors sys-tems, Symmetric multiprocessors.
TEXT/REFERENCE BOOKS

Text Books:
1. J. P. Hayes, “Computer Architecture and Organization”, McGraw-Hill Publication, 3RD edi-
tion, 2012.
2. K. Hwang , Briggs,“Computer Architecture and Parallel Processing”, Tata Mc-Graw Hill
Publication, 1ST edition, 2012.
Reference Books:
1. W. Stallings,“Computer Organization and Architecture: Designing for performance”, Pren-
tice Hall of India Publication, 9TH edition, 2012.
2. A. S. Tanenbaum , “Structured Computer Organization”, Prentice Hall of India
Publication, 5TH edition, 2005.
3. G. George, “Computer Organization: Hardware and Software”, Prentice Hall of India Pub-
lication, 2ND edition, 1986.
4. D. A. Patterson, J. L. Hennessy, “Computer Organization and Design: The Hardware /
Software Interface”, Morgan Kauffmann Publication, 5TH edition, 2014.
5. C. Hamacher, V. Zvonko, S. Zaky, “Computer Organization”, McGraw Hill Publication,6TH
edition, 2012.
DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE
25
 Course Title: Numerical Methods SEMESTER –IV
Course Code: IT406 Credits: 04
Prerequisite: Nil

Course Objectives:
• To understand working understanding of numerical methods
• To learn various numerical algorithms
• To study the concept of error in these methods, analyse and predict it.
• To implement numerical methods through programming languages

Course Outcomes:
At the end of course student will able:
• Construct a curve by least squares method
• Analyze the data based on large and small sample sizes
• Determine an interpolating function for data
• Solve initial value problems

UNIT-I

Solution of Algebraic and Transcendental Equation: Bisection method, Method of false

po-sition, Newton’s method and Newton-Raphson method, Approximate solution of
equation – Horner’s method.
UNIT-II

Solution of Linear Simultaneous Equation: Gauss elimination method, Gauss-Jordan

method, Crout’s triangular method, Iterative method of solution- Jacobi iteration method,
Gauss-Seidal iteration method, Relaxation method.
UNIT-III

Finite Differences: Forward difference operator, Backward di fference operator, Central di ffer-
ence operator, Newton’s interpolation formulae, Newton’s forward–backward-central interpo-
lation formulae, Sterling formula, Bessel’s formula, Interpolation with unequal intervals.

UNIT-IV

Differentiation and Integration: Newton-Cortes formula, Trapezoidal rule, Simpson one–

third rule, Simpson three- eighth rule, Weddle’s rule.
UNIT-V

Numerical Solution of ODE: Picard’s methods, Taylor series method, Euler’s method,
Modified Euler’s method, Runge - Kutta method, Predictor–corrector method, Milne’s method.

UNIT-VI

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

26
 Adams-Bash fourth method, Second–order differential equation, Numerical solution for
ellip-tical partial differential equation.

TEXT/REFERENCE BOOKS

Text Books:

1. B.S Grewal, “Higher Engineering Mathematics”, 40TH edition, Khanna Publication.

2. S. S. Shastri, “Introduction to Numerical Methods”, PHI Publication.
Reference Books:

1. Conte and De boor, “Elementary Numerical Analysis”, BPB Publication.

2. V. Rajaraman, “Computer Oriented Methods”, 3RD edition, PHI Publication
3. E. Kreyszig, “Advanced Engineering Mathematics”, BPB Publication.
4. Steven C Chapra, “Numerical Methods for Engineers”, 5TH edition, McGraw Hill Publica-
tion.

Course Title: NSS-2 (Elective) SEMESTER –IV

Course Code: IT405 Credits: 04
Prerequisite:

Course Objectives:

1. Acquire leadership quality & democratic attitude.

2. Develop competence in group living

Course Outcomes:

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

1. To create environmental awareness.

2. To participate in relief and rehabilitation work during natural calamities.

UNIT-I

Socio economic survey

Socio-economic survey, its meaning and need, Process of Socio-economic survey- design
of questionnaire; data collection, data analysis and report writing

UNIT-II

Special camping activity

Concept of camp, Identification of community problems, Importance of group living, Team
Building, Adoption of village, Planning for camp, pre camping, during the course of camp
and post camping activities
 UNIT-III

Orientation of the College Unit and Communication Skills

Training and orientation of the program unit in the college Leadership training, formation
of need based programmes, Concept of campus to community(C to C) activities Communi-
cation skills and Documentation Communication skills, the concept, Verbal, Non-Verbal
communication The documentation, Activity Report Writing, basics of NSS accounting, An-
nual Report, Press note and preparation

UNIT-IV

Rapport with Community and Programme Planning

Working with individual group and community Ice breaking, interaction games, conflict
resolution Program planning Programme planning, the concept and its features, require-
ments for successful implementation of program, program flow charting, feedback

UNIT-V

Structure of Government Organizations and Non-Government Organizations

Government organizations (GO), its meaning, Legal set up, functioning, Sources of funding
Non-Government organizations (NGO), its meaning, legal set up, functioning, Sources of
funding National Service Scheme(NSS), Government organizations (GO) and Non Govern-
ment organizations (NGO)

UNIT-VI
Government schemes for community development
Schemes of Government welfare departments for community development- provisions & ex-
amples

TEXT/REFERENCE BOOKS

Text Books:
1. “National Service Scheme Manual (Revised) 2006”, Government of India, Ministry of
Youth Affairs and Sports, New Delhi.

2. “NSS Cell”, Dept. of Higher and Technical Education, Mantralaya, UTKARSHA- Socio
and cultural guidelines

Reference Books:
1. “Training Manual for Field Work” published by RGNIYD, Chreeperumbudur

2. Prof.Ghatole R.N. “Rural Social Science and Community Development”.

3. Purushottam Sheth, Dr.Shailaja Mane, “National Service Scheme” .

 Course Title: Environmental Sciences (Elective) SEMESTER –V
Course Code: IT405 Credits: 04
Prerequisite:

Course Objectives
1. Students will demonstrate the ability to plan and execute experiments that demonstrate
the use and understanding of modern instruments, accurate quantitative measurements,
appropriate recording skills, safe lab practices, and appropriate use of computer
applications.

2. Students will demonstrate their ability to communicate effectively in written and oral form,
demonstrating the ability to create an appropriate annotated bibliography and the ability to
use effective presentation skills.

3. Students will develop a sense of community responsibility by becoming aware of

scientific issues in the larger social context.

4. Students will demonstrate interpretative skills including the ability to analyze data
statistically, assess reliability, interpret results and draw reasonable conclusions.

5. Students will become well grounded in laws and theories of chemistry by demonstrating
and applying the scientific method, developing a synthetic strategy toward a target molecule
and effective use of chemical literature.

6. Students will develop standards of professional behavior that include rules of ethics and
etiquette.

Course Outcomes

1. Understand the natural environment and its relationships with human activities.
2. Characterize and analyze human impacts on the environment.
3. Integrate facts, concepts, and methods from multiple disciplines and apply to
environmental problems.
4. acquire practical skills for scientific problem-solving, including familiarity with
laboratory and field instrumentation, computer applications, statistical and modeling
techniques.
5. Understand and implement scientific research strategies, including collection,
management, evaluation, and interpretation of environmental data
6. Design and evaluate strategies, technologies, and methods for sustainable
management of environmental systems and for the remediation or restoration of
degraded environments
 UNIT I
Environment, Ecosystems and Biodiversity
Definition, scope and importance of Risk and hazards; Chemical hazards, Physical
hazards,Biological hazards in the environment, concept of an ecosystem, structure and
function of an ecosystem, producers, consumers and decomposers-Oxygen cycle and
Nitrogen cycle, energy flow in the ecosystem, ecological succession processes,
Introduction, types, characteristic features, structure and function of the (a) forest
ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems (ponds,
streams, lakes, rivers, oceans, estuaries), Introduction to biodiversity definition: genetic,
species and ecosystem diversity, bio geographical classification of India, value of
biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values ,
Biodiversity at global, national and local levels, India as a mega-diversity nation, hot-spots
of biodiversity, threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts,
endangered and endemic species of India, conservation of biodiversity: In-situ and ex-situ
conservation of biodiversity. Field study of common plants, insects, birds Field study of
simple ecosystems, pond, river, hill slopes, etc.

UNIT II

Environmental Pollution
Definition, causes, effects and control measures of: (a) Air pollution ( Atmospheric chemistry
Chemical composition of the atmosphere; Chemical and photochemical reactions in the
atmosphere, formation of smog, PAN, acid rain, oxygen and ozone chemistry;- Mitigation
procedures, Control of particulate and gaseous emission, Control of SO2, NOX, CO and
HC) (b) Water pollution : Physical and chemical properties of terrestrial and marine water
and their environmental significance; Water quality parameters, physical, chemical and
biological; absorption of heavy metals, Water treatment processes. (c) Soil pollution, soil
waste management: causes, effects and control measures of municipal solid wastes, (d)
Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear hazards, role of an
individual in prevention of pollution, pollution case studies, Field study of local polluted site,
Urban / Rural / Industrial / Agricultural.

UNIT III

Natural Resources
Forest resources: Use and over-exploitation, deforestation, case studies, timber extraction,
mining, dams and their effects on forests and tribal people, Water resources: Use and
overutilization of surface and ground water, dams-benefits and problems, Mineral
resources: Use and exploitation, environmental effects of extracting and using mineral
resources, case studies, Food resources: World food problems, changes caused by
agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems,
water logging, salinity, case studies, Energy resources: Growing energy needs, renewable
and non renewable energy sources, use of alternate energy sources. Energy Conversion
processes, Biogas, production and uses, anaerobic digestion; case studies, Land
resources: Land as a resource, land degradation, man induced landslides, soil erosion and
desertification, role of an individual in conservation of natural resources, Equitable use of
resources for sustainable lifestyles. Introduction to Environmental Biochemistry: Proteins,
Biochemical degradation of pollutants, Bioconversion of pollutants. Field study of local area
to document environmental assets, river / forest / grassland / hill / mountain.
 UNIT IV

Social Issues and the Environment

From unsustainable to sustainable development, urban problems related to energy, water
conservation, rain water harvesting, watershed management, resettlement and rehabilitation
of people; its problems and concerns, case studies, role of non-governmental organization
environmental ethics: Issues and possible solutions, 12 Principles of green chemistry,
nuclear accidents and holocaust, case studies, wasteland reclamation, consumerism and
waste products, environment production act, Air act, Water act, Wildlife protection act,
Forest conservation act, The Biomedical Waste (Management and Handling) Rules; 1998
and amendments scheme of labeling of environmentally friendly products (Ecomark).
enforcement machinery involved in environmental legislation, central and state pollution
control boards, disaster management: floods, earthquake, cyclone and landslides. Public
awareness.

UNIT V

Human Population and Environment

Population growth, variation among nations, population explosion, family welfare
programmes, environment and human health, human rights, value education, HIV / AIDS –
women and child welfare, Environmental impact analysis (EIA), GIS-remote sensing-role of
information technology in environment and human health, Case studies.

TEXT/REFERENCE BOOKS

1. Agarwal, K.C. 2001 Environmental Biology, Nidi Publ. Ltd. Bikaner.

2. Bharucha Erach, The Biodiversity of India, Mapin Publishing Pvt. Ltd.,Ahmedabad –

380 013, India, Email:[email protected] (R)

3. Brunner R.C., 1989, Hazardous Waste Incineration, McGraw Hill Inc.

4. Clark R.S., Marine Pollution, Clanderson Press Oxford (TB)

5. Cunningham, W.P. Cooper, T.H. Gorhani, E & Hepworth, M.T. 2001, Environmental
Encyclopedia, Jaico Publ. House, Mumabai,

6. De A.K., Environmental Chemistry, Wiley Eastern Ltd.

7. Hawkins R.E., Encyclopedia of Indian Natural History, Bombay Natural

History Society, Bombay (R)

8. Rao M N. & Datta, A.K. 1987. Waste Water treatment. Oxford & IBH Publ.
Co. Pvt. Ltd
 Course Title: Chemistry-II (Elective II) SEMESTER –IV
Course Code: IT405 Credits: 04
Prerequisite:

Course Objectives:
• The main objective to introduce this subject of Advanced Engineering Chemistry to impart the
basic and advanced knowledge to the students, so that, they can understand, remember and
capable to explain and apply this knowledge in the field of Engineering/ Technology, thereby
students will achieve their task to complete Academic Programme Outcomes.

Course Outcomes:
At the end of course student will able:

• Students should able to classify and explain various types of Corrosion and should
apply methods to minimize the rate of Corrosion.

• Student should able to understand and apply concepts of Photochemical and Thermal
reactions.

• Students should able to understand the basic concepts of Polymers, Polymerization and
Molding techniques. Student should able to determine molecular weight of High- Polymer.

• Student should able to understand and apply the basic techniques in Chemistry and
ca-pable to explain concept of Solvent Extraction.

• Student should able to understand and apply various types of Spectroscopic,

Chromato-graphic techniques and also able to explain concept of Thermo Gravimetric
Analysis (TGA).

UNIT-I

Corrosion and its Control

Introduction, Fundamental reason, Electrochemical Corrosion, Direct Chemical Corrosion,
Factors affecting the rate of corrosion, types of corrosion-Galvanic, Pitting Corrosion, Mi-
crobiological corrosion, Stress corrosion, methods to minimise the corrosion- Proper design,
Cathodic and Anodic protection.
UNIT-II

Photochemical and Thermal Reactions

Introduction, Laws of Photochemistry, Measurement of absorbed intensity, Quantum yield and
efficiency, Jablonski Diagram, Photosynthesis reaction of Hydrogen Bromide, Brief discussion on
Photosensitization, Brief discussion on Thermal Reactions- Cope Rearrangement.

UNIT-III

Polymers and its Characterisation

Introduction, molecular weight determination by osmotic pressure and viscosity method,
poly-mers in medicines and surgery, inorganic polymers: silicones. Classes of
polymerisation (Syn-thesis and Characterization). Plastic, Moulding of plastic.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

28
 UNIT-IV

Basic Techniques in Chemistry

Preparing substances for analysis, dissolving the samples, Precipitation, Filtration, Washing
Precipitate, Drying and Igniting precipitate. Solvent Extraction: Aqueous and Organic phase
liquid – liquid extraction.
UNIT-V

Basic Techniques in Chemistry Preparing substances for analysis, dissolving the samples,
Pre-cipitation, Filtration, Washing Precipitate, Drying and Igniting precipitate. Solvent
Extrac-tion: Aqueous and Organic phase liquid – liquid extraction.
UNIT-VI

: Instrumental Methods of Analysis Introduction to Chromatography, Types of Chromatog-

raphy (Adsorption and partition chromatography), Paper and Thin Layer Chromatography,
Gas Chromatography – introduction, theory, instrumentation. Brief discussion of Thermo
gravimetric analysis (TGA) .

TEXT/REFERENCE BOOKS

Text Books:
1. Bhal and Bhal Advance Organic Chemistry, S. Chand & Company, New Delhi, 1995.
2. Jain P.C & Jain Monica, Engineering Chemistry, Dhanpat Rai & Sons, Delhi, 1992.
3. Bhal & Tuli, Text book of Physical Chemistry (1995), S. Chand & Company, New Delhi.
4. Instrumental Methods of analysis by Chatwal Anand, Himalaya Publication.
Reference Books:

1. Finar I.L., Organic Chemistry (Vol. I & II), Longman Gr. Ltd & English Language Book
Society, London.
2. Barrow G.M., Physical Chemistry, McGraw-Hill Publication, New Delhi.
3. Shikha Agarwal, Engineering Chemistry- Fundamentals and applications, Cambridge Pub-
lishers - 2015.
4. O. G. Palanna , Engineering Chemistry, Tata McGraw-Hill Publication, New Delhi.
5. WILEY, Engineering Chemistry, Wiley India, New Delhi 2014.
6. Instrumental Methods of analysis by Willard, Dean, Merrit, McGraw - Hill.
7. Physical Chemistry, Glasstone.
8. Physical Chemistry, Peter Atkins, W.H. Freeman & Co. 9TH edition, 2009.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

 29

Course Title: Programming Lab(Phython) SEMESTER –IV

Course Code: IT404L Credits: 0

List of Practical:
 Bachelor of Technology (Information Technology) - Third Year - Semester V
Teaching
Assessment Structure
Course Structure Hours per
Sr. No. Title of the Course Marks Credits
Code week
L T P Mid Test CA ESE TW PR

1 IT501 Database Management Systems 3 0 0 20 20 60 - - 100 3 3

2 IT501L Data Base Management Systems Lab 0 0 2 - - - 25 25 50 1 2

3 IT502 Computer Algorithms 3 0 0 20 20 60 - - 100 3 3

4 IT502L Computer Algorithms Lab 0 0 2 - - - 25 25 50 1 2

5 IT503 Computer Networks 3 2 0 20 20 60 - - 100 4 5

Department Elective - Group 1

- Software Testing
6 IT504DE 3 0 0 20 20 60 - - 100 3 3
- Sofware Project Management
- Compiler Construction

7 IT504DEL Department Elective - Group 1 Lab 0 0 2 - - - 25 25 50 1 2

Stream Elective - Group 1

- Software Engineering
- IT Service Management
8 IT505SE 3 2 0 20 20 60 - - 100 4 5
- Information Storage & Management
- Network Management
- ???

9 IT506 Seminar 1 2 0 - - - 50 - 50 2 3

10 IT507 Programming Lab - Minor 0 2 2 - - - 25 25 50 2 4

Summary of Semester Assessment Marks, Credit &
16 8 8 100 100 300 150 100 750 24 32
Hours
Bachelor of Technology (Information Technology) - Third Year - Semester VI
Teaching
Assessment Structure
Course Structure Hours per
Sr. No. Title of the Course Marks Credits
Code week
L T P Mid Test CA ESE TW PR

1 IT601 Operating Systems 3 0 0 20 20 60 - - 100 3 3

6 IT601L Operating Systems Lab 0 0 2 - - - 25 25 50 1 2

2 IT602 Theory of Computing 3 2 0 20 20 60 - - 100 4 5

3 IT603 Object Oriented System Design 3 0 0 20 20 60 - - 100 3 3

7 IT603L Object Oriented System Design Lab 0 0 2 - - - 25 25 50 1 2

Open Elective / Department Elective -
Group 2
4 IT604DE - Enterprise Resource Planning 3 2 0 20 20 60 - - 100 4 5
- Decision Support System
- Discrete Mathematics
Stream Elective - Group 2
- Embedded Systems
- Data Storage Technologies & Networks
5 IT605SE 3 0 0 20 20 60 - - 100 3 3
- Service Oriented Architecture
- Network Programming
- Advanced Database

8 IT605SEL Stream Elective - Group 2 Lab 0 0 2 - - - 25 25 50 1 2

10 IT606L Programming Lab - Major 1 4 2 - - - 50 50 100 4 7

Summary of Semester Assessment Marks, Credit &
16 8 8 100 100 300 75 75 750 24 32
Hours
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Title: Database Management Systems SEMESTER –V

Course Code: IT501 Credits: 04
Prerequisite: Nil

Course Objectives:
5.To understand architecture and functioning of database management systems.
6.To learn relational mode.

7.To use structured query language (SQL) and its syntax, transactions, database recovery and
techniques for query optimization

8.To acquaint with various normalization forms and query processing.

9.To learn indexing methods

Course Outcomes:
At the end of course student will able:
5. Explain need of database management.

6. Design and implement a database schema for a given problem-domain

7. Normalize a database

8. Create and query a database using SQL DML/DDL commands, stored procedures and functions..

9. Declare and enforce integrity constraints on a database

10. Illustrate understanding of indexing methods.

UNIT-I

Introduction: Basic concepts, Advantages of DBMS over file-processing systems, Data abstraction, Data
mod-els and data independence, Components of DBMS and overall structure of DBMS, Data modeling,
Entity, Attributes, Relationships, Constraints, Keys E-R diagrams, Components of E-R Model.

UNIT-II

Relational Model:Basic concepts, Attributes and domains, Concept of integrity and referential constraints,
Schema diagram. Relational query languages, Relational Algebra and Relational Calculus: Tuple relational
and domain relational calculus.

UNIT-III

Structured Query Language-I: Introduction, Characteristics and advantages, Data types and literals, DDL,
Tables: creating, modifying, deleting, Views: creating, dropping, Updation using views, DML, Operators,
SQL DML queries, SELECT query and clauses.

UNIT-IV

Structured Query Language- II: Set operations, Predicates and joins, Set membership, Tuple variables, Set
comparison, Ordering of tuples, Aggregate functions, Nested queries, Database modification using SQL Insert,
Update and Delete queries,Dynamic and embedded SQL and concept of stored procedures, Query-by-example.

UNIT-V

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

1
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Relational Database Design: Notion of normalized relations, Functional dependency, Decomposition and
prop-erties of decomposition, Normalization using functional dependency, Multi-valued dependency and
join depen-dency. Storage and File Systems: Secondary storage, RAID, File organization, Indices, Static
and dynamic hashing, B-Trees and B+ Trees.

UNIT-VI

Query Processing and Transaction Management: Measures of query cost, Selection operation, Sorting
and join operation, Transaction concept, Components of transaction management, Concurrency and
recovery sys-tem, Different concurrency control protocols such as timestamps and locking, Validation,
Multiple granularity, Deadlock handling, Different crash recovery methods such as log-based recovery,
Shadow-paging, Buffer man-agement and Remote backup system.

TEXT/REFERENCE BOOKS

Text Books:

3. Abraham Silberschatz, Henry F. Korth, and S. Sudarshan, “Database system concepts”, 6TH edition,
McGraw Hill Education, 2011.
4. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, 7TH edition, Pearson
Educa-tion, 2015.
5. Raghu Ramkrishnan, Johannes Gehrke, “Database Management Systems”, 3RD edition, McGraw Hill
Edu-cation, 2007.

Reference Books:

4. Carlos Coronel, Steven Morris “Database systems: Design implementation and management”,
11TH edition, Cengage Learning Press, 2014.
5. J. Murach, “Murach’s MySQL”, 2ND edition, Shroff Publication, 2016.
6. J. Murach, “Murach’s Oracle SQL and PL/SQL: Works with All Versions Through 11g”, Shroff
Publication, 2008.

Course Title: Computer Algorithms SEMESTER –V

Course Code: IT405 Credits: 04
Prerequisite: IT402

Course Objectives:
5. To learn fundamentals of algorithms design techniques

6. To understand basic knowledge of computational complexity, approximation and randomized

algorithms, selection of the best algorithm to solve a problem.

7. To analyse the performance of algorithms, to compare algorithms with respect to time and space
com-plexity.

8. To develop proficiency in problem solving and programming.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

2
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Outcomes:
At the end of course student will able:
4. Develop efficient algorithms for simple computational tasks

5. Gain understanding of concepts of time and space complexity, worst case, average case and best case
complexities and the big-O notation.
6. Design standard algorithms such as sorting, searching, and problems involving graphs.
7. Compute complexity measures of algorithms, including recursive algorithms using recurrence relations.

UNIT-I

Introduction: Instruction counts, Growth functions, Necessity of time and space analysis of algorithms, Order
notations (O, Θ, Ω notations), Problem instance size, Frequently occurring recurrence relations in analysis of
algorithms.

UNIT-II

Design Techniques-I: Divide and Conquer: Binary search, Finiding maximum and minimum, Merge sort,
Quick sort, Strassen’s matrix multiplication. Greedy Algorithms: Knapsack problem, Job sequencing with
deadlines, Optimal storage on tapes, Optimal merge pattern, Single source shortest paths.

UNIT-III

Design Techniques-II: Dynamic Programming: Multistage graphs, All pairs shortest paths, 0/1 Knapsack,
Travelling salseman problem.

UNIT-IV

Design Techniques: Backtracking: 8-Queens Problems, Sum of subsets, Graph coloring. Branch-and-bound:
Least cost(LC) search, Control abstractions for LC search, FIFO branch and bound, LC branch and bound.

UNIT-V

Selected Algorithms From Various Areas: Graph Theory, Elementary Algorithms: DFS, BFS, Topo-logical
Sort, Minimum spanning trees (Kruskal and Prim’s algorithms), Shortest Paths: Single source shortest paths,
All pairs shortest paths, String Matching: The na¨ıve string-matching algorithm, The Robin-Karp algorithm,
The Knuth-Morris-Pratt algorithm.

UNIT-VI

Complexity Theory: Lower-bound arguments, NP-completeness: Introduction to NP-Complete, Reducibility

(SAT, Independent Set, 3VC, Subset Sum and Partition, Hamiltonian Circuit).

TEXT/REFERENCE BOOKS

Text Books:

3. Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, “Introduction to Algorithms”, 3RD
edition, MIT Press, 2009.
4. E. Horowitz, S. Sahni and S. Rajsekaran, “Computer Algorithms”, 2ND edition, Silicon Press, 2008.
Reference Books:
3. B. K. Joshi, “Data Structures and Algorithms in C++”, Tata McGraw Hill Education, 2010.
4. G. T. Heineman, Gary Pollice, Stanley Selkow, “Algorithms in a Nutshell ”,1ST edition, Shroff Publication,
2008.
5. Kyle Loudon, “Mastering Algorithms with C ”, 1ST edition, Shroff Publication, 2008.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

3
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Title: Computer Networks SEMESTER –V

Course Code: IT503 Credits: 04
Prerequisite: IT401

Course Objectives:
•

Course Outcomes:
At the end of course student will able:
•

UNIT-I

The physical Layer and Data Link Layer: The theoretical basis for data communication, Guided
transmission media, Wireless transmission, Communication satellites, Digital modulation and
multiplexing, The public switched telephone network, The mobile telephone system, Data link layer:
Design issues, Error detection and correction, Elementary data link protocols, Sliding window
protocols.

UNIT-II

The Medium Access Control - I: The channel allocation problem, Multiple access protocols -
ALOHA, Carrier Sense Multiple Access (CSMA) protocols, Collision free protocols, Limited
contention protocols. Ethernet: Physical layer, MAC sublayer protocol, Performance, Switched,
Fast, Gigabit Ethernet, Wireless LANs - 802.11 architecture and protocol stack, Physical layer,
MAC sublayer protocol, Frame structure .

UNIT-III

The Medium Access Control – II: Broadband wireless: Comparison of 802.16 with 802.11 and 3G,
Architec-
ture and protocol stack, Physical layer, MAC sublayer protocol, Frame structure. Bluetooth:
Architecture, Applications, Protocol stack, Radio layer, Link layer, Frame structure, RFID, Data link
layer switching: Uses of bridges, Learning bridges, Spanning tree bridges, Repeaters, Hub,
Switches, Routers, and Gateways.

UNIT-IV

The Network Layer: Network layer design issues, Store and forward packet switching, Service to
the transport layer, Implementation of connectionless service, Connection-oriented service. Routing
Algorithms: The opti-mality principle, Shortest path algorithm, Flooding, Distance vector routing,
Link state routing, Hierarchical routing, Broadcast routing. Congestion Control Algorithms:
Approaches to congestion control, Traffic aware routing, Admission control, Integrated services,
Differentiated services.

UNIT-V

The Transport Layer: The transport services: Service provided to the upper layers, Transport
service prim-itives, Berkeley sockets, Elements of transport protocols: Addressing, Connection
establishment, Connection release, Error control and flow control, Multiplexing.
Congestion control: Desirable bandwidth allocation, Sending rate regulation.

UNIT-VI

The Application Layer: Domain Name System (DNS): Name space, Domain resource records, Name
servers.
Electronic mail: Architecture and services, The user agent, Message formats, Message transfer, Final
delivery.
World Wide Web: Architectural overview, Static web pages, Dynamic web pages and web
applications, HTTP
.
TEXT/REFERENCE BOOKS

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

4
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Text Books:

• A.Tanenbaum, “Computer Networks”, Pearson Education, 5TH edition, 2010.

• B. Forouzan, “Data Communications and Networking”, Tata McGraw Hill Publication, 5TH edition,
2013.

Reference Books:

• S. Keshav, “An Engineering Approach to Computer Networking: ATM Networks, the

Internet, and the Telephone Network”, Addison-Wesley Publication, 1997.
• D. E. Comer, “Computer Networks and Internet”, Pearson Education, 5TH edition, 2009.
• M. Gallo, W. Hancock, “Computer Communications and Networking Technologies”, 2001.

Course Title: Software Testing (Department Elective- Group 1) SE

Course Code: IT505 Cre
Prerequisite: IT602

Course Objectives:
5. To study fundamental concepts in software testing, including software testing objectives,
processes, crite-ria, strategies, and methods.

6. To learn planning of a test project, designing test cases and test data, conducting test
operations, managing software problems and defects, and generating a test report.

7. To develop an understanding of the meaning and importance of quality in relation to

software systems and the software development process.

8. To study issues and techniques for implementing and managing software quality
assurance processes and procedures.

Course Outcomes:
At the end of course student will able:

5. To apply software testing knowledge and its processes to software applications.

6. To identify various software testing problems

7. To solve software testing problems by designing and selecting software test models,
criteria, strategies and methods.

8. To apply the techniques learned to improve the quality of software development.

9. To prepare a software quality plan for a software project.

UNIT-I

Principles of Testing Software development life cycle model: Phases of software project,
Quality, Quality assurance and quality control, Testing, Verification and validation, Process
models to represent various phases, Life cycle models, Software testing life cycle.

UNIT-II

White Box Testing (WBT) and Black Box Testing: Static testing, Structural testing, Challenges in WBT.
Black box testing: Black box testing process.

UNIT-III

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

5
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Integration Testing: Definition, As a type of testing: Top-down integration, Bottom-up integration, Bi-
directional integration, System integration, Choosing integration method, As a phase of testing, Scenario
testing: System scenarios, Use case scenarios, Defect bash.

UNIT-IV

System and Acceptance Testing, Functional Vs non Functional, Functional system testing, Non- functional
system testing, Acceptance testing.

UNIT-V

Performance testing, Regression testing, Internationalization testing, Adhoc testing. Factors governing perfor-
mance of testing, Methodology, tools and process for performance testing. Regression Testing: Introduction,
Types of Regression testing, Regression testing process. Adhoc testing: Introduction, Buddy testing, Pair testing,
Exploratory testing, Iterative testing, Agile and Extreme testing, XP work flow, Defect seeding.

UNIT-VI

Testing Object Oriented Software: Introduction, Comparison of object oriented and procedural software, Sys-tem
testing example, Unit testing of classes, Tools for testing object oriented software, Testing web applications.

TEXT/REFERENCE BOOKS

Text Book:

• Srinivasan Desikan, Gopalaswamy Ramesh, “Software Testing: Principles and Practices”, Pearson
publica-tion, 2ND edition, 2006.
Reference Books:
• Loise Tamres, “Introducing Software Testing”, Pearson publication, 2002.
• Boris Beizer, “Software Testing Techniques”, 2ND edition, Dreamtech press, 2014

Course Title: Software Project Management (Department Elective - Group 1) SEMESTER –V

Course Code: IT505 Credits: 04
Prerequisite: Nil

Course Objectives:
3. To understand basics of software project planning
4. To learn activities planning, Risks planning & Control
5. To acquire knowledge of cost monitoring, change controls
6. To know how to manage teams

Course Outcomes:
At the end of course student will able:
5. Demonstrate knowledge of project management concepts, methodologies and techniques
6. Exhibit knowledge on scheduling, cost, risks & mitigation
7. Showcase techniques on how to monitor progress and control activities
8. Assess team dynamics, motivating & decision making

UNIT-I

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

6
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Introduction to Software Project Management:Project definition, Contract management, Activities covered

by software project management, Overview of project planning, Stepwise project planning.

UNIT-II

Project Evaluation: Strategic assessment, Technical assessment, Cost benefit analysis, Cash flow
forecasting, Cost benefit evaluation techniques, Risk evaluation.

UNIT-III

Activity Planning: Objectives, Project schedule, Sequencing and scheduling activities, Network planning
mod-els, Forward pass, Backward pass, Activity float, Shortening project duration, Activity on arrow
networks, Risk management, Nature of risk, Types of risk, Managing risk, Hazard identification, Hazard
analysis, Risk planning and control.

UNIT-IV

Monitoring and Control: Creating framework, Collecting the data, Visualizing progress, Cost monitoring,
Earned value, Prioritizing monitoring, Getting project back to target, Change control, Managing contracts,
Types of contract, Stages in contract placement, Typical terms of a contract, Contract management, Accep-
tance.

UNIT-V

Managing People: Introduction, Understanding behavior, Organizational behavior: A background, Select-ing

the right person for the job, Instruction in the best methods, Motivation, The Oldman – Hackman job
characteristics model.

UNIT-VI

Organizing Teams: Working in groups, Becoming a team, Decision making, Leadership, Organizational
struc-tures, Stress, Health and safety, Case studies.

TEXT/REFERENCE BOOKS

Text Book:

1. Bob Hughes, Mikecotterell, “Software Project Management”, 4TH edition, Tata McGraw Hill, 2006.

Reference Books:

1. Ramesh, Gopalaswamy, “Managing Global Software Projects”, Tata McGraw Hill, 2005.
2. Royce, “Software Project Management”, Pearson Education, 1999.
3. Jalote, “Software Project Management in Practice”, Addison-Wesley Professional, 2002.

Course Title: Compiler Construction SEMESTER –V

Course Code: IT504DE Credits: 04
Prerequisite: Nil

Course Objectives:
1. To introduce the major concept areas of language translation and compiler design
2. To develop an awareness of the function and complexity of modern compilers.
3. To provide practical, hands on experience in compiler design.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

7
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Outcomes:
At the end of course student will able:
3. To understand the major concept areas of language translation and compiler design
4. To develop an awareness of the function and complexity of compilers.

5. To identify the similarities and differences among various parsing techniques and
grammar transformation techniques

UNIT-I

Introduction to Compiling and Lexical Analysis: Definition, analysis of the source program, the phases of a
compiler, the grouping of phases, Compiler-Construction tools, The role of the Lexical analyzer, Input
buffering, Specification of Tokens, A Language for Specifying Lexical Analyzers, Design of a Lexical
Analyzer generator.

UNIT-II

Syntax Analysis: The role of the Parser, Context-free grammars, Writing a Grammar, Top-Down Parsing,
Bottom- Up Parsing, Operator-precedence Parsing, LR-Parsers, Using Ambiguous Grammars, Parser
Gener-ators.

UNIT-III

Syntax-Directed Translation: Definitions, Construction of Syntax Trees, Bottom-Up Evaluation of S-

Attributed definitions, Top-Down Translation, Bottom-Up Evaluation of Inherited attributes.

UNIT-IV

Intermediate Code Generation: Intermediate Languages, Declarations, Assignment Statements, Boolean

Ex-pressions, Case Statements, Back patching, Procedure Calls.

UNIT-V

Code Generation: Issues in the Design of a Code Generator, The target Machine, Run-Time Storage
Manage-ment, Basic Blocks and Flow Graphs, Next-Use Information, Simple Code Generator, Register
allocation and Assignment, The DAG Representation of Basic Blocks,Generating Code from DAGs,
Dynamic Programming, Code-Generation Algorithm, Code-Generators.

UNIT-VI

Code Optimization: Peephole Optimization, Principal sources of optimization, Introduction to Global data
flow analysis.

TEXT/REFERENCE BOOKS

Text Books:

• Aho, Sethi, Ullman, Compilers-tools and Techniques, 2NDedition, Pearson, 2011.

• Trembly, Sorenson, Theory and Practice of Compiler Writing, McGraw Hill Publication.
• Hopcroft, Introduction to Automata Theory, Languages and Computation, Pearson Publication.
Reference Books:

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

8
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

4. Paul G. Sorenson, Compiler Writing, Tata McGraw Hill.

5. Hunter, The Essence of Compilers, Pearson Publication.
6. Lewis, Elements of the Theory of Computation, Pearson Publication.

Course Title: Software Engineering(Stream Elective - Group 1 SEMESTER –V

Course Code: IT506 Credits: 04
Prerequisite: Nil

Course Objectives:
5. To understand software lifecycle development models

6. To understand and apply software requirements engineering techniques ,software design principles ,
mod-eling and software testing techniques
7. To understand the use of metrics in software engineering
8. To understand software project management

Course Outcomes:
At the end of course student will able:
7. To use the techniques, skills, and modern engineering tools necessary for engineering practice.
8. To design a system, component, or process to meet desired needs within realistic constraints such as
economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability
9. To identify, formulate, and solve engineering problems.

UNIT-I

Software Development Process: Software crisis and myths, Software process and development: Generic view of
process, Software life cycle and models, Analysis and comparison of varies models, An agile view of process.

UNIT-II

Requirement Engineering: Requirements engineering tasks, Initiating requirement engineering process,

Elicit-ing requirement, Developing use-cases, Building the analysis model, Negotiating and validating
requirement, Building the analysis model.

UNIT-III

System Design Overview: Design process and design quality, Design concepts, Design model, Pattern
based software design, Architectural design, User interface design. UML: Di fferent methods: Rambaugh /
Booch / Jakobsons, Need for standardization. Diagramming in UML (Use CASE, Class, Interaction, State
diagrams) CASE TOOLS.
UNIT-IV

Validation and Testing: Strategic approach to Software testing, Strategic issues, Test strategies for conventional
software, Validation testing, System testing, Debugging. White box testing and Black box testing.

UNIT-V

Web Engineering: WebApp engineering layers, Web engineering processes planning for web engineering
projects, Project management issue for web engineering. Metrics, Requirement analysis, Analysis models
for web engi-neering design for webApps, Testing for webApps.

UNIT-VI

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

9
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Planning and Management of Project: Project management, Metrics for process and projects, Estimation,
Project scheduling, Risk management, Importance of software quality and measurements software
engineering techniques for quality assurance, Change management. ISO 9000 and CMM/PCMM.

TEXT/REFERENCE BOOKS

Text Books:
10. Roger S. Pressman, “Software Engineering”, 6TH edition, Tata McGraw-Hill, 2006.
11. G. Booch, J. Rambaugh, and I. Jacobson, “The Unified Modeling Language User Guide”, 2ND
edition, Addison Wesley, 2005.
Reference Books:
11. Shari Pfleeger, “Software Engineering”, 3RD edition, Pearsons Education, 2008.
12. Ian Sommerville, “Software Engineering”, 10TH edition, Pearsons Higher Education, 2016.
13. Pankaj Jalote, “An Integrated Approach to Software Engineering”, 2ND edition, Springer Newyork, 2013.
.

Course Title: Information Storage & Management SEMESTER –V

Course Code: IT506 Credits: 04
Prerequisite: Nil

Course Objectives:
• To evaluate storage architecture; understand logical and physical components of storage Infrastructure
including storage subsystems
• To describe storage networking technologies such as FC-SAN, NAS, IP-SAN anddata archivalsolution –
CAS
• To identify different storage virtualization technologies and their benefits
• To understand and articulate business continuity solutions including, backup and recovery
technologies, and local and remote replication solutions

• To define information security, and storage security domains and Identify parameters of managing and
monitoring storage infrastructure and describe common storage management activities and solutions.

Course Outcomes:
At the end of course student will able:
• Describe and apply storage technologies
• Identify leading storage technologies that provide cost-effective IT solutions for medium to large scale
businesses and data centers

• Describe important storage technologies’ features such as availability, replication, scalability and
perfor-mance
• Design, analyze and manage clusters of resources

UNIT-I

INTRODUCTION TO STORAGE MANAGEMENT

Introduction to Information Storage Management - Intelligent Storage System (ISS) and its components Im-
plementation of ISS as high-end and midrange storage-arrays.Direct Attached -Storage - Introduction to SCSI
3. Introduction to parallel SCSI,SCSI Command Model – Storage Area Networks - Fiber Channel
Connectivity, Login types, Topologies.

UNIT-II

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

10
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

STORAGE NETWORKING TECHNOLOGIES

Network-Attached Storage- General purpose servers vs NAS Devices - Benefits of NAS,NAS File I/O - NAS
Components, Implementation, File Sharing protocols, I/O operations – IPSAN-ISCSI,Components of ISCSI-
Content-Addressed Storage.

UNIT-III

STORAGE VIRTUALIZATION
Fixed Content and Archives, Types, Features, Benefits, CAS Architecture, object storage and Retrieval,
exam-ples - Storage Virtualization-forms of virtualization, SNIA Taxonomy – Storage virtualization
configurations, challenges, Types of storage virtualization - Business Continuity- Overview of emerging
technologies such as Cloud storage, Virtual provisioning, Unified Storage, FCOE, FAST.

UNIT-IV

BUSINESS CONTINUITY AND RECOVERY

Information Availability, BC Terminology, Life cycle, Failure analysis - Backup and Recovery- Backup
purpose, considerations, Backup Granularity, Recovery considerations- Backup methods, process, backup
and restore operations , Overview of emerging technologies - duplication, o ffsite backup.

UNIT-V

STORAGE SECURITY AND MANAGEMENT

Storage security framework, Securing the Storage infrastructure Risk triad - Managing the storage infras-
tructure, Monitoring the storage infrastructure,Identify key parameters and components to monitor in a stor-
age infrastructure List key management activities and examples Define storage management standards and
initiative-Industry trend.

TEXT/REFERENCE BOOKS

Text Books:

1. EMC Corporation, “Information Storage and Management”, 1ST edition, 2009. Wiley India.

Reference Books:

3. IBM, “Introduction to Storage Area Networks and System Networking” 5TH edition, November 2012.
4. Robert Spalding, “Storage Networks: The Complete Reference”, Tata McGraw Hil, Osborne, 6TH
reprint 2003.
5. Marc Farley, “Building Storage Networks”, Tata McGraw Hill, Osborne, 1ST edition, 2001.
6. Tom Clark, “Designing Storage Area Networks -A Practical Reference for Implementing Fibre
Channel and IP SANs” 2ND edition, Tata McGraw Hill 2003.

Course Title: Data Warehouse(Stream Elective - Group 1) SEMESTER –VI

Course Code: IT506 Credits: 04
Prerequisite: IT501

UNIT-I

Introduction to data mining and data warehousing, Data warehouse: Definition, Multidimensional data
model, OLAP operations, Warehouse schema, Data warehouse architecture, Warehouse server, Metadata,
OLAP engine, Data warehouse backend process, Data mining: Definitions, KDD, DBMS and data mining,
Other related areas, DM techniques, Other mining problem, Issues and challenges in DM, Applications.

UNIT-II

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

11
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Association rules: Introduction, Methods to discover association rules, A priori algorithm, Partition algo-
rithm, Pincer-search algorithm, Dynamic item set counting algorithm, FP-tree growth algorithm, Eclat and
dEclat, Rapid association rule mining, Incremental algorithm, Border algorithm, Generalized association
rule, Association rules with item constraints.

UNIT-III

Clustering techniques: Introduction, Clustering paradigms, Partitioning algorithms, K-Medoid algorithms,

CLARA, CLARANS, Hierarchical clustering, DBSCAN, BIRCH, CURE, Categorical clustering algorithms,
STIRR, ROCK, CACTUS.

UNIT-IV

Decision trees and other techniques: Introduction to decision tree, Tree construction principle, Best split,
Splitting indices, Splitting criteria, Decision tree construction algorithms, CART, ID3, C4.5, CHAID, Decision
tree construction with presorting, Rainforest, Approximate methods, CLOUDS, BOAT, Pruning techniques,
Integration of pruning and construction.

UNIT-V

Web mining: Introduction to web mining, Web content mining, Web structure mining, Web usage mining,
Text mining, Unstructured text, Episode rule discovery for texts, Hierarchy of categories, Text clustering.

UNIT-VI

Temporal and spatial data mining, Introduction to temporal data mining, Temporal association rules,
Sequence mining, The GSP algorithm, SPADE, SPIRIT, WUM, Episode discovery, Event prediction
problem, Time-series analysis, Spatial mining, Spatial mining tasks, Spatial clustering, Spatial trends.

TEXT/REFERENCE BOOKS

Text Books:
• Arun K Pujari, “Data Mining Techniques”, 2ND edition, University Press India Publication, 2010.
• Margaret H. Dunham, “Data mining: Introductory and Advanced Topics”, Pearson Education
Publication, 2006.
Reference Books:

• Jiawei Ham, Micheline Kamber, Jian Pei, “Data Mining: Concepts and Techniques”, 3RD edition
Morgan Kaufmann Publishing, 2012.
• Bing Liu, “Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data”, 2ND edition, Springer
Science and Business Media, 2011.
• M. A. Russell, “21 Recipes of Mining Twitter”, O’Reilly Publication, 2011.
• M. A. Russell, “Mining The Social Web”, 2ND edition, O’Reilly Publication, 2013.

Course Title: Database Management System Lab SEMESTER –V

Course Code: IT501L Credit: 01

List of Practical:

• Creation of databases and use of SQL commands (DDL, DML and DCL).
• Suitable exercises to practice SQL commands may be given for Insert, Update, Delete etc.
• Write SQL procedure for an application which uses exception handling.
• Write SQL procedure for an application with cursors.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

12
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

3. Write SQL for implementing Nested Queries.

4. Write SQL for implementing Join Queries.
5. Write a DBMS program to prepare reports for an application using functions.
6. Write SQL block containing triggers.
7. Write SQL block containing stored procedures.
8. Develop a menu driven, GUI-based database application in any one of the domains
such as Banking, Billing, Library management, Payroll, Insurance, Inventory, Healthcare
etc. integrating all the features specified in the above exercises.

Course Title: Computer Algorithms Lab SEMESTER –V

Course Code: IT502L Credit: 01

List of Practical:

Description:
Design, develop, and implement the specified algorithms for the following problems under
LINUX/ Windows environment.
6. A. Create a class called Student with the following details as variables within it
1. USN
2.Name
3. Branch
4. Phone
Write a program to create n Student objects and print the USN, Name, Branch, and
Phone of these objects with suitable headings.
1. Write a program to implement the Stack using arrays. Write Push(), Pop(), and
Display() methods to demonstrate its working.
• A. Design a superclass called Staff with details as Sta ffId, Name, Phone, Salary. Extend
this class by writing three subclasses namely Teaching (domain, publications),
Technical (skills), and Contract (period). Write a program to read and display at least
3 staff objects of all three categories.

1. Write a class called Customer to store their name and date of birth. The date of birth for-
mat should be dd/mm/yyyy. Write methods to read customer data as < name, dd/mm/yyyy
> and display as < name, dd, mm, yyyy > using StringTokenizer class considering the de-
limiter character as “/”.
• A. Write a program to read two integers a andb. Compute a/b and print, when b is not
zero. Raise an exception when b is equal to zero.
1. Write a program that implements a multi-thread application that has three threads. First
thread generates a random integer for every 1 second; second thread computes the
square of the number and prints; third thread will print the value of cube of the number.

6. Sort a given set of n integer elements using Quick Sort method and compute its time
com-plexity. Run the program for varied values of n¿ 5000 and record the time taken to
sort. Plot a graph of the time taken versus non graph sheet. The elements can be read
from a file or can be generated using the random number generator. Demonstrate how
the divide and conquer method works along with its time complexity analysis: worst
case, average case and best case.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

13
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

• Implement the 0/1 Knapsack problem using (a) Dynamic Programming method (b)
Greedy method.
• From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra’s algorithm. Write the program.
• Find Minimum Cost Spanning Tree of a given connected undirected graph using
Kruskal’s algorithm. Use Union-Find algorithms in your program.
• Find Minimum Cost Spanning Tree of a given connected undirected graph using Prim’s
algorithm.
• Write programs to (a) Implement All-Pairs Shortest Paths problem using Floyd’s algorithm
(b) Implement Travelling Sales Person problem using Dynamic programming.
• Design and implement a program to find a subset of a given set S = Sl, S2,.....,Sn of n
positive integers whose SUM is equal to a given positive integer d. For example, if S =
1, 2, 5, 6, 8 and d = 9, there are two solutions 1,2,6and 1,8. Display a suitable message,
if the given problem instance doesn’t have a solution.

• Design and implement a program to find all Hamiltonian Cycles in a connected

undirected Graph G of n vertices using backtracking principle.

Course Title: Software Testing Lab SEMESTER –VII

Course Code: IT503L Credits: 00

List of Practical:

• Design, develop, code and run the program in any suitable language to solve the
commission problem. Analyze it from the perspective of dataflow testing, derive at least
10 different test cases, execute these test cases and discuss the test results.

• Design, develop, code and run the program in any suitable language to solve the NextDate
problem. Analyze it from the perspective of decision table-based testing, derive at least 10
different test cases, execute these test cases and discuss the test results.

• Design, develop, code and run the program in any suitable object-oriented language to
solve the calendar problem. Analyze it from the perspective of OO testing, derive test
cases to test the method that increment the date and the method that increments the
month., execute these test cases and discuss the test results.

• Design, develop, code and run the program in any suitable object-oriented language to
solve the currency converter problem. Analyze it from the perspective of use case-
based system testing, derive appropriate system test cases, execute these test cases
and discuss the test results.

• Design, develop, code and run the program in any suitable language to implement an absolute
letter grading procedure, making suitable assumptions. Determine the basis paths and using
them derive different test cases, execute these test cases and discuss the test results.

• Design, develop, code and run the program in any suitable language to implement the
binary search algorithm. Determine the basis paths and using them derive di fferent test
cases, execute these test cases and discuss the test results.

Course Title: Seminar SEMESTER –V

Course Code: IT507 Credits: 02

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

14
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Seminar topic is included to enable the students to apply their knowledge to understand
advanced technologies, designs etc. Literature survey may help to select such topics
which are invaluable to an engineer in an Information Technology industry. It will
encourage students to develop their presentation skills, good communication skills and
skills of collecting the correct information regarding the technical topic.
The students will be able to deliver seminar with useful information. He/she should
under-stand the technologies, designs and skills of writing technical report, to do literature
survey and to attempt the queries from examiner.

Report and Assessment:

The concerned guide will assess the term work as a continuous activity done by students to
complete seminar. The students will have to deliver seminar for 20-25 minutes, during exam-
ination and explain the topic in presence of all students and department faculties. Questions
and answers session will be of five minutes to each student. Examiner, concerned guide and
senior faculty of the department will assess the performance during examination. Report writ-
ing should be as per given format. Every group of students working for their project work
Course Title: Technical Projects for Community Services SEMESTER –V
Course Code: IT508 Credits: 02

will have to complete a community project assigned to them by their guide. The guide will
assess the work completed by each student within the group and group as a whole, award
the appropriate grade to every student.
The topic could be a product design, specific equipment, live problem, simulation, presen-
tation, etc. related to community services. The project work involves experimental/theoreti-
cal/computational work. It is expected to do necessary literature survey.
The group should submit a completion and implementation certificate from the organiza-
tion/social group for which the community project is implemented.This project is to develop
the programming skills of the students after learning C and C++ programming in first and
second year.

Course Title: Operating Systems SEMESTER –IV

Course Code: IT403 Credits: 03
Prerequisite: Nil

Course Objectives:
CO1: To introduce Operating System concepts and types.
CO2: To understand process management, CPU Scheduling algorithms, and deadlock handling.
CO3: To familiarize with Memory Management and File systems.

Course Outcomes:
Students will be able to:
CO1: Explain Operating System Structure and types, Operations and Services.
CO2: Describe the Process Concept and scheduling , Synchronization and deadlock management.
CO3: Analyze the Secondary Storage and I/O Systems.
CO4: Design and implement CPU Scheduling , Page Replacement, Memory Allocation and
Disk Scheduling Algorithms

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

15
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

UNIT-I

Operating System Structures

Definition, Types of operating system, Real time operating system, System components,
Sys-tem services, Systems calls, System programs, System structure, Virtual machines,
System design and implementation.
UNIT-II

Processes and CPU scheduling

Process concept, Process scheduling, Operation on a process, Co-operating processes, Threads,
Interprocess communication, Scheduling criteria, Scheduling algorithms, Multiple-processor
scheduling, Real-time scheduling, Scheduling algorithms and performance evaluation.

UNIT-III

Process Synchronization
The critical-section problem, Critical regions, Synchronization hardware, Semaphores,
Classi-cal problems of synchronization, Monitors.
UNIT-IV

Deadlocks
Systems model, Deadlock characterization, Methods for handling deadlocks, Deadlock
preven-tion, Deadlock avoidance, Deadlock detection, Recovery from deadlock,
Combined approach to deadlock handling.
UNIT-V

Memory Management and Virtual Memory

Logical versus physical address space, Swapping, Contiguous allocation, Paging,
Segmentation with paging, Demand paging, Page replacement algorithms, Thrashing.
UNIT-VI

File Management
File system and secondary storage devices, Real-time operating systems.
TEXT/REFERENCE BOOKS

Text Books:

3. A. Silberschatz, P. Galvin, “Operating System Concepts”, Wiley Publication, 9TH edition,

2013.
4. A. S. Tanenbaum, H. Bos, “Modern Operating Systems”, Pearson Education, 4TH Edition,
2015.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

16
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Reference Books:

6. D.M. Dhamdhere, “Systems Programming and Operating Systems”, Tata McGraw Hill Pub-
lication, 2ND edition, 2001.
7. G. Nutt, “Operating Systems Concepts”, Addison Wesley Publication, 3RD Edition.
8. H. M. Deitel, “An Introduction to Operating Systems”, Addison Wesley Publication, 1990.

Course Title: Theory of Computation SEMESTER –V

Course Code: IT504 Credits: 04
Prerequisite: Nil

Course Objectives:
CO1: To be able to construct finite state machines and the equivalent regular expressions.

CO2: To understand push down automata, types of grammar and fundamentals of Turing
Ma-chine.
CO3: To familiarize with P & NP problems.

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

CO1: Describe Finite Automata, Deterministic Finite Automata and Non Deterministic Finite
Automata.
CO2: List the Regular languages and expressions.

CO3: Apply the context free grammar (CFG) to describe programming languages and
evaluate the equivalence of push down automata and CFG.
CO4: Analyze the undecidable problem in regular expression and Turing machine.

UNIT-I

Fundamentals: Strings, Alphabet, Language, Operations, Finite state machine, Definitions,

Finite automaton model, Acceptance of strings and languages, Deterministic finite automaton
and Non deterministic finite automaton, Transition diagrams, Language recognizers.

UNIT-II

Finite Automata: Transforming NFA to DFA, NFA with epsilon moves, Minimization of
DFA, Finite state automata with output – Moore and Mealy machine.
UNIT-III

Regular Languages: Regular sets, Closure properties of regular sets, Regular

expressions, Identity rules, Constructing finite automata for a given regular expressions,
Conversion of finite automata to regular expressions, Pumping lemma of regular sets.
UNIT-IV

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

17
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Grammar: Formal grammar, Types of grammar, Chomsky hierarchy, Regular grammar,

Equivalence of regular grammars and finite automata, Left linear and right linear Gram-
mar. Context Free Grammar: Derivation, Parse tree, Ambiguity in grammars and
languages, language specification using CFG, Minimization of context free Grammars.
Chomsky normal form, Greiback normal form, Pumping lemma for context free
Languages. Closure properties of CFL.
UNIT-V

Pushdown Automata: Pushdown automata definition, Model, Equivalence of pushdown

au-tomata and CFG, Deterministic pushdown automata.
UNIT-VI

Context Free Languages : Pumping lemma for CFL, Closure properties of CFL, Turing
Ma-chines: Definition, Model, Design of turing machine, Computable functions, Properties
of recursive and recursively enumerable languages, Programming techniques for turing
machine. Undecidability: Decidability of problems, Universal turing machine,
Undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and
NP problems, NP complete and NP hard problems.
TEXT/REFERENCE BOOKS

Text Book:

• J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages
and Computations”, 3RD edition, Pearson Education, 2008.
Reference Books:

• Michael Sipser, “Introduction to the Theory of Computation”, 3RD edition, Cengage Learn-
ing, 2012.
• John Martin, “Introduction to Languages and the Theory of Computation”, 4TH edition
McGraw-Hill, 2011.

Course Title: Object Oriented System Design SEMESTER –V

Course Code: IT603 Credits: 04
Prerequisite: Nil

Course Objectives:
3. To learn the concept of Object Oriented Software Development Process
4. To get acquainted with UML Diagrams
5. To understand Object Oriented Analysis Processes

Course Outcomes:
After the completion of this course, students will be able to:
5. Understand Object Oriented Software Development Process
6. Gain exposure to Object Oriented Methodologies & UML Diagrams

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

18
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

• To apply Object Oriented Analysis Processes for projects

UNIT-I

Object Basics, Object oriented philosophy, objects, classes, attributes, object behavior and
methods, encapsulation and information hiding, class hierarchy, polymorphism, object rela-
tionships and associations, aggregations and object containment, case study, object identity,
persistence.. Object oriented systems development life cycle: Software development process,
building high quality software, use- case driven approach, reusability.

UNIT-II

Object Oriented Methodologies: Rumbaugh et al.’s object modeling technique, Booch method-
ology, Jacobson et al methodologies, patterns, frameworks, the unified approach. Unified mod-
eling language: Static and dynamic models, UML diagrams, UML class diagrams, use-case
diagrams, UML dynamic modeling, packages, UML extensibility and UML meta model.

UNIT-III

Object Oriented Analysis Process: Business object analysis, use-case driven object oriented
analysis, business process modeling, use-case model, developing effective documentation, case
study. Classification: Classification theory, noun phrase approach, common class patterns
approach, use-case driven approach, classes, responsibilities, and collaborators, naming classes.

UNIT-IV

Identifying Object Relationships, Attributes And Methods: Association, super-subclass

rela-tionships, a-part of relationships, case study, class responsibility, defining attributes
for vianet bank objects, object responsibility, defining methods for vianet bank objects
Design process and design axioms: Corollaries, design patterns.

UNIT-V

Designing Classes: UML object constraint languages, designing classes, class visibility,
refining attributes for the vianet bank objects, designing methods and protocols,
designing methods for the vianet bank objects, packages and managing classes.
Designing access layer, case study. Designing view layer, macro level process.

TEXT/REFERENCE BOOKS

Text Book:

• Ali Bahrami, Object Oriented Systems Development using the Unified Modeling Language,
McGraw Hill, Reprint 2009.
Reference Books:

: Bernd Oestereich, Developing Software with UML, Object-Oriented Analysis and Design
in Practice, Addison-Wesley, 2000.
: James Rumbaugh, Ivar Jacobson, Grady Booch, The Unified Modeling Language
Reference Manual,2ND edition, Addision Wesley,2005

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

19
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Title: Enterprise Resource Planning SEMESTER –V

Course Code: IT604DE Credits: 04
Prerequisite: Nil

Course Objectives:
5. This course will introduce you to enterprise systems and show how organizations use en-
terprise systems to run their operations more e fficiently and e ffectively. You will learn
about the critical success factors and implementation strategies that lead to enterprise
system success, and about the informational, knowledge, and decision-making opportuni-
ties afforded by enterprise systems. The course will examine typical Enterprise Systems
modules: materials management (MM), supply chain management (SCM), customer re-
lationship management (CRM), financials, projects, human resource management (HRM)
etc. Enterprise systems use a single database to integrate business transactions along
and between processes, leading to benefits such as e fficient and error-free workflows
plus accounting, management reporting and improved decision-making.

Course Outcomes:
After the completion of this course, students will be able to:
2. Demonstrate a good understanding of basic issues in Enterprise Systems,
3. Explain the scope of common Enterprise Systems (e.g., MM, SCM, CRM, HRM,
procure-ment),
4. Explain the challenges associated with implementing enterprise systems and their
impacts on organizations
5. Describe the selection, acquisition and implementation of enterprise systems
6. Use one of the popular ERP packages to support business operations and decision-making,
7. Communicate and assess an organization’s readiness for enterprise system
implementation with a professional approach in written form,
8. Demonstrate an ability to work independently and in a group.

UNIT-I

Enterprise: An Overview: Business Functions and Business Processes, importance of

Informa-tion: Characteristics of information; Types of information, Information System:
Components of an information system; Different types of information systems;
Management information system, Enterprise Resource Planning: Business modelling;
Integrated data model Introduc-tion to ERP: Defining ERP, Origin and Need for an ERP
System, Benefits of an ERP System, Reasons for the Growth of ERP Market, Reasons
for the Failure of ERP Implementation: Roadmap for successful ERP implementation.
UNIT-II

ERP and Related Technologies: Business Process Re-engineering, Management Information

systems, Decision Support Systems, Executive Information Systems- Advantages of EIS; Dis-
advantages of EIS, Data Warehousing, Data Mining, On-Line Analytical Processing, Product Life
Cycle Management, Supply Chain Management, ERP Security. ERP Implementation Life Cycle:
ERP Tools and Software, ERP Selection Methods and Criteria, ERP Selection Process,

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

20
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

ERP Vendor Selection, ERP Implementation Lifecycle, Pros and cons of ERP implementation,
Factors for the Success of an ERP Implementation ERP Modules Structure: Finance, Sales and
Distribution, Manufacturing and Production Planning- Material and Capacity Planning; Shop Floor
Control; Quality Management; JIT/Repetitive Manufacturing; Cost Management
9. Engineering Data Management; Engineering Change Control ; Configuration
Management ;Serialisation / Lot Control ;Tooling, Human Resource, Plant Maintenance-
Preventive Main-tenance Control; Equipment Tracking; Component Tracking; Plant
Maintenance Calibration Tracking; Plant Maintenance Warranty Claims Tracking, Quality
Management - Functions of Quality Management; CAQ and CIQ; Materials Management-
Pre-purchasing; Purchasing; Vendor Evaluation; Inventory Management and Invoice
Verification and Material Inspection

UNIT-III

ERP – A Manufacturing Perspective: Role of Enterprise Resource Planning (ERP) in manufac-

turing, Computer Aided Design/Computer Aided Manufacturing (CAD/CAM), Materials Re-
quirement Planning (MRP)-Master Production Schedule (MPS);Bill of Material (BOM);Inventory
Records; Closed Loop MRP; Manufacturing Resource Planning (MRP-II), Manufacturing and
Production Planning Module of an ERP System , Distribution Requirements Planning (DRP),
Just-in-Time(JIT) & KANBAN - Kanban; Benefits of JIT; Potential Pitfalls of JIT; Kan-ban,
Product Data Management (PDM)- Data Management, Process Management; functions of PDM;
Benefits of PDM, Manufacturing Operations- Make-to-Order (MTO) and Make-to-Stock (MTS);
Assemble-to-Order (ATO); Engineer-to-Order (ETO); Configure-to-Order (CTO) ERP: A
Purchasing Perspective: Role of ERP in Purchasing, Purchase Module: Fea-tures of purchase
module; Benefits of purchase module, ERP Purchase System ERP: Sales and Distribution
Perspective: Role of ERP in Sales and Distribution, Sub-Modules of the Sales and Distribution
Module:Master data management, Order management, Warehouse management, Shipping and
transportation, Billing and sales support, Foreign trade, Integration of Sales and Distribution
Module with Other Modules
UNIT-IV

ERP: An Inventory Management Perspective: Role of ERP in Inventory Management: Fea-

tures of ERP inventory management system; Benefits of ERP inventory management system;
Limitations of ERP inventory management system, Importance of Web ERP in Inventory
Management, ERP Inventory Management Module, Sub-Modules of the ERP Inventory Man-
agement Module, Installation of ERP Inventory Management System, Failure of ERP In-
ventory Installation ERP: An CRM Perspective: Role of ERP in CRM, Concept of CRM:
Objectives of CRM; Benefits of CRM; Components of CRM, Types of CRM: Operational
CRM, Analytical CRM, Sales intelligence CRM, Collaborative CRM, Sub-Modules of CRM:
Marketing module; Service module; Sales module ERP: A HR Perspective: Role of ERP in
Human Resource Management: Workflow of ERP human resource management system; Ad-
vantages of ERP human resource management system, Human Resource Management
Module: Functions of human resource management module; Features of human resource
management module; Benefits of human resource management module, Common Sub-
Modules of Human Resource Management Module: Personnel management; Organisational
management; Payroll management; Time management; Personnel development

UNIT-V

ERP: An Finance Perspective: Role of ERP in Finance, Accounting and Finance Processes:
Cash management; Capital budgeting, Features of ERP Financial Module, Benefits of ERP
Financial Module, Sage Accpac ERP – A Financial ERP Tool ERP Vendors, Consultants, and
Employees: Vendors- Role of the Vendor; Consultants: Types of consultants; Role of a

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

21
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Consultant, Employees; Role of employees; Resistance by employees; Dealing with

employee resistance, Role of Top Management, Role of Implementation Partner
UNIT-VI

Different ERP Vendors - ERP Vendors, SAP-AG: Products and technology R/3 overview;
SAP advantage, Baan Company , Oracle Corporation: Products and technology; Oracle
Ap-plication; Vertical solutions, Microsoft Corporation, Ramco Systems, Systems
Software As-sociates Inc. (SSA), QAD Future Directions in ERP: New Trends in ERP,
ERP to ERP II-Implementation of Organisation-Wide ERP, Development of New Markets
and Channels, Latest ERP Implementation Methodologies, ERP and E-business, Market
Snapshot, The SOA Factor
TEXT/REFERENCE BOOKS

Text Book:
1.
Reference Books:
1.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

22
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Title: Discrete Structures and Applications SEMESTER –III

Course Code: IT303 Credits: 03
Prerequisite: Nil

Course Objectives:
CO1: To develop a foundation of set theory concepts, notation and applications
CO2: To inculcate the habit of logical and mathematical thinking and its application to
computer science and IT
CO3: To understand logic, basic counting principles, relations, induction, sequences and
sum-mations.
CO4: To be able to present a coherent and mathematically accurate argument
CO5: To understand the theory of graphs and algebraic structures and their applications

Course Outcomes:
After the completion of this course, students will be able to:
CO1: To perform operations on various discrete structures such as sets functions, relations,
and sequences.
CO2: To solve problems using counting techniques, permutation and combination, recursion
and generating functions
CO3: To construct and verify correctness of a boolean expression using K-Maps and truth tables
CO4: To use graphs as tools to visualize and simplify Problems.
CO5: To solve problems using algebraic structures (Rings, Monoids and Groups)

UNIT-I

The Foundations
Sets theory and its applications sets, Set operations, Laws of set theory, Power sets, Parti-
tions, Multisets, Cardinality, Principle of inclusion and exclusion, Algebra of sets and duality,
Applications of sets: Problems on set operations and principle of inclusion-exclusion, Logics
and proofs, Propositional logic, Propositional equivalences, Propositional algebra, Basic log-
ical operations, De Morgan’s laws, Predicates and quantifiers, Nested quantifiers, Rules of
inference, Proof methods and strategy, Applications of logic: Translating English statements
into propositions, Boolean searches in web pages, Bit operations.
UNIT-II

Induction, Sequences and Summations

Induction and recursion: Mathematical induction, Strong induction, Recursive definitions, Re-
cursive algorithms, Applications: Proofs using mathematical induction, Program correctness,
Well formed formulae, Functions, Sequences and summations, Definition and types of func-
tions: Injective, surjective and bijective , Composition, Identity and inverse of function, Re-
cursively defined functions, Sequences and summations, Applications of functions,
Sequences and summations: Job scheduling problem, Countability of rational numbers.
UNIT-III

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

23
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Basic Counting Principles

Permutations, Combinations, Binomial coefficients, Generalized permutations and
combina-tions, Combinations and permutations with repetition, Generating permutations
and com-binations, Recurrence relation, Solving linear recurrence relations with constant
coefficients, Applications of counting principles, Pigeonhole principle and its applications.
UNIT-IV

Relations
Properties of binary relations, Closure of relations, Warshall’s algorithm, Equivalence
relations and partitions, Partial ordering relations and lattice application of relations: n-ary
relations and their applications, Databases and relations.
UNIT-V

Graph Theory
Basic terminology, Multi graphs and weighted graphs, Paths and circuits, Shortest path in
weighted graph, Hamiltonian and Euler paths and circuits, Factors of a graph, Shortest
path algorithm, Travelling salesman problem, Transport networks, Special types of graphs
and applications: Job assignment, LANs, Interconnection networks for parallel
computation, Mesh networks, Graph coloring and applications.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

24
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

UNIT-VI

Algebraic Structures
Algebraic systems, Groups, Semi groups, Monoid, Subgroups, Permutation groups,
Codes and group codes, Isomorphism and automorphisms, Homomorphism, Fermat’s
little theorem, Polynomial rings, Applications of groups.
TEXT/REFERENCE BOOKS

Text Books:

12. K. H. Rosen, “Discrete Mathematics and Its Applications”, Tata McGraw Hill Publication,
7TH edition, 2012.
13. J. P. Tremblay, R. Manohar, “Discrete Mathematical Structures with Applications to Com-
puter Science”, 1ST edition, McGraw Hill Publication, 2001.
Reference Books:
9. B. Kolman, R. Busby, S. Ross, “Discrete Mathematical Structures”, Pearson Education,
6TH edition, 2009.
10. R. K. Bisht, H. S. Dhami, “Discrete Mathematics”, Oxford University Press, 2015.

Course Title: Embedded Systems (Elective- VI) SEMESTER –VI

Course Code: IT604 Credits: 03
Prerequisite: IT301, IT403

Course Objectives:
CO1: To understand the fundamental concepts in Embedded Systems,
CO2: To learn Real Time Operating Systems
CO3: To get acquainted with hardware & interfaces
CO4: To know Embedded System Design Techniques

Course Outcomes:
Students will be able to:
CO1: Demonstrate & explain embedded systems hardware & software components
CO2: Define embedded systems using real time operating system - VxWorks
CO3: Design & develop embedded applications using C language
CO4: Apply design techniques in real-life application

UNIT-I

Introduction: Introduction to embedded systems-hardware and software components,

Types, Examples, Characteristics, Challenges in embedded computing system design,
Embedded sys-tem design processes, Introduction to IC technology.
UNIT-II

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

25
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Analysis and Design of Embedded System: Software engineering practices in the embedded
systems, Software develop process, Interprocess communication and synchronization of
process, Task and threads, Programme language, Program concept and embedded
programming in C, Software components-Interpreter, Compiler, Assembler, Cross assembler.

UNIT-III

OS for Embedded Systems: Introduction to real time theory, Operating system services,
Real time operating system concepts, Basic design using a RTOS, Introduction to RTOS
program-ming tools Micro C/OSII and VxWorks.

UNIT-IV

Hardware for Embedded Systems: Hardware components, SOC, Processors, CPU,

Types of memory, Memory management, I/O devices and interfacing, Parallel I/O
interface, Blind counting synchronization and busy waiting, Parallel port interfacing with
switches, Keypads and display unit, Memory and high speed interfacing, Interfacing of
data acquisition systems, Interfacing of controllers, Serial communication interface,
Implementation of above using C language.
UNIT-V

Performance Issues of an Embedded System: CPU performance, CPU power consumption,

Analysis and optimization of CPU power consumption program execution time, Analysis and
optimization of energy and power, Analysis of program size, Hardware accelerators.

UNIT-VI

Design Examples and Case Studies: Personal Digital Assistants, Set Top Boxes, Ink Jet
Print-ers, Digital thermometer, Case Studies of digital camera, Smart card, Case study of
coding for sending application layer byte stream on TCP/IP network using RTOS VxWorks.

TEXT/REFERENCE BOOKS

Text Books:

2 Raj Kamal, “Embedded Systems Architecture, and Programming”, 3RD edition, TMH Pub-
lication, 2015.
3 Iyer, Gupta, “Embedded Real Time Systems Programming”, TMH Publication, 2003.
Reference Books:

11. Wayne Wolf, “Computer as Components – Principles of Embedded Computing System

De-sign”, 2ND edition, Gulf Professional Publishing, 2008.
12. David E Simon, “An Embedded Software Primer”, Addison Wesley Publication, 2004.
13. Raj Kamal, “Embedded Systems – Architecture, Programming and Design”, 2ND edition,
Tata McGraw Hill Publication, 2003.

Course Title: Service Oriented Architecture SEMESTER –VI

Course Code: IT652SE4 Credits: 03
Prerequisite: IT503

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

26
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Course Objectives:
13. Learn XML fundamentals.
14. Be exposed to build applications based on XML.
15. Understand the key principles behind SOA.
16. Be familiar with the web services technology elements for realizing SOA.
17. Learn the various web service standards.

Course Outcomes:
At the end of course student will able:
1. Build applications based on XML.
2. Develop web services using technology elements.
3. Build SOA-based applications for intra-enterprise and inter-enterprise applications.

UNIT-I

INTRODUCTION TO XML:
XML document structure – Well formed and valid documents – Namespaces – DTD –
XML Schema –X-Files. XML document structure – Well formed and valid documents –
Namespaces – DTD – XML Schema –X-Files.
UNIT-II

BUILDING XML- BASED APPLICATIONS: Parsing XML – using DOM, SAX – XML
Trans-formation and XSL – XSL Formatting – Modeling Databases in XML.
UNIT-III

SERVICE ORIENTED ARCHITECTURE: Characteristics of SOA, Comparing SOA with

Client-Server and Distributed architectures – Benefits of SOA — Principles of Service
orien-tation – Service layers.
UNIT-IV

WEB SERVICES Service descriptions – WSDL – Messaging with SOAP – Service discovery
– UDDI – Message Exchange Patterns – Orchestration – Choreography –WS Transactions.

UNIT-V

BUILDING SOA-BASED APPLICATIONS Service Oriented Analysis and Design –

Service Modeling – Design standards and guidelines — Composition – WS-BPEL – WS-
Coordination – WS-Policy – WS-Security – SOA support in J2EE
TEXT/REFERENCE BOOKS

Text Books:
1. Ron Schmelzer et al. “XML and Web Services”, Pearson Education, 2002.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

27
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

1. Thomas Erl, “Service Oriented Architecture: Concepts, Technology, and Design”, Pearson
Education, 2005
Reference Book:
1. Frank P.Coyle, “XML, Web Services and the Data Revolution”, Pearson Education, 2002
2. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Pearson Educa-
tion, 2005
3. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services: An Archi-
tect’s Guide”, Prentice Hall, 2004.
4. James McGovern, Sameer Tyagi, Michael E.Stevens, Sunil Mathew, “Java Web
Services Architecture”, Morgan Kaufmann Publishers, 2003.

Course Title: Network Programming (Elective- V) SEMESTER –VI

Course Code: IT652SE4 Credits: 03
Prerequisite: IT503

Course Objectives:
1. Theprimary objective of the course is to learn basic and advanced techniques of
socket based client server programming.
2. Socket API based programming using C/C++/Java language.

Course Outcomes:
At the end of course student will able:
1. Analyse the requirements of a networked programming environment and identify the
issues to be solved;
2. Create conceptual solutions to those issues and implement a programming solution;
3. Understand the key protocols that support the Internet;
4. Apply several common programming interfaces to network communication;
5. Understand the use of TCP/UDP Sockets
6. Apply advanced programming techniques such as Broadcasting, Multicasting

UNIT-I

Introduction to Java Programming: Basic network and Web concepts: The Internet
standards, Client/Server model, URL, HTML, SGML, XML, HTTP, Server side
programming, Streams: Input stream, Output stream and filter stream, Threads: Returning
information from thread, Synchronization, Deadlock, Scheduling, Thread pool.
UNIT-II

Looking up Internet Addresses: The Inet4 address and Inet6 address, Network interface class,
URL and URLs: The URL class, URL decoder.
UNIT-III

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

28
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

Socket Programming: Socket for client, Socket for server, Secure socket.
UNIT-IV

UDP Datagrams and Socket.

UNIT-V

Multicast Sockets.
UNIT-VI

URL Connections, Protocol handlers, Content handlers RMI and java Mail API.
TEXT/REFERENCE BOOKS

Text Books:
1. Elliotte Harold, “Java Network Programming”, O’relly Publications, 2013.
2. Comer, “Internetworking with TCP-IP Vol. 3 ”, 2ND edition, Prentice Hall Publication,
2013.
Reference Book:

1. Richard Stevens, “Unix Network Programming volume- I and II ”, Addison Wesley Publi-
cation, 2004.

Course Objectives:
CO1: To familiarise database transaction management, recovery and concurrency control issues.
CO2: To acquire knowledge on parallel and distributed databases and its applications.
CO3: To understand the concepts of: principles of temporal, geographic, Multimedia,
Mobility and personal databases.
CO4: To familiarise students on types of Distributed databases,and Network databases

Course Outcomes:
Students will be able to:
CO1: Distinguish between parallel and distributed database.
CO2: Design database for better interoperability.
CO3: Identify alternative design database architecture.
CO4: Analyse fate of database transactions.
CO5: Describe concurrency Control and recovery techniques.

Course Title: Object Oriented System Design Lab SEMESTER –V

Course Code: IT603L Credit: 01

List of Practical:

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

29
 Syllabus for B.Tech in Information Technology
(FOR THE STUDENTS WHO WERE ADMITTED IN ACADEMIC YEAR 2016-2017)

1. Introduction to object oriented analysis, object oriented design.

2. Object Oriented Modeling: Choose a hypothetical system of significant complexity and
write an SRS for the same.
3. Draw one or more Use Case diagrams for capturing and representing requirements of
the system. Use case diagrams must include template showing description and steps of
the Use Case for various scenarios.
4. Draw basic class diagrams to identify and describe key concepts like classes, types in
your system and their relationships.
5. Draw sequence diagrams OR communication diagrams with advanced notation for your
system to show objects and their message exchanges.
6. Draw activity diagrams to display either business flows or like flow charts.
7. Draw component diagrams assuming that you will build your system reusing existing
com-ponents along with a few new ones.
8. Draw deployment diagrams to model the runtime architecture of your system.

DR.BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,LONERE

 30

Bachelor of Technology (Information Technology) - Fourth Year - Semester VII

Teaching
Sr. Course Assessment Structure Hours per
Title of the Course Structure Marks Credits
No. Code L T P Mid Test CA ESE TW PR week

1 IT701 Ethical and Social Issues in Computing 3 2 0 20 20 60 - - 100 4 5

Department Elective - Group 3

2 IT702DE - Artificial Intelligence 3 0 0 20 20 60 - - 100 3 3
- Soft Computing

3 IT702DEL Department Elective - Group 3 Lab 0 0 2 - - - 25 25 50 1 2

Open / Department Elective - Group 4

4 IT703DE - Natural Language Processing 3 2 0 20 20 60 - - 100 4 5
- Cloud Computing

Stream Elective - Group 3

- Real-Time Systems
- Information Security
5 IT704SE 3 0 0 20 20 60 - - 100 3 3
- Management Information Systems
- Distributed Computing
- Data Warehousing & Data Mining

6 IT704SEL Stream Elective - Group 3 Lab 0 0 2 - - - 25 25 50 1 2

7 IT705 Project Phase I 1 2 2 - 50 - 25 25 100 3 5

8 IT706 Industrial Training Assessment* 0 2 0 - - - 50 - 50 1 2

Advanced Programming - Lab (PHP,

9 IT707 1 4 2 - - - 50 50 100 4 7
XHTML, XML, Web Server)

Summary of Semester Assessment Marks, Credit &

14 12 8 80 130 240 175 125 750 24 34
Hours

Bachelor of Technology (Information Technology) - Fourth Year - Semester VIII

Teaching
Sr. Course Assessment Structure Hours per
Title of the Course Structure Marks Credits
No. Code L T P Mid Test CA ESE TW PR week
Department Elective - Group 5
1 IT801DE - Internet of things 3 0 0 20 20 60 - - 100 3 3
- E-Commerce & Web technologies
5 IT801DEL Department Elective - Group 5 Lab 0 0 2 - - - 25 25 50 1 2
Stream Elective - Group 4
- Mobile Computing
- Cryptography
2 IT802SE 3 0 0 20 20 60 - - 100 3 3
- Information Retrieval
- Network Security
- Big Data Analytics
6 IT802SEL Stream Elective - Group 4 Lab 0 0 2 - - - 25 25 50 1 2
Stream Elective - Group 5
- User Experience Design
- Infrastructure Auditing &
3 IT803SE Implementation 3 2 0 20 20 60 - - 100 4 5
- Cyber Law & IPR
- Internetworking Protocols
- Web & Text Mining
Stream Elective - Group 6
- Multimedia Application
- Ethical Hacking and Digital Forensics
4 IT804SE 3 0 0 20 20 60 - - 100 3 3
- CRM & SCM
- Wireless Networks
- Machine Learning

7 IT804SEL Stream Elective - Group 6 Lab 0 0 2 - - - 25 25 50 1 2

8 IT805 Project Phase II 2 4 8 - 50 - 50 100 200 8 14

Summary of Semester Assessment Marks, Credit &
14 6 14 80 130 240 125 175 750 24 34
Hours
List of Department Electives – Group 3

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT702DE-01 Artificial Intelligence

2 IT702DE-02 Soft Computing

List of Department Electives – Group 4

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT703DE-01 Natural Language Processing

2 IT703DE-02 Cloud Computing

List of Stream Electives – Group 3

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT704SE-01 Real Time Systems

2 IT704SE-02 Information Security
3 IT704SE-03 Management Information Systems
4 IT704SE-04 Distributed Computing
5 IT704SE-05 Data Warehousing & Data Mining
List of Department Electives – Group 5

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT801DE-01 Internet of Things

2 IT801DE-02 Ecommerce

List of Stream Electives – Group 4

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT802SE-01 Mobile Computing

2 IT802SE-02 Cryptography
3 IT802SE-03 Information Retrieval
4 IT802SE-04 Network Security
5 IT802SE-05 Big Data Analytics

List of Stream Electives – Group 5

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT803SE-01 User Experience Design

2 IT803SE-02 Infrastructure Auditing & Implementation
3 IT803SE-03 Cyber Law and IPR
4 IT803SE-04 Internetworking Protocols
5 IT803SE-05 Web & Text Mining

List of Stream Electives – Group 6

Course
Sr. No. Title of the Course Prerequisite
Code

1 IT804SE-01 Multimedia Application

2 IT804SE-02 Ethical Hacking
3 IT804SE-03 CRM & SCM
4 IT804SE-04 Wireless Networking
5 IT804SE-05 Machine Learning
Course Title: Ethical and Social Issues in Computing Semester VII
Course Code IT701 Course Type Compulsory
Pre-requisite L–T–P 3–0–0
Stream Core Credits 3

Course Objectives:
4. To familiarize with the existence of computer abuse, laws pertaining to such abuse and legal gray
areas.
5. To introduce the Association of Computing Machinery (ACM) and Institute of Electrical and
Electronic Engineers (IEEE) codes of ethics.
6. To provide with the context to appreciate the value of technology
7. To understand that technology is not neutral, that it creates ethical and moral muddles that must be
dealt with.
8. To create and nurture an ideal atmosphere for academic dialogue, debate, and question-answer
sessions intended to deepen your understanding of technology and its effects on society.
9. To affect behavior by challenging to examine ethical and moral situations, think through them and
identify relevant support systems.

Course Outcomes:
After learning the course the students should be able:
2. To be familiar with the legal requirements, ethical issues, and professional issues in the computing
profession.
3. To be familiar with types of ethical issues arising in the computing profession.
4. To be familiar with the social impact of decisions and actions in the computing profession

Course Content:

UNIT I
Introduction to Social and Ethical Computing, History of Computing, The beginning of irresponsible
computing, Moral and Ethical theories,

UNIT II
Professionalism and professional codes of conduct Ethics, Technology and Value, Anonymity, Security,
Privacy and Civil Liberties.

UNIT III
Intellectual Property Rights (Copyrights, Patents, Trademarks, trade secrets, and Rights of Publicity)

UNIT IV
Social Computing, Software Issues: Risks and Liabilities (virus, worms, piracy, hacking). Workplace Issues
(whistle blowing, home office, privacy, electronic monitoring, outsourcing, downsizing)

UNIT V
Reliability and Risk, Prevention, Detection, and Digital Forensics, Artificial Intelligence, Virtual reality and
Expert Systems

UNIT VI
Cyberspace Issues – The Internet, CDA, Free speech, electronic commerce, pornography, gambling,
language and cultural imperialism and the politics of regulation

Text Books:
5. Joseph M. Kizza, “Ethical and Social Issues in the Information Age”, Third Edition. Springer
2007.
6. Paul A. Alcorn, “Practical Ethics for a Technological World”, Prentice-Hall, 2001.
7. Chuck Huff and Thomas Finholt, “Social Issues in Computing: Putting Computing in its Place”,
McGraw-Hill, 1994.

Reference Books:
3. Joseph M. Kizza, “Civilizing the Internet: Concerns and Efforts towards Regulations”,
McFarland Publishers, 2006.
4. Joseph M. Kizza, “Social and Ethical effects of the Computer Revolution”, Second Edition,
McFarland Publishers 1997.
5. Kevin Bowyer, “Ethics and Computing: Living Responsibly in a Computerized World”, IEEE
Computer Society Press, 1996.
6. Jacques Berluer and Diane Whitehouse, “An Ethical Global Information Society: Culture and
Democracy Revisited”, Chapman & Hill, 1998.
7. Jacques Berleur and Klaus Brunnstein, “Ethics in Computing: Codes spaces for Discussion and
the Law”, Chapman & Hill, 1997.
8. Robert C. Solomon, “Morality and the Good Life: An Introduction to Ethics through Classical
Cases”, Second Edition, McGraw-Hill, 1992.
Course Title: Artificial Intelligence Semester VII
Course Code IT702DE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Departmental Credits 3

Course Objectives:
7. To acquaint the students with the theoretical and computational techniques in Artificial Intelligence.
8. To use various symbolic knowledge representation to specify domains and reasoning tasks of a
situated software agent.
9. To use different logical systems for inference over formal domain representations, and trace how a
particular inference algorithm works on a given problem specification.
10. To understand the conceptual and computational trade-offs between the expressiveness of different
formal representations.

Course Outcomes:
After learning the course the students should be able:
3. To find appropriate idealizations for converting real world problems into AI search problems
formulated using the appropriate search algorithm.
4. To analyze, formalize and write algorithmic methods for search problem
5. To explain important search concepts, the definitions of admissible and consistent heuristics and
completeness and optimality.
6. To implement and execute by hand alpha-beta search.
7. To design good evaluation functions and strategies for game playing.
8. To carry out proofs in first order and propositional logic using techniques such as resolution,
unification, backward and forward chaining.
9. To choose and implement learning algorithms such as decision trees, support vector machines, and
boosting.

Course Content:

UNIT I
Introduction: Overview of Artificial intelligence- Problems of AI, AI technique, Tic - Tac - Toe problem.
Intelligent Agents: Agents & environment, nature of environment, structure of agents, goal based agents,
utility based agents, learning agents.

UNIT II
Problem Solving: Problems, Problem Space & search: Defining the problem as state space search,
production system, problem characteristics and issues in the design of search programs.
Search techniques: Solving problems by searching: problem solving agents, searching for solutions; uniform
search strategies: breadth first search, depth first search, depth limited search, bidirectional search,
comparing uniform search strategies.

UNIT III
Heuristic search strategies: Greedy best-first search, A* search, memory bounded heuristic search: local
search algorithms & optimization problems: Hill climbing search, simulated annealing search, local beam
search, genetic algorithms; constraint satisfaction problems, local search for constraint satisfaction problems.
Adversarial search: Games, optimal decisions & strategies in games, the minimax search procedure, alpha-
beta pruning, additional refinements, iterative deepening.

UNIT IV
Knowledge & reasoning: Knowledge representation issues, representation & mapping, approaches to
knowledge representation, issues in knowledge representation.
Using predicate logic: Representing simple fact in logic, representing instant & ISA relationship, computable
functions & predicates, resolution, natural deduction.
Representing knowledge using rules: Procedural verses declarative knowledge, logic programming, forward
verses backward reasoning, matching, control knowledge.

UNIT V
Probabilistic reasoning: Representing knowledge in an uncertain domain, the semantics of Bayesian
networks, Dempster-Shafer theory, Fuzzy sets & fuzzy logics.
Planning: Overview, components of a planning system, Goal stack planning, Hierarchical planning and other
planning techniques.
 UNIT VI
Natural Language processing: Introduction, Syntactic processing, semantic analysis, discourse & pragmatic
processing.
Learning: Forms of learning, inductive learning, learning decision trees, explanation based learning, learning
using relevance information, neural net learning & genetic learning.
Expert Systems: Representing and using domain knowledge, expert system shells, and knowledge
acquisition.

Text Books:
2. Rich, E. and Knight, K., “Artificial Intelligence”, Tata McGraw- Hill.
3. Russell, S. and Norvig, P., “Artificial Intelligence: A Modern Approach”, Pearson Education.
4. Patterson, Dan W. , “Introduction to Artificial Intelligence & Expert Systems”, Patterson, PHI,
2005

Reference Books:
9. Nilsson, N. J., “Artificial Intelligence: A New Synthesis”, Morgan Kaufmann.
Course Title: Artificial Intelligence Lab Semester VII
Course Code IT702DE-01L Course Type Elective
Pre-requisite L–T–P 0–0–2
Stream Departmental Credits 1

Lab Experiments Objective:

1. To implement various AI search procedures.
2. To implement various knowledge representation techniques.
3. To develop an Expert system for medical diagnosis.

Lab Experiments List:

1. Implement Breadth First Search (for 8 puzzle problem or Water Jug problem or any AI search
problem)
2. Implement Depth First Search (for 8 puzzle problem or Water Jug problem or any AI search problem)
3. Implement Best First Search (for 8 puzzle problem or Water Jug problem or any AI search problem)
4. Implement Single Player Game (Using Heuristic Function)
5. Implement Two Player Game (Using Heuristic Function)
6. Implement A* Algorithm
7. Implement Propositional calculus related problem
8. Implement First order propositional calculus related problem
9. Implement Certainty Factor problem
10. Implement Syntax Checking of English sentences-English Grammar
11. Develop an Expert system for Medical diagnosis.
12. Develop any Rule based system for an application of your choice.
Course Title: Soft Computing Semester VII
Course Code IT702DE-02 Course Type Elective
Pre-requisite L–T–P 3–0-4
Stream Departmental Credits 5

Course Objectives:
1. To introduce a relatively new computing paradigm for creating intelligent machines useful for solving
complex real world problems.
2. To gain insight into the tools that make up the soft computing technique: fuzzy logic, artificial neural
networks and hybrid systems
3. To create awareness of the application areas of soft computing technique
4. To learn alternative solutions to the conventional problem solving techniques in image/signal
processing, pattern recognition/classification, control system

Course Outcomes:
After learning the course the student will be able:
1. To use a new tool /tools to solve a wide variety of real world problems
2. To find an alternate solution, more adaptable, resilient and optimum
3. To apply knowledge of soft computing domain to real world problems

Course Content:

UNIT I
Artificial Neural Network – I: Biological neuron, artificial neuron model, concept of bias and threshold,
McCulloch Pits Neuron Model, implementation of logical AND, OR, XOR functions. Soft Topologies of neural
networks, learning paradigms: supervised, unsupervised, reinforcement, linear neuron model: Concept of
error energy, gradient descent algorithm and application of linear neuron for linear Regression, activation
functions: binary, bipolar (linear, signup, log sigmoid, tan sigmoid) Learning mechanisms: Hebbian, Delta
Rule of Perceptron and its limitations

UNIT II
Artificial Neural Network – II: Multilayer perceptron (MLP) and back propagation algorithm of Application of
MLP for classification and regression of Self organizing Feature Maps, clustering of Learning vector
quantization.
Radial Basis Function networks: Cover’s theorem, mapping functions (Gaussian, Multi-quadrics, Inverse
multiquadrics, Application of RBFN for classification and regression of Hopfield network, associative
memories.

UNIT III
Fuzzy Logic – I: Concept of Fuzzy number, fuzzy set theory (continuous, discrete) of Operations on fuzzy
sets. Fuzzy membership functions (core, boundary, support), primary and composite linguistic terms.
Concept of fuzzy relation, composition operation (T-norm, T-conorm) of Fuzzy if-then rules.

UNIT IV
Fuzzy Logic – II: Fuzzification , Membership Value Assignment techniques, De-fuzzification
(Maxmembership principle, Centroid method, Weighted average method), Concept of fuzzy inference,
Implication rules- Dienes-Rescher Implication, Mamdani Implication, Zadeh Implication, Fuzzy Inference
systems – Mamdani fuzzy model , Sugeno fuzzy model , Tsukamoto fuzzy model, Implementation of a
simple two-input single output FIS employing Mamdani model Computing.

UNIT V
Fuzzy Control Systems: CONTROL SYSTEM DESIGN PROBLEM 1.5, Control (Decision) Surface,
Assumptions in a Fuzzy Control System Design V, Fuzzy Logic Controllers Soft o Comparison with traditional
PID control, advantages of FLC, Architecture of a FLC: Mamdani Type , Example Aircraft landing control
problem.

UNIT VI
Adaptive Neuro-Fuzzy Inference Systems (ANFIS): ANFIS architecture, Hybrid Learning Algorithm,
Advantages and Limitations of ANFIS Application of ANFIS/CANFIS for regression

Text Books:
1. Fundamentals of Neural Networks: Architectures, Algorithms And Applications, Laurene Fausett,
Pearson Education, Inc, 2008.
 2. Fuzzy Logic With Engineering Applications, Third Edition Thomas, Timothy Ross, John Wiley &
Sons,2010
3. Neuro- Fuzzy and Soft Computing, J.S. Jang, C.T. Sun, E. Mizutani, PHI Learning Private Limited.
4. Principles of Soft Computing , S. N. Sivanandam, S. N. Deepa, John Wiley & Sons, 2007

Reference Books:
1. Introduction to the theory of neural computation, John Hertz, Anders Krogh, Richard Palmer, Addison
–Wesley Publishing Company, 1991
2. Neural Networks A comprehensive foundation,, Simon Haykin, Prentice Hall International Inc-1999
3. Neural and Adaptive Systems: Fundamentals through Simulations, José C. Principe Neil R. Euliano ,
W. Curt Lefebvre, John-Wiley & Sons, 2000
4. Pattern Classification, Peter E. Hart, David G. Stork Richard O. Duda, Second Edition,2000
5. Pattern Recognition, Sergios Theodoridis , Konstantinos Koutroumbas, Fourth Edition, Academic
Press, 2008
6. A First Course in Fuzzy Logic, Third Edition, Hung T. Nguyen, Elbert A. Walker, Taylor & Francis
Group, LLC, 2008
7. Introduction to Fuzzy Logic using MATLAB, S. N. Sivanandam , S. Sumathi, S. N. Deepa, Springer
Verlag, 2007
Course Title: Soft Computing - Lab Semester VII
Course Code IT702DE-02L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Departmental Credits 2

Lab Experiments Objective:

1. To utilize Soft computing algorithms to solve engineering problems
2. To compare results and provide a analysis of algorithms efficiency
3. To apply soft computing thought process for solving issues

Lab Experiments List:

1. Implement simple logic network using MP neuron model
2. Implement a simple linear regressor with a single neuron model
3. Implement and test MLP trained with back-propagation algorithm
4. Implement and test RBF network
5. Implement SOFM for character recognition
6. Implement fuzzy membership functions (triangular, trapezoidal, gbell, PI, Gamma, Gaussian)
7. Implement defuzzyfication (Max-membership principle, Centroid method, Weighted average method)
8. Implement FIS with Mamdani Inferencing mechanism
9. A small project: may include classification or regression problem, using any soft computing technique
studied earlier
Course Title: Natural Language Processing Semester VII
Course Code IT703DE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Departmental Credits 3

Course Objectives:
1. To learn the leading trends and systems in natural language processing
2. To understand the concepts of morphology, syntax, semantics and pragmatics of the language
3. To recognize the significance of pragmatics for natural language understanding
4. To describe simple system based on logic and demonstrate the difference between the semantic
presentation and interpretation of that presentation
5. To describe application based on natural language processing and to show the points of syntactic,
semantic and pragmatic processing

Course Outcomes:
After learning the course the student will be able:
1. To understand the models, methods, and algorithms of statistical Natural Language Processing
2. To implement probabilistic models in code, estimate parameters for such models, and run
meaningful experiments to validate such models.
3. To apply core computer science concepts and algorithms, such as dynamic programming.
4. To understand linguistic phenomena and explore the linguistic features relevant to each NLP task.
5. To identify opportunities and conduct research in NLP
6. To analyze experimental results and write reports

Course Content:

UNIT I
Introduction to NLP: Definition, issues and strategies, application domain, tools for NLP, Linguistic
organization of NLP, NLP vs PLP.

UNIT II
Word Classes: Review of Regular Expressions, CFG and different parsing techniques. Morphology:
Inflectional, derivational, parsing and parsing with FST, Combinational Rules.

UNIT III
Phonology: Speech sounds, phonetic transcription, phoneme and phonological rules, optimality theory,
machine learning of phonological rules, phonological aspects of prosody and speech synthesis.
Pronunciation, Spelling and N-grams: Spelling errors, detection and elimination using probabilistic models,
pronunciation variation (lexical, allophonic, dialect), decision tree model, counting words in Corpora, simple
N-grams, smoothing (Add One, Written-Bell, Good-Turing), N-grams for spelling and pronunciation.

UNIT IV
Syntax: POS Tagging: Tagsets, concept of HMM tagger, rule based and stochastic POST, algorithm for
HMM tagging, transformation based tagging. Sentence level construction & unification: Noun phrase, co-
ordination, sub-categorization, concept of feature structure and unification.

UNIT V
Semantics: Representing Meaning: Unambiguous representation, canonical form, expressiveness, meaning
structure of language, basics of FOPC. Semantic Analysis: Syntax driven, attachment & integration,
robustness. Lexical Semantics: Lexemes (homonymy, polysemy, synonymy, hyponymy), WordNet, internal
structure of words, metaphor and metonymy and their computational approaches. Word Sense
Disambiguation: Selectional restriction based, machine learning based and dictionary based approaches

UNIT VI
Pragmatics: Discourse: Reference resolution and phenomena, syntactic and semantic constraints on
Coreference, pronoun resolution algorithm, text coherence, discourse structure. Dialogues: Turns and
utterances, grounding, dialogue acts and structures. Natural Language Generation: Introduction to language
generation, architecture, discourse planning (text schemata, rhetorical relations).

Text Books:
1. D. Jurafsky & J. H. Martin – “Speech and Language Processing – An introduction to Language
processing, Computational Linguistics, and Speech Recognition”, Pearson Education
2. Allen, James. 1995. – “Natural Language Understanding”. Benjamin/Cummings, 2ed.
Reference Books:
1. Bharathi, A., Vineet Chaitanya and Rajeev Sangal. 1995. Natural Language Processing- “A
Pananian Perspective”. Prentice Hall India, Eastern Economy Edition.
2. Eugene Cherniak: “Statistical Language Learning”, MIT Press, 1993.
3. Manning, Christopher and Heinrich Schütze. 1999. “Foundations of Statistical Natural Language
Processing”. MIT Press.
Course Title: Cloud Computing Semester VII
Course Code IT703DE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Departmental Credits 3

Course Objectives:
1. To learn the concept of cloud computing
2. To understand the trade-off between deploying applications in the cloud over local infrastructure
3. To learn advantages and disadvantages of various cloud computing platforms
4. To learn performance, scalability and availability issues of cloud platforms
5. To understand the cloud security issues

Course Outcomes:
After learning the course the student will be able:
1. To understand the key dimensions of the challenge of Cloud Computing
2. To assess the economics, financial, and technological implications for selecting cloud computing for
organization
3. To assess the financial, technological, and organizational capacity of employer’s for actively initiating
and installing cloud-based applications.
4. To assess needs for capacity building and training in cloud computing-related IT areas

Course Content:

UNIT I
Introduction: Distributed Computing and Enabling Technologies, Cloud Fundamentals: Cloud Definition,
Evolution, Architecture, Applications, deployment models, and service models.

UNIT II
Virtualization: Issues with virtualization, virtualization technologies and architectures, Internals of virtual
machine monitors/hypervisors, virtualization of data centers, and Issues with Multi-tenancy.

UNIT III
Implementation: Study of Cloud computing Systems like Amazon EC2 and S3, Google App Engine, and
Microsoft Azure, Build Private/Hybrid Cloud using open source tools, Deployment of Web Services from
Inside and Outside a Cloud Architecture. MapReduce and its extensions to Cloud Computing, HDFS, and
GFS.

UNIT IV
Interoperability and Service Monitoring: Issues with interoperability, Vendor lock-in, Interoperability
approaches. SLA Management, Metering Issues, and Report generation.

UNIT V
Resource Management and Load Balancing: Distributed Management of Virtual Infrastructures, Server
consolidation, Dynamic provisioning and resource management, Resource Optimization, Resource dynamic
reconfiguration, Scheduling Techniques for Advance Reservation, Capacity Management to meet SLA
Requirements, and Load Balancing, various load balancing techniques.

UNIT VI
Migration and Fault Tolerance: Broad Aspects of Migration into Cloud, Migration of virtual Machines and
techniques. Fault Tolerance Mechanisms.
Security: Vulnerability Issues and Security Threats, Application level Security, Data level Security, and Virtual
Machine level Security, Infrastructure Security, and Multi-tenancy Issues. IDS: host-based and network-
based, Security-as-a-Service. Trust Management, Identity Management, and Access Controls Techniques
Advances: Grid of Clouds, Green Cloud, Mobile Cloud Computing

Text Books:
1. Rajkumar Buyya, James Broberg, Andrzej Goscinski, “Cloud Computing Principles and Paradigms” ,
Wiley Publishers, 2011
2. Barrie Sosinsky, “Cloud Computing Bible”, Wiley Publishers 2010
3. Tim Mather, Subra Kumaraswamy, Shahed Latif, “Cloud Security and Privacy: An Enterprise
Perspective on Risks and Compliance”, O’Reilly 2010
Reference Books:
1. Rajkumar Buyya, Christian Vacchiola, S Thamarai Selvi, “Mastering Cloud computing”, McGraw Hill
2013
2. Michael Miller, “Cloud Computing : Web-based Applications that change the way you work and
collaborate online”, Pearson Education 2008
3. Toby Velte, Antohy T Velte, Robert Elsenpeter, “Cloud Computing : A Practical Approach”, McGraw
Hill
4. David S. Linthicum, “Cloud Computing and SOA Convergence in Your Enterprise: A Step-by-Step
Guide”, 2010
Course Title: Real Time Systems Semester VII
Course Code IT704SE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Software Application and
Stream Credits 3
Development

Course Objectives:
4. To introduce students to the fundamental problems, concepts, and approaches in the design and
analysis of real-time systems.
5. To study issues related to the design and analysis of systems with real-time constraints.
6. To learn real-time scheduling and schedulability analysis
7. To understand formal specification and verification of timing constraints and properties
8. To design methods for real-time systems
9. To learn new techniques of state-of-the-art real-time systems research

Course Outcomes:
After learning the course the student will be able:
1. To characterize real-time systems and describe their functions.
2. To analyze, design and implement a real-time system.
3. To apply formal methods to the analysis and design of real-time systems.
4. To apply formal methods for scheduling real-time systems.
5. To characterize and debug a real-time system.

Course Content:

UNIT I
Introduction-defining Real time systems, Embedded Real Time Systems, Special Characteristics of real time
systems, a brief evolutionary history.

UNIT II
Hardware Architectures of Real Time systems.

UNIT III
Software architectures (concepts of interrupt driven activation, need for real time monitor, pseudo
parallelism), meeting of dead lines & real time constraints.

UNIT IV
Overview of WARD & MELLOR Methodology: Ward & Mellor Life Cycle, the essential model step, the
implementation model, real time extensions of DFD

UNIT V
Real time languages: overview of ADA/Java Extension. Real time Operating Systems .

UNIT VI
System development methodologies.

Text Books:
1. “Embedded System Design” Frank Vahid & Tony Givargis; John Wiley & sons, Inc.
2. “Real – Time Systems and software” Alan C. Shaw ; John Wiley & Sons Inc
3. “Fundamentals of embedded Software”, Daniel W. Lewis, Pearson
4. “Real time Systems”, J. W. S. Liu, Pearson
5. “Embedded Real-time System Programming”, S. V. Iyer and P. Gupta, TMH

Reference Books:
1. “An Embedded System Primer” David E. Simon; Addison-Wesley Pub
2. “Embedded System Design” Steve Heath; Butterworth-Heinemann Pub.
3. ”Embedded System Computer Architecture” Graham Wilson, Butterworth-Heinemann,
Course Title: Real Time Systems Lab Semester VII
Course Code IT704SE-01L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Software Application and Development Credits 2
Course Title: Information Security Semester VII
Course Code IT704SE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Infrastructure and Security Management Credits 3

Course Objectives:
1. To understand information security’s importance in the increasingly computer-driven world.
2. To master the key concepts of information security and its working
3. To develop a security mindset
4. To learn to critically analyze situations of computer and network security usage
5. To identify the salient issues, viewpoints, and trade-offs of information security.

Course Outcomes:
After learning the course the student will be able:
1. To explain the challenges and scope of information security;
2. To explain security concepts as confidentiality, integrity, and availability
3. To explain the importance of cryptographic algorithms used in information security
4. To identify and explain symmetric algorithms for encryption-based security of information;
5. To describe the access control mechanism used for user authentication and authorization;
6. To describe Secure Sockets Layer (SSL), Internet Protocol (IP) communications by using Internet
Protocol Security (IPSec);
7. To explain the use of security tools as firewalls and intrusion prevention systems;
8. To explain malicious software issues introduced by software-based viruses and worms;
9. To describe the process of risk assessment in the context of IT security management.

Course Content:

UNIT I
Introduction to Information Systems: Security concepts, Computer Security Concepts, Threats, Attacks, and
Assets, Security Functional Requirements, A Security Architecture for Open Systems, Computer Security
Trends, Computer Security Strategy

UNIT II
Cryptographic Tools: Confidentiality with Symmetric Encryption, Message Authentication and Hash
Functions, Public-Key Encryption, Digital Signatures and Key Management, Practical Application: Encryption
of Stored Data

UNIT III
Models, Frameworks, Standards & Legal Framework: A structure and framework of compressive security
policy, policy infrastructure, policy design life cycle and design processes, PDCA model, Security policy
standards and practices - ISO 27001, SSE-CMM, IA-CMM, ITIL & BS 15000, BS7799,
Understanding Laws for Information Security: Legislative Solutions, Contractual Solutions, Evidential Issues,
International Activity, Indian IT Act, Laws of IPR, Indian Copyright Act

UNIT IV
Controls: Access Control Principles, Subjects, Objects, and Access Rights, Discretionary Access Control,
Role-Based Access Control, Case Study

UNIT V
Virus and Malware: Introduction & types of Malicious Software (Malware), Propagation–Infected Content–
Viruses, Propagation–Vulnerability Exploit–Worms, Propagation–Social Engineering–SPAM E-mail, Trojans,
Payload–System Corruption, Payload–Attack Agent–Zombie, Bots, Payload–Information Theft–Keyloggers,
Phishing, Spyware, Payload–Stealthing–Backdoors, Rootkits, Countermeasures

UNIT VI
Security issues: Database security challenge in the modern world, Federated Databases, securing Mobile
databases, Network Security, trusted & un trusted networks, network attacks, network security dimensions,
network attack – the stages; using firewalls effectively; Privacy – Privacy invasion due to direct marketing,
outsourcing, using data masking ; privacy issues in smart card applications, Ethical Hacking ;Role of
Cryptography in information security, digital signatures

Text Books:
1. Information Systems Security: Security Management, Metrics, Frameworks And Best Practices: Nina
Gobole
 2. The complete reference Information Security by Mark Rhodes –ousley
3. Information security Theory and practices By Dhiren R Patel
4. M. Stamp, “Information Security: Principles and Practice,” Wiley

Reference Books:
1. G. McGraw, “Software Security: Building Security In,” Addison Wesley
2. Electronic Signature law by L Padmavathi
3. Network Security by Ankit Fadia
4. Security Plus study guide by Michael Cross, Norrris Johnson
Course Title: Information Security - Lab Semester VII
Course Code IT704SE-02L Course Type Elective
Pre-requisite L–T–P 0–0–4
Infrastructure and Security
Stream Credits 2
Management
Course Title: Management Information Systems Semester VII
Course Code IT704SE-03 Course Type Elective
Pre-requisite L–T–P 3–0–0
Information Management & Quality
Stream Credits 3
Control

Course Objectives:
1. To create interest and awareness about the proliferation of the Information Systems in today’s
organizations.
2. To understand categories of MIS: Operations Support System, Management Support System and
Office automation system, Functional management system.
3. To learn Information Systems for strategic management and strategic role of information systems.
4. To plan for information systems: Identification of Applications, Business Application Planning,
Systems and Critical Success Factors, Method of Identifying Applications,
5. To understand System Development Process and Approaches, System Implementation, System
maintenance, Introduction to MIS Risks, System Evaluation, IT Procurement Options. Change
management in IT Projects.

Course Outcomes:
After learning the course the student will be able:
1. To understand the usage and constituents of MIS in organizations
2. To understand the classifications, understanding and the different functionalities of these MIS.
3. To explain the functions and issues at each stage of system development.
4. To identify emerging trends in MIS technologies
5. To identify and assess MIS in real-life organization

Course Content:

UNIT I
MANAGEMENT & ORGANIZATIONAL SUPPORT SYSTEMS FOR DIGITAL FIRM: Definition of MIS;
Systems approach to MIS: Report writing s/w, MIS and Human factor considerations, concept of
organizational information sub-system, MIS & problem solving.

UNIT II
INFORMATION SYSTEMS & BUSINESS STRATEGY: Information Management. Who are the users?
Manager & Systems, Evolution of Computer based information system (CBIS), Model of CBIS. Information
services organization : Trend to End-User computing, justifying the CBIS, Achieving the CBIS, Managing the
CBIS, Benefits & Challenges of CBIS implementation. Strategic Information System, Business level & Firm
level Strategy

UNIT III
INFORMATION SYSTEMS IN THE ENTERPRISE: Systems from Management & Functional perspective &
their relationship: Executive Information System, Decision Support System Sales & Marketing Information
System, Manufacturing Information System, Human-Resource Information System. Finance & Account
Information System

UNIT IV
INFORMATION TECHNOLOGY FOR COMPETITIVE ADVANTAGE: Firm in its environment, What are the
information resources? Who manages the information resources? Strategic planning for information
resources. End-User Computing as a strategic issue, Information resource management concept

UNIT V
E-COMMERCE & INTERNATIONAL INFORMATION SYSTEM: Introduction to E-Commerce, Business
Intelligence. E-Commerce strategy, Electronic Data Interchange, E-commerce methodology, E-commerce
technology, Business application of the Internet. Electronic Business success strategies.

UNIT VI
Managing International Information Systems: IIS architecture, Global business Drivers, challenges, strategy:
divide, conquer, and appease, cooptation, business organization, problems in implementing global
information systems, Computer crime, ethics & social issues.

Text Books:
1. Kelkar, S.A., “Management Information Systems”, Prentice Hall of India, Jan 2003.

Reference Books:
1. MIS, Suresh K. Basandra (Wheelers)
2. Introduction to computer Information System for Business, Mark G. Simkin, S. Chand & Co., 1996.
3. Analysis & Design of Information Systems, James A. Senn. MCGraw-Hill International.
 Management Information Systems -
Course Title: Semester VII
Lab
Course Code IT704SE-03L Course Type Elective
Pre-requisite L–T–P 0–0–4
Information Management & Quality
Stream Credits 2
Control
Course Title: Distributed Computing Semester VII
Course Code IT704SE-04 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Networking Credits 3

Course Objectives:
1. To understand the major tools and techniques that allow programmers to effectively program the
parts of the code that require substantial communication and synchronization;
2. To study the core ideas behind modern coordination and communication paradigms and distributed
data structures
3. To Introduce a variety of methodologies and approaches for reasoning about concurrent and
distributed programs
4. To realize basic principles and best practice engineering techniques of concurrent and distributed
computing;
5. To study the safety and progress properties of concurrent and distributed algorithms;
6. To understand the performance of current multi-core and future many-core systems.

Course Outcomes:
After learning the course the student will be able:
1. To identify the core concepts of distributed systems
2. To learn orchestration of multiple machines to correctly solve problems in an efficient, reliable and
scalable way.
3. To examine concepts of distributed systems in designing large systems
4. To apply distributed computing concepts to develop sample systems.

Course Content:

UNIT I
Introduction: Historical background, key characteristics, design goals and challenges; Review of networking
and internetworking, Internet protocols.

UNIT II
Processes and Inter process Communication: processes and threads, virtualization, code migration; The API
for the Internet protocols, External data representation, Client-server communication, Multicast
communication, message oriented communication, Network virtualization: Overlay networks, RPC and MPI

UNIT III
Naming: Name services and Domain Name System, Directory services, Case study: X.500 directory service

UNIT IV
Time, Global States and Synchronization: Physical and logical clocks, global states, mutual exclusion,
election algorithms
Consistency and Replication: Consistency models, Replica management, Consistency protocols, Case
studies of highly available services: the gossip architecture and Coda

UNIT V
Fault Tolerance and Security: Distributed Commit, Recovery, Security Issues, Cryptography.
Distributed File Systems: File service architecture, Case study: Sun Network File System, The Andrew File
System

UNIT VI
Peer to peer Systems: Introduction, Napster, Peer-to-peer middleware, Routing overlays, Case studies:
Pastry, Tapestry
Distributed Object Based Systems: Distributed objects, Java beans, CORBA

Text Books:
1. Tanenbaum, A.S, “Distributed Systems: Principles and Paradigms”, 2nd Ed., Pearson Education.,
2006
2. Coulouris G., Dollimore J., Kindberg T. and Blair G., “Distributed Systems: Concepts and Design”, 5 th
Edition, Addison Wesley., 2011
3. Mahajan S., Shah S., "Distributed Computing", 1st Ed., Oxford University Press, 2010
Reference Books:
1. Hwang K., Dongarra J., Geoffrey C. Fox, “Distributed and Cloud Computing: From Parallel
Processing to the Internet of Things”, Morgan Kaufmann, 2011
2. Comer, D.E. and Droms, R.E., “Computer Networks and Internets”, 4th Ed., Prentice-Hall, 2004
Course Title: Distributed Computing-Lab Semester VII
Course Code IT704SE-04L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Networking Credits 2
Course Title: Data Warehousing And Data Mining Semester VII
Course Code IT704SE-05 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Data Science Credits 3

Course Objectives:
1. Interpret the contribution of data warehousing and data mining to the decision support level of
organizations;
2. Evaluate different models used for OLAP and data pre-processing;
3. Categorize and carefully differentiate between situations for applying different data mining
techniques: mining frequent pattern, association, correlation, classification, prediction, and cluster
analysis;
4. Design and implement systems for data mining;
5. Evaluate the performance of different data mining algorithms;
6. Propose data mining solutions for different applications.

Course Outcomes:
After learning the course the student will be able:
1. Process raw data to make it suitable for various data mining algorithms.
2. Discover and measure interesting patterns from different kinds of databases.
3. Apply the techniques of clustering, classification, association finding, feature selection and
visualization to real world data.

Course Content:

UNIT I
Introduction: Introduction to Data Mining, Data Mining Functionalities, Classification of Data Mining Systems,
Major Issues in Data Mining.
Getting to know your data: Data Objects and Attribute Types, Basic Statistical Descriptions of Data,
Measuring Data Similarity and Dissimilarity.
Data Preprocessing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation
and Data Discretization.

UNIT II
DataWarehousing and Online Analytical Processing
DataWarehouse: Basic Concepts, DataWarehouse Modeling: Data Cube and OLAP, DataWarehouse Design
and Usage: A Business Analysis Framework for Data Warehouse Design, Data Warehouse Design Process,
Data Warehouse Usage for Information Processing, DataWarehouse Implementation.
Mining Frequent Patterns, Associations and correlations: Basic Concepts, Frequent Item Set Mining
Methods, Interesting patterns, Pattern Evaluation Methods, Pattern Mining in Multilevel and multidimensional
space.

UNIT III
Classification: Basic Concepts, Decision Tree Induction, Bayes Classification Methods, Rule-Based
Classification, Model Evaluation and Selection, Techniques to Improve Classification Accuracy: Introducing
Ensemble Methods, Bagging, Boosting and AdaBoost.
Classification: Advanced Methods
Bayesian Belief Networks, Classification by Back propagation, Support Vector Machines, Lazy Learners (or
Learning from Your Neighbors), Other Classification Methods.

UNIT IV
Cluster Analysis: Basic Concepts and Methods, Overview of Basic Clustering Methods, Partitioning Methods,
Hierarchical Methods: Agglomerative versus Divisive Hierarchical Clustering, Distance Measures in
Algorithmic Methods, BIRCH: Multiphase Hierarchical Clustering Using Clustering Feature Trees.
Density-Based Methods: DBSCAN: Density-Based Clustering Based on Connected Regions with High
Density, OPTICS: Ordering Points to Identify the Clustering Structure, Grid-Based Methods.
Evaluation of Clustering: Assessing Clustering Tendency, Determining the Number of Clusters, Measuring
Clustering Quality.

UNIT V
Outlier Detection: Outliers and Outlier Analysis, Outlier Detection Methods, Statistical Approaches, Proximity-
Based Approaches
Data Mining Trends and Research Frontiers:
Mining Complex Data Types: Mining Sequence Data: Time-Series, Symbolic Sequences and Biological
Sequences, Mining Other Kinds of Data, Data Mining Applications, Data Mining and Society, Data Mining
Trends.

Text Books:
1. Han J & Kamber M, “Data Mining: Concepts and Techniques”, Third Edition, Elsevier, 2011.

Reference Books:
1. Pang-Ning Tan, Michael Steinback, Vipin Kumar, “Introduction to Data Mining”, Pearson Education,
2008.
2. M.Humphires, M.Hawkins, M.Dy,“Data Warehousing: Architecture and Implementation”, Pearson
Education, 2009.
3. Anahory, Murray, “Data Warehousing in the Real World”, Pearson Education, 2008.
4. Kargupta, Joshi, etc., “Data Mining: Next Generation Challenges and Future Directions”, Prentice
Hall of India Pvt Ltd, 2007.
 Data Warehousing and Data Mining-
Course Title: Semester VII
Lab
Course Code IT704SE-05L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Data Science Credits 2
Course Title: Internet of Things Semester VII
Course Code IT801DE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Departmental Credits 3
Course Objectives:
1. To understand the vision of IoT.
2. To understand IoT market perspective.
3. To study the data and knowledge management and use of devices in IoT technology.
4. To understand state of the art – IoT Architecture.
5. To study the real world IoT design constraints, industrial automation and commercial building
automation in IoT.
Course Outcomes:
1. To interpret the vision of IoT from a global context.
2. To determine the market perspective of IoT.
3. To compare and contrast the use of devices, gateways and data management in IoT.
4. To implement state of the art architecture in IoT.
5. To illustrate the application of IoT in industrial automation and identify real world design constraints.
Course Content:
UNIT I
M2M to IoT-The Vision-Introduction, From M2M to IoT, M2M towards IoT-the global context, A use case
example, Differing Characteristics.

UNIT II
M2M to IoT – A Market Perspective– Introduction, Some Definitions, M2M Value Chains, IoT Value Chains,
An emerging industrial structure for IoT, The international driven global value chain and global information
monopolies. M2M to IoT-An Architectural Overview– Building an architecture, Main design principles and
needed capabilities, An IoT architecture outline, standards considerations.

UNIT III
M2M and IoT Technology Fundamentals - Devices and gateways, Local and wide area networking, Data
management, Business processes in IoT, Everything as a Service (XaaS), M2M and IoT Analytics,
Knowledge Management

UNIT IV
IoT Architecture-State of the Art – Introduction, State of the art, Architecture Reference Model - Introduction,
Reference Model and architecture, IoT reference Model

UNIT V
IoT Reference Architecture - Introduction, Functional View, Information View, Deployment and Operational
View, Other Relevant architectural views. Real-World Design Constraints - Introduction, Technical Design
constraints-hardware is popular again, Data representation and visualization, Interaction and remote control.

UNIT VI
Industrial Automation - Service-oriented architecture-based device integration, SOCRADES: realizing the
enterprise integrated Web of Things, IMC-AESOP: from the Web of Things to the Cloud of Things,
Commercial Building Automation - Introduction, Case study: phase one-commercial building automation
today, Case study: phase two- commercial building automation in the future.

Text Books:
1. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos, David
Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence”, 1st Edition, Academic Press, 2014.

Reference Books:
1. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”, 1stEdition, VPT,
2014.
2. Francis da Costa, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013
Course Title: Internet of Things - Lab Semester VII
Course Code IT801DE-01L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Departmental Credits 2
Course Title: Ecommerce Semester VII
Course Code IT801DE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Departmental Credits 3
Course Objectives:
1. To learn the importance of E-commerce and its impact on business
2. To understand the various e-commerce business models and its uses
3. To learn the various E-commerce technologies and IT requirements for a successful e-commerce
business
4. To discover factors required for good e-commerce systems
Course Outcomes:
After learning the course the students should be able:
1. To explain e-commerce systems construct limitations and benefits
2. To design e-commerce applications
3. To discuss security and IT requirements to deploy e-commerce systems
4. To explain the critical success factors of good e-commerce applications
Course Content:
UNIT I
Introduction to e-commerce: Meaning, nature and scope; channels of e-commerce, Business applications of
e-commerce, Traditional commerce vs. E-commerce and Business model of ecommerce: B2B, B2C, C2C,
B2G and other models of ecommerce.

UNIT II
Mobile commerce: Introduction to M-Commerce, History & Key Benefits & limitations, Critical Success
factors, Wireless Application protocol (WAP), Mobile banking.
Electronic payment system: Type of payment systems- e-cash and currency servers, e- cheques, credit card,
smart card, electronic purses and debit cards, operational, credit and legal risks of e-payments, risk
management options for e-payment system, order fulfillment for e-commerce.

UNIT III
E-commerce strategy: Overview, Strategic Methods for developing E – commerce.

UNIT IV
The Four C’s of E-commerce: (Convergence, Collaborative Computing, Content Management & Call Center).
Convergence: Technological Advances in Convergence – Types, Convergence and its implications.
Convergence & Electronic Commerce. Collaborative Computing: Collaborative product development,
contract as per CAD, Simultaneous Collaboration, Security. Content Management: Definition of content,
Authoring Tools & Content Management, Content – partnership, repositories, convergence, providers, Web
Traffic & Traffic Management; Content Marketing. Call Center: Definition, Need, Tasks Handled, Mode of
Operation, Equipment, Strength & Weaknesses of Call Center, Customer Premises Equipment (CPE).

UNIT V
E-commerce Technologies: Technologies : Relationship Between E – Commerce & Networking, Different
Types of Networking For E – Commerce, Internet, Intranet & Extranet, EDI Systems

UNIT VI
Security issues in e-commerce: Security risk of e-commerce, type and sources of threats; protecting the
electronic commerce assets and intellectual property; firewalls; client server network security; data and
message security; digital identification and electronic signature; encryption approach to e-commerce security.
Text Books:
1. E-Commerce concept-model-strategies, C.S.V. Murthy, Himayalaya Publication House
2. E-Commerce concepts and applications, Nidhi Dhawan, International book house Pvt Ltd.
3. Frontiers of Electronic commerce, Kalkota and Whinston, Pearson
Reference Books
1. Electronic commerce, Elias M. Awad., PHI
2. E-commerce, Joseph, PHI second edition
3. Bhaskar Bharat : Electronic Commerce - Technologies & Applications.TMH
4. Chris Bates, Web Programming, 3rd edition, Wiley publication, 2009.
5. B.V. Kumar, S.V. Subrahmanya, Web Services: An Introduction, Tata McGraw Hill publication, 2008.
Course Title: Ecommerce Lab Semester VII
Course Code IT801DE-02L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Departmental Credits 2

Lab Experiments Objective:

1. To design a ecommerce website
2. To develop the various modules for a B2C ecommerce business
3. To program and implement various web pages and workflows to deploy a B2C ecommerce business
4. To develop the various web forms and page panels for a ecommerce

List of Lab Experiments:

Students can choose any online retail business on the B2C model of e-commerce business.
1. Creating the Website Layout for E-Commerce
2. Inserting & Displaying the Products & Categories
3. Creating the Shopping Cart
4. Creating the User Registration & Login Systems
5. Creating the Checkout System
6. Creating the Payment Integration System
7. Creating the Admin Panel for E-Commerce
8. Uploading the E-Commerce to Online Server
Course Title: Mobile Computing Semester VII
Course Code IT802SE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Software and Application Development Credits 3
Course Objective
1. To describe the basic concepts and principles in mobile computing
2. To understand the concept of Wireless LANs, PAN, Mobile Networks, and Sensor Networks
3. To explain the structure and components for Mobile IP and Mobilty Management
4. To understand positioning techniques and location-based services and applications
5. To describe the important issues and concerns on security and privacy
6. To design and implement mobile applications to realize location-aware computing
7. To design algorithms for location estimations based on different positioning techniques and platforms
8. To acquire the knowledge to administrate and to maintain a Wireless LAN
Course Outcome:
After learning the course the students should be able:
1. To describe wireless and mobile communications systems
2. To choose an appropriate mobile system from a set of requirements.
3. To work around the weaknesses of mobile computing
4. To interface a mobile computing system to hardware and networks.
5. To program applications on a mobile computing system and interact with servers and database
systems.
Course Content:
UNIT I
Fundamental of Wireless and basics of wireless network: Digital communication, wireless communication
system and limitations, wireless media, frequency spectrum, technologies in digital wireless communication,
wireless communication channel specification, wireless network, wireless switching technology, wireless
communication

UNIT II
Mobile Communications and Computing: An Overview Mobile Communication, Mobile Computing, Mobile
Computing Architecture, Mobile Devices, Mobile System Networks, Data Dissemination, Mobility
Management, Security, Mobile Devices and Systems, Mobile Phones, Digital Music Players, Hand-held
Pocket Computers, Hand-held Devices: Operating Systems, Smart Systems, Limitations of Mobile Devices,
Automotive Systems.

UNIT III
GSM and other architectures: GSM-Services & System Architectures ,Radio Interfaces, Protocols
Localization, Calling, Handover, Security, New Data Services, modulation, multiplexing, controlling the
medium access, spread spectrum, coding methods, CDMA, IMT 2000, WCDMA and CDMA 2000, 4G
Networks.

UNIT IV
Mobile Network and Transport Layer: IP & Mobile IP Network Layers, Packet Delivery & Handover
Management, Location Management, Registration, Tunneling & Encapsulation, Route Optimization, Dynamic
Host Configuration Protocol, Mobile Transport Layer, Conventional TCP/IP Transport Layer Protocol, Indirect
TCP, Snooping TCP, Mobile TCP, Mobile Ad-hoc Networks (MANET), Routing and Routing Algorithms in
MANET, security in ad-hoc networks.

UNIT V
Data Dissemination and Data Synchronization in Mobile Computing: Communication Asymetry, classification
of data delivery mechanism, data dissemination broadcast models, selective tuning and indexing techniques,
synchronization, synchronization software for mobile devices, synchronization protocols.

UNIT VI
Mobile Devices and Mobile Operating System: Mobile agent, applications framework, application server,
gateways, service discovery, device management, mobile file system, Mobile Operating Systems,
Characteristics, Basic functionality of Operating Systems: Window 8, iOS, Android OS.

Text Book:
6. Raj Kamal, Mobile Computing, 2/e , Oxford University Press-New Delhi
7. Dr. Sunil kumar S. Manavi, Mahabaleshwar S. Kakkasageri, Wireless and Mobile Networks,
concepts and protocols, Wiley, India.

Reference Book:
1. “Guide to Designing and Implementing wireless LANs”, Mark Ciampa, Thomson learning, Vikas
Publishing House, 2001.
2. “Wireless Web Development”, Ray Rischpater, Springer Publishing,
3. “The Wireless Application Protocol”, Sandeep Singhal, Pearson .
4. “Third Generation Mobile Telecommunication systems”, by P.Stavronlakis, Springer Publishers,
Course Title: Mobile Computing - Lab Semester VII
Course Code IT802SE-01L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Software and Application Development Credits 2

Lab Experiments Objective:

1. Know the components and structure of mobile application development frameworks for Android and
windows OS based mobiles.
2. Understand how to work with various mobile application development frameworks.
3. Learn the basic and important design concepts and issues of development of mobile applications.
4. Understand the capabilities and limitations of mobile devices.

List of Lab Experiments:

1. Develop an application that uses GUI components, Font and Colours
2. Develop an application that uses Layout Managers and event listeners.
3. Develop a native calculator application.
4. Write an application that draws basic graphical primitives on the screen.
5. Develop an application that makes use of database.
6. Develop an application that makes use of RSS Feed.
7. Implement an application that implements Multi threading
8. Develop a native application that uses GPS location information.
9. Implement an application that writes data to the SD card.
10. Implement an application that creates an alert upon receiving a message.
11. Write a mobile application that creates alarm clock
Course Title: Cryptography Semester VII
Course Code IT802SE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Infrastructure & Security Management Credits 3

Course Objective

1. To learn cryptography in information security implementation

2. To know the methods of conventional encryption.
3. To understand the concepts of public key encryption and number theory.
4. To understand authentication and Hash functions.
5. To know the network security tools and applications.
6. To understand the system level security used.

Course Outcome:
After learning the course the students should be able:
1. To compare and contrast a range of different cryptosystems.
2. To list and elaborate the differences between secret key and public key cryptosystems.
3. To identify the different approaches to quantifying secrecy.
4. To recognize the different modes of operation for block ciphers and their applications.
5. To explain the role of hash functions in Information Security.
6. To discuss the place of ethics in the Information Security Area.

Course Content:

UNIT I
Introduction: What is cryptology: (cryptography + cryptanalysis), Overview of cryptology: How cryptography
works?, how to break a cryptographic system ? Classical conventional encryption, modern conventional
encryption, public key encryption, hashing algorithm. OSI Security Architecture, Cryptanalysis of Classical
Cryptosystems, Shannon’s Theory
UNIT II
Symmetric Cipher: Classical Encryption Techniques, Symmetric Cipher Model, Block Cipher Principles, DES,
Triple DES, Cryptanalysis of Symmetric Key Ciphers: Differential and Linear Cryptanalysis, Block Cipher
Design Principle, The Euclidean Algorithm, Finite field of Form GP(p), Advance Encryption Standard (AES),
AES Cipher, Multiple Encryption and Triple DES, Stream Cipher and RC4, Placement of Encryption
Function, Traffic Confidentiality, Key Distribution, Random number generation
System Security: Intrusion detection, Password Management, Virus countermeasure, Denial of Service
Attack, Firewall design principles, Trusted System
UNIT III
Public Key Cryptography: Key Management - The Discrete Logarithm Problem (DLP) and the Diffie Hellman
Key Exchange algorithm, Cryptanalysis of DLP, Elliptic Curve Architecture and Cryptography - Confidentiality
using Symmetric Encryption - Public Key Cryptography, RSA, Primality Testing, Factoring Algorithms, Other
attacks on RSA and Semantic Security of RSA ElGamal Cryptosystems,
UNIT IV
Authentication and Hash Function: Authentication requirements - Authentication functions - Message
Authentication Codes - Hash Functions - Security of Hash Functions, Hash functions: The Merkle Damgard
Construction and MACs - MD5 message Digest algorithm - Secure Hash Algorithm - RIPEMD – HMAC,
CMAC, Whirlpool and Comparative analysis. Digital Signatures - Authentication Protocols - Digital Signature
Standard.
UNIT V
Network Security: Authentication Applications: Kerberos - X.509 Authentication Service - Electronic Mail
Security - PGP - S/MIME - IP Security - Web Security
UNIT VI
System Level Security: Intrusion detection - password management - Viruses and related Threats - Virus
Counter measures - Firewall Design Principles - Trusted Systems.
Cryptanalysis: Differential Cryptanalysis, Linear Cryptanalysis, Truncated differential cryptanalysis, etc
Assignments (not limited to this): including Cryptographic standards, application of cryptosystems, network
security (IPSEC, VPN, Web Security), privilege management infrastructure (PMI) and Access Control, e-
Commerce and Smart IC cards)

Text Books
 1. William Stallings, "Cryptography and Network Security - Principles and Practices", Prentice Hall of
India, Third Edition, 2003.

Reference Books
1. Atul Kahate, "Cryptography and Network Security", Tata McGraw-Hill, 2003. Detailed Syllabus B.
Tech. Program, NIT Patna Session 2015-16 Page 161
2. Bruce Schneier, "Applied Cryptography", John Wiley & Sons Inc, 2001.
3. Charles B. Pfleeger, Shari Lawrence Pfleeger, "Security in Computing", Third Edition, Pearson
Education, 2003.
Course Title: Cryptography - Lab Semester VII
Course Code IT802SE-02L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Infrastructure & Security Management Credits 2
Course Title: Information Retrieval Semester VII
Course Code IT802SE-03 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Information Management & Quality Control Credits 3

Course Description
1. To learn the techniques used to retrieve useful information from repositories such as the Web.
2. To understand the concepts in information retrieval such as documents, queries, collections, and
relevance.
3. To learn approaches for efficient indexing, for quick identification of candidate answer documents
4. To learn modern techniques for crawling data from the web.

Course Learning Outcomes

After learning the course the students should be able:
1. To apply information retrieval principles to locate relevant information in large collections of data
2. To understand and deploy efficient techniques for the indexing of document objects that are to be
retrieved
3. To implement features of retrieval systems for web-based and other search tasks
4. To analyze the performance of retrieval systems using test collections
5. To make practical recommendations about deploying information retrieval systems in different
search domains, including considerations for document management and querying

Course Content

UNIT I
Introduction to the Course: Information retrieval problem, first take at building an inverted index, processing
of Boolean queries, extended Boolean model vs. ranked retrieval.
Term vocabulary and postings lists: document delineation and character sequence decoding, determining
vocabulary of terms, Faster postings list intersection via skip pointers, positional postings and phrase
queries.

UNIT II
Dictionaries, Tolerant Retrieval and Indexing: search structures for dictionaries, wildcard queries, spelling
correction, Phonetic correction; Index construction, Blocked sort-based indexing, single-pass in-memory
indexing, distributed indexing, dynamic indexing and other types; Index compression: Heaps' and Zipf's law,
dictionary compression and postings file compression.

UNIT III
Scoring and IR System Evaluation: parametric and zone indexes, term frequency and weighing, vector space
model for scoring, variant tf-idf functions, efficient scoring and ranking, components of an IR system, vector
space scoring and query operator interaction; IR system evaluation, Standard test collections, evaluation of
unranked and ranked retrieval results, Assessing relevance, System quality and user utility; Relevance
feedback and pseudo relevance feedback, Global methods for query reformulation.

UNIT IV
XML and Probabilistic Information Retrieval: Basic concepts of XML retrieval and challenges, vector space
model for XML retrieval, Text-centric vs. data centric XML retrieval; probability ranking principal, binary
independence model, appraisal and some extensions; Language models for information retrieval, query
likelihood model, language modeling vs. other approaches in IR.

UNIT V
Document Classification: Text classification problem, Naïve Bayes text classification, Bernoulli model,
Feature selection, evaluation of text classification; Vector space classification: Document representations
and measure of relatedness in vector spaces, Rocchio classification, k nearest neighbour, Linear vs. Non-
linear classifiers, bias-variance tradeoff; Support vector machines, extensions to SVM models, Issues in the
classification of text documents, Machine learning methods in ad hoc information retrieval.

UNIT VI
Document Clustering and Matrix Decomposition: Flat clustering, cardinality, evaluation of clustering, K-
means, Model based clustering; Hierarchical Agglomerative clustering, singlelink and complete-link
clustering, Group-average agglomerative clustering, Centroid clustering, Optimality of HAC, Divisive
clustering, Cluster labeling; Matrix decompositions, Term document matrices and singular value
decomposition, Low-rank approximations, Latent semantic indexing.
Web Search: basics concepts, web graph, spam, search user experience, Index size and estimation, Near-
duplicates and shingling; Web crawling and indexes: overview, crawler architecture, DNS resolution, URL
frontier, Distributing indexes and connectivity servers; Link analysis: Anchor text and web graph, Page Rank,
Hubs and Authorities.

Text Book
1. Manning, C. D., Raghavan, P., & Schütze, H. "Introduction to information retrieval". Cambridge:
Cambridge university press. 2008
2. Witten, I. H., Moffat, A., & Bell, T. C. "Managing gigabytes: compressing and indexing documents
and images." Morgan Kaufmann. 1999
3. Grossman, D. A. "Information retrieval: Algorithms and heuristics" Springer. 2004

Reference Books
1. Baeza-Yates, R., & Ribeiro-Neto, B. "Modern information retrieval" New York: ACM press. 1999
2. Belew, R. K. "Finding out about: a cognitive perspective on search engine technology and the
WWW". Cambridge University Press. 2000
3. Chakrabarti, S. "Mining the Web: Discovering knowledge from hypertext data." Morgan Kaufmann.
2003
4. Manning, C. D. "Foundations of statistical natural language processing." H. Schütze (Ed.). MIT press.
1999
Course Title: Information Retrieval - Lab Semester VII
Course Code IT802SE-03L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Information Management & Quality Control Credits 2
Course Title: Network Security Semester VII
Course Code IT802SE-04 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Networks Credits 3

Course Description
1. To understand the number theory used for network security
2. To understand the design concept of cryptography and authentication
3. To understand the design concepts of internet security
4. To develop experiments on algorithm used for security

Course Learning Outcomes

After learning the course the students should be able:
1. To describe network security awareness and a clear understanding of its importance
2. To explain how threats to an organization are discovered, analyzed, and dealt with
3. To explain protocols for security services
4. To describe network security threats and countermeasures
5. To explain network security designs using available secure solutions (such as PGP, SSL, IPSec, etc)
6. To demonstrate advanced security issues and technologies (such as DDoS attack detection and
containment, and anonymous communications)

Course Content

UNIT I
Model of network security – Security attacks, services and attacks – OSI security architecture – Classical
encryption techniques – SDES – Block cipher Principles-DES – Strength of DES – Block cipher design
principles – Block cipher mode of operation – Evaluation criteria for AES – RC4 - Differential and linear
cryptanalysis – Placement of encryption function – traffic confidentiality.

UNIT II
Number Theory – Prime number – Modular arithmetic – Euclid’s algorithm - Fermet’s and Euler’s theorem –
Primality – Chinese remainder theorem – Discrete logarithm – Public key cryptography and RSA – Key distribution
– Key management – Diffie Hellman key exchange – Elliptic curve cryptography.

UNIT III
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and
MAC – SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS.

UNIT IV
Authentication applications – Kerberos – X.509 Authentication services - E-mail security – IP security - Web
security

UNIT V
Intruder – Intrusion detection system – Virus and related threats – Countermeasures – Firewalls design
principles – Trusted systems – Practical implementation of cryptography and security

Text Book
1. William Stallings, “Cryptography & Network Security”, Pearson Education, Fourth Edition 2010.

Reference Books
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security, Private communication in public
world”, PHI Second Edition, 2002.
2. Bruce Schneier, Neils Ferguson, “Practical Cryptography”, Wiley Dreamtech India Pvt Ltd, First
Edition, 2003.
3. Douglas R Simson “Cryptography – Theory and practice”, CRC Press, First Edition, 1995.
Course Title: Network Security - Lab Semester VII
Course Code IT802SE-04L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Networks Credits 2

Lab Experiments Objective:

1. To highlight the issues with computer and network security by giving the hands on knowledge of
various things like monitoring and analyzing network traffic
2. To install and configure different tools like Wireshark, SNORT, NMAP and Port Scanners etc.

Lab Experiments List:

1. Perform An Experiment To Grab A Banner With Telnet And Perform The Task Using Netcat Utility.
2. Perform An Experiment For Port Scanning With Nmap, Superscan Or Any Other Software.
3. Using Nmap
4. Find Open Ports On A System
5. Find The Machines Which Are Active
6. Find The Version Of Remote Os On Other Systems
7. Find The Version Of S/W Installed On Other System
8. Perform An Experiment On Active And Passive Finger
9. Printing Using Xprobe2 and Nmap.
10. Perform an experiment to demonstrate how to sniff for Router Traffic by Using the Tool Wireshark.
11. Perform an experiment How To Use Dumpsec.
12. Perform a Wireless Audit Of An Access Point / Router And Decrypt WEP And WPA.
13. Perform an Experiment To Sniff Traffic Using Arp Poisoning
14. Install Jcrypt Tool (Or Any Other Equivalent) And Demonstrate Asymmetric, Symmetric Crypto
Algorithm, Hash And Digital/Pki Signatures
15. Demonstrate Intrusion Detection System (Ids) Using Any Tool e.g. Snort Or Any Other S/W
16. Install Rootkits And Study Variety Of Options
17. Generating Password Hashes With Openssl
18. Setup A Honey Pot And Monitor The Honeypot On Network
Course Title: Big Data Analytics Semester VII
Course Code IT802SE-05 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Data Science Credits 3

Course Description
1. To understand the concept of Big Data
2. To learn Big Data file systems and their storage methods
3. To understand the algorithms and
4. To learn to process Big Data information for analytics
5. To discuss and understand Big Data implementations within large corporations like Google and
Facebook

Course Learning Outcomes

After learning the course the students should be able:
6. To model and implement efficient big data solutions for various application areas using appropriately
selected algorithms and data structures.
7. To analyze methods and algorithms, to compare and evaluate them with respect to time and space
requirements, and make appropriate design choices when solving real-world problems.
8. To explain trade-offs in big data processing technique design and analysis in written and oral form.
9. To explain the Big Data Fundamentals, including the evolution of Big Data, the characteristics of Big
Data and the challenges introduced.
10. To apply non-relational databases, the techniques for storing and processing large volumes of
structured and unstructured data, as well as streaming data.
11. To apply the novel architectures and platforms introduced for Big data, in particular Hadoop and
MapReduce.

Course Content

UNIT I
Introduction to Big Data: Introduction to Big Data The four dimensions of Big Data: volume, velocity, variety,
veracity, Drivers for Big Data, Introducing the Storage, Query Stack, Revisit useful technologies and
concepts, Real-time Big Data Analytics

UNIT II
Distributed File Systems: Hadoop Distributed File System, Google File System, Data Consistency

UNIT III
Big Data Storage Models: Distributed Hash-table, Key-Value Storage Model (Amazon's Dynamo), Document
Storage Model (Facebook's Cassandra), Graph storage models

UNIT IV
Scalable Algorithms: Mining large graphs, with focus on social networks and web graphs. Centrality,
similarity, all-distances sketches, community detection, link analysis, spectral techniques. Map-reduce, Pig
Latin, and NoSQL, Algorithms for detecting similar items, Recommendation systems, Data stream analysis
algorithms, Clustering algorithms, Detecting frequent items

UNIT V
Big Data Applications: Advertising on the Web, Web Page Quality Ranking, Mining Social-Networking Group,
Human Interaction with Big-Data. Recommendation systems with case studies of Amazon's Item-to-Item
recommendation and Netfix Prize, Link Analysis with case studies of the PageRank algorithm and the Spam
farm analysis, Crowd Sourcing

UNIT VI
Big Data Issues: Privacy, Visualization, Compliance and Security, Structured vs Unstructured Data

Text Book
1. Mining of massive datasets, Anand Rajaraman, Jure Leskovec, and Jeffrey Ullman

Reference Books
1. An Introduction to Information Retrieval, Christopher D. Manning, Prabhakar Raghavan, Hinrich
Schütze
2. Data-Intensive Text Processing with MapReduce, Jimmy Lin and Chris Dyer.
Course Title: Big Data Analytics - Lab Semester VII
Course Code IT802SE-05L Course Type Elective
Pre-requisite L–T–P 0–0–4
Stream Data Science Credits 2
Course Title: User Experience Design Semester VII
Course Code IT803SE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Software and Application Development Credits 3

Course Objectives:
To affect behavior by challenging to examine ethical and moral situations, think through them and identify
relevant support systems.

Course Outcomes:
After learning the course the students should be able:

Course Content:

UNIT I
UX Introduction: User Interaction with the products, applications and services – Cognitive Model/Mental
Model; Why User Experience Design; What is User Experience (UX) Design?

UNIT II
Elements of UX Design: Core elements of User Experience. How these elements work together.

UX Design Process: Defining the UX Design Process and Methodology

UNIT III
UX Design Process: RESEARCH & DEFINE: Why Research is critical?; Research methods and tools.
Understanding the User Needs and Goals; Understanding the Business Goals; Deliverables of the Research
& Define phase-Insight on User Goals and Business Goals; Hands-on assignments and Quiz

UNIT IV
UX Design Process: IDEATE/DESIGN - Visual Design Principles, Information Design and Data,
Visualization: Interaction Design, Information Architecture, Wire-framing & Story-boarding, UI Elements and
Widgets, Screen Design and Layouts, Hands-on Assignments and Quiz

UNIT V
UX Design Process: PROTOTYPE & TEST: Why Test your Design? What is Usability Testing? Types of
Usability Testing, Usability Testing Process, How to prepare and plan for the Usability, Tests? Prototype your
Design to Test? Introduction of prototyping tools, How to conduct Usability Test? How to communicate
Usability Test Results?

UNIT VI
UX Design Process: ITERATE/IMPROVE: Understanding the Usability Test findings Applying the Usability
Test feedback in improving the design

UX Design Process: DELIVER: Communication with implementation team UX Deliverables to be given to

implementation team
Course Title: Infrastructure Auditing & Implementation Semester VII
Course Code IT803SE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Infrastructure & Security Management Credits 3

FUNDAMENTALS OF INFRASTRUCTURE AUDIT Meaning and definition, Overview, Choice of

correct methods, Need, Scope and Objectives

INTRODUCTION TO RISK ASSESSMENT- Entity area, strategies and policies, in operation, support,
External Drivers, User Interaction, Consequences-Importance of demonstrating control over
network and security staffs, Risk of operator access controls over device and server settings.

CHECKLIST FOR IT AUDIT- Alignment with Business Strategy, Long Term IT Strategy, Short range
IT Plans, Information System Security Policy, Implementation of Security Policy, Information
System Audit Guidelines, Acquisition and implementation of packaged software

REQUIREMENT IDENTIFICATION AND ANALYSIS Configuration audits, Need for an audit trail, A
real-time, live-network change review, Automatically verify compliance with both external best
practices and internal standards.

VENDOR SELECTION CRITERIA & PROCESS-TRACKing the vendor selection criteria

CONTRACTING- The issues of site licenses, usage of open sources softwares, Annual maintenance
Contracts

IMPLEMENTATION- Importance of regulations and standards such as Sarbanes-Oxley, ISO 17799

and Visa's Cardholder Information Security Program (CISP), On-demand historical reports,
Governance & Cobit as a model for IT compliance.

BENEFITS OF INFRASTRUCTURE AUDIT, Strong change management process

Course Title: Cyber Law and IPR Semester VII
Course Code IT803SE-03 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Information Management & Quality Control Credits 3

Course Objectives:
1. To understand cyber laws and its applicability in India.
2. To learn the basic concepts of technology and law, digital contracts, rights of netizens and E-
governance. To study cyber space and the cyber laws and regulating them through relevant Acts.
3. To learn the comparative study of national and international laws keeping in view international
scenario in a no-barrier world.
4. To be aware about IPR in scientific and technical community for protecting their inventions.
5. To understand IPR from a non-lawyers perspective like senior managers, administrators etc.
6. To experience practices and procedures in various government offices administering IPR Laws.

Course Outcomes
1. To describe the cyber world and cyber law in general
2. To explain about the various facets of cyber crimes
3. To explain the problems arising out of online transactions and provoke them to find solutions
4. To clarify the Intellectual Property issues in the cyber space and the growth and development of the
law in this regard
5. To educate about the regulation of cyber space at national and international level

Course Content

UNIT I
Introduction to Cyber crimes: Definition, cybercrime and information security, Classes of cybercrime and
categories, Cyber offences, Cybercrimes with mobile and wireless devices.

UNIT II
Jurisdiction in the cyber world across the world: Cybercrime law in Asia, Cybercrime & federal laws, legal
principles on jurisdiction and jurisdictional disputes w.r.t. the internet in United States of America, cybercrime
legislation in African region, Foreign judgments in India

UNIT III
Indian IT act: Information Technology Act, 2000(Complete including digital signature, certifying authorities
and E-governance), Positive aspects, weak areas, Amendments to the Information Technology Act, 2008.
Challenges to Indian law and cybercrime scenario in India. Protection of cyber consumers in India

UNIT IV
Emerging Electronic System: E – commerce; E – governance; Concept of Electronic Signature; Credit Cards;
Secure Electronic Transactions

UNIT V
Intellectual property Rights: Intellectual Property law basics, Types of Intellectual Property, Agencies
responsible for Intellectual Property registration. International organizations, Agencies and Treaties.
Increasing importance of Intellectual Property Law

UNIT VI
Copyright issues in Cyberspace: Relevant provisions under Copyright Act, 1957, regulating copyright issues
in Cyberspace; Online Software Piracy – legal issues involved; Analysis of sufficiency of provisions of
Copyright Act to deals with Online Software
Piracy: Trademark issues in Cyberspace – Domain Name; Cyber squatting as a form of Domain Name
dispute; Case law.
Case studies: Highlight the cybercrimes, cyber laws and Intellectual property Rights with the help of minimum
5 cases with reference to Indian IT act for better understanding.

Text Books
1. Herman T. Tavani. Ethics & Technology, Ethical Issues in an Age of Information and Communication
Technology,3rd Edition, John Wiley & Sons, Inc., 2011
 2. A Guide to Information Technology” (Cyber Laws & E-commerce) Edition 2001:- Capital Law House.
Syed Shakil Ahmed and Reheja Rajiv
3. Law Relating to Computers Internet & E-commerce (A guide to Cyber Laws & the Information
Technology Act, 2000 with Rules & Notification), 2nd Edition, Reprint : 2002:- Universal Book
Traders, Kamath Nandan
4. Cyber Laws – Singh Yatindra
5. Cyber Crime – Bansal S K

Reference Books
6. Cyber law , E-commerce & M-Commerce – Ahmand Tabrez
7. Handbook of Cyber and E-commerce laws – Bakshi P M & Suri R K
8. The Indian Cyber Law, Second Edition 2001, Vishwanathan Suresh T., Bharat Law House.
9. Law Relating to Information Technology (Cyber Laws), 1st edition 2001- Asia Law House, Prasad
T.V.R. Satya
10. Reed Chris, “Computer Law”, Third Edition 1996 (First Indian Reprint 2000):- Universal Law
Publishing Co. Pvt. Ltd.
11. Intellectual Property (Trade Marks & the Emerging concepts of Cyber property rights (HB)", 3rd
Edition. (HB), 2002, Universal Book Traders, P. Narayanan,
Course Title: Internetworking Protocols Semester VII
Course Code IT803SE-04 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Networks Credits 3

Course Objectives:

Course Outcomes

Course Content

UNIT I
Review of Networking Technologies and Internetworking Concepts and Architectural Model: Application level
and network level interconnection, Properties of the internet, Internet architecture, Interconnection through IP
routers.

UNIT II
Internet Addresses, Mapping Internet Addresses to Physical Addresses (ARP) & Determining an Internet
Addresses at Startup (RARP):
Universal identifiers, Three primary classes of IP addresses, Network and broadcast addresses, Limited
broadcast, Dotted decimal notation, Weakness in internet addressing, Loopback addresses, Address
resolution problem, Two types of physical addresses, Resolution through direct mapping, Resolution through
dynamic binding, Address resolution cache, ARP to other protocols, Reverse address resolution protocol,
Timing RARP transaction, Primary and backup RARP servers.

UNIT III
Internet Protocol: Connectionless Datagram Delivery and Internet Protocol: Routing IP Datagram: The
concepts of unreliable delivery, Connectionless delivery system, Purpose of the internet protocol, The
internet datagram, Routing in an internet, Direct and indirect delivery, Table driven IP routing, Next hop
routing, Default routes, Host specific routes, The IP routing algorithm, Handling incoming data-grams ,
Establishing routing tables.

UNIT IV
Internet Protocol: Error and Control Message (ICMP) and Subnet and Supernet Address Extension: The
internet, Control message protocols, Error reporting versus error detection, ICMP message format, Detecting
and reporting various network problems through ICMP, Transparent router, Proxy ARP, Subnet addressing,
Implementation of subnets with masks representation, Routing in the presence of subnets, A unified
algorithm.

UNIT V
User Datagram Protocol (UDP): Format of UDP message, UDP pseudo header, UDP encapsulation and
protocols layering and the UDP checksum computation, UDP multiplexing, De-multiplexing and ports.

UNIT VI
Reliable Stream Transport Service (TCP): The transmission control protocol, Ports, Connections and
endpoint, Passive and active opens, The TCP segment format, TCP implementation issues.

Text Books
1. Douglas E. Comer, Internetworking with TCP/IP: Principles, Protocols and Architecture, Volume 1,
6th edition, PHI publication, 2013.
2. Behrouz A. Forouzan, TCP-IP Protocol Suite, 4th edition, Mc-Graw Hill publication, 2010.

Reference Books
1. Comer, Internetworking with TCP-IP Vol. 3, 5th edition, Pearson publication, 2013.
2. W. Richard Stevens, UNIX Network Programming: Interprocess Communications, Volume 2, 2nd
edition, PHI publication, 1999.
3. William Stalling, SNMP SNMPv2, SNMPv3, and RMON 1 and 2, 2nd edition, Pearson Education
publication, 2001.
4. Hunt Craig, TCP-IP Network Administration, 3rd edition, O’Reilly publication, 2002.
5. Loshin, Harwurt, TCP-IP Cleanly Explained, BPB publication.
Course Title: Web & Text Mining Semester VII
Course Code IT803SE-05 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Data Science Credits 3

Course Objectives
1. To learn the concepts of database technology evolutionary path which has led to the need for data
mining and its applications
2. To learn the essential techniques of data and text mining
3. To understand data mining standard predictive methods to unstructured text
4. To discuss the standard techniques of preparation and handling methods to transform that can be
mined

Course Outcomes
After learning the course the students should be able:
1. To examine the types of the data to be mined and present a general classification of tasks and
primitives to integrate a data mining system
2. To explore DWH and OLAP, and devise efficient & cost effective methods for maintaining DWHs.
3. To discover interesting patterns from large amounts of data to analyze and extract patterns to solve
problems , make predictions of outcomes
4. To comprehend the roles that data mining plays in various fields and manipulate different data
mining techniques
5. To evaluate systematically supervised and unsupervised models and algorithms wrt their accuracy.

Course Content

UNIT I
Introduction to Information Retrieval, Inverted indices and boolean queries. Query optimization, The nature of
unstructured and semi-structured text.

UNIT II
Text encoding: tokenization, stemming, lemmatization, stop words, phrases, Further optimizing indices for
query processing, Proximity and phrase queries, Positional indices.

UNIT III
Index compression: lexicon compression and postings lists compression, Gap encoding, amma codes, Zipf's
Law.Blocking. Extreme compression, Query expansion: spelling correction and synonyms. Wild-card queries,
permuterm indices, n-gram indices. Edit distance, soundex, language detection. Index construction. Postings
size estimation, merge sort, dynamic indexing, positional indexes, n-gram indexes, real-world issues.

UNIT IV
Parametric or fielded search, Document zones, the vector space retrieval model, tf.idf weighting, Scoring
documents, Vector space scoring, the cosine measure, Efficiency considerations, Nearest neighbor
techniques, reduced dimensionality approximations, random projection. Results summaries: static and
dynamic, Evaluating search engines.
User happiness, precision, recall, F-measure, Creating test collections: kappa measure, interjudge
agreement. Relevance, approximate vector retrieval.

UNIT V
Relevance feedback, Pseudo relevance feedback, Query expansion, Automatic thesaurus generation,
Sense-based retrieval, Experimental results of performance effectiveness.
Probabilistic models for text problems. Classical probabilistic IR, Language models, Introduction to text
classification, Naive Bayes models. Spam filtering. Probabilistic language models for IR. Bayesian nets for
IR.

UNIT VI
Introduction to the problem, Partitioning methods, K-means clustering, Mixture of Gaussians model,
Clustering versus classification, Hierarchical agglomerative clustering, Clustering terms using documents,
Labelling clusters, Evaluating clustering, Text-specific issues, Reduced dimensionality/spectral methods,
Latent semantic indexing (LSI), Applications to clustering and to information retrieval.
Vector space classification using hyperplanes; centroids; k Nearest Neighbors, Support Vector machine
classifiers, Kernel functions, Text classification, Exploiting text-specific features, Feature selection,
Evaluation of classification, Micro- and macro averaging, Comparative results.

Text Books
1. Data Mining: A Tutorial Based Primer, Michael Geatz and Richard Roiger, Pearson Education
2. Data and Text Mining: A Business Applications Approach, Thomas W. Miller, Pearson Education
3. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education

Reference Books
1. Modern Information Retrieval, R. Baeza-Yates and B. Ribeiro-Neto, Pearson Education, 1999
2. Information Retrieval: Algorithms and Heuristics. D.A. Grossman, O. Frieder. Springer, 2004.
3. Information Retrieval: Data Structures and Algorithms, W. Frakes and R. Baeza-Yates, Pearson
Education, 1ST EDITION.
Course Title: Multimedia Applications Semester VIII
Course Code IT804SE-01 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Software and Application Development Credits 3

Course Objectives:
1. To understand the overview of basic topics in multimedia
2. To learn the software technologies of non-traditional interfaces
3. To learn the development of interactive multimedia applications

Course Outcomes:
After learning the course the students should be able:
1. To understand basic concepts related to MM including data standards, algorithms and software
2. To experience development of multimedia software by utilizing existing libraries and descriptions of
algorithms
3. To demonstrate cutting-edge multimedia topics through independent study and presentations in
class

Course Content:

UNIT I
Introduction: Components of Multimedia, Multimedia and Hypermedia multimedia building blocks,
communication and information transfer model, multimedia information systems, application purposes of
multimedia, electronics performance support systems. Interaction Technologies and devices: Human
Computer Interface, Input/output technologies, combined I/O device, storage technologies, processing
technologies.
UNIT II
Multimedia Authoring and data representation: Multimedia Authoring: Production, presentation, and auto
authoring. Image data types, image representation, image acquisition, picture display, working with image.
UNIT III
Compression Technologies for multimedia: need for data compression, compression basics, lossless and
lossy compression, image compression standards, video compression standards, basic audio compression
standards.
UNIT IV
Text, Hypertext and Hypermedia, and Digital audio: Visual representation of text, digital representation of
characters, Formatting aspect text, Hypertext and hypermedia, producing digital audio, Psychoacoustics,
processing sound, representation of audio files, digitization of sound, MIDI, quantization and transmission of
audio.
UNIT V
Designing multimedia: Development phases and teams, analysis phase, design phase, development phase,
implementation phase, evaluation and testing.
UNIT VI
Multimedia networks and communication: Multimedia in the Internet, streaming stored audio/video, streaming
live audio/video, real-time interactive audio/video, Real-time interactive protocols: RTP, RTCP, Session
Initialization protocol (SIP), H.323, SCTP. QoS: Data flow, flow classes, flow control, Integrated services,
Differentiated services. Multimedia content management systems, multimedia indexing, multimedia retrieval.

Text Books:
1. Li. Z., Drew M., Fundamentals of Multimedia, Pearson Education publishers, 2004
2. Chow V. W. S., Multimedia technology and applications, Springer

Reference Books:
1. Banerji A., and Ghosh A.M., Multimedia Technologies, McGraw Hill International, 2009
2. Stamou G., and Kollias S., Multimedia Contents and the Semantic Web, John Wiley & Sons., 2005
Course Title: Multimedia Applications Laboratory Semester VIII
Course Code IT804SE-01L Course Type Elective
Pre-requisite L–T–P 0–0–2
Stream Software and Application Development Credits 1
Course Title: Ethical Hacking Semester VIII
Course Code IT804SE-02 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Infrastructure & Security Management Credits 3

Course Objectives:
1. To understand how intruders escalate privileges.
2. To understand Intrusion Detection, Policy Creation, Social Engineering, Buffer Overflows and
different types of Attacks and their protection mechanisms
3. To learn about ethical laws and tests

Course Outcomes:
After successful completion of the course, the student will be able:
1. To understand the core concepts related to malware, hardware and software vulnerabilities and their
causes
2. To understand ethics behind hacking and vulnerability disclosure
3. To appreciate the Cyber Laws and impact of hacking
4. To exploit the vulnerabilities related to computer system and networks using state of the art tools and
technologies

Course Content:

UNIT I
Types of Data Stolen From the Organizations, Elements of Information Security, Authenticity and Non-
Repudiation, Security Challenges, Effects of Hacking, Hacker – Types of Hacker, Ethical Hacker,
UNIT II
Hacktivism - Role of Security and Penetration Tester, Penetration Testing Methodology, Networking &
Computer Attacks – Malicious Software (Malware), Protection Against Malware, Intruder Attacks on
Networks and Computers, Addressing Physical Security – Key Loggers and Back Doors.
UNIT III
Web Tools for Foot Printing, Conducting Competitive Intelligence, Google Hacking, Scanning, Enumeration,
Trojans & Backdoors, Virus & Worms, Proxy & Packet Filtering, Denial of Service, Sniffer, Social Engineering
– shoulder surfing, Dumpster Diving, Piggybacking.
UNIT IV
Physical Security – Attacks and Protection, Steganography – Methods, Attacks and Measures, Cryptography
– Methods and Types of Attacks, Wireless Hacking, Windows Hacking, Linux Hacking.
UNIT V
Routers, Firewall & Honeypots, IDS & IPS, Web Filtering, Vulnerability, Penetration Testing, Session
Hijacking, Web Server, SQL Injection, Cross Site Scripting, Exploit Writing, Buffer Overflow, Reverse
Engineering, Email Hacking, Incident Handling & Response, Bluetooth Hacking, Mobiles Phone Hacking.
UNIT VI
An introduction to the particular legal, professional and ethical issues likely to face the domain of ethical
hacking, ethical responsibilities, professional integrity and making appropriate use of the tools and
techniques associated with ethical hacking – Social Engineering, Host Reconnaissance, Session Hijacking,
Hacking - Web Server, Database, Password Cracking, Network and Wireless, Trojan, Backdoor, UNIX,
LINUX, Microsoft, NOVEL Server, Buffer Overflow, Denial of Service Attack, Methodical Penetration Testing.

Text Books:

1. Michael T. Simpson, Kent Backman, James E. “Corley, Hands‐On Ethical Hacking and Network Defense”,

Second Edition, CENGAGE Learning, 2010.

2. Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical Hacking and Penetration Testing
Made Easy”, Syngress Basics Series – Elsevier, August 4, 2011.

Reference Books:
1. Steven DeFino, Barry Kaufman, Nick Valenteen, “Official Certified Ethical Hacker Review Guide”, CENGAGE
Learning, 2009-11-01.
2. Whitaker & Newman, “Penetration Testing and Network Defense” , Cisco Press, Indianapolis, IN, 2006.
Course Title: Ethical Hacking Laboratory Semester VIII
Course Code IT804SE-02L Course Type Elective
Pre-requisite L–T–P 0–0–2
Stream Infrastructure & Security Management Credits 1
Course Title: CRM & SCM Semester VIII
Course Code IT804SE-03 Course Type Elective
Pre-requisite L–T–P 3–0–0
Information Management and
Stream Credits 3
Quality Control

Course Objectives:
1. To make students understand the how IT is an enabler for SCM and CRM.
2. To understand supply chain strategy framework and supply chain strategies
3. To comprehend the functionalities of CRM in service sector

Course Outcomes:
After learning the course the students should be able:
1. To understand the concept of logistics and supply chain management.
2. To appreciate the importance of logistics function in overall success of any business/industrial
sector.
3. To understand the interrelationship between logistics and supply chain management.
4. To understand the importance and dynamics of supply chain management in any business/industrial
sector.
5. To know the world class best practices being carried out in supply chain management.
6. To understand the procurement and outsourcing strategies.
7. To understand the impact of customer relationship management in effective supply chain
management.
8. To know how to measure the performance of supply chain operations.

Course Content:

UNIT I
Introduction to CRM: What is CRM? Why we need CRM? Definition of CRM, Architecture of CRM,
Technology considerations of CRM, Technology Components of CRM, Customer Life Cycle, Customer
Lifetime Value computation, Implications of Globalization on Customer Relationship Management
UNIT II
Introduction to e-CRM: Definition of e-CRM, Its Need, features, Framework of e-CRM, Six e’s of e-CRM,
CRM Vs e-CRM, Architecture of e-CRM, Implementing a Technology Based CRM Solution
UNIT III
Introduction to Supply Chain: What is SCM?, Why SCM? Generic types of Supply chain, Major drivers of
Supply chain, Supply Chain Strategies, Value in Supply Chain- quality, delivery, flexibility, Core
competencies in Supply Chain
UNIT IV
Source management in Supply Chain: Insourcing, outsourcing, partner selection, sourcing strategies,
procurement strategies, Managing Inventory in Supply chain, Definition of inventories, selective inventory
control, vendor managed inventory systems, inventory performance measures- financial, operational &
inventory turnover ratio (ITR), Transportation Decisions in a Supply Chain – Transportation Strategy,
transportation selection, mode of transportation, Transportation management system (TMS)
UNIT V
e- SCM: Information technology in Supply Chain – Typical IT solutions- EDI, Intranet, Extranet, Data
Warehousing, E- commerce, E – procurement, Bar coding technology, GPS, RFID
UNIT VI
Information Systems in Supply Chain Case Study – A live case of use of IT, Case Studies for SCM & CRM,
For SCM: Mumbai Tiffinwala, For CRM: Sales Force

Text Books:
1. Bowersox, Closs & Cooper , “Supply Chain & Logistic Management”, Tata McGraw Hill, 2nd
Edition
2. Paul Greenberg, “CRM at the speed of light”, YMH 2nd Edition.

Reference Books:
1. Kristin Anderson and Carol Kerr, “Customer Relationship Management”, TMGH
Course Title: CRM & SCM Laboratory Semester VIII
Course Code IT804SE-03L Course Type Elective
Pre-requisite L–T–P 0–0–2
Information Management & Quality
Stream Credits 1
Control
Course Title: Wireless Networking Semester VIII
Course Code IT804SE-04 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Networking Credits 3

Course Objectives:
1. To study the evolving wireless technologies and standards
2. To understand the architectures of various access technologies such as 3G, 4G, WiFi etc.
3. To understand various protocols and services provided by next generation netwoks.
Course Outcomes:
After learning the course the students should be able:
1. To keep himself updated on latest wireless technologies and trends in the communication field
2. To understand the transmission of voice and data through various networks.

Course Content:

UNIT I
Introduction, Technology and service trends of Emerging Wireless technologies, The Amazing Growth of
Mobile Communications, A Little History, Mobile Communications Fundamentals, Mobile Data, WiFi,
Bluetooth, Cable Systems, Wireless Migration Options, Harmonization Process.
UNIT II
WiFi (802.11), 802.11 Standards, WiFi Protocols, Frequency Allocation, Modulation and Coding Schemes,
Network Architecture, Typical WiFi Configurations, Security, 802.11 Services, Hot Spots, Virtual Private
Networks (VPNs), Mobile VPN, VPN Types, WiFi Integration with 3G/4G, Benefits of Convergence of WiFi
and Wireless Mobile.
UNIT III
Introduction, Universal Mobile Telecommunications Service (UMTS), UMTS Services, The UMTS Air
Interface, Overview of the 3GPP Release 1999 Network Architecture, Overview of the 3GPP Release 4
Network Architecture, Overview of the 3GPP Release 5, All-IP Network Architecture, Overview CDMA2000,
TD-CDMA, TD-SCDMA, Commonality among WCDMA, CDMA2000, TD-CDMA, and TD-SCDMA
UNIT IV
LTE Ecosystem, Standards, Radio Spectrum, LTE Architecture, User Equipment (UE), Enhanced Node B
(eNodeB), Core Network (EPC), Radio Channel Components, TD-LTE, Multiple Input Multiple Output, LTE
Scheduler, Carrier Aggregation, Cell Search, Cell Reselection, Attach and Default Bearer Activation,
Handover (X2, S1, Inter-MME), Self-Organizing Networks (SONs), Relay Cells, Heterogeneous Network
(HetNET), Remote Radio Heads (RRH), VoLTE, LTE Advanced
UNIT V
Introduction, Standards, Generic WiMAX Architecture, Core Network, Radio Network, WiMAX Spectrum,
Modulation, Channel Structure, Mixed Mode, Interference Mitigation Techniques, Frequency Planning,
Features and Applications, Security, QoS, Profiles, Origination, Handover, Femto and SON
UNIT VI
Why VoIP?, The Basics of IP Transport, VoIP Challenges, H.323, The Session Initiation Protocol (SIP),
Distributed Architecture and Media Gateway Control, VoIP and SS7, VoIP Quality of Service.

Text Books:
1. Clint Smith, P.E., Daniel Collins, “Wireless Networks: Design and Integration for LTE, EVDO, HSPA,
and WiMAX”, McGraw Hill Education, Third Edition
2. Eldad Perahia, Robert Stacey, “Next Generation Wireless LANs”, Cambridge University Press,
Second Edition.

Reference Books:
1. Yi-Bang Lin, Imrich Chlamtac, “Wireless and Mobile Network Architecture”, Wiley India Edition.
2. Dipankar Ray chaudhary, Maria Gerla, “Emerging Wireless Technologies and the Future Mobile
Internet”, Cambridge University Press..
Course Title: Wireless Networking Laboratory Semester VIII
Course Code IT804SE-04L Course Type Elective
Pre-requisite L–T–P 0–0–2
Stream Networking Credits 1

Lab Experiments Objective:

To give the practical exposure on wireless networks along with live cases which helps to configure and
understand real issues on the site. Set of practical are helpful to become wireless administrator and builds
the platform to become certified professional.

Lab Experiments List:

1. Wireless Component and Media Identification
2. Install a WLAN Adapter Card
3. Wireless Mathematics
4. Topology Design with Cisco Network Designer (CND)
5. Configuring Basic AP Settings
6. Resetting the Bridge
7. Antenna Setup
8. Wireless Attacks and Countermeasures
9. WLAN Design
10. Site Survey Active Mode
Course Title: Machine Learning Semester VIII
Course Code IT804SE-05 Course Type Elective
Pre-requisite L–T–P 3–0–0
Stream Data Science Credits 3

Course Objectives:
1. To understand the basic concepts and methods of machine learning
2. To make use of some elementary machine learning techniques in the design of computer systems
3. To develop a broad perspective about the applicability of ML algorithms in different fields.
4. To understand the major machine learning algorithms, the problem settings, and assumptions that
underlies them.
5. To possess insights concerning the relative strengths and weaknesses of various common machine
learning methods

Course Outcomes:
After learning the course the student will be able:
1. To demonstrate knowledge of the machine learning literature
2. To describe how and why machine learning methods work
3. To demonstrate results of parameter selection
4. To explain relative strengths and weaknesses of different machine learning methods
5. To select and apply appropriate machine learning methods to a selected problem
6. To implement machine learning algorithms on real datasets
7. To suggest ways to improve results

Course Content:

UNIT-I
Introduction: Well-posed learning problems, Designing a Learning System, Perspectives and Issues in
Machine learning
Concept Learning and General-to-specific Ordering: A concept learning task, Concept learning as Search,
Finding a maximally specific hypothesis, Version Spaces and Candidate elimination algorithm, Inductive Bias
UNIT-II
Decision Tree Learning: Decision tree learning algorithm, Hypothesis space search in decision tree
Evaluating Hypothesis: Estimating Hypothesis accuracy, Basics of sampling theory, Deriving confidence
intervals, Hypothesis testing, comparing learning algorithms
UNIT-III
Bayesian Learning: Bayes theorem and concept learning, Maximum likelihood and least square error
hypotheses, Minimum description length principle, Bayes optimal classifier, Gibbs algorithm, Naive Bayes
classifier
Computational Learning Theory: Probably learning an approximately correct hypothesis, PAC learnability,
The VC dimension, the mistake bound model for learning
UNIT-IV
Linear Models for Regression: Linear basis function models, The Bias-Variance decomposition, Bayesian
Linear Regression, Bayesian Model comparison
Kernel Methods: Constructing kernels, Radial basis function networks, Gaussian Processes
UNIT-V
Approximate Inferencing: Variational inference, Variational mixture of Gaussians, Variational linear
regression, Variational logistic regression
Hidden Markov Models: Learning algorithms for HMM, the Viterbi algorithm, Linear Dynamical Systems
UNIT-VI
Reinforcement Learning: The learning task, Q learning, Non-deterministic rewards and action, Temporal
difference learning, Generalizing from examples

Text Books:
1. Mitchell, Tom. M., “Machine Learning”, McGraw-Hill Education, 1st edition, May 2013.
2. Segaran, Toby. “Programming Collective Intelligence- Building Smart Web 2.0 Applications”, O’Reilly
Media, August 2007.

Reference Books:
1. Miroslav, Kubat., “An Introduction to Machine Learning”, Springer Publishing.
2. Bishop, C. M., “Pattern Recognition and Machine Learning”, Springer Publishing.
3. Conway, Drew and White, John Myles, “Machine Learning for Hackers”, O'Reilly Media, February
2012.
Course Title: Machine Learning Laboratory Semester VIII
Course Code IT804SE-05L Course Type Elective
Pre-requisite L–T–P 0–0–2
Stream Data Science Credits 1

Lab Experiments Objective:

1. To implement various machine learning techniques to solve problems

Lab Experiments List:

1. Learn the data preprocessing steps to start a machine learning method for a practical
2. Solve a stated problem using the simple linear regression method
3. Use the multiple linear regression method for a stated issue
4. Implement a polynomial regression solution
5. Use the support vector regression to implement a ML solution
6. Solve a stated problem using the decision tree regression method
7. Implement a random forest regression solution
8. Implement a reinforcement learning program to demonstrate ML concepts