SCHEME OF EXAMINATION

and SYLLABI

For

B.E. (Information Technology)

For

Examination 2020-21(5th -6th Sem)

Examination 2021-22 (7th -8th Sem)

Batch-2018-22

B.E INFORMATION TECHNOLOGY, 2018-22 1|Page

Vision of Department of Information Technology:

The Department of Information technology aims to develop information technology engineers who work
professionally and creatively for the advancement of technology and betterment of society.

Mission of Department of Information Technology:

• To impart quality education by developing information technology facilities, faculty and resources that
generates professionals who are leaders for a dynamic information society.
• To develop a collaborative culture, so as to nurture an environment of increased research amongst the
students and faculty.
• To encourage hands-on learning by fostering industrial partnerships to create real world solutions
through innovation, product development, entrepreneurship and consultancy services.
• To enhance human potential by encouraging transparency and accountability amongst all stakeholders, in
order to nurture ethical values in students.

Programme Educational Objectives (PEOs)

 PEO 1: Graduates are prepared to be employable in industry and possess knowledge of engineering &
IT concepts, practices and tools to support design, development, application and maintenance of IT
enabled products and projects.
 PEO 2: Graduates are prepared to pursue higher education in their area of interest.
 PEO 3: Graduates are prepared to possess professional skills like team work, ethics, competence in
written & oral communication.

Program Outcomes:

a) An ability to apply the knowledge of mathematics, science, engineering fundamentals, and computing to the
solution of complex engineering problems.
b) An ability to identify, formulate, review research literature, and analyze complex engineering problems using
first principles of mathematics, natural sciences, and engineering sciences.
c) An ability to design solutions for complex engineering problems and design system components or processes
that meet the specified needs with appropriate consideration for the public health and safety, and the cultural,
societal, and environmental considerations.
d) An ability to use research-based knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid conclusions.
B.E INFORMATION TECHNOLOGY, 2018-22 2|Page
e) An ability to create, select, and apply appropriate techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering activities with an understanding of the limitations.
f) An ability to apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and
cultural issues and the consequent responsibilities relevant to the professional engineering practice.
g) To understand the impact of the professional engineering solutions in societal and environmental contexts,
and demonstrate the knowledge of, and need for sustainable development.
h) An ability to apply ethical principles and commit to professional ethics and responsibilities and norms.
i) An ability to function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
j) An ability to communicate effectively on complex engineering activities with the engineering community and
with society at large, such as, being able to comprehend and write effective reports and design documentation,
make effective presentations, etc.
k) An ability to demonstrate knowledge and understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary
environments.
l) An ability to recognize the need for, and have the preparation and ability to engage in independent and life-
long learning in the broadest context of technological change.

B.E INFORMATION TECHNOLOGY, 2018-22 3|Page

EXAMINATION NOTE:
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question,
covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper
will be divided into two parts having three questions each and the candidate is required to attempt at least two
questions from each part.
2.0 Credit System 2.0 Credit System

2.1 All B.E / integrated B.E-M.B.A programmes 2.1 All B.E / integrated B.E-M.B.A programmes
are organized around semester-based credit are organized around semester-based credit system
system of study. The credit system is based on of study. The credit system is based on continuous
continuous evaluation of a student’s evaluation of a student’s performance/progress
performance/progress and includes flexibility to and includes flexibility to allow a student to
allow a student to progress at an optimum pace progress at an optimum pace suited to his/her
suited to his/her ability or convenience, subject to ability or convenience, subject to fulfilling
fulfilling minimum requirements for minimum requirements for continuation.
continuation.
2.2 Performance/progress of a student is measured
2.2 Performance/progress of a student is by the number of credits that he/she has earned
measured by the number of credits that he/she (completed satisfactorily). Based on the course
has earned (completed satisfactorily). Based on credits and grades obtained by the student, grade
the course credits and grades obtained by the point average is calculated, subject to his
student, grade point average is calculated. A qualification of minimum grade in each subject.
minimum grade point average is required to be
maintained for satisfactory progress and
continuation in the programme. Also a minimum
number of earned credits and a minimum grade
point average should be acquired in order to 2.3Course Credit Assignment:
qualify for the degree. Each course has a certain number of credits
assigned to it depending on the associated number
2.3 Course Credit Assignment: of lecture, tutorials and laboratory contact hours in
Each course has a certain number of credits a week. A few courses are without credit and are
assigned to it depending on the associated referred to as non-credit (NC) courses.
number of lecture, tutorials and laboratory Lectures and Tutorials: One lecture hour or one
contact hours in a week. A few courses are tutorial hour per week per semester is assigned
without credit and are referred to as non-credit one credit.
(NC) courses. Practical / Laboratory Work: One laboratory hour
Lectures and Tutorials: One lecture hour or one per week per semester is assigned half credit.
tutorial hour per week per semester is assigned The credits are rounded off to the nearest whole
one credit. number.
Practical / Laboratory Work: One laboratory hour For each lecture or tutorial the self study
per week per semester is assigned half credit. component is 1 hour/week
The credits are rounded off to the nearest whole
number. 2.4 Earning Credits :
For each lecture or tutorial the self study At the end of every course, a letter grade is
component is 1 hour/week. awarded in each course for which a student had
registered. On obtaining a pass grade (at least ‘D’
2.4 Earning Credits : grade), the student accumulates the course credits
At the end of every course, a letter grade is as earned credits. Performance of a student is
awarded in each course for which a student had measured by the number of credits that he/she has
registered. On obtaining a pass grade (at least ‘D’ earned and by the weighted grade point average.
grade), the student accumulates the course credits Grades obtained in audit courses are not counted
as earned credits. Performance of a student is towards the calculation of grade point average.
measured by the number of credits that he/she However, a pass grade (‘D’ grade) is essential for
has earned and by the weighted grade point earning credits from an audit course.
B.E INFORMATION TECHNOLOGY, 2018-22 4|Page
average. A student has the option of auditing
some courses. Grades obtained in these audit 3.0 Grading System
courses are not counted towards the calculation
of grade point average. However, a pass grade 3.1 The grades and their respective description ,
(‘D’grade) is essential for earning credits from an along with grade points are listed in the table
audit course. given below in Table-1

3.0 Grading System Table-1

Grade Grade Description
3.1 Relative standing of the student in the class Point
shall be clearly indicated by his/her grades. The A+ 10 Outstanding
process of awarding grades shall be based upon A 9 Excellent
fitting performance of the class to a defined B+ 8 Very Good
statistical model. B 7 Good
C+ 6 Average
3.2 The grades and their respective description , C 5 Below average
along with grade points are listed in the table D 4 Marginal
given below in Table-1 F 0 Very Poor
I - Incomplete
Table-1 NP - Audit Pass
Grade Grade Description NF - Audit Fail
Point W - Withdrawal
A+ 10 Outstanding X - Unsatisfactory
A 9 Excellent S - Satisfactory
B+ 8 Very Good Completion
B 7 Good
C+ 6 Average
C 5 Below average
D 4 Marginal
E 2 Poor
F 0 Very Poor
I - Incomplete
NP - Audit Pass
NF - Audit Fail
W - Withdrawal
X - Unsatisfactory 4.0 Evaluation System
S - Satisfactory
Completion
Z - Course 4.1 Continuous Assessment :
continuation
There shall be continuous evaluation of the
4.0 Evaluation System student during the semester. For evaluation
purpose, total marks assigned to each subject shall
4.1 Continuous Assessment : be distributed as :
Two Mid semester Examination (Minor-1 and
There shall be continuous evaluation of the Minor-2) with 30 % of total marks assigned to the
student during the semester. For evaluation subject. Best Marks of one of these two will be
purpose, total marks assigned to each subject considered for award of sessional.
shall be distributed as :
Two Mid semester Examination (Minor-1 and Assignments/Class projects/ short class tests/MCQ
Minor-2) with 30 % of total marks assigned to based quizzes/projects/presentations/group
the subject. discussions/ Attendance with 20 % of total marks
assigned to the subject.
One End Semester Examination (Major
B.E INFORMATION TECHNOLOGY, 2018-22 5|Page
 Examination) with 50 % of total marks assigned to
Assignments/Class projects/ short class the subject. It is compulsory to appear in End
tests/MCQ based Semester Examination and secure at least 20%
quizzes/projects/presentations/group discussions marks of total End semester exam marks.
with 20 % of total marks assigned to the subject. If a candidate secures less than 20% marks of total
End semester exam marks, he/she will be awarded
One End Semester Examination (Major F grade.
Examination) with 50 % of total marks assigned
to the subject.
Total score on a scale of 100 i.e. in % obtained 4.2 Method for the Award of Grades:
by a student in a subject shall be hence forth
referred as raw score in that subject. For the award of grades in a course, all component
Following the concept of relative grading, before wise evaluation shall be done in terms of marks.
assigning the letter grades, scientific The components include: Midterm-1 and
normalization method shall be used to Midterm-2 examinations,
standardize the raw score. Assignments/projects/class
presentations/Attendance, and End semester
4.2 Statistical Method for the Award of Grades: examination as per regulation 4.1. After
converting the marks obtained in percentage , the
For the award of grades in a course, all grades will be assigned as per the guidelines given
component wise evaluation shall be done in below :
terms of marks. The components include:
Midterm-1 and Midterm-2 examinations,
Assignments/projects/class
presentations/Attendance, and End semester
examination as per regulation 4.1. After Table-2
converting the marks obtained in percentage , the Sr. Marks Grade Grade
grades will be assigned as per the guidelines No. Point
given below : 1. ≥ 90 A+ 10
2. ≥80 &< 90 A 9
4.2.1 For less than 15 students in a course, the 3. ≥70 &< 80 B+ 8
grades shall be awarded on the basis of cutoff in 4. ≥60 &< 70 B 7
the absolute marks as shown in Table-2. 5. ≥50 &< 60 C+ 6
Table-2 6. ≥45 &< 50 C 5
Absolut Grade Absolute marks 7. ≥40 &< 45 D 4
e marks in % 8. <40 F 0
in %
91 < A+ < 100
82 < A < 90
73 < B+ < 81
64 < B < 72
55 < C+ < 63
46 < C < 54
40 < D < 45
35 < E < 39
F < 35

4.2.2 For more than 30 students in a course, the

statistical method shall be used for the award of
grades. After expressing the score obtained by 4.2.2 NOT REQUIRED
the students in a course in percentage (X), the
class mean ( ) and class standard deviation (
S) of the marks shall be calculated and grades

B.E INFORMATION TECHNOLOGY, 2018-22 6|Page

shall be awarded to a student as shown in Table-
3 If X is the raw score in % ; is class mean
in % and S is class standard deviation in %
(based on raw score) , N is the number of
students in a course , then for the course :

Table-3
Lower Grade Upper
Range of Assigned Range of
Marks(%) Marks (%)
A+
A <
B+ <
B <
C+ <
C <
D <
E <
< F <
4.2.3 NOT REQUIRED
4.2.3 In case, class student strength in a course
lies between 15 and 30, any of the above
methods (given in 4.2.1 and 4.2.2) may be used
for the award of grades.
4.3 NOT REQUIRED
4.3 Finalization of Grades

Finalization of the grades shall be done by the

Board of Control of the department/ institute or
appropriate body/committee approved by the
university for the purpose.
In order to maintain a normal distribution in
grades, following recommendations of UGC
shall be kept in view and considered as broad
guidelines by the Board of Control of the
department/ institute or appropriate
body/committee approved by the university for
the purpose.

B.E INFORMATION TECHNOLOGY, 2018-22 7|Page

 5.0 Evaluation of Performance
Grade % of Population Remarks
A 7 Includes A+ and A 5.1 The performance of a student shall be
evaluated in terms of two indices, viz. Semester
B 24 Includes B+ and B
Grade Point Average (SGPA) and Cumulative
C 38 Includes C+ and C Grade Point Average (CGPA).
D 24 SGPA is the grade point average for the semester,
and CGPA is the cumulative grade point average
F 7 for all the completed semesters at any point in
time.
* The earned credits (E.C) are defined as the sum of
Note: In case Board of Control of the course credits for course in which A+ to D grade
department/ institute or appropriate has been obtained. For U.G students (B.E), credits
body/committee approved by the university for from courses in which NP or S grade has been
the purpose, is convinced on broad variations in obtained are also added.
grade distribution in a class for a particular
subject, B.O.C may make some minor variations Points earned in a semester =
in while maintaining the grade distribution as
recommended by the UGC.

5.0 Evaluation of Performance The SGPA is calculated on the basis of grades

obtained in all courses, except audit courses and
5.1 The performance of a student shall be courses in which S/Z grade is awarded, registered
evaluated in terms of two indices, viz. Semester for the particular semester.
Grade Point Average (SGPA) and Cumulative
Grade Point Average (CGPA).
SGPA is the grade point average for the
semester, and CGPA is the cumulative grade
point average for all the completed semesters at
any point in time.
The earned credits (E.C) are defined as the sum
of course credits for course in which A+ to D
grade has been obtained. For U.G students (B.E)
, credits from courses in which NP or S grade has
been obtained are also added.
Points earned in a semester = The CGPA is calculated as given below :

The SGPA is calculated on the basis of grades

obtained in all courses, except audit courses and
courses in which S/Z grade is awarded, registered
for the particular semester.

The CGPA is calculated on the basis of all pass

grades, except audit courses and courses in which
S/Z grade is awarded, obtained in all completed
semesters.

B.E INFORMATION TECHNOLOGY, 2018-22 8|Page

 Teaching Scheme for B.E. Third Year Examination 2020-21

Third Year - Fifth Semester

Scheme of Examination
Scheme of Teaching
Subject Theory Practical
Subject Name
Code Contact Internal Univ. *
L-T-P Credits
hrs./week category Ass. Exam
IT501 Database 3-1-3 7 4+1 PC-G 50 50 50
Management
System
IT502 Wireless 3-1-3 7 4+1 PC 50 50 50
Communication
Technologies
IT503 Network Security 3-1-0 4 4 PC-G 50 50 -
and Cryptography
IT504 Design and 3-1-3 7 4+1 PC-G 50 50 50
Analysis of
Algorithms
IT505a, Professional 4-0-3 7 4+1 PEC 50 50 50
IT505b, Elective-I
IT505c
IT506 Industrial 0-0-0 0 2 PSI - - 50
Training(after 4th
semester)

Total 16-4-12 32 26 250 250 250

Total Marks: 750 Total Credits: 26

S.NO TYPE Credit

1. PC (Professional Course) 19
2. PEC(Professional Elective Course) 5
3. PSI(Project/Seminar/Internship) 2

Professional Elective-I
(Choose any one from the following )
Sr Subject Subject Code
No.
1 Java Programming/Technologies IT505a
2 UNIX Network Programming IT505b
3 Python Programming IT505c

B.E INFORMATION TECHNOLOGY, 2018-22 9|Page

 Third Year - Sixth Semester

Scheme of Examination
Scheme of Teaching
Subject Theory
Subject Name Practical
Code Contact Internal Univ.
L-T-P Credits *
hrs./week Category Ass. Exam
IT601 Data Warehouse and 4-0-3 7 4+1 PC 50 50 50
Data Mining
IT602 Agile Software 4-0-3 7 4+1 PC 50 50 50
Development
IT603 Theory of Computation 3-1-0 4 4 PC-G 50 50 -
IT604 Artificial Intelligence 3-1-3 7 4+1 PC 50 50 50
IT605a 4-0-0 4 4 PEC 50 50 -
IT605b Professional Elective –
IT605c II
IT605d

Total 18-2-9 29 23 250 250 150

Total Marks: 650 Total Credits: 23

S.NO TYPE Credits

1. PC(Professional Course) 19
2. PEC (Professional Elective 4
Course)
Professional Elective Course-II
(Choose any one from the following :)
Sr Subject Subject Code
No.
1 Advanced Computer Network IT605a
2 Computer Graphics IT605b
3 Advanced Cryptography IT605c
4 Software Engineering IT605d

B.E INFORMATION TECHNOLOGY, 2018-22 10 | P a g e

 Teaching Scheme for B.E. Fourth Year Examination 2021-22

Fourth Year - Seventh Semester

.

Scheme of Examination
Scheme of Teaching
Subject Name Theory Practical
Subject
Contact *
Code Internal Univ.
L-T-P hrs./wee Credits Type
Ass. Exam
k
IT701 Digital Signal 3-1-3 7 4+1 PC 50 50 50
Processing
IT702 Machine Learning 4-0-3 7 4+1 PC 50 50 50
IT703 Compiler Design 4-0-0 4 4 PC 50 50 -
IT704a Professional 4-0-0 4 4 PEC 50 50 -
IT704b Elective -III
IT704c
IT704d

IT705 Project-I 0-0-6 6 3 PSI - - 100

IT706 Industrial Training 0-0-0 0 2 PSI - - 50

(after 6th
Semester)

Total 15-1-12 28 23 04 200 200 250

Total Marks: 650 Total Credits: 23

S.NO TYPE Credits

1. PC (Professional Course) 14
2. PEC (Professional elective course) 4
3. PSI (Project/Seminar/Internship) 5

B.E INFORMATION TECHNOLOGY, 2018-22 11 | P a g e

Fourth Year - Eighth Semester

Scheme of Examination
Scheme of Teaching
Subject Theory Practical
Subject Name
Code L-T-P Contact Internal Univ. *
hrs./week Credits Type Ass. Exam
IT801 Digital Image 3-1-3 7 4+1 PC 50 50 50
Processing
IT802 Embedded System 3-1-3 7 4+1 PC 50 50 50
Design
IT803a, Professional 3-1-0 4 4 PEC 50 50
IT803b, Elective -IV
IT803c,
IT803d

IT804a, Professional 3-1-0 4 4 PEC 50 50 -

IT804b, Elective -V
IT804c,
IT804d

IT806 Project II 0-0-6 6 3 PSI - - 100

IT807 Seminar 0-0-2 2 1 PSI - - 50

Total 12-4-15 31 22 04 200 200 250

Total Marks: 650 Total Credits: 22

OR OPTION – 2
Sub Sub Name Duration Credits Int. Ass. Marks Grand
Code * Total
IT807 Industrial Training 6 months 22 300 350 650

S.NO TYPE Credits

1. PC (Professional Course) 10
2. PEC (Professional Elective 8
Course )
3. PSI (Project/Seminar/Internship) 4

Student can exercise option 1 or option 2 according to the following:

A student may opt for one semester training in lieu of subjects of 8th Semester. The marks for six months
training will be equal to the total marks of 8th Semester study. A student can opt for six month semester training
under following conditions:-
a. The student having any pending reappears in any subject (theory as well as practical) will not be allowed to
go for training.
b. The students scoring less than 6.5 CGPA upto 6th semester will not be allowed to go for training. However, if
a student has been placed through campus placement, he/she may be allowed to go for training at that
respective company subject to the condition that his/her CGPA is above 6.0.
c. The students will only be allowed to pursue training in a company in which he/she is placed or company is
offering stipend/MNC/Govt. Organization including R&D institutions/PSUs (Not Pvt. Ltd.)
d. For pursuing this training, student needs the prior approval from the Co-ordinator/Chairperson of the
respective branch/department.

B.E INFORMATION TECHNOLOGY, 2018-22 12 | P a g e

Bucket Domain Professional Professional Professional Professional Elective-V
Elective-II Elective-III Elective-IV
Data Advance Internet of Cloud Network Management&
Communication Computer Things (IoT) Computing Administration
and Network Network
Image Processing Computer Multimedia Human Computer Vision
Graphics System Computer
Interaction
Security Advance Cyber Security & Security in IoT Pattern
Cryptography Forensics Network Recognition

Software Software Software Project Software Software Testing &

Engineering Engineering Management Architecture& Quality Assurance
Design

B.E INFORMATION TECHNOLOGY, 2018-22 13 | P a g e

 SYLLABUS FOR B.E. (I.T.) FIFTH SEMESTER

COURSE INFORMATION SHEET

Course Code IT501

Course Title Database Management Systems (Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Introduction to Information Technology
Course Objectives This course offers a good understanding of
database systems concepts and prepares the
student to be in a position to use and design
databases for different applications.
1. The objective of this course is to provide
students with the background to design
manipulate and manage databases.
2. The students are exposed to the various
forms, types and models of database
systems to enable them to make suitable
choices from alternatives.
3. The concepts of managing data are
thoroughly examined and students are
taught implementation using SQL and
PL/SQL.
Course Outcomes After completion of this course, the students
will be able to:
1. Understand the basic concepts of a
database management system and its
components.
2. Understand the relational data model,
entity- relationship model and process of
relational database design.
3. Design entity-relationship diagrams to
represent simple database application
scenarios and apply the principles of
good relational database design.
4. Understand the concept of a transaction
and different techniques for concurrency
control.
5. Construct simple and moderately
advanced database queries using
Structured Query Language (SQL) and
Procedural SQL (PL/SQL).

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
B.E INFORMATION TECHNOLOGY, 2018-22 14 | P a g e
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Introduction to Database Systems (06)

File Systems Versus a DBMS, Advantages of a DBMS, Describing and Storing Data in
a DBMS, Database System Architecture, DBMS Layers, Data independence
Physical Data Organization (07)
File Organization and Indexing, Index Data Structures, Hashing, B-trees, Clustered
Index, Sparse Index, Dense Index, Fixed length and Variable Length Records.
Data Models (05)
Relational Model, Network Model, Hierarchical Model, ER Model: Entities, Attributes
and Entity Sets, Relationships and Relationship Sets, Constraints, Weak Entities, Class
Hierarchies, Aggregation, Conceptual Database Design with the ER Model, Comparison
of Models.
The Relational Model (05)
Introduction to the Relational Model, ER to Relational Model Conversion, Integrity
Constraints over Relations, Enforcing Integrity Constraints, Relational Algebra,
Relational Calculus, Querying Relational Data.

SECTION-B

SQL (07)
Basic SQL Query, Creating Table and Views, SQL as DML, DDL and DCL, SQL
Algebraic Operations, Nested Queries, Aggregate Operations, Cursors, Dynamic SQL,
Integrity Constraints in SQL, Triggers and Active Database, Relational Completeness,
Basic Query Optimization Strategies, Algebraic Manipulation and Equivalences.
Database Design (08)
Design: Functional Dependencies, Reasoning about Functional Dependencies, Normal
Forms, Schema Refinement, First, Second and Third Normal Forms, BCNF, Multi-
valued Dependency, Join Dependency, Fourth and Fifth Normal Forms, Domain Key
Normal Forms, Decompositions.
Transaction Management (07)
ACID Properties, Serializability, Two-phase Commit Protocol, Concurrency Control,
Lock Management, Lost Update Problem, Inconsistent Read Problem, Read-Write
Locks, Deadlocks Handling, 2PL protocol.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 An Introduction to Database Systems, C.J. Date Pearson
th
8 Edition
2 Schaum’s Outlines Fundamentals of Toledo Tata McGraw
rd
Relational Databases, 3 Edition Hill
3 Database Management Systems, 2nd James Martin PHI
Edition
4 Data Base Management Systems, 3rd Raghu Ramakrishnan and McGraw Hill
Edition Johannes Gehrke
5 Introduction to Data Base Systems, 3rd Bipin C Desai Galgotia
Edition Publications
B.E INFORMATION TECHNOLOGY, 2018-22 15 | P a g e
 COURSE INFORMATION SHEET

Course Code IT501

Course Title Database Management Systems (Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Sessional) 50
Course Prerequisites Introduction to Information Technology
Course Objectives 1. To use the Oracle and SQL database
systems along with hands on experience
on DDL, DML as well as DCL
Commands.
2. To make students able to implement
nested queries and various functions
based on programming assignments.

SYLLABUS
List of Practicals:

1. Introduction to SQL and installation of SQL Server / Oracle.

2. Data Types, Creating Tables, Retrieval of Rows using Select Statement, Conditional Retrieval
of Rows, Alter and Drop Statements.
3. Working with Null Values, Matching a Pattern from a Table, Ordering the Result of a Query,
Aggregate Functions, Grouping the Result of a Query, Update and Delete Statements. 4. Set
Operators, Nested Queries, Joins, Sequences.
5. Views, Database Security and Privileges: Grant and Revoke Commands, Commit and Rollback
Commands.
6. PL/SQL Architecture, Assignments and Expressions, Writing PL/SQL Code, Referencing Non-
SQL parameters.
7. Stored Procedures and Exception Handling.
8. Triggers and Cursor Management in PL/SQL.

B.E INFORMATION TECHNOLOGY, 2018-22 16 | P a g e

 COURSE INFORMATION SHEET

Course Code IT502

Course Title Wireless Communication Technologies
(Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Basics of Electronics Communication
Course Objectives To understand the terminology, fundamental
concepts, issues and design approaches of
wireless communication systems.

Course Outcomes After completion of this course, the students

will be able to:
1. Understand the basics of wireless
communication systems.
2. Analyze the design fundamentals of
wireless cellular systems.
3. Explain and experiment with the wireless
communication technologies and choose
propagation models.
4. Interpret the working of emerging
wireless systems.

SYLLABUS

Note: The examiner shall set seven questions of equal marks. First question is compulsory
and shall cover the whole syllabus by including questions of conceptual nature. Rest of the
syllabus will be divided into A and B parts having three questions each. Candidate is
required to attempt at least two questions from each part.

SECTION-A Hours

Introduction to Wireless Communication (6)

Wireless Communication-Features, Issues and Applications. Types of Wireless
Communication Systems, Evolution of communication systems 1G, 2G, 2.5G, 3G, 4G,
Comparison of common wireless communication systems.
The Cellular Concept-System Design Fundamentals (8)
Frequency reuse, Channel assignment strategies, Handoff strategies, Interference,
Improving Coverage and Capacity in cellular systems: Cell splitting, Cell sectoring and
Microcell zone concept.
GSM and CDMA Wireless Cellular Systems (08)
GSM-Architecture, Identifiers, Authentication and Security, Control Channels,
Services. IS-95 Architecture, Forward and Reverse channels, Soft handoff, Near-Far
Effect, Cell Breathing, Mobile data over CDMA, CDMA-2000, Comparison of CDMA
and GSM.

B.E INFORMATION TECHNOLOGY, 2018-22 17 | P a g e

 SECTION-B

The Propagation Models (09)

Propagation criteria, Free space propagation model, Mobile point to point propagation
model, Outdoor propagation path loss models, Indoor propagation path loss models,
Signal attenuation due to Foliage, Long distance propagation.
Wireless Technologies (08)
Bluetooth, WiFi networks and WLAN IEEE 802.11 standards, ZigBee Radios and
IEEE 802.15.4, RFID systems and EPC Global UHF Class 1 Generation 2,WiMax,
LTE, LTE-A.
Emerging Wireless Systems (06)
Ad-hoc/Mesh wireless networks, Sensor networks, Ultra wideband systems, Distributed
control networks, Cognitive radios, Biomedical networks and In-body networks,
Internet of Things.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

Wireless Communications: Principles Theodore S. Rappaport Prentice Hall

1 and Practice, Latest Edition India
Wireless and Cellular Communication, Sanjay Sharma S. K. Kataria &
2 Latest Edition Sons
Wireless Communications, Latest T. L. Singal McGraw Hill
3 Edition Education

COURSE INFORMATION SHEET

Course Code IT502

Course Title Wireless Communication Technologies
(Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University 00
Exam.) 50
Continuous Assessment (Practical)
Course Prerequisites Basics of Electronics Communication
Course Objectives To familiarize students with the Wireless
Communication Technology (Satellite,
Cellular and Bluetooth etc.)
SYLLABUS
Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 18 | P a g e

 COURSE INFORMATION SHEET

Course Code IT503

Course Title Network Security and Cryptography
(Theory)
Type of Course Core
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Computer Networks
Course Objectives 1. To understand and apply the principles of
encryption algorithms, conventional and
public key cryptography.
2. To gain knowledge about authentication,
hash functions and application level
security mechanisms.

Course Outcomes After completion of this course, the students

will be able to:
1. Identify the security threats and apply
relevant cryptographic techniques on
data.
2. Compare the different techniques of
public key cryptography and key
exchange.
3. Apply the basic concepts of digital
signatures and hash algorithms.
4. Outline the basics of network and web
security services and mechanisms.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Basic Encryption and Decryption

Threats and Types of attacks, Challenges for Information Security, Classical
Cryptographic Algorithms: Monoalphabetic Substitutions such as Caesar Cipher, (06)
Cryptanalysis of Monoalphabetic ciphers; Polyalphabetic Ciphers such as Vigenere,
Vernam Cipher; Transposition Cipher.

Stream and Block Ciphers

B.E INFORMATION TECHNOLOGY, 2018-22 19 | P a g e

Rotor Based System and Shift Register Based System. Block cipher: principles, modes (07)
of operations. Data Encryption Standard (DES), Analyzing and Strengthening of DES,
Introduction to Advance Encryption Standard (AES)
Number Theory and Basic Algebra (04)
Modular Arithmetic, Euclidean algorithm, Random number generation
Key Management Protocols: (05)
Solving Key Distribution Problem, Diffie-Hellman Algorithm, Key Exchange with
Public Key Cryptography.

SECTION-B

Public Key Encryption Systems (06)

Concept and Characteristics of Public Key Encryption system, Rivets-Shamir-Adleman
(RSA) Encryption, Digital Signature Algorithms and authentication protocols, Digital
Signature Standard (DSA).
Hash Algorithms (05)
Hash concept, description of Hash Algorithms, Message Digest Algorithms such as
MD4 and MD5, Secure Hash Algorithms such as SH1 and SHA2
Network Security (04)
Kerberos, IP security: Architecture, Authentication Header, Encapsulating Security
Payload
Web Security (04)
Web security consideration, Secure Socket Layer Protocol, Transport Layer Security,
Secure Electronic Transaction Protocol
Firewalls (04)
Firewall Design principles, Trusted Systems, Virtual Private Networks.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Principles of Cryptography, 4th Edition William Stallings Pearson
Education
2 Security in Computing, 2nd Edition Charles P.Pfleeger Prentice Hall
International
3 Cryptography & Network Security, 2nd Atul Kahate TMH
Edition
4 Applied Cryptography: Protocols, Bruce Schneier John Wiley
Algorithms, and Source Code in C, 2nd and Sons
Edition
5 Firewalls and Internet Security, 2nd Bill Cheswick and Steve Addison-
Edition Bellovin Wesley
6 Security Technologies for the world Rolf Oppliger Artech House,
wide web, 2nd Edition Inc

B.E INFORMATION TECHNOLOGY, 2018-22 20 | P a g e

 COURSE INFORMATION SHEET

Course Code IT504

Course Title Design and Analysis of Algorithms(Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Programming Fundamental, Data Structures
Course Objectives The objective of this course is to familiarize
with the algorithm analysis techniques and
various strategies of algorithm design. The
course covers asymptotic analysis and
algorithm design strategies illustrated on
different problem domains.

Course Outcomes After completion of this course, the students

will be able to:
1. Analyze the asymptotic performance of
algorithms.
2. Compare the performance of different
algorithms in terms of time and space
complexity.
3. Understand various algorithm design
strategies and its application in problem
solving.
4. Design efficient algorithms for the real
world problems.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Analysis of algorithm (09)

Role of Algorithms in Computing; Growth of functions: Asymptotic Notation, Standard
notation, Performance measurements Introduction to Recurrences: substitution method,
recursion-tree method, master method; Algorithms;
Divide and Conquer Method (07)
General Method, Binary Search, Matrix Multiplication, Merge Sort, Quick Sort and
their performance analysis

B.E INFORMATION TECHNOLOGY, 2018-22 21 | P a g e

Greedy Approach (07)
Elements of Greedy strategy, Knapsack problem, Single source Shortest paths problem,
Minimum Spanning tree problem and analysis of these problems.

SECTION-B

Dynamic Programming (09)

General Method, Multistage Graph , All Pairs Shortest Path Algorithm , 0/1 Knapsack
Problem, Traveling Salesman Problem
Backtracking (07)
The General Method , 8-Queens Problem- Sum of Subsets ,Knapsack
P and NP Problems (06)
Polynomial time, Nondeterministic Algorithms and NP, Reducibility and NP
completeness, NP complete Problems

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Fundamentals of Computer Algorithms Ellis Horowitz, SartajSahni Galgotia

2 Introduction to Algorithms Thomas H. Cormen, Prentice Hall

Charles E. Leiserson,
Ronald L. Rivest

3 The Design and Analysis of Computer Aho A.V., Hopcroft J.E., Pearson
Algorithms Ullman J.D. Education

4 Fundamentals of A lgorithms Gilles Brassard & Paul Prentice Hall

Bratley

B.E INFORMATION TECHNOLOGY, 2018-22 22 | P a g e

 COURSE INFORMATION SHEET

Course Code IT504

Course Title Design and Analysis of Algorithms
(Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Programming Fundamental, Data Structures
Course Objectives
1. To understand and implement different
algorithm design techniques.
2. To design algorithms based on the
strategies learned and apply the same to
solve different problems.
SYLLABUS

Practical based on theory

B.E INFORMATION TECHNOLOGY, 2018-22 23 | P a g e

 Professional Elective-I
COURSE INFORMATION SHEET

Course Code IT505a

Course Title Java programming/Technologies (Theory)
Type of Course Professional Elective-I
LT P 403
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Programming Fundamental, Object Oriented
Programming using C++
Course Objectives The objective of the course is to learn the
object oriented concepts from the perspective
of Java programming language and UML so as
to apply the same to solve various engineering
problems. This course covers a practical
approach to object-oriented analysis, design
and programming using UML and Java.
Course Outcomes
After completion of the course, students will be
able to

1. Learn the fundamental concepts of Java

programming language such as
encapsulation, inheritance, exception
handling and multithreading.
2. Understand the Java I/O stream classes.
3. Design graphical user interface using
standard java libraries for implementing
event driven applications.
4. Examine the enterprise components
including Enterprise JavaBeans (EJB)
technology, servlets, and Java Server Pages
(JSP) technology, JDBC.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

B.E INFORMATION TECHNOLOGY, 2018-22 24 | P a g e

 SECTION-A Hours

Java Methods, Classes and Inheritance (8)

Introduction; classes; methods; constructors; overloading methods; arrays; recursion;
passing arrays and objects to methods; Inheritance; method overriding; abstract classes;
using final; packages; interfaces.
Exceptional Handling and Multithreaded Programming (8)
Exception handling fundamentals; exception types; uncaught exceptions; try and catch;
creating exception classes; throwing exceptions; Java thread model; thread priorities;
creating a thread; interthread communication; thread synchronization; suspending,
resuming and stopping threads.
I/O, Applets and Graphics (8)
I/O basics; stream classes; byte and character streams; reading and writing files; Applet
fundamentals; Applet class; Applet initialization and termination; event handling;
keyboard and mouse events; AWT class; Layout managers; panels; canvases; Frame
windows; drawing lines, rectangles, ellipses.

SECTION-B

Overview of J2EE and working with JDBC (7)

What is J2EE, component based architecture of J2EE: Web, Business and Application
component, commonly used classes and interfaces of java.sql package, connecting java
application to a database, prepared statements.
Servlets and JSP (7)
Java Servlets, compilation, deployment, and testing a servlet, session management,
request dispatching, Java Server Pages, deploying and testing a JSP, using java beans in
JSP.
Enterprise Java Beans(EJB) (7)
Architecture of EJB, creating a stateless-session EJB, statefull-session bean, Life Cycle
of session beans, Entity beans, life cycle of entity beans.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISH

ER
1 Java: How to Program, 6th Edition Deitel and Deitel Pearson
Education
2 The Complete Reference Java2 Herbert Schildt TMH

3 J2EE: The Complete Reference James Edward Keogh, Jim McGraw-

Keogh Hill

B.E INFORMATION TECHNOLOGY, 2018-22 25 | P a g e

 COURSE INFORMATION SHEET

Course Code IT505a

Course Title Java Programming/Technologies
(Practical)
Type of Course Professional Elective-I
Credits 01
Course Assessment Methods:
End Semester Assessment (University 00
Exam.) 50
Continuous Assessment (Practical)
Course Prerequisites Object Oriented Programming using C++
Course Objectives To be able to learn the concepts of and
practical approaches to object-oriented
analysis, design and programming using
UML and Java.

SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 26 | P a g e

 COURSE INFORMATION SHEET

Course Code IT505b

Course Title Unix Networking Programming (Theory)
Type of Course Professional Elective-I
LT P 403
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Programming Fundamental, Object Oriented
Programming using C++
Course Objectives To teach the students how to write programs that
communicates with other programs across a
computer network.
1. The student shall be able to write their own
network programs in UNIX.
2. To provide an opportunity to do network
programming using TCP sockets.
3. To provide an opportunity to do network
programming using UDP sockets.
4. To provide to do IPC programs.
5. know The importance of platform independent
networks
Course Outcomes After completion of this course, the students will be
able to:
1. Understand the variety of interfaces &
frameworks for writing network applications.
2. Implement interfaces, streams sockets, and
remote procedure call libraries.
3. Design and implement programs based on
Client-server model.
4. understand concept of I/O Multiplexing, UDP
Construct programs for client manage I/O
stream & implement Unix socket system calls.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be compulsory,
having parts covering the whole syllabus. Three questions have to be set from Part A and three
questions from Part B of the syllabus. Candidate is required to attempt at least two questions from
each part. All the course outcomes must be covered by the question paper.

B.E INFORMATION TECHNOLOGY, 2018-22 27 | P a g e

 Hours
SECTION-A

INTRODUCTION (8)
TO NETWORK PROGRAMMING: OSI model, Unix standards, TCP and UDP,TCP
connection establishment and termination, Buffer sizes and limitations,Standard Internet
services, Protocol usage by common internet applications.
SOCKETS AND APPLICATION DEVELOPMENT (7)
Introduction To Socket Programming – System Calls – Address Conversion Functions –
P OSIX- Signal Handling – Server With Multiple Clients – Boundary Conditions – Server Process C
Rashes Server Host Crashes, Server Crashes And Reboots,Server Shutdown – I/O,Multiplexing
– I/ Models -TCP Echo Client/Server with I/O Multiplexing.
SOCKET OPTIONS (8)
S socket Options – Getsockopt And Setsockopt Functions – Generic Socket Options –
IP Socket Options ICMP Socket Options – TCP Socket Options – Multiplexing TCP And UDP
Sockets – SCTP Sockets – CTP Client/Server – Streaming Example – Domain Name System –
Gethostbyname, Gethostbyaddr, Getservbyname And Getservbyport Functions –
Protocol Independent Functions In CP Client/Server Scenario .

SECTION-B

ADVANCED SOCKETS (8)

IPv4 And IPv6 Interoperability – Threaded Servers – Thread Creation And Termination –
TCP Echo Server Using Threads – Mutex – Condition Variables – Raw Sockets – Raw
Socket Creation – Raw Socket Output – Raw Socket Input – Ping Program – Traceroute
Program.
SIMPLE NETWORK MANAGEMENT (8)
SNMP Network Management Concepts – SNMPv1 – Management Information – MIB
Structure – Object Syntax – Standard MIB‟S – MIB-II Groups – SNMPv1 Protocol And
Practical Issues.
SNMP V2, V3 AND RMO (7)
Introduction To SNMPv2 – SMI For SNMPV2 – Protocol – SNMPv3 – Architecture And
Applications – Security And Access Control Model – Overview Of RMON.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 UNIX Network Programming, Sockets W.Richard Stevens, PHI
API, Volume I, 3rd Edition, PHI, 2010.
2 SNMP, SNMPv2, SNMPv3 And William Stallings PHI
RMON 1 And 2”, Third Edition,
Pearson Edition, 2009
3 UNIX Systems Programming using T. Chan PHI
C++ 1st Edition, PHI, 2010

B.E INFORMATION TECHNOLOGY, 2018-22 28 | P a g e

 COURSE INFORMATION SHEET

Course Code ITE505b

Course Title Unix Networking Programming (Practical)
Type of Course Professional Elective -I
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Programming Fundamental, Object Oriented
Programming using C++
Course Objectives To teach the students how to write programs
that communicates with other programs
across a computer network.

SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 29 | P a g e

 COURSE INFORMATION SHEET

Course Code IT505c

Course Title Python Programming
Type of Course Professional Elective-I
LT P 403
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University 50
Exam.) 50
Continuous Assessment (Sessional)
Course Prerequisites Programming Concepts.
Course Objectives The course is designed to provide Basic knowledge of
Python
Course Outcomes After completion of this course, the students will be
able to:
1. Understand the basic features of Python.
2. Understand different data structures of Python.
3. Design programs using object oriented
programming and file handling.
4. Learn the concept of exception handling and
database connectivity.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.

SECTION-A Hours

Introduction to Python
Installation and Working with Python, Understanding Python variables, Python basic
Operators, Understanding python blocks, Basic data types of Python, Conditional blocks
(8)
using if, else and elif ,Simple for loops in python, For loop using ranges, string, list and
dictionaries, Use of while loops in python, Loop manipulation using pass, continue, break
and else.
Python Functions and Data Structures
Function Specifications, Global Variables, Modules, Passing parameters to Functions,
Recursive functions, System functions and Parameters, importing modules, Lambda (9)
function in python, Python String, List, Tuple, Set, And Dictionary Manipulations,
Programming using string, list, tuple, set and dictionary in built functions
File Handling
Opening a file, Understanding read functions: read(), readline() and readlines(),
Understanding write functions: write() and writelines(), appending data to a file, closing (6)
files, Manipulating file pointer using seek, Programming using file operations.

B.E INFORMATION TECHNOLOGY, 2018-22 30 | P a g e

 SECTION-B

Python Object Oriented Programming

Oops Concept of class, object and instances, Constructor, class attributes and destructors, (8)
Method overloading in python, Operator overloading, Inheritance.
Python Regular Expression and Exception Handling
Special symbols and characters for Regular expressions, Pattern matching and searching,
Pattern searching using regex, Validation using regular expressions, What is exception, (8)
Handling an exception, try…except…else, try-finally clause, Argument of an exception,
Python standard exception, Raising an exception, User-defined exceptions
Python Database Connectivity
Introduction, SQL Database connection using python, Creating and searching tables,
(6)
Reading and storing config information on database, Programming using database
connections.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1. Core Python Applications Programming, Wesley J Chun Pearson
Third Edition Publication
2. Beginning Python: Using Python 2.6 and James Payne Wrox Publication
Python 3.1
3 Core Python Programming R. Nageswara Rao Dreamtech

4 Core Python Programming Wesley J Chun Prentice Hall

5 Programming and Problem Solving with Ashok Namdev Kamthane, Mcgraw Hill
Python Amit Ashok Kamthane Education

COURSE INFORMATION SHEET

Course Code IT505c

Course Title Python Programming (Practical)
Type of Course Professional Elective-I
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Programming Concepts.
Course Objectives
1. Understand and comprehend the basics of
Python programming.
2. Develop real-world applications using
OOPs, files, exception handling and
database connectivity provided by python.
SYLLABUS

Practical based on theory

B.E INFORMATION TECHNOLOGY, 2018-22 31 | P a g e

 COURSE INFORMATION SHEET

Course Code IT506

Course Title Industrial Training (After 4th Semester)
Type of Course Core
LT P 000
Credits 2
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites • Nil
Course Objectives 1. To enable students to integrate
theoretical knowledge with practical
implementation.
2. To introduce students to the work
culture of industry and provide
opportunity to get hands-on
experience to real world problems.
Course Outcomes After completion of this course, the students
will be able to:
1. Analyze practical aspects of a problem
and formulate required specification.
2. Apply knowledge of recent
technologies to design and implement
solution for a real life problem.
3. Document and report the project
undertaken during training.

B.E INFORMATION TECHNOLOGY, 2018-22 32 | P a g e

 SYLLABUS FOR B.E. (I.T.) SIXTH SEMESTER

COURSE INFORMATION SHEET

Course Code IT601

Course Title Data Warehouse and Data Mining
Type of Course Core
LT P 403
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment 50
(University Exam.) 50
Continuous Assessment
(Sessional)
Course Prerequisites Database Management Systems
Course Objectives The objective of the course is to build the foundations of
data warehousing and data mining concepts and techniques
so as to use this knowledge to solve simple problems. This
course covers the methodologies, technologies, and
algorithms of data mining and data warehousing from a
variety of perspectives
Course Outcomes After completion of this course, the students will be able to:
1. Understand the basic concepts and architecture of a
data warehouse.
2. Analyze enterprise requirements and design schema for
a data warehouse.
3. Understand data and apply suitable data preprocessing
techniques
4. Design solutions using data mining functionalities for
solving practical problems.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Introduction to Data Warehousing (3)

Data Warehousing Definition and characteristics, need for data warehousing, DBMS
vs. data warehouse, OLAP.
Data Warehousing Components (5)
Overall Architecture, Data Warehouse Database, Sourcing Acquisition, Cleanup and
Transformation Tools, Metadata Access Tools, Data Marts, Data Warehouse
Administration and Management, Information Delivery Systems.
Mapping the Data Warehouse to a Multiprocessor Architecture (5)
Relational Database Technology for Data warehouse, Database Architectures for
Parallel Processing, Parallel RDBMS features, Alternative Technologies, Parallel
DBMS Vendors.
B.E INFORMATION TECHNOLOGY, 2018-22 33 | P a g e
 Introduction to Data Mining (8)
Functionalities, classification data mining systems, Multidimensional data model, data
cubes, Schemas for multidimensional databases, OLAP operations, Data Marts,
Metadata

SECTION-B

Data Preprocessing (7)

Data cleaning, integration and transformation, Data reduction, Discretization and
Concept Hierarchy Generation.
ConceptDescription (6)
Data Mining techniques-Concept description, attribute oriented induction, analytical
characterization, mining class comparisons, mining descriptive statistical measures.
Association Rule Mining (8)
Mining single dimension rules from transactional databases, Apriori algorithm,
efficiency, mining rules without candidate generation.
Applications and Trends In Data Mining (3)
Commercial Importance of DW, applications of data mining, data mining in
business process, Embedded data mining.

RECOMMENDED BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1 Data Mining –Concepts & Techniques Jiawei Han & Micheline Morgan
Kamber Kaugmann
Publishers
2 Data Warehousing in the Real World Sam Anahory & Dennis Pearson Education
Murray
3 Data Mining Pieter Adrians, Dolf Addison Wesley,
Zantinge. 2000.

4 Data Warehousing, Data Mining and Alex Berson McGraw Hill.

OLTP

COURSE INFORMATION SHEET

Course Code IT601

Course Title Data Warehouse and Data Mining
(Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Database Management Systems
Course Objectives The objective of the course is to build the
foundations of data warehousing and data
mining concepts and techniques so as to use
this knowledge to solve simple problems.
SYLLABUS
Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 34 | P a g e

 COURSE INFORMATION SHEET

Course Code IT602

Course Title Agile Software Development (Theory)
Type of Course core
LT P 403
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment 50
(University Exam.) 50
Continuous Assessment (Sessional)
Course Prerequisites Introduction of Information Technology
Course Objectives 1. To understand the basic concepts of agile software
process.
2. To gain knowledge in the area of various Agile
Methodologies.
3. To know the principles of Agile Testing.
Course Outcomes After completion of this course, the students will be able to:
1. Define the practices and philosophies of Agile
methods.
2. Analyze the tradeoffs in selecting a software
engineering method.
3. Define and extend the usage of Scrum and extreme
Programming in software product development.
4. Understand about various testing methods used in
Agile.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.

SECTION-A Hours

Overview of Agile Software development (08)

Introduction: What is Agile?, Goals/Manifesto and principles, Key Features,
Challenges, Advantages and disadvantages, Agile usage, Agile Vs Traditional Software
development (Waterfall), Agile Software Development lifecycle.
Agile Design (6)
Agile Design Practices, Design smells and software rotting, SOLID Principles: SRP –
The Single Responsibility Principle, OCP – the Open Closed Principle, LSP – The
Liskov Substitution, DIP – The Dependency Inversion Principle, ISP – The Interface
Segregation Principle.
Agile Methodologies (9)
Scrum: Overview of scrum theory, Scrum Team, Scrum Roles, The Sprint, Sprint
Planning, Daily Scrum, Sprint review, Sprint retrospective, Scrum artifacts, Product
back log, sprint backlog, Progress Monitoring.
Extreme Programming(XP): Overview of XP, Concept, Values, Rules, Principles,
Scalability, Practices, Issues.
B.E INFORMATION TECHNOLOGY, 2018-22 35 | P a g e
 SECTION-B

Agile Project Management (10)

Overview of Agile project management, Agile project management model: Overview of
agile enterprise framework and agile delivery framework, Scaling and governing agile
projects. Tools for Agile project management
Agile Testing (12)
Introduction to agile testing, Principles for testers, Overview of organizational
challenges, The Agile testing Quadrants, Test Automation, The Agile lifecycle and its
impact on testing, Types of testing in agile : TDD, BDD, Acceptance tests Exploratory
testing, Risk based testing, Regression tests, Unit testing, Integration testing, system
testing, Tools to support the Agile Tester

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Agile Principles, Patterns, and Martin C. Robert, Prentice Hall, 2006
Practices in C# Martin Micah

2 Agile Project Management: Jim Highsmith Addison-Wesley

Creating Innovative Products, 2nd Professional, 2010
Edition

3 Agile Testing: A Practical Guide Janet Gregory, Lisa Addison-Wesley .

for Testers and Agile Teams Crispin

COURSE INFORMATION SHEET

Course Code IT602

Course Title Agile Software Development (Practical)

Type of Course Core

Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Introduction of Information Technology
Course Objectives To get exposure to various tools such as
AgileFant, JUnit.

SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 36 | P a g e

 COURSE INFORMATION SHEET

Course Code IT603

Course Title Theory of Computation (Theory)
Type of Course core
LT P 310
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University 50
Exam.) 50
Continuous Assessment (Sessional)
Course Prerequisites Discrete Structures
Course Objectives The objective of the course is to construct and prove the
equivalence of languages described by finite state
machines and regular expressions, pushdown automata
and Turing machines.
Course Outcomes After completion of the course, students will be able to
1. explain and interpret the fundamental, mathematical
and computational principles laying the foundation
of Computer science.
2. define and apply methods for the equivalence of
languages described by various types of automata
and their equivalent recognizable languages.
3. understand the key results in algorithmic complexity,
computability and solvability of problems.
4. design grammars and recognizers for different
formal languages

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.

SECTION-A Hours

Introduction to the Theory of Computation (2)

Basic concepts – Languages, Grammars, Automata, Strings, Alphabet, Chomsky
Classification of Grammars and Languages.
Finite Automata
Finite automation model, Acceptance of strings and language, Deterministic Finite
Automaton, Non Deterministic Finite Automaton (NDFA), Equivalence of NDFA and
(10)
DFA, Conversion of NFA into DFA, Minimization of Number of States in Finite
Automata, equivalence between two FSMs, Moore and Mealy machines. Conversion of
Mealy to Moore machine, Conversion of Moore to Mealy machine.
Regular expressions and regular languages (10)
Regular Expressions, Identities for Regular Expressions, Finite Automata and Regular
Expressions, Transition System Containing null moves, NDFAs with null moves and

B.E INFORMATION TECHNOLOGY, 2018-22 37 | P a g e

Regular Expressions, Eliminating epsilon-Transitions, Algebraic Method Using Arden’s
Theorem, Construction of Finite Automata Equivalent to a Regular Expression, Equivalence
of Two Finite Automata, Equivalence of Two Regular Expressions , Closure Properties of
Regular Languages under Simple Set Operations ((proofs omitted) , Identifying Non regular
Languages using Pumping Lemma.

SECTION-B

Context free grammar and Pushdown Automata (10)

Context-free Languages and Derivation Trees, Ambiguity in Context-free Grammars,
Simplification of Context-free Grammars, Construction of Reduced Grammars, Elimination of
Null Productions, Elimination of Unit Productions, Normal Forms for Context-free Grammars,
Chomsky Normal Form, Greibach Normal Form, Pumping Lemma for Context-free
Languages, Pushdown Automata - Basic Definitions, Acceptance by pushdown automata,
Pushdown Automata and Context-free Languages, Parsing and pushdown automata, Top-down
Parsing Using Deterministic pushdown automata, Bottom-up Parsing .
Turing Machines Linear Bounded Automata (11)
Turing Machine Model, Representation of Turing Machines, Language Acceptability by Turing
Machines, Design of Turing Machines, Techniques for TM Construction -Turing Machine
with Stationary Head, Storage in the State, Multiple Track Turing Machine, Subroutines,
Variants of Turing Machines (proofs omitted) – Multi tape Turing Machines,
Nondeterministic Turing Machines, The Model of Linear Bounded Automaton (LBA),
Relation Between LBA and Context-sensitive Languages, Turing Machines and Type 0
Grammars .
Undecidability (2)
Undecidability, Introduction to recursive & non-recursive enumerable languages, Universal
Turing machine

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Theory of computation Mishra &Chandrashekharan PHI Learning Pvt.

Ltd
2 Introduction to automata Hopcroft H.E. & Ullman Pearson/Addison
theory, languages and Wesley
computation
3 An introduction to Peter linz Jones & Bartlett
formal languages and Learning
automata
4 Introduction to John C Martin McGraw-Hill
languages and the
theory of automata
5 Elements of theory of H.P. Lewis and C.H. Prentice-Hall
computation papadimition

B.E INFORMATION TECHNOLOGY, 2018-22 38 | P a g e

 COURSE INFORMATION SHEET

Course Code IT604

Course Title Artificial Intelligence (Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Data Structures, Discrete Structures
Course Objectives To introduce the essential principles, ideas
and techniques of Artificial Intelligence (AI),
so that it can be used to solve real world
problems.
Course Outcomes After completion of this course, the students
will be able to:
1. Understand the various problem
solving techniques of Artificial
Intelligence.
2. Utilize knowledge representation
concepts for inference-based problem
solving.
3. Understand various Planning
problems, algorithms and approaches.
4. Apply the knowledge base for
generating different applications for
intelligent decision making.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Introduction (06)
Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria of
success, Intelligent Agents, Nature and structure of Agents, Learning Agents.
Problem solving techniques (09)
State space search, control strategies, heuristic search, problem characteristics,
production system characteristics., Generate and test, Hill climbing, best first search,
A* search, Constraint satisfaction problem, Mean-end analysis, Min-Max Search,
Alpha-Beta Pruning, Additional refinements, Iterative Deepening.
Knowledge representation (08)
Mapping between facts and representations, Approaches to knowledge representation,
procedural vs declarative knowledge, Forward vs. Backward reasoning, Matching,
conflict resolution, Non-monotonic reasoning, Default reasoning, statistical reasoning,
fuzzy logic Weak and Strong filler structures, semantic nets, frame, conceptual
B.E INFORMATION TECHNOLOGY, 2018-22 39 | P a g e
dependency, scripts.

SECTION-B

Planning
The Planning problem, planning with state space search, partial order planning, (06)
planning graphs, planning with propositional logic, Analysis of planning approaches,
Hierarchical planning, conditional planning, Continuous and Multi Agent planning.
Learning (10)
Forms of Learning, inductive learning, Decision trees, Computational learning theory,
Logical formulation, knowledge in learning, Explanation based and relevance based
learning, statistical learning, Learning with complete data and hidden variables,
instance based learning, Neural Networks.
Introduction to Natural Language processing and Expert system (06)
Basic Tasks of Natural Language processing, Expert systems, Expert system examples,
Expert System Architectures, Rule base Expert systems, Non Monotonic Expert
Systems, Decision tree base Expert Systems.

RECOMMENDED BOOKS
S. No. NAME AUTHOR(S) PUBLISHER

1 AI: A Modern Approach Stuart J.Russel, Peter Pearson Education,

Norvig Latest Edition
2 Artificial Intelligence Elaine Rich, Knight McGraw Hill, 1993
3 Artificial Intelligence Partick Henry Winston Addison Wesley,
Latest Edition
4 Artificial Intelligence George Luger Pearson Education,
Latest Edition
5 Introduction to AI and Expert DAN, W. Patterson PHI, latest Edition
Systems
6 Principles of AI A.J. Nillson Narosa publications,
latest Edition

B.E INFORMATION TECHNOLOGY, 2018-22 40 | P a g e

 COURSE INFORMATION SHEET

Course Code IT604

Course Title Artificial Intelligence(Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Data Structures, Discrete Structures
Course Objectives This course provides an introduction to the
fundamentals of artificial intelligence. It contains a
theory component about the concepts and principles that
underlie modern AI algorithms, and a practice
component to relate theoretical principles with practical
implementation.
SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 41 | P a g e

 Professional Elective-II
COURSE INFORMATION SHEET

Course Code IT605a

Course Title Advanced Computer Networks (Theory)
Type of Course Professional Elective-II
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Introduction to Information Technology,
computer network.
Course Objectives The aim of the course is to provide students
with an advanced & deep knowledge on
relevant computer networking topics The main
course objectives are:
1. Familiarize the student with the new
advance topics of computer networks.
2. Give deep knowledge of various
existing protocols for data
communication in
computer networks.
Course Outcomes After completion of this course, the students
will be able to:
1. Apply the basic knowledge of computer
network topics to understand the
advance about those topics
2. Understand new advance topics like
resource Management and QoS etc.
3. Learn the functioning of network and
transport layer in deep.
4. Understand the functioning of wireless
network protocols and Security in
depth.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Introduction (5)
Overview of computer networks, seven-layer architecture, TCP/IP suite of protocols, etc.

Medium Access (5)

MAC protocols for high-speed LANS, MANs, and wireless LANs. (For example, FDDI,
DQDB, HIPPI, Gigabit Ethernet, Wireless ethernet, etc.)
B.E INFORMATION TECHNOLOGY, 2018-22 42 | P a g e
Internetworking and Routing (7)
Packet Switching, The Internetworking Problem, The IP/TCP split connections, Scaling IP,
Routers: Forwarding and Routing, The IP forwarding path, Unicast Internet routing: Intra
and Inter domain routing, Router Design and Implementation, Security problems with
Internet Architecture, IPV6
Resource Management (6)
End-to-End Congestion Control, Router-Assisted Congestion Control: Active Queue
Management, Fair Queuing and Variants, Modeling and Measurement: Packet Trains, TCP
Congestion Control Impediments, Adaptive Network Applications.

SECTION-B

Quality Of Service (QOS) (4)

Why QoS; Basic Models and Architecture, Mechanisms and Properties, Modeling and
Measurement: Traffic Self-Similarity; Virus Propagation.

Group Communication (5)

Multicast Routing and Transport, IP Multicasting: Multicast routing protocols, address
assignments, session discovery etc., Multicasting in mobile networks.

Transport Layer Protocol (5)

TCP protocol dynamics, TCP extensions for high-speed networks, transaction-oriented
applications. Other new options in TCP.

Wireless Networks (3)

Wireless LAN architecture, Mobile IP, Broadcast file system, Agent technology, Satellite
technology.
Security (5)
Network security at various layers. Secure-HTTP, SSL, ESP, Authentication header, Key
distribution protocols. Digital signatures, digital certificates.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Computer Networks, 4th Edition Andrew S. Tanenbaum Prentice Hall
of India
2 Data and Computer Communications William Stallings Prentice Hall
of India
3 Data Communication and Networking Behrouz A Forouzan Tata McGraw
Hill
4 Design & Analysis of Computer Vijay Ahuja McGraw Hill
Communication Networks
5 Data Communications and Networks Douglas E. Coomer Prentice Hall
of India

B.E INFORMATION TECHNOLOGY, 2018-22 43 | P a g e

 COURSE INFORMATION SHEET

Course Code IT605b

Course Title Computer Graphics (Theory)
Type of Course Professional Elective-II
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Data Structures
Course Objectives The objective of the course is to build the
foundation of digital image generation
concepts and techniques so as to use this
knowledge for building graphics
applications. The course covers computer
graphics hardware, software, outputs
primitives and graphics processing
algorithms.
Course Outcomes After completion of this course, the students
will be able to:
1. Understand the principles of interactive
graphics IO devices and study the
applications of computer graphics.
2. Learn various graphics primitives and
apply operations like transformations in
2D and 3D.
3. Analyze and implement the concepts
of 2D viewing and clipping.
4. Design and implement algorithms for
building computer graphics applications.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Overview of Graphics System (07)

Applications of computer graphics, Picture representation, color table ,Video Display
Devices: Direct View Storage Tubes, Flat Panel Displays: Emissive
andNonEmissiveDisplays; Plasma Panel, Thin Film Electroluminescent and Liquid
CrystalDisplays, Color Display Techniques: Shadow Mask and Beam-penetration
Methods, ThreeDimensional Viewing Devices, Raster Scan Systems, Random
ScanSystems, Display Processor, Co-ordinate Representations, Screen Coordinates
Input Devices.

B.E INFORMATION TECHNOLOGY, 2018-22 44 | P a g e

Output primitives (07)
Scan conversion, Frame buffer, Point and Lines, Line Drawing Algorithms: DDA
Algorithm, Bresenham’s Line Algorithm, Circle Generating Algorithm: Midpoint circle
algorithm, Pixel Addressing and Object Geometry, Scan-Line Polygon Fill Algorithm,
Inside-Outside Tests, Boundary-Fill Algorithm, Flood-Fill Algorithm, Antialiasing and
Halftoning, Character Generation.

Two Dimensional Geometric Transformations and Viewing (08)

Basic Transformations: Translation, Rotation ,Scaling, Reflection and Shear, Inverse
transform, Composite Transformation Matrix, Viewing Pipeline, Window to Viewport
Coordinate Transformation, Clipping Operations: Line, Polygon, Segments: creation
and storage.

SECTION-B

Three Dimensional Concepts, Transformations and Viewing (09)

Three Dimensional Display Methods, Three Dimensional Transformations;
ThreeDimensional Viewing Pipeline; Viewing Coordinates; Specifying the View Plane,
Projections: Parallel Projections, Perspective Projections.
Splines and Curves (07)
Curved Lines and Surfaces, Spline Representations, Cubic Splines, Bezier Curves and
theirproperties, B-Spline Curves.
Visible Surface Detection Methods (07)
Classification of Visible Surface Detection Methods, Back Face Detection, Depth
Buffer,A-Buffer, Scan Line and Depth-Sorting Methods, Wireframe Methods.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Computer Graphics C Version Donald Hearn, M.P. Baker Pearson

Education
2 Principle of interactive Computer Newman and Sproul McGraw Hill
Graphics, 2nd Edition
3 Graphics, A programming Approach, Steven Harrington Tata McGraw
2nd Edition Hill
4 Mathematical Elemants of Computer Rogar and Adams McGraw Hill
Graphics, 2nd Edition
5 Introduction to Computer Graphics, 1st N.Krishnamurthy Tata McGraw
Edition Hill

B.E INFORMATION TECHNOLOGY, 2018-22 45 | P a g e

 COURSE INFORMATION SHEET

Course Code IT605c

Course Title Advanced Cryptography
Type of Course Professional Elective-II
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Network Security and Cryptography
Course Objectives 1. To understand advanced features of
Cryptography and Network Security.
2. To be able to secure a message over
in secure channel by various means.
3. To learn about how to apply biometrics
and steganography over data.
4. To understand various protocols for
network security to protect against the
threats in the networks.
Course Outcomes After completion of this course, the students
will be able to:
1. Apply cryptography for
dataconfidentiality, integrity,
authentication
as well as for key distribution and e-mail
security.
2. Analyze the working of various advanced
security controls, techniques and
standards to combat attacks on web,
wired and wireless networks.
3. Describe the various access
controlmodels applicable for information
security.
4. Apply emerging topics such as
Steganography, Biometrics for
Information security.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

B.E INFORMATION TECHNOLOGY, 2018-22 46 | P a g e

 SECTION-A Hours

Number Theory and Public-Key Encryption

Modular arithmetic, Multiplicative inverse modulo n, Euclid’s algorithm to find the
GCD, Extended Euclid algorithm, RSA algorithm – derivation of public/private keys (07)
and examples, Diffie-Hellman key exchange.
Key Distribution and Management (05)
Needham Schroeder protocol; Public-key certificates – steps to generate, contents of a
certificate, certificate revocation, classes of certificates, secure communication using
certificates; Key distribution (public keys and secret keys) using public-key authority
Kerberos – protocol steps, advantages and weaknesses.
Biometrics (04)
Biometric systems – identification vs. verification, performance metrics, basic blocks
of a biometric system, Comparison of biometric systems; Multi-biometric systems and
different levels of fusion; Cancelable biometrics.
Steganography (06)
Steganography Models, types (secret key, public-key), LSB-based substitution,
problem of collisions and solution; Information hiding in palette images, through
quantization using predictive coding, Information hiding through automated generation
of English texts using Context-free grammar (CFG)

SECTION-B

Access Control Models (08)

Mandatory access control model – Multi-level security in databases , Biba integrity
model, Bell LaPadula confidentiality model; Discretionary access control (DAC) –
UNIX file permissions; weakness of DAC; Dynamic access control model – Chinese
wall model: read and write rules; Role-based access control model (RBAC) and
hierarchical RBAC.
Email and Web Security (08)
PGP for authentication, confidentiality and both; Use of Radix-64 format for PGP; PGP
keys; S/MIME; DKIM standard, Cookies, Applets vs.ActiveX; Cross-site Scripting
(XSS) attacks – persistent and nonpersistent, XSS attacks and solutions, Cross-site
Request Forgery (XSRF) attacks and prevention strategies.
Email and Web Security (07)
PGP for authentication, confidentiality and both; Use of Radix-64 format for PGP; PGP
keys; S/MIME; DKIM standard, Cookies, Applets vs.ActiveX; Cross-site Scripting
(XSS) attacks – persistent and nonpersistent, XSS attacks and solutions, Cross-site
Request Forgery (XSRF) attacks and prevention strategies.

B.E INFORMATION TECHNOLOGY, 2018-22 47 | P a g e

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Principles of Cryptography, 4th Edition William Stallings Pearson
Education
2 Security in Computing, 2nd Edition Charles P.Pfleeger Prentice Hall
International
3 Cryptography & Network Security, 2nd Atul Kahate TMH
Edition
4 Applied Cryptography: Protocols, Bruce Schneier John Wiley
Algorithms, and Source Code in C, 2nd and Sons
Edition
5 Firewalls and Internet Security, 2nd Bill Cheswick and Steve Addison-
Edition Bellovin Wesley
6 Security Technologies for the world Rolf Oppliger Artech House,
wide web, 2nd Edition Inc

B.E INFORMATION TECHNOLOGY, 2018-22 48 | P a g e

 COURSE INFORMATION SHEET

Course Code IT605d

Course Title Software Engineering (Theory)
Type of Course Professional Elective -II
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Introduction to Information Technology
Course Objectives This course aims to give students a theoretical
foundation in software engineering. Students
will learn about the principles and methods of
software engineering, including current and
emerging software engineering practices and
support tools.
Course Outcomes After completion of this course, the students
will be able to:
1. Understand the concept of process
models.
2. Analyze the project management and
specification concepts.
3. Understand the concept of software
designing and testing.
4. To gain the knowledge about the
metrics measurements and CASE
tools.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION-A Hours

Introduction (05)
Introduction to Software Engineering, System Engineering Vs Software Engineering,
Software Evolution, Software Characteristics, Cost of Software Production, Software
Components, Crisis – Problem and Causes, Challenges in Software Engineering.
Software Process Model (06)
SDLC, Waterfall Model, Incremental Model, Prototyping Model, Evolutionary Model,
Spiral Model, Rapid Application Development Model, Formal Methods, Open Source
Development, Object Oriented Life Cycle Model, Agile Methods.
Project Management Concepts (06)
Management Activities, Project Planning, Project Scheduling, Size Estimation – LOC,
FP; Cost Estimation Models –COCOMO, COCOMO-II.
Software Requirements Analysis and Specification Concepts (05)
Requirement Engineering, Requirement Elicitation Techniques, Requirements

B.E INFORMATION TECHNOLOGY, 2018-22 49 | P a g e

Documentation, Characteristics and Organization of SRS, Analysis Principles, Analysis
Modeling – Data Modeling, Functional Modeling and Behavioral Modeling; Structured
vs. Object Oriented Analysis.

SECTION-B

Software Design and Coding Concepts (06)

Design Principles, Data Design, Architectural design, Interface Design, Component
Level Design, Object Oriented Design Concepts, Cohesion and Coupling and their
classification, top-down, bottom-up and middle-out design, Coding, Coding Standards,
Coding Conventions, Programming Style.
Testing (05)
Verification and Validation, Testing Process, Design of Test Cases, Software Testing
Strategies, Unit Testing, Integration Testing, Top Down and Bottom Up Integration
Testing, Alpha & Beta Testing, System Testing and Debugging.
Technical Metrics for Software (06)
Software Measurements: What and Why, A Framework for Technical Software
Metrics, Metrics for the Analysis Model, Metrics for Design Model, Metrics for Source
Code, Metrics for Testing, Metrics for Software Quality, Metrics for Maintenance.
CASE (Computer Aided Software Engineering) and Introduction to UML (06)
CASE and its Scope, Building blocks of CASE, CASE Tools, CASE Environment,
UML Concepts, Use Case Diagrams, Sequence Diagrams, Collaboration Diagrams,
Class Diagrams, State Transition Diagrams, Component and Deployment Diagrams.

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1 Software Engineering, 3rd Edition Ian Somerville Pearson
Education
2 S/W Engineering-A Practitioner's Roger S. Pressman McGRAW-
Approach, 6th Edition HILL
3 Software Engineering: Theory and S.L. Pfleeger, J.M. Atlee Pearson
Practice, Second Edition Education
4 Software Engineering for Students, Douglas Bell Pearson
Fourth Edition Education
5 Software Engineering Pankaj Jalote Narosa
Publisher
6 Software Engineering, Second Edition K.K. Aggarwal, Yogesh New Age
Singh International

B.E INFORMATION TECHNOLOGY, 2018-22 50 | P a g e

 SYLLABUS FOR B.E. (I.T.) SEVENTH SEMESTER

COURSE INFORMATION SHEET

Course Code IT701

Course Title Digital Signal Processing (Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Basics of Electronics Communication
Course Objectives (CO) 1. To understand how to analyze and
manipulate digital signals and have the
fundamental MATLAB programming
knowledge to do so.
2. To provide the student with the
necessary background for taking
advanced level courses in signal and
image processing.
Course Outcome After the completion of this course, the
students are able to:
1. Understand and learn the concept of
Digital Signal Processing, types of
digital signals/systems and their
implementation in MATLAB.
2. Analyze and implement z-transform,
Discrete Fourier Transform in
MATLAB.
3. Learn the structures of digital filters
and apply in designing them both
theoretically and in MATLAB

4. Understand the architecture and

features of Digital Signal Processors

SYLLABUS

Note: The Semester question paper of a subject be of 50 Marks having 7 questions of equal
marks. First question, covering the whole syllabus and having questions of conceptual
nature, be compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt at least two questions from each
section.

SECTION-A Hours

Introduction to Digital Signal Processing (04)

Applications and advantages of DSP. Sampling theorem, concept of frequency in
discrete time signals.

B.E INFORMATION TECHNOLOGY, 2018-22 51 | P a g e

Discrete Time Signals and Systems (08)
Classification of signals, standard signals and classification of discrete time systems.
Linear Time Invariant systems and their representation by difference equations and
structures.
Z- Transform (04)
Definition of direct, inverse z-transform and its properties. System functions of a LTI
system. Inverse z-transform by power series expansion and partial fraction expansion.

Frequency Analysis (08)

Fourier series and transform of discrete time signals and properties (DTFT). Discrete
Fourier Transform and its properties. Fast Fourier Transform algorithms, decimation in
time and decimation in frequency algorithms (radix 2).
SECTION-B
Realization of FIR & IIR Systems: (04)
Direct forms, cascade and parallel form IIR structures. Direct form, cascade and linear
phase FIR structures.
Design of Digital Filters: (12)
Comparison of Analog and Digital filters, Comparison of IIR and FIR filters.FIR
Filters and linear phase requirement. FIR filters design using the window technique.
IIR Filters and their design using the impulse invariance technique and bilinear
transformation. Finite word length effects.
DSP Processors (05)
Introduction to DSP Processors, architecture of TMS 320CXX and ADSP 21XX

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1. Digital Signal Processing: Principles, Proakis&Manolakis Pearson
Algorithms and Applications, 3rd Edition
2. Digital Signal Processing E C Ifeacher and B W Prentice Hall
Jervis
3. Digital Signal Processing, 1st Edition S Salivaharan, A Vallavraj, TMH
C Granapriya
4. Digital Signal Processing Sanjay Sharma S.K. Kataria&
Sons

PO a b c d e f g h i
CO

CO1 1 1 1

CO2 1 2 2 1 1

CO3 1 2 2 1 1

CO4 1 1 2 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 52 | P a g e

 COURSE INFORMATION SHEET

Course Code IT701

Course Title Digital Signal Processing (Practical)

Type of Course Core

Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Basics of Electronics Communication
Course Objectives To develop skills for analyzing and
synthesizing algorithms and systems that
process discrete time signals, digital and
analog filters with emphasis on realization
and simulation in MATLAB.

SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 53 | P a g e

 COURSE INFORMATION SHEET

Course Code IT702

Course Title Machine Learning
Type of Course Core
LT P 403
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Discrete Structures
Course Objectives The objective is to familiarize the students
with some basic learning algorithms and
techniques and their applications, as well as
general issues related to analyzing and
handling data.
Course Outcomes 1. To understand the fundamental
issues and challenges of machine
learning: data, model selection,
model complexity.

2. To learn the various machine

learning approaches and techniques

3. To apply various learning

algorithms to data

4. To analyze the underlying

mathematical relationships within
Machine Learning algorithms and
the paradigms of supervised and un-
supervised learning

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours

Introduction 02
Overview of machine learning, related areas, applications, software tools
Parametric regression 05
Linear regression, polynomial regression, locally weighted regression, numerical
optimization, gradient descent, kernel methods
Generative learning 05
Gaussian parameter estimation, maximum likelihood estimation, MAP estimation,
Bayesian estimation, bias and variance of estimators, missing and noisy features,
nonparametric density estimation, Gaussian discriminant analysis, naive Bayes

B.E INFORMATION TECHNOLOGY, 2018-22 54 | P a g e

 Discriminative learning 04
Linear discrimination, logistic regression, logit and logistic functions, generalized
linear models
Neural networks 07
The perceptron algorithm, multilayer perceptrons, backpropagation, multiclass
discrimination, training procedures, localized network structure, Support vector
machines
SECTION-B
Graphical and sequential models 08
Bayesian networks, conditional independence, Markov random fields, inference in
graphical models, belief propagation, Markov models, hidden Markov models,
decoding states from observations, learning HMM parameters
Unsupervised learning 06
K-means clustering, expectation maximization, Gaussian mixture density
estimation, mixture of naive Bayes, model selection
Dimensionality reduction 8 hrs
08
Feature selection, principal component analysis, linear discriminant analysis, factor
analysis, independent component analysis, multidimensional scaling

RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Elements of Statistical Learning T. Hastie, R. Springer, 2001
Tibshirani and J.
Friedman
2 Machine Learning E. Alpaydin MIT Press, 2010

3 Pattern Recognition and Machine C. Bishop Springer, 2006

Learning
4 Machine Learning: A Probabilistic K. Murphy MIT Press, 2012
Perspective
5 Pattern Classification R. Duda, E. Hart, Wiley-Interscience,
and D. Stork, 2000.
6 Machine Learning T. Mitchell McGraw-Hill, 1997

PO a b c d e f g h i
CO

CO1
2 1
CO2 2 1
CO3 2 2 1 1
CO4 2 2 2 1

B.E INFORMATION TECHNOLOGY, 2018-22 55 | P a g e

 COURSE INFORMATION SHEET

Course Code IT702

Course Title Machine Learning (Practical)

Type of Course Core

Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Artificial Intelligence
Course Objectives To develop skills for analyzing and
synthesizing algorithms and systems that
process discrete time signals, digital and
analog filters with emphasis on realization
and simulation in MATLAB.

SYLLABUS

Practical based on theory.

B.E INFORMATION TECHNOLOGY, 2018-22 56 | P a g e

 COURSE INFORMATION SHEET

Course Code IT703

Course Title Compiler Design (Theory)
Type of Course Core
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Computer Architecture and Organization
Course Objectives To provide the in-depth knowledge of
different concepts involved while designing a
compiler.
Course Outcomes After the completion of this course, the
students are able to:
1. Understand the working of complier
and translators.
2. Develop in-depth knowledge of major
stages of compiling.
3. Relate and analyze the concepts
learned earlier in their study like higher
level programming, assemblers,
automata theory and formal languages,
data structure and algorithms,
operating systems.
4. Apply the ideas, the techniques, and
the knowledge acquired for the
purpose of designing the compiler.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction (05)
Compilers and Translators; The phases of the compiler – Lexical Analysis, Syntax
Analysis, Intermediate Code Generation, Optimization, Code generation, Bookkeeping,
Error handling.
Lexical Analysis (05)
The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering,
Specifications of a token, Recognition of a tokens, Finite automata: Regular
expressions, NFA, DFA.Design of a lexical analyzer generator.
Syntax Analysis (12)
The role of a parser, Context free grammars, Writing a grammar, Top down Parsing:
Recursive decent parser, Predictive parser, Bottom up Parsing: Handles, Viable
prefixes, Operator precedence parsing, LR parsers: SLR, LALR, CLR. Parser generator
(YACC).Error Recovery techniques for different parsers.

B.E INFORMATION TECHNOLOGY, 2018-22 57 | P a g e

 SECTION-B
Syntax directed translation (04)
Syntax directed definitions, Synthesized and inherited attributes, Construction of
syntax trees.
Run time environments (06)
Source language issues (Activation trees, Control stack, scope of declaration, Binding
of names), Storage organization (Subdivision of run-time memory, Activation records),
Storage allocation strategies, Symbol tables: storage, data structures used.
Intermediate code generation (03)
Intermediate languages, Graphical representation, Three-address code, Implementation
of three address statements (Quadruples, Triples, Indirect triples).
Code optimization and code generation (10)
Introduction, Basic blocks & flow graphs, DAG, principle sources of optimization:
loop optimization, eliminating induction variable, eliminating common sub-expression,
loop unrolling, loop jamming etc., Issues in the design of code generator, a simple code
generator, Register allocation & assignment, Peephole optimization.

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1. Compilers: Principles, Techniques and Aho, Sethi and Ullman Pearson
Tools Education
2. Principles of Compiler Design Aho, Ullman Narosa
Publication
3. Compiler Construction- Principles and Dhamdhere Macmillan,
Practice India
4. Compiler Design in C Holub PHI

PO a b c d e f g h i
CO

CO1
1 2 2
CO2 1 1 2 2 1
CO3 1 1 2 2 1 1
CO4
1 1 2 2 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 58 | P a g e

 Professional Elective-III
COURSE INFORMATION SHEET

Course Code IT704a

Course Title Internet of Things
Type of Course PrProfessional Elective-III
LTP 400
Credits 04
Total Lectures 45
Course Assessment Methods
End Semester Assessment (University
Exam.) 50
Continuous Assessment (Sessional) 50

Course Prerequisites Nil

Course Objectives 1. To understand the fundamentals of Internet of Things
2. To learn about the basics of IOT protocols
3. To build a small low cost embedded system using
Raspberry Pi
4. To apply the concept of Internet of Things in the real
world scenario

Course Outcomes Students will be able to

1. Understand the concepts of Internet of Things
2. Analyze basic protocols in wireless sensor network
3. Design IoT applications in different domain and be able to
analyze their performance using Rasperry Pi.
4. Deploy basic IoT applications connect to the cloud

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be compulsory,having
parts covering the whole syllabus. Three questions have to be set from section- A and three questions from
section-B of the syllabus. Candidate is required to attempt at least two questions from each part. All the
course outcomes must be covered by the question paper.

Section A Hours
Introduction to Internet of Things (IoT) (10)
Internet of Things,Characteristics of IoT, Physical Design, Logical Design, Functional blocks of IoT,
Communication models & APIs, IoT enabling Technologies, IoT Levels & Deployment Templates ,
Challenges in IoT

IoT & M2M (8)

Machine to Machine Architecture, Difference between IoT and M2M, SDN and NFV for IoT, SNMP protocol,
IoT system management using NETCONF-YANG, IoT reference model, Domain model - information model,
functional model, communication model

B.E INFORMATION TECHNOLOGY, 2018-22 59 | P a g e

 Section B

IoTProtocols (7)
Protocol Standardization for IoT, Efforts, M2M and WSN Protocols, SCADA and RFID Protocols,
Unified Data Standards ,IEEE 802.15.4, BACNet Protocol,Modbus, Zigbee Architecture.

Building IoT with RASPBERRY PI & Arduino (12)

Building IOT with RASPERRY PI,Logical Design using Python, IoT Physical Devices & Endpoints, IoT
Device-Building blocks ,Raspberry Pi programming Interfaces with Python, Other IoT Platforms like Arduino.
Case Studies (8)
Real world design constraints - Applications - Asset management, Industrial automation, smart grid, Commercial
building automation, Smart cities - participatory sensing - Data Analytics for IoT – Software & Management
Tools for IoT Cloud Storage Models & Communication APIs - Cloud for IoT - Amazon Web Services for IoT.

RECOMMENDED BOOKS

S no NAME AUTHOR(S) PUBLISHER

1. Internet of Things: A Hands-On Vijay Madisetti, Arshdeep Orient

Approach Bahga Blackswan
Private Ltd,2015
2 The Internet of Things in the Cloud: A Honbo Zhou CRC Press, 2012
Middleware Perspective
3 The Internet of Things – Key applications Olivier Hersent, David Wiley, 2012
and Protocols‖ Boswarthick, Omar Elloumi

PO a b c d e f g h i

CO

COI 2 1
COII 2 2 1 1
COIII 2 2 2 1 1 1
COIV 2 2 2 2 1 1 2 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 60 | P a g e

 COURSE INFORMATION SHEET

Course Code IT704b

Course Title Multimedia System (Theory)
Type of Course Professional Elective-III
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Introduction to Information Technology,
Course Prerequisites Computer Networks.
Course Objectives To gain an intuitive understanding of multimedia
concepts and design.
Course Outcomes After completion of this course, the students are
able to:
1.Understand the basics of multimedia such as
design issues, storage requirements and
interchange standards.
2. Explain the fundamentals of different media
such as digitization process, file formats, color
model.
3.Apply and analyze the standard
compression techniques on a given problem.
4.Outline the basics of multimedia
communication and distributed multimedia
systems.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.

SECTION A Hours
Introduction:
Multimedia and its types, Introduction to Hypermedia, Hypertext, Multimedia Systems:
(4)
Characteristics, Challenges, Desirable Features, Components and Applications, Trends
in Multimedia..
Multimedia Technology:
Multimedia Authoring Paradigms, Design Issues in Multimedia Applications,
Standardsfor Document Architecture: SGML (Standard Generalized Markup (6)
Language), ODA (Open Document Architecture); Multimedia Standards for Document
Interchange: MHEG (Multimedia Hypermedia Expert Group).
Storage Media :
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards, (4)
DVD and its standards, Multimedia Servers.
B.E INFORMATION TECHNOLOGY, 2018-22 61 | P a g e
Audio:
Basics of Digital Audio, Sample Rates, Bit Size, Nyquist's Sampling Theorem; Audio
(5)
File Formats; Introduction to MIDI (Musical Instrument Digital Interface): Components
of a MIDI System, Hardware Aspects of MIDI, MIDI Messages.

SECTION B
Images, Graphics and Videos:
Types of Color Models, Graphic/Image Data Structures, Graphic/Image File Formats, (4)
Types of Color Video Signals, TV Standards..
Image Compression:
Types of Redundancies, Classifying Compression Algorithms, Basics of Information
Theory, Entropy Encoding: Run-length Encoding, Pattern Substitution, Huffman
Coding, Huffman Coding of Images, Adaptive Huffman Coding, Arithmetic Coding, (9)
Lempel-Ziv-Welch (LZW) Algorithm, Source Coding Techniques: Transform Coding,
Frequency Domain Methods, Differential Encoding, Hybrid Coding: Vector
Quantization, JPEG Compression.
Audio Compression:
Simple Audio Compression Methods, Psychoacoustics Model, MPEG Audio (4)
Compression.
Video Compression:
Intra Frame Coding (I-frame), Inter-frame (P-frame) Coding, H.261 Compression,
(5)
MPEG Compression, MPEG Video, MPEG Video Bitstream, Decoding MPEG Video
in Software.
Multimedia Communication:
Building Communication Network, Application Subsystem, Transport Subsystem, (4)
QOS, Resource Management, Distributed Multimedia Systems.

RECOMMENDED BOOKS:

S. No. NAME AUTHOR(S) PUBLISHER

Multimedia Computing,
Ralf Steinmetz and
1. Communications and Pearson Education
KlaraNahrstedt
Applications
Prabhat K. Andleigh,
2. Multimedia System Design PHI
KiranThakkar
3. Multimedia Computing Li, Drew Pearson Education
4. Multimedia Communications Fred Halsall Pearson Education
Cengage Learning
5. Multimedia Systems ParagHavaldar, Gerard Medioni
Publication

B.E INFORMATION TECHNOLOGY, 2018-22 62 | P a g e

 PO a b c d e f g h i
CO

CO1 2 1

CO2 2 1

CO3 2 2 2 1

CO4 2 2 1

B.E INFORMATION TECHNOLOGY, 2018-22 63 | P a g e

 COURSE INFORMATION SHEET
Course Code IT704c
Course Title Cyber Security and Forensics

Type of Course Professional Elective-III

LT P 4-0-0
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Basic fundamental knowledge of Networking,
Web Application, Mobile Application
Course Objectives 1. To teach students about the various
forms of cybercrimes and
fundamentals of cyber forensic
technology
2. Introduce students to the different
techniques used to collect, preserve
and recover evidences

Course Outcomes 1. Understand and identify various forms

of cyber crimes.

2. Learn the aspects of cybercrimes in

mobile and wireless devices.

3. Analyze the various tools and methods

used in cybercrimes along with legal
perspectives .

4. Examine various forensics techniques

and tools.

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
(8)
Introduction to Cybercrime
Introduction, Classifications of Cybercrimes: E-Mail Spoofing, Spamming, Cyber
defamation, Internet Time Theft, Newsgroup Spam/Crimes from Usenet Newsgroup,
Industrial Spying/Industrial Espionage, Hacking, Online Frauds, Pornographic Offenses
, Software Piracy, Password Sniffing, Credit Card Frauds and Identity Theft. Cyber
offenses: How Criminals Plan that attack, Categories of Cybercrime, How Criminals
Plan the Attacks: Passive Attack, Active Attacks, Scanning/Scrutinizing gathered
Information, Attack (Gaining and Maintaining the System Access), Social Engineering,
Cyberstalking, Cybercafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack
Vector and Cloud Computing.

B.E INFORMATION TECHNOLOGY, 2018-22 64 | P a g e

Cybercrime: Mobile and Wireless Devices
Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit (5)
Card Frauds in Mobile and Wireless Computing Era, Security Challenges Posed by
Mobile Devices, Registry Settings for Mobile Devices, Authentication Service
Security, Attacks on Mobile/Cell Phones,Mobile Devices: Security Implications for
Organizations, Organizational Measures for Handling Mobile, Organizational Security
Policies and Measures in Mobile Computing Era and Laptops.
(12)
Tools and Methods Used in Cybercrime
Introduction, Proxy Servers and Anonymizers, Phishing, Password Cracking,
Keyloggers and Spywares, Virus and Worms, Trojan Horses and Backdoors,
Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Overflow, Attacks on
Wireless Networks. Phishing and Identity Theft: Introduction, Phishing, Identity Theft
(ID Theft): Types of Identity Theft, Techniques of ID Theft, Identity Theft
Countermeasures, How to Protect your Online Identity.

SECTION-B
(5)
Cybercrimes and Cybersecurity: The Legal Perspectives
Introduction, Why Do We Need Cyberlaws: The Indian Context, The Indian IT Act,
Challenges to Indian Law and Cybercrime Scenario in India, Consequences of Not
Addressing the Weakness in Information Technology Act , Amendments to the Indian
IT Act, Cybercrime and Punishment, Cyberlaw, Technology and Students: Indian
Scenario.
(10)
Understanding Computer Forensics
Introduction, Historical Background of Cyberforensics, Digital Forensics Science, The
Need for Computer Forensics, Cyberforensics and Digital Evidence, Forensics Analysis
of E-Mail : RFC282, Digital Forensics Life Cycle, Chain of Custody Concept, Network
Forensics, Approaching a Computer Forensics Investigation, Setting up a Computer
Forensics Laboratory: Understanding the Requirements, Computer Forensics and
Steganography, Relevance of the OSI 7 Layer Model to Computer Forensics, Forensics
and Social Networking Sites: The Security/Privacy Threats, Challenges in Computer
Forensics, Special Tools and Techniques, Forensics Auditing and Antiforensics.

(5)
Forensics of Hand-Held Devices
Introduction, Hand-Held Devices and Digital Forensics, Toolkits for Hand-Held Device
Forensics: EnCase, Device Seizure and PDA Seizure, Palm DD, Forensics Card
Reader, Cell Seizure, MOBILedit!, ForensicSIM, Organizational Guidelines on Cell
Phone Forensics: HandHeld Forensics as the Specialty Domain in Crime Context .

RECOMMENDED BOOKS

B.E INFORMATION TECHNOLOGY, 2018-22 65 | P a g e

S. NAME AUTHOR(S) PUBLISHER
No.
1. Cyber Security: Understanding Cyber Nina Godbole, Sunit Wiley India
Crimes, Computer Forensics and Legal Belapur Publications (Latest
Perspectives ed).
2. Cyber Security Essentials James Graham, Richar CRC Press, Tailor
Howard,Ryan Olson, and Francis Group,
2011
3. Internet Forensics: Using Digital Robert Jones O’Reilly Media,
Evidence to Solve Computer Crime October, 2005.

4. Windows Forensics: The field guide for Chad Steel Wiley India
conducting corporate computer Publications,
investigations December, 2006.
5. Computer Forensics and Investigations Nelson Phillips and Cengage Learning,
Enfinger Steuart New Delhi, 2009.

6. Cyber Security and Global Information Kenneth J. Knapp, IGI Global, 2009.
Assurance: Threat Analysis and
Response Solutions

B.E INFORMATION TECHNOLOGY, 2018-22 66 | P a g e

 COURSE INFORMATION SHEET

Course Code IT704d

Course Title Software Project Management
Type of Course Professional Elective-III
LT P 400
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites
Course Objectives 1. To study the Introduction of project
management and its basic concepts and
techniques.
2. To understand how to calculate risk,
manage people, and to do resource
allocation.
Course Outcomes After completion of this course, the students
are able to:
1. Understand and practice the process
of project management and its
application in delivering successful
IT projects

2. Evaluate a project to develop the

scope of work , provide accurate cost
estimates and to plan the various
activities

3. Apply risk management analysis

techniques to identify risks in project
and effect of risk on project
timescales

4. Identify the resources required for a

project and to produce a work plan
and resource schedule and to
understand how different
management and development
practices affect software and process
quality

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction to project management: (08)

B.E INFORMATION TECHNOLOGY, 2018-22 67 | P a g e

Introduction, Importance of software project management, Project and different types
of project,
Problems with software projects, Environmental Appraisal with Projects, Requirement
Specification, Management Control, Steps in project planning.
Programme management and project evaluation: (08)
Programme Management, Managing resources within programme, Strategic
programme management, Aids to programme management, Evaluation / Assessment of
projects, Cost-benefit Analysis, Cash flow forecasting, Cost-benefit evaluation
techniques, Risk evaluation
Project approach and Software effort estimation: (10)
Selection of an appropriate project technology, Choice of process model, Data
Structure, Delivery Model, Basis for software estimation, Problem with over and under
estimates, Estimation Techniques, Expert judgment, Albrecht Function Point Analysis,
Function points Mark II, COSMIC Function point, COCOMO Model
SECTION-B
Activity Planning: (03)
Objective of Planning, Project Schedule, Activities – Sequencing and Scheduling,
Development of Project Network, Time Estimation, Forward and backward Pass,
Critical Path and Activities.
Risk Management: (03)
Risk, Risk categories, identification, assessment, planning, management PERT and
CPM Models, Monte Carlo Simulation
Resource Allocation, Monitoring and Control: (08)
Resources, Nature of Resources, Resource Requirement, Scheduling, Counting and
Costing, Monitoring Framework, Cost Monitoring, Earned Value Analysis, Project
targets, Change Control Management
Managing people and organizing teams: (05)
Management Spectrum, Associating human resource with job, Motivation, Oldham- job
Characteristics Model, Decision Making, Leadership, Stress, Health and Safety.

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1 Software Project Management Bob Hughes & Mike Tata McGraw
Cotterell Hill
Publication
2 Projects – Planning, Analysis, Selection, Prasanna Chandra 6th, Tata
Financing, Implementation and Review McGraw Hill
Publication
3 Project Management JeffreyPinto Pearson
Publications

PO
a b c d e f g h i
CO
CO1 2 1 2

CO2 1 2
CO3 1 1 2
CO4 1 2
B.E INFORMATION TECHNOLOGY, 2018-22 68 | P a g e
 COURSE INFORMATION SHEET
Course Code IT705
Course Title Project-1
Type of Course PSI
LT P 006
Credits 03
Course Assessment Methods:
End Semester Assessment (University Exam.) 06
Continuous Assessment (Practical) 100
Course Prerequisites Nil
Course Objectives 1. Students learning skills to tackle realistic
problems as they would be solved in the
real world.
2. Teachers serving as facilitators help in
clarity of objectives to be achieved.
3. Students (usually, but not always)
working in pairs or groups.
Course Outcomes After the completion of this course, the
students are able to:
1. Understand the requirements for real
life engineering and societal
problems.
2. Analyze and apply skills and
knowledge to solve real life problem.
3. Demonstrate interpersonal skills and
ability of team work and
documentation and reporting.

PO
a b c d e f g h i
CO
CO 1 1 2 1 2 1 1 2

CO2 2 2 1 2 1 1 1

CO3 1 1 1 2 1 2

B.E INFORMATION TECHNOLOGY, 2018-22 69 | P a g e

 COURSE INFORMATION SHEET

Course Code IT706

Course Title Industrial Training (after 6th Semester)
Type of Course PSI
LT P 000
Credits 02
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Nil
Course Objectives 1. To enable students to integrate theory
with practice.
2. To introduce students to work culture
and industrial practices.
3. To provide opportunity to students to
hands on current problems industrial
practitioners are dealing with.
Course Outcomes After the completion of this course, the
students are able to:
1. Analyze practical aspects of a
problem and designing its solution.
2. Apply skills and knowledge of recent
technologies to implement solution for
a real life problem.
3. Demonstrate interpersonal skills and
ability of team work and
documentation and reporting.

PO a b c d e f g h i

CO

CO1 2 1 2 1 1

CO2 1 2 2 2

CO3 1 2 1 2

B.E INFORMATION TECHNOLOGY, 2018-22 70 | P a g e

 SYLLABUS FOR B.E. (I.T.) EIGHTH SEMESTER

COURSE INFORMATION SHEET

Course Code IT801

Course Title Digital Image Processing (Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Computer Graphics, Digital Signal Processing
Course Objectives 1. To introduce students the significance of
digital image processing.
2. To apply the various algorithms to solve
different image processing problems.
Course Outcomes After the completion of this course, the
students are able to:
1. Understand and learn the basics of
image processing.

2. Learn& apply various image

enhancement filters and restoration
techniques.

3. Analyze basic image processing

functions that can help in
identifying boundaries, edges and
objects/regions in a given digital
image.

4. Implement algorithms to solve

different image processing
problems.

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours

Introduction to Image Processing: Digital Image representation, Sampling & (7)

Quantization, Steps in image Processing, Image acquisition, color image representation,
color models.
Image Transformation and Filtering: (12)
Intensity transform functions, histogram processing, Spatial filtering, fourier transforms
and its properties, frequency domain filters, Pseudo coloring, color transforms, Basics

B.E INFORMATION TECHNOLOGY, 2018-22 71 | P a g e

of Wavelet Transforms.
Image Restoration: (6)
Image degradation and restoration process, Noise Models, Noise Filters, degradation
function, Inverse Filtering, Homomorphic Filtering.

SECTION-B
Image Compression: (6)
Coding redundancy, Interpixel redundancy, Psycho-visual redundancy, Huffman
Coding, Arithmetic coding, Lossy compression techniques, JPEG Compression
Image Segmentation & Representation: (12)
Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough
transforms, Region Based Segmentation, Boundary representation, Boundary
Descriptors, Regional Descriptors
Object Recognition: (2)
Patterns and Patterns classes, Recognition based on Decision Theoretic methods

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1. Digital Image Processing Gonzalez and Woods Addison Wesley
1992
2. Computer Vision - A First Gurse 2nd Boyle and Thomas Blackwell
Edition Science 1995
3. Introductory Techniques for 3-D Trucco&Verri Prentice Hall,
Computer Vision Latest Edition
4. Introductory Computer Vision and Image Low McGraw-Hill
Processing 1991
5. Machine Vision Jain, Kasturi and Schunk McGraw-HiII.
1995
6. Image -Processing, Analysis and Sonka, Hlavac, Boyle PWS
Machine Vision 2nd edition Publishing,1999

PO
a b c d e f g h i
CO

CO1 2 1 1

CO2 2 2 1 2

CO3 1 1 2 2 2

CO4 1 1 2 2 1

B.E INFORMATION TECHNOLOGY, 2018-22 72 | P a g e

 COURSE INFORMATION SHEET

Course Code IT 801

Course Title Digital Image Processing (Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Programming Fundamentals, Digital Signal
Processing
Course Objectives I. To develop an overview of the field of
image processing, understand the
fundamental algorithms.
II. To implement, prepare and read the
current image processing research
literature, gain experience in applying
image processing algorithms to real
problems.

SYLLABUS

Practical should be covered based on the following directions:

1. Reading and displaying images in different formats using different color models.

2. Converting color images into monochrome images, Image color enhancements using

3. Pseudo coloring techniques.

4. Images enhancements using grey level transformations

5. Images enhancements in spatial domain

6. Images enhancements in frequency domain.

7. Image Noise removal and inverse filtering of images

8. Point, Line, Edge and Boundary Detections in images

9. Histogram Processing on images

10. Boundary Linking, Representation and Description techniques on images

11. Thresholding of Images.

Note: Students are required to complete any 10 practicals by implementing them in any of the
programming language such as Java, C/C++, C#, MATLAB.

B.E INFORMATION TECHNOLOGY, 2018-22 73 | P a g e

 COURSE INFORMATION SHEET

IT802
Course Code
Course Title Embedded System Design (Theory)
Type of Course Core
LT P 313
Credits 04
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Microprocessor & Assembly Language Programming,
Computer Architecture &Organization
Course Objectives 1. To introduce students to the embedded systems, its
hardware (micro-controllers) and software.
2. To explain real time operating systems, inter-task
communication and an exemplary case of RTOS.
Course Outcomes After the completion of this course, the students are able
to:
1. Understand the concept and features of
Microprocessors & Microcontrollers, Embedded &
external memory devices, CISC & RISC processors,
Harvard & Von Neumann Architectures.
2. Learn and understand the architecture, addressing
modes, instructions interrupts, timers/counters, serial
communication and applications of 8051
Microcontroller and apply and evaluate 8051 based
solutions to real problems
3. Explain the features, architecture, memory
organization, instructions, addressing Modes and
applications of PIC 16C6X/7X Microcontroller.
4. Describe the evolution of architectures used for
Embedded Software Development and apply to real-
time system’s design.

SYLLABUS

Note: The Semester question paper of a subject will be of 50 Marks having 7 questions of equal
marks. First question, covering the whole syllabus and having questions of conceptual nature, be
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each section.

B.E INFORMATION TECHNOLOGY, 2018-22 74 | P a g e

 SECTION-A Hours

Introduction to Microcontrollers (04)

Comparison of Microprocessors and Microcontrollers. Embedded and external memory
devices, CISC and RISC processors, Harvard and Von Neumann Architectures.

Overview of 8 bit Microcontrollers (19)

Overview of 8051, Architecture, addressing modes and instructions. Interrupts, Timer/
Counters, Serial Communication and applications. Interfacing Overview of Atmel 89C51
microcontroller.
SECTION-B
(12)
PIC Microcontrollers
Introduction and features, PIC 16C6X/7X: Architecture, Registers, Reset actions, Memory
Organization, Instructions, Addressing Modes, I/O Ports, Interrupts, Timers, ADC. Input
Capture, Output Compare, Frequency Measurement, Serial I/O Device
(06)
Software Development & Tools
Embedded System Evolution Trends, Round Robin, Round Robin with Interrupts, Function
Scheduling architecture, Real Time scheduling: their development, applications and
examples.
(04)
Real Time Operating Systems
RTOS Architecture, Task and Task States, Tasks and Data, Semaphores and shared data,
Operating System Services: message queues, timer function, events, memory management,
interrupt Routines in an RTOS environment, Basic Design Using RTOS

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1. The 8051 Microcontroller and Muhammed Ali Mazidi, Pearson 2nd
Embedded Systems Janice GillispieMazidi and Edition
Robin D. Mckinlay
2. The 8051 Microcontroller: Kenneth J. Ayala Pearson 2nd
Architecture, Programming & Edition
Applications
3. Microcontrollers ( Theory and Ajay Deshmukh TMH
Applications ) Publishers
4. An Embedded Software Primer David E. Simon Addison
Wesley
5. Specification and Design of Embedded D. D. Gajski, F. Vahid, S. Prentice Hall
Systems, Latest Edition Narayan, J. Gong

B.E INFORMATION TECHNOLOGY, 2018-22 75 | P a g e

 a b c d e f g h i

PO

CO

CO1 1 1 1

CO2 1 2 2 1 1 2

CO3 1 2 2 1 1 2

CO4 1 2 2 1 1 2

COURSE INFORMATION SHEET

Course Code ITE 802

Course Title Embedded System Design (Practical)
Type of Course Core
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Microprocessor & Assembly Language
Programming
Course Objectives To design, implement, test and document the
microprocessor-based systems.

SYLLABUS

Practical based on theory.

Professional Elective-IV
B.E INFORMATION TECHNOLOGY, 2018-22 76 | P a g e
 COURSE INFORMATION SHEET

Course Code IT803a

Course Title Cloud Computing (Theory)
Type of Course Professional Elective-IV
LT P 3-1- 0
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Operating System , Computer Networks
Course Objectives 1. To understand the basics of Cloud
Computing, different deployment models and
service models of Cloud.
2. To have an overview about the Public cloud
and Private cloud, and the security issues
related to Cloud computing.
Course Outcomes After the completion of this course, the students
will be able to:
1. Illustrate the concepts of Cloud
Computing and the various deployment
and service models of Cloud Computing.
2. Demonstrate the functioning of Private
and Public Cloud.
3. Describe the security concerns of Cloud
Computing.
4. Understand the need of cloud computing
in industry domains and current
challenges and future directions of cloud
computing.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
SECTION-A Hours

Overview of Cloud Computing: (04)

Brief history and evolution - History of Cloud Computing, Evolution of Cloud
Computing, Traditional vs. Cloud Computing. Why Cloud Computing, Cloud service
models (IaaS, PaaS& SaaS). Cloud deployment models (Public, Private, Hybrid and
Community Cloud), Benefits and Challenges of Cloud Computing.
Understanding Virtualization (04)
Basics of virtualization, Virtualization technologies, Server virtualization, VM migration
techniques, Role of virtualization in Cloud Computing.
Working with Private Cloud: (09)
Private Cloud Definition, Characteristics of Private Cloud, Private Cloud deployment
models, Private Cloud Building blocks namely Physical Layer, Virtualization Layer,
Cloud Management Layer, Challenges to private Cloud, Virtual Private Cloud.
Implementing private cloud (one out of CloudStack, OpenStack, Eucalyptus, IBM or

B.E INFORMATION TECHNOLOGY, 2018-22 77 | P a g e

Microsoft)

Working with Public Clouds: (08)

What is Public Cloud, Why Public Cloud, When to opt for Public Cloud, Public Cloud
Service Models, and Public Cloud Players. Infrastructure as a Service Offerings (IaaS),
PaaS offerings, Software as a Service Offering (SaaS). Implementing public
cloud (one out of AWS, Windows Azure, IBM or Rackspace)

SECTION-B
Overview of Cloud Security: (06)
Explain the security concerns in Traditional IT, Introduce challenges in Cloud
Computing in terms of Application Security, Server Security, and Network Security.
Security reference model, Abuse and Nefarious Use of Cloud Computing

Overview of Multi-Cloud Management Systems & Business Cloud: (10)

Explain concept of multi-cloud management, Challenges in managing heterogeneous
clouds, benefits and advantages of multi-cloud management systems. Cloud Computing
in Business, Clouds focused on industry domains (Life Sciences and Social networking)
Introduction of Business Intelligence on cloud and Big Data Analytics on Cloud

Future directions in Cloud Computing (04)

Future technology trends in Cloud Computing with a focus on Cloud service
models, deployment models, cloud applications, and cloud security, Current issues in
cloud computing leading to future research directions.

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1. Cloud Computing: Principles and RajkumarBuyys, James Wiley, 2011
Paradigms Broberg, Andrzej
Goscinski (Editors)
2. Cloud Computing Michael Miller Pearson
Education
2009
3. Cloud Computing for dummies, Judith Hurwitz, Robin Wiley, 2009
Bllor, Marcia Kaufman,
Fern Halper
4. Cloud Computing: A Practical Anthony T. Velte, Toby J. McGraw Hill,
Approach Velte, and Robert 2010.
Elsenpeter
5. Handbook of Cloud Computing BorkoFurht, Armando Springer,
Escalante 2010

B.E INFORMATION TECHNOLOGY, 2018-22 78 | P a g e

 PO a b c d e f g h i
CO

CO1 1 1
CO2 1 2 2
CO3 1 1 1
CO4
1 1 2

B.E INFORMATION TECHNOLOGY, 2018-22 79 | P a g e

 COURSE INFORMATION SHEET

Course Code IT803b

Course Title Human Computer Interaction
Type of Course Professional Elective-IV
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods
End Semester Assessment 50
(University Exam.) 50
Continuous Assessment (Sessional)
Course Prerequisites Nil
Course Objectives 1. To review image processing techniques for
computer vision.
2. To understand shape and region analysis.
3. To understand three-dimensional image analysis
techniques.
4. To understand Object detection and tracking.
5. To study some applications of computer vision
algorithms.
Course Outcomes 1. Understand the capabilities of both humans and
computers from the viewpoint of human
information processing.
2. Describe typical human–computer interaction
(HCI) models, styles, and various historic HCI
paradigms.
3. Apply an interactive design process and
universal design principles to designing HCI
systems.
4. Apply and use HCI design principles, standards
and guidelines.
5. Analyze and identify user models, user support,
socio-organizational issues, and stakeholder
requirements of HCI systems.

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the
question paper.

B.E INFORMATION TECHNOLOGY, 2018-22 80 | P a g e

 Section -A Hours

Introduction to Human Computer Interface Importance of User Interface, History of Human

Computer Interface, Importance of Good Design, Benefits of Good Design, Principles of User
Interface Design. (5)

Interaction Devices
Keyboard Keys, Function Keys, Pointing Devices, Speech Recognition, Handwriting Recognition,
Speech Generation, Image Display, Video Display, Device Drivers. (6)

Color and Content

Why Colors, Color Uses, Choosing Colors, Possible Problems With Colors, Page Title, Headings,
Text, Messages, Error Messages, Icons. (5)

Design Process
Understanding How User Interact With Computers, User Interface Models, Design Methodologies,
Designing an Interface, Process of Interaction Design. (6)

Section B
Graphical User Interface
Popularity of Graphics, Characteristics of Graphical User Interface, Concepts of Direct Manipulation,
Graphical System Advantages and Disadvantages, Web User Interface Characteristics and Popularity.
(6)
Device and Screen-Based Control
Device Based Controls, Operable Controls, Text Entry/Read-Only Controls, Selection Controls,
Combining Entry/Selection Controls, Other Operable Controls, Presentation Controls and Selecting
Proper Controls (5)

Mobile HCI
Mobile Ecosystem: Platforms, Application Frameworks- Types of Mobile Applications: Widgets,
Applications, Games – Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of
Mobile Design, Tools. (7)
Windows
Window characteristics, Components of Window, Window Presentation Styles, Types of Windows,
Window Management. (5)

B.E INFORMATION TECHNOLOGY, 2018-22 81 | P a g e

 PO
a b c d e f g h i
CO

CO1 1
CO2 1 1

CO3 2

CO4 2 1 2

CO5 1 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 82 | P a g e

 COURSE INFORMATION SHEET

Course Code IT803c

Security in IoT Networks
Course Title
Type of Course Professional Elective-IV
LTP 310
Credits 04
Total Lectures 45
Course Assessment Methods
End Semester Assessment (University
Exam.) 50
Continuous Assessment (Sessional) 50

Operating Systems, Computer and Communications

Course Prerequisites Networks
Course Objectives 1. Ability to understand the Security requirements
in IoT.
2. Understand the cryptographic fundamentals for
IoT.
3. Ability to understand the authentication
credentials and access control
4. Understand the various types Trust models and
Cloud Security

Course Outcomes Students will be able to

1. Become familiar with standard security and
privacy preserving mechanisms
2. Elaborate the need for Security in IoT
3. Describe the various access control models
applicable for security in IoT
4. Design and develop trust model for IoT

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be compulsory,
having parts covering the whole syllabus. Three questions have to be set from Part A and three
questions from Part B of the syllabus. Candidate is required to attempt at least two questions from each
part. All the course outcomes must be covered by the question paper.

Section-A Hours
Introduction (10)
Security Requirements in IoT Architecture - Security in Enabling Technologies - Security Concerns in IoT
Applications. Security Architecture in the Internet of Things - Security Requirements in IoT - Insufficient
Authentication/Authorization - Insecure Access Control - Threats to Access Control, Privacy, and Availability -
Attacks Specific to IoT. Vulnerabilities – Secrecy and Secret-Key Capacity - Authentication/Authorization for
Smart Devices - Transport Encryption – Attack & Fault trees

Cryptographic fundamental for IoT (10)

Cryptographic primitives and its role in IoT – Encryption and Decryption – Hashes – Digital Signatures –
Random number generation – Cipher suites – key management fundamentals – cryptographic controls built into
IoT messaging and communication protocols – IoT Node Authentication

Section B
B.E INFORMATION TECHNOLOGY, 2018-22 83 | P a g e
Identity& access management solution for IoT (7)
Identity lifecycle – authentication credentials – IoT IAM infrastructure – Authorization with Publish / Subscribe
schemes – access control
Privacy preservation and trust models for IoT (9)
Concerns in data dissemination – Lightweight and robust schemes for Privacy protection – Trust and Trust
models for IoT – self-organizing Things - Preventing unauthorized access.

Cloud security for IoT (9)

Cloud services and IoT – offerings related to IoT from cloud service providers – Cloud IoT security controls –
An enterpriseIoT cloud security architecture – New directions in cloud enabled IoT computing

RECOMMENDED BOOKS

S. No. NAME AUTHOR(S) PUBLISHER

1. Practical Internet of Things Security Brian Russell, Drew Van Packt Publishing,
Dure June 2016
2. Internet of Things Security: Challenges, Chintan Patel, Nishant Doshi CRC Press
Advances, and Analytics.
3 Security and Privacy in Internet of Things Edited By Fei Hu CRC Press
(IoTs): Models, Algorithms, and
Implementations

PO a b c d e f g h i

CO

COI 2 1 1 1 1
COII 2 2 1 1 1
COIII 2 2 2 1 1 1
COIV 1 2 2 2 1 1 2 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 84 | P a g e

 COURSE INFORMATION SHEET

Course Code IT-803d

Course Title Software Architectures and Design
Type of Course Professional Elective-IV
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Software Engineering
Course Objectives 1. To understand the design approaches for
software architecture to bridge the
dynamic requirements and
implementation.

2. To learn the design principles and to apply

for large scale systems

3. To design architectures for distributed

heterogeneous systems ,environment
through brokerage interaction

4. To build design knowledge on service

oriented and model driven architectures
and the aspect oriented architecture.

5. To develop appropriate architectures for

various Case studies like semantic web
services, supply chain cloud services.

Course Outcomes Upon completion of this course, the students

should be able to:
1. Understand the need of software
architecture for sustainable dynamic
systems.

2. Have a sound knowledge on design

principles to apply for large scale
systems

3. Design architectures for distributed

heterogeneous systems

4. Have good knowledge on service

oriented and model driven architectures
and the aspect oriented architecture.

B.E INFORMATION TECHNOLOGY, 2018-22 85 | P a g e

 SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours

Introduction to Software Architecture (07)

Bridging Requirements and Implementation, Design Guidelines, Software Quality
attributes. Software Architecture Design Space. Agile Approach to Software
Architecture Design, Models for Software Architecture Description Languages (ADL).
.

Object-Oriented Design Principles. (08)

Data-Centered Software Architecture: Repository Architecture, Blackboard
Architecture. Hierarchical Architecture Main-Subroutine, Master-Slave, Layered,
Virtual Machine. Interaction-Oriented Software Architectures: Model-View-Controller
(MVC), Presentation-Abstraction-Control (PAC ).

Distributed Architecture (06)

Client-Server, Middleware, Multi-tiers, Broker Architecture – MOM,CORBA Message
Broker Architecture- Service-Oriented Architecture (SOA), SOAP, UDDI, SOA
Implementation in Web Services, Grid/cloud Service Computing.

Heterogeneous Architecture (03)

Methodology of Architecture Decision, Quality Attributes. Architecture of User
Interfaces containers, case study-web service.

Product Line Architectures (07)

Methodologies, processes and tools. Software Reuse and Product Lines -Product Line
Analysis, Design and implementation, configuration Models. Model Driven
Architectures (MDA) –why MDAModel transformation and software architecture,
SOA and MDA. Eclipse modeling framework.

Aspect Oriented Architectures (09)

AOP in UML,AOP tools, Architectural aspects and middleware Selection of
Architectures, Evaluation of Architecture Designs,

Case Study (05)

Online Computer Vendor, order processing, manufacture &shipping –inventory,
supply chain cloud service Management, semantic web services

RECOMMENDED BOOKS

B.E INFORMATION TECHNOLOGY, 2018-22 86 | P a g e

S. No. NAME AUTHOR(S) PUBLISHER
1 Essentials of software Architecture Ion Gorton Second Edition,
Springer-verlag
2 Software Architecture Design Kai Qian Jones and Bartlett
Illuminated, C++ Primer Plus Publishers
Canada

B.E INFORMATION TECHNOLOGY, 2018-22 87 | P a g e

 Professional Elective-V
COURSE INFORMATION SHEET

Course Code IT804a

Course Title Network Management and
Administration (Theory)
Type of Course Professional Elective-V
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Computer Networks
Course Objectives To familiarize students with advanced
concepts of networks, network management,
administration and security concepts
Course Outcomes After completion of this course, the students
are able to:
1. Understand the principles of network
management.
2. Analyze performance management
strategies in broadband networks
3. Learn UNIX system administration
and configuration.
4. Identify various security issues and
security mechanisms.

SYLLABUS

Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours

Large Enterprise Networks: (05)

Managing Enterprise Networks, need for network management, SNMP: the de facto
network management standard.
Elements of NMS Development: (12)
NMS development, data analysis, class design for major NMS features, GUI
development, insulating applications from low level code, multiservice switches,
MPLS, MPLS and scalability.
Performance Management in Broadband Networks: (10)
Performance Control, Performance Monitoring in T-carrier systems, Performance
Monitoring in SDH/SONET based networks, Performance Monitoring in ATM
networks, Performance Monitoring in Frame Relay networks, Transmission Quality
Assurance, Traffic Management.
SECTION-B
Introduction to Unix System Administration (04)
Daily Tasks of a System Administrator, Startup and Shutdown, Periodic Processes,

B.E INFORMATION TECHNOLOGY, 2018-22 88 | P a g e

Managing File Systems, Responsibilities to the users, Hardware responsibilities, Types
of SunOS Systems.
System Configuration (07)
Kernel configuration; Adding Hardware Special Files in Solaris 10.0, IRIX 5.X, Digital
UNIX and Ultrix, Systems Directories,/ -root/ etc- systems. Creating networks and
subnets, configuring network interfaces, obtaining network statistics, routing , /user-
system programs, libraries, etc; User accounts-admittance, login procedure, Password
Aging.
Security (07)
System Security Concerns, Need for security, Security Programs, Security Response
Teams, The password and group files, File and Directory Permissions, EEPROM
Security, Secure the console port, Security Loopholes, Additional Security features in
Solaris 10.0, Secure Shell, SSII, SSII Programs, Control Files, Setting up the Service,
Login Process.

RECOMMENDED BOOKS

S. NAME AUTHOR(S) PUBLISHER

No.
1 Network Management, MIBs and MPLS Stephen B. Morris Pearson
Publications
2 Network Management in wired and Tejinder S. Randhawa, Kulwer
wireless networks Stephen Hardy Academic
publication
3 Unix System Administration Handbook Evi Nemeth, Garth Snyder, Prentice Hall
Scott Seabass, Trent Hein of India
Private Ltd
4 Essential UNIX System Administration Aeleen Frisch O’Reilly
Media
5 Solaris System Administration’s Guide Janice Winsor Macmillian
Technical
Publishing

PO
a b c d e f g h i
CO

CO1 1 1 1

CO2 1 2 1

CO3 1 1

CO4 1 2 1

B.E INFORMATION TECHNOLOGY, 2018-22 89 | P a g e

 COURSE INFORMATION SHEET

Course Code IT804b

Course Title Computer Vision
Type of Course Professional Elective-IV
LT P 3-1-0
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Basics of vectors, linear algebra (i.e., matrix
operations, solution of linear
equations). Programming language (e.g.,
Matlab and/or C).
Course Objectives 1. To review image processing
techniques for computer vision.
2. To understand shape and region
analysis.
3. To understand three-dimensional
image analysis techniques.
4. To understand Object detection and
tracking.
5. To study some applications of
computer vision algorithms.
Course Outcomes 1. Understand the fundamental image
processing techniques required for
computer vision.
2. Learn and implement boundary
tracking techniques and apply Hough
Transform for line, circle, and ellipse
detections.
3. Implement motion related techniques.
4. Develop skills to develop applications
using computer vision techniques.

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
(7)
FUNDAMENTALS OF DIGITAL IMAGE PROCESSING
Review of image processing techniques, classical filtering operations, Thresholding
techniques, edge detection techniques, corner and interest point detection, mathematical
morphology and textures.
(7)
SHAPES AND REGIONS
Binary shape analysis – connectedness – object labeling and counting – size filtering –
distance functions – skeletons and thinning – deformable shape analysis – boundary
B.E INFORMATION TECHNOLOGY, 2018-22 90 | P a g e
tracking procedures – active contours – shape models and shape recognition –
centroidal profiles – handling occlusion – boundary length measures – boundary
descriptors – chain codes – Fourier descriptors – region descriptors – moments.
(8)
HOUGH TRANSFORM
Line detection – Hough Transform (HT) for line detection – foot-of-normal method –
line localization – line fitting – RANSAC for straight line detection – HT based circular
object detection – accurate center location – speed problem – ellipse detection –
Applications and case study: Human Iris location – hole detection – generalized Hough
Transform – spatial matched filtering – GHT for ellipse detection – object location –
GHT for feature collation.
SECTION-B
(8)
3D VISION AND MOTION
Methods for 3D vision – projection schemes – shape from shading – photometric stereo
– shape from texture – shape from focus – active range finding – surface
representations – point-based representation – volumetric representations – 3D object
recognition – 3D reconstruction – introduction to motion – triangulation – bundle
adjustment – translational alignment – parametric motion – spline based motion –
optical flow – layered motion.
(7)
OBJECT DETECTION AND TRACKING
Introduction to Motion Detection , Applications of Motion Detection and Tracking,
Background Subtraction (BGS), Basic BGS Algorithms, Mixture of Gaussians (MoG),
Block matching for object tracking, Single object and multi-object tracking.
(8)
COMPUTER VISION APPLICATIONS
Application: Photo album – Face detection – Face recognition – Eigen faces – Active
appearance and 3D shape models of faces Application: Surveillance – foreground-
background separation – particle filters – Chamfer matching, and occlusion –
combining views from multiple cameras – human gait analysis Application: In-vehicle
vision system: locating roadway – road markings – identifying road signs – locating
pedestrians.

RECOMMENDED BOOKS

B.E INFORMATION TECHNOLOGY, 2018-22 91 | P a g e

S. NAME AUTHOR(S) PUBLISHER
No.
1. Computer Vision: Models, Learning, Simon J. D. Prince
and Inference Cambridge
University Press.
(Latest edition)
2. Computer & Machine Vision R. Davies Academic Press
3. Computer Vision: Algorithms and R. Szeliski Springer 2011.
Applications

4. Feature Extraction & Image Processing Mark Nixon and Academic Press
for Computer Vision Alberto S. Aquado

5. Mastering OpenCV with Practical D. L. Baggio et al. Packt

Computer Vision Projects Publishing

6. Programming Computer Vision with Jan Erik Solem O'Reilly Media

Python: Tools and algorithms for
analyzing images
7. Fundamentals of Object Tracking Sudha Challa Cambridge
University Press

PO
A B C D E F G H I
CO

CO1 1 2

CO2 2 1

CO3 1 2

CO4 1 2

COURSE INFORMATION SHEET

B.E INFORMATION TECHNOLOGY, 2018-22 92 | P a g e

Course Code IT804C
Course Title Pattern Recognition
Type of Course Professional Elective-IV
LT P 3-1-0
Credits 4
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites
Course Objectives The objective of the course is to build the
foundations of pattern recognition algorithms,
feature discovery and selection, parametric and
nonparametric classification, supervised and
unsupervised learning, clustering, and to use this
knowledge to solve sample problems. This course
covers the methodologies, technologies, and
algorithms of statistical pattern recognition from a
variety of perspectives
Course Outcomes After completion of the course, students will be able
to
1. Understand the basic concepts in pattern
recognition
2. Gain knowledge about state-of-the-art
algorithms used in pattern recognition research
3. Analyse training methods and classification
problems probabilistically and estimate
classifier performance.
4. Design solutions using pattern recognition
techniques for solving practical problems.

SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be compulsory, having
parts covering the whole syllabus. Three questions have to be set from Part A and three questions from Part B of
the syllabus. Candidate is required to attempt at least two questions from each part. All the course outcomes
must be covered by the question paper.
Section-A

Basics of Probability, Random Processes and Linear Algebra (recap):

Probability: independence of events, conditional and joint probability, Bayes theorem Random Processes:
Stationary and non-stationary processes, Expectation, Autocorrelation, Cross-Correlation, spectra.
(3)

Linear Algebra:
B.E INFORMATION TECHNOLOGY, 2018-22 93 | P a g e
 Inner product, outer product, inverses, eigen values, eigen vectors, singular values, singular vectors.

(2)
Bayes Decision Theory :

Minimum-error-rate classification. Classifiers, Discriminant functions, Decision surfaces. Normal density and
discriminant functions. Discrete features. (5)

Parameter Estimation Methods :

Maximum-Likelihood estimation :Gaussian case. Maximum a Posteriori estimation. Bayesian estimation .

(3)

Gaussiancase.: Unsupervised
learning and clustering - Criterion functions for clustering. Algorithms for clustering: K-Means, Hierarchical
methods. Cluster validation. (4)

Gaussian mixture models, Expectation-Maximization method for parameter estimation. Maximum entropy
estimation. Sequential Pattern Recognition. Hidden Markov Models (HMMs) . (6)

Section- B

Dimensionality reduction: Principal component analysis, Fisher discriminant analysis ,Generalised eigen
analysis. Eigen vectors/Singular vectors as dictionaries. Factor Analysis, Total variability space-adictionary
learning methods. Non negative matrix factorisation - a dictionary learning method. (8)

Linear discriminant functions : Gradient descent procedures, Perceptron, Support vector machines - a
briefintroduction. (7)
Artificial neural networks: Multilayer perceptron - feedforward neural network. A brief introduction to deep
neural networks, convolutional neural networks, recurrent neural networks. (4)

Non-metric methods for pattern classification : Non-numeric data or nominal data. Decision trees:
Classification and Regression Trees (CART). (3)

RECOMMENDED BOOKS

B.E INFORMATION TECHNOLOGY, 2018-22 94 | P a g e

S. No. NAME AUTHOR(S) PUBLISHER

 1. Pattern Classification R.O.Duda, P.E.Hart and John Wiley,
D.G.Stork 2001
2. Pattern Recognition S.Theodoridis and
K.Koutroumbas
3. Pattern Recognition and Machine C.M. Bishop Springer, 2006
Learning
4. Pattern recognition S. Theodo ridis, K.
Koutroumbas

CO/PO mapping

CO- a b c d e f g h i
PO
CO1 1 1 1 2 1
CO2 2 1 1 2 1
CO3 2 2 1 2 1
CO4 2 2 2 2 1 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 95 | P a g e

 Course Information Sheet

Course Code IT804d

Course Title Software Testing And Quality Assurance
Type of Course Professional Elective-V
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Software Engineering
Course Objectives (CO) 1. To make students aware about the
importance of the software testing
during software development.
2. To prepare the student for software
testing and debugging. It will further laid
the foundation for advanced courses in
Software quality assurances.
Course Outcome Upon completion, Students will be able:

1. To Understand Various software

Process models.
2. To evaluate various software metrics.
3. To analyze Software Configuration
and risk management Techniques.
4. To Classify and analyze various
software testing techniques.

SYLLABUS
Note: The Semester question paper of a subject be of 50 Marks having 7 questions of equal marks.
First question, covering the whole syllabus and having questions of conceptual nature, be
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each section.
SECTION-A Hours
Introduction: (07)
Software Process, Characteristics of a Software Process, Process Models, Project
Management Process and its Phases, Software Measurements, Metrics, Scheduling,
Estimation.
Software Quality Assurance Concepts and Standards : (08)
Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software
Reviews, Formal Technical Reviews, Review Guidelines, Software Reliability,
Software Safety, Quality Assurance Standards, ISO 9000, ISO 9001:2000, ISO 9126
Quality Factors, CMM, TQM, Six Sigma, SPICE, Software Quality Assurance Metrics.
Risk Management and Change Management: Software (07)
Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM Plan,
Software Configuration Management, Baselines, Software Configuration Items, SCM
Process: Version Control, Change Control, Configuration Audit, Configuration
Management for Web Engineering.

B.E INFORMATION TECHNOLOGY, 2018-22 96 | P a g e

 SECTION-B
Software Testing: (07)
Testing, Verification and Validation, Test Strategies for Conventional and Object
Oriented Software, Unit Testing, Integration Testing, Validation Testing, Alpha and
Beta Testing, System Testing, Recovery Testing, Security Testing, Stress Testing,
Performance Testing, Metrics for Source Code, Metrics for Testing, Debugging
Process, Debugging Strategies.
Testing Techniques: (08)
Software Testing Fundamentals, Black Box and White Box Testing, Basis Path Testing,
Flow Graph Notation, Independent Program Paths, Graph Matrices, Control Structure
Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph Based Testing
Methods, Equivalence Partitioning, Boundary Value Analysis, Object Oriented Testing
Methods: Applicability of Conventional Test Case Design Methods, Fault-Based
Testing, Scenario-Based Testing, Random Testing and Partition Testing for Classes,
Inter Class Test Case Design.
Testing Process: (08)
Test Plan Development, Requirement Phase, Design Phase and Program Phase Testing,
Testing Client/Server Systems, Testing Web based Systems, Testing Off-the-Shelf
Software, Testing in Multiplatform Environment, Testing for Real Time Systems,
Testing Security.
RECOMMENDED BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1. Software Engineering, Seventh Edition Ian Sommerville Pearson
Education
2. Software Engineering: A Practitioner's R.S. Pressman Tata McGraw-
Approach, Sixth Edition Hill
3. Effective Methods for Software Testing, William E. Perry John Wiley &
Second Edition Sons
4. Software Engineering: Theory and S.L. Pfleeger, J.M. Atlee Pearson
Practice, Second Edition Education
5. Software Engineering, Second Edition K.K. Aggarwal, Yogesh New Age
Singh International
6. An Integrated Approach to Software PankajJalote Narosa
Engineering, Second Edition
7. Software Quality Assurance – Principles Nina S Godbole Narosa
and Practice
8. Software Testing Techniques, Second Boris Beizer Dreamtech
Edition

B.E INFORMATION TECHNOLOGY, 2018-22 97 | P a g e

 PO
a b c d e f g h i j k l
CO

CO1 2

CO2 2

CO3 2 1

CO4 1 1

B.E INFORMATION TECHNOLOGY, 2018-22 98 | P a g e

 COURSE INFORMATION SHEET

Course Code IT805

Course Title Technical communication and Soft Skill (Prac)

Type of Course Core

Credits 01

Course Assessment
Methods:
00
End Semester Assessment
(University Exam.)
Continuous Assessment
50
(Practical)

Course Prerequisites NIL

The aim of this course is to equip the students with effective

communication skills necessary for the workplace. The
Course Objectives objective is to build good English vocabulary, inculcate correct
usage of grammar, instill effective reading, writing and
speaking.

Practical to be based on, but not limited to the following directions:

1. Remedial Grammar: Errors of accidence and syntax with reference to parts of speech; Agreement of subject
and verb; Tense and Concord; Conditional clauses; Use of connectives in complex and compound sentences;
Question tags and short responses.

2. Vocabulary and Usage: Word Formations (by adding suffixes and prefixes); Technical Word Formation;
Synonyms, Antonyms, Homophones, and Homonyms; One Word Substitution; Misappropriations; Indianisms;
Redundant Words; Phrasal Verb Idioms

3. Technical Writing:

A. Scientific Attitude and Impersonal Style; Plain Statements, Definitions; Description and 
Explanations
(of objects, instruments, Processes, Scientific Principles, etc.) Summarizing and abstracting; Expressing
ideas within a restricted word limit; Paragraph Writing (Paragraph

division, introduction and the conclusion, Variety in sentences and paragraphs) Interpretation and use of
charts, graphs and tables in technical writing. Punctuation 


B.E INFORMATION TECHNOLOGY, 2018-22 99 | P a g e

B. Reading at various speeds (slow, fast, very fast); reading different kinds of texts for different purpose
(e.g. for relaxation, for information, for discussion at a later stage, etc.); reading between the lines.
Comprehension of Unseen Passages 


4. Preparing Power point presentation and presenting the same

B.E INFORMATION TECHNOLOGY, 2018-22 100 | P a g e

 COURSE INFORMATION SHEET

Course Code ITE806

Course Title Project-II
Type of Course PSI
LT P 006
Credits 03
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 100
Course Prerequisites Nil
Course Objectives 1. Students learning skills to tackle realistic
problems as they would be solved in the
real world.
2. Teachers serving as facilitators help in
clarity of objectives to be achieved.
3. Students (usually, but not always)
working in pairs or groups.
Course Outcomes After the completion of this course, the
students are able to:
1. Understand the requirements for real
life engineering and societal problems.

2. Analyze and apply skills and

knowledge to solve real life problem.

3. Demonstrate interpersonal skills and

ability of team work and
documentation and reporting.

PO
a b c d e f g h i
CO
CO 1 1 2 1 2 1 1 2

CO2 2 2 1 2 1 1 1

CO3 1 1 1 2 1 2

B.E INFORMATION TECHNOLOGY, 2018-22 101 | P a g e

 COURSE INFORMATION SHEET

Course Code IT807

Course Title Industrial Training
Type of Course
Duration 6 months
Credits 22
Course Assessment Methods:
Marks 350
Internal Assessment 300
Course Prerequisites Nil
Course Objectives 1. To enable students to integrate theory
with practice.
2. To introduce students to work culture and
industrial practices.
3. To provide opportunity to students to
hands on current problems industrial
practitioners are dealing with.
Course Outcomes After the completion of this course, the
students are able to:
1. Analyze practical aspects of a problem
and designing its solution.
2. Apply skills and knowledge of recent
technologies to implement solution for a
real life problem.
3. Demonstrate interpersonal skills and
ability of team work and documentation
and reporting.

PO a b c d e f g h i

CO
2 1 2 1 1
CO1

1 2 2 2
CO2

1 2 1 2
CO3

B.E INFORMATION TECHNOLOGY, 2018-22 102 | P a g e