Syllabus PDF

GMRIT
Academic Regulations, Curriculum and Syllabi
2016
B. Tech.
Computer Science and Engineering
(4 Year Program)
Department of Computer Science and Engineering

GMR Institute of Technology
Rajam, Andhra Pradesh
(An Autonomous Institute Affiliated to JNTU Kakinada, AP)
NBA Accredited and NAAC Accredited
ACADEMIC REGULATIONS, CURRICULUM
AND SYLLABI
2016
Computer Science and Engineering (CSE)
(Affiliated to JNTUK, Kakinada and Accredited by NAAC ad NBA)

Rajam, Srikakulum District, Andhra Pradesh 532 127
www. gmrit.org
Academic Rules and Regulations
2016
Undergraduate Programmes
GMR Institute of Technology

Rajam 532 127, Andhra Pradesh
(An Autonomous Institute, Affiliated to JNTU, Kakinada, AP)
Accredited by NAAC & NBA
GMR Institute of Technology (GMRIT) | Regulation 2016
Contents
1. Eligibility for Admission……………………………....................................................... iv

2. Duration of B. Tech. Programme……………………………………………………….. iv
3. Branches of Study…………………………………………………………………………….. iv
4. Programme Structure………………………………………………………………………. v
4.1. Credit Distribution for the Courses Offered………………………………… viii
4.2. Structure of the Curriculum……………………………………………………….. viii
4.3. Credits Break-up for Various Category of Courses………………………. x
4.4. Division of Marks for Continuous and Semester End Assessment.. xi
5. Evaluation Methodology…………………………………………………………………... xii
5.1. Continuous Assessment Pattern for all Courses…………………………... xii
6. Attendance Requirements………………………………………………………………... xvi
7. Promotion Policies…………………………………………………………………………… xvi
8. Graduation Requirements………………………………………………………………… xvii
9. Flexibility to Add or Drop Courses……………………………………………………. xix
10. Withdrawal from Examination…………………………………………………………. xix
11. Curriculum……………………………………………………………………………………… xx
ii
The Vision of GMRIT
 To be among the most preferred institutions for engineering and technological

education in the country
 An institution that will bring out the best from its students, faculty and staff – to learn,
to achieve, to compete and to grow – among the very best
 An institution where ethics, excellence and excitement will be the work religion, while
research, innovation and impact, the work culture
The Mission of GMRIT
 To turnout disciplined and competent engineers with sound work and life ethics
 To implement outcome based education in an IT-enabled environment
 To encourage all-round rigor and instill a spirit of enquiry and critical thinking among
students, faculty and staff
 To develop teaching, research and consulting environment in collaboration with
industry and other institutions
iii
Academic Regulations for B. Tech. Programme*

(For all the batches of candidates admitted in the Academic Year 2016–2017 and subsequently)
1. Eligibility for Admission

The total seats available as per the approved intake are grouped into two categories viz.
category A and Category B with a ratio of 70:30 as per the state government guidelines vide G.O
No.52
a. The admissions for category A and B seats shall be as per the guidelines of Andhra
Pradesh State Council for Higher Education (APSCHE) in consonance with
government reservation policy.
 Under Category A: 70% of the seats are filled through EAMCET counseling.
 Under Category B: 30% seats are filled based on 10+2 merits in compliance
with guidelines of APSCHE
b. Admission eligibility-Under Lateral Entry Scheme
Students with diploma qualification have an option of direct admission into 2 nd year
B. Tech. (Lateral entry scheme). Under this scheme 20% seats of sanctioned intake
will be available in each course as supernumerary seats. Admissions to this three
year B Tech later entry Programme will be through ECET. The maximum period to
complete B. Tech. under lateral entry scheme is six consecutive academic years from
the date of joining.
2. Duration of the Programme
The course duration for the award of the Degree in Bachelor of Technology will be four
academic years, with two semesters in each year. However if a student is unable to complete the
course within 4 years, he/ she can do so by giving more attempts but within 8 consecutive
academic years from the date of admission.
Academic Calendar
For all the eight semesters a common academic calendar shall be followed in each semester by
having sixteen weeks of instruction, one week for the conduct of practical exams and with three
weeks for theory examinations and evaluation. Dates for registration, sessional and end
semester examinations shall be notified in the academic calendar of every semester. The
schedule for the conduct of all the curricular and co-curricular activities shall be notified in the
planner.
3. Branches of Study
B. Tech. Programmes
I. Chemical Engineering (CH)
II. Civil Engineering (CE)
*
Approved in the Academic Council Meeting held on March 24, 2018 (Satruday)
iv
III. Computer Science and Engineering (CS)

IV. Electrical and Electronics Engineering (EE)
V. Electronics and Communication Engineering (EC)
VI. Information Technology (IT)
VII. Mechanical Engineering (ME)
VIII. Power Engineering (PE)
4. Programme Structure
The curriculum will consist of courses of study (Theory, Practical, Contemporary Courses,
Mini Project, Term Papers, Project, Audit Courses, Self-study Courses, MOOCs, Summer
Internship and Full Semester Internship and Courses related Employability Skills) and
syllabi as prescribed by the respective Boards of Studies from time to time. The curriculum is
bifurcated into FSI and Non-FSI modes from 7th semester onwards.
Every student will be required to opt for six elective courses spanned across the semester from
4th to 8th semester from the list of electives as prescribed in the curriculum. Under Choice Based
Credit System (CBCS), the students may take one elective from the list of open electives offered
by other branches of engineering technology in consultation with their respective department.
a. Integrated Courses: Integrated courses are exclusively designed to provide a

unique learning experience to the students with the concept of layered learning
where in the students have the chances to practice while learning. These courses
designed by blending both theory and laboratory components in their core
curriculum and will be evaluated for 130 marks.
b. Contemporary Courses: These courses are designed with the help of experts from
industries and driven by experts from industries along with the internal faculty
members on the recent developments in core areas of engineering and technology.
These courses shall be registered as an elective course during their course of study
c. Mini Project: The curriculum offers Mini Projects in two different forms viz: (i) Mini
Project as a mandatory component in all lab courses (ii) 2 credit Mini Project during
5th or 6th semester. With respect to second one (ii) students will take mini project
batch wise and the batches will be divided as similar to lab courses. The report will
be evaluated by a committee as nominated by CoE constituted with internal &
external panels
d. Term Paper: The Term Paper is a self-study report and shall be carried out either
during 5th or 6th semester in choice with Mini Project. Every student will take up
this term paper individually and submit a report. The scope of the term paper could
be an exhaustive literature review choosing any engineering concept with reference
to standard research papers or an extension of the concept of earlier course work in
consultation with the term paper supervisor. The report will be evaluated by a
committee as nominated by HoD with the approval of CoE
v
e. Project work: The final project work shall be carried out during the 8th semester in
the non- FSI Model. Projects will be taken up batch wise. Internal evaluation will be
done by the Project Review Committee (PRC), comprising of HOD and two senior
faculty members along with the project supervisor. Semester end evaluation will be
done by Project Evaluation Committee (PEC) comprising of three members
including HOD, project guide and an external examiner nominated by the CoE
f. Audit Courses: Audit courses are among the compulsory courses and do not carry
any credits. All the students shall register for one Audit courses in the beginning of
3rdsemester. List of the courses will be notified at the beginning of the third
semester for all students and the student has to choose one audit course under self-
study mode at the beginning of third semester. All the students (regular and lateral
entry students) shall complete the audit course similar to other regular courses and
the results will be indicated with “Satisfactory” or “Not Satisfactory” performance.
g. Self-Study Courses: Self-study courses are the courses which are more similar to
theory courses where in the students learn the courses on independent mode. The
evaluation and assessment pattern for such courses shall be carried out as similar to
regular theory course. These courses shall be opted after getting proper approval
from the respective head of the department as well from the other head of the
department which is offering the course. The credits earned through these self-
study courses over and above the mandatory courses, and it will not be accounted in
CGPA calculation.
h. MOOCs: Meeting with the global requirements, to inculcate the habit of self-learning
and in compliance with UGC guidelines, MOOC (Massive Open Online Course) have
been introduced as electives
 The proposed MOOCs would be additional choices in all the elective
groups subject to the availability during the respective semesters and
respective departments will declare the list of the courses at the
beginning of the semester, which are having a minimum of 45 hours in a
given semester
 Course content for the selected MOOCs shall be drawn from respective
MOOCs links or shall be supplied by the department. Course will be
mentored by faculty members and Assessment & evaluation of the
courses shall be done by the department
 Three credits will be awarded upon successful completion of each
MOOCs
i. Summer Internship: As a part of curriculum in all branches of Engineering, it is
mandatory for all students to undergo summer internship Programme at industries
(core or allied) / R & D organization to get practical insight of their subject domain
during summer break after the 4th semester. This summer internship Programme
shall be availed to a maximum duration of 4 weeks and the assessment shall be
vi
carried out with both internal and external experts leading to “Satisfactory” and
“Non-Satisfactory Performance” and it will not be accounted for the calculation of
CGPA
j. Employability Skills: It is mandatory for all students to take a course on
Employability Skills from 3rd Semester to 6th Semester. The Employability Skills are
covered under two broad streams viz. Aptitude skills and Soft Skills. The credits
earned through these courses will be indicated in the grade sheet and will not be
taken into account for CGPA calculation.
k. Industry Driven One Credit Courses (IDC): Meeting with the industry
requirements, to reduce the gap between industry and academia this one credit (15
hrs.) course has been introduced over and above regular courses from 3rd Semester
to 6th Semester for the interested students. The credits earned through these
courses will be indicated in the grade sheet and will not be taken into account for
CGPA calculation.
l. Full Semester Internship: Students can opt for full semester Internship
Programme at industries based on their self-interest either during 7th or 8th
semester to get practical insight relevant to their core branch of engineering or in
allied branch of study under the guidance of internal and external expert members
in the institute and at Industries respectively. All Students who wish to choose FSI
pattern shall exercise this option well before the commencement of 7th semester.
Students who wish to take FSI during 8th semester will have to take one additional
course in 7th semester when compared with Non FSI stream. In case of some
extraordinary cases, students may be permitted to choose the FSI pattern even
before the commencement of 8th semester. In all such cases student shall take one
additional course offered during 8th semester under self-study mode and acquire
the required credits.
i. Minimum CGPA cut-off up to 5th semester as prescribed by CDC
ii. Competency mapping
iii. Students who opt for FSI either in 7th or 8th will be provided with Internship
subject the availability/selection by the industries
Further the credits earned through FSI Programme will be indicated in the grade sheet
and will be accounted for the calculation of CGPA.
FSI final evaluation will be done by the FSI Review Committee (FSIRC), comprising of
HOD, one senior faculty member and External (Industry) expert nominated by HOD.
vii
4.1. Credit Distribution for Courses Offered
No Course Credits
1 Theory Course 3
2 Integrated Course 4
3 Laboratory/Drawing Course 2
4 MOOCs 3
5 Elective courses 3
6 Audit Course 0
7 Term Paper 2
8 Mini Project 2
9 Summer Internship 0
10 Project work 10
11 Full Semester internship 16
Co-curricular and Extra-Curricular
12 2
Activities(CCEC)
13 Employability Skills (ES) 2
14 Industry Driven One Credit Courses (IDC) 1
4.2. Structure of curriculum

Following are the TWO models of course patterns out of which any student shall choose
one model based on the notified criteria for selection.
a. Full Semester Internship (FSI) Model

b. Non Full Semester Internship Model
In the Full semester internship Model, the students selected/opted for internship will be
distributed in both the 7th and 8th semester based on the internships available. In the Non
Full Semester Internship Model, all the selected students shall carry out the Project work
as per the norms.
A. Course Pattern for Four year Regular Programme (FSI)
Total
Sem. No. of Theory Courses No. of Lab Courses
Credits
I 21
5 3
II 21
III 3 + Employability Skills+ CCEC 25
6(5 Theory + 1 Integrated) 3+ CCEC Activities+
IV 25 + 1 + 1
Employability Skills
Summer Internship (Audit course) 0
6 (4 Compulsory Theory + 1 1+ Term paper/Mini Project +
V 23
Integrated + 1 Elective) Employability Skills + CCEC
6 + Audit course 1 + Term paper/Mini project +
VI (3 Compulsory Theory + 1 CCEC Activities + Employability 23 + 1+1
Integrated + 2 Elective) Skills
VII Full semester internship 16
viii
VIII 4 (2 Compulsory + 2 Elective) 2 16

16+Term paper +Mini project+
Internship +CCEC +
Total 34+4+1 Audit courses 174
Employability Skills+ Audit
Course
B. Course Pattern for Four Year Regular Programme (Non - FSI)

Total
Credits
I 21
5 3
II 21
III 3+ Employability Skills + CCEC 25
6 (5 Theory + 1 Integrated)
IV 3+ Employability Skills +CCEC 25 + 1+1
V 23
Integrated + 1 Elective) Employability Skills+ CCEC
6+ Audit course 1 + Term paper/Mini project+
VII 3 (1 Compulsory + 2 Elective) 2 13
VIII 3 (2 Compulsory + 1 Elective) Project work 19

16+Term paper + Mini project +
36+4+1 Audit courses Project work + CCEC + 174
Total
C. Course Pattern for Three Year Lateral Entry Programme (FSI)
Total
Credits
6 (5 Theory + 1 Integrated) 3+ CCEC Activities+ Employability
IV 25 + 1+1
Skills
V 23
6+ Audit course 1 + Term paper/Mini project
VII Full semester internship 16
VIII 4 (2 Compulsory + 2 Elective) 2 16
Total 24+4+1 Audit courses 10 + Term paper +Mini project+ 132
ix
Internship report +CCEC +

D. Course Pattern for Three year Lateral Entry Programme (Non FSI)
Total
Credits
6 (5 Theory + 1 Integrated)
3+ CCEC Activities+ Employability
IV 24 + 1+1
Skills
V 23
6 + Audit course 1 + Term paper/Mini project +
VII 3 (1 Compulsory + 2 Elective) 2 13
VIII 3 (2 Compulsory + 1 Elective) Project work 19

10 + Term paper +Mini project+
Total 26+4+1 courses Internship report +CCEC + 132
4.3 Credit Break-up for Various Category of Courses

a. For Four year regular Programme (FSI)
Total Theory Courses : 34 @ 3 credits each = 102
(29 Core Courses + 5 Elective Courses)
Total Integrated Courses : 4 @ 4 credits each = 16
Total Laboratory Courses : 16 @ 2 credits each = 32
Term Paper with self-study report : 1 @ 2 credits = 2
Mini Project with self-study report : 1@ 2 credits = 2
CCEC Activities : 2 @ 1 credits = 2
Employability skills : 2@ 1 credits = 2
FSI internship : 1 @ 16 credits = 16
b. For Four year regular Programme (Non FSI)

x

Project work : 1 @ 10 credits = 10
c. For three year lateral entry Programme (FSI)

Internship report : 1 @ 16 credits = 16
d. For three year lateral entry Programme (Non FSI)

Project work : 1 @ 10 credits = 10
4.4 Division of Marks for Continuous and Semester End Assessment
Marks Marks for

Course Continuous Semester end
Assessment Assessment
Theory 40 60
Integrated Course 40 (60T+30L)
Drawing courses 25 50
Laboratory 25 50
Term Paper 50 --
Audit Courses 50 --
Mini Project 25 50
Industry Driven Courses (IDC) 25 --
Full semester Internship 200 200
Project work 100 100
xi
5. Evaluation Methodology
a. The assessment will be based on the performance in the semester-end examinations and /
or continuous assessment, carrying marks as specified in Clause 10
b. At the end of each semester, final examinations will normally be conducted during
October/November and during April / May of each year. Supplementary examinations may
also be conducted at such times as may be decided by the Institute
c. Continuous Assessment Marks will be awarded on the basis of Continuous Evaluation made
during the semester as per the scheme given in Clause 10
d. The letter grade and the grade points are awarded based on the hybrid grading system
having earned grades and awarded grades. Grading is done based on the percentage of
marks secured by a candidate in individual course as detailed below:
Range of Percentage Letter Qualitative Grade

of Marks Grade Meaning Point
90-100 A+ Outstanding 10
Earned grade
85-89 A Excellent 9
Due to relative B+ Very Good 8
grading system the B Good 7
ranges of marks may C+ Average 6 Awarded grade
vary for each course C Satisfactory 5
based on the normal D Pass 4
distribution of marks
< 40 for theory and F Fail 0
Earned grade
< 50 for Lab
e. After completion of the Programme, the Cumulative Grade Point Average (CGPA) from the I
Semester to VIII Semester (from III to VIII semester for lateral entry) is calculated using the
formula:
∑𝑛−1
𝑖=1 (𝑐𝑖 × 𝑔𝑖 )
𝐶𝐺𝑃𝐴 =
∑𝑛−1
𝑖=1 𝑐𝑖
Where n is the number of courses registered for, ‘c i’ is the credits allotted to the given
course and ‘gi’ is the grade point secured in the corresponding course.
5.1 Continuous Assessment Pattern for all Courses

a. Theory Course
 Out of 40 marks allotted for continuous assessment 30 marks will be awarded based
on two tests (Each Test will be conducted for 40 marks and scale down to 30 marks)
conducted and 10 marks shall be awarded based on assignment test given below:
Internal Test 1 & Test 2 : 30 Marks (80 % of marks secured in 1 st best internal tests
and 20% marks secured in 2nd best internal test)
 The duration of each internal test will be 90 minutes addressing predominantly
on lower order thinking skills and shall cover two units of syllabus in each test
 All the students will be notified with the marks secured within one week after the
completion of the sessional exams
xii
 Students are permitted for reconciliation with in a period of two working days
after the notification of marks
 The evaluation methodology of Design and Drawing Courses coming under
theory will be given in their respective course handouts which will be approved
by department HOD.
Assignment Test : 10 Marks (Test will be conducted for 30 marks and scale
scale down to 10 marks)
 The duration of each test will be 120 minutes predominantly focusing on Higher
Order Thinking Skills covering all the possible range of all such HOTs. In case, if
the course has little scope of HOTs, assessment shall be carried out with LOTs
b. Integrated Course
40 marks allotted for continuous assessment as given below:
Theory Course
20 marks will be awarded based on two tests conducted similar to theory( Each Test
will be conducted for 40 marks and scale down to 20 marks) as given below:
Internal Test 1 & Test 2 : 20 Marks (80 % of marks secured in 1 st best internal tests
and 20% marks secured in 2nd best internal test)
Laboratory
20 marks are awarded for continuous assessment and following is the pattern for the
award of 20 marks
Preparation, Observation & Result : 10 Marks
Record : 05 Marks
Internal Test : 05 Marks
External Exam (Lab) : 30 Marks
External Exam (Theory) : 60 Marks
c. Laboratory Course:
25 marks are awarded for continuous assessment and following is the pattern for
the award of 25 marks
Without Mini Project:
Record : 05 Marks
Viva – Voce : 05 Marks
With Mini Project (through Augmented Experiments):
Record : 05 Marks
Viva – Voce : 05 Marks
Augmented Experiment : 05 Marks
xiii
Engineering drawing course is evaluated in line with lab courses and the
pattern of awarding 25 marks for continuous evaluation is as following
Day-to-day work : 15 marks
Internal test : 10 marks
There shall be two internal tests for 10 marks each during the semester and the
average shall be considered.
d. Term Paper
Continuous Assessment : 50 Marks
Distribution
Literature Survey : 10 Marks
Review 1 : 15 Marks
Review 2 : 15 Marks
Final Presentation : 10 Marks
e. Audit Courses
Online Objective Test : 50 Marks
f. Mini Project
Distribution
Review 1 : 05 Marks
Review 2 : 05 Marks
g. Project
Distribution
Innovativeness of the Project : 05 Marks
Experimentation / Simulation : 20 Marks
Result Analysis : 05 Marks
Review 1 : 20 Marks
Review II : 20 Marks
Project Report : 10 Marks
h. Full Semester Internship

Distribution
Internship Progress Report : 20 Marks
xiv
On Site Assessment : 30 Marks

Assessment by Industry : 100 Marks
(Intern Assessment Tool)
Final Assessement on Campus : 50 Marks
Total : 200 Marks
Distribution
Project Report : 120 Marks
i. Co-Curricular and Extra Curricular (CCEC) Activities
Students shall acquire 1 credit each in 2nd and 3rd years with the following
scheme:
Scheme of evaluation for the CCEC activities:
 No. of slots in each Semester @ 2 slots every week : 24
 No. of Stream (2-CC + 1-EC) :3
 No. of slots allotted for each stream :8
Requirement for the award of 1- Credit
 Students shall choose at least two streams of events in each semester
 Students shall secure 75% attendance in each stream of events to obtain
a certificate
 Students shall obtain 2 certificates of Participation in each semester.
The credits earned through these courses will be indicated in the grade sheet and
will not be taken into account for CGPA calculation.
j. Employability Skills (ES)
Students have to take up these courses from 3rd – 6th semesters. In both streams i.e
Aptitude Skills & Soft Skills (AS and SS) Students will be assessed in each semester.
Based on the marks secured in continuous assessment, students will be assessed for
AS. Based on the attendance for the various activities scheduled, students will be
assessed for SS. 16 periods are allotted for each stream per semester.
 Assessment for Aptitude skills

Continuous assessment : 30 Marks
Comprehensive Test : 20 Marks
For continuous assessment one examination will be conducted after every 5 weeks for
a maximum of 10 marks each (3x10=30). At the end of the semester a comprehensive
test will conducted for 20 marks. The student shall secure at least 40% marks in each
semester to get qualified.
xv
Assessment of Soft Skills

Continuous Assessment for Soft skill is done based on the participation of the students
in the various activities schedule during each semester. In every semester 6 activities
under SS will be organized and students are expected to attend at least 4 activities to
get qualified.
Student will secure 1 credit at the end of 4th semester and at the end of 6th semester
subject to the condition that he/she secures 40% marks in AS and 75 attendance in SS
in each semester.
h. Industry Driven One Credit Courses

Online Objective Test : 25 Marks
Grading:
Marks 25 ≤ and 20 ≥ : Excellent
Marks 20 < and 15 ≥ : Very Good
Marks 15 < and 10 ≥ : Good
Marks < 10 : Satisfactory
6. Attendance Requirements
a) It is desirable for a candidate to put on 100% attendance in all the subjects.

However, a candidate shall be permitted to appear for the semester end
examination by maintaining at least 75% of attendance on an average in all the
courses in that semester put together
b) The shortage of attendance on medical grounds can be condoned to an extent of
10% provided a medical certificate is submitted to the Head of the Department
when the candidate reports back to the classes immediately after the leave.
Certificates submitted afterwards shall not be entertained. Condonation fee as fixed
by the college for those who put on attendance between ≥ 65% and <75% shall be
charged before the end examinations. Attendance may also be condoned as per the
State Government rules for those who participate in sports, co-curricular and extra-
curricular activities provided their attendance is in the minimum prescribed limits
for the purpose and recommended by the concerned authority
c) In case of the students having overall attendance less than 65% after condonation
shall be declared detained and has to repeat semester again
d) In case of the student having less than 65% of attendance in any of the course
during a particular semester, he/she is not permitted to appear for that particular
course in the semester end examinations. In such cases, the students need to
undergo extra classes during the vacation or at convenient time to earn the shortage
of attendance. After completing the attendance requirements he/she may be
permitted to appear for the examination and it will be treated as a second attempt
e) His / her academic progress and conduct have been satisfactory
7. Promotion Policies
xvi
 In four year B. Tech. Programme, a student shall be promoted from 2nd year to 3rd
year only if s/he fulfills the academic requirements and earning of minimum 50% of
credits up to 2nd year
 In four year B. Tech. Programme, a student shall be promoted from 3rd year to 4th
year only if s/he fulfills the academic requirements and earning of minimum 50%
credits up to 3rd year
 In three year lateral entry B. Tech. Programme, a student shall be promoted from 3rd
year to 4th year only if s/he fulfills the academic requirements and earning of
minimum 50% credits up to 3rd year
8. Graduation Requirements
a) The following academic requirements shall be met for the award of the B. Tech. Degree
 Student shall secure 174 credits for regular B. Tech. Programme and 132 credits for
the students who entered in second year through lateral entry scheme. However, the
CGPA obtained for the best 167 credits (Excluding any one 3 credit course, CCEC and
ES) and 125 credits(Excluding any one 3 credit course, CCEC and ES)respectively
shall be considered for the award of Grade/Class/Division
 A student of a regular Programme who fails to earn 174 credits within eight
consecutive academic years from the year of his/her admission with a minimum CGPA
of 4.0 shall forfeit his/her degree and his/her admission stands cancelled
 A student of a lateral entry Programme who fails to earn 132 credits within six
consecutive academic years from the year of his/her admission with a minimum CGPA
of 4.0 shall forfeit his/her degree and his/her admission stands cancelled
b) Award of degree
Classification of degree will be as follows:
i. CGPA ≥ 7.5 : Degree with Distinction

ii. CGPA ≥6.5 and < 7.5 : Degree with First Class
iii. CGPA ≥5.0 and < 6.5 : Degree with Second Class
iv. CGPA ≥4.0 and < 5.0 : Degree with Pass Class
 First Class with Distinction: A candidate who qualifies for the award of the Degree
(vide clause 8 (a) having passed all the courses of study of all the eight semesters
(six semesters for lateral entry candidates) at the first opportunity, within eight
consecutive semesters (six consecutive semesters for lateral entry candidates) after
the commencement of his /her study and securing a CGPA of 7.5 and above shall be
declared to have passed in First Class with Distinction. For this purpose the
withdrawal from examination (vide clause 9) will not be construed as an
opportunity for appearance in the examination
 First Class: A candidate who qualifies for the award of the Degree (vide clause 8 (a)
having passed all the courses of study of all the eight semesters (six semesters for
lateral entry candidates) within maximum period of ten consecutive semesters
xvii
(eight consecutive semesters for lateral entry candidates) after the commencement
of his /her study and securing a CGPA of 6.5 and above shall be declared to have
passed in First Class
 Second Class : A candidate who qualifies for the award of the Degree (vide clause 8
(a) having passed all the courses of study of all the eight semesters (six semesters
for lateral entry candidates) within maximum period of ten consecutive semesters
(eight consecutive semesters for lateral entry candidates) after the commencement
of his /her study and securing a CGPA of 5.0 and above shall be declared to have
passed in Second Class
 Degree with Pass Mark : All other candidates who qualify for the award of the
degree shall be declared to have passed in Degree with Pass Mark
c) Grafting
In order to extend the benefit to the students with one/ two backlogs after either 6 th
semester or 8th semester, GRAFTING option is provided to the students enabling their
placements and fulfilling graduation requirements. Following are the guidelines for the
Grafting:
 Grafting will be done among the courses within the semester. Shall draw a
maximum of 7 marks from the any one of the cleared courses in the semester and
will be grafted to the failed course in the same semester.
 Students shall be given a choice of grafting only once in the 4 years Programme,
either after 6th semester (Option#1) or after 8th semester (Option#2)
 Option#1: Applicable to students who have maximum of TWO theory courses in 5 th
and/or 6th semesters
 Option#2: Applicable to students who have maximum of TWO theory courses in 7 th
and/or 8th semesters.
 Eligibility for grafting:
i. Prior to the conduct of the supplementary examination after the
declaration of the 6th or 8th semester results.
ii. She/he must appear in all regular or supplementary examinations as
per the provisions laid down in regulations for the courses s/he
appeals for grafting.
iii. The marks obtained by her/him in latest attempt shall be taken into
account for grafting of marks in the failed course(s).
d) Betterment chance
Student who clears all the subjects up to 6th semester and wish to improve their CGPA
can register and appear for one betterment chance for maximum of any five theory
courses up to 6th semester. Betterment chance can be availed along with 7 th and 8th
semester examinations
e) Quick Supplementary Examination

Student who clears all the courses up to 7th semester shall have a chance to appear for
Quick Supplementary Examination to clear the failed courses of 8th semester
xviii
f) All the candidates who register for the semester end examination will be issued
memorandum of marks by the Institute. Apart from the semester wise marks memos,
the institute will issue the provisional certificate subject to the fulfillment of all the
academic requirements
9. Flexibility to Add or Drop Courses
a. It is mandatory that all the students need to earn the minimum number of credits (as
per clause 8) for the award of B. Tech. degree in their respective disciplines. However a
student can earn more number of credits if they wish, by registering one additional
course, from the list of courses available in the curriculum of all disciplines, over and
above to the existing courses from 4th semester to 6th semester
b. The students who are opting for full semester internship (FSI) in the 7th or 8th Semester,
they are permitted to take the courses as listed in 7th and 8th semester of the curriculum
are from the list of electives furnished in the curriculum
c. The students, who are in non FSI mode, shall register for the project work in the 8 th
semester only
d. The student shall be permitted to drop any SSC at any point of time
e. All the courses registered and cleared by a student in this mode will be mentioned in the
Cumulative Grade Memo (CGM) as additional acquired. However the CGPA is calculated
for the best 167/125 credits only (as mentioned in the clause 8)
10. Withdrawal from the Examination
a. A candidate may, for valid reasons, be granted permission by the Principal to withdraw
from appearing for the examination in any course or courses of only one semester
examination during the entire duration of the degree Programme. Also, only ONE
application for withdrawal is permitted for that semester examination in which
withdrawal is sought
b. Withdrawal application shall be valid only if the candidate is otherwise eligible to write
the examination and if it is made prior to the commencement of the examination in that
course or courses and also recommended by the Head of the Department
c. Such Withdrawal from the examination shall be treated as absent for the 1 st attempt to
the respective examination and will lose the eligibility for First Class with Distinction
d. The student shall be allowed to drop FSI course either 7th or 8th semester within 4
weeks from the commencement of the FSI Programme due any uncertainty from either
side. In such case s/he will automatically entered into Non-FSI pattern of curriculum,
and s/he needs to register for respective courses in that semester and appear for
semester end examinations. In case if s/he has earned equivalent number of credits or
near to the equivalent number of credits with respect to clause 9, s/he shall forbid the
courses either partially or fully
e. If any student withdraws from FSI course after the stipulated period mentioned in the
clause 10.d, s/he will be considered as detained from the semester. S/he needs to
register for the semester in the next academic year
xix
General
a. s/he represents “she” and “he” both

b. Where the words ‘he’, ‘him’, ‘his’, occur, they imply ‘she’, ‘her’, ‘hers’ also
c. The academic regulations should be read as a whole for the purpose of any interpretation
d. In the case of any doubt or ambiguity in the interpretation of the above rules, the decision of
the Chairman, Academic Council will be final
The college may change or amend the academic regulations or syllabi from time to time and the
changes or amendments made shall be applicable to all the students with effect from the dates
notified by the institute.
11. Curriculum: The curriculum of all the UG Programmes is given below
xx
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
Department Vision
To be a nationally preferred department of learning for students and teachers alike, with dual
commitment to research and serving students in an atmosphere of innovation and critical
thinking.
Department Mission
1. To provide high-quality education in Computer Science Engineering to prepare the

graduates for a rewarding career in Computer Science Engineering and related industries,
in tune with evolving needs of the industry.
2. To prepare the students to become thinking professionals and good citizens who would
apply their knowledge critically and innovatively to solve professional and social
problems.
Program Educational Objectives
PEO 1: Acquire logical and analytical skills with a solid foundation in core areas of
computer Science & Information Technology.
PEO 2: Accomplish with advanced training in focused areas to solve complex real-world
engineering problems and pursue advanced study or research.
PEO 3: Demonstrate professional and ethical attitude, soft skills, team spirit, leadership
skills, and execute assignments to the perfection.
i
Program Outcomes
Engineering graduate will be able to
PO 1: Apply the knowledge of mathematics, science, engineering fundamentals, and an

engineering specialization to the solution of complex engineering problems. (Engineering
knowledge)
PO 2: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences. (Problem analysis)
PO 3: 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.
(Design/development of solutions)
PO 4: 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. (Conduct investigations of complex problems)
PO 5: 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. (Modern tool usage)
PO 6: 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. (The engineer and society)
PO 7: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable
development. (Environment and sustainability)
PO 8: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice. (Ethics)
PO 9: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings. (Individual and team work)
PO 10: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and
receive clear instructions. (Communication)
PO 11: 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. (Project management and
finance)
PO 12: 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. (Life-long
learning)
PSO1: Understand of social & civic responsibilities, and rights of individuals or groups while developing
software tools. (Program Specific)
PSO2: Demonstrate personal strengths & limitations, committed to critical thinking and performance
evaluation to manage software projects. (Program Specific)
ii
CURRICULUM FEATURES
UNDER ACADEMIC REGULATION 2016
1. Choice based credit system

2. Types of learning strategies
Curriculum is designed and developed in such a way that it provides a high degree of
flexibility to promote a learner centric environment through different types of learning
strategies viz. Independent learning, collaborative learning and interactive learning.
 Independent learning
o Self study elective courses
o Self study topics in each unit in all the courses
 Collaborative Learning
o Laboratory classes
o Mini projects in all laboratory courses
o Main project to demonstrate all the possible learning outcomes
 Interactive Learning
o Tutorial classes in all the courses wherever possible
3. Industry engagement
 Industry driven 3-credit elective courses
 Industry driven 1-credit courses from 3rd semester onwards
 Summer internship (One month duration) at the end of 2nd year during the program
of study
 Full semester internship (FSI) (Six month) during fourth year during the program of
study
4. Layered learning
5. Research oriented electives in the form of term paper
6. Credited courses for employability skills, extra- and co- curricular activities
7. Assessment pattern for all courses in accordance with revised Bloom’s taxonomy
8. Distribution of courses
iii
Department of Computer Science and Engineering

[Minimum Credits to be earned: 174 (for regular students)/132(for Lateral entry students)]
First Semester
Course Periods
No Course POs
Code L T P C
1 16HSX01 English Communication Skills I 10 3 1 - 3
2 16MAX01 Engineering Mathematics I 1,2 3 1 - 3
3 16PYX01 Engineering Physics 1,2 3 1 - 3
4 16MEX01 Engineering Mechanics 1,2,3 3 1 - 3
5 16CSX01 Problem Solving using C 1,2,3 3 1 - 3
6 16PYX02 Engineering Physics Lab 4 - - 3 2
7 16CSX02 Problem Solving using C Lab 4 - - 3 2
8 16MEX02 Engineering Drawing 4,9,10 - - 3 2
Total 15 5 9 21
Second Semester
1 16HSX03 English Communication Skills II 10 3 1 - 3
2 16MAX02 Engineering Mathematics II 1,2 3 1 - 3
3 16CYX01 Engineering Chemistry 1,2 3 1 - 3
4 16EEX01 Basic Electrical Engineering 1,3 3 1 - 3
5 16CHX01 Environmental Studies 1,3, 6,7 3 1 - 3
6 16HSX02 English Communication Skills Lab 10 - - 3 2
7 16CYX02 Engineering Chemistry Lab 4 - - 3 2
8 16MEX03 Engineering Workshop 1,2,10,12 - - 3 2
Total 15 5 9 21
Third Semester
Course Periods
No Course POs
Code L T P C
1 16IT305 Data Structures 1,2,3 3 1 - 3
2 16IT306 Object Oriented Programming through Java 1,2,3 3 1 - 3
3 16CS303 Computer Organization and Architecture 1,2,3 3 1 - 3
4 16CS304 Database Management Systems 1,2,3 3 1 - 3
5 16CS305 Digital Logic Design 1,2,3,6 3 - 2 4
6 16CS306 Discrete Structures & Graph Theory 1,2,3 3 1 - 3
7 16IT308 Data Structures Lab 3,4,5 - - 3 2
8 16IT309 Java Lab 2, 3, 4, 5 - - 3 2
9 16CS309 Database Management Systems Lab 2, 3, 4, 5 - - 3 2
10 CCEC Activity - I - - 3 -
11 16ESX01 Employability Skills - I - 2 - -
Total 18 7 14 25
Fourth Semester
1 16MA405 Probability and Statistics 1,2 3 1 - 3
2 16EC410 Microprocessors and Interfacing 1,2, 3 3 1 - 3
3 16IT406 Operating Systems 1, 2, 3 3 1 - 3
4 16CS404 Software Engineering 1,2, 3, 4, 5 3 - 2 4
5 16CS405 Theory of Computation 1, 2, 3 3 1 - 3
6 16CS406 Web Technologies 1,3, 5, 6 3 1 - 3
7 16EC411 Microprocessors and Interfacing Lab 2, 4, 9 - - 3 2
8 16CS408 Linux Programming Lab. 1,4, PSO2 - - 3 2
9 16CS409 Web Technologies Lab 3, 4, 5, 8 - - 3 2
10 CCEC Activity - I - - 3 1
11 16ESX02 Employability Skills – II - 2 - 1
Total 18 7 14 27
iv
Fifth Semester
Course Periods
No Course POs
Code L T P C
1 16IT404 Computer Networks 1,2, 3 3 1 - 3
2 16IT505 Object Oriented Analysis and Design 2, 3, 4, 5 3 - 2 4
3 16IT602 Artificial Intelligence 1,2, 3 3 1 - 3
4 16CS504 Compiler Design 2, 3, 5 3 1 - 3
5 16CS505 Design and Analysis of Algorithms 2, 3 3 1 - 3
6 Elective I / CC 3 1 - 3
7 16IT409 Computer Networks Lab 2, 4, 5 - - 3 2
8 16CS509 / 2, 4, 8, 10, 12; 2, 3, 4, 5,
Term Paper / Mini Project - - 3 2
16CS510 8, 9, 10, 11, PSO1, PSO2
9 CC & EC Activity II - - 3 -
10 16ESX03 Employability Skills - III - 2 - -
11 Summer Internship - - - -
Total 18 5 11 23
Sixth Semester
Engineering Economics & Project
1 16HSX04 11, 14 3 1 - 3
Management
2 16CS602 Data Mining 2, 3, 4, 5 3 - 2 4
3 16CS603 Internet of Things 3, 7 3 1 - 3
4 16CS604 Mobile Computing 2, 3, 5
5 Elective II/CC 3 1 - 3
6 Elective III (Open Elective) 3 1 - 3
7 16CS607 IoT Lab 4 - - 3 2
16CS510 / 2, 4. 8. 10. 12 ; 2, 3, 4, 5,
8 Mini Project / Term Paper - - 3 2
16CS509 8, 9, 10, 11, PSO1, PSO2
9 Audit Course - - - -
10 CC & EC Activity II - - 3 1
11 16ESX04 Employability Skills - IV - 2 - 1
Total 18 5 11 25
Seventh Semester
Course Periods
No Course POs
Code L T P C
1 16IT701 Big Data Analytics 2, 5, 6 3 1 - 3
2 Elective IV/CC 3 1 - 3
3 Elective V/CC 3 1 - 3
4 16IT705 Big Data Analytics Lab 3, 4, 5 - - 3 2
5 16CS705 Mobile Application Development Lab 2, 3, 4,5,8 - - 3 2
6 16CS706 Full Semester Internship1 2,5,8,9,10,11,12 - - - 16
Total 9 3 6 13/16
Eighth Semester
1 16IT802 Professional Ethics 6, 8 3 1 - 3
2 16CS802 Machine Learning 2, 5 3 1 - 3
3 Elective VI/CC 3 1 - 3
4 16CS804 Project work 1, 3,4,9,10,11,12, PSO2 - - - 10
5 16CS706 Full Semester Internship2 2,5,8,9,10,11,12, PSO1 - - - 16
Total 9 3 - 19/16
1
Student who opt for FSI-16CS706 during 7th semester, have to register one more additional elective and 16CS704
& 16CS705 as additional lab courses during 8th semester
2
Student the who opt for FSI-16CS706 during 8th semester, have to register an additional course in
consultation with HoD during 7th semester
v
List of Electives, Contemporary Courses, Courses, Audit Courses, Employability Skills and One
Credit Courses
Elective I
Course Periods
No Course POs
Code L T P C
1 16IT001 Information System Design 2, 3, 4, 12 3 1 - 3
2 16CS001 Computer Graphics & Multimedia 1,2, 3, 4 3 1 - 3
3 16CS002 Software Design Patterns 2, 3, 5 3 1 - 3
4 MOOCs - - - 3
Elective II
1 16CS003 Qualitative Data Analysis 3, 5 3 1 - 3
2 16CS004 Real Time Operating Systems 2, 3, 5, PSO1 3 1 - 3
3 16CS005 Service Oriented Architecture 3, 5, 8 3 1 - 3
4 MOOCs - - - 3
Elective III (Open Electives – Mathematics, Chemistry, Entrepreneurship Skills, Industrial Safety and
Engineering & Technology )
1 16CE007 Disaster Management 2, 6, 7, 10 3 1 - 3
2 16EE004 Renewable Energy Sources 7, 11, 12 4 - - 3
3 16ME007 Principles of Entrepreneurship 11 3 1 - 3
4 16EC004 Fundamentals of GPS 2,4,5,6 3 1 - 3
5 16CS006 Computational Intelligence 1,2,3,4, 9 3 1 - 3
6 16CS007 IoT for Engineering Applications 1,5 3 1 - 3
7 16CH007 Industrial Safety and Hazard Management 2,3,6,8 3 1 - 3
8 16IT005 Fundamentals of Cloud Computing 2,5,6 3 1 - 3
9 16PE006 Smart Grid Technologies 4,7 3 1 - 3
10 16MA001 Computational Mathematics 2,9 3 1 - 3
11 16CY001 Nano Science & Technology 2,3,6,7,12 3 1 - 3
Elective IV
1 16EC602 Digital Signal Processing 2, 3, 4 3 1 - 3
2 16IT006 Human Computer Interaction 2, 3, 5 3 1 - 3
3 16IT003 Information Retrieval Systems 3, 5, 6 3 1 - 3
4 16CS008 Software Project Management 3, 5, 6, PSO2 3 1 - 3
5 MOOCs - - - 3
Elective V
1 16IT002 Distributed Systems 3, 7 3 1 - 3
2 16IT007 Middleware Technologies 3, 5 3 1 - 3
3 16IT009 Cryptography and Network Security 5,6,8 3 1 - 3
4 16CS009 Social Network Analysis 2, 4, 5, 12 3 1 - 3
5 MOOCs - - - 3
Elective VI
1 16EC005 Digital Image Processing 2, 3, 5, 6 3 1 - 3
2 16IT010 Computer Forensics 2, 3, 5 3 1 - 3
3 16IT011 E & M Commerce 5, 6
4 16IT504 Cloud Computing 3, 5, 6 3 1 - 3
5 16CS010 Multimedia Databases 3, 5, 6
6 16CS011 Wireless Ad hoc Networks 3, 5, 6 3 1 - 3
MOOCs - - - 3
vi
Contemporary Courses (CC)3

1 16IT012 Data Analytics I 3,5,6 4 - - 3
2 16IT013 Data Analytics II 3, 5,6,7 4 - - 3
3 16IT014 Data Analytics III 3,5,6 4 - - 3
4 16CS012 Security Analytics I 3, 5, 6 4 - - 3
5 16CS013 Security Analytics II 1,2,4,5 4 - - 3
6 16CS014 Security Analytics III 2,4,5 4 - - 3
7 16IT016 Enterprise Application Development using IBM RAD & 3, 5, 6,7 4 -
Bluemix
8 16IT017 Big Data Analytics with Hadoop Platform 3, 5, 6, 7 4 -
9 16IT018 Foundation Course in Security Identity and Access 3, 5, 6, 7 4 -
Management
10 16CSX16 Digital Marketing (Self Study ) 2, 5, 12 - - - 1
One Credit Course (s)3
1 16CSI01 Tibero DB 1 0 0 1
2 16CSI02 Data Modeling 1 0 0 1
Audit Courses
1 16AT001 Contemporary India: Economy, Polity and Society (ME) - - - -
2 16AT002 Indian Heritage and Culture (EEE) - - - -
3 16AT003 Intellectual Property Rights and Patents (ECE) - - - -
4 16AT004 Introduction to Journalism (CSE) - - - -
5 16AT005 Professional Ethics and Morals (CE) - - - -
6 16AT006 Science, Technology and Development (Chem) - - - -
7 16AT007 Industrial sociology (PE) - - - -
8 16AT008 Organizational Behavior (IT) - - - -
9 16AT009 Communication Etiquette in workplaces (BS & H) - - - -
3
Contemporary and One Credit Courses may vary from one Academic Year to another Academic Year and
depends on the recent trends in the industries
vii
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
16HSX01 English Communication Skills I

3103
Course Outcomes
1. Infer explicit and implicit meaning of a text
2. Construct clear, grammatically correct sentences using a variety of sentence structures
3. Analyze and Produce various types & formats of emails, letters in formal & informal ways to meet
particular purposes
4. Select and apply appropriate words and phrases in different contexts
5. Formulate and present ideas effectively in spoken form
6. Discuss social issues with concern and imagine possible solutions
COs – POs Mapping
COs PO10
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3
CO6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I
In London by M. K. Gandhi
Using appropriate word/phrases, synonyms and antonyms, nouns, pronouns, paragraph writing, changing
autobiography into biography
Montgomery Bus Boycott
11+4 Hours
Unit II
Pecuniary Independence by P. T. Barnum
Using appropriate word/phrases, synonyms and antonyms, Adjectives, Adverbs, Note-making, Rewriting
sentences and Short talk
TED-Sashi Tharoor
12+3 Hours
Unit III
The Drunkard by W. H. Smith
Similes, Rhythmic expressions, One-word substitution, Describing people, Synonym and Antonyms, Tenses
(past and present), Gerund and Verbal Adjective, Summarizing, essay writing, writing paragraph
Essay writing tips
11+4 Hours
Unit IV
Three Days to see by Hellen Keller
Deriving words, adjective formation, Tenses (future), prefixes, ModalAuxiliary verbs, Dialogue writing,
Expressing opinions/ideas, collecting information
Famous Indians with disability
11+4 Hours
Total:45+15 Hours
Textbook (s)
1. M. S. Rama Murty and M. Hariprasad, Prose for Communication Skills, Ravindra Publishing House,
Hyderabad, 2012
1
Reference (s)
1. J. Seely, Oxford Guide to Effective Writing and Speaking, OUP, 2013
2. Quirk, Greenbaum, Leech and Svartvk, A Comprehensive Grammar of the English language, Pearson,
India, 2010
3. R. Murphy, English Grammar in Use, 4th Ed, CUP, Cambridge, 2012
4. https://en.wikipedia.org/wiki/Montgomery_Bus_Boycott
5. https://www.ted.com/talks/shashi_tharoor?language=en
6. http://www.internationalstudent.com/essay_writing/essay_tips
7. http://www.thebetterindia.com/16449/famous-indians-with-disability
Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test 1 (%)
Remember 25 25 -
Understand 25 25 -
Apply 50 50 40
Analyze - - 30
Evaluate - - -
Create - - 30
Total (%) 100 100 100
Sample question (s)

Remember
1. Find a synonym for each of the following words.
i. Emulate ii. Mend
2. Find an antonym for each of the following words
i. Intensive ii. Extravagance
Understand
1. Sketch the personality of Edward Middleton as he emerges from the conversation in the play.
2. Summarize Gandhi’s attempts to model himself on the English gentleman and which circumstances
force him to realize that he has been pursuing a false idea?
Apply
1. Construct a dialogue between students about organizing music club activities in their college.
2. Construct a dialogue between two friends about how they plan their own careers.
Analyze and Create

1. Prepare an essay in about 300 words on ‘some concrete measures to combat pollution.
2. Create an imaginary conversation between a blind boy and his friend on their visit to a drama.
1
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
2
16MAX01 Engineering Mathematics I

3103
Course Outcomes
1. Classify and solve analytically a wide range of first and higher order ordinary differential equations
with constant coefficients
2. Apply the knowledge of Mean value theorems, Maxima and Minima of functions of several variables
3. Analyze the characteristics and trace the curve of an equation
4. Adapt methods for measuring lengths, volumes, surface area of an object and transformation of
coordinates in practical situations
5. Utilize basic knowledge of conservative field, potential function and work done in engineering
problems
6. Identify the relationships between line, surface and volume integrals
COs – POs Mapping

COs PO1 PO2
1 3 2
2 3 2
3 3 2
4 3 2
5 3 2
6 3 2
Unit I
Differential Equations
Differential equations of first order and first degree–exact, linear and Bernoulli Applications to Newton’s Law
of cooling, Law of natural growth and decay, orthogonal trajectories, Non-homogeneous linear differential
equations of second and higher order with constant coefficients with RHS term of the type e ax, Sin ax, cos ax,
polynomials in x, eaxV(x), xV(x)
Heat flow problems–Variation of parameters 11+4 Hours
Unit II
Mean Value Theroms and Functions of Several Variables
Generalized Mean Value theorem (All theorems without proof), Functions of several variables-Partial
differentiation, Functional dependence, Jacobian, Maxima and Minima of functions of two variables with
constraints and without constraints. Curve tracing-Cartesian-Polar and Parametric curves
Rolle’s, Lagrange’s and Cauchy’s mean value theorems–Generalized Mean Value theorem proofs
11+4 Hours
Unit III
Applications of Integration
Applications of Integration to Lengths, Volumes and Surface areas of revolution in Cartesian and Polar
Coordinates. Multiple integrals-double and triple integrals, change of variables (Cartesian and Polar
coordinates), Change of order of Integration
Applications of Integration–Centroid–Mass 12+3 Hours
Unit IV
Vector Calculus
Vector Differentiation-Gradient, Divergence, Curl and their related properties of sums-products,
Laplacianoperator, Vector Integration - Line integral, work done, Potential function, area, surface and volume
integrals, Vector integral theorems: Greens, Stokes and Gauss Divergence Theorems (All theorems without
proof) and related problems
Vector identities–Proof of Green’s theorem 11+4 Hours
Total:45+15 Hours
3
Textbook (s)
1. B. S. Grewal, Higher Engineering Mathematics, 42nd Ed., Khanna Publishers, New Delhi, 2012
2. E. Kreyszig, Advanced Engineering Mathematics, 9th Ed., Wiley, 2012
3. R. K. Jain, S. R. K.Iyengar, Advanced Engineering Mathematics, 4th Ed., NarosaPublishingHouse,
NewDelhi, 2014
Reference (s)
1. B. V. Ramana, Engineering Mathematics, 4th Ed., Tata McGraw Hill, New Delhi, 2009
2. D. S. Chandrashekharaiah, Engineering Mathematics, Volume 1, Prism Publishers, 2010
3. T. K. V. Iyengar, B. Krishna Ghandhi, S. Ranganathan and M.V. S.S.N. Prasad, Engineering
Mathematics, Volume-I, 12th Ed., S. Chand Publishers, 2014
4. U. M. Swamy, P. VijayaLaxmi, K. L. Sai Prasad and M. Phani Krishna Kishore, A Text Book of
Engineering Mathematics–I, Excel Books, New Delhi, 2010

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test2 (%)
Remember 30 30 -
Understand 40 40 -
Apply 30 30 60
Analyze - - -
Evaluate -- - 30
Create -- - 10
Total (%) 100 100 100
Sample question (s)

Remember
1. Find the Integrating factor of x 2
  
y  2 xy 2 dx  x 3  3x 2 y dy  0

2. Define solenoidal and irrotational for a Vector point function f .
3. Find the volume of solid generated by the revolution of the cardioid r = a(1+cos𝜃) about the initial line
𝜃=0
Understand
Solve ( D  4 D  4) y  0
2
1.
d2 y dy
2. Solve 2
 6  25 y  e2 x  Sin x
dx dx
3. Find the volume of the greatest rectangular parallelopiped that can be inscribed in the ellipsoid
x2 y 2 z 2
  1
a 2 b2 c 2
Apply
1. A body originally at 80 0Ccools down to 60 oC in 20 minutes, the temperature of the air being
40oC.What will be the temperature of the body after 40 minutes from original?
∞ ∞ 𝑒 −𝑦
2. Evaluate the integral by the change of order of integration ∫0 ∫𝑥 𝑑𝑦 𝑑𝑥
𝑦
3. Show that the vector (𝑥 − 𝑦𝑧)𝑖̅ + (𝑦 − 𝑥𝑧)𝑗̅ + (𝑧 − 𝑦𝑥)𝑘̅ is irrotational and find its Scalar
2 2 2
potential
Create
1. Apipe 20 cm in diameter contains steam at 200 0C. It is covered by a layer of insulation 6cm thick and
thermal conductivity 0.0003. If the temperarature of the outer surface is 30 oC. Find the heat lose per
hour from 2 meter length of the pipe
2
4
16PYX01 Engineering Physics

3103
Course Outcomes
1. Illustrate the concepts of Interference, Diffraction, Polarization and their applications
2. Summarize the concepts of electric fields, magnetic fields and superconductivity and make out the
scope of applications in various engineering fields
3. Outline the quantum mechanics to infer conductivity nature of metals
4. Explain the properties and application of dielectric, magnetic and Nano-materials
5. Demonstrate the emission of laser light, optical fibers and their applications in various Engineering
fields
6. Analyze the engineering Applications based on Fundamental concepts
COs – POs Mapping
COs PO1 PO2
1 3 2
2 3 2
3 3 2
4 3 2
5 3 2
6 3 2
Unit I
Optics
Interference:Superposition of waves-Coherence-Young's double slit experiment-Interference in thin films by
reflection (Qualitative treatment)–Newton's rings.Diffraction: Fresnel and Fraunhoffer diffractions-Fraunhoffer
diffraction at a single slit-Diffraction grating-Grating spectrum, Polarization–Types of Polarization-Double
refraction-Nicol prism-Quarter and Half wave plate. Lasers: Characteristics of laser–Stimulated absorption–
Spontaneous emission-Stimulated emission–Population inversion–Pumping mechanism–Active medium–Laser
systems: Ruby laser-He-Ne laser–Semiconductor laser–Applications of Lasers
Wedge shaped film–Polarization–Holography
12+4 Hours
Unit II
Electrostatics and Electromagnetism
Gauss law in electricity and it’s applications: Coulomb’s law from Gauss law-spherically distributed charge-
Infinite line of charge-Infinite sheet of charges–Ampere's Law-Magnetic field due to current (Biot-Savart’s
Law)-B due to a current carrying wire and a circular loop,-Faraday’s law of induction-Lenz’s law-Induced
fields-Maxwell’s equations (Qualitative treatment)-Hall Effect-Electromagnetic Wave and poynting vector
(Qualitative treatment), Superconductivity–Superconductivity phenomenon-General properties-Meissner effect-
Penetration depth-Type I and type II superconductors-Flux quantization-DC and AC Josephson effect-
Applications of superconductors
Infinite line of charge–Infinite sheet of charges Quantum Interference (SQUID)
11+3 Hours
Unit III
Quantum Theory of Solids–Semiconductors–Optical Fiber
Quantum theory of solids: Dual nature of matter, properties of matter waves-Schrödinger’s wave equation–
Physical significance of wave function–Particle in a box (one dimensional)-Free electron theory of metals,
electrical conductivity-quantum free electron theory–Fermi Dirac Distribution-Kronig-Penney model
(qualitative)-Classification of materials into conductors-semi-conductors & insulators. Semiconductors: Carrier
Concentration (Intrinsic and Extrinsic, qualitative treatment only), Carrier drift, Carrier diffusion, Optical Fiber:
–principle and propagation of light in optical fibers–Numerical aperture and acceptance angle–types of optical
5
fibers–single and multimode, step index and graded index fibers–applications–fiber optic communication
system
Uncertainty principle–Intrinsic and Extrinsic Semiconductor–Fiberoptic sensors
12+4 Hours
Unit IV
Magnetic, Dielectric & Nanomaterials
Magnetic Materials: Origin of magnetic moment (Bohr Magneton)-Classification of Magnetic materials-Dia,
para, ferro, Anti-ferro and Ferri magnetism-Domain and Weiss field theory (qualitative treatment only)-
Hysteresis Curve-Soft and Hard magnetic materials-Applications of magnetic materials
Dielectric Materials: Dielectric Polarization-Electronic, ionic and orientation polarizations (Qualitative treatment)
-Dielectrics in alternating fields-frequency dependence of the Polarizability ((Qualitative treatment), Important
dielectric materials
Nanomaterials: Introduction to nano materials-Physical, mechanical-electrical and optical properties of nano
materials-Preparation techniques of nano materials (Sol-Gel, CVD, Ball Milling)-Nano tubes-Different methods
of preparation carbon nano tubes (CNT’s) (CVD)-Applications of Nanomaterials
Permeability–Magnetization–Dielectric constant–Ferro and Piezo electric effect and materials
10+4 Hours
Total:45+15 Hours
Textbook (s)
1. Halliday, Resnick and Krane, Physics Part-II, Wiley India Pvt. Ltd, 2012
2. S. O. Pillai, Solid State Physics, 6th Ed., Newage International Publishers, 2015
3. M. R. Srinivasan, Engineering Physics, 2nd Ed., Newage International Publishers, 2014
4. A. S. Vasudeva, Modern Engineering Physics, S. Chand and Company, New Delhi, 2006
5. C. M. Srivastava and C.Srinivasan, Science of Engineering Materials, Wiley Eastern Pvt. Ltd, 1997
6. C. P. Poole and F. J. Owens, Introduction to Nanotechnology, Wiley, New Delhi, 2007
Reference (s)
1. R. K. Gour and S. L. Gupta, Engineering Physics, Dhanpathrai Publications, New Delhi, 2002
2. V. Rajendran, Engineering Physics, McGraw Hill Education (India) Private LTD, 2010
3. M. Armugam, Engineering Physics, Anuradha Agencies, 2007

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test 3(%)
Remember 40 40 -
Understand 40 40 -
Apply 20 20 80
Analyze - - 20
Evaluate - - -
Create - - -
Total (%) 100 100 100
Sample question (s)

Remember
1. Define Principle of Superposition?
2. State Faraday’s law of electromagnetic induction and Lenz’s law.
3. Summarize Meissenr’s effect of super conductors.
Understand
1. Explain the construction and working principle of Nicole’s prism.
2. Construct Ruby laser and explain its working principle with energy level diagram.
3. Conclude the inferences from the M-H characteristics of Type-1 and Type-2 super conductors.
3
6
Apply
1. List any four applications of lasers with reference to their characteristics.
2. Apply Biot-Savart’s law, and calculate the Magnetic field induction along the infinite length of a straight
conductor at points close to the conductor.
3. Calculate electric field intensity due to infinite line of charge by applying Gauss law.
Analyze
1. Compare Fraunhoffer’s diffraction and Fresnel’s diffractions.
2. Discuss the role of Meta stable states in lasing action.
3. Discuss the BCS theory of Superconductors.
7
16MEX01 Engineering Mechanics

3103
Course Outcomes
1. Draw the free body diagram of a given physical system and compute the resultant of a given coplanar
system of forces
2. Estimate the centroid of composite figures and bodies
3. Estimate area moment of inertia and mass moment of inertia of composite figures and bodies
4. Explain concepts of friction and principle of virtual work
5. Summarize power transmission through belts
6. Analyze plane truss (frame) by method of joints and method of sections
COs – POs Mapping
COs PO1 PO2 PO3
1 3 2 2
2 3 2 2
3 3 2 2
4 3 2 2
5 3 2 2
6 2 3 3
Unit I
System of forces-Equilibrium of system of forces
Types of Force systems-Coplanar Concurrent Forces–Resultant–Moment of a Force and its application–
Couples and Resultant of a Force System, Free body diagrams, equations of equilibrium of coplanar concurrent
and non-concurrent force systems, Lami’s theorem, resolution of a force into a force and a couple
Polygon law of forces for resultant
11+4 Hours
Unit II
Centroid-Centre of Gravity-Area Moments of Inertia-Mass Moment of Inertia
Centroids of simple figures (from basic principles)-Centroids of Composite Figures, Centre of gravity of simple
body (from basic principles), center of gravity of composite bodies, Definition–Moments of Inertia of simple
Figures, Polar Moment of Inertia, Transfer Theorem, Moments of Inertia of Composite Figures. Definition,
Moment of Inertia of simple bodies, Transfer Formula for Mass Moments of Inertia
Mass moment of inertia of composite bodies
12+4 Hours
Unit III
Friction-Power transmission through belts
Theory of friction–Angle of friction–Laws of friction-static friction–Kinetic friction, friction in bodies moving
up or down on an inclined plane-Introduction to belt and rope drives, types of belt drives, velocity ratio of belt
drives, slip of belt drives, tensions for flat belt drive, angle of contact, centrifugal tension, maximum tension of
belt
Condition for transmission of maximum power
11+4Hours
Unit IV
Analysis of perfect frames (Analytical Method)-Virtual Work
Types of Frames-Assumptions for forces in members of a perfect frame, Method of joints, Method of sections,
Force table, Cantilever Trusses, Structures with one end hinged and the other freely supported on rollers
carrying horizontal or inclined loads, Principle of Virtual Work-Application of the Principle of Virtual Work-
potential Energy and Equilibrium
Stable and Unstable Equilibrium 11+3 Hours
Total: 45+15 Hours
8
Textbook (s)
1. K. Vijay Kumar Reddy, J. Suresh Kumar, Singer's Engineering Mechanics Statics and Dynamics, BS
Publications, 3rd Edition, 2011
2. A. K. Tayal, Engineering Mechanics Statics and Dynamics, Umesh Publications, 14th Edition, 2011
3. S. S. Bhavikatti, Engineering Mechanics, New Age International, 2008
4. S. Timoshenko & D. H. Young, and JV Rao, Engineering Mechanics, 4th Ed., TMH Education, 2006
Reference (s)
1. Irving H. Shames and G. Krishna MohanaRao, Engineering Mechanics, 4 th Ed., Pearson, 2006
2. R. K. Bansal, Engineering Mechanics, Laxmi Publications, 2004
Remember 20 20 -
Understand 30 30 -
Apply 50 50 60
Analyze -- - 40
Evaluate -- - -
Create -- - -
Total (%) 100 100 100
Sample question (s)
Remember
1. Define centroid
2. List the different types of belt drives
3. Define angle of repose
Understand
1. Explain Lami’s theorem
2. Compare mass moment of inertia and area moment of inertia
3. Explain the difference between frame and truss
Apply
1. Solve the resultant of three forces acting on a hook as shown in below figure
2. Identify the centroid of T-section shown in below figure
3. Solve to find the power transmitted by a belt running over a pulley of 600 mm diameter at 200 r.p.m.
The coefficient of friction between the belt and the pulley is 0.25, angle of lap 160° and maximum
tension in the belt is 2500 N
4
9
16CSX01 Problem Solving using C

3103
Course Outcomes
1. Develop the flow charts and algorithms, and then implement, compile and debug programs in C
language for solving a problem
2. Design programs involving decision structures, loops for problem solving
3. Design programs to develop applications using array data structure
4. Solve scientific problems using functions
5. Make use of pointers to design applications for efficient and dynamic memory allocation
6. Design programs to create/update basic data files
COs – POs Mapping

COs PO1 PO2 PO3
1 3 3 3
2 3 3 2
3 3 3 2
4 3 3 3
5 2 2 3
6 2 3 3
Unit I
Programming Basics
Introduction, Algorithm / pseudo code, flowchart, program development steps, structure of a C program, Types,
Operators, and Expressions: C-tokens, Variable Names, Data Types and Sizes, Constants, Declarations, C-
operators, Type Conversions, Precedence and Order of Evaluation
Control Flow: Statements and Blocks, If-Else, Else-If, Switch, Loops-While and For, Loops- Do-while, Break
and Continue
Comma and size of operators–Conditional Expressions–goto and Labels
12+3 Hours
Unit II
Arrays and Functions
Array concept, definition, declaration, accessing elements, storing elements, strings and string manipulations, 2-
D arrays, Multidimensional arrays, Array Applications
Basics of Functions, Functions Returning Non-integers, External Variables, Scope Rules, Static Variables,
Block Structure, Storage Classes, user defined functions, standard library functions, recursive functions, passing
Arrays to functions, Functions Applications
Arithmetic operations on string–nesting of functions–preprocessor commands
11+4 Hours
Unit III
Pointers and Structures
Pointer concepts, initialization of pointer variables, pointers and function arguments, passing by address,
dangling memory, address arithmetic, Character pointers and functions, pointers to pointers, dynamic memory
management functions
Basics of Structures, Structures and Functions, Arrays of Structures, Pointers to Structures, Self-referential
Structures, typedef, Unions
Programs on Dynamic memory management using functions–Table Lookup
11+4 Hours
Unit IV
File Structures
Standard Input and Output, Formatted Output-printf, Variable-length Argument Lists, Formatted Input-scanf,
File Access
Data Structures: Introduction to linear and non-linear data Structures, definition: stack, queue
10
Error Handling-stderr and exit–Introduction to Single Linked Lists

11+4 Hours
Total: 45+15 Hours
Textbook (s)
1. B. W. Kernighan, Dennis M. Ritchie, The C–Programming Language-, 2nd Ed., PHI, 1990
2. H. Sahni and A. Freed, Fundamentals of Data Structures in C, 2 nd Ed., Universities Press, 2008
Reference (s)
1. Y. Kanetkar, Let us C, 8th Ed., BPB Publication, 2004
2. F. E. V. Prasad, C Programming: A Problem-Solving Approach, Giliberg, Cengage, 2010
3. A. S. Tenenbaum, Y. Langsam and M. J. Augenstein,Data Structures using C, Pearson Education, 2009
Remember 25 20 -
Understand 35 40 -
Apply 40 40 40
Analyze - - 40
Evaluate - - 20
Create - - -
Total (%) 100 100 100
Sample question (s)

Remember
1. Define computer
2. List out operators
3. What is dangling pointer
Understand
1. Explain structure of a c program
2. Describe linear and nonlinear data structures
3. Explain multidimensional arrays
Apply
1. Implement matrix multiplication using arrays
2. Draw flow chart of program development steps
3. Demonstrate pointe to pointer concept.
Analyze
1. Compare structure and union
2. Differentiate logical and relational operators
3. Classify linear and nonlinear data structures
5
11
16PYX02 Engineering Physics Lab

0032
Course Outcomes
1. Build the knowledge in the scientific methods and learn the process of measuring different physical
parameters
2. Develop the laboratory skills in handling of electrical and Optical instruments
3. Demonstrate the interference and diffraction phenomena of light
4. Inspect and experience physical principles of Magnetic fields and optical fiber communications
5. Apply the principles of physics and measure the solid state properties of materials
6. Design and analyze experiment based on physics concepts
COs – POs Mapping
COs PO4
1 3
2 3
3 3
4 3
5 3
6 3
List of Experiments
1. Variation of magnetic field along the axis of current-carrying circular coil-Stewart and Gee’s Method
2. Determination of wavelengths of spectral line of mercury spectrum using diffraction grating
3. Determination of radius of curvature of convex lens by forming Newton’s rings
4. LCR circuit- Study of parallel and series Resonance
5. Measurement of thickness of a thin paper using wedge method
6. Fiber optics-Numerical aperture of a given fiber and study of bendig losses
7. Meldie’s Experiment–Transverse and longitudinal modes
8. Determination of wave length of Laser by diffraction grating
9. Determination of Hall Coefficient and charge carrier density of semi-conductor
10. Determination of Band gap of a semiconductor
List of Augmented Experiments 6

1. To study the magnetization (M) of a ferromagnetic material in the presence of a magnetic field B and to
plot the hysteresis curve (M vs. B)
2. Study theThermoemf of the thermo couple
3. LCR Series and Parallel–Design of circuit for various resonance frequencies
4. Determination of characteristics of Laser beam
5. Determination of Horizontal component of earth’s magnetic field
6. Study of double refraction in calcite crystals
7. Dispersive power of various liquids using spectrometer
8. Photo cell–Characteristics and determination of Planks constant
Reading Material (s)

1. Physics Lab manual–Department of Physics, BS & H, GMRIT, Rajam, 2015
2. Y. Aparna and K. Venkateswararao, Engineering Physics–I and II, VGS Techno series, 2010
3. S. Panigrahi and B. Mallick, Engineering Practical Physics, Cengage leaning, Delhi, 2015
6
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
12
16CSX02 Problem Solving using C Lab

0032
Course Outcomes
1. Implement, compile and debug programs in C language for solving a problem
2. Design programs involving decision structures, loops for problem solving
3. Design programs to develop applications using array data structure
4. Apply functions to solve real world problems
5. Make use of pointers to design applications with efficient use of memory
6. Design programs to create/update basic data files
COs – POs Mapping

COs PO4
1 3
2 3
3 3
4 3
5 3
6 3
List of Experiments
1. Algorithms and Flow charts design and evaluation (Minimum 2)
2. Write C Programs to demonstrate C-tokens and operators
3. Write C Programs to demonstrate Decision Making And Branching (Selection)
4. Write a C program to demonstrate different loops
5. Write a C program to demonstrate arrays
6. Write a C program to demonstrate functions
7. Write a C program to implement the following
A. To manipulate strings using string handling functions.
B. To manipulate strings without using string handling functions
8. Write a C program to demonstrate different library functions
9. Write a C program to implement the following
A. To exchange two values using call by value and reference
B. To multiply two matrices using pointers
10. Write a C program to demonstrate functions using pointers
11. Write a C program to implement the following operations using structure and functions:
i) Reading a complex number ii) Writing a complex number
12. Write a C program
A. To copy data from one file to another
B. To reverse the first n characters in a given file (Note: The file name and n are specified on the
command line)
1. Merging of two arrays
2. Arithmetic operations on two complex numbers
3. Employee's Management System
4. Library management
5. Department store system
6. Personal Dairy Management System
7. Telecom Billing Management System
8. Bank Management System
9. Contacts Management
10. Medical Store Management System

1. C Programming Lab manual–Department of CSE-GMRIT Rajam
7
13
16MEX02 Engineering Drawing

0032
Course Outcomes
1. Understand Principles of engineering drawing
2. Construct Conic sections using general methods and other methods
3. Construct Orthographic projections of Points, Lines and Planes
4. Construct Orthographic projections of Solids using basic drafting software
5. Construct Isometric projections using basic drafting software
6. Construct Orthographic projections from given isometric projections of an object and vice versa
COs – POs Mapping

COs PO4 PO9 PO10
1 3 3 3
2 3 3 3
3 3 3 3
4 3 3 3
5 3 3 3
6 3 3 3
List of Experiments
Unit I
Conic Sections-Introduction to Orthographic Projections
Construction of conics using general method and other special methods
Orthographic Projections of Points, Straight Lines parallel to both planes, parallel to one plane and inclined to
other plane
9 Hours
Unit II
Orthographic Projections of Straight Lines and Planes
Projections of Straight Lines inclined to both planes; Projections of Planes; Regular Planes Perpendicular
Parallel to one Reference Plane and inclined to other Reference Plane; inclined to both the Reference Planes
Practice the following topics by using any one 2D drafting software
9 Hours
Unit III
Projections of Solids &Isometric Projections
Projections of Prisms, Cylinders, Pyramids and Cones with the axis inclined to one Principal Plane and Parallel
to the other, Projections of Prisms, Cylinders, Pyramids and Cones inclined to both the Principal Planes
Introduction to Isometric Projections, Isometric axes, angles, Isometric views, Construction of Isometric views
of Simple planes and Solids in various positions
9 Hours
Unit IV
Conversion of Engineering Views
Conversion of Orthographic Views of Simple Solid objects into Isometric View, Conversion of Isometric View
of Simple Solid objects into Orthographic Views
18Hours
Total: 45 Hours
List of Drawing Sheets
1. Conics by General Method
2. Conics by using Special Methods
3. Projections of Points and Straight lines in Simple Positions
4. Projections of Lines inclined to both planes
5. Projections of Planes in Simple positions
14
6. Projections of Planes inclined to both planes

7. Projections of Solids
8. Projections of Solids inclined to both planes
9. Isometric Projections
10. Conversion of Orthographic views into Isometric views
11. Conversion of Isometric views into Orthographic views

1. Draw the Knuckle Pin and fork end of the knuckle joint
2. Draw the Socket and spigot cotter joint
3. Draw the Tommy bar and body of the Screw jack
4. Draw the Cup and Big and Small screws of screw jack
5. Draw the Connecting rod of IC Engine using AutoCAD
6. Draw the Pipe spool with flanges and a valve
7. Draw a sample pipe line construction design in oil and gas industries using AutoCAD
8. Draw the Pipe truss design using AutoCAD
9. Draw a 3-D bolt and nut with Threads using AutoCAD
10. Draw a 3-D Cross head pattern using AutoCAD
11. Draw the sample Bridge using AutoCAD
12. Draw the pipe vice using AutoCAD
13. Draw the Ni-Cd Battery zapper circuit diagram using AutoCAD
14. Draw the circuit diagram of battery charger with automatic cutoff using AutoCAD
15. Draw the satellite dish and Antenna using AutoCAD

Textbook (s)
1. N.D. Bhatt, V. M. Panchal, Pramod R. Ingle, Engineering drawing, Charotar Publications, 54th Edition,
2014
2. D. M. Kulkarni, A.P. Rastogi, Ashoke K. Sarkar, Engineering Graphics with Auto CAD, Prentice Hall
of India, 2nd Edition, 2010
Reference (s)
1. K. C. John, Engineering Graphics for Degree, PHI Publications, 2nd Edition, 2009
2. M. B. Shah and B. C. Rana, Engineering Drawing, Pearson Publishers, 2nd Edition, 2009
3. D. A. Jolhe, Engineering Drawing, Tata McGraw-Hill Education, 1st Edition, 2008
8
15
16HSX03 English Communication Skills II

3103
Course Outcomes
1. Build new academic vocabulary & phrases and make use of them in different contexts
2. Construct clear, grammatically correct sentences using a variety of sentence structures
3. Analyze and Produce various types & formats of emails, letters in formal & informal ways to meet
particular purposes
4. Compose and present ideas logically in written form
5. Organize ideas effectively in spoken form
COs – POs Mapping
COs PO10
1 3
2 3
3 3
4 3
5 3
6 3
Unit I
The Knowledge Society by A. P. J. Abdul Kalam
Forming Negative words, Quantifiers, Letter Writing, Interviews, Scientific Terminology
Famous Indian Scientist Inventions
11+4 Hours
Unit II
Principles of Good Writing by L. A. Hill
Word definitions, Articles, e-mail writing, Debates, Noticing changes in English, Origin and meaning of
borrowed words
Effective writing tips
11+4 Hours
Unit III
Man’s Peril by Bertrand Russell
Deriving nouns, Prepositions, Phrasal verbs, Speeches, Report Writing, Problem solving
Bertrand Russell and Einstein Manifesto
12+3 Hours
Unit IV
Shooting an Elephant by George Orwell
Using an appropriate word, conjunctions, voices, Cover letters, Resume, Dialogue writing, Group Discussion
Abridged version of Animal Farm
11+4 Hours
Total :45+15Hours
Textbook (s)
1. M. S. Rama Murty and M. Hariprasad, Prose for Communication Skills, Ravindra Publishing House,
Hyderabad, 2012
16
Reference (s)
1. J. Seely, Oxford Guide to Effective Writing and Speaking, OUP, 2013
2. Quirk, Greenbaum, Leech and Svartvik, A Comprehensive Grammar of the English language, Pearson,
India, 2010
3. Raymond Murphy, English Grammar in Use, 4th Ed, CUP, Cambridge, 2012
4. http://www.famousscientists.org/15-famous-indian-scientists-inventions/
5. http://www.grammarbook.com/grammar/effWrite.asp
6. https://en.wikipedia.org/wiki/Russell%E2%80%93Einstein_Manifesto)
7. http://cbhs.portlandschools.org/UserFiles/Servers/Server_1098483/File/Migration/Animal-Farm-
Abridged.pdf

Remember 25 25 -
Understand 25 25 -
Apply 50 50 40
Analyze 30
Evaluate -- - -
Create -- - 30
Total (%) 100 100 100
Sample question (s)

Remember
1. Write one synonym for each of the following words.
a) Generate (b) Vivid
2. Write an antonym for each of the following words.
a) Unique (b) Interesting
3. Fill in the blanks with some or any in the following sentences.
a) There isn’t ______ milk here.
b) She has _____ books and pens.
Understanding
1. Read the following passage
There is no dearth of fake patriotism in the world to disguise one’s weakness of failure in
administration and planning. It rather becomes an instrument in the hands of dictators and selfish rulers to keep
their position safe. One can hear the slogans of patriotism on both the sides of the line of demarcation in the
Indian sub-continent. When there is dissatisfaction among the masses these slogans would be raised—‘danger is
lurking on the borders’, ‘the enemy is making preparation to attack our country’. This is not patriotism but
perverse thinking for selfish motives. Patriotism does not require a whip to rouse the sentiments of the people—
if it is true patriotism. The unity achieved during war may be a result of apprehension of slavery, not necessarily
true emotion generated by patriotism. It is in the blood of the people to mould their life according to the needs of
the motherland. It is not in the expediency to create circumstances befitting one’s own interests. It is rather
regrettable that patriotism is the greatest casualty in almost all the fields in our country. Political expediency and
self-motives have become supreme, to the extent that even to talk of patriotism is labeled as puerile of
reactionary. Let us take inspiration from the young girl who wept and cried bitterly for she could not offer
flowers on the war memorial in London, for none of her forefathers had laid his life for the cause of the nation.
Let us inculcate this noble spirit among people if we have to bring back the glory that was India.
Answer the following question.
a) Show the effect of fake patriotism?
b) When are the slogans of patriotism raised?
c) Is this type of patriotism real patriotism? Whom does it benefit?
d) Is the unity during war real patriotism? Does true patriotism require any instigation?
e) What does the author regret?
f) Explain the result of political expediency and selfish motives?
9
17
g) Why did the little girl cry bitterly? Do we learn anything from her?
h) Locate the synonym of the word ‘conceal’ from the passage.
i) Find the antonym of the word ‘cheerful’ from the passage.
j) Suggest a suitable title to the passage.
2. Read the following passage and answer the questions on it:
Many matters, however, are less easily brought to the test of experience. If, like most of mankind, you have
passionate convictions on many such matters, there are ways in which you can make yourself aware of your own
bias. If an opinion contrary to your own makes you angry, that is a sign that you are subconsciously aware of
having no good reason for thinking as you do. If someone maintains that two and two are five, you feel pity
rather than anger, unless you know so little of arithmetic that his opinion shakes your own conviction. The most
savage controversies are those about matters as to which there is no good evidence either way. Persecution is
used in theology, not in arithmetic because in arithmetic there is knowledge, but in theology there is only
opinion. So, whenever you find yourself getting angry about your difference of opinion, be on your guard; you
will probably find, on examination, that your belief is going beyond what the evidence warrants.
Answer the following questions

a) Do you consider the content of the passage, legal or logical? Ans: logical
b) Is the author of the passage finally telling you about changing your opinion? Ans: No giving info.
c) According to the passage when do we feel pity? Ans: When someone knowledge so poorer then
minimum standards.
d) What is the meaning of the word ‘savage’ as used in the passage? Ans: uncivilized / unfair
e) What is the general reaction to an opinion contrary to your own? Ans: we get angry at first.
f) ‘In arithmetic there is no scope for opinion’-explain.
Apply
1. Develop an essay on the theme of “Digital India and its consequences” in about 200 words.
2. Write a letter to your friend who is exclusively occupied with his studies. Advise him to take part in
games
Analyze
1. Discuss the chief components of knowledge society with reference to India according to Dr. A. P. J.
Abdul Kalam.
2. Analyze L. A. Hill’s principles of good writing in achieving ‘vivid expression, simple and
conversational tone’ to make the writing interesting to the readers.
3. Explain how L.A. Hill’s principles of good writing are helpful to become a successful writer. (in about
250 words)
Create
1. Imagine yourself to be the instructor of a course in which 75 students have registered. Draft an email to
all your students asking them to prepare a presentation on the topic of their choice.
2. Build a model essay on impact of social media on youth.
18
16MAX02 Engineering Mathematics II

3103
Course Outcomes
1. Apply matrix knowledge to Engineering problems
2. Solve problems related to engineering applications using integral transform techniques
3. Make use of Laplace transforms in solving the differential equations with the initial and boundary
conditions
4. Apply the concept of Fourier series of periodic functions and expand a function in sine and cosine
series
5. Solve problems related to basic linear and non-linear partial differential equations
6. Formulate and solve some of the physical problems of engineering using partial differential equations
COs – POs Mapping
COs PO1 PO2
1 3 3
2 3 2
3 3 2
4 3 2
5 3 2
6 3 2
Unit I
Matices
Linear systems of equations: Rank-Echelon form, Normal form–Solution of Linear Systems–Rank Method and
Gauss Seidal Method
Eigen values–Eigen vectors–Properties–Cayley-Hamilton Theorem (without proof)–Inverse and powers of a
matrix by using Cayley-Hamilton theorem, Quadratic forms-Reduction of quadratic form to canonical form–
Rank–Positive, negative, semi definite–index–signature
LU Decomposition Method
11+4 Hours
Unit II
Laplace Transforms
Laplace transforms of standard functions–Shifting Theorems, Transforms of derivatives and integrals–Unit step
function–Dirac delta function
Inverse Laplace transforms by Partial fractions–Convolution theorem (without proof)-Application of Laplace
transforms to ordinary differential equations with constant coefficients
Laplace Transform of Periodic Functions 11
11+4 Hours
Unit III
Fourier Series and Transformations
Fourier series–even and odd functions–Half-range sine and cosine series, Fourier integral theorem (without
proof)–Fourier transforms–sine and cosine transforms–properties–inverse transforms–Finite Fourier transforms
Fourier Transform of Convolution Products
12+3 Hours
Unit IV
Partial Differential Equations and Applications
Formation of partial differential equations-by elimination of arbitrary constants and arbitrary functions–
solutions of first order linear (Lagrange) equations and nonlinear equations (standard types)–Method of
19
Separation of Variables-Applications to wave equation, heat conduction equation in one dimension and
homogeneous Laplace equation in Cartesian coordinates in two dimensions
Charpits Method
11+4 Hours
Total:45+15 Hours
Textbook (s)
1. B. S. Grewal, Higher Engineering Mathematics, 42nd Ed., Khanna Publishers, New Delhi, 2012
2. S. R. K. Iyengar, R. K. Jain, Advanced Engineering Mathematics, 4th Ed., Narosa Publishing House,
New Delhi, 2014
3. B. V. Ramana, Engineering Mathematics, 4th Ed., Tata McGraw Hill, New Delhi, 2009
Reference (s)
1. T. K. V. Iyengar, B. Krishna Ghandhi, S. Ranganathan and M. V. S. S. N. Prasad, Engineering
Mathematics, 12th Ed.,Volume–I, S. Chand Publishers, 2014
2. U. M. Swamy, P. Vijaya Laxmi, K. L. Sai Prasad and M. Phani Krishna Kishore, A Text Book of
Engineering Mathematics–II, Excel Books, New Delhi, 2010
3. D. S. Chandrashekharaiah, Engineering Mathematics, Vol–1, Prism Publishers, 2010
4. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Ed., Wiley, 2012

Remember 30 30 -
Understand 40 40 -
Apply 30 30 60
Analyze - - -
Evaluate -- -- 30
Create -- -- 10
Total (%) 100 100 100
Sample question (s)

Remember
1. Define rank of the matrix
2. Define unit step function
3. Write the Fourier sine transform of 𝑓(𝑥)
Understand
1. If 𝑓(𝑥) = 𝑥 𝑛 , 𝑛 ∈ ℕ in the interval[−𝜋, 𝜋], then for what values of 𝑛 the Fourier series of 𝑓(𝑥)
contains only sine terms
2. Form the partial differential equation by eliminating arbitrary constants𝑎, 𝑏 from
z  ( x 2  a)( y 2  b)
3. Evaluate L 2t 
Apply
1. Use Laplace transform technique to solve the differential equation

y ''  2 y '  3 y  sin t if
y (0)  0, y '(0)  0.
𝑠
2. Using Convolution theorem, find 𝐿−1 [(𝑠2+𝑎2)2 ]
3. A tightly stretched string with fixed end points x  0 and x  l is initially in a position given by
x
y  y0 Sin 3 . If it is released from rest from this position, find the displacement y ( x, t )
l
10
20
Create
1. Compare the direct and iterative methods in solving system of equations.
2. Identifying the method to solve sparse systems.
3. What is the advantage of Fourier series over the Taylor’s series in some real time problems?
21
16CYX01 Engineering Chemistry

3103
Course Outcomes
1. Outline the fundamental chemistry with an applied perspective as future engineers with a focus on
engineering and industry
2. Analyze the quality of water and its treatment methods for domestic and industrial applications
3. Utilize the polymers, plastics, elastomers and advanced materials (Nano materials) as engineering
materials and apply them in domestic and industrial life
4. Infer the concepts of renewable & non-renewable energy sources, quality of fuels and apply a suitable
fuel as an energy source
5. Outline the corrosion factors and implement the prevention measures
6. Interpret the Nernst equation for electrode potentials and construction and working of various types of
energy storage devices
COs – POs Mapping
COs PO1 PO2
1 3 2
2 3 2
3 3
4 3 2
5 3
6 3 2
Unit I
Water Technology & Advanced Materials
Water technology: sources of water–hardness of water–disadvantages of hard water–boiler troubles–internal
treatment methods, softening methods–lime soda, zeolite, ion exchange and reverse osmosis -specifications for
drinking water–BIS & WHO standards–municipal water treatment–analysis of water for hardness, chloride &
fluoride, numerical problems
Advanced materials–Nanomaterials–Introduction–Preparation by chemical methods–Characterization–SEM–
Applications in industry–solar, water purification and battery technology
Preparation of some important membranes for reverse osmosis process
12+3 Hours
Unit II
Polymers & Composites
Polymers: Introduction–Advantages of polymers over Metals and Alloys; Types of polymers–Types of
polymerization–Physical properties: viscosity, polydispersity, molecular weight distribution etc., and
mechanical properties–Plastics: Thermosetting & thermoplastics–Compounding of plastics–Moulding methods
(Compression, Injection, Transfer, Extrusion)–Preparation, Properties and Engineering applications of important
industrial polymers–Poly Ethylene, Poly Styrene, PVC, PTFE, Bakelite–Molecular Imprinting Polymers (MIP)
–Conducting Polymers–Biodegradable polymers-Fiber reinforced plastics-Glass fiber reinforced plastic–Bullet
Proof Plastics–Rubbers: processing of natural rubber–Vulcanization and compounding of rubber–Engineering
applications of rubber
Inorganic rubbers-silicone rubbers
11+4 Hours
Unit III
Fuels & Energy Resources
Fuels–Introduction-Calorific value–determination of calorific value–Bomb calorimeter and Junker’s
calorimeters-Classification of fuels–characteristics of a good fuel–classification and analysis of coal-Extraction
of Crude Oils–refining of crude oil–Cracking-Thermal and Catalytic cracking–Synthetic petrol–Polymerization,
Fischer Tropsch and Bergius processes–Knocking–Anti Knocking–Octane &Cetanenumber–ASTM standards of
22
fuels–Energy Resources: Energy scenario in India–working of thermal power plants–advantages and

disadvantages–non Renewable energy–solar energy–harnessing of solar energy–solar heaters–photo voltaic
cells–bio energy–biodiesel
Rocket fuels
11+4 Hours
Unit IV
Corrosion & Energy Systems
Introduction–process of corrosion–Dry corrosion–Wet corrosion–galvanic corrosion–concentration cell
corrosion–water line corrosion–pitting corrosion–stress corrosion–Factors influencing corrosion–Control of
corrosion–Proper designing–passivity–using alloys–modifying the environment–using corrosion inhibitors:
Inorganic and Organic inhibitors-Cathodic protection–Metallic coatings–galvanization and tinning-Industrial
examples of high corrosion
Electrochemical energy systems:Introduction–Electrode potential–Nernst equation–EMF of cell–Storage
devices–Batteries: primary cell–dry cell; secondary cells–Lead acid battery, Lithium ion battery, flow batteries–
H2–O2 fuel cell and Photo galvanic cell
Organic coatings
11+4 Hours
Total:45+15 Hours
Textbook (s)
1. P. C. Jain and Monica Jain, Engineering Chemistry, 16th Ed., Dhanpat Rai Publishing Company, New
Delhi, 2015
2. S. S. Dara, A Textbook of Engineering Chemistry, S. Chand and Company Limited, New Delhi, 1994
3. C. N. R. Rao, A. Muller and A. K. Cheetham, Nanomaterials Chemistry: Recent Developments and
New Directions, 2010
Reference (s)
1. S. Chawla, A Textbook of Engineering Chemistry, 3rd Ed., Dhanpat Rai& Co (Pvt) Ltd, New Delhi,
2012
2. P. Murthy, C. V. Agarwal, A. Naidu, Textbook of Engineering Chemistry, B. S. Publications,
Hyderabad, 2006
3. T. Pradeep, Textbook of Nanoscience and Nanotechnology, McGraw Hill Education,India,
Pvt.Limited, 2013

Remember 30 30 -
Understand 40 40 -
Apply 30 30 80
Analyze - - 20
Evaluate -- - -
Create -- - -
Total (%) 100 100 100
Sample question (s)

Remember
1. Define hardness. Which salts are responsible for different types of hard nesses?
2. Differentiate between polymer and plastic? List out the differences between thermoplastics and
thermosetting plastics?
3. Define calorific value, HCV and LCV
11
23
Understand
1. What is meant by desalination? Explain the procedure for softening of water by Reverse osmosis
process?
2. What is compounding of plastics? Explain the role of Fillers and Stabilizers with examples
in compounding of plastics?
3. How a photo-voltaic cell constructed and what is is the working mechanism of it?
Apply
1. Water contains the constituents like CO2 , HCO3- , Mg(HCO3)2 , H+, CaSO4 , NaCl and Na2SO4 and
this water is subjected to Lime and Soda softening, which type of chemical reactions are involved
between these constituents with Lime and Soda?
2. Which moulding technique is involved in making a plastic ball in toys industry? Explain the process in
detail with neat sketch?
3. By which methods, the underground pipelines are protected from corrosion? Explain the involved
mechanisms?
Analyze
1. The Boiler fed water contains the following compositions: CaSO4, CaCl2, MgCl2, SiO2 &
Na2CO3.Suggest the suitable methods and involved principle to prevent the formation of scale and
sludge by these constituents?
2. When a metal X (of reduction potential = 0.337V at 250C) is connected to another
metal Y (of reduction potential = -0.140V at 250C) and this structure is exposed
continuously to sea water, which type of corrosion would take place? Explain with
suitable mechanism.
3. Which type of corrosion is involved in the following jointed pipeline and why? Explain the involved
mechanism in detail
Iron pipe Copper pipe
Sea water inlet Sea water outlet
24
16EEX01 Basic Electrical Engineering

3103
Course Outcomes
1. Demonstrate the basic principles of electrical components
2. Outline electric circuits using network laws and reduction techniques
3. Illustrate the behavior of basic circuit elements for an AC excitation
4. Relate the laws of electro-magnetism and select a machine for practical applications
5. Outline the working principle and construction of the measuring instruments
6. Choose appropriate safety measures and wiring schemes
COs – POs Mapping
COs PO1 PO3
1 3 1
2 3 1
3 2 1
4 3 1
5 3 1
6 2 3
Unit I
Basic Electrical Components
Definition of charge, electric potential, electric field, voltage, current, power and energy, Ohm’s law, Faraday’s
Law of Electromagnetic Induction, Classification of network elements, Basic circuit elements–R, L and C,
Types of energy sources-Dependent and independent sources, Kirchhoff’s laws, Resistive, inductive and
capacitive networks–series, parallel circuits, Self Inductance, mutual inductance, Types of induced emfs, Dot
Convention, Coefficient of coupling
Types of resistors–inductors and capacitors
11+4 Hours
Unit II
Fundamentals of Electrical Circuits
DC Circuits:Voltage and current division rule, Source transformation, mesh and nodal analysis, Star-delta
transformation. AC Circuits:Generation of alternating current, periodic waveforms and basic definitions, RMS
and average values of periodic and non-periodic waveforms, form factor and peak factor, AC through pure R
and L, Phasor representation, J-operator, Power in ac circuits
AC through pure capacitor
12+4 Hours
Unit III
Electrical Machines & Measuring Instruments
Electrical Machines:Principle of operation, Construction and Applications-DC Machines, 1-phase Transformers,
1-Phase Induction Motors, Stepper motors. Measuring Instruments: Classification of Measuring Instruments,
Construction and basic working principle of Voltmeter, Ammeter, Wattmeter
Working principle of Energy meter
12+4 Hours
Unit IV
Electrical Safety, Wiring and Introduction to Power System
Indian electricity safety rules, Electric shock- effects, protective measures and first aid, Earthling-Basic
principles and types.Electrical wiring-wiring accessories, staircase, tube light.Single line diagram of power
system
Design of corridor wiring 10+3Hours
Total:45+15 Hours
25
Textbook (s)
1. D. P. Kothari and I. J. Nagrath, Theory and Problems of Basic Electrical Engineering, 4th Ed., PHI
Learning Private limited, 2013
2. S. Ghosh, Fundamentals of Electrical & Electronics Engineering, 2nd Ed., PHI, 2010
3. V. K. Mehta and Rohit Mehta, Basic Electrical Engineering, S Chand and company Ltd, New Delhi,
India, Revised Edition, 2012
Reference (s)
1. J. B. Gupta, Basic Electrical and Electronics Engineering, 3rd Ed., S. K. Kataria & Sons, 2009
2. B. L. Theraja, Fundamentals of Electrical Engineering and Electronics, 5 th Ed., S. Chand & Company
Ltd, 2013
3. K. Alice Mary and P.Ramana, Basic Electrical Engineering, 1st Ed., Winger Publications, 2013
4. Basic Electrical Engineering by K.Alice Mary and P.Ramana, Winger Publications, 1 st Edition, 2013

Remember 40 40 -
Understand 60 60 20
Apply - - 40
Analyze - - 40
Evaluate - - -
Create - - -
Total (%) 100 100 100
Sample question (s)

Remember
1. State Faradays laws of Electro-magnetic Induction.
2. Define
i. Charge ii. Power
iii. Energy iv. Potential
3. State any five Indian electricity safety rules
4. Define coefficient of coupling
Understand
1. Explain the principle of operation of transformer.
2. Describe the working of DC generator.
3. Explain the construction and working of Wattmeter.
4. Illustrate the emf equation of a transformer
12
26
16CHX01 Environmental Studies

3103
Course Outcomes
1. Translate the learner’s attitude to think globally and act locally
2. Motivate environmental organizaions to create a concern about our present state of Environment.
3. Find solutions for conservation of natural resources
4. Identify the benefits of ecosystem conservation, biodiversity protection, implement pollution
prevention and control measures
5. Illustrate social issues of environmental protection and adopt sustainable developmental practices
6. Perceives the basic structure of environmental policy and law pertaining to specific environmental
issues (water quality, air quality, biodiversity protection, Forest, etc.)
COs – POs Mapping
COs PO1 PO3 PO6 PO7
1 - - 3 3
2 - - - 3
3 3 3 - 3
4 - - 3 3
5 - - 3 3
6 - - - 3
Unit I
Multidisciplinary Nature of Environmental Studies & Natural Resources
Definition, Scope and Importance, Multidisciplinary nature of Environmental Studies, Value of Nature-
Productive, Aesthetic/Recreation, Option, Need for Public Awareness, Institutions (BNHS, BVIEER, ZSI, BSI)
and People in Environment (MedhaPatkar, Sundarlal Bahuguna, Indira Gandhi, Rachael Carson)
Natural Resources: Renewable and Non–renewable resources–Importance, uses, overexploitation/threats, and
conservation of (i) forest (ii) water (iii) mineral (iv) food and (v) energy resources, role of an individual in
conservation of natural resources
Biotic and abiotic components–Case studies of forest-water-mineral-food-energy resources
12+4 Hours
Unit II
Ecosystem & Biodiversity
Ecosystems: Concept of an ecosystem, Structure and function of an ecosystem, Biogeological cycles (Energy
flow, Carbon and Nitrogen Cycles), Ecological succession, Food chains, food webs and ecological pyramids,
Introduction, types, characteristic features, structures and functions of the following ecosystems: a. Forest
Ecosystem b. Aquatic Ecosystem Biodiversity and its Conservation: Definition and levels of biodiversity, Bio–
geographical classification of India, hot spots of biodiversity–India as a mega diversity nation, Threats to
biodiversity, Endangered and endemic species of India, Conservation of biodiversity: In–situ and Ex–situ
conservation
Phosphorus cycle–Desert ecosystems–Grassland ecosystem–Case studies on conservation of biodiversity
12+4 Hours
Unit III
Environmental Pollution & Social Issues
Environmental Pollution: Definition, Cause, effects, control measures and case studies of: Air pollution b. Water
pollution c. Soil pollution Solid waste Management: Causes, effects and control measures of urban and
industrial wastes. Disaster management (floods and cyclones) Social Issues and the Environment: Sustainability,
Urban problems related to energy, Water conservation and watershed management, Resettlement and
rehabilitation of people; Environmental ethics: Issues and possible solutions, global warming, ozone layer
depletion, Consumerism and waste products
Noise pollution–Case studies on pollution–Wasteland reclamation 11+4 Hours
27
Unit IV
Human Population and the Environmental Acts
Human Population and the Environment: Population growth, Affluence, Technology and Environmental Impact
(Master Equation), Population explosion and Family Welfare Programme, Value Education, HIV/AIDS,
Women and Child Welfare, Role of information Technology in Environment and human health, Environment
Protection Acts: Air (Prevention and Control of Pollution) Act, Water (Prevention and control of Pollution) Act,
Wildlife Protection Act and Forest Conservation Act. Issues involved in enforcement of environmental
legislation
Human Rights–The environment (Protection) Act, 1986
10+3 Hours
Total:45+15 Hours
Textbook (s)
1. E. Bharucha, Textbook of Environmental Studies, 1st Ed., University Press (India) Pvt. Ltd., 2005
Reference (s)
1. W. P. Cunningham, M. A. Cunningham, Principles of Environmental Science, 6 th Ed., Tata McGraw
Hill, 2008
2. A. Kaushik, C. P. Kaushik, Perspectives in Environmental Studies, 4th Ed., New Age International
Publishers, 2008
3. H. S. Peavy, D. R. Rowe, G. Tchobanoglous, Environmental Engineering, 1 st Ed., McGraw Hill, 1984
4. T. E. Graedel, B. R. Allenby, Industrial Ecology and Sustainable Engineering, 1st Ed., Pearson
Publications, 2009

Remember 40 35 30
Understand 45 50 50
Apply 15 15 20
Analyze -- -- --
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Sample question (s)

Remember
1. List important natural resources & important institutions related to the environment.
2. Recall a simple food chain.
3. List important acts in environment.
Understand
1. Money deposited in a bank- identify under which environment value.
2. Summarize the methods for creating public awareness regarding environment.
3. Explain the consequences of over utilization of water resources.
Apply
1. Select the economic method of conservation of biodiversity and describe it.
2. Predict the effects and control methods of water pollution.
3. Find the urban problems related to energy and suggest suitable alternatives.
4. Assess why women and children need special care and what are all the supports that our Government is
extending to them?
13
28
16HSX02 English Communication Skills Lab

0032
Course Outcomes
1. Develop the pronunciation ability by using their gained knowledge of the English sound system
2. Improve the articulation of sounds and pronunciation of words for intelligible English
3. Recognize the use of language in conversational style with focus on communication in English
4. Organize ideas effectively in spoken form
6. Develop the pronunciation abilityby using their gained knowledge of the English sound system
COs – POs Mapping
COs P010
1 3
2 3
3 3
4 3
5 3
6 3
List of Experiments
Module 1–Sounds of English-Consonants

Module 2–Interaction-1: Greeting and taking leave, introducing oneself to others.
Module 3–Sounds of English-Vowels
Module 4–Interaction-2: Making request and response to them ask for and give/refuse permission, Ask for and
give directions, thank and respond
Module 5–Some rules of Pronunciation
Module 6–Interaction-3: Invite, accept, and declining invitations, Make complaints and respond to them,
Express sympathy
Module 7–Word Stress and Sentence stress
Module 8–Interaction-4: Apologize and respond, advise and suggest, Telephone Skills
Module 9–Presentation Skills: Oral and PPT Presentations
Module 10 Group Discussion
Extra Module
Module 11–Debate

1. Common Errors in English
2. Listening Skills
3. Speaking Skills
4. Writing Skills
5. Presentation Skills–observations
6. Reading Skills
7. Public Speaking
8. Interview Skills
9. Office Communication
10. Telephone Skills
11. Report Writing
12. Vocabulary
13. Body Language
14. Resume Writing
15. Functional English
14
29

1. K. Nirupa Rani, Jayashree Mohanraj and B. Indira, Strengthen Your Steps-Maruthi publications, 2012
2. K. Nirupa Rani, Jayashree Mohan Raj, B. Indira, (Ed) Speak Well (C.D) Orient Black Swan Pvt Ltd,
Hyderabad, 2012
3. D. Jones, English Pronouncing Dictionary (Software)CUP, Ver.1.0, 2003
4. J. Sethi, S. Kamlesh, D. V. Jindal. A Practical Course in English Pronunciation, Prentice-hall of India,
New Delhi, 2007
5. T. Balasubramanian, A Textbook of English Phonetics for Indian students, McMillan, 1981
6. K. Mohan and M. Raman, Effective English Communication, 1st Ed., Tata McGraHills, 2000
7. R. K. Bansal and J. B. Harrison, Spoken English, 3rd Ed., Orient Black Swan, Hyderabad, 1983
30
16CYX02 Engineering Chemistry Lab

0032
Course Outcomes
1. Utilize different Analytical tools and develop the necessary skills in executing experiments involving
estimation of metals in alloys, raw materials, finished products and environmental samples etc.
2. Utilize modern instruments like flame photometer, ion analyzer, UV Vis spectrophotometer, Atomic
Absorption Spectrophotometer for characterization of materials used in industry & environmental
monitoring
3. Determine the amount of hardness, chloride, fluoride, nitrite, DO of water for its quality and know its
utility in domestic and industry
4. Summarize the characteristics of lubricants and able to choose/modify lubricants according to purpose
5. Compose some cross-linked polymers like Bakelite, Nylon etc.
6. Identify the adulteration of food items such as milk, honey, tea, coffee & fertility of soil to increase
crop production
COs – POs Mapping
COs PO4
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3
CO6 3
List of Experiments
Introduction to Quantitative Analysis
1. Assessment of Quality of water
i) Hardness ii) Chloride iii) Fluoride iv) Dissolved Oxygen v) Nitrite
2. Testing quality of lubricants
i) Viscosity Index ii) Flash & Fire point iii) Acid Number
3. Quality Analysis of engineering materials
i) Cement ii) Al/Cu wire iii) Steel
4. Preparation of Engineering and Nano materials
i) Bakelite ii) Nylon iii) Silver nano particles
5. Estimation of Purity of Iron in Ingot
6. Analysis of fertility of soil
i) Sodium & Potassium ii) Micro Nutrients
7. Determination of acid strength (for a citrus fruit) by Conductometr
8. Detection of adulteration of Food in Honey/ Milk/ Tea
9. Estimation of heavy metals in fast food items by AAS.
10. Testing of corrosion of metal
Note: Student should perform minimum of 12 experiments at least one form each head.

1. Assessment of ground water quality of your village/Mandal
2. Preparation of desired Viscosity Index lubricating oil
3. Studies on the effect of various factors on corrosion
15
31

1. K. Gouru Naidu, Engineering Chemistry Lab Manual, 1 st Ed., 2014
2. G. Svehla, Vogel’s Qualitative Inorganic Analysis, 7th Ed., Pearson Education, New Delhi, 2003
3. Standard methods for the examination of water and waste waters, American Public Health Association,
21st Ed., EPA, Washington, 2005
4. Metcalf and Eddy, Waste Water Engineering Treatment and Reuse, 4th Ed., Tata McGraw Hill, New
Delhi, 2003
5. D. Srinivasulu, Engineering Chemistry laboratory manual & Record, Parshva publications, 2010
32
16MEX03 Engineering Workshop

0032
Course Outcomes
1. Utilize basic carpentry tools for the preparation of wooden joints
2. Make use of basic hand tools for the preparation of mild steel joints
3. Build simple house hold items with GI sheet using tin smithy tools
4. Make use of house wiring accessories to build simple electrical circuits
5. Build simple components with hand tools for making experimental setups
6. Build simple components with hand tools as per the drawing specifications
COs - POs Mapping

COs PO1 PO2 PO10 PO12
1 3 2 2 2
2 3 2 1 2
3 3 2 2 1
4 3 2 3 2
5 3 3 1 3
6 3 2 1 3
List of experiments
Trades
Carpentry : 1. Cross Lap joint
2. T-Lap joint
3. Dovetail Joint
4. Mortise and Tennon Joint
Fitting : 1. Square Fit
2. V- Fit
3. Half Round Fit
4. Dovetail Fit
Tin Smithy : 1. Square Box without lid
2. Taper Tray
3. Open Scoop
4. Funnel
House Wiring : 1. Parallel/Series Connection of three bulbs
2. Florescent Lamp Wiring
3. Stair Case Wiring
4. Godown Wiring
Total: 45 Hours
16
List of Augmented Experiments
1. Prepare Tee–bridle joint
2. Prepare Corner dovetail joint
3. Make Corner bridge joint
4. Make Dovetail lap joint
5. Prepare 900 round elbow pipe
6. Prepare Ellipse using GI sheet
7. Make cylindrical pipe
8. Make Round T-pipe
9. Prepare hexagonal fitting
10. Prepare diagonal dovetail fitting
11. Prepare universal fitting
16
33
12. Make square fitting

13. Set the general house wring
14. Set the dim & bright lighting
15. Set the test lamping

1. Engineering workshop Lab manual, Department of Mechanical Engineering, GMRIT Rajam
34
16IT305 Data Structures

3103
Course Outcomes
1. Explain basic operations of stacks, queues, and linked-lists
2. Understand various sorting and searching techniques
3. Choose an appropriate hashing techniques for a given problem
4. Understand the basic operations of trees and its types
5. Explain the concept of height balancing in AVL and B trees
6. Demonstrate graph traversal algorithms
COs–POs Mapping
COs PO1 PO2 PO3
1 3 2 2
2 2 2 3
3 2 1 1
4 3 3 3
5 2 3 2
6 2 2 2
Unit I
Linear Data Structures
Basic concepts: Data abstraction, Algorithm specification, performance analysis
Linked Lists: Basic operations of singly, doubly and circular linked lists, implementation of stack and queue using
singly linked list
Stack: Introduction to stack, basic operations and implementation of stack using arrays
Queue: Introduction to linear queue, basic operations and implementation of linear queue using arrays, circular
queue, basic circular queue operations
Applications on stack – Recursion, infix to postfix conversion
Evaluation of postfix expression - Double Ended Queue - Header linked lists

12+4 Hours
Unit II
Searching and Sorting
Searching: Linear search and Binary search
Sorting: Bubble sort, Insertion sort and Selection sort
Hashing: Hashing Functions, Open hashing (chaining), closed hashing (open addressing – linear probing, quadratic
probing, double hashing), rehashing
Bucket sort -hash table representations for a keyword set used in programming languages.
10+3 Hours
Unit III
Non-Linear Data Structures
Trees: Introduction, Terminology, Binary Trees, Representation of Binary Trees using arrays and linked lists, Binary
tree traversals
Heaps: Introduction to binary heaps, definition of a Max-heap, Min-heap, creating Max-Heap, Applications: Heap
sort, Priority queue operations insertions and extract-max.
35
Binary Search Trees: definition, basic operations of BST (Searching, Insertion and deletion)
Creation of binary tree from in-order & pre-order sequences - Creation of binary tree from in-order & post-order
sequences Priority queue - Representation of symbol tables in compiler design
12+4 Hours
Unit IV
Efficient Binary Search Trees
Introduction to AVL trees, Height of an AVL Tree, Balancing AVL tree by rotations after insertions and deletions of
a data node
Multi-way search trees: introduction to m-way search trees, B-trees, B+ Trees
Graphs: Definitions, Graph representation - Adjacency matrix, adjacency lists, Graph Traversals (BFS & DFS)
Application of graphs for Determination of single source shortest path - extraction of minimum cost spanning trees
11+4 Hours
Total: 45+15 Hours
Textbook (s)
1. Horowitz, Sahni and Anderson-Freed, Fundamentals of Data Structures in C, 2nd Edition, Universities
Press, 2008
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Pearson Education, 2002
Reference (s)
1. R. F. Gilberg, B. A. Forouzan, Data Structures A Pseudocode Approach with C, 2 nd Edition, CENGAGE
Learning, 2005
2. S. Tanenbaum, Y. Langsam and M.J. Augenstein,Data Structures using C, Pearson Education, 1990
3. Seymour Lipschutz, Data Structures with C, Schaum Series, McGraw Hill Education, 2010
SAMPLE QUESTION (S)

Remember 25 10 --
Understand 35 30 20
Apply 20 20 40
Analyze 20 20 20
Evaluate -- 10 10
Create -- 10 10
Total (%) 100 100 100
Remember
1. List out linear data structures
2. Name the basic operations of stack data structure
3. Define balance factor of AVL tree
4. Define complete binary tree
5. What is self-referential structure?
6. Name two basic operations on stack data structure supports
7. Define a double linked list structure
8. What are advantages and disadvantages of circular linked list?
1
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
36
Understand
1. Explain Bubble Sort Process with an example
2. Demonstrate with neat diagram and algorithm to insert a node before the given key
3. Explain Deletion process using an example binary search tree
4. Explain why the selection sort is more efficient than the bubble sort
5. Explain with suitable example of LL rotation after inserting a new node into an AVL tree
6. Demonstrate the application of singly linked lists for the addition of the polynomials P1 and P2
Apply
1. Construct a symbol parse tree for the key words of following program
void main()
{
long int n,num,d;
char prime;
clrscr();
printf("Enter the range for prime no");
scanf("%ld",&n);
for(num=2;num<=n;num++)
{
prime='t';
for(d=2;d<=sqrt(num);d++)
if (num%d==0)
{
prime='f';
break;
}
if(prime==t)
printf("%10ld",num);
}
getch();
}
2. Develop an algorithm to concatenate two single linked lists
3. Construct a priority queue and implement all basic operations to demonstrate priority queue
4. Build a recursive procedure to count the number of nodes in a binary tree
5. Develop a queue using single linked list data structure
Analyze
1. Analyze the efficiency of insertion sort for the following inputs to sort
A={12, 23, 3, 11, 56, 6, 78, 7} B={12, 14, 23, 45, 56, 67, 78, 81}
2. Analyze the efficiency of BST deletion to delete a node with two children
3. Compare BST deletion and AVL deletion methods according to time efficiency.
4. Choose a suitable data structure to implement a linked stack
5. Analyze the efficiency of BFS graph traversal method
Evaluate
1. Justify that the height of the AVL tree is O (log n) where n is the no of nodes in the tree
2. Prove that the height of a complete, balanced binary tree of ‘n’ nodes is “log (n+1)”
3. The worst time complexity of binary search is O(log n), Justify
37
4. Choose a suitable data structure to implement double ended queue

5. Compare the height by successive insertion of following numbers if inserted into a BST and AVL tree
{12, 14, 23, 45, 56, 67, 78, 81}
Create
1. Construct the binary tree for the given in-order and pre-order traversal of a tree
In-order sequence: D B E A F C
Pre-order sequence: A B D E C F
2. Modify the routine BST-branch so that the nodes of the tree are freed after they are no longer required.
3. Modify the bubble sort algorithm so that a record is kept of the actual number of comparisons and
interchanges made
4. Construct the binary tree for the given in-order and post-order traversal of a tree
In-order: 4 2 5 1 6 7 3 8
Post-order: 4 5 2 6 7 8 3 1
5. Construct a AVL search tree for the list below by successive insertion of numbers
5, 6, 8, 3, 2, 4, 7
38
16IT306 Object Oriented Programming through Java

3103
Course Outcomes
1. Summarize object oriented programming concepts
2. Develop applications using different types of inheritances
3. Create and use user defined packages
4. Analyze and recover runtime exceptions arise in the applications
5. Apply parallel processing applications using threads
6. Develop interactive applications for standalone and Internet (applet)
COs–POs Mapping
COs PO1 PO2 PO3
1 3 2 3
2 3 1 3
3 1 1 2
4 2 1 3
5 3 1 3
6 2 2 2
Unit I
Introduction to Java
Overview of Object Oriented Programming principles, Importance of Java to the Internet, Byte code, Methods,
classes and instances, Data types, arrays, control statements, simple java program, Classes and Objects–
constructors, methods, access control, this keyword, overloading methods and constructors, garbage collection,
java.lang – String, StringBuffer, StringBuilder, Type wrappers – Integer, Character, Float, Double, Boolean
Features of object oriented programming–Java History–Computer Programming Hierarchy–Role of Java
Programmer in Industry
11+3 Hours
Unit II
Inheritance, Packages & Interface
Inheritance: Basics, Using super, Multilevel Hierarchy, Method overriding, Dynamic Method Despatch, Using
Abstract classes, Using final with inheritance
Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, Member
access rules, Java Collections – Arrays, ArrayList, Hashtable, StringTokenizer, Vector
Interface: Defining an interface, differences between classes and interfaces, implementing interface, variables in
interface and extending interfaces
Nested–Inner Class & Anonymous Classes–Generic Class Types
11+4 Hours
Unit III
Exception Handling & Multithreading
Exception handling: Concepts and benefits of exception handling, exception hierarchy, usage of try, catch, throw,
throws and finally, built-in and User Defined Exceptions
Multithreading: Definition thread, thread life cycle, creating threads, synchronizing threads, daemon threads
39
Control Flow In Exceptions– JVM reaction to Exceptions– Inter Communication of Threads– Critical Factor in
Thread–Deadlock
11+4 Hours
Unit IV
Applets & Event Handling
Applets: Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets,
creating applets, passing parameters to applets, The AWT class hierarchy, user interface components labels, button,
Text components
Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes, inner
classes, Compare basic AWT components with swing components, More user interface components-canvas,
scrollbars, check box, choices, lists panels–scroll pane, dialogs, menu bar, layout managers.
Applet Security Policies–Anonymous Inner classes a Short–cut to Event Handling–Java Utilities (java.util Package)
12+4 Hours
Total: 45+15 Hours
Textbook (s)
1. H. Schildt, Java: The complete reference, 7th Edition, TMH, 2006
2. T. A. Budd, An Introduction to Object–Oriented Programming, 3rd Edition, Addison Wesley Longman, 2002
Reference (s)
1. Dietal & Dietal, Java: How to Program, 8th Edition, PHI, 2010
2. C. S. Horstmann and G. Cornell, Core Java, Vol 1. Fundamentals, 7 th Edition, Pearson Education, 2004
3. C. Horstmann, BIG JAVA Compatible with Java 5 & 6, 3rd Edition, Wiley Publishers, 2008
SAMPLE QUESTION (S)

Remember 25 15 10
Understand 30 15 30
Apply 25 40 30
Analyze 20 20 30
Evaluate -- 10 --
Create -- -- --
Total (%) 100 100 100
Remember
1. List all OOPs principles
2. Define class and object
3. Illustrate various data types supported by JAVA
4. State various access controls available in JAVA
5. Define inheritance
6. Define thread
Understand
2
40
1. Explain byte code

2. Explain the use of super, static and final keywords
3. Illustrate the use of try, catch, throw and throws
4. Java is purely object oriented programming language. Explain
5. Explain types of polymorphism with Example
Apply
1. Write statements that perform the following one-dimensional-array operations:
a) Set the 10 elements of integer array counts to zero
b) Add one to each of the 15 elements of integer array bonus
c) Display the five values of integer array best Scores in column format
2. Create two arrays that store all even no’s in one array and all odd no’s in another array for a given set
of elements
3. Write a java program to implements final variable, Method and classes
4. Explain the reason for the following code giving compiling errors.
abstract class AbstractClass
{
abstract void abstractMethod()
{
System.out.println("First Method");
}
}
5. Write a java program to implement the following techniques
a) Method Overloading
b) Method Overriding
6. Write a Java program to implement Virtual function technique
Analyze
1. Compare and Contrast an abstract class and an interface
2. Differentiate method overloading and overriding
3. Differentiate abstraction and encapsulation
4. Identify the uses of calling a synchronize method inside a synchronize method
5. Identify memory leak problems in Java objects
41
16CS303 Computer Organization and Architecture

3103
Course Outcomes
1. Understand the basic operations of digital computer system to learn the integrated circuit logic families and
its micro-operation
2. Analyze the machine instructions and codes to implement or translate the sequence of micro-operation
3. Apply the fundamental issues related to computer arithmetic operation and circuits to support the system
computation
4. Understand the various components of memory system to organize the operational units of CPU
5. Analyze the data processing operations of central processing and control unit to design the CPU
specification
6. Understand the concepts of pipeline design techniques to increase the execution rate of a processor
COs–POs Mapping
COs PO1 PO2 PO 3
1 3 2 2
2 2 3 2
3 3 2 2
4 3 2 2
5 3 2 1
6 2 3 2
Unit I
Register Transfer and Microoperations
Review of functional units of a basic computer, software, hardware, computer types and generations. Difference
between computer architecture & organization. Register transfer-Bus and Memory transfers; Micro-Operations:
Arithmetic Micro-operations-Logic Micro-operations-Shift Micro-operations-Arithmetic Logic Shift Unit.
Instruction Codes-Computer Registers-Computer Instructions-Timing and Control-Instruction Cycle-Memory-
Reference Instructions-Register-Reference Instruction-Input-Output Instruction-Interrupts
Fundamentals of Hardware Description Language (VHDL)
12+4 Hours
Unit II
Computer Arithmetic
Fixed Point Representation-floating Point Representation-addition and Subtraction-Multiplication Algorithms-
Division Algorithms-Floating Point representation- IEEE754 single precision and double precision numbers.
Extended bias. Floating point arithmetic operations-addition, subtraction, multiplication and division hardware
implementation and algorithms.
Decimal Arithmetic Unit & Operations.
6+2 Hours
Unit III
Central Processing Unit and Control Unit Design
Stack Organization-Instruction Formats-Addressing Mode-Data Transfer and Manipulation-Program Control-
Reduced Instruction Set Computer-Complex Instruction Set Computer.
Hardwired Control Unit design. Micro-programmed Control Unit design-Control Memory-Address Sequencing -
Micro-program example
Overlapping Register Windows
15+3 Hours
Unit 1V
Memory and I/O Organization
Memory Hierarchy-Main memory- RAM, ROM, Auxiliary memories, Associative Memory, Cache Memories-
Performance considerations - -Virtual Memories.
42
Peripheral Devices-Input-Output Interface-Asynchronous Data Transfer-Modes of Transfer-Priority Interrupt-Direct

Memory Access-Input-Output Processor (IOP)
Memory Management concepts, Pipeline and Parallel Processing concepts
12+6 Hours
Total: 45+15 Hours

Textbook (s)
1. M. Moris Mano, Computer Systems Architecture, 3rd Edition, Pearson/PHI, 1992
Reference (s)
1. William Stallings, Computer Organization and Architecture, 6th Edition, Pearson/PHI, 2007
2. Andrew S. Tanenbaum, Structured Computer Organization, 5th Edition, PHI/Pearson, 2007
3. Carl Hamacher, Zvonko G. Vranesic, Safwat G. Zaky, Computer Organization, 5th Edition, McGraw Hill, 2002
SAMPLE QUESTION (S)
Remember 25 15 --
Understand 35 15 --
Apply 20 20 40
Analyze 20 30 40
Evaluate -- 10 20
Create -- 10 --
Total (%) 100 100 100
Remember
1. List out the different components computer organization
2. List out the different types of Micro-Operations
3. Define Register transfer language
4. List the characteristics RISC
5. Define the address sequencing
Understand
1. Explain the various operation Fixed Point Representation
2. Describe principle involved in the Hardwired Control Unit design-Micro-programmed Control Unit design
3. Illustrate the working principle of Data Transfer-Modes
4. Describe the Stack Organization with detail
5. Explain the various addressing modes with example
Apply
1. Classify Different levels in a computer system & their significance.
2. Interpret the applications of RISC and CISC architectures
3. State the differences between register machines and stack machine?
4. Classify the different instruction sets
5. State the differences between RAM and ROM
Analyze
1. Compare and Contrast between Register-Reference Instruction-Input-Output Instruction
2. Analyze different ways of micro programed control unit
3. Examine the Arithmetic Pipelines - Instruction Pipelines
4. Analyze different ways of peripheral devices
5. Examine the various pipelining methods
3
43
Evaluate
1. Assess the performance of division algorithm

2. How do you assess the performance of control memory?
3. How do you assess the performance of Input-Output Processor?
4. How do you assess the performance of memory hierarchy?
5. Assess the performance of various multiplication algorithm
44
16CS304 Database Management Systems

3103
Course Outcomes
1. Understand data models to design a database

2. Illustrate the conceptual design for Large enterprises
3. Formulate SQL queries and integrity constraints over relations
4. Apply normalization on database for eliminating redundancy
5. Summarize transaction properties, concurrency control and recovery techniques
6. Explain various data storage and security mechanisms
COs–POs Mapping
COs PO1 PO2 PO3
1 3 3 2
2 3 3 2
3 3 3 2
4 3 3 3
5 2 2 3
6 2 2 3
Unit I
Introduction to Database Systems
File System Vs DBMS, Advantages of DBMS, Structure of DBMS, Levels of Data Abstraction (Data
Independence), Database Users and Administrators, Different Data Models. E-R Model: Overview of Database
Design, Entities, Attributes, and Entity Sets, Relationships and Relationship Sets Additional Features of the ER
Model
Codd’s rules - Introduction to Distributed Databases - Data Ware Housing and Data Mining
11+3 Hours
Unit II
Introduction to the Relational Model
Integrity Constraints Over Relations-Introduction to Views-Relational Algebra - Selection And Projection - Set
Operations-Renaming-Joins-Division-Examples of Relational Algebra Queries-Relational Calculus: Tuple
Relational Calculus.
SQL Queries: Form Of Basic SQL Query-Union-Intersect-And Except-Nested Queries-Aggregative Operators-
Group By And Having Clauses-Null Values-Outer Joins.
Query Optimization: Query Processing and Optimization-Heuristics and Cost Estimation in Query Optimization
11+5 Hours
Unit III
Schema Refinement and Normal Forms
Introduction To Schema Refinement - Problems Caused By Redundancy - Decomposition - Problems Related To
Decomposition - Functional Dependency - Closure of a Set of Fds - Attribute Closure - First - Second - Third
Normal Forms – BCNF - Multi Valued Dependencies – Fourth Normal Form.
Transactions: Acid Properties of Transaction - Transaction States - Schedule: Serial Schedule - Concurrent
Schedules - Anomalies Associated With Concurrent Schedules (RW - WR - and WW Conflicts) -Serializability -
Conflict Serializability - and View Serializability.
Join Dependency - Fifth Normal Form - Domain Key Normal Form
12+4 Hours
45
Unit IV
OODBMS, Concurrency Control, Crash recovery
Introduction to Lock Management-Lock Based Concurrency Control: 2pl-Strict 2pl-Concurrency without Locking-
Timestamp–Based Concurrency Control - Optimistic Concurrency Control. Introduction to Aries - the Log - the
Write-Ahead Log Protocol-Check Pointing
Object-Oriented DBMSs-Concepts and Design: Introduction to Object-Oriented Data Models and DBMSs-
OODBMS perspectives-Persistence-Issues in OODBMSs-The object Oriented Database System Manifesto-
Advantages and Disadvantages of OODBMSs-Object oriented Database Design.
Database Security: Data Classification-Threats and Risks-Database access control-Types of Privileges.
File Organization-Comparison of File Organizations (Heap File - Sorted File Hash File)
11+3 Hours
Total: 45+15 Hours
Textbook (s)
1. Elmasri & Navatha, Fundamentals of Database Systems, Pearson Education, 2006
2. Silberschatz Korth, Database System Concepts, McGraw hill, 5th Edition, 2010
Reference (s)
1. Peter Rob & Carlos Coronel, Database Systems design, Implementation and Management, 7 th Edition,
2004.
2. Raghurama Krishnan & Johannes Gehrke, Database Management Systems, TATA McGraw-Hill, 3rd
Edition, 2006
3. C.J.Date, Introduction to Database Systems, Pearson Education, 1999.
SAMPLE QUESTION (S)

Remember 30 25 10
Understand 25 15 20
Apply 25 20 30
Analyze 20 20 30
Evaluate -- 10 10
Create -- 10 --
Total (%) 100 100 100
Remember
1. List any four application of DBMS
2. Define data model
3. List any four applications for triggers
4. Define functional dependency
5. List the 4 properties of Transaction
Understand
1. Explain E-R Model with suitable example
2. Explain the role of integrity constraints in database design
3. Illustrate the working principle of ‘write a head log’ protocol
4. Differentiate 3NF and 4NF
5. Explain Two Phase Locking Protocol
4
46
Apply
1. When multiple transactions are being executed by the operating system in a multiprogramming
environment, there are possibilities that instructions of one transaction are interleaved with some other
transaction. Apply the suitable concept to overcome the problem
2. Classify various normal forms according to their applicability
3. Give some real world applications of Normalization
4. Illustrate the Commit and Rollback operations of Transaction Control
5. Give some real world applications for Database indexing techniques
Analyze
1. Compare File processing system with DBMS
2. Analyze different locking protocol for concurrency control and serializability
3. Normalization will increase the complexity of the database design. Justify
4. Compare DDL and DML of SQL
5. Compare and Contrast Serializabilti and Recoverability
Evaluate
1. Is database redesign is necessary? Explain
2. How can you evaluate the performance of two data models?
3. Evaluate the performance of query processor and list the corresponding metrics
4. How can you assess the throughput and delay for any DBMS?
5. How can you evaluate the impact of data models on the query processing?
47
16CS305 Digital Logic Design

3024
Course Outcomes
After undergoing the course students will be able to:
1. Recognize the conversion of one number system to other Number system
2. Classify different logic circuits by using Universal gates
3. Execute Boolean algebra and K-map as a tool to simplify and design logic circuits
4. Implement and analyze the operation of Combinational and Sequential Circuits
5. Check various types of sequential circuits like counters and universal Shift Registers
6. Differentiate between the Mealy and Moore machines
COs–POs Mapping
COs PO1 PO 2 PO 3 PO 6
1 3 3 1 2
2 3 3 1 2
3 3 3 1 2
4 3 2 2 3
5 3 2 1 3
6 2 3 3 2
UNIT- I
Number systems and Boolean algebra
Review of Number Systems-Conversion of Numbers from One Radix to Another Radiix, Complements,
Representation of Negative Numbers-Binary Arithmetic-4-bit codes: BCD-Excess-3-Basic Logic Operations-Basic
Theorems and Properties of Boolean Algebra-Switching Functions-Canonical and Standard Forms-Algebraic
Simplification - Digital Logic Gates -Universal Gates. Gray code
Integrated circuits: IC specifications and pin diagram of gates, ASCII and EBCDIC
Practical Components
1. Realization of Logic gates and verification of Truth tables
2. Realization of basic gates using Universal gates
09+6 Hours
UNIT- II
Boolean Function Minimization and Combinational Arithmetic Logic Circuits
Minimization of Switching Functions using K-Map up to 4-variables - Minimal SOP and POS Realization, Half
Adder,Full adder, Full subtractor, Ripple carry adder, Multiplexer, De-Multiplexer, Encoder, Priority encoder,
Decoder, MUX Realization of switching functions.
Binary Multiplier- Problem solving using K-map such as Code Converters
1. Implementation of Half Adder and Full Adder
2. Implementation and verification of Decoder and Encoder
3. Implementation and verification of MUX and DE-MUX 09+6 Hours
Unit III
Combinational Logic Circuits and Programmable Logic Devices (PLDs)
Magnitude Comparator.Basic PLD’s-ROM-PROM-PLA-PAL - Realization of Switching functions using PLD’s-,
Classification of Sequential Circuits (Synchronous and Asynchronous): Basic Flip-Flops-Truth Tables and
Excitation Tables (NAND RS Latch-NOR RS Latch-RS Flip-Flop, JK Flip-Flop-T Flip-Flop-D Flip-Flop with Reset
and Clear terminals) Conversion of flip-flops
1. Realization of Flip-Flops using ICs 12+8 Hours
48
Unit IV
Introduction to Sequential Logic Circuits & Registers and Counters
Design of Registers - Buffer Register - Control Buffer Registers - Bidirectional Shift Registers - Universal Shift
Register - Design of Ripple Counters - Synchronous Counters and Variable Modulus Counters (Mod-2,4,6,10 & 16)
- Ring Counter - Johnson Counter. Finite State Machine-capabilities and limitations -Mealy and Moore State
Machines -Mealy to Moore conversion and vice-versa
Sequence generator and sequence detector

1. Realization of Flip-Flops using IC’s.
2. Verification of functioning of Basic Shift Register
3. Implementation of Synchronous Counter
4. Implementation of Asynchronous Counter
15+10 Hours
Total: 45+30 Hours
Textbook (s)
1. Morris Mano,Digital Design,3rd Edition, PHI,2001

2. Charles H. Roth, Fundamentals of Logic Design,3rdEdition,Thomson Publications,2014
3. John F. Wakerly ,Digital Design Principles & Practices, 3rdEdition,PHI/ Pearson Education Asia,2001
Reference (s)
1. ZviKohavi, Switching & Finite Automata theory, 2nd Edition, TMH,2008
2. R P Jain,Modern Digital Electronics, 3rd Edition, TMH,2003
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Comprehensive Test5 (%)
Remember 25 15 --
Understand 45 20 --
Apply 10 20 40
Analyse 20 25 40
Evaluate -- 20 20
Create -- -- --
Total (%) 100 100 100
SAMPLE QUESTION (S)
REMEMBER
1. Retrive the decimal value of the fractional binary number 0.1011

2. List any two postulates of Boolean algebra
3. List the four uses of decoders.
4. Define Flip flop
5. Define asynchronous sequential circuit
5
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
49
UNDERSTAND
1. Explain how digital circuits are more frequently constructed with NAND or NOR gates than with AND &
OR gates
2. Represent the following Boolean expression to minterms and maxterms A+BC’+ABD’+ABCD
3. Represent the Boolean function T=F (w, x, y, z)= ∑ m (0,1,2,4,5,7,8,9,12,13) by using 8 to 1mux.
4. Illustrate a half adder using NAND – NAND
5. Represent a JK flip flop using SR flip flop.
APPLY
1. Find a circuit that has no static hazards and implements the Boolean function F(A,B,C,D) = Σ
(0,2,6,7,8,,10,12) ..
2. Construct a four input NAND gate using gates with 2 inputs. Write down the truth table.Do the same for a
4 input NOR gate.
3. Implement D Flip-flop by using JK flip flop.
4. Construct a combinational circuit to convert BCD to EX-3 code.
5. Implement a combinational logic circuit, which can compare two bits binary numbers.
ANALYSE
6. Analyze the following in two ways to get sums of product and product of sums equations. Then show how
you can get one from the other using DeMorgan's Theorem
A E1
B
C
D
F
E2
C
A
7. Why the input variables to a PAL are buffered

8. Why the fixed format in not used and floating format is used
9. What happens when an electric signal is grounded?
10. Design a Sequence detector to detect 10111001
EVALUATE
1. Design and build a counter that will go through the following sequence
STATE
A B C D
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 1 Note: state '4' is skipped
0 1 1 0
0 1 1 1
1 0 0 0
0 0 0 0
r e p e a t
2. Show the behavior of the following circuit with a truth table:
50
3. The control logic for a simple alarm system in a house has three inputs and a single output, which activates
an alarm. The three inputs are:windows sensor,doors sensor and master key.The sensors operate as
follows:
a. window sensor (W) 0 = all windows closed
1 = a window is open
b. door sensor (D) 0 = all doors closed
1 = a door is opened
c. master key (K) 0 = alarm system is disarmed
1 = alarm system is armed
4. If the alarm system is disarmed, then the logic signals from the sensors are ignored and the alarm will not
sound. The alarm is activated by a logic 1 from the output of the control logic.Design the circuit to meet
the requirements of this control logic.
5. Design a combinational circuit which can control the speed of the fan depending on the temperature
6.
CREATE
1. a) Build a one stage full adder with inputs X, Y, and carry in from previous stage. There should be outputs
of a sum and a carry out. Draw the necessary truth tables.
b) How could this be expanded to create an n-stage adder? Assuming each gate has a delay, can all the n
bits be added at the same time?
2. A machine for cutting metal will only activate the cutter when the safety guard is in position, the operator
holds the safety handle and the footswitch is activated.This is another AND function, with the safety
guard as one input, the safety handle as another input and the footswitch as the third input.
3. Before take off, the pilot and co-pilot of an aircraft carry out preflight safety checks. When all checks have
been completed they each move a switch from the up to the down position.
When both switches are up, a red indicator on the instrument panel is on.This changes to yellow when at
least one of them operate their switch.
When both have operated their switches, a green indicator comes on. The engines can only be started when
the green indicator is on.Assume that the switches provide logic level 0 in the up position and logic level 1
in their down position. The LED indicators operate on logic level 1.
4. Design a traffic light controller.
5. Design An Arithmetic-Logic Unit (ALU).
51
16CS306 Discrete Structures & Graph Theory

3103
Course Outcomes
1. Understand mathematical logic and predicates
2. Explain set theory, functions and algebraic structures
3. Demonstrate the ability to describe computer programs using Recursive Functions
4. Apply basic Counting techniques to solve Combinatorial Problems
5. Utilize generating functions and substitutions to solve recurrence relations
6. Demonstrate the Graphs and Trees as tools to visualize and simplify situations
COs–POs Mapping
COs PO1 PO2 PO3
1 3 2 1
2 3 2 2
3 2 3 2
4 2 3 1
5 2 3 1
6 3 3 2
Unit I
Mathematical Logic and Predicates
Statements and Notations - Connectives - Well-formed Formulas - Truth Tables - Tautology - Equivalence
Implication - Normal Forms - Rules of Inference for Statement Logic - Proof Techniques (Equivalence - Converse -
Inverse - Contra-positive - and Contradiction - Direct Proofs - Disproving by Counter Example - Proof by
Contradiction - Method of Induction) - Consistency
Predicative Logic - Quantifiers - Universal Quantifiers - Free & Bound Variables - Rules of Inference for Predicate
Logic
Program Correctness - Concepts on PROLOG Language and Simple Programs - Design of Logic Circuits
10+3 Hours
Unit II
Binary Relations and Algebraic Structures
Binary Relations-Properties & Operations-Relational Matrix and Relational Graph-Equivalence Relations-
Compatibility Relations-Partial Ordering Relations-Hasse Diagram
Lattices-Definition-Types and Properties with examples
Functions-Definition -Types-Inverse Function - Composition of Functions-Recursive Functions
Algebraic Structures-Algebraic Systems-Properties with Examples-Semi Groups-Monoids-Groups and Sub Group
with Examples (Basic Concepts)
Group Codes in Cryptography - Relations in Databases
12+4 Hours
Unit III
Elementary Combinatorics and Recurrence Relation
Basis of Counting-Cardinality-Sum and Product Rules-Permutations & Combinations with Repetitions (Simple
Problems only)-Constrained Repetitions (Simple Problems only)-Binomial Coefficients-Binomial and Multinomial
Theorems (Basic Concepts only)-The Principle of Inclusion–Exclusion-Pigeon-hole Principle and its Application
Generating Functions-Function of Sequences-Calculating Coefficient of Generating Function-Recurrence Relations-
Solving Recurrence Relation by Substitution and Generating Functions (Simple Problems only)
52
Algorithm Analysis - Combinatorics for Bioinformatics-Data Science (Time series and signal processing)
13+5 Hours
Unit IV
Graph Theory
Definition-Representation of Graph-Matrix Representation(Incident and Adjacent Matrices) -Sub-graphs-Graph
Traversal Strategies (DFS & BFS) - Planar Graphs - Isomorphism - Multi-graphs - Cut Sets (Vertices & Edges) -
Euler Circuit and Hamiltonian Cycle - Chromatic Number.
Definition of Tree - Terminologies - Spanning Trees - Minimal Spanning Tree - Prim’s and Kruskal’s Algorithm
Four-Color Problem - Tournaments -Social Network Analysis - Network Analysis - Decision Tree Generation for
Data Analysis
10+3 Hours
Total: 45+15 Hours
Textbook (s)
1. Tremblay J.P. and P. Manohar, Discrete Mathematical Structures with Applications to Computer Science,
Tata McGrawHill, 1997.
2. J. L. Mott, A. Kandel & T. P. Baker, Discrete Mathematics for Computer Scientists & Mathematicians,
Prentice Hall India, 2nd Edition, 2009.
Reference (s)
1. Kenneth H. Rosen, Discrete Mathematics and Applications, 7th Edition, Tata McGraw Hill, 2011.
2. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, A Computer Oriented Approach, 3 rd
Edition, Tata McGrawHill, 2008.
3. D. S. Chandrasekharaiah, Mathematical Foundation to Computer Science, Prism Books Pvt. Ltd,
Hyderabad, 4th Edition, 2012.
4. Seymour Lipschutz and Marc Lipson, Discrete Mathematics, Revised 3rd Edition, Schaum’s Outline Series,
Tata McGrawHill, New Delhi, 2009.
SAMPLE QUESTION (S)

Internal Assessment Patter
Remember 35 15 --
Understand 30 30 --
Apply 25 30 40
Analyze 10 15 40
Evaluate -- 10 20
Create -- - --
Total (%) 100 100 100
Remember
1. Define converse, contra positive and inverse of an implication
2. List out the different Principal normal forms with example
3. State the property of first theory of digraph theory by taking a suitable example
4. Define monoid and abelian group with a suitable example
5. Define Pigeonhole Principle and the generalization of the Pigeonhole Principle
Understand
1. Explain the Planarity of the Kuratowski’s two planar graphs
6
53
2. Explain the General Principle of Inclusion-Exclusion for n-sets

3. Draw the Hasse diagram of the following relation
R is a relation defined as the divisors of 60 and denoted by D60.
4. Compare between Eulerian graph and Hamiltonian graph
Apply
1. Show that the identity. C(n, r -1) + C(n, r) = C(n +1, r)
2. Show that the complete graphs K2, K3, K4 are planar
3. Let G be the set of all non-zero real numbers with a binary operation *, defined as a*b = a2b2. Show that
<G,*> is an abelian group.
4. Find the coefficient of x9y3 in the expansion of (2x-3y)12.
Analyze
1. Differentiate between Permutation and Combination and find the relation between them.
2. Compare the Equivalence Relation, Compatible relation and Partial Order Relation.
3. Justify, whether the following argument is valid or not.
pq
rs
p r
----------
qvs
4. Identify the combinations in set of electives of 7 subjects that has no repetitions for a group of 10 members
having 5 students in each group.
Evaluate
1. In a sample of 100 logic chips, 23 have a defect type D1, 26 have a defect type D2, 30 have a defect type D3,
7 have defects types D1 and D2, 8 have defects types D1 and D3, 10 have defects types D2 and D3 and 3 have
all three types defects.
Determine the number of chips having (i) At least one defect & (ii) no defect.
2. Find the MST using Kruskals’s algorithms with explanation.
3. A woman has 11 close relatives and she wishes to invite 5 of them to dinner. Determine the number of
ways can she invite them in the following situations.
a. There is no restriction on the choice.
b. Two particular persons will not attend separately.
c. Two particular persons will not attend together.
4. Determine the number of vertices and number of edges of the complete bipartite graphs K 4,7 and K 7,11.
54
16IT308 Data Structures Lab

0032
Course Outcomes
1. Implement array - stack - and queue data structures to solve various computing applications
2. Implement linked list data structure to solve various computing problems
3. Apply the data structure array for various list processing operations such as searching and sorting
4. Design and develop applications using appropriate hashing method
5. Demonstrate and apply binary tree and its applications
6. Demonstrate and apply different methods for traversing graphs
COs PO3 PO4 PO5

1 3 2 2
2 2 2 2
3 2 3 1
4 3 3 2
5 2 3 2
6 2 2 2
List of Experiments
1. Implement Stack and queue operations using array
2. Implement Singly Linked Lists
3. Implement Stacks and queues using linked lists
4. Implement Doubly Linked Lists
5. Implement to search an element using iterative linear and binary search
6. Implement Bubble sort, Insertion sort & Selection sort techniques
7. Implement Open Hashing and closed hashing (any one ) using appropriate data structures
8. Write a program to demonstrate Max-Heap operations and application Heapsort
9. Write a program to demonstrate Max-Heap operations and application priority queue with operations insert
and extract-max
10. Write a program to demonstrate different Binary search Tree Traversals
11. Write a program to demonstrate BST searching and deletion operations
12. Write a program to demonstrate different Graph Traversals
List of Augmented Experiments8
1. Develop an application that would allow you to insert and delete elements into/from the array at any
arbitrary location.
2. Develop an application to add and subtract following polynomials 5x2 – 3xy+y - 2x2 – y2+5xy – x+y using
array.
3. Develop an application to create one dimensional - two dimensional and three dimensional arrays in memory
and then verify the various address calculation formulae for any arbitrary element of these arrays.
4. Develop an application to implement a sparse matrix for the given matrix A.
5. Develop an application to implement a queue using stack operations.
6. Develop an application to convert the following expression to its postfix equivalent using stack
I. ((A+B )* D) ^ (E – F)
II. A+(B * C – (D / E ^ F) * G) * H Where ^: raise to the power
8
55
7. Develop an application to evaluate any given postfix expression. Test your program for the evaluation of the
equivalent postfix form of the expression (- (A*B)/D) ↑ C+E – F * H * I
for A = 1 - B = 2 - D = 3 - C = 14 - E = 110 - F = 220 - H = 16.78 - I = 364.621.
8. Develop an application to declare a priority queue using two-dimensional array - store elements and priority.
Display the elements according to priority from higher to lower.
9. Develop an application dequeue using a one dimensional array of size N.
10. Let X = (x1 - x2 - … xn) Y = (y1 - y2 - …yn) be two lists with a sorted sequence of elements. Write an
application to merge the two lists together as a single list Z with m+n elements. Implement the lists using
array and singly linked list.
11. Write a menu driven application which will maintain a list of car models - their price - name of the
manufacturer - engine capacity etc. - as a doubly linked list. The menu should make provisions for inserting
information pertaining to new car models - delete obsolete models - and update data such as price besides
answering queries such as listing all car models within a price range specified by the user and listing all
details given a car model.
12. Develop an application to perform the inorder, preorder and postorder traversals of a binary tree using non-
recursive methods.
13. Develop an application to perform inserting and deleting a node in a graph
14. Develop an application to simulate a calculator which performs the addition, subtraction, multiplication and
division of polynomials using linked list.
15. Develop an application to perform construction of an AVL search tree using insertion and deletion
operations.

1. Data Structures Lab manual, Department of CSE, GMRIT, Rajam
56
16IT309 Java Lab

0032
Course Outcomes
1. Make use of JAVA SDK environment to create - debug and run java programs
2. Create applications based on code reusability
3. Develop programs using threads
4. Develop and debug real time problems using exception handling
5. Create interactive applications using event handling mechanisms
6. Design Graphical User Interface using AWT components
COs PO2 PO3 PO4 PO5

1 3 2 3 1
2 3 2 3 1
3 2 2 2 1
4 2 2 3 1
5 2 2 3 2
6 2 3 2 2
List of Experiments
1. Write a Java program to demonstrate String handling methods.
2. Write a Java program for sorting a given list using inheritance concept.
3. Write a Java program for creating one base class for student personal details and inherit those details
into the sub class of student Educational details to display complete student information.
4. Write a Java program to implement matrix operations using multidimensional arrays.
5. Write a Java program that illustrates runtime polymorphism.
6. Write a Java program - to demonstrate tokenizing given string/text using String Tokenizer class
7. Write a Java program to create a package which has classes and methods to read Student Admission
details.
8. Write a Java program to define and handle Exceptions in the implementation of Program3. (Also make
use of throw - throws).
9. Java program that simulates a traffic light.
10. Write a Java program for handling mouse events.
11. Write a Java Program to design a Job Application/ Student Admission Form and store the values in a
file.
12. Write a java program for a simple event handler to display cut/copy/paste events using swings.
13. Write a Java program that works as a simple Calculator.
1. New Patient Registry Management System
2. Restaurant Billing Management System
3. Library Management System
4. ATM Management System
5. Bus Ticket Booking Management System
6. Movie Ticket Booking Management System
7. Queuing Management System
7
57
8. Attendance Management System

9. Medical Store Billing Management System
10. Text Editor Projects in Java
11. Google Search Engine Filter
12. Electronic voting System
13. Day Planner
14. Library management System
15. Personal Finance Management System
1. JAVA Lab manual, Department of CSE and IT, GMRIT, Rajam
58
16CS309 Database Management Systems Lab

0032
Course Outcomes
1. Illustrate ER model and identify the roles and privileges of various users in a database
2. Apply common SQL statements including DDL, DML and DCL statements to perform different operations
3. Construct SQL Queries for various operations on database
4. Interpret Embedded and Nested Queries
5. Implement control statements in PL/SQL
6. Apply triggers and assertions to stop malicious operations on tables
COs PO2 PO3 PO4 PO5

1 3 2 2 1
2 3 3 2 2
3 3 3 2 2
4 3 3 3 2
5 2 2 2 1
6 2 2 2 1
List of Experiments
1. Design ER Model for a given application & Convert ER model to Relational Model
2. Creating users - roles and Granting privileges.
3. Creating and altering tables for various relations in SQL
4. Implement Integrity Constraints. (Key constraints - Domain constraints)
5. Implementing queries in SQL using
5.1 Insertion
5.2 Retrieval (operations like union - intersect - minus - in - exists - group by and having etc.)
5.3 Updation
5.4 Deletion
6. Implementing joins - sub queries - nested and co related nested queries
7. Built in functions in oracle (String - Date - Aggregate functions etc.)
8. Working with views
9. Creating triggers and exception handling
10. Implementing cursors
11. Implementing operations on relations using PL/SQL
12. Implementing functions and stored procedures
13. Implementing the concepts of Rollback - commit and checkpoints
1. Inventory control management System
2. College Management System
3. Hospital management System
4. Library management System
5. Payroll management System
6. Health care organization Management System
7. Restaurant Management System
8. Blood Donation Management System
9. Art Gallery Management System
9
59
10. Hotel Management System

11. School Management System
12. Salary Management System
13. Wholesale Management System
14. Time Table Management System
15. Website Management
1. Database Management Systems Lab Manual, Department of CSE, GMRIT, Rajam
60
16CSI01 Tibero ® DB
(Course designed and will be delivered by TMaxSoft, Bangalore)
Course Outcomes 1001
1. Demonstrate and understanding of the relational data model

2. Performance analysis between Tibero® DB and Oracle DBMS
Tibero ®DB: Fundamentals of Data Base Management Systems, Fundamentals of Tibero®DB. Different data
models for Data Base management systems, Database Languages: DDL, DML, DCL, types of SQL queries and
different operators, Tibero / SQL Queries: Form of Basic SQL Query, Introduction to Nested Queries, Correlated
Nested Queries, Set Comparison Operators, Aggregative Operators-NULL values.
15 Hrs

1. https://technet.tmaxsoft.com/upload/download/online/tibero/pver-20150504-000002/index.html
16CSI02 Data Modelling for Business Intelligence
61
(Course designed and will be delivered by Cape Gemini)
1001
Course Outcomes
1. Understand DW architecture and different stages of data storage
2. Use normalization techniques to design OLTP and data warehouse
3. Design a data model for real life scenario
RDBMS Concepts – Data warehousing basics – ER Modeling – Enhanced ER Modeling – Conceptual Model (Case
Study) – Normalization – Quick Erwin Detail Demo – Erwin Hands on for Conceptual modelling – Normalized
Case Study – Dimensional Modeling – Data Modeling Standards – Hands on Exercise for Dimensional modelling
and reports
15 hrs
62
16MA405 Probability and Statistics

3103
Course Outcomes:
1. Understand basic probability axioms and apply Bayes’ theorem related to engineering problems.
2. Identify the suitable distribution among Binomial, Poisson, exponential, normal in engineering
applications.
3. Make use of the sampling distribution of the sample mean in general situations, using the Central
Limit Theorem.
4. Decide the null or alternative hypotheses using the suitable test statistic.
5. Apply the regression analysis to fit the curves.
6. Understand the methods and applications of Control charts like X-bar, p and R-charts.
COs–POs Mapping
COs PO1 PO 2
1 3 3
2 3 3
3 2 3
4 2 2
5 3 2
6 3 2
Unit I
Probability & Random variables
Sample space and events – Probability – The axioms of probability – Some Elementary theorems - Conditional
probability – Baye’s theorem, Random variables – Discrete and continuous Distributions and properties-
Expectations - MGFs
Real time problems of Baye’s theorem, Construction of discrete probability distributions
11 +4 Hours
Unit II
Probability Distributions
Binomial, Poisson, Exponential, Normal distributions and their MGFs – related properties
Limiting cases from Binomial distribution to Poisson and Normal distribution
11 + 4 Hours
Unit III
Sampling distribution & Testing of hypothesis
Populations and samples - Sampling distributions of mean (known and unknown)-Central limit theorem. Test of
Hypothesis– Type I and Type II errors. One tail and two-tail tests –tests of Hypothesis concerning one and two
means & Proportions-Z test, Maximum error and interval estimation of means and proportions. Tests of significance
– Student’s t-test, F-test, Chi-square test for independence of attributes
Real time problems in construction of confidence intervals and Testing of Hypothesis
11 + 4 Hours
63
Unit IV
Statistical Quality control, Correlation and Regression
Statistical Quality Control methods-Methods of preparing Control charts-X-bar, p and R-charts-curve fitting by the
method of least squares- linear, polynomial and exponential curves-Correlation-Pearson’s correlation coefficient
and Spearman’s Rank correlation and linear Regression.
Construction of np-chart
12 + 3 Hours
Total: 45+15 Hours
Textbook(s):
1. B.V.Ramana, Engineering Mathematics, TMH-publications, 4th Edition, 2009.
2. Miller and J. E. Freund, Probability & Statistics for Engineers, Prentice Hall of India, 8 th Edition, 2011.
3. T. K. V. Iyengar, B. Krishna Gandhi et. al, Probability & Statistics, S. Chand & Company, 2012.
Reference book(s):
1. Arnold O. Allen, Probability & Statistics, Academic Press, 2nd Edition, 2005.
2. Shahnaz Bathul, A text book of Probability & Statistics, V. G. S. Book Links, 2 nd Edition, 2007.
3. Murugesan and Gurusamy, A text book of Probability & Statistics, Anuradha Publications, 2011.
SAMPLE QUESTION (S)
Assessment Pattern
Remember 25 20 10
Understand 35 35 10
Apply 30 25 40
Analyze 10 20 20
Evaluate -- 10
Create -- 10
Total (%) 100 100 100
Remember
1. List out the formulas related to permutation and combination
2. List out all types of events in probability
3. Define axioms of probability
4. Define probability density function
5. Write the importance of Normal distribution
6. State the difference between null and alternative hypothesis
Understand
1. Explain probability, condition probability definitions and Bayes theorem
2. Discuss Moment generating functions of discrete and continuous distributions
3. Compare Binomial, Poisson, Normal distributions
4. Illustrate the procedure involved in sampling distributions
5. Compare large and small sample tests
6. Formulate the procedure for testing of hypothesis
7
64
Apply
1. The mean voltage of a battery is 15 and SD is 0.2. Compute the probability that four such batteries
connected in series will have a combined voltage of 60.8 0r more volts.
2. A company claims that the mean life time of tube lights is 500 hours. Is the claim of the company tenable if
a random sample of 25 tube lights produced by the company has mean 518 hours and SD 40 hours.
Company is satisfied if t falls between -t0.01 and t0.01.
3. Two machines A,B produces 60% and 40% of items from the total output. 6% and 8% are the defective
items produced by machines A and B respectively. An item is chosen from the total output and found to be
defective. Find the probability that the defective item is produced by machine A.
4. It is observed that 174 out of a random sample of 200 truck drivers on highway during night are drunk. Is it
valid to state that at least 90% of the truck drivers are drunk. Use 0.05 LOS
5. In a study of the effect of drugs on cancer, two groups of 80 such patients were considered. One group was
treated with allopathic drug while the other group with homeopathy drug. It was observed that 23 in the
first group and 41 in the second group were cured. At 0.05 L.O.S. test whether the true percent of patients
cured is at least 8% less for those who were treated by homeopathic drug?
65
16EC410 Microprocessors and Interfacing

3103
Course Outcomes
1. Illustrate the internal working of a typical simple CPU including the utilization of the various hardware
resources during the execution of instructions.
2. Implement memory chip and I/O chip interfacing to the 8086 microprocessor.
3. Interpret the architecture of 8086 processor, assembly language programming and interfacing with various
modules.
4. Choose various I/O peripheral interfacing like ADC, DAC, Keyboard, stepper motor etc., with
microprocessors using 8255 PPI.
5. Interface the 8086 interrupts and serial communication devices.
6. Use the concepts of microprocessors in real time and industrial applications.
COs – POs Mapping
COs PO1 PO 2 PO3

1 3 1 1
2 2 1 1
3 3 1 3
4 3 2 3
5 2 2 3
6 1 1 3
3–Strongly linked | 2–Moderately linked| 1–Weakly linked
UNIT- I
8086 Architecture:
8086-Functional Diagram, Register Organization, Signal description, Physical Memory Organization, Minimum and
Maximum mode operations of 8086, Timing Diagrams.
The processor architecture of 8088 and the difference between 8088 and 8086 microprocessors
9+3 Hours
UNIT- II
Instruction Set of 8086:
Addressing modes, Data Transfer Instructions, Arithmetic Instructions, Bit Manipulation Instructions, Branch
Instructions, Processor Control Instructions and String Instructions, Assembler Directives, Procedures and macros,
Assembly Language Programming Examples
Stack structure of 8086 microprocessor
12+4 Hours
Unit III
Programmable devices and Interfacing of I/O with 8086:
Semiconductor Memory Interfacing, 8255 PPI-Various modes of operations, Stepper Motor interfacing, D/A and
A/D Conversions, DMA Controller 8257.
Interfacing I/O Ports
12+4 Hours
Unit IV
8086 Interrupts and Serial Communication
8086 interrupts and Interrupt Vector Table (IVT), Programmable Interrupt Controller 8259A, Serial data transfer
schemes. Asynchronous and Synchronous data transfer schemes, Programmable Communication Interface 8251
USART, TTL to RS 232C and RS232C to TTL conversion, Sample program of serial data transfer.
66
The keyboard/ Display controller 8279 12+4 Hours

Total: 45 + 15 Hours
Textbook (s):
1. Ray and Bhurchandi, “ Advanced Microprocessors”, Tata McGraw-Hill 2nd edition 2007
2. D.V.Hall, “Microprocessor and Interfacing “, Tata McGraw-Hill.
Reference (s)
1. Liu and GA Gibson,Microcomputer system 8086/8088 family architecture, programming and design
PHI second edition
SAMPLE QUESTION (S)
Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test (%)
Remember 35 25 --
Understand 35 25 --
Apply 20 25 30
Analyze 10 15 40
Evaluate -- 10 20
Create -- -- 10
Total (%) 100 100 100
Remember
1. Write short notes on the following: i) OFFSET ii) PUBLIC

2. Draw the pin configuration of 8086
3. List out the registers of 8086
4. Define Macro
5. Write short notes on TTL to RS232C conversion
Understand
1. Describe about DMA Controller 8257

2. Write short notes on 8086 memory segmentation
3. Explain about minimum mode 8086 system and timings with diagram
4. Describe about string manipulation instructions with examples
5. What does an interrupt and explain the interrupts in 8086 with Interrupt Vector Table(IVT)?
6. What is the difference between Procedures and Macros?
7. Explain the modes of 8255 PPI
8. Explain about PCI 8251 USART
Apply
1. Write an assembly language program for sorting the numbers in ascending order
2. Write a program to count logical 1’s in a given byte 15H
3. Write an assembly language program to find the largest number in an array of hexa numbers
4. Write a program of 8086 to reverse the given string
5. Write a program to rotate the stepper motor in clockwise 4 rotations and anti-clockwise 6 rotations
67
Analyze
1. Interface an input port 74LS245 to read the status of switches SW1 to SW8. The switches, when shorted,
input a ‘1’ else input a’0’ to the microprocessor system. Store the status in register BL. The address of the
port is 0740H
2. Interface two 4K x 8 EPROMS and two 4K x 8 RAM chips with 8086. Select suitable maps
3. Design an interface between 8086 CPU and two chips of 16K X 8 EPROM and two chips of 32K X 8
RAM. Select the starting address of EPROM suitably. The RAM address must start at 00000H
4. Suggest Some Instructions for following operation & give a example for each operation i)Read the Lower
Byte of Flag register into AH ii)set ZF,CF,SF, and reset AC,PF flags iii) AND operation without results in
AX iv) set OF and execute interrupt v) store a byte in a string ,ES= 1000H,DI=2000H
5. Write a program of 8086 to find factorial of a given number
Evaluate
1. How does the interrupts handling in 8086 microprocessor
Create
1. Design the calculator using 4 X 4 keyboard
68
16IT406 Operating Systems

3103
Course Outcomes
1. Explain the concepts of process and implement CPU scheduling algorithms
2. Illustrate different problems and solutions related to process synchronization
3. Understand deadlock and use various algorithms to handle deadlocks
4. Understand various memory management mechanisms
5. Analyze various mechanisms used in virtual memory management
6. Analyze various file system and disk storage mechanisms
COs – POs Mapping
COs PO1 PO2 PO3

1 3 2 1
2 2 3 1
3 3 3 1
4 3 3 1
5 3 2 2
6 2 2 2

Unit I
Operating Systems Overview and Process Management
Operating Systems Overview: Introduction to Operating Systems - Operating System Structure - Operating System
Operations - Operating System Services - System calls - Types of System Calls.
Process Management: Introduction to Process - Process Scheduling - Operations on Processes - Inter Process
Communication - Process Scheduling Criteria - and Scheduling Algorithms and its Evaluation. Multi-Threading
Models
Multilevel Scheduling
12 Hours
Unit II
Process Synchronization and Deadlocks
Process Synchronization: Introduction to Process synchronization - The Critical-Section Problem - Peterson’s

Solution - Synchronization Hardware - Semaphores and Classical Problems of Synchronization using Semaphores
Deadlocks: System Model - Deadlock Characterization - Methods for Handling Deadlocks - Deadlock Prevention -
Deadlock Avoidance - Deadlock Detection - and Recovery from Deadlock.
Classical Problems of Synchronization using Monitors

11 Hours
Unit III
Memory Management
Memory Management: Introduction to Memory Management - Swapping - Contiguous Memory Allocation - Paging
- Segmentation.
Virtual Memory Management: Introduction to Virtual Memory Concept - Demand Paging - Copy on Write - Page
Replacement Algorithms - Allocation of Frames - Thrashing.
Memory Management by Intel
11 Hours
69
Unit IV
File System and Secondary Storage Structure
File Concept - Access Methods - Directory Structure - File System Structure - Allocation Methods - Free-Space
Management.
Overview of Mass Storage Structure - Disk Structure - Disk Scheduling - RAID structures
UNIX File System
11 Hours
Total: 45+15 Hours

Textbook (s)
1. Abraham Silberchatz, Peter B. Galvin and Greg Gagne, Operating System Concepts, 7th Edition, John
Wiley, 2005.
2. William Stallings, Operating Systems Internal Design Principles, 6th Edition, Pearson Education, 2005
Reference (s)
1. D.M. Dhamdhere, Operating systems, A Concept based Approach, 2nd Edition, TMH, 2006.
2. Crowley, Operating System A Design Approach, 1st Edition, TMH, 2001
3. Modern Operating Systems, Andrew S Tanenbaum, 3rd edition, PHI, 2009
SAMPLE QUESTION (S)

Remember 30 15 --
Understand 25 15 --
Apply 25 25 30
Analyze 20 25 40
Evaluate -- 10 30
Create -- 10 --
Total (%) 100 100 100
Remember
1. List any four operating systems

2. Define operating system
3. List any four operating system services
Understand
1. Explain System calls

2. Explain the role memory management in operating system
3. Illustrate the working principle critical section problem
Apply
1. When multiple transactions are being executed by the operating system in a multiprogramming
environment, there are possibilities that instructions of one transaction are interleaved with some other
transaction. Apply the suitable concept to overcome the problem
2. Give an example of a scenario that might benefit from a file system supporting an append-only access
write.
8
70
Analyze
1. Context switching between two threads of execution within the operating system is usually performed by a
small assembly language function. In general terms, what does this small function do internally?
2. Compare CPU scheduling algorithms
3. Analyze the general strategy behind deadlock prevention, and give an example of a practical deadlock
prevention method.
Evaluate
1. Assuming the operating system detects the system is deadlocked, what can the operating system do to
recover from deadlock?
2. Describe how to implement a lock using semaphores
71
16CS404 Software Engineering

3024
Course Outcomes
1. Understand the need of Software Life Cycle Models
2. Demonstrate the Requirements of the Software Systems process
3. Summarize the system models of software engineering
4. Choose appropriate software architecture style for real-time software projects
5. Analyze various testing techniques
6. Analyze Risk management and Software quality of the software products
COs–POs Mapping
COs PO1 PO2 PO3 PO4 PO5
1 3 3 2 2 2
2 3 3 2 2 2
3 3 2 2 2 2
4 2 2 2 2 2
5 2 3 2 2 2
6 2 3 2 2 2

Unit I
Introduction to Software Engineering and Life Cycle Models
Software engineering definitions software development projects, the evolving role of software, Changing Nature of
Software, Software myths.
Process models: Linear Sequential model, Prototyping model, Evolutionary models: Incremental model, Spiral
model, Agile developmental process
Business Process Engineering Overview - Product Engineering Overview
1. Suggest the suitable life cycle model for credit card validation system
2. Perform Agile Testing
12+6 Hours
Unit II
Software Requirements Engineering Process and S ystem Models
Functional & Nonfunctional requirements, Feasibility studies, elicitation and analysis, requirements validation,
context models, behavioral model, data model
Software Prototyping – Prototyping in the Software Process

1. Prepare the requirement analysis and SRS document
2. Estimate the effort using COCOMO Model
3. Develop DFD and Context model for given problem
11+12 Hours
Unit III
Design Engineering
Design concepts, data design, software architecture, Architectural styles and patterns, User interface design - Golden
rules, User interface analysis and design and steps
Data Acquisition System - Monitoring and Control System
72
1. Suggest architecture style for internet banking system
11+3Hours
Unit IV
Testing and Risk Management
Testing levels: Unit testing, integration testing, system testing – alpha and beta testing, black box and white box
testing, debugging,
Risk management - Risk types, strategies, estimation and Planning.
Software Quality - Quality assurance and its techniques
Software Implementation Techniques - Testing as an Engineering Activity
1. Prepare Test suite
2. Perform code generation using automated tools
11+9Hours
Total: 75 Hours
Textbook (s)
1. Rajib Mal, Fundamentals of software Engineering, 3rdEdition, Eastern Economy Edition, 2009
2. Roger S. Pressman, Software Engineering, A practitioner’s Approach, 6thEdition, McGraw-Hill
International Edition, 2005
Reference(s)
1. I. Sommerville, Software Engineering, 7thEdition, Pearson education, 2004
2. K K Aggarwal and Yogesh singh, Software engineering,3rd Edition, New age international publication,2008
SAMPLE QUESTION (S)

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Practical Test9 (%)
Remember 25 15 --
Understand 35 15 20
Apply 20 25 30
Analyze 20 25 30
Evaluate -- 10 20
Create -- 10 --
Total (%) 100 100 100
Remember
1. Define software engineering
2. List 3 software myths
3. Define Feasibility study
4. What is meant by debugging?
5. Define Risk
Understand
1. Explain various quality assurance techniques
2. Describe software architecture styles and patterns
3. Illustrate golden rules for user interface design
4. Explain various techniques for requirements elicitation and analysis
5. Describe the differences between white box testing and black box testing
9
Practical test should contain only questions related to Higher Order Thinking (HOT) Skills
73
Apply
1. Classify the techniques of requirement analysis
Analyze
1. Compare and Contrast software life cycle models
2. Analyze risk types in the risk management
Evaluate
1. How do you assess the quality of the software product?
2. How do you assess the performance of software models?
74
16CS405 Theory of Computation

3103
Course Outcomes
1. Understand finite automata and regular expressions

2. Demonstrate the minimization of DFA, Mealy and Moore machines
3. Summarize context free grammar and construction of PDA
4. Understand Chomsky classification and design Turing machine
5. Summarize computability, decidability and complexity through problem solving
6. Apply working skills in theory and application of finite state machines in compiler design
COs–POs Mapping
COs PO1 PO2 PO3
1 3 3 2
2 3 3 2
3 2 3 3
4 2 2 2
5 2 2 2
6 3 2 1
Unit I
Finite Automata
Symbol - String & their operation - DFA - NFA - Recognition of a language by an Automaton - Equivalence of
DFA and NFA - Finite Automata with Null-Closure - Minimization of FA - Equivalence of FAs - Finite Automata
with output: Mealy and Moore Machines;
Regular Languages: Regular Sets and Languages - Equivalence of FA & regular expression - Pumping Lemma for
Regular Languages - Closure Properties of Regular Sets
Mealy machine to More machine conversion and vice versa
12+4 Hours
Unit II
Context-free Languages and Push-Down Automata
Non-regular Languages - CFLs - Closure Properties of CFLs - CFGs - derivation trees - Simplification - Ambiguity
- Push-Down Automata - Normal Forms - Relationship between PDA and Context Free Languages; Pumping
Lemma for CFL. Decision Algorithm;
Generation of CFG - simplification of CFG
11+3 Hours
Unit III
Chomsky Hierarchy and Turing Machines
Unrestricted Grammars - Context Sensitive Languages and Grammars - - Relations between Classes of languages
The Turing Machine Model - Computable Languages and Functions - Turing Machines variants - Universal TMs -
Church’s Hypothesis
Linear Bounded Automata 12+4 Hours
75
Unit IV
Undesirability and Complexity Classes
Recursive Functions and Sets - Recursively Enumerable Sets - properties of Recursive and Recursively Enumerable
Languages - Rice’s Theorem - Post Correspondence Problem - Halting Problem -
Polynomial Reducibility, P – NP, NP – Complete and NP – Hard problems
Space and Time complexity
11+3 Hours
Total: 45+15 Hours
Textbook (s)
1. 1. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 3 rd
Edition, Pearson/Addison Wesley, 2007
2. Mishra & Chandra Sekharan, Theory of Computer Science& Automata Language and Computation, 3 rd
Edition, Prentice Hall of India, 2007.
Reference (s)
1. 1 P. Linz, Introduction to Formal Language and Computation, 2nd Edition, Narosa, 2006.
2. H. R. Lewis & C. H. Papadimitriou, Elements of the Theory of Computation, Prentice Hall of India, 2 nd
Edition - 2006.
SAMPLE QUESTION (S)

Remember 25 15 --
Understand 35 15 20
Apply 20 25 40
Analyze 20 25 30
Evaluate -- 10 10
Create -- 10 --
Total (%) 100 100 100
Remember
1. List out the different tuples of Deterministic Finite Automata
2. List out the closure properties of regular sets
3. Define NP problem
Understand
1. Explain the procedure of simplification of CFG
2. Describe the types of Turing machines
3. Illustrate the pumping lemma with an example
Apply
1. Apply the Arden’s theorem to convert the following Finite automata to Regular expression
10
76
2. Apply Pumping lemma to prove the language L={ a p / p is a prime number} is not regular
3. Eliminate UNIT productions from the CFG:
SA
AB
Ba/b/c
Analyze
1. Compare and Contrast Mealy machine and Moore machine

2. Analyze the solution to the PCP with the two lists M=(abb ,aa, aaa) and N=(bba, aaa, aa)
3. Analyze whether the language L ={anbncn/n>=1} is Context free language or not
Evaluate
1. Assess the performance of Pushdown automata over Finite automata

2. “Regular sets are closed under union” is true or false? Justify your answer
3. “We can design PDA for L ={anbncn/n>=1}” is true or false? Justify your answer
77
16CS406 Web Technologies

3103
Course Outcomes
1. Understand HTML tags to design static web pages

2. Describe the basic concepts of Java Scripts to design dynamic web pages
3. Familiarize the concepts of PHP and AJAX
4. Develop interactive applications using Servlets and JSP
5. Demonstrate database connectivity
6. Select appropriate tools for designing dynamic and interactive web applications
COs–POs Mapping
COs PO1 PO3 PO5 PO6
1 3 1 2 1
2 3 3 2 1
3 2 3 2 1
4 2 3 2 1
5 2 3 3 2
6 2 3 2 2
Unit I
HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, CSS: Introduction, CSS
Properties, Controlling Fonts, Text Formatting, Pseudo classes, Selectors,.
Java Script: Learning Java script: Variables, operators, Functions, Control structures, Events, Validations, plugins.
Introduction to HTML5, introduction to CSS3

13+4 Hours
Unit II
PHP Programming: Introducing PHP: Creating PHP script, Running PHP script. Working with Variables and
constants: Using variables, Using constants, Data types, Operators.
Controlling program flow: Conditional statements, Control statements, Arrays, functions. Working With forms.
PHP 5 Global Variables – Superglobals - PHP 5 Cookies - PHP 5 Session
10+3 Hours
Unit III
AJAX: Introduction, AJAX with XML
Servlets: introduction to servlets, Life cycle of servlets, JSDK, The servlet API, the javax.servlet package,
Reading servlet parameters and initialization parameters, The javax.servlet HTTP package, Handling Http request
and responses, Using cookie, session tracking.
Introduction to JSP: The problem with servlet, the anatomy of JSP page, JSP processing, JSP application design
with MVC, Tomcat server and testing tomcat, Generic dynamic content, using scripting elements implicit JSP
objects.
Servlets in Net Beans-Servlets in Eclipse-Servlet filter: Authentication filter-Filter Config
78
11+4 Hours
Unit IV
JSP application development: Conditional processing display values using an expression to set an attribute,
Declaring variables and methods, sharing data between JSP pages, Requests and users passing control and data
between pages, Sharing sessions and application data, memory usage considerations.
JDBC connectivity in JSP: Data base programming using JDBC, Studying javax.sql.* package, Accessing a
database from a JSP page, Application specific database actions, Deploying JAVA beans in JSP page.
JSP Custom tags-Custom tag API-Custom URI
11+4 Hours
Total: 45+15 Hours
Textbook (s)
1. Uttam Roy, Web Technologies, OXFORD University Press, 2010.

2. Jon Duckett, Web programming with HTML, XHTML and CSS, 2nd Edition, Wiley India, 2010
Reference (s)
1. Hans Bergsten, Java Server Pages, SPD O’Reilly, 2010.

2. Patrick Naughton and Herbert Schildt, The Complete Reference Java, 7th edition, TMH, 1999.
3. Michael Ekedahl, Web programming Bai, CENAGE Learning, India edition, 2003.
4. Paul S.Wang, An Introduction to Web DesignProgramming, India Edition, 2004.
SAMPLE QUESTION (S)

Remember 25 15 --
Understand 35 15 20
Apply 20 25 40
Analyze 20 25 20
Evaluate -- -- --
Create -- 20 20
Total (%) 100 100 100
Remember
1. List out different form elements in HTML
2. Define GET() and POST() method
3. List out different types of JDBC drivers
4. Write about XML DTD
5. Write MVC architecture
Understand
1. Explain fundamental HTML elements
11
79
2. Explain internet concepts

3. Illustrate how work java script events
4. Describe procedure for how to connect PHP to MYSQL
5. Explain AJAX technologies
Apply
1. Demonstrate how to develop a servlet
2. Design an application to be developed through JSP
3. Use JSP MVC architecture in application development
4. Execute a JSP code for a real time problem
5. Implement enterprise application using JSP
Analyze
1. Analyze the processing time of servlets with JSP
2. Analyze the process of web application deployment
3. Compare Servlets with JSP
4. Analyze the difference between XML and AJAX
Create
1. Generate cookies for three user authentication process
2. Produce a JSP code for user tasks in e-commerce
3. Construct an enterprise application for a real problem
80
16EC411 Microprocessors and Interfacing Lab

0032
Course Outcomes
1. Illustrate the arithmetic operations, procedures and macros.
2. Design real time applications with microprocessors.
3. Design the PC based communication circuits using serial bus connection.
4. Explain the full internal workings of a typical simple CPU including the utilization of the various
hardware resources during the execution of instructions.
5. Outline the design of basic I/O hardware and microprocessor interfacing: memory chip selection,
memory expansion, I/O interfacing.
6. Use microprocessors chips to control Traffic lights signals.
List of Experiments
(For Laboratory examination–Minimum of 10 experiments)
Part-A
Microprocessor 8086: Any 7 Experiments

Introduction to MASM/TASM
1. Arithmetic operation – Multi byte addition and subtraction, Multiplication and Division – Signed and
Unsigned Arithmetic operations, ASCII – arithmetic operations (Any 2 Experiments)
2. Logic operations – Shift and rotate – Converting packed BCD to unpacked BCD, BCD to ASCII
conversion. (Any 1 Experiment)
3. String operations-- Move Block, Reverse string, Sorting, Inserting, Deleting, Length of the string,
String comparison. ( Any 3 Experiments)
4. Modular Program: Procedures and macros -Near and Far implementation. (Any 1 Experiment)
Part-B
Interfacing 8086 – Any 3 Experiments
1. 8251 – USART.
2. Traffic lights
3. Message Displays
4. Keyboard
5. Stepper Motor
6. DAC

1. Density based traffic signal system using microprocessor.

1. Ray and Bhurchandi, “ Advanced Microprocessors”, Tata McGraw-Hill 2nd edition 2007
2. D.V.Hall, “Microprocessor and Interfacing “, Tata McGraw-Hill
12
Students shall opt any one of the Mini–Projects in addition to the regular experiments
81
16CS408 Linux Programming Lab

0032
Course Outcomes
1. Illustrate the knowledge of the basics of Unix/Linux commands
2. Apply the concepts of shell scripting on data and files
3. Understand the utility of SED to work on specific data
4. Apply the Inter Process Communication in Linux environment
5. Develop a simple communication application to communicate using TCP/UDP client server model
6. Develop solutions to real-world problems
COs–POs Mapping
COs PO1 PO4 PO14

1 3 3 1
2 3 3 1
3 2 3 1
4 2 3 1
5 2 3 1
6 2 3 3
List of Experiments
1. Execute the following UNIX commands: cal - date - echo -bc -passwd - PATH - who -uname -pwd - cd -
mkdir -rmdir - cat -cp -rm - mv - more - ls -wc.
2. Execute the following UNIX commands: cmp -comm - diff - tar -df - du - mount -umount -chmod and vi
editor commands.
3. a) Write a shell script to accept three numbers and display the largest.
b) Write a shell script which will accept different numbers and find their sum.
c) Write a shell script to find the number of files in a directory.
4. a) Write a shell script to display first ten positive numbers using until loop.
b) Write a shell script to print the first 10 odd numbers using the while loop.
5. a) Write a sed command that deletes the first character in each line in a file.
b) Write a sed command that deletes the character before the last character in each line in a file.
c) Write a sed command that swaps the first and second words in each line in a file.
6. Implement the following forms of IPC. a) Pipes b) FIFO
7. Implement file transfer using Message Queue form of IPC.
8. Implementation of semaphore: Write a program that demonstrates how two processes can share a variable
using semaphore
9. To implement C Program to Catch Signals SIGINT - SIGKILL - SIGSTOP.
10. Write a c program to implement Two threads displaying two strings “Hello” and “How are you?”
independent of each other.
11. Design TCP iterative Client and Server application to reverse the given input sentence.
12. Design UDP Client Server to transfer a file.
82

1. Simulate the UNIX help main menu
2. Simulate the File Management Commands Sub-menu
3. Simulate the Text Processing Commands Sub-menu
4. Simulate the System Status Commands Sub-menu
5. Code for Shell Script to make a menu driven calculator using case in Unix / Linux / Ubuntu
6. Code for Shell Script to create a Menu Driven program : Hard Link - Soft Link - Counting each of the links
for a specific link and Display the soft-links in Unix / Linux / Ubuntu
7. Using the file input - do the following using sed - displaying the result on the screen
8. Create a chat server using Message Queue
9. Simulate alarm using Unix / Linux / Ubuntu alarm system call
10. Implement a game to create 1 master process and 10 racing processes where the master process is feeding a
pipe with "Win" - and then broadcast the signal SIGUSR1 to its group of process. When a racing process
gets the signal SIGUSR1 - it tries to read the pipe - the one getting the "Win" message is out for the rest of
the game. At the end of the game - each process has a number which is the round number in which it caught
the message "Win".
11. Simulate dice rolling.
12. Simulate Text editor in UNIX / Linux / Ubuntu

1. Linux Programming Lab manual, Department of CSE, GMRIT, Rajam
12
83
16CS409 Web Technologies Lab

0032
Course Outcomes
1. Create a static web pages using HTML and CSS

2. Develop JavaScript code for data validation
3. Integrate frontend and backend technologies in client-server systems
4. Demonstrate Servlet life cycle methods
5. Design dynamic web applications using PHP and JSP
6. Demonstrate database connectivity for developing web applications
COs–POs Mapping
COs PO3 PO4 PO5 PO8
1 3 1 2 1
2 3 3 2 3
3 2 3 2 1
4 3 3 2 3
5 3 3 3 2
6 2 3 2 2
The students have to choose one of the following project and do the all 12 experiments related to that project.
1. Training and placement cell
2. School Education System
3. University Management System
4. Hospital Management System
The following are the experiments related to Training and Placement cell project. For the remaining projects, the
concern lab instructor has to decide the experiments according to the websites given as examples.
List of Experiments
Experiment1: Design the following static web pages required for a Training and placement cell web site.
1) Home Page 2) Login Page 3) Registration page
Experiment2: 4) Company Details Page 5) Alumni Details Page 6) Placement Staff Details Page
Experimen3: 7) Student personal Info Page 8) Student Academic Info page 9) Semester Wise Percentage & their
Aggregate page
Experiment4: Validate login page and registration page using regular expressions.
Experiment5: Apply different font styles, font families, font colors and other formatting styles to the above static
web pages.
Experiment6: Install wamp server and tomcat server, access above developed static web pages using these servers.
Experiment7: Write a servlet/PHP to connect to the database, Insert the details of the users who
register with the web site, whenever a new user clicks the submit button in the registration.
84
Experiment8: Write a JSP/PHP to connect to the database, Insert the details of the student academic information
with student academic info page.
Experiment9: User Authentication:
Assume four users user1user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4 respectively.
Write a servlet for doing the following.
1. Create a Cookie and add these four user id’s and passwords to this Cookie.
2. Read the user id and passwords entered in the Login form (week1) and authenticate with the values (user id and
passwords) available in the cookies.
If he is a valid user (i.e., user-name and password match) you should welcome him by name (user-name) else you
should display “You are not an authenticated user “.
Use init-parameters to do this. Store the user-names and passwords in the webinf.xml and access
them in the servlet by using the getInitParameters() method.
Experiment10: Write a JSP which does the following job:

Authenticate the user when he submits the login form using the user name and password from the database.
Experiment11: write a JSP to insert the student’s semester wise percentages and calculate aggregate and insert into
database.
Experiment12: write a JSP to search the students according to their aggregate and produce sorted list or according
to their Enroll number.
List of Augmented Projects10
1. Student Information system

2. Online Hospital Management
3. Online Shopping Project
4. Web based Appointment Systems
5. Scrapbook
6. Online Job Recruitment System
7. Web Crawlers
8. Attendance management system
9. Online Banking system
10. Online Exam
11. Railway Reservation system
12. Leave Application Management System
13. Address Book
14. Movie Rental Systems
15. Online Auction System
1. Web Technologies Lab manual–Department of CSE & IT-GMRIT Rajam
10
85
16ESX01 / 16ESX02 Employability Skills I & II
16ESX01 Employability Skills I
Soft Skills: Communication Skills & Confidence: How Communication Skills affect Confidence? How to
communicate effectively.(with Examples) ; Listening: Listening? , Listening Vs Hearing, Possible reasons for why
people do not Listen at times, Active Listening Vs Passive Listening, How Listening can affect our relationships?
How Listening helps in Campus Placements also? (with Examples);Goal Setting: Vision Vs Mission Vs Goals, Why
Goal Setting? SMART Technique to Goal Setting, Putting First things First, SWOT Analysis and Time
Management; Attitude & Confidence: Attitude Vs Skills Vs Knowledge, Attitude Vs Behaviour, How to develop
Positive Attitude? Confidence? Fear? Steps to Overcoming the Fear of Public Speaking? Public Speaking: JAM,
J2M, Presentations by Students on General Topics.
16ESX02 Employability Skills II
Soft Skills: Communication Skills (An Overview): Communication? Elements of Communication, Communication
Skills and Role of Feedback, Cross-Checking, Detail Orientation and Follow-up in our Interactions (with
Examples); Building Vocabulary: Reading Articles, Exploring New Words, Meanings and the usage with examples;
Self Esteem: Definition? Types of Self Esteem, Causes of Low Self Esteem, Merits of Positive Self Esteem and
Steps to build a positive Self Esteem; Group Discussions (Practice): GD? GD Vs Debate, Overview of a GD , Skills
assessed in a GD, Dos & Don’ts, & Conducting practice sessions (Simple Topics); Brain Storming Sessions (on
Current affairs) ; Case Study (on Problem Solving) ; Motivational Talk: Team Work: Team Vs Group? Stages in
Team Building, Mistakes to avoid and Lessons to Learn (Through Stories); (Can be a Case Specific also)
86
16IT404 Computer Networks
3103
Course Outcomes
1. Understand the basic network infrastructure to learn the overall function of networking systems
2. Classify various wired and wireless transmission media for data communication networks
3. Apply knowledge of different techniques of error detection and correction to detect and solve error bit during
data transmission
4. Compare various routing algorithm and select an appropriate one for a routing design
5. Design a network routing for IP networks
6. Understand the internal functionalities of main protocols such as HTTP, FTP, SMTP, TCP, UDP, IP
COs–POs Mapping
COs PO1 PO2 PO3

1 3 2 1
2 3 3 1
3 1 3 2
4 2 3 1
5 1 3 3
6 3 1 1
Unit I
Network Hardware-Network Software-and Transmission Media
OSI-TCP/IP-the ARPANET-Network Topologies-Physical Layer:
Transmission media: Magnetic Media-Twisted pair-Base band Coaxial Cable-Fiber optics-Wireless Transmission:
Electromagnetic Spectrum-Radio Transmission-and Microwave Transmission. Switching Techniques: Circuit
Switching-Packet Switching-Message Switching.
Taxonomy of networking devices.

11+4 Hours
Unit II
Data link layer
Design Issues: Framing-error detection and correction-CRC-Elementary Data link Protocols: Stop and wait-Sliding
Window protocols: Go-back-n-Selective Repeat-Medium Access sub layer: Channel allocation methods-Multiple
Access protocols: ALOHA-CSMA-IEEE Standard 802.3 and Ethernet-IEEE Standard 802.4: Token bus.
Data Link Control Protocols: HDLC-SLIP-PPP
12+4 Hours
Unit III
Network Layer
Network Layer design issues-Virtual circuit and Datagram subnets-Routing algorithms: Shortest path routing-
Flooding-Hierarchical routing-Distance vector routing-Broad cast and Multi cast routing,Congestion Control:
Congestion prevention policies.
Internet control protocols
10+3 Hours
Unit IV
Transport Layer & Application Layer
87
Transport Services-Connection management-Elements of Transport Protocols-Internet Transport Protocols: UDP

and TCP. IPv4 & IPv6, Application Layer-Domain name system-Electronic Mail-WWW-SMTP
ATM Transport protocol-Proxy Servers-Multimedia: Data compression-digital representation of analog signals-
Real time transport protocol-session control protocols
12+4 Hours
Total: 45+15 Hours
Textbook (s)
1. Andrew S Tanenbaum, Computer Networks, 4th Edition, Pearson Education /PHI, 2002
2. Behrouz A. Forouzan, Data Communications and Networking, 3rdEdition, Tata McGraw Hill Higher
Education, 2003
Reference (s)
1. Willam Stallings, Data and Computer Communications,8th Edition, Pearson Prentice Hall, 2007
2. W.A. Shay, Thomson, Understanding communications and Networks, 3rd Edition, Cengage Learning, 2005
SAMPLE QUESTION (S)

Remember 25 10 --
Understand 35 30 30
Apply 20 20 40
Analyze 20 20 30
Evaluate -- 20 --
Create -- -- --
Total (%) 100 100 100
Remember
1. List the applications of Computer Networks
2. Write two differences between OSI and TCP/IP models.
3. State 5 key assumptions in Dynamic channel allocation?
4. State the purpose of DNS.
5. Define congestion.
6. State the 2-army problem.
Understand
1. Illustrate OSI Reference model.
2. Explain various design issues of data link layer.
3. What are the responsibilities of Data Link layer and explain Pure Aloha and Slotted Aloha protocols.
4. Describe Distance Vector routing algorithm with example and explain count to infinity problem
5. Represent the Manchester encoding for the bit stream: 0001110101.
Apply
1. What is the check summed frame transmitted if the message is 1101011011 and the generator polynomial is
x 4 + x + 1 using CRC
2. Can you think of any circumstances under which an open-loop protocol, (e.g., a Hamming code) might be
preferable to the feedback-type protocols.
3. Assuming that all routers and hosts are working properly and that all software in both is free of all errors, is
there any chance, however small, that a packet will be delivered to the wrong destination?
1
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
88
Analyze
1. The following data fragment occurs in the middle of a data stream for which the byte-stuffing algorithm
described in the text is used: A B ESC C ESC FLAG FLAG D. What is the output after stuffing?
2. The following character encoding is used in a data link protocol: A: 01000111; B: 11100011; FLAG:
01111110; ESC: 11100000 Show the bit sequence transmitted (in binary) for the four-character frame: A B
ESC FLAG when each of the following framing methods are used:
(a) Character count.
(b) Flag bytes with byte stuffing.
(c) Starting and ending flag bytes, with bit stuffing.
3. Analyze Data link protocols almost always put the CRC in a trailer rather than in a header.
Evaluate
1. Consider the user of differentiated services with expedited forwarding. Is there a guarantee that expedited
packets experience a shorter delay than regular packets? Justify.
2. Compute a multicast spanning tree for router C in the following subnet for a group with members at routers
A, B, C, D, E, F, I, and K.
89
16IT505 Object Oriented Analysis and Design

3024
Course Outcomes
1. Understand Unified Modelling Language and Rational Rose for object oriented modelling
2. Illustrate the conceptual model of UML
3. Represent Behavioral diagrams in UML
4. Identify the basic and advanced structural diagrams
5. Relate forward and reverse engineering for a software system
6. Assess the architectural modelling of UML
COs–POs) Mapping
COs PO2 PO3 PO4 PO5
1 2 2 2 3
2 1 3 3 3
3 2 3 3 3
4 2 3 3 3
5 2 2 3 3
6 2 2 2 3
UNIT I
Introduction to OOAD & UML: Introduction to UML: Importance of modeling, principles of modeling, object
oriented modeling, Conceptual model of the UML, Architecture, and Software Development Life Cycle.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.
Types and Roles and their notations in UML
14+8 Hours
1.Suggest to explain overview of UML.
2.Suggest to explain rational rose software
UNIT II
Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.
Advanced Structural Modelling: Advanced classes, advanced relationships, Interfaces
Basic Behavioral Modeling-I: Use cases, Use case Diagrams
Packages,Instances and their notations in UML
13+8 Hours
The student should take up a case study which is mentioned in the theory, and Model it in different views
UNIT III
Basic Behavioral Modeling-II: Interactions, Interaction diagrams, Activity Diagrams.

Advanced BehaviouralModelling: Events and signals, state machines, processes and Threads, State chart
diagrams.
Time and space and their notations in UML
10+8 Hours
1. The student should take up a case study which is mentioned in the theory, and Model it in different views
UNIT IV
Architectural Modeling
Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.
Patterns and frameworks-Systems and models
8+6 Hours
90
The student should take up a case study which is mentioned in the theory, and Model it in different views.
Total: 75 Hours
List of Experiments:
1. Library Management System
2. Point of Sale
3. E-Commerce web portal
4. Online Banking web portal
5. Online Travel Ticket Booking Portal
6. Online Hotel Booking portal
7. Hospital Management System
8. e-Governance portal
9. EAMCET Web Counselling portal
10. Content Management System
Textbook(s)
1. Grady Booch , James Rumbaugh and IvarJacobson, The Unified Modeling Language User Guide, 1st
Edition ,Addison Wesley October 20, 1998
2. Ali Bahrami, Object Oriented Systems Development using the unified modeling language, 1 stEdition,
TMH, 2008
Reference (s)
1. Meilir Page, Jones, Fundamentals of Object Oriented Design in UML, Pearson Education, 1999.
2. AtulKahate, Object Oriented Analysis & Design, The McGraw-Hill Companies, 2004.
SAMPLE QUESTION (S)

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Practical Test2 (%)
Remember 25 10 10
Understand 35 30 10
Apply 20 20 40
Analyze 10 20 20
Evaluate 10 20 20
Total (%) 100 100 100
Remember
1. List out applications of UML
2. State SDLC?
3. Define Process and Phases
4. Define swimlanes in Activity diagram
Understand
1. Illustrate Conceptual model of UML
2. Illustrate object oriented modeling
3. Formulate overview of interaction diagrams
2
Practical test should contain only questions related to Higher Order Thinking (HOT) Skills
91
Apply
1. Choose Case Study for Online banking System
2. Demonstrate a class diagram for University data base
3. Construct a use case diagram for Railway reservation system
Analyze
1. Compare Object Oriented Analysis vs. Object Oriented Design
2. Differentiate concepts of state machines and state chart diagrams
Evaluate
1. Judge Deployment vs. component diagram
2. Choose a suitable diagram when it is a design phase
92
16IT602 Artificial Intelligence

3103
Course outcomes
1. Interprets different types of AI agents
2. Identify various AI search algorithms (Un-informed, Informed, Heuristic, Constraint Satisfaction, Genetic
Algorithms) for e-domain application systems
3. Compare fundamentals of knowledge representation (Logic-based, Frame-based, Semantic Nets), Inference
and Theorem proving
4. Demonstrate working knowledge of reasoning in the presence of incomplete and/or uncertain information
5. Apply knowledge representation, reasoning and machine learning techniques to real-time application
systems
6. Understand independent (or in a small group) research and communicate it effectively in a seminar setting
COs–POs Mapping
COs PO1 PO2 PO3
1 2 3 2
2 2 3 3
3 1 3 1
4 3 3 3
5 2 3 2
6 1 3 2

Unit I
Introduction & Heuristic Search Techniques
AI problems, AI techniques, Defining problem as a state space search, Production systems, Problem characteristics,
Production system characteristics. Generate-and-test, hill climbing, best-first-search, problem reduction, constraint
satisfaction
Means-ends-analysis and data abstraction-mapping
12+4 Hours
Unit II
Knowledge representation
Issues, predicate logic, resolution, representing knowledge using rules, forward versus backward reasoning,
matching, control knowledge, weak slot and filler structure-semantic nets, frames, strong slot
Filler structures-conceptual dependency-scripts
11+ 3 Hours
Unit III
Game Playing
Mini-max search, alpha-beta cutoffs, planning system, goal stack planning, hierarchical planning, understanding as
constraint satisfaction, waltz algorithm, natural language processing, syntactic processing.
Semantic analysis-case grammars
11+ 4 Hours
Unit IV
Learning
Rote learning, learning by taking advice, learning in problem solving, learning from examples, winston’s learning
program, decision trees, perception, vision, speech recognition, navigation, manipulation, robot architecture
Expert systems, shell-explanation-knowledge acquisition
11+ 4 Hours
Total: 45+15 Hours
93
Textbooks (s)
1. E.Rich K.Knight, and B. Nair, Artificial Intelligence, 3rdEdition, TMH, 1 July 2017
2. Russel Norvig, Artificial Intelligence A modern Approach, 3rd Edition, Pearson Education,2010
Reference (s)
1. Patrick henry Winston,Artificial Intelligence, third edition,Pearson Education Asia, 2005
2. Dan W. Patterson, Introduction to Artificial intelligence and Expert Systems, 2 nd Edition, PHI,2009
SAMPLE QUESTION (S)

Remember 40 30 --
Understand 35 30 --
Apply 25 40 70
Analyze -- -- 20
Evaluate -- -- 10
Create -- -- --
Total (%) 100 100 100
Remember
1. State the tasks which are associated with A.I.
2. Give an example of cript-arithmetic problem.
3. Define Script
4. Recall Intelligence
Understand
1. Explain Turing Test.
2. Explain the characteristics of production system.
3. Write A* algorithm in detail and explain its functionality to solve 8-puzzle problem.
4. Explain the semantic analysis phase done through case grammars in Natural Language understanding
Apply
1. Distinguish between weak and strong slot filler structures

2. Discuss the tic-tac-toe problem in detail and explain how it can be solved using AI technique
3. Construct semantic net representation for the following:
(i) Pompeian (Marcus), Blacksmith (Marcus)
(ii) Mary gave the green flowered vase to her favorite cousin.
Analyze
1. Show that the tower of Hanoi problem can be classified under the area of AI. Give a state space
representation of the problem.
2. Give an example of a problem for which breadth-first search would work better than depth-first search.
Justify your answer.
3. Consider the following sentences:
John likes all kinds of food.
Apples are food.
Chicken is food
3
94
Anything anyone eats and isn’t killed by food.

Bill eats peanuts and is still alive.
Sue eats everything Bill eats.
(a) Translate these sentences into formula in predicate logic.
(b) Convert the formulas of part a into clause form.
Prove that John likes peanuts using resolution.
Evaluate
1. Convert the following statements to conceptual dependencies.
(i) I gave a pen to my friend
(ii) Rama ate ice cream
(iii) I borrowed a book form your friend
(iv) While going home, I saw frog
2. Assume the following facts:
Steve only likes easy courses.
Science courses are hard.
All the courses in the basket wearing department are easy.
BK 301 is a basket wearing course.
Use resolution to answer the question.
“What course would Steve like?”
3. Trace the constraint satisfaction procedure solving the cryptarithmetic problem.
SEND
+ MORE
MONEY
Create
1. The function h’ is an estimator of h of best-first search algorithm. Explain what is done in the algorithm if
h’ underestimates h and h’ overestimate h.
2. Write A* algorithm in detail and explain its functionality to solve 8-puzzle problem.
3. Consider the problem of finding cloths to wear in the morning. To solve this problem, it’s necessary to use
knowledge such as:
 Wear jeans unless either they are dirty or you have a job interview today.
 Were a sweater if it’s cold.
 It’s usually cold in the winter.
 Wear sandals if it’s warm
 It’s usually warm in the summer.
Build a JTMS-style database of the necessary facts to solve this problem.
95
16CS504 Compiler Design

3103
Course Outcomes
1. Explain different translators and acquire knowledge of compiler & its Phases
2. Identify formal grammars for specifying the syntax and Semantics of programming languages
3. Construct parse table for a given grammar
4. Generate symbol table and intermediate code for a given program
5. Apply code optimization techniques to improve the performance of a program
6. Identify tools to construct the machine independent code
COs–POs Mapping
COs PO2 PO3 PO5
1 2 3 1
2 3 2 2
3 3 2 1
4 3 2 2
5 3 2 1
6 3 2 3
Unit I
Overview of Language Processing-Compiler-Assembler-Interpreters-Linkers & Loaders-Structure of Compiler-
Phases of a Compiler-Lexical Analysis-Role of Lexical Analysis-Token-Patterns and Lexemes-Lexical Errors-
Regular definitions for the Language constructs- Lex tool
Input buffering- Transition diagram for recognition of Tokens-Reserved Words and Identifiers
11+3 Hours
Unit II
Syntax Analysis-Top-down Parsing-First and Follow-LL(1) Grammar-Non-Recursive Predictive Parsing-Bottom-up
parsing-Shift Reduce Parsing-Model of an LR Parsers-Construction of SLR Tables-Construction of CLR (1)-LALR
Parsing tables-Dangling ELSE ambiguity.
Handling Ambiguous grammars-Error recovery in LR parsing
12+4 Hours
Unit III
Semantic Analysis-SDT: Synthesized and Inherited attributes - Intermediate Code -Three Address Code-
Quadruples-Triples-Indirect Triples-Abstract Syntax Trees-DAG for Expressions-Symbol Tables-Runtime
Environment: Storage Organization-Storage allocation strategies
Data structures used in symbol table

11+4 Hours
Unit IV
Machine Independent Code Optimization-Common Sub-expression Elimination-Constant Folding-Copy
Propagation-Dead Code Elimination-Strength Reduction-Loop Optimization-Basic Blocks-Flow Graph-DAG for
basic Blocks-Machine Dependent Code Optimization: Peephole Optimization-Register Allocation-Instruction
Scheduling
Code generation algorithm-optimization among basic blocks
11+4 Hours
Total: 45+15 Hours
96
Textbook (s)
1. Alfred V Aho, Monical S Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers, Principles Techniques and Tools,
2nd Edition, Pearson, 2007.
2. V. Raghavan, Principles of Compiler Design, 2nd Edition, TMH, 2011.
Reference (s)
1. Nandini Prasad, Principles of Compiler Design, 2nd Edition, Elsevier, 2012
2. Kenneth C Louden, Compiler Construction, Principles and Practice, 1st Edition, Cengage, 1997.
3. Yunlin Su Song Y. Yan, Implementation Theory of computation Theory of computation ns of Compiler, A
New approach to Compilers including the Algebraic Methods, Springer, 2011
SAMPLE QUESTION (S)

Remember 25 20 15
Understand 40 30 25
Apply 25 30 30
Analyze 10 10 20
Evaluate -- 10 10
Create -- -- --
Total (%) 100 100 100
Remember
1. State some software tools that manipulate source program.
2. List out the cousins of compiler.
3. Define sentinel .What is its usage?
4. Write about Symbol Table Management.
Understand
1. Represent the Error-recovery actions in a lexical analyzer.
2. Formulate the roles and tasks of a lexical analyzer.
3. Illustrate Why lexical and syntax analyzers are separated out.
4. Identify the problems with top down parsing
Apply
1. Demonstrate top down parsing and bottom up parsing methods.
2. Show the contents of activation record.
3. Choose the properties of optimizing compiler.
4. Find a suitable approach for computing hash function.
Analyze
1. Identify the difficulties with top down parsing.
2. Breakdown the grammar for flow-of-control statements.
3. Differentiate declarations are done in a procedure using syntax directed translations
4. Justify the variety of forms in target program.
Evaluate
1. Determine the addressing mode and associated costs in the target machine.
2. Defend the step to partition a sequence of 3 address statements into basic blocks.
3. Choose the important classes of local transformations on basic blocks.
4. Criticize code optimization and optimizing compiler.
4
97
16CS505 Design and Analysis of algorithms

3103
Course Outcomes
1. Understand the fundamentals for analyzing time and space complexity of algorithms
2. Describe the basic principles of various algorithms and design techniques
3. Apply appropriate algorithm design technique to solve real time application
4. Identify suitable method to solve optimization problem
5. Understand P and NP problems
6. Analyze the performance of algorithm designed for real time application
COs–POs) Mapping
COs PO2 PO3
1 3 2
2 2 2
3 3 3
4 3 3
5 2 2
6 3 3
Unit I
Introduction to Algorithms
Fundamentals of algorithmic problem solving – Analysis framework - Performance Analysis: - Space complexity,
Time complexity - Growth of Functions: Asymptotic Notation- Big oh notation, Omega notation, Theta notation,
little oh, little omega. Mathematical Analysis of Non-recursive algorithms – Mathematical Analysis of Recursive
algorithms - Brute Force: Bubble sort – Sequential search - String matching
10+4 hours
Time complexities of basic operations on array, stack, queue
Unit II
Algorithm Design Techniques - I
Decrease and Conquer: General method, Insertion sort, Topological sorting – Divide and Conquer: General method,
Merge sort, Quick sort, Fibonacci search – Transform and conquer: General method, Heapsort – Disjoint sets:
Operations, Simple Union and simple find, Weighted Union, Collapse Find.
12+4 hours
Graph representation, graph applications
Unit III
Algorithm Design Techniques - II
Greedy method: General method, applications:-Job sequencing with deadlines, Minimum cost spanning trees
(Prim’s and Kruskal’s Algorithms), Single source shortest path problem (Dijkstra’s Algorithm), Optimal Merge
Patterns (two way merge pattern) - Dynamic Programming: General method, applications:-Matrix chain
multiplication, 0/1 knapsack problem, all pairs shortest path problem.
13+3 hours
Optimal BST, Huffman trees and codes
98
Unit IV
Limitations of algorithm power methods to cope up
P, NP and NP-Complete Problems: - P and NP problems, NP-Complete problems. Backtracking: General method,
applications:-n-queen problem, sum of subsets problem, Hamiltonian Circuit problem. Branch and Bound: General
method, Applications: - Traveling sales person problem, Assignment Problem
10+4 hours
0/1 knapsack problem, graph coloring problem
Total: 45+15 Hours
Textbook (s)
1. Introduction to The Design and Analysis of Algorithms, 3 rd Edition, Anany Levitin, Pearson Education,
2017.
2. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekaran, University press.
Reference (s)
1. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI
Pvt. Ltd./ Pearson Education
2. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
3. Algorithms – Richard Johnson Baugh and Marcus Schaefer, Pearson Education.
SAMPLE QUESTION (S)

Remember 15 10 -
Understand 35 20 10
Apply 30 40 60
Analyze 20 30 30
Evaluate -- - -
Create -- - -
Total (%) 100 100 100
Remember
1. Define performance analysis of an algorithm.
2. Define recurrence relation
3. Define disjoint sets.
4. Define optimality principle
Understand
1. Explain back tracking algorithm
2. Explain Asymptotic notations
3. Explain the LC search algorithm
4. Explain the divide and conquer strategy. Write the applications of divide and conquer strategy and write the
control abstraction for divide and conquer strategy
5. Explain the 4 cases of master theorem
6. What are implicit and explicit constraints in back tracking ?
5
99
Apply
1. Solve the fractional knapsack problem with capacity m=20,W=(18,15,10),P=(25,24,15) for the optimum
solution.
2. Create two arrays that store all even no’s in one array and all odd no’s in another array for a given set of
elements
3. Find the space and time complexity of an algorithm to find the maximum element from an array.
4. Solve the recurrence relation T(n)=2T(n/2)+nlogn) using master theorem.
5. Demonstrate the process of Fibonacci search with an example
6. Find the shortest tour for the TSP for the given graph using FIFOBB.
Analyze
1. Analyze the time complexity of quicksort .
2. Differentiate greedy method with dynamic approach
3. Discuss the worst case time complexity of travelling sales person problem
4. How polynomial multiplication is best with FFT
5. Compute the time complexity of fun()?
int fun(int n)
{ int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
100
16IT409 Computer Networks Lab

0032
Course Outcomes
1. Demonstrate various networking devices to design a network
2. Examine various routing algorithms for reliable data communication networks
3. Categorize the algorithms for data link layer
4. Analyze the communication parameters of routing algorithms
5. Use TCP protocol to configure the network connection
6. Use internal modem and Wi-Fi to analyze the data communication
COs–POs) Mapping
COs PO2 PO4 PO5

1 2 2 2
2 3 3 2
3 2 3 2
4 3 3 3
5 2 2 2
6 3 3 3
List of Experiments
1. A. Familiarization with Networking Components and devices: LAN Adapters - Hubs -Switches - Routers
etc. B. Familiarization with Transmission media and Tools: Co-axial cable - UTP Cable - Crimping Tool -
Connectors etc.
2. Preparing the UTP cable for cross and direct connections using crimping tool.
3. Implement the data link layer framing methods: a. Character stuffing method b. Bit Stuffing method
4. Implement on a data set of characters the two CRC polynomials: CRC 12 - CRC 16
5. Implement on a data set of characters the CRC polynomials: CRC CCIP.
6. Implementation of sliding window protocol: go back n sliding window protocol
7. Implement Dijkstra‘s algorithm to compute the Shortest path thru a graph.
8. Take an example subnet graph with weights indicating delay between nodes. Now Obtain Routing table art
each node using distance vector routing algorithm.
9. Take an example subnet of hosts. Obtain broadcast tree for it
10. To configure the IP address for a computer connected to LAN and to configure network parameters of a
web browser for the same computer.
11. Configuration of TCP/IP Protocols in Windows
12. A. Installing of internal modem and connecting to Internet. B. To configure WiFi for your PC.
13. Installation of NS2/NS3 tools and Overview
List of Augmented Projects10

1. Peer to Peer File Sharing Technology over LANs
2. Internet Protocol Testing.
3. Packet Loss Testing Tool.
4. Network Design Proposal for An Institution.
5. Implementation Of Client Server Protocol
6. Implantation of Chart Server Project In Java
7. Congestion Control Using Network Based Protocol
8. Networking Project On Prevention Of Congestion Collapse.
9. Network Administrator Tool Project
10. Domain Name Service With Secured Manner Project.
11. File Transfer Protocol Project.
12. Client-Server Based Instant Messenger.
13. Remote System Access by Using Virtual Network Computing Project.
101
14. Multi File Upload In Java

15. Active Source Routing Protocol For Mobile Networks.
10
102
16ESX03 / 16ESX04 Employability Skills III & IV

0201
16ESX03 Employability Skills III
Soft Skills: Introduction to Campus Placements: Stages of Campus Placement, Skills assessed in Campus
Placements & How to get ready - A Motivational Talk on Positive Thinking: Beliefs, Thoughts, Actions, Habits &
Results (Success); Resume Preparation: Resume Templates Mistakes to be avoided in a Resume, Steps to be
followed in preparing it (with examples) - Group Discussions: GD Stages of a GD, Skills assessed in a GD,
Blunders to be avoided, How to excel in a GD - GD-Practice: Practice sessions for the Students on different Topics
including the contemporary issues with brief inputs on each topic & feedback on their performance & Evaluation
Quantitative Aptitude: Problems on numbers - H.C.F and L.C.M - Problems on ages – Averages - Time and Work
- Time & Distance – Percentages - Profit & loss - Ratio & Proportions – Partnership - Simple interest & Compound
interest – Clocks – Calendars - Pipes and Cisterns - Mensuration
Verbal reasoning: Number series - Direction test - Blood relations – Syllogisms - Seating arrangement -
Permutations, combinations and Probability – Dice - Cube and Cuboid - Data sufficiency - Logical deductions –
Analogies - Course of action - Cause and effect - Data interpretation
103
16HSX04 Engineering economics and project management
3103
Course Outcomes
1. Explain the basic principles of engineering economics

2. Apply cost-volume-profit (CVP) analysis in their business decision making
3. Evaluate investment proposals through various capital budgeting methods
4. Apply the knowledge to prepare the simple financial statements for measuring performance of business
firm
5. Analyze key issues of organization, management and administration
6. Evaluate project for accurate cost estimates and plan future activities
COs – POs Mapping
COs PO11 PO14

1 3 2
2 3 2
3 3 3
4 3 3
5 3 3
6 3 2
Unit I
Introduction to Engineering Economics - Demand Forecasting & Cost Analysis
Concept of Engineering Economics – Types of efficiency – Managerial Economics Nature and Scope – Law of
Demand – Types of Elasticity of demand.
Demand Forecasting & Cost Analysis: Demand Forecasting: Meaning, Factors Governing Demand Forecasting,
Methods of Demand Forecasting (Survey and Statistical Methods) – Cost Analysis: Basic Cost Concepts, Break
Even Analysis.
Factors affecting the elasticity of demand – Supply and law of Supply.

10 + 3Hours
Unit II
Investment Decisions & Market Structures - Financial Statements & Ratio Analysis
Time Value of Money – Capital Budgeting: Meaning, Need and Techniques of Capital Budgeting –Types of Markets
Structures – Features – Price Out-put determination under Perfect Competition and Monopoly.
Financial Statements & Ratio Analysis: Introduction to Financial Accounting – Double entry system – Journal –
Ledger – Trail Balance – Final Accounts (with simple adjustments) – Financial Analysis through Ratios:
Interpretation of Liquidity Ratios (Current Ratio and quick ratio), Activity Ratios (Inventory turnover ratio and
Debtor Turnover ratio, Creditors Turnover Ratio, Capital Turnover Ratio), Solvency Ratios (Debt- Equity ratio,
Interest Coverage ratio), and Profitability ratios (Gross Profit Ratio, Net Profit ratio, Operating Ratio, P/E Ratio and
EPS).
Price output determination under Monopolistic markets, Accounting concepts and conventions
11 + 6Hours
Unit III
Introduction to Management - Strategic Management
Introduction to Management: Nature – Importance – Classical Theories of Management: F.W.Taylor’s and Henri
Fayol’s Theory – Functions and Levels of Management – Decision Making Process.
Methods of Production (Job, Batch and Mass Production) - Inventory Control, Objectives, Functions – Analysis of
Inventory – EOQ.
104
Maslow & Douglas Mc.Gregor theories of Management, ABC Analysis

12 + 2 Hours
Unit IV
Project Management
Introduction – Project Life Cycle and its Phases – Project Selection Methods and Criteria – Technical Feasibility –
Project Control and Scheduling through Networks – Probabilistic Models of Networks – Time-Cost Relationship
(Crashing) – Human Aspects in Project Management: Form of Project Organization – Role & Traits of Project
Manager.
Sources of Long-term and Short-term Project Finance

12 + 4Hours
Total: 45+15Hours
Textbook (s)
1. Pravin Kumar, Fundamentals of Engineering Economics, Wiley India Pvt. Ltd. New Delhi, 2012
2. Rajeev M Gupta, Project Management, 2nd Ed., PHI Learning Pvt. Ltd. New Delhi, 2014
Reference (s)
1. Panneer Selvam. R, Engineering economics, 2nd Ed.,, Prentice Hall of India, New Delhi, 2013
2. R.B.Khanna, Project Management, PHI Learning Pvt. Ltd. New Delhi, 2011
3. R. Panneer Selvam & P.Senthil Kumar, Project Management, PHI Learning Pvt. Ltd. New Delhi, 2010
4. A. Aryasri, Management Science, 4th Ed., Tata McGraw Hill, 2014
5. A. Aryasri, Managerial Economics and Financial Analysis, 4th Ed., Tata McGraw Hill, 2014
6. Koontz & Weihrich, Essentials of Management, 6th Ed., TMH, 2010
7. Chuck Williams and Mukherjee, Principle of Management 7th Ed., Cengage Learning, 2013
SAMPLE QUESTION (S)

Assessment Pattern
Remembering 25 20 --
Understanding 25 15 --
Application 20 20 30
Analysis 10 15 30
Evaluate 20 20 20
Create - 10 20
Total (%) 100 100 100
Remember
1. Define Managerial Economics. Explain its nature and scope.
2. Explain the concept of efficiency? What are the serveral methods to enhacing the economic efficiency?
3. Define Production Function? What are the various types of production functions
4. What is meaning of productivity? Explain how productivity can be enhanced in the Indian industries.
5. How are projects “unique” and ‘temporary as defined by PMBOK?
6
105
Understand
1. What do you understand by engineering economics? Discuss.
2. What is law of demand? Explain its exceptions.
3. Explain different elements of costs used in cost analysis
4. Illustrate the effect of price on demand and supply with the help of a diagram.
5. Compare and contrast long-run equilibrium under monopolistic competition with that under perfect
competition.
Apply
1. Determine price elasticity of demand given that the quantity demand of a product is 1000 units when the
price is Rs.100 and when the price declines to Rs.70, demand increases to 1100 units.
2. Consider the following data of company for the year 2015
Sales = Rs.2,40.000/-
Fixed cost = Rs.50,000/-
Variable cost = Rs.75,000/-
Find out the followings
a) Contribution
b) Profit
c) BEP
d) Margin of safety
3. “Every debit must have a corresponding credit” Explain.
4. Identify the factors that are to be diagnosed both in the external and the internal environment to make
enough ground for strategy formulation. Illustrate appropriately
5. “Poor technology selection can lead to total failure for a manufacturing firm”, Do you agree? Give reasons
in support of your answer with suitable examples.
Analysis
1. “Management is regarded as an art by some, science by others”. In the light of this statement, explain the
exact nature of management.
2. Make a comparative analysis of the features of different methods of production.
3. Analyze the Discounted Cash Flow (DCF) technique for appraising large investment decisions.
4. Is there any link between mission, goal, objective, strategy and programmes in an industrial environment?
5. Compare and contrast the project evaluation and review technique (PERT) with the critical path method
(CPM).
Evaluate
1. Evaluate survey based demand forecasting methods with appropriate examples.

2. The logical sequence of management functions cannot be subordinated even by one function. Do you
agree? Support your answer.
3. Can there be a strategy without a mission? Give a mission statement for following organization:
A) An internet servce provider
B) A large private hospital
C) State electricity board
4. From the following information calculate ARR of the project, with initial cost of Rs.2,00,000/- and scrap
value is Rs.10,000/.
Year Project
1 20000
2 50000
3 70000
4 60000
5 40000
5. Following data relates to a certain project.
106
Activity to tm tp
1-2 2 5 14
1-3 3 12 21
2-4 5 14 17
3-4 2 5 8
4-5 1 4 7
3-5 6 15 30
a) Construct the network b) Find the project duration
c) Identify the critical path
Create
1. Discuss the flow of goods, services, resources and money payments in a simple economy with the help of a
suitable diagram.
2. Sketch and explain the demand relationship in each of the following statements.
a. I would never buy a Britney Spears CD! You couldn’t even give me one for nothing.
b. I generally buy a bit more coffee as the price falls. But once the price falls to Rs.2/-, I’ll buy out
the entire stock of the supermarket.
c. I spend more on orange juice even as the price rises. (Does this mean that I must be violating the
law of demand?)
3. “Managerial Economics is the discipline which deals with application of economic theory to business
management”, Discuss.
4. How information technology has enabled the development of project management in recent times?
5. ‘GE Matrix is an extension of BCG Matrix’, Discuss.
107
16CS602 Data Mining
3024
Course Outcomes
1. Understand the stages of KDD process and detailed architecture of Data Warehouse and data preprocessing
2. Discover and measure interesting patterns from different kinds of databases
3. Use association rule mining algorithms to generate association rules
4. Choose appropriate classification technique for a given dataset
5. Analyze clustering techniques on a given dataset
6. Demonstrate capacity to perform a self-directed piece of practical work that requires the application of data
mining techniques
COs–POs Mapping
COs PO2 PO3 PO4 PO5
1 3 1 1 1
2 3 1 2 3
3 3 3 3 2
4 3 3 3 2
5 3 3 3 2
6 3 2 2 2
Unit I
Introduction to Data Mining and Warehousing
Overview of Data warehouse-Data Warehouse Architecture-Introduction to Data Mining-Basic Data Mining Tasks-
Data Mining Issues-Data Mining Metrics-Different sources of Data Mining-Data Mining and KDD-Types of Data-
Data Preprocessing-Statistical Perspective on Data Mining-Similarity Measures-Examples of Proximity Measures-
Issues in Proximity Calculations-Selection of the Right Proximity Measure
Data Mining Primitives-Concept Description: Characterization and Comparison
1. Introduction to Graphical User Interface (GUI) of WEKA
2. Creating new arff file
11+9 Hours
Unit II
Mining Association Rules in Large Databases
Association Rule Mining-Mining Single-Dimensional Boolean Association Rules from Transactional
Databases-Mining Multilevel Association Rules from Transaction Databases-Mining Multidimensional
Association Rules from Data sources-From Association Mining to Correlation Analysis-Constraint-Based
Association Mining
Evaluation of Association Patterns-Effect of Skewed support distribution
1. Perform data pre-processing on sample data set
2. Perform Association Analysis to derive the association rules using Apriori and FP-Growth Algorithm.
12+6 Hours
Unit III
Classification of Data
Preliminaries-General Approach to Solving Classification Problem-Decision Tree Induction-Rule-based Classifier-
Nearest-Neighbor Classifiers-Bayesian Classifiers-Artificial Neural Network
Classification by Backpropagation-Genetic Algorithms
108
1. Implement the Classification using Decision Tree Induction.
2. Implement the Classification using Regression.
10+9 Hours
Unit IV
Cluster analysis
Cluster analysis – types of clustering – Types of clusters - K-means-Agglomerative Hierarchical Clustering–
DBSCAN-Prototype-based Clustering-Cluster Evaluation-Characteristics of Data, Clusters and clustering algorithms
– Prototype clustering – Density based clustering
Grid-Base Clustering Methods-Model Based Clustering Methods
1. Implement classification using Bayesian classification
2. Implement the K-means Clustering and Hierarchical clustering.
12+6 Hours
Total: 75 Hours
Textbook (s)
1. Pang, Ning Tan, Michael Steinbach, Vipin Kumar Introduction to Data Mining, 1st Edition, Pearson
Addison Wesley, 2005
2. Jiawei Han & Micheline Kamber, Data Mining Concepts and Techniques, 2nd Edition, Morgan Kaufmann,
2006
Reference (s)
1. Margaret H Dunham, Data Mining Introductory and advanced topics, 2nd Edition, Pearson Education, 2004
2. Arun K Pujari, Data Mining Techniques, 2nd Edition, University Press, 1999.
3. Ian H. Witten, Eibe Frank, Mark A. Hall, Data Mining:Practical Machine Learning Tools and Techniques,
3rd Edition, Morgan Kaufmann Publishers, 2011
SAMPLE QUESTION (S)

Remember 35 15 20
Understand 30 25 30
Apply 20 30 20
Analyze 15 20 20
Evaluate -- 10 10
Create -- -- --
Total (%) 100 100 100
Remember
1. What are the steps in the data mining process?
2. What is Descriptive and predictive data mining?
3. What is Data Generalization?
4. What is clustering?
5. Define Spatial Databases.
Understand
1. What are the requirements of clustering?
2. How is association rules mined from large databases?
7
109
3. What is the classification of association rules based on various criteria?

4. Explain the various OLAP operations.
5. Explain data reduction
6. Explain Data mining Primitives
7. Explain the data mining functionalities
Apply
1. Find some of the data mining applications
2. Show the various social impacts of data mining?
3. Demonstrate the different types of data repositories on which mining can be performed
4. Choose some specific application oriented databases.
Analyze
1. Identify the different types of data repositories on which mining can be performed
2. Compare the parametric methods and non-parametric methods of reduction
3. Differentiate the types of data in cluster analysis.
4. Justify Additional themes in data mining
5. Criticize over the data quality is so important in a data warehouse environment
Evaluate
1. Judge the attributes requirement for high performance data mining
2. Determine the data visualization help in decision-making
3. Select the factors to be considered while selecting the sample in statistics
110
16CS603 Internet of Things

3003
Course Outcomes:
On completion of this course the students are able to:
CO1: Understand IoT framework, architecture and design principles of M2M Communication
CO2: Understand the design principles of Web and Internet Connectivity and its protocols
CO3: Understand MAC and IP addressing in IoT, 6LowPAN and LoRaWAN protocols
CO4: Identify the suitable sensor technology for data collection and how to store and use it for Computing
CO5: Develop business models in IoT by identifying vulnerabilities and attacks involving in IoT
CO6: Demonstrate an application using IoT technology
CO-PO Mapping
COs PO3 PO7
1 3 3
2 2 2
3 1 2
4 3 2
5 3 3
6 2 3
UNIT I 10 + 3 =
13
Overview of IoT: Overview of Wireless Sensor Networks, Overview of Internet of Things, IoT Conceptual
Framework, IoT Architectural View, Technology Behind IoT, Sources of IoT, M2M Communication.
Design Principles: IoT/M2M Systems Layers and Design Standardization, Communication Technologies, Data
Enrichment, Data Consolidation and Device Management at Gateway
Examples of IoT, Ease of Designing and Affordability
UNIT II 12 + 4= 16
Design Principles for Web Connectivity: Introduction, Web Communication Protocols: Constrained Applications
Protocol (CoAP), Lightweight Machine-to-Machine Communication; Message Communication Protocols: Message
Queue Telemetry Transport (MQTT); Internet Connectivity Principles: Introduction, Internet Connectivity,
Internet-Based Communication, IP Addressing in the IoT, Media Access Control, Introduction to 6LowPAN and
LoRaWAN
Application Layer Protocols: HTTP, HTTPS, FTP and Telnet
UNIT III 12 + 4 = 16
Sensor Technology: Sensing the Real World using Analog and Digital Sensors, Industrial IoT, Automotive IoT,
Actuator, RFID Technology – Principles, Architecture, Applications & Components, Web of Things of RFIDs. Data
Collection, Storage and Computing: Introduction, Cloud computing Paradigm for Data Collection, Storage and
Computing, Everything as a Service and Cloud Service Models for IoT
Sensor Data Communication Protocol: Serial Bus – USB, CAN
UNIT IV 11 + 3 = 15
Business Models and Processes using IoT: Introduction, Business Models, Business Scenarios in IoT.
111
IoT Privacy, Security and Vulnerabilities Solutions: Security and Privacy Requirements, Threat Analysis, IoT
Layered Attacker Model, Access Control and Secure Message Communication, Security Models
Case Studies: Smart Home, Smart City, Precision Agriculture
IoT Hardware: Raspberry pi, Arduino
Textbook:
1. Raj Kamal, “Internet of Things: Architecture and Design Principles”. TMH Publications, 2017.
2. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition, VPT, 2014
Reference:
1. Ovidiu Vermesan & Peter Friess, “Internet of Things: Converging Technologies for Smart Environments and
Integrated Ecosystems”, River Publishers Series in Communications, 2017.
Cognitive Int. Test 1 Int. Test 2 Assignment Test8 (%)

Level (%) (%)
Remember 25 25
Understand 30 30 40
Apply 20 20 30
Analyze 25 20 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Write the major significance of Internet of Things.
2. State the crucial requirement f IoT in terms of application and its supporting natures.
3. List the dominant technologies behind IoT development.
4. Identify two major differences between Internet of Everything and Industrial IoT.
5. Write about the data-center based cloud tools that use to run the machine learning algorithm
internally.
6. Recognizes an alternative approach that results in better adaptivity in case of network fluctuations
and increased latency.
7. Identify the on-demand processing and storage capabilities that is used to analyze the data
generated by IoT objects in batch or stream format.
Understand
1. Identify the evolutionary terms of Internet of Things (IoT) that use to interact and live with the
physical objects.
2. Illustrate the reference architecture of IoT that unifies the smart objects and human beings to
provide the ubiquitous communication
3. Illustrate the service-oriented architecture of IoT that ensures the interoperability among the
heterogeneous devices
4. Illustrate the API-Oriented Architecture of IoT that use SOAP and Remote Method Invocation
(RMI) as a means for describing, discovering, and calling services
5. Discuss the resource capacity, selecting and provisioning the resources that greatly impact
Quality of Service (QoS) of the IoT applications
6. Classify the taxonomy of resource management activities of IoT.
7. Report the standard requirement of real time analytics to fulfill the demand of real-time stream
processing engine.
112
Apply
1. Interpret a study analysis on open-source prototyping platform for the industrial IoT.
2. Implement a suitable OPENIoT Architecture for IoT/Cloud Convergence that provides an
abstract presentation of the functional elements of architecture.
3. Sketch W3C SSN-XG ontology and how to semantically enable real time sensor feeds
4. Execute the two-tier data dissemination model for large-scale wireless sensor network
5. Demonstrate SPARQL query caching in order to improve the performance of semantic web
applications
6. Illustrations a technique to cluster semantically similar QA pairs for retrieving an answer for a
newly given query without asking the QA engine on the cloud side
Analyze
1. Comparative analysis on real-time analytics in Cloud-IoT and fog computing.
2. Compare the communication efficiencies for the following protocols such as AMPQ, CoAP,
DDS, MQTT, UPnP and XMPP in terms of Transport Layer Protocols.
3. Differentiate the major significances of nesC, keil C and Dynamic C.
4. Relate a set of minimal features to be fulfilled by the programming frameworks for IoT.
5. Comparative analysis on IoT programming approaches
Evaluate
1. Select an example that utilizes the device-collaboration framework for the proactive suggestion
application
2. Appraise a semantic QA cache that implement the device/cloud collaboration framework to
compute the probability of the on-device semantic QA cache to answer a given query correctly.
3. Select a suitable example that use automatically tagging recognized images to display the
additional information such as social sentiment in order to achieve similar performance
improvement for speech-recognition application with DL through device/cloud collaboration
framework
4. Critique on fog-computing assisted distributed analytics system that uses a set of fall-detection
algorithms, including algorithms based on acceleration measurements and time-series analysis
methods, as well as filtering techniques to facilitate the fall-detection process.
5. Defend the augmented reality applications in terms of Game based on Fog Computing and Linked
Data
113
16CS604 Mobile Computing

3103
Course Outcomes
1. Use wireless networking principles to understand the fundamentals of mobile telecommunication systems and
standards
2. Illustrate the basic concepts, techniques, protocols related to GSM and GPRS architecture to perform
requirements analysis
3. Explain major components of Mobile IP to improve the service qualities of a network
4. Analyze various ad hoc routing protocols to examine the performance of network.
5. Explain the architecture of Wireless Sensor Network and Wireless LAN to learn the key objectives of design
issues and limitation.
6. Outline the basic knowledge in developing smartphone applications using various platforms, toolkits, APIs and
third-party libraries
CO-PO Mapping
COs PO2 PO3 PO5
1 2 2 1
2 3 2 2
3 2 2 1
4 3 2 2
5 1 1 1
6 2 3 2
3-Strongly linked , 2-Moderately linked ,1-weakly linked
Unit I
Mobile Communications
Overview: Wireless transmission - voice and data communication standards-1G/2G/3G/4G - WPAN - WLAN -
applications-limitations-mobile computing architecture-overview on mobile devices and systems. Wireless Medium
Access Control: Motivation for a specialized MAC (Hidden and exposed terminals - Near and far terminals -
MACA) - modulation - Spread spectrum - SDMA - FDMA - TDMA – CDMA GSM: services - system architecture
- radio interface - localization - call handling - handover - security - GPRS -EDGE
Networking: communication modes - basic network designs - cellular infrastructure 11+4 Hours
Unit II
Mobile Network and Transport Layer
Mobile Network Layer: Mobile IP - IP packet delivery - agent advertisement and discovery - registration -
tunneling and encapsulation - optimizations - Dynamic Host Configuration Protocol Mobile Transport Layer:
Traditional TCP - Indirect TCP - Snooping TCP - Mobile TCP . 12+4 Hours
Multi Task gadget: wide area mobile data - air link standards for data - wireless application environment
Unit III
Mobile Ad hoc Network (MANET)
Introduction - Properties - applications - limitations - routing issues - routing algorithms-proactive (DSDV & OLSR)
and reactive (DSR & AODV).
Wireless Sensor Network (WSN): Introduction - architecture - applications - security in ad hoc networks
Wireless LAN: IEEE 802.11 - System architecture - Protocol layers.
Satellite systems: history - applications - basics - broad cast systems 10+3 Hours
114
Unit IV
Network Simulator:
Overview on different network simulators (NS2 - NS3 -Qualnet -Omnet++ -Netsim etc.) - configuration of MANET
and WSN on NS2/NS3.
Mobile OS: Overview on different mobile Oss (Android OS - Android OS architecture , IOS - architecture , black
berry ) , App development examples ,Wireless Application Protocol (WAP): Introduction – architecture,
Application layer protocols - SMTP , FTP , DHCP, World Wide Web, Windows 10.
12+4 Hours
Total: 45+15 Hours
Textbook (s)
1. Raj Kamal, Mobile Computing, Oxford press, 2nd Edition, 2012
2. Jochen Schiller, Mobile Communications, Pearson Education, 2ndEdition, 2003
Reference (s)
1. Asoke K Talukder, Hasan Ahmed and RoopaYavagal Mobile Computing, McGraw Hill, 2010
2. Prasant Kumar Pattnaik and Rajib Mall, Fundamentals of Mobile Computing, PHI Learning, 2012
3. http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf (NS2 manual)
SAMPLE QUESTION(S)
Cognitive Level Int.Test 1(%) Int.Test 2(%) Assignment Test (%)

Remember 30 25 10
Understand 25 15 20
Apply 25 20 30
Analyze 20 20 30
Evaluate -- 10 10
Create -- 10 --
Total 100 100 100
Remember
1. List the applications of mobile computing.

2. List the limitations of mobile computing.
3. Define mobile computing.
4. Define Mobile Ad hoc Network
5. List the MANET routing issues
Understand
1. Explain mobile computing with architecture
2. Explain FDMA and TDMA with neat diagrams
3 .Illustrate the different services provided by the GSM, Explain with system architecture
4. Explain IP Packet Delivery with diagram
5 .Describe DSSM (DIRECT SEQUENCE SPREAD SPECTRUM)
115
Apply
1.Illutrate Registration Process achieved in mobile network layer
2.Discuss the feature of tunneling and encapsulation
3.Illustrate the function of Dynamic Host Configuration Protocol
4.Discuss about security in Ad-hoc network
5. Illustrate the properties of MANETS
Analyze
1.Compare snooping TCP and indirect TCP
2.Analyze the Performance of Dynamic source Routing Protocol
3.Compare about IOS, Windows 8 and Blackberry operating systems
4.Compare NS2 and NS3 simulators
5.Explain about Android Operating system with architecture
Evaluate
1. Evaluate the performance of Wireless Datagram protocol
2. Evaluate the performance of DSDV
3. Evaluate the performance of DSR
4. How Traditional TCP is different from Indirect TCP
5. How localization and call handling is performed
Create
1. Develop an app for given operating system.
2. Design an app for given Application
3. Implement simple mobile games.
116
16CS607 IoT Lab

0032
Course Outcomes:
On completion of this course the students are able to:
CO1: Study of various sensory elements and the required hardware and software used in IoT
CO2: Implement the interfacing methods with MCU
CO3: Implement the communication techniques used for IoT
CO4: Demonstrate the data acquisition by interfacing with various Sensors with MCU
CO5: Develop WSN application with different network topologies
CO6: Design and develop IoT application with/without the involvement of cloud computing
COs PO4
1 3
2 2
3 2
4 3
5 2
6 2
List of Experiments
1. Study of Sensory Elements and the installation of required compiler in Linux
2. Embedded Programming
1.1. Toggling LEDs
1.2. Transmitting a string through UART
1.3. Controlling LEDs blinking pattern through UART
1.4. Echo each character typed on serial terminal.
1.5. Digital IO configuration.
1.6. Timer based LED Toggle.
3. RF experiments
2.1. Point to point communication of two Ubimotes over the radio frequency.
4. Experiments on interfacing with UbiSense
3.1. Reading Temperature, Light Intensity and Relative Humidity value from the sensor.
3.2. Proximity detection with IR LED.
3.3. Generation of alarm through Buzzer.
3.4. Transmitting the measured physical value from the UbiSense over the Air.
5. WSN Applications
4.1. Demonstration of a peer to peer network topology using coordinator and end device
4.2. Establishing different Network Topologies
6. IOT applications
5.1. IP Based sensor monitoring through Ubimote and Ubi-sense
Suggested Augmented Experiments
1. Interfacing various sensors with Raspberry Pi and Arduino Uno
2. Setting up and working with a web server to store data and run other applications
3. Using Google Cloud Messaging (GCM) service to send sensor data notification to an Android app when the
situation arises and to display stored data
4. Configure IPv6 on Raspberry Pi
5. Hosting a Website on Raspberry Pi
6. Wireless Sensor Network using Raspberry Pi
117
16ESX03 / 16ESX04 Employability Skills III & IV

0201
16ESX04 Employability Skills IV
Soft Skills: Introduction to Campus Placements: Stages of Campus Placement, Skills assessed in Campus
Placements; The Changing scenario and its Challenges & How to get ready? ; Building Vocabulary: Through
reading Articles, Exploring New Words, Meanings and the usage with examples; Business Terminology: Vision,
Mission, Objectives, Goals, Targets and Financial Terms such as Debt, Equity, Share, Working Capital, Turnover,
Net Worth etc ; Resume (Recap): Resume? Templates? Mistakes to be avoided in a Resume and Steps to be
followed in preparing it; Group Discussions (Recap) & Practice: GD? Stages of a GD, Skills assessed in a GD,
Blunders to be avoided, How to excel in a GD? Practice sessions and sharing Feedback. (Screening sample Videos);
Interview Skills: Interview? Types of Interview, Dos & Don’ts, Skills assessed in an Interview, Mistakes to be
avoided, How to equip oneself to excel? How to handle the Typical Interview Questions? (with Examples); Mock
Interviews: Practice sessions with Feedback; Exercises related to Communication: JAMs, Case Studies, Video
Synthesis, Email Writing, Story Writing, TAT etc.
118
Elective I
16IT001 Information System Design
3103
Course Outcomes
1. Understand the concepts of information system development to learn planning methodologies and
strategies
2. Examine various analytical tools for the benefits of computer assisted systems
3. Identify the design objectives of software development process to manage the end system development
4. Describe control design principles to illustrate an online dialogue
5. Use software design and documentation tool to illustrate the system engineering process
6. Describe the testing strategies and estimation process to learn the implementation and maintenance process
COs–POs Mapping
1 2 1 2 2
2 3 2 2 2
3 3 2 1 2
4 1 2 2 2
5 3 2 2 1
6 1 2 2 2
Unit I
Introduction to Information systems Development
Overview of system analysis and Design Categories of Information systems-Systems Development strategies-
Implementation and Evaluation-Tools for systems development-Information systems Planning Methodologies-
Managing project Review and selection-Preliminary Investigation-Project Feasibility-selecting the project-
development strategy. Requirement Analysis and Determinations: Activities in Requirements determination-Fact
finding Techniques: Interview-Questionnaire-Record Review-observation
People and Procedures-Expert Systems (artificial intelligence)

10+5 Hours
Unit II
Prototype Development Strategy
Tools for Documenting Procedures and Decisions: Decision Trees-Decision Tables-Structured Analysis-Dataflow
Analysis-Tools for dataflow strategy-Developing data flow diagrams-Leveling-Data dictionary. purpose of
prototyping-steps in prototype Method-use of prototypes-tools for prototyping-Prototyping Strategies. Computer
Aided System Tools: Benefits of computer Assisted Tools-Categories of computer assisted system Engineering
(CASE) Tools.
Time Box Approach-IT Organization vs. End-User Development

10+3 Hours
Unit III
System Design
Objectives-Features to be designed-Managing the design process-Managing EndUser development system Design of

output-Design of Input and control-Design of online dialogue-Design of Files and Databases.
119
Approaches to Development-Systems Development Life Cycle

12+4 Hours
Unit IV
System Engineering and Quality Assurance
Designing reliable and maintainable system-Program Structure charts-Software Modules-Coupling-Cohesion.

Software Design and documentation Tools: Structured flowchart-HIPO-Wamier/Orr diagrams. Managingquality
Assurance-Assessing system Reliability-Testing Strategies-Documentation. Managing System Implementation:
Training Conversion Methods-Data and File Preparation-post implementation review. Managing Information system
Development: Estimation and management of development Time-Personnel and Development Management-
structured walkthroughs. Selection of Hardware and Software: Hardware Selection-Determining size and capacity
requirements. Computer Evaluation-plugcompatible equipment-financial Factors-Maintenance and Support-
Software Selection.
Modular Programming and the Top-Down Approach-Auditing

13+3 Hours
Total: 45+15 Hours
Textbook(s)
A. James & Senn, Analysis and Design of Information Systems, 2 nd Edition MCGRAW-Hill Edu, 2008
1.
2.
Arthur M. Langer ,Analysis and Design of Information Systems 3rd Edition , Springer Springer Science &
Business Media, 2007
Reference(s)
1. Preeti Gupta, System Analysis and Design 2nd Edition, Firewall Media, 2008
SAMPLE QUESTION (S)

Remember 35 20 20
Understand 30 30 40
Apply 25 30 30
Analyze 10 20 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. What are the components of Information systems?
2. List out various layers that consists information system architecture.
3. What is top-down programming structure?
4. Define software metrics.
Understand
1. Represent the block diagram of system development life cycle.
2. Draw the salient features of accounting information system.
3. Indicate how to apply competitive strategy concepts to the strategic role of information systems.
4. Contrast Physical system design activity in detail
8
120
Apply
1. Write statements that perform the following one-dimensional-array operations
2. Find traditional system life cycle approach for building information systems.
3. Show how IT enables systems are useful for solving real world business problems
4. Demonstrate the Physical components required for organizational information system
Analyze
1. Justify how to apply competitive strategy concepts to the strategic role of information systems.
2. Identify 4 fact finding techniques, giving one different advantage and one different disadvantage of each.
3. Compare the concept of Data Flow Diagram (DFD) from that of Decision Table.
4. Differentiate the terms Physical Model and Logical Model as used in System design process
121
16CS001 Computer Graphics & Multimedia

3103
Course Outcomes
1. Understand the basic methodologies and hardware functionalities of computer graphics

2. Explain the algorithms for rasterization and clipping of 2D graphic primitives
3. Understand the basics of 2D and 3D Transformations
4. Illustrate various curves and surface generation methods
5. Summarize projections types and algorithms for visible surface detection methods
6. Identify new tools for developing animations
COs–POs Mapping
COs PO1 PO2 PO3 PO4
1 3 2 1 1
2 2 3 2 2
3 3 2 2 2
4 3 3 2 2
5 3 2 2 2
6 2 3 3 3
Syllabus
Unit I
Introduction & Output primitives
Application of Computer Graphics- overview of graphics systems-raster scan systems-random scan systems-raster
scan display processors
Output primitives : Points and lines-line drawing algorithms (Bresenham’s and DDA Line derivations and
algorithms)-mid-point circle and ellipse algorithms. Filled area primitives: Inside and outside tests-Scan line
polygon fill algorithm-boundary-fill and flood-fill algorithms.
Graphics monitors-work stations and input devices

11+4 Hours
Unit II
2-D Geometrical transforms & 2D-Viewing
Translation-scaling-rotation-reflection and shear transformations-matrix representations and homogeneous

coordinates-composite transforms-transformations between coordinate systems.
2-D viewing: The viewing pipeline-viewing coordinate reference frame-window to view-port coordinate
transformation-viewing functions-Cohen-Sutherland and Cyrus beck line clipping algorithms-
Sutherland –Hodgeman polygon clipping algorithm.
Transformation Functions and raster methods for transformations

11+4 Hours
Unit III
3-D object representation-Transformations & Visible Surface Detection Methods
Polygon surfaces-quadric surfaces- spline representation -Hermite curve-Bezier curve and B-Spline curves-Bezier
and B-Spline surfaces.
122
3-D Geometric transformations: Translation-rotation-scaling-reflection and shear transformations-composite

transformations. 3D Viewing pipeline-clipping-projections ( Parallel and Perspective).
Visible surface detection methods: Classification-back-face detection-depth-buffer-scan-line-depth sorting –
BSP tree methods-area sub-division and octree methods.
Basic illumination models-polygon rendering methods

11+4 Hours
Unit IV
Computer Animation & Fundamentals of Multimedia
Design of animation sequence-general computer animation functions-raster animation-computer animation

languages-key frame systems-motion specifications.
Fundamental concepts in Text and Image: Multimedia and hypermedia-world wide web-overview of multimedia
software tools. Graphics and image data representation graphics/image data types-file formats.
Multimedia data compression: Lossless compression algorithm: Run-Length Coding-Variable Length Coding-
Dictionary Based Coding-Arithmetic Coding-Lossless Image Compression -Lossy compression algorithm.
Digital voice and video-Image video and animation
12+3 Hours
Total: 45+15 Hours
Textbook (s)
1. D. Hearn & M.P. Baker, Computer Graphics, 2/e, Pearson Education, New Delhi, 2005
2. Ze-Nian Li and Mark S. Drew, Fundamentals of Multimedia, PHI/PearsonEducation, 2004
Reference (s)
1. Newman W.M. and Sproull R.F., Principles of Interactive Computer Graphics, 2 ndEdition, Tata McGraw
Hill Publishing Company Limited, New Delhi, 1997
2. S. Harrington, Computer Graphics, A Programming Approach, MGH Publication, New Delhi, 1994
3. J.D. Foley et. Al, A Fundamental of Computer Graphics, Addition Wesley, London, 1993
SAMPLE QUESTION (S)

Remember 20 35 20
Understand 35 35 30
Apply 35 20 20
Analyze 10 10 10
Evaluate -- -- 10
Create -- -- 10
Total (%) 100 100 100
Remember
1. List 6 applications of computer graphics
2. Write 2D transformation matrix for translation, rotation and scaling
3. Define parallel projection
4. List the steps to design computer animation
9
123
Understand
1. Explain Bresenham’s Line drawing algorithm
2. Explain Sutherland-Hodgeman polygon clipping algorithm
3. Write about Depth sorting visible surface detection method
4. Explain about Lossless Image Compression
Apply
1. Draw a circle with center (5,8) and radius 7 units using Midpoint circle generation algorithm
2. Obtain the reflection of a point A(10, 10) with respect to the line y=x+2
3. Use Cohen Sutherland clipping algorithm to clip two lines p1p2 and p3p4 with p1(40,15) p2(75,45)
p3(70,20) p4(100,10) against window a(50,10) b(80,10) c(80,40) d(50,40)
4. Clip the polygon v1-v6 against the window ABCD. Assume any convenient numerical values for the
vertices preserving the information containing the figure. Employ Sutherland-Hodgeman algorithm
Analyze
1. Compare raster scan and random scan systems
2. Write the functionalities of B-spline curves
3. Test the Bresenham’s line drawing algorithm to draw a line between the points (20,10) and (30,18)
4. Compare and contrast parallel and perspective projections
124
16CS002 Software Design Patterns

3103
Course Outcomes
1. Understand different phases in objective oriented paradigm
2. Illustrate software design and management for various life cycle models
3. Use object oriented design tools to design a projects based on object oriented software engineering
4. Represent software specification document to learn the importance of software modeling concepts
5. Use formal techniques to design a suitable usecase modeling system
6. Use software testing tools to develop an effective software engineering project
COs–POs Mapping
COs PO2 PO3 PO5
1 3 3 1
2 2 2 1
3 3 3 2
4 2 2 1
5 3 2 2
6 3 3 2
Unit I
Introduction to Classical software Engineering - Historical, Economic and Maintenance aspects,
Introduction to Object Oriented Paradigm. Different phases in structured paradigm and Objective Oriented
Paradigm. Software Process and different life cycle models and corresponding strengths and weaknesses.
Planning and Estimation -Estimation of Duration and Cost, COCOMO components of software. Project
Management plan.
COCOMOII, IFPUG, Process assessment 11+4 Hours
Unit II
Tools for step wise refinement - Cost - Benefit analysis, Introduction to software metrics and CASE tools.
Taxonomy and scope of CASE tools .Introduction to testing, with focus on Utility, Reliability, Robustness,
Performance, Correctness.
Modules to objects-Cohesion and Coupling, Data Encapsulation and Information hiding aspects of objects.
Inheritance, polymorphism and Dynamic Binding aspects .Cohesion and coupling of objects. Reusability, Portability
and Interoperability aspects.
Software measurements, Software maturity index 11+4 Hours
Unit III
Requirement phase - Rapid Prototyping method, Specification phase, Specification Document, Formal methods
of developing specification document, Petri nets.
Analysis phase - Use case Modeling, Class Modeling, Dynamic Modeling
UML diagrams and requirement collection, MSG foundation case study
11+4 Hours
Unit IV
Design phase -Formal techniques for detailed design.
IIM Phases - Implementation, Integration and maintenance phases.
Software Testing Tools: selenium, QTP, Win runner, Silk test, Load Runner
Testing vsMaintance, Implementation standards.other testing aspects 11+4 Hours
125
Textbook (s)
1. Stephen R. Schach, Object oriented and Classical Software Engineering,7th Edition,TMH,2007.

2. Timothy Lethbridge, Robert Laganiere, Object oriented and Classical Software Engineering,2nd
Edition,Mc-Graw-Hill,2005.
Reference (s)
1. Ivica Crnkovic, Component-based software engineering, 7thinternational symposium, CBSE 2004,
Springer
2. Dr KVKK Prasad, Software Testing Tools,1st Edition, Dreamtech press,2008.
SAMPLE QUESTION (S)

Cognitive Int. Test 1 Int. Test 2
Assignment Test10 (%)
Level (%) (%)
Remember 25 15 --
Understand 35 10 10
Apply 20 30 40
Analyze 20 20 40
Evaluate -- 25 10
Create -- -- --
Total (%) 100 100 100
Remember
1. Name any three fundamental metrics
2. What is Polymorphism? Explain with an example
3. Define CASE? Give the different CASE tools used in different workflows.
4. Define the size (S), and cost (C) are given by FFP Metric
Understand
1. Explain any two formal methods of developing the specification document
2. Explain how data encapsulation is achieved with suitable example
3. Explain the different types of cohesion with examples
4. Explain how data encapsulation is achieved with suitable example.
5. Illustrate Load Runner testing tool with its Architecture
Apply
1. Demonstrate object oriented Paradigm
2. Build use case modeling
3. Construct the class modeling for elevator
4.Show Rapid proto typing with one example project
Analyze
1. Categorize software process models
2. Classify cohesion and coupling types.
3. Distinguish classical and object oriented paradigm.
4 .Contrast Cohesion and coupling
Evaluate
1. Choose testing tool for elevator problem
2. Justify how class modeling is used for project development
10
126
3. Evaluate Load Runner testing tool with its Architecture

4. Determine the petri nets
127
Elective II
16CS003 Qualitative Data Analysis
3103
Course Outcomes
1. Describe various styles of interpretation of qualitative data
2. Explain the relative appropriateness of different analysis approaches for a particular qualitative study
3. Apply one or more analytic approaches to data they have collected and write an analysis paper
4. Describe special issues in ethics for qualitative research
5. Develop qualitative data files effectively to ensure ease of use and participant confidentiality
6. Illustrate the basic and intermediate functions of software program for coding of textual data
COs–POs Mapping
COs PO3 PO5
1 3 2
2 3 2
3 3 2
4 1 3
5 2 3
6 2 3
Unit I
Concepts-Contexts-Basics
Qualitative Data Analysis - Ethnographic Fieldwork - Sampling Strategies - Transcription of Data Analysis -
Collaborative Analysis of Qualitative Data - Qualitative Comparative Practices: Dimensions - Cases and Strategies.
Sampling-types of sampling for data (using simple tools)
11+3 Hours
Unit II
Reflexivity and the Practice of Qualitative Research & Analytic Strategies
Induction - Deduction & Abduction - Interpretation and Analysis - Grounded Theory and Theoretical Coding -
Qualitative Content Analysis - Phenomenology - Narrative Analysis - Documentary Method - Hermeneutics and
Objective Hermeneutics - Cultural Studies - Net no graphic Analysis - Using Software in Qualitative Analysis.
Study of different Software Tools for Qualitative Analysis
11+3 Hours
Unit III
Types of Data and their Analysis
Analyzing -Interviews - Focus Groups - Observations - Documents - News Media - Films - Images - Sounds -
Virtual Data - Video Analysis and Videography - Conversations and Conversation Analysis - Discourses and
Discourse Analysis
Data Management Techniques
12+4 Hours
Unit IV
Using and Assessing Qualitative Data Analysis
Re-analysis of Qualitative Data - Qualitative Meta-analysis - Quality of Data Analysis - Ethical Use of Qualitative
Data and Findings - Generalization in and from Qualitative Analysis - Theorization from Data - Writing and/as
Analysis - Implementation.
Report writing for a sample data from the field work
12+5 Hours
Total: 45+15
Textbook (s)
128
1. Editor: Uwe Flick, The SAGE Handbook of Qualitative Data Analysis, 3rd Edition, SAGE Publications India
Pvt. Ltd., New Delhi, 2013.
2. Robert K. Yin, Qualitative Research from Start to Finish, 2nd Edition, The Guilford Press, London, 2010.
Reference (s)
1. Louise B. Silverstein, Carl F. Auerbach, Qualitative Data: An Introduction to Coding and Analysis, New
York University Press, New York, 2003.
2. Bernard, H.R.& Ryan, G. W. Thousand Oaks, CA: Analyzing Qualitative Data: Systematic Approaches, 2nd
Edition, SAGE Publications, 2017.
SAMPLE QUESTION (S)

Remember 35 15 20
Understand 30 25 30
Apply 20 30 20
Analyze 15 20 20
Evaluate -- 10 10
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Qualitative data
2. Define Collaborative Analysis
3. List any four types of data for analysis
4. Define virtual data
Understand
1. Explain the various Sampling Techniques
2. Explain the Cases and Strategies for Qualitative Data Dimensions
3. Interpret Qualitative Content Analysis
Apply
1. Plan an interview process to collect data
2. Identify the Ethical use of Qualitative Data
3. Select the proper Observation method of Qualitative research
Analyze
1. Differentiate Deduction & Abduction
2. Differentiate Interpretation and Analysis
3. Criticize over the data quality is so important in software development environment
4. Comment on the Ethical Use of Qualitative Data
Evaluate
1. Judge the need of Cultural Studies in Qualitative data analysis
2. Select the factors to be considered for Re-analysis of Qualitative Data
3. Evaluate a suitable technique of grounded theory
11
129
16CS004 Real Time Operating Systems

3103
Course Outcomes
1. Understand various real time application systems to learn the important aspects of safety and reliability
2. Explain the scheduling processes of real-time systems to learn resource handling, sharing and
dependencies among real-time tasks
3. Use periodic scheduling to adopt the design objectives of real time platform
4. Analyze real-time tasks scheduling in multiprocessor and distributed systems
5. Explain features of real time operating system to study the importance of multitasking techniques
6. Use real time database and communication to review the basic concepts of real-time database
COs–POs Mapping
COs PO2 PO3 PO5 PSO1
1 2 2 2 2
2 3 2 1 1
3 2 3 2 2
4 3 2 2 2
5 3 2 2 1
6 2 1 1 2
Unit I
Real-Time Systems
Introduction: Real time definition - Applications of Real-Time systems - A basic model of Real-time system -
Characteristics of Real-time system - Safety and Reliability - Types of Real-time tasks - timing constraints -
Modeling timing constraints Some important concepts - Types of Real-time tasks and their characteristics - Task
scheduling - Clock-Driven scheduling - Hybrid schedulers - Event-Driven scheduling - Earliest Deadline First
(EDF) scheduling.
Identify some RTOS for review - Embedded Programming in C
11 + 4 Hours
Unit II
Scheduling Periodic Tasks
Rate monotonic algorithm (RMA). Some issues associated with RMA. Issues in using RMA practical situations.
Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing among real-time tasks.
Priority inversion. Priority Inheritance Protocol (PIP) - Highest Locker Protocol (HLP) - Priority Ceiling Protocol
(PCP).Different types of priority inversions under PCP. Important features of PCP - Some issues in using a resource
sharing protocol. Handling task dependencies
Memory Management - and Porting μCos
11 + 4 Hours
Unit III
Scheduling Real-Time Tasks in Multiprocessor and Distributed Systems
Multiprocessor task allocation - Dynamic allocation of tasks - Fault tolerant scheduling of tasks - Clock in
distributed Real-time systems - Centralized clock synchronization Commercial Real-time operating systems: Time
130
services - Features of a Real-time operating system - Unix as a Real-time operating system - Unix-based Real-time
operating systems - Windows as a Real-time operating system - POSIX-RT - A survey of contemporary Real-time
operating systems. Benchmarking real-time systems
RTOS for fault Tolerant Applications
11 + 4 Hours
Unit IV
Real Time Databases and Communication
Real-time Databases: Example applications of Real-time databases. Review of basic database concepts - Real-time
databases - Characteristics of temporal data.
Concurrency control in real-time databases - Commercial real-time databases - Real-time Communication: Basic
concepts - Examples of applications - Real-time communication in a LAN and Real-time communication over
packet switched networks.
Comparison and study of various RTOS like QNX - VX Works
12 + 3 Hours
Total: 45+15 Hours
Textbook (s)
1. Rajib Mall, Real-time Systems Theory and Practice, 1st edition, Pearson Publication, 2008.
Reference (s)
1. Jane W. S. Liu, Real-Time Systems, Pearson Education, 2000.
2. C.M. Krishna and K.G. Shin, Real-Time Systems, TMH, 2009
SAMPLE QUESTION (S)
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test# (%)
Remember 25 15 10
Understand 35 25 20
Apply 20 35 30
Analyze 20 25 20
Evaluate -- -- 10
Create -- -- 10
Total (%) 100 100 100
Remember
1. Define real-time system.

2. List few applications of real-time systems.
3. What is meant by fail safe state?
4. Name any two important sensor devices and two actuators used in real time systems.
Understand
1. Explain the basic model of real-time system.

2. Explain characteristics of real-time systems.
3. Explain the key differences between the characteristics of a soft-real time task such as web browsing and a
non-real time task such as e-mail delivery.
# Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
131
Apply
1. In a real time system what is the difference between a performance constraint and a behavioral constraint?
Give practical examples of each type of constraint.
2. Draw a schematic model showing the important components of a typical hard real system. Explain the
working of output interface using a suitable schematic diagram. Explain using a suitable circuit diagram
how analog to digital conversion is achieved in an output interface.
3. Draw a schematic model showing the important components of a typical hard real system. Explain the
working of input interface using a suitable schematic diagram. Explain using a suitable circuit diagram how
digital to analog conversion is achieved in an input interface.
Analyze
1. Is it possible to have an extremely safe but unreliable system? If your answer is affirmative, then give
example of such a system. If your answer is no, then explain why such a system is not possible to exist.
2. Identify the constraints that a set of periodic real-time tasks need to satisfy for RMA to be optimal
scheduler for the set of tasks?
3. Compare the performance of IEEE 802.4 protocol with IEEE 802.5 protocol for real-time applications at
high, medium and low bandwidths.
132
16CS005 Service Oriented Architecture

3103
Course Outcomes
1. Explain the fundamental process of service oriented architecture to analyze the importance of distributed
internet architecture.
2. Analyze various web services to study the importance of business derivatives
3. Use service oriented design to develop an application specific system
4. Summarize SOA platform basics and SOA support
5. Apply various application packages to develop a better interoperable web platform
6. Understand web service enhancement to review the basic concepts of web security and policy
COs–POs Mapping
COs PO3 PO5 PO8
1 2 2 2
2 2 2 1
3 3 2 2
4 1 3 1
5 2 3 1
6 2 2 3
Unit I
Roots of SOA
Characteristics of SOA - Comparing SOA to client-server and distributed internet architectures-Anatomy of SOA-
How components in an SOA interrelate - Principles of service orientation
Characteristics and Anatomy of SOA - Comparing SOA to client using JAVA Language
9+3 Hours
Unit II
Web services
Service descriptions-Messaging with SOAP –Message exchange Patterns-Coordination –Atomic Transactions-
Business activities-Orchestration-Choreography - Service layer abstraction-Application Service Layer-Business
Service Layer-Orchestration Service Layer- Service oriented analysis-Business-centric SOA-Deriving business
services- service modeling- Service Oriented Design-WSDL basics-SOAP basics-SOA composition guidelines
Business centric SOA - Deriving business services - service modeling applications

12+5 Hours
Unit III
Service Designs
Entity-centric business service design-Application service design-Task centric business service design- SOA.
Platform basics-SOA support in J2EE-Java API for XML-based web services (JAX-WS) - Java architecture for
XML binding (JAXB)-Java API for XML Registries (JAXR)- SOA platform basics-SOA support in J2EE- Java API
for XML-based web services (JAX-WS) - Java architecture for XML binding (JAXB).
Application service design - Task centric business service design

12+4 Hours
Unit IV
Java API for XML Registries
Java API for XML based RPC (JAX-RPC)- Web Services Interoperability Technologies (WSIT) - SOA support in
.NET-Common Language Runtime - ASP.NET web forms-ASP.NET web services-Web Services Enhancements
(WSE)- WS-BPEL basics-WS-Coordination overview - WS-Choreography - WS-Policy – WS Security.
Reliable messaging - Metadata exchange - Security - Notification and eventing
133
12+3 Hours
Total: 45+15 Hours
Textbook (s)
1. Thomas Erl, Service-Oriented Architecture: Concepts, Technology and Design, Pearson Education, 2005.
Reference (s)
1. Thomas Erl, SOA Principles of Service Design,The Prentice Hall Service-Oriented Computing Series from
Thomas Erl, 2005.
2. Newcomer, Lomow, Understanding SOA with Web Services, Pearson Education, 2005.
3. Sandeep Chatterjee, James Webber, Developing Enterprise Web Services, An Architect’s Guide, Pearson
Education, 2005
4. Dan Woods and Thomas Mattern, Enterprise SOA Designing IT for Business Innovation, O’REILLY, First
Edition, 2006
SAMPLE QUESTION (S)

Remember 25 15 --
Understand 35 15 20
Apply 20 25 30
Analyze 20 25 30
Evaluate -- 10 20
Create -- 10 --
Total (%) 100 100 100
Remember
1. Define SOA
2. Define Service orientation
3. List the characteristics of SOA
4. Define UDDI
5. List the logical components of automation logic
Understand
1. Explain Anatomy of SOA
2. Explain Service layer abstraction
3. Interpret the application of service design
4. Illustrate the principles of service orientation
Apply
1. Show the steps for the implementation of web services
2. Assess the relationship between choreography types
3. Implement the SOAP Message Format
4. Demonstrate the salient features of WS-Transaction with an example
Analyze
1. Differentiate between SOA and distributed Computing
2. Compare the SOA to client-server and distributed internet architectures.
3. Discuss about different service layer in detail.
12
134
4. Identify the attributes for Web Services Enhancements
135
16CS006 Computational Intelligence (Open Elective)
3103
Course Outcomes
1. Identify an appropriate soft computing technique to build an Intelligent Machine

2. Understand supervised learning methods for neural network models for pattern classification and regression
problems
3. Demonstrate the use of back propagation algorithm to develop multi layer feed forward neural networks
4. Understand unsupervised learning methods for neural network models for storing and pattern classification
5. Determine the solutions of modeled networks using soft computing approaches for a given problem
6. Explain fuzzy logic to handle uncertainty
COs – POs Mapping
Cos PO1 PO2 PO 3 PO 4 PO 9

1 3 3 2 2 2
2 2 3 2 2 2
3 2 2 3 3 3
4 3 3 2 2 3
5 3 3 2 2 2
6 3 2 3 3 3
Unit I
Basic Elements of Soft Computing
Basic elements of Soft Computing: Difference between Hard Computing & Soft Computing - Introduction to
Neural Networks - Fuzzy Logic - Genetic Algorithms - Hybrid Systems.
Artificial Neural Networks: Introduction to Artificial Neural Networks - Evolution of Neural Networks - Basic
Models of Neural Networks - McCulloch-Pitts Neuron - Hebb Network.
Basics of Artificial Intelligence and Computational Intelligence.

11+4 Hours
Unit II
Supervised Learning Network
Supervised Learning Network: Artificial Neural Networks: Introduction - Perceptron Networks - Back
Propagation Network. Radial Basis Function Network.
Associative Memory Networks: Auto-associative Memory Network - Hetero auto-associative Memory
Network - Bidirectional Associative Memory (BAM) - Hopfield Networks.
Functional Link Neural Network.
11+4 Hours
Unit III
Unsupervised Learning Network
Introduction - Fixed Weight Competitive Nets -Kohonen Self-Organizing Feature Maps - Learning Vector
Quantization - Counter Propagation Networks - Adaptive Resonance Theory Networks (ART-1 & ART-2).
Support Vector Machines and their applications for Classification.
11+4 Hours
Unit IV
Fuzzy logic and Genetic Algorithm
Introduction to Fuzzy Sets: Difference between Classical Sets & Fuzzy Sets – Properties.
136
Classical Relations and Fuzzy Relations: Cartesian product of Relations - Classical Relations - Fuzzy Relations
Membership Functions: Features of Membership Functions -Fuzzification - and Defuzzification
Genetic Algorithm: Basic Concepts – Operators.
Concepts on Fuzzy Controller and its applications -a Simple Application of Genetic Algorithm for function
Optimization.
11+4 Hours
Total: 44+16 Hours
Textbook (s)
1. S. N. Sivanandam, S N Deepa, Principles of Soft Computing, 2ndEditionWiley India, 2007

2. V. Kecman, Learning and soft computing, Pearson Education, India, 2006
3. Russell Eberhart and Yuhui Shi - Computational Intelligence: Concepts to Implementations (2007)
Reference(s)
1. G. J. Klir and Bo Yuan, Fuzzy sets and Fuzzy Logic, Prentice Hall, USA, 1995
2. N. J. Nelsson, Artificial Intelligence, A New Synthesis, Harcourt Asia Ltd., 1998
3. D. E. Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley, N.Y –
1989
4. S. Haykins, Neural networks: a comprehensive foundation Pearson Education, India, 2002
5. A. P. Engelbrecht, Computational Intelligence: An Introduction, John Wiley & Sons, 2007.
6. X. Yu and M. Gen, Introduction to Evolutionary Algorithms, Springer Verlag, 2010.
7. Fakhreddine Karray and Clarence de Silva - Soft Computing and Intelligent Systems Design, 2004.
8. Andries Engelbrecht - Computational Intelligence: an Introduction, 2007.
9. Amit Konar - Computational Intelligence: Principles, Techniques, and Applications, 2005.
10. Vojislav Kecman - Learning and Soft Computing: Support Vector Machines, Neural Networks, and Fuzzy
Logic Models, 2001.
SAMPLE QUESTION (S)

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test # (%)
Remember 25 15 --
Understand 35 15 --
Apply 20 20 40
Analyze 20 30 40
Evaluate -- 20 20
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Chromosome
2. List two methods in which the information flows in a nervous system
3. List five unsupervised learning algorithms
4. List the difference between classical logic and fuzzy logic
5. List the computational units of ART
Understand
1. Explain the components of Soft Computing
2. Explain the role of activation function in exhibiting the output from a neuron
3. Construct the 5 node pattern {0,1,1,0,1} by Hopfield network and explain the procedure for recalling and
storing
4. Explain Adaptive Resonance Theory and its type
5. Explain CPN and illustrate the steps involved in training algorithm of full CPN
# Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
137
Apply
1. Construct a ANN circuit which makes the flow of data using multilayered and multilevel networks
2. Apply clusters of various datasets maintained by learning approach considering live example
3. Draw the neat architecture of hamming network and trace the inhibitatory and excitatory neurons by
considering an inconsistent vector
4. Find the Max-min and Max Product composition of the fuzzy relation matrices R={0.6,0.3,0.2,0.9}(2x2)
S={1,0.5,0.3,0.8,0.4,0.7}(2x3)
5. Find the cardinality for the matrices R={1,4,6,7}(2x2) S={5,2,3,7}(2x2)
Analyze
1. Differentiate between learning and training algorithms considering multilayer perceptron network and trace
the different types of networks obtained.
2. Differentiate between Counter Propagation Network and Adaptive Resonance Theory
Evaluate
1. Evaluate using Back Propagation algorithm for the below map considering weights , inputs and outputs
2. Evaluate the instance , that the 2 dimensional input vector X is presented to the three-neuron Kohonen
network, x=[ 0.52 0.12]. The initial weight vectors, Wj are given by
W1=[0.27 , 0.81]
W2=[0.42 , 0.70]
W3=[0.43 , 0.21]
in a form of 2 X 1 matrix. Find the winning neuron using the Euclidean distance and apply kernel self-
organization map. State the differences between register machines and stack machine?
138
16CS007 IoT for Engineering Applications

(Common to CH, CE, EE, EC, ME & PE)
3103
Course Outcomes
1. Understand the basic concepts of IoT
2. Summarize the structural knowledge of IoT
3. Explain M2M in the context of Internet of Things.
4. Describe the IoT Reference Architecture
5. Design the Internet of things systems for the given problem
6. Apply IoT for various engineering applications
COs–POs Mapping
COs PO1 PO5
1 3 3
2 3 3
3 3 3
4 3 3
5 3 3
6 3 3
UNIT–I
Introduction and Fundamental IoT Mechanisms
What is the Internet of Things? : History of IoT, About IoT, Overview and Motivations, Examples of Applications,
Internet of Things Definitions and Frameworks : IoT Definitions, IoT Architecture, Identification of IoT Objects and
Services, Structural Aspects of the IoT, Environment Characteristics, Traffic Characteristics, Scalability,
Interoperability, Security and Privacy.
IOT paradigm-smart objects-Bits an atoms-goal orientation-RTLS+ GPS-agents+ Multi agent system 12+3 Hours
UNIT–II
M2M to IoT
A Market Perspective– Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An emerging
industrial structure for IoT, The international driven global value chain and global information monopolies. M2M to
IoT-An Architectural Overview– Building an architecture, Main design principles and needed capabilities, An IoT
architecture outline, standards considerations.
Introduction to Atmega 8 /16 microcontroller- Architecture of the AVR Microcontroller-Pin description of the
microcontroller-I/O of the microcontroller-IR Sensors 11+4 Hours
Unit–III
IoT Reference Architecture
Introduction, Functional View, Information View, Deployment and Operational View, Other Relevant architectural
views. Real-World Design Constraints- Introduction, Technical Design constraints-hardware is popular again,
Interaction and remote control. Industrial realizing the enterprise integrated Web of Things, IMC-AESOP: from the
Web of Things to the Cloud of Things, Commercial Building Automation- Introduction, Case study: phase one-
commercial building automation today, Case study.
139
Specification-Domain Model Specification-Information Model Specification-Service Specifications-IoT Level

Specification-Functional View 11+4 Hours
UNIT–VI
IoT for Business Applications
Internet of Things Application : IoT for Smart Grid ,City Automation, Automotive Applications, Home Automation,
Smart Cards , Process Monitoring / Automation, Sensor Technology, Raspberry- pi Interface, Smart Healthcare,
Smart Transportation, M2M Communication, Smart Metering, Systems and Services Integration, Hands-on
training, Smart Waste Management System.
Sharing Sensor Data on Social Networks-Twitter-Facebook Connection App-Updation of Sensor Data on Website /
Blog 11+4 Hours
Textbook (s)
1. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos, David
Boyle, From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence, 1st Edition, Academic Press, 2014.
2. Daniel Minoli, Building the Internet of Things with IPv6 and MIPv6: The Evolving World of M2M
Communications, ISBN: 978-1-118-47347-4, Willy Publications, 2014
3. Bernd Scholz-Reiter, Florian Michahelles, Architecting the Internet of Things, ISBN 978-3- 642-19156-5
e-ISBN 978-3-642-19157-2, Springer, 2016
Reference Book (s)
1. Parikshit N. Mahalle & Poonam N. Railkar, Identity Management for Internet of Things, River Publishers,
ISBN: 978-87-93102-90-3 (Hard Copy), 978-87-93102-91-0 (ebook), 2015
SAMPLE QUESTION (S)

INTERNAL ASSESSMENT PATTERN
Remember 40 40 --
Understand 50 40 20
Apply 10 10 40
Analyze -- 10 30
Evaluate -- -- 10
Create -- -- --
Total (%) 100 100 100
Remember
1. Write the major significance of Internet of Things.
2. State the crucial requirement f IoT in terms of application and its supporting natures.
3. List the dominant technologies behind IoT development.
4. Identify two major differences between Internet of Everything and Industrial IoT.
5. Write about the data-center based cloud tools that use to run the machine learning algorithm internally.
13
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
140
6. Recognizes an alternative approach that results in better adaptivity in case of network fluctuations and
increased latency.
7. Identify the on-demand processing and storage capabilities that is used to analyze the data generated by
IoT objects in batch or stream format.
Understand
1. Identify the evolutionary terms of Internet of Things (IoT) that use to interact and live with the physical
objects.
2. Illustrate the reference architecture of IoT that unifies the smart objects and human beings to provide the
ubiquitous communication
3. Illustrate the service-oriented architecture of IoT that ensures the interoperability among the heterogeneous
devices
4. Illustrate the API-Oriented Architecture of IoT that use SOAP and Remote Method Invocation (RMI) as a
means for describing, discovering, and calling services
5. Discuss the resource capacity, selecting and provisioning the resources that greatly impact Quality of
Service (QoS) of the IoT applications
6. Classify the taxonomy of resource management activities of IoT.
7. Report the standard requirement of real time analytics to fulfill the demand of real-time stream processing
engine.
Apply
1. Interpret a study analysis on open-source prototyping platform for the industrial IoT.
2. Implement a suitable OPENIoT Architecture for IoT/Cloud Convergence that provides an abstract
presentation of the functional elements of architecture.
3. Sketch W3C SSN-XG ontology and how to semantically enable real time sensor feeds
4. Execute the two-tier data dissemination model for large-scale wireless sensor network
5. Demonstrate SPARQL query caching in order to improve the performance of semantic web applications
6. Illustrations a technique to cluster semantically similar QA pairs for retrieving an answer for a newly given
query without asking the QA engine on the cloud side
Analyze
1. Comparative analysis on real-time analytics in Cloud-IoT and fog computing.
2. Compare the communication efficiencies for the following protocols such as AMPQ, CoAP, DDS, MQTT,
UPnP and XMPP in terms of Transport Layer Protocols.
3. Differentiate the major significances of nesC, keil C and Dynamic C.
4. Relate a set of minimal features to be fulfilled by the programming frameworks for IoT.
5. Comparative analysis on IoT programming approaches
Evaluate
1. Select an example that utilizes the device-collaboration framework for the proactive suggestion application
2. Appraise a semantic QA cache that implement the device/cloud collaboration framework to compute the
probability of the on-device semantic QA cache to answer a given query correctly.
3. Select a suitable example that use automatically tagging recognized images to display the additional
information such as social sentiment in order to achieve similar performance improvement for speech-
recognition application with DL through device/cloud collaboration framework
4. Critique on fog-computing assisted distributed analytics system that uses a set of fall-detection algorithms,
including algorithms based on acceleration measurements and time-series analysis methods, as well as
filtering techniques to facilitate the fall-detection process.
141
16IT701 Big Data Analytics

3103
Course Outcomes:
1. Understand the limitations in SQL
2. Identify the concepts and advantages of DDBMS
3. Identify challenges of Big data and its existing technologies
4. Use UNIX and HDFS commands
5. Analyze data using Map-Reduce framework
6. Exemplify concepts of R Programming
COs–POs Mapping
Cos PO2 PO5 PO6
1 3 1 1
2 2 1 2
3 2 1 2
4 1 1 1
5 3 1 2
6 3 1 2
Unit I
Concepts of DDBMS 13+4 Hours
Data Fragmentation; Replication; and allocation techniques for DDBMS; Methods for designing and implementing
DDBMS, designing a distributed relational database; Architectures for DDBMS: cluster federated, parallel databases
and client server architecture.
Introduction to Big Data
Introduction - Challenges of Conventional Systems, What is Business Analytics, Business Analytics lifecycle, Why
Big Data Analytics, Defining Big data, Characteristics of Big Data(V’s), Business Analytics phases: Data
Acquisition- Data Cleaning - Data Manipulation - Data Analysis (Statistical and Analytical methods) to make sense
of data - Data Visualization
Query processing problem; Objectives of Query Processing
Unit II
Introduction to NoSQL 12+4 Hours
Overview, and History of NoSQL Databases Definition of the Four Types of NoSQL Database, The Value of
Relational Databases, Getting at Persistent Data, Concurrency, Integration, Impedance Mismatch, Application and
Integration Databases, Attack of the Clusters, The Emergence of NoSQL, Key Points,Comparison of relational
databases to new NoSQL stores, MongoDB, Cassandra, HBASE, Neo4j use and deployment, Challenges NoSQL
approach, Key-Value and Document Data Models, Column-Family Stores, Aggregate-Oriented Databases
Replication and sharding, MapReduce on databases
142
Unit III
Introduction to HADOOP 10+4 Hours
Introduction to HADOOP - Hadoop ecosystem components and uses, Hadoop Storage: HDFS, Concept of Hadoop
Distributed file system, Design of HDFS, Configuration of HDFS.
HADOOP MapReduce
Hadoop Data Types, Functional-Concept of Mappers, Functional-Concept of Reducers, MapReduce Execution
Framework, Partitioners and Combiners, Hadoop Clusters component : NameNode, Secondary NameNode, and
DataNode, Data flow (Anatomy of File Write and Read);
Challenges for processing big data, RDBMS vs HADOOP, Accessing HDFS - CLI (Command Line Interface)
Unit IV
Statistics with R Programming 10+3 Hours
Introduction, How to run R, R Sessions and Functions, Basic Math, Variables, Data Types, Vectors, Conclusion,
Advanced Data Structures, Data Frames, Lists, Matrices, Arrays, Classes. R Programming Structures, Control
Statements, Loops, - Looping Over Nonvector Sets,- If-Else, Arithmetic and Boolean Operators and values, Default
Values for Argument, Return Values, Deciding Whether to explicitly call return- Returning Complex Objects,
Functions are Objective, No Pointers in R, Recursion, A Quicksort Implementation-Extended Extended Example: A
Binary Search Tree.
Math sums, cumulative sums and products
Total: 45+15 Hours

Textbook (s)
1. Distributed Databases: Principles and Systems Paperback – 1 Jul 2017 by Stefano Ceri , Giuseppe
Pelagatti , McGraw Hill Education, ISBN-10: 0070265119, ISBN-13: 978-0070265110, 2017.
2. Tom White “ Hadoop: The Definitive Guide” Fourth Edition, O‟reilly Media, 2015
3. Prajapati, V. Big data analytics with R and Hadoop. Packt Publishing Ltd, 2013
Reference (s)
1. M. Tamer Ozsu and Patrick Valduriez, “Principles of Distributed Database Systems”, Springer Science +
Business Media , Third Edition, 2011.
2. Zikopoulos, P., Parasuraman, K., Deutsch, T., Giles, J., & Corrigan, D.v Harness the Powerof Big Data The
IBM Big Data Platform. McGraw Hill Professional, 2012
3. The Art of R Programming, Norman Matloff, Cengage Learning, 1st Edition, 2011
SAMPLE QUESTION (S)

Remember 60 10 --
Understand 40 50 --
Apply -- 40 70
Analyze -- -- 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
1
143
Remember
1. List out data sources
2. Name the basic advantages of data analysis
3. Define Bigdata
4. Define Big Data Analytics
5. What is parallel processing?
6. Name two basic operations of parallel processing
Understand
1. Explain the role of map-reduce in BDA
2. Demonstrate with neat diagram BDA
3. Explain architecture of HADOOP
4. What is the role of OOZIE.
5. Explain the advantages of NoSQL
6. How to provide security to Bigdata
Apply
1. Explain the steps to store the data in HDFS
2. Build the schema in Hive.
3. Write the steps to analyze the log files in Bigdata
Analyze
1. List out any 3 differences between structured and un-structured data
2. Analyze the difference between data analysis and reporting
Evaluate
1. Evaluate the performance of HDFS and HADOOP in a simple cluster
Create
1. Construct the unstructured table using Bigdata analytic tools
2. Modify the table in NoSQL Database
144
16IT705 Big Data Analytics Lab

0032
Course Outcomes
1. Demonstrate the HDFS commands
2. Implement HADOOP with Map-Reduce
3. Use Apache Pig for analytics framework
4. Demonstrate HIVE QL
5. Compute the Page-Rank using Pig
6. Implement Map-Reduce programs for data analysis
COs–POs Mapping
COs PO3 PO4 PO5
1 1 3 1
2 3 3 1
3 2 3 2
4 2 3 2
5 3 3 2
6 3 3 1
List of Experiments
1. Set up a pseudo-distributed, single-node Hadoop cluster backed by the Hadoop Distributed File System,
running on Ubuntu Linux. After successful installation on one node, configuration of a multi-node Hadoop
cluster(one master and multiple slaves).Hadoop file management: Adding files and directories ,Retrieving
files , Deleting files
2. Move files between your regular Linux file-system and HDFS you can use the put and get commands.
3. Run the word-count job with the command below, where “/user/biadmin/input/” is where the input files are,
and “output” is the directory where the output of the job will be stored.
4. Write a script to implement the following:
o Exploring Data with Apache Pig
o Splitting a Dataset
o Joining Datasets with Apache Pig
5. Write a script to implement the following on the given dataset:
o Sorting
o Grouping the Data with Apache Pig
6. Write a script to Demonstration: Computing Page Rank using Pig
7. Database manipulation using Hive: To create, alter, drop databases and views
8. Define an external Hive table and review the results, Implement Partition and Skew in Hive
9. Functions and indexes in Hive, Use Hive to Drop Functions and indexes
10. Produce the histogram by summing the word counts grouped by word length.
Reading Material(s)
1. Data Science and Big Data Analytics, EMC2 Education Dept. of CSE VR14 VRSEC 162 Services
2. Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, 2 ed, Elseiver publishers
3. Vignesh Prajapati, Big Data Analytics with R and Hadoop, packt publishing, 2013
4. Bill Franks, Taming The Big Data Tidal Wave, 1st Edition, Wiley, 2012. [3] Frank J. Ohlhorst, Big Data
Analytics,1st Edition, Wiley, 2012.
145
16CS705 Mobile Application Development Lab

0032
Course Outcomes
1. Apply mobile application models/architectures and patterns to the development of a mobile software
application.
2. Demonstrate the components and structure of a mobile development framework (Google’s Android
Studio).
3. Apply essential Android Programming concepts.
4. Develop various Android applications related to layouts & rich uses interactive interfaces
5. Develop Android applications related to mobile related server-less database like SQLITE
6. Apply a mobile development framework to the development of a mobile application.
COs–POs Mapping
COs PO2 PO3 PO4 PO5 PO8
1 1 1 1 1 1
2 1 1 2 1 1
3 3 1 1 2 1
4 1 2 3 2 1
5 1 2 3 2 1
6 1 1 1 1 1
Pre requisite Topics

 Basic Building blocks - Activities, Services, Broadcast Receivers & Content providers
 UI Components – Views. Explicit Intents Implicit intents.
 SDK Resources & R.java Assets Layouts & Drawable Resources Activities and Activity
Life cycle First sample Application. Custom components -Custom animated popup panels.
 Using Emulator-Android Virtual Device Launching emulator Editing emulator settings
Develop an app for communication between Intents, Form widgets Text Fields Layouts.
 Using Menu Option Context menu Sub menu from xml menu via code Examples, SQLite Programming
SQLite Database
List of Experiments
1. Write an android program to implement activity life cycle using toast messages with proper positioning.
2. Write an android program to print the set of alphabets/strings in a linear layout and in table layout. a. Write
an android program to align text boxes labels, buttons in a Emulator using relative and linear layout tags in
a layout.xml. Dialogs and Menu
3. Write an android program to demonstrate DatePickerDialog, TimePickerDialog with current date and
current running time. a. Write an android program to demonstrate a Menu with name File with New and
Open as menu items. Give toast msgs on click of each menu item. (if possible implement the content in 3.a
in one tab and other set of items in another tab.)
4. Write an android program to switch from one activity to another using Intent. When the activity is changed
disable the use of back button to avoid going to previous activity Views
5. Write an android program to demonstrate scroll view and list view. (List view should array adapter. The
adapter should use array list of companies. Each item in the list view should have company name, company
address and its annual revenue.)
6. Write an android program to implement the following operations using SQLite Database.
 Create the SQLite Database Object.
 Execute the CRUD Operations required for the application
146
 Close the database.

7. Write a sample program to show how to make a SOCKET Connection from j2me phone.
This J2ME sample program shows how to how to make a SOCKET Connection from a J2ME Phone.
Many a times there is a need to connect backend HTTP server from the J2ME application, shows how
to make a SOCKET connection from the phone to port 80.
8. Login to HTTP Server from a J2ME Program
This J2ME sample program shows how to display a simple LOGIN SCREEN on the J2ME phone and
how to authenticate to a HTTP server. Many J2ME applications for security reasons require the
authentication of the user. This free J2ME sample program, shows how a J2ME application can do
authentication to the backend server.
Note: Use Apache Tomcat Server as Web Server and Mysql as Database Server.
SQLite Database
9. Divide students into batches and suggest them to develop any interested project such as.
a. Student Mark Entry System
b. Enquiry System
c. Monitoring System Learning Resource
10. Make use of location identification using GPS in an application
11. Develop android application for: broadcast receivers / content providers.
12. Develop android application for gaming.
147
Elective IV
16EC602 Digital Signal Processing
3013
Course Outcomes
1. Classify Discrete time signals and systems
2. Execute Z transform on different systems and represent with realization technique
3. Implement discrete Fourier transform and Fast Fourier transform on time domain signals
4. Implement FIR and IIR digital filters with given specifications and find the frequency response
5. Demonstrate Multirate signal processing
6. Differentiate the architecture of Digital signal processors
COs – POs Mapping

COs PO2 PO 3 PO4
1 3 2 2
2 3 2 2
3 3 2 1
4 2 3 1
5 2 3 1
6 2 3 1
UNIT I
Introduction to Discrete–Time signals and systems
Classification of Discrete time signals, linear Time Invariant (LTI) systems, (BIBO) stability and causality, Linear
convolution in time domain and graphical approach. Concept of Z-transform, Region of Convergence, properties,
Inverse Z-transform, Realization of Digital filter structures: Direct form-I, Direct form-II, Transposed form,
Cascaded form, Parallel form.
Lattice structure, Lattice-Ladder structure

12 + 3
UNIT II
Discrete–Time signals in Transform domain
Discrete Fourier Series (DFS), Discrete Time Fourier transforms (DTFT), Discrete Fourier transform (DFT),
Properties of DFT, linear convolution using DFT, Circular convolution, Fast Fourier transforms (FFT): Radix-2
decimation in time, decimation in frequency FFT Algorithm, Inverse FFT.
Overlap-save method, Overlap-add method, Radix-4FFT
10+ 3
UNIT III
IIR &FIR Digital Filters
Analog filter approximations: Butterworth and Chebyshev, Impulse Invariant transformation, Bilinear
transformation, Design of IIR Digital filters from analog filters, FIR Digital Filters: Characteristics of FIR Digital
Filters, frequency response, Design of FIR Digital Filters using Window Techniques, Comparison of IIR & FIR
filters.
Frequency Transformation in digital domain, Finite word length effects in FIR Digital filters
15+ 4
UNIT IV
Multirate Signal Processing & TMS Processors
Multirate Signal Processing: Decimation, interpolation, sampling rate conversion, Implementation of sampling rate
conversion, Introduction to DSP processors: Overview of Digital signal processors, Von Neumann Architecture,
Harvard Architecture, Multiplier Accumulator (MAC), Pipelining, Architecture of TMS320C50, Bus structure,
CPU, on chip memory, on-chip peripherals.
148
Cascading sampling rate converters, Addressing modes

10+ 5
Total: 45+15=60 Hours
Textbook (s)
1.
John G. Proakis, Dimitris, G.Manolakis, Digital Signal Processing, Principles, Algorithms, and
Applications: Pearson Education /PHI, 4th Edition, 2013
2. Digital Signal Processors – Architecture, Programming and Applications, B.Venkataramani, M.
Bhaskar, TATA McGraw Hill, 2002
Reference (s)
1. Sanjit K. Mitra, Digital Signal Processing, Tata Mc Graw Hill publishers, 3 rd Edition, 2009
2. Alan V. Oppenheim, Ronald W. Schafer Digital Signal Processing, PHI, 4th Edition, 2007
3. Andreas Antoniou, Digital Signal Processing, TATA McGraw Hill, 2006
4. MH Hayes, Digital Signal Processing, Schaum’s Outlines, Tata Mc-Graw Hill, 2007
SAMPLE QUESTION (S)
Remember 25 -- --
Understand 35 25 --
Apply 40 45 60
Analyse -- 30 40
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Signal and System

2. State the advantages and limitations of DSP
3. Define about Gibb’s phenomena
4. State the need of Multi rate signal processing
5. List the difference between FIR and IIR filters
Understand
1. Identify the following systems for time invariant
(i)
(ii)
(iii)
2. Identify the stability of the given systems
(i)
(ii)
(iii)
3. Illustrate whether the signal x(n)=sin15πn+ sin√2πn is periodic or not
4. Illustrate windowing techniques to design FIR filters
5. Represent y(n)=x(n)+2x(n-1)+3x(n-2)+2y(n-1)+3y(n-2) in direct form-I structure
2
Assignment Test should contain only questions related to Higher Order Thinking (HOT) skills
149
Apply
1. Realize the system given by the difference equation
y(n)= -0.1y(n-1)+0.72y(n-2)+0.7x(n)-0.252x(n-2) in parallel form
2. Find the DFT of a sequence x[n] = {1, 2, 3, 4, 4, 3, 2, 1}using DITFFT algorithm
3. Compute the IDFT of the sequence X[k] = {12, 0, 0, 0, 4, 0, 0, 0} using DIFFFT Algorithm
4. A DSP system is characterized by linear difference equation

with digital input . Find the output
response of the system. Find the transfer function of FIR system
5. Show the expression for the output in terms of x(n) for the multirate system given as follows
x(n) y(n)
4 2
Analyse
1. Resolve analog filter with transfer function (s+0.1)/(s+0.1) 2+9, into a digital IIR filter using bilinear
transformation. The digital filter should have a resonant frequency of ω r = π/4
2. Design a Butterworth IIR digital filter using Impulse invariant transformation technique
0.8  H ( )  0.1 0    0.2
H ( )  0.2 0.32    
3. Compare the frequency response of Linear phase FIR filter

Case(1) impulse response is symmetrical N is odd
Case(2) impulse response is anti symmetrical N is even
Case(3) impulse response is symmetrical N is even
Case(4) impulse response is anti-symmetrical N is odd
4. Outline the structural realization of linear phase FIR filter for given N
Case(1) h(n) = {3 2 1 2 3} for N=5
Case(2) h(n) = {-3 -2 0 2 3} for N=5
Case(3) h(n) = {3 2 1 1 2 3} for N=6
Case(4) h(n) = {-3 -2 -1 1 2 3} for N=6
5. Compare different windowing techniques
150
16IT006 Human Computer Interaction

3103
Course Outcomes
1. Demonstrate the capabilities of both humans and computers from the viewpoint of human information
processing.
2. Interpret 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. Make use of HCI design principles, standards and guidelines.
5. Analyze and identify user models, user support, socio-organizational issues, and stakeholder requirements
of HCI systems
6. Analyze and discuss HCI issues in groupware, ubiquitous computing, virtual reality, multimedia, and Word
Wide Web-related environments.
COs–POs Mapping
COs PO2 PO3 PO5
1 1 1 1
2 1 1 1
3 2 2 1
4 1 2 1
5 2 1 2
6 2 2 2
Unit I
Introduction
Importance of user Interface-definition, importance of good design, Benefits of good design, A brief history of
Screen design, The graphical user interface-popularity of graphics, the concept of direct manipulation, graphical
system, Characteristics, Web user-Interface popularity, characteristics-Principles of user interface.
Design methodologies-participatory design-Usability and tests-Acceptability tests.
10+5 Hours
Unit II
Design process
Human interaction with computers, importance of human characteristics human consideration, Human interaction
speeds, understanding business junctions, Screen Designing:-Design goals-Screen planning and purpose, organizing
screen elements, ordering of screen data and content-screen navigation and flow-Visually pleasing composition-
amount of information-focus and emphasis-presentation information simply and meaningfully-information retrieval
on web-statistical graphics-Technological consideration in interface design.
Design Visual thinking-virtual-environments-item presentation sequence-layout-form fill-in dialog boxes
10+3 Hours
Unit III
Windows
New and Navigation schemes selection of window, selection of devices based and screen based controls,
Components-text and messages, Icons and increases-Multimedia, uses problems, choosing colors.
Goals of Co-operation-asynchronous interactions-synchronous distributed-application to education-social uses
12+4 Hours
151
Unit IV
Software tools &Interaction Devices
Specification methods, interface-Building Tools, Keyboard and function keys, pointing devices-speech recognition
digitization and generation-image and video displays-drivers.
Database query and phase search in documents, multimedia document searches, information visualization
13+3 Hours
Total: 45+15 Hours
Textbook (s)
1. Wilbert O Galitz, Wiley Dream Tech, The essential guide to user interface design,3rd Edition,Wiley
Computer Publishing, 2007
2. Ben Shneidermann, Designing the user interface, 3rd Edition, Pearson Education Asia, 2008
Reference (s)
1. Alan Dix, Janet Fincay, GreGoryd, Abowd, Russell Bealg, Human Computer Interaction.,4th Edition,
Pearson Education, 2018
SAMPLE QUESTION (S)

Remember 40 30 --
Understand 40 40 --
Apply 20 30 80
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Human Computer Interaction.
2. What is the basic goal of Human Computer Interaction?
3. State the long term goal of HCI
4. List the factors HCI designers must consider for User Interface Design
Understand
1. Demonstrate the HCI importance.
2. Extend the Trouble faced by human with Computers.
3. Illustrate Psychological Responses to Poor Design
4. Interpret Human-factor variables used in Comparison of pointing devices.
Apply
1. Identify the amount of Information need to Present in a page.

2. Organize the different Software tool specification methods.
3. Model out the six types interaction tasks properties of Pointing devices
3
152
Analyze
1. Distinguish the Focus and Emphasis of visual elements in web page design.
2. Categorize the Formatting of Menus.
3. Analyze organizational structure of Keyboard layouts
153
16IT003 Information Retrieval Systems
3103
Course Outcomes
1. Learn Classical and advanced techniques employed by Web Search engines
2. Know different ways of representation and retrieval of documents.
3. Apply techniques of preprocessing needed for IRS
4. Apply the techniques of clustering on unstructured data
5. Apply indexing methods for fast retrieval from Document data.
6. Develop an IRS by using different user search techniques and text search algorithms
COs–POs) Mapping
COs PO3 PO5 PO6
1 1 1 2
2 1 2 2
3 2 1 2
4 2 1 1
5 2 1 1
6 1 2 3

Unit I
Introduction & Measures
Definition, Objectives, Precision,Recall,Comparison to DBMS, Digital libraries and Data Warehouses, Functional
Overview, Search, Browse Capabilities.
Beyond the syllabus: Miscellaneous capabilities. (11+3) Hours
Unit II
Cataloging and Indexing & Data Structures
Objectives, Indexing Process, Automatic Indexing, Information Extraction, Classes of automatic indexing,
Stemming Algorithms, Inverted file structures, N-gram data structure, PAT datastructure.
Beyond the syllabus: Signature file structure, Hypertext data structure. (12+4) Hours
Unit III
Document and Term Clustering & Text Search Algorithms
Introduction, Thesaurus generation, Item clustering, Hierarchy of clusters. Software text search algorithms-Brute
force, Knuth Pratt Morris, Boyer Moore.
Beyond the syllabus: Hardware text search systems (11+4) Hours
Unit IV
Information Retrieval System Evaluation
Introduction, Measures used in System Evaluation,Standard test collections, Evaluation of unranked retrieval sets,
Evaluation of ranked retrieval results.
Beyond the syllabus: Measurement Example-TREC Results. (11+4) Hours
Total: (45+15) Hours
Textbook (s)
1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and Implementation, 2nd
edition, Kluwer Academic Press, 2000.
154
2. http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-in-information-retrieval-1.html
Reference (s)
1. Frakes, W.B.andRicardoBaeza Yates, Information Retrieval Data Structures and Algorithms, 1st Edition
Prentice Hall, 1992.
2. Robert Korfhage, Information Storage & Retrieval, 1st Edition, John Wiley & Sons, 2005
SAMPLE QUESTION (S)

Remember 30 30 --
Understand 40 40 --
Apply 10 20 80
Analyze 20 10 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define measures for IRS
2. Define PAT
3. State Browse capabilities
4. List automatic indexing
5. Recall term clustering algorithms
Understand
1. Explain Functional Overview
2. Explain Stemming algorithms
3. Summarize Brute force algorithms
4. Illustrate S/w text search Algorithms
5. Interpret standard test collection
6. Classify S/w & H/w text search systems
Apply
1. Demonstrate Precision
2. Design a hybrid Indexing Data Structure
3. Use stemming Algorithms for IRS
Analyze
1. Analyze s/w and h/w indexing methods
2. Analyze search and Browse capabilities
3. Compare Pat and Stemming algorithms
4. Analyze Term clustering Algorithms
Evaluate
1. Determine Which of the indexing algorithm is efficient
2. Check all automatic indexing methods for its efficiency
3. Compare S/w text search and H/w text search algorithms
4
155
16CS008 Software Project Management

3103
Course Outcomes:
1. Understand the concepts and issues of Software Project Management.

2. Explain various Software Architectures.
3. Analyze Software Risks and Risk Management Strategies.
4. Design effective software development model to meet organizational needs.
5. Apply appropriate methodologies to develop a project schedule.
6. Apply appropriate techniques to assess ongoing project performance.
COs–POs Mapping
COs PO3 PO5 PO6 PSO2
1 1 1 2 1
2 2 2 2 2
3 1 1 1 3
4 3 3 1 2
5 3 3 1 3
6 3 3 1 3
UNIT I
The principles of conventional software Engineering, Principles of Modern software management, transitioning to
an iterative process. Conventional Software Management: The Waterfall Model, Conventional Software
Management Performance, Software Economics, Software Cost Estimation. Improving Software Economics:
Reducing Software Product Size, Improving Software Processes, Improving Team Effectiveness, Improving
Automation, Achieving Required Quality, Peer Inspections.
Software Development Phases, Procedural vs Object Oriented Paradigm.
12+4
UNIT II
Life Cycle Phases: Engineering and Production Stages, Inception, Elaboration, Construction, Transition Phases.
Artifacts of Software Process: The Artifact Sets, Types of Artifacts. Software Architectures: A Management
Perspective and Technical Perspective, Software Process Workflows, Iteration Workflows.
Off-the-Shelf Components, Requirement Specification Document, Methods of Specification.
10+3
UNIT III
Checkpoints of the Process: Major Milestones, Minor Milestones, Periodic Status Assessments. Iterative Process
Planning: Work breakdown Structures, Planning Guidelines, Cost Estimation and Scheduling Iteration Planning
Process, Pragmatic Planning.; Project Organizations and Responsibilities: Line-of-Business Organizations,
Project Organizations, Evolution of Organizations.; Process Automation: Automation Building Blocks, The Project
Environment.
CASE Tools for Requirements Specification, Planning and Estimation.
10+3
UNIT IV
The Seven Core Metrics, Management Indicators, Quality Indicators, Life Cycle Expectations, Pragmatic Software
Metrics, Metrics Automation, Tailoring the Process- Process Discriminant.; Future Software Project
Management: Modern Project Profiles, Next Generation Software Economics, Modern Process Transitions.
Types of Software Testing, Software Testing Methodologies.
10+3
Total: 45+15 Hours
156
Textbook (s)
1. Walker Royce, Software Project Management, Pearson Education, 2005.
Reference (s)
1. Bob Hughes, Mike Cotterell and Rajib Mal, Software Project Management, Tata McGraw- Hill Edition.
2. Joel Henry, Software Project Management, Pearson Education.
3. Pankaj Jalote, Software Project Management in practice, PearsonEducation.2005.
SAMPLE QUESTION (S)

Remember 40 30 --
Understand 40 40 --
Apply 20 30 80
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Software Process
2. List the phases of Software Development.
3. What is an Artifact?
4. What is Process Automation?
Understand
1. Explain various formal methods of specification.
2. Explain COCOMO II Model.
3. Explain Critical Path Methods to schedule a software project.
Apply
1. Identify the amount of Information need to present in a page.

2. Organize the different Software tool specification methods.
3. Assume that the size of an organic type software product has been estimated to be 32,000 lines of source
code. Assume that the average salary of software engineers be Rest. 15,000/- per month. Determine the
effort required to develop the software product and the nominal development time.
Analyze
1. Distinguish between Classical and Object Oriented Software methodologies
2. Compare among various CMMI levels with real time examples.
3. Analyze PERT with suitable example
4. Outline the merits and demerits for scrum and XP.
5
157
Elective V
16IT002 Distributed Systems
3103
Course Outcomes
1. Learn the core concepts underlying distributed systems designs.
2. Identify entities and resources in distributed systems
3. Examine the naming conventions in distributed systems
4. Apply and compare the various communication mechanisms in distributed systems.
5. Identify issues on how to coordinate multiple tasks in a distributed system.
6. Identify issues on how to synchronize multiple tasks in a distributed system
COs-POs Mapping
COs PO3 PO7
1 1 1
2 1 1
3 1 1
4 1 2
5 2 2
6 2 2
Unit I
Introduction to Distributed systems
Definition of Distributed systems-goals of distributed systems-types of distributed systems-Distributed system
architecture-architectural styles-system architectures-Communication Fundamentals-Remote Procedure Call-
Message-Oriented Communication-Stream-Oriented Communication-Multicast Communication.
The node addition algorithm-Application level multicasting
(10+5 )Hours
Unit II
Naming, Synchronization, Consistency and Replication
Names-Identifiers-and Addresses-Flat Naming-Structured Naming-Attribute-Based ,Clock Synchronization-Stream
Synchronization-Synchronization Mechanisms-Logical Clocks-Physical clocksIntroduction-Data-Centric
Consistency Models-Client-Centric Consistency Models-Consistency Protocols.
Framework for Consistency-Multiprocess Systems-SessionGuarantees
(10+3) Hours
Unit III
Fault Tolerance&Distributed File Systems
Introduction to Fault Tolerance-Process Resilience-Reliable Client-Server Communication-Reliable Group
Communication-peer to peer communications-Distributed Commit-Recovery.Introduction to distributed file
systems-Architecture-Process-communications-consistency and replication-Sun network file system
Server Message Block-Andrew File System
(12+4 )Hours
Unit IV
Distributed Transactions&Coordination and Agreement:
Introduction-Flat and nested distributed transitions-Atomic commit protocol-concurrency control in distributed
transactions-distributed dead locks-Transaction and recovery.Introduction-Distributed Mutual exclusion-Elections-
multi cast communication-consensus and related problems.Case study: CORBA RMI-CORBA Services.
A ring based election algorithm-Maekawa’s algorithm
158
13+3 Hours
Total: 45+15 Hours
Textbook(s)
1. Andrew S.Tanenbaum and Maarten Van Steen,Distributes Systems Principles and paradigms,- 2nd Edition,
Prentice Hall, 2007
2. George Coulouris , Jean Dollimore& Tim Kindberg , Distributed Systems: Concepts and Design , 5th
Edition, Addison-Wesley, 2011
Reference(s)
1. Andrew S.Tanenbaum, Distributed Operating Systems, Pearson Education, 1995
SAMPLE QUESTION (S)
Remember 25 20 --
Understand 35 35 --
Apply 30 35 70
Analyze 10 10 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember:
1. List three properties of distributed systems.
2. List some disadvantages or problems of distributed systems that local only systems do not show (or at least
not so strong)
3. Define distributed Systems.
4. What are the services and examples of Middleware?
5. List five reasons why to build distributed System.
6. What do you mean by transparency?
7. What are the request reply protocols?
8. List the types of Communication paradigms.
9. Define distributed mutual exclusion.
Understand:
1. Estimate how distributed system benefits resource sharing.

2. Describe the main idea of Distributed Systems.
3. Summarize about resource sharing.
4. Discuss the design issues in Intranet
5. Discuss the design issues of RMI.
6. Differentiate marshalling and unmarshalling.
7. Describe Remote procedure call.
8. Differentiate physical clock and Logical clock.
9. Discuss what are the advantages and drawbacks of multi version timestamp ordering in comparison with
ordinary timestamp ordering
10. Summarize the internal and external synchronization of Physical clocks.
11. Express in diagram the file attributes record structure.
12. (i)Describe With a neat sketch explain remote procedure call.
6
159
(ii) Describe explain about group communication.
Apply:
1. Show how distributed System helps cloud computing.

2. Illustrate the concept of concurrency.
3. Utilize the World Wide Web as an example to illustrate the concept of resource sharing, client and server.
4. (i) Examine about the use of request reply protocol. (ii) Show how message queues are useful? Explain in
brief.
5. Illustrate the architecture and server operation of NFS.
6. Show the use nested transaction.
7. Show how will you make use of nested transaction, What are its rules
Analyze:
1. Classify the file accessing models.

2. Summarize in detail about naming in file systems.
3. Pointout the reason why computer clock synchronization is necessary.
4. (i)Explain distributed mutual exclusion with suitable algorithm. (ii) Analyze on any three election
algorithms. Use appropriate
Create:
1. Develop the scenario how might the clocks in two computers that are linked by a local network be
synchronized without reference to an external time source
2. Design in detail any two application domain where distributed system is applied.
3. Formulate why there is no explicit data typing in CORBA
4. Formulate the design and implementation of name services and Domain Name services.
Evaluate:
1. Rank the advantages and disadvantages of HTML, URLs and HTTP as core technologies for information
browsing?
2. Conclude on shared memory Approach
3. Explain on LDAP.
4. How will you assess a consensus problem?
5. (i )Explain detail about two phase commit protocol. (ii) Examine on atomic commit protocol.
160
16IT007 Middleware Technologies

3103
Course Outcomes
At the end of the course students are able to:
1. Choose appropriate client server computing model for given problem.
2. Interpret dynamic remote application with RMI and JDBC Connectivity.
3. Understand client server applications using C#.net
4. Select appropriate language for homogeneous and heterogeneous objects.
5. Apply the concept of CORBA and database interfacing in real time projects.
6. Analyze appropriate middleware technology to develop real time applications
COs–POs) Mapping
COs PO3 PO5
1 2 1
2 2 2
3 2 1
4 1 1
5 3 2
6 3 2
UNIT – I
Introduction
General Middleware, Service Specific Middleware, Client/Server Building blocks – RPC - Messaging – Peer – to –
Peer, Java RMI - Computing standards – OMG - Overview of CORBA - Overview of COM/DCOM - Overview of
EJB - Middleware types - Middleware in distributed Applications
Benefits & pitfalls of client server computing.

11+4 hours
UNIT – II
EJB and CORBA
EJB architecture - Overview of EJB software architecture, EJB Conversation, Building and Deploying EJBs, Roles,
applications - EJB Session Beans, EJB entity beans – Lifecycle of Beans - EJB clients - developing an application -
Deployment. CORBA – components - architectural features - method invocations - static and dynamic: IDL -
CORBA’s self-describing data - interface repository - Building an application using CORBA - Overview of
CORBA Services - Object location Services, Messaging Services - CORBA Component Model.
Dynamic CORBA- Multi count 12+3 hours
UNIT-III
COM and .NET
Evolution of DCOM - Introduction to COM - COM clients and servers - COM IDL - COM Interfaces COM
Threading Models – Marshalling - Custom and standard marshalling - Comparison COM and CORBA -
Introduction to .NET - Overview of .NET architecture
161
DOT NET Remoting layer 11+4 hours
UNIT-IV
SOA and Web Services

Defining SOA - Business value of SOA - SOA characteristics - Concept of a service, Basic SOA - Enterprise
Service Bus (ESB) - SOA enterprise Software Models -Services and SOA – WSDL - SOAP, UDDI, WS Standards -
Web Services and Service Oriented Enterprise (SOE) - Coordination and Transaction.
Business Process Execution Language for Web Services. 11+4 hours

Total: 45+15 hours
Text Book (s):

1. G. Sudha Sadasivam and Radha Shankarmani, Middleware and Enterprise Integration Technologies,1st
edition, Wiley, 2009.
2. Gustavo Alonso, Fabio Casati, Harumi Kuno, Vijay Machiraju, Web Services: Concepts, Architectures and
Applications, Springer, 2010.
3. Ian Gorton, Essential Software Architecture, 2nd Edition Springer, 2011.
Reference Book (s):
1. The Complete Book of Middleware,1st Edition, Judith M. Myerson, Auerbach Publications, 2007.
2. Mobile Middleware: Supporting Applications and Services” 1st Edition, Sasu Tarkoma, Wiley
2009.
SAMPLE QUESTION (S)

Remember 40 30 --
Understand 40 40 --
Apply 20 30 80
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Represent the Characteristics of Client/Server Architecture
2. State 3 methods of Dynamic CORBA
3. List four uses of Middleware
4. Write the role of RMI
Understand
1. Demonstrate the pitfalls for Client/Server Computing
2. Illustrate Late Binding with system.reflection and Activator class
3. Justify the reasons for employing distributed computing in business
7
162
Apply
1. Show the portable count and dynamic count of Dynamic CORBA

2. Formulate the Object –Oriented Programming with C#.
3. Draw OMG reference model architecture of CORBA
Analyze
1. Indicate the different services provided by CORBA.
2. Categorize the COM and CORBA software development study
3. Analyze the steps involved in a EJB conversations
163
16IT009 Cryptography and Network Security

3103
Course Outcomes
1. Understand theory of fundamental cryptography, encryption and decryption algorithms
2. Understand the symmetric and public key cryptographic algorithms
3. Explain the various authentication applications
4. Comprehend different mechanisms related to network security
5. Interpret the functionalities of IP Security
6. Describe the functionalities of firewalls
COs–POs) Mapping
COs PO5 PO6 PO8
1 2 2 3
2 2 2 3
3 2 1 3
4 2 1 2
5 2 2 3
6 2 2 2
UNIT I
Introduction: Security Attacks, Security Goals, Computer criminals, Methods of Defence, Security Services,
Security Mechanisms. Basics of Cryptography:Symmetric Cipher Model, Substitution Techniques,
Transportation, Techniques, Other Cipher Properties- Confusion, Diffusion, Block and Stream Ciphers. Block
Cipher Design Principles and Modes of Operations, Symmetric Key Cryptosystems: Principles of Private Key
System, Data Encryption Standard (DES), Strength of DES, Triple DES, International Data Encryption algorithm,
Advanced Encryption Standard (AES),
Blowfish, CAST-128. 11 + 4 Hours
UNIT II
Public Key Ciphers: Principles of Public Key Cryptosystems, RSA Algorithm, Diffie-Hellman Key Exchange.
Cryptographic Hash Functions: Principles of Cryptographic Hash functions, Applications of Cryptographic Hash
Functions, Secure Hash Algorithm (SHA), Message Authentication Codes – Message Authentication Requirements
and Functions, HMAC, Digital Signatures, Digital Signature Schemes, Authentication Protocols,
Digital Signature Standards. 11 + 4 Hours
UNIT III
Authentication Applications: Kerberos, Key Management and Distribution, X.509 Directory Authentication service,
Public Key Infrastructure, Electronic Mail Security: Pretty Good Privacy, S/MIME. IP Security: Overview,
Architecture, Authentication Header, Encapsulating Security Payload, Combining security Associations, Internet
Key Exchange, Web Security: Web Security Considerations, Secure Sockets Layer and Transport Layer Security,
Electronic Payment. 11 + 4 Hours
UNIT IV
164
IDS and Firewalls: Intruders, Intrusion Detection, Password Management, Firewalls-Characteristics, Types of
Firewalls, Placement of Firewalls, Firewall Configuration, Trusted Systems. Non-cryptographic protocol
Vulnerabilities: DoS, DDoS, Session Hijacking and Spoofing, Software Vulnerabilities- Phishing, Buffer
Overflow,
Format String Attacks, SQL Injection. 11 + 4 Hours
Text Books:
1. William Stallings, “Cryptography And Network Security – Principles and Practices”, Prentice Hall of
India, Third Edition, 2003.
2. AtulKahate, "Cryptography and Network Security", Tata McGraw-Hill, 2003.
3. M. Y. Rhee, Cryptography and Secure communication, McGraw-Hill

REFERENCES:
1. William Stallings, “Cryptography and Network Security: Principles and Practices”, Third Edition, Pearson
Education, 2006.
2. Matt Bishop ,“Computer Security art and science ”, Second Edition, Pearson Education, 2002
3. Wade Trappe and Lawrence C. Washington, “Introduction to Cryptography with Coding Theory” Second
Edition, Pearson Education, 2007
4. Jonathan Katz, and Yehuda Lindell, Introduction to Modern Cryptography, CRC Press, 2007
5. Douglas R. Stinson, “Cryptography Theory and Practice”, Third Edition, Chapman & Hall/CRC, 2006
6. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, First Edition, 2006.
7. Network Security and Cryptography, Menezes Bernard, Cengage Learning, New Delhi, 2011
8. Man Young Rhee, Internet Security, Wiley, 2003
9. OWASP top ten security vulnerabilities: http://xml.coverpages.org/OWASPTopTen.pdf
SAMPLE QUESTION (S)

Remember 30 30 --
Understand 20 20 --
Apply 20 20 75
Analyze 10 30 25
Evaluate - - -
Create - - -
Total (%) 100 100 100
8
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills Pertaining to this course
165
16CS009 Social Network Analysis

3103
Course Outcomes
1. Acquire Knowledge to analyze Social Networks
2. Model, Aggregate and Represent Knowledge for Semantic Web
3. Use Extraction and Mining tools for Social Networks
4. Apply Reality Mining to Predict Human Behaviour for Social Communities
5. Apply various Algorithms for Evolution and Opinion Mining in Social Networks
6. Write algorithms and systems for expert location in social networks
COs–POs Mapping
1 3 3 2 2
2 3 3 2 2
3 3 2 2 1
4 2 2 2 2
5 2 2 1 1
6 1 2 1 1
Unit I
Introduction
Introduction to Web, Limitations of current Web, Development of Semantic Web, Emergence of the Social Web,
Statistical Properties of Social Networks, Network analysis, Development of Social Network Analysis-Key concepts
and measures in network analysis, Discussion networks-Blogs and online communities-Web-based networks
Case Studies of Social Network sites like Facebook-Twitter-Linkedin etc.

9+3 Hours
Unit II
Evolution
Evolution in Social Networks– Framework, Tracing Smoothly Evolving Communities, Models
and Algorithms for Social Influence Analysis, Influence Related Statistics, Social Similarity
and Influence, Influence Maximization in Viral Marketing, Link Prediction in Social Networks, Feature based
Link Prediction
Neurons &Social Actor-Advanced techniques in Link Prediction

12+4 Hours
Unit III
Mining Communities and Opinion Mining
Applications of Community Mining Algorithms, Node Classification in Social Networks
Opinion Extraction–Sentiment Classification and Clustering, Temporal Sentiment Analysis-Irony Detection in
Opinion Mining-Wish Analysis–Product Review Mining–Review Classification
Tracking Sentiments towards Topics over Time

12+4 Hours
166
Unit IV
Modelling and Visualization
Visualizing Online Social Networks, A Taxonomy of Visualizations, Graph Representation-Centrality-Clustering-

Node-Edge Diagrams-Visualizing Social Networks with Matrix-Based Representations-Node-Link Diagrams,
Hybrid Representations, Modelling and Aggregating Social Network Data, Random Walks and their Applications,
Ontological representation of Social Individuals and Relationships.
Use of Hadoop and MapReduce-Gephi
12+4 Hours
Total: 45+15 Hours
Textbook (s)
1. Charu C. Aggarwal, Social Network Data Analytics, Springer, 2011
2. Peter Mika, Social Networks and the Semantic Web, Springer, 1st Edition, 2007.
Reference (s)
1. BorkoFurht, Handbook of Social Network Technologies and Applications, Springer, 1st Edition, 2010.
2. GuandongXu,Yanchun Zhang and Lin Li, Web Mining and Social Networking, Techniques and
applications, Springer, 1st Edition, 2011.
3. Giles, Mark Smith, John Yen, Advances in Social Network Mining and Analysis, Springer,
2010.
4. Ajith Abraham, Aboul Ella Hassanien, VáclavSnášel, Computational Social Network
Analysis: Trends, Tools and Research Advances, Springer, 2009.
SAMPLE QUESTION (S)

Remember 35 20 -
Understand 35 30 -
Apply 20 40 70
Analyze 10 10 20
Evaluate -- - 10
Create -- - -
Total (%) 100 100 100
Remember
1. What are the limitations of current web?
2. List the statistical properties of social networks
3. Define social similarity.
4. What are the two different measures in influence related statistics
Understand
1. Explain about development of semantic web in research.
2. Demonstrate web based networks.
3. Illustrate the ways of visualizing social networks with matrix based representation and node – link diagram.
9
167
4. Explain core methods of community detection and mining.

5. Explain algorithms and systems for expert location in social networks.
6. Outline the models and algorithms for social influence analysis.
Apply
1. Make use of the following graph to solve Degree Centrality, Between-ness Centrality and Cliques.
2. Solve Path, Length and Distance between nodes (i.e., Density measures) using SNA Data Processing Tools.
3. Make use of the above graph to solve network density and cut points.
4. Develop random graphs using Erdos Reini Model
5. Solve Weak Ties,Traidic closure for the following graph.
Analyze
1. Compute PageRank for the following figure.
2. Discover Spectral Clustering steps for the following graph.
3. Examine the ways to visualize community’s hubs and node centrality measures using sna package.
4. Analyze positive, moderate and negative feeds using sentiment analysis on twitter data.
168
16IT802 Professional Ethics

3103
Course Outcomes
1. Understand the importance of ethics in person and IT environment
2. Infer the management of security vulnerabilities and action plan on security incident.
3. Identify the right of privacy and laws of protection for privacy of data.
4. Exemplify the intellectual property and rights.
5. Interpret the concepts of intellectual property and ethical issues of software manufacturers,
6. Summarize the key ethical issues with the use of social networking and impact of IT on living.
COs–POs Mapping
COs PO6 PO8
1 1 3
2 2 2
3 2 2
4 2 2
5 2 3
6 2 3
UNIT-I
An Overview of Ethics and Ethics for IT Professional and IT Users
ETHICS: Definition of Ethics ,The Importance of Integrity ,The Difference Between Morals, Ethics, and Laws ,
Ethics in the Business World ,Why Fostering Good Business Ethics Is Important , Improving Corporate Ethics
,Creating an Ethical Work Environment ,Including Ethical Considerations in Decision Making .
Ethics for IT Workers and IT Users

IT Professionals ,The Changing Professional Services Industry ,Professional Relationships That Must Be managed
,Professional Codes of Ethics , Professional Organizations ,Certification ,Government Licensing ,IT Professional
Malpractice ,IT Users ,Common Ethical Issues for IT Users .
Ethics in Information Technology, Supporting the Ethical Practices of IT Users 10+5 Hours
Unit-II
Computer, Internet Crime and Privacy
IT Security Incidents: A Major Concern ,Why Computer Incidents Are So Prevalent ,Types of Exploits ,Types of
Perpetrators , Implementing Trustworthy Computing ,Risk Assessment ,Establishing a Security Policy ,Educating
Employees, Contractors, and Part-Time Workers , prevention ,Detection , Response.
Privacy: Privacy Protection and the Law, Information Privacy, Privacy Laws, Applications, and Court Rulings,Key
Privacy and Anonymity Issues, IdentityTheft, ConsumerProfiling, Treating Consumer Data Responsibly Workplace
Monitoring.
Federal Laws for Prosecuting Computer Attacks, Advanced Surveillance Technology. 10+3 Hours
Unit-III
Intellectual Property: Intellectual Property definition, Copyrights ,Copyright Term ,Eligible Works ,Fair Use
Doctrine ,Software Copyright Protection ,The Prioritizing Resources and Organization for IntellectualProperty
(PRO-IP) Act of 2008 ,General Agreement on Tariffs and Trade (GATT) ,The WTO and the WTO TRIPS
Agreement (1994) ,The World Intellectual Property Organization (WIPO) Copyright Treaty (1996) ,The Digital
169
Millennium Copyright Act (1998) , Patents ,Software Patents ,Software Cross-Licensing Agreements ,Defensive
Publishing and Patent Trolls , Submarine Patents and Patent Farming .
Key Intellectual Property Issues: Plagiarism, Reverse Engineering, Open Source Code, CompetitiveIntelligence.
Software Development: Strategies for Engineering Quality Software, the Importance of Software Quality,
Software Product Liability, Key Issues in Software Development, Development of Safety-Critical Systems, Quality
Management Standards.
ACM code of ethics and professional conduct 12+4 Hours
Unit -IV
Social Networking
What Is a Social Networking Web Site? ,Business Applications of Online Social Networking ,Social Network
Advertising ,The Use of Social Networks in the Hiring Process ,Social Shopping Web Sites ,Social Networking
Ethical Issues ,Cyberbullying ,Cyberstalking ,Encounters with Sexual Predators ,Uploading of Inappropriate
Material .
The Impact of Information Technology on Productivity and Quality of Life

The Impact of IT on the Standard of Living and Worker Productivity ,IT Investment and Productivity ,The Digital
Divide ,The Impact of IT on Healthcare Costs ,Electronic Health Records, Use of Mobile and Wireless Technology
in the Healthcare Industry ,Telemedicine ,Medical Information Web Sites for Laypeople.
Online Virtual Worlds, Crime in Virtual Worlds, Educational and Business Uses of Virtual Worlds
13+3 Hours
Total: 45+15 Hours
Text book (s)
1. George W Reynolds, “Ethics in Information Technology,” 5thEdition, Cengage Learning US, 2015,
Reference Book (s )
1. Deborah G. Johnson, “Computer Ethics,“ 3rd Edition, Prentice Hall, 2001,
2. Sara Base, A Gift of Fire: Social, Legal and Ethical Issues, for Computing and the Internet,” 4 th Edition,
Pearson Edition 2012
SAMPLE QUESTION (S)
INTERNAL ASSESSMENT PATTERN
Level (%) (%)
Remember 40 40 --
Understand 50 40 30
Apply 10 10 30
Analyze -- 10 20
Evaluate -- -- 20
Create -- -- --
Total (%) 100 100 100
1
170
Remember
1. Name the qualities of a self-confident people.

2. Define risk benefit analysis.
3. State the importance of whistle blowing.
4. Write the important aspects of technology transfer.
5. List the condition involved in valid informed consent.
6. Mention various types of vulnerabilities.
Understand
1. Generalize the term ‘self-confidence’.

2. Illustrate empathy.
3. Discuss caring and sharing in brief.
4. List out the civic virtues.
5. Describe the importance of ethics in engineering filed.
6. Identify the importance of service learning.
7. Discuss the criteria required for a profession.
Apply
1. Explain the scope of engineering ethics.

2. Explain the skill needed to handle the problems about the moral issues in engineering ethics.
3. Discuss the different models of professional roles.
4. Discuss the importance of duties ethics and virtues in engineering profession.
5. Give the code of ethics played by the Institute of Electrical and Electronics Engineers. Discuss in detail
6. Give the criteria that help to ensure a safety design.
7. Illustrate the ethical theories for right-action, self-interest and duty ethics.
Analyze
1. Identify the categories of Risk.

2. Find out three conditions referred as safe exit.
3. Are the engineers possible to educate the public for safe operation of the equipment? If so, discuss with suitable
instance.
4. Compare and contrast the engineering equipment with standard experiments.
5. Take apart the effect of information on risk assessment.
6. Investigate on safety measures. Explain the safety measures considered in Net Banking Systems.
Evaluate
1. Assess the computer ethics against the usage of code of conduct.

2. Discuss the importance of IPR protection.
3. Criticize the similarities of internal and external whistle blowing.
4. Discuss the moral threats posed by the revolutionized communication using computer to the rights of privacy.
5. Discuss the functions of anonymity and privacy in terms of helpful and undesirable in computer-aided activities
with suitable example.
6. Plan the various test required to evaluate the ethical theories.
171
16CS802 Machine Learning
3103
Course Outcomes:
1. Understand a wide variety of learning algorithms.
2. Understand how to apply a variety of learning algorithms to data using various tools of Machine Learning.
3. Identify the strengths and weaknesses of many popular machine learning approaches.
4. Analyze the performance of learning algorithms and model selection.
5. Identify mathematical relationships within and across Machine Learning algorithms and the paradigms of
supervised and un-supervised learning.
6. Apply Artificial Neural Networks and Deep Neural Networks in solving complex real world problems.
COs–POs Mapping
COs PO2 PO5
1 1 2
2 3 2
3 3 1
4 3 2
5 3 2
6 2 2
UNIT I
Introduction: Learning, Types of Machine Learning, Hypothesis Formulation and Model
Selection, Phases of ML: Training, Testing and Validation; Evaluation Machine Learning Models: Error
Analysis, Performance Indices, Datasets for ML; Regression: Linear Regression, Linear Regression with Multiple
Variables, Logistic Regression, Regularization; Examples of Machine Learning Tools: Weka, R, Python,
MATLAB, TensorFlow.
Basic Statistics: Averages, Variance and Covariance, Probability Distributions, The Bias-Variance Trade-off.
10+3
UNIT II
Learning with Trees: Constructing Decision Trees, CART, Constructing Rules from a Decision Tress
Classification example;. Bayesian Learning: Bayes Theorem, Graphical Models: Bayesian Networks, Approximate
Inference, Making Bayesian Networks. Instance based Learning: Nearest Neighbor Classifiers.
Modelling a Supervised Learning System, ID3 Classifier, Conditional Probability, Naive Bayes Classifier, Distance
Metrics in Data mining.
10+3
UNIT III
Clustering: Introduction, Advanced Similarity and Distance Measures, Clustering Large Databases, Clustering with
Categorical Attributes, Comparison. ; Dimensionality Reduction: Linear Discriminant Analysis, Principal
Component Analysis.; Evolutionary Learning: Genetic Algorithms, Genetic Operators. Genetic Programming;
Ensemble Learning: Boosting, Bagging.
Types of Clustering Techniques, Similarity and Distance Measures
13+5 Hours
UNIT IV
Artificial Neural Networks: ANN Learning, The Multilayer Perceptron (MLP): Error Propagation, Delta Rule,
Back Propagation Algorithm, Applications; Deep Learning: Convolutional Neural Networks (CNN/ConvNets),
172
Recurrent Neural Networks (RNNs), Restricted Boltzmann Machines (RBMs), Deep Boltzmann Machines (DBMs);
Machine Learning with Large Datasets: ML Models for Large Scale Learning, Online Learning.
Linear Separability, The Perceptron, Sigmoid Function and its properties.
12+4
Total: 45+15 Hours
Textbook (s)
1. Stephen Marsland, "Machine Learning - An Algorithmic Perspective ", CRC Press, 2009.
2. Sunila Gollapudi, “Practical Machine Learning” First Edition 2016, Packt Publishing Ltd.
Reference (s)
1. Tom M. Mitchell, "Machine Learning ", Tata McGraw Hill, 1997.
SAMPLE QUESTION (S)

Level (%) (%)
Remember 40 30 --
Understand 40 40 --
Apply 20 30 80
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Machine Learning.
2. List the types of Machine Learning.
3. State Bayes Theorem.
4. What is Regularization?
Understand
1. Demonstrate Linear Regression.
2. Explain Back Propagation Algorithm.
3. Illustrate Decision Tree Induction process in detail.
4. Demonstrate Genetic Operations in detail.
Apply
1. Apply the concept of Regularization to solve overfitting problem.

2. Build a Linear Regression for a given dataset.
3. Apply k-Means algorithm on a given dataset to identify clusters.
2
173
Analyze
1. Distinguish between Logistic Regression and SVM.
2. Analyze Dimensionality Reduction using PCA
3. Analyze various Neural Network Architectures in Machine Learning.
174
Elective VI
16EC005 Digital Image Processing
3103
Course Outcomes
1. Interpret fundamental concepts of digital image
2. Infer image transforms
3. Exemplify image enhancement and color image processing
4. Assess image restoration techniques
5. Summarize line, point, threshold and region based segmentation for digital images
6. Attribute various compression models and compression techniques for digital images
COs – POs Mapping

COs PO2 PO3 PO5 PO6
1 2 3 2 2
2 3 2 2 3
3 2 3 2 2
4 2 3 2 3
5 2 3 2 2
6 2 3 2 2
UNIT I
Digital Image Fundamentals
Fundamental steps in Digital image processing, Components of an Image processing system, Elements of
visual perception, Image sampling and quantization, basic relationships between pixels, An introduction
to mathematical tools in digital image processing. Image Transforms: 2D DFT and its properties,
Discrete cosine transform, Discrete Wavelet Transform.
Walsh Transform, Hadamard Transform
13+4
UNIT II
Image Enhancement and Color Image Processing
Enhancement in spatial domain: Intensity transformations, Histogram Processing, smoothing and
sharpening, Image Enhancement in Frequency Domain: Smoothing and Sharpening Filters. Color
fundamentals, Color models, Pseudo color Image Processing, Full Color Image Processing, color
transformations.
Color Image Enhancement in spatial and frequency domain

13+4
UNIT III
Image Restoration
Image Degradation/Restoration model, Noise models, Restoration using spatial filtering, Periodic noise
reduction by frequency domain filtering, Linear Position-Invariant Degradations, Inverse filtering,
Minimum Mean Square Error Filtering, Constrained Least squares filtering.
Estimating the degradation function, Geometric Mean filter
9+3
175
UNIT IV
Image Segmentation and Compression
Image segmentation: Fundamentals, point, Line and Edge detection, Thresholding, Region based
Segmentation. Image Compression: Fundamentals, Image Compression Models, Lossless Compression,
Lossy Compression, Transform coding and JPEG compression standard.
Watershed algorithm
10+4
Total: 45+15 Hours
Textbook (s)
1. Rafel C.Gonzalez and Richard E.Woods, Digital Image Processing, Pearson Education, 3rd
Edition 2011.
Reference (s)
1. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson Education.2003
2. S.Jayaraman, S.Esakirajan, T.Veerakaumar, Digital Image Processing, McGraw Hill
publishres, 2009
3. S. Sridhar, Digital Image Processing, Oxford publishers, 2011
4. Chanda&Majumdar, Digital Image Processing and Analysis, PHI,2003
5. M.Sonka,V. Hlavac, R. Boyle, Image Processing, Analysis and Machine Vision, Vikas
Publishing House, 2001.
SAMPLE QUESTION (S)

Cognitive Int. Test 1 Int. Test 2 Assignment Test3 (%)
Remember
Level 25
(%) 20
(%) --
Understand 30 25 --
Apply 25 30 40
Analysis 20 25 60
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. List the 6 components of digital image processing system

2. Define image enhancement
3. Define image segmentation
4. State the lossy compression
5. List out the 3 color models
Understand
1. Interpret the process of image sampling and quantization

2. Summarize the fundamental steps in digital image processing
3. Represent RGB color model
4. Explain the properties of 2D Discrete Fourier Transform
3
176
5. Illustrate contrast stretching transformation function to increase the dynamic range of the gray levels in the
image
Apply
1. Consider the image segment shown below. Compute N4, N8 distances
3 1 2 1 (q)
2 2 0 2
1 2 1 1
(p) 1 0 1 2
2. Compute histogram equalization for a given 8x8 image
3. Compute the efficiency of Huffman Coding for the given symbols
Symbol a1 a2 a3 a4 a5 a6
Probability 0.1 0.4 0.06 0.1 0.04 0.3
Implement segmentation on given image using bimodal thresholding
4. Show that a linear, spatially –invariant degradation system with additive noise can be modeled in the spatial
domain as the convolution of the degradation function with an image followed by addition of noise
Analyze
1. Differentiate between image enhancement and restoration in terms of processing and applications
2. Compare lossy and lossless compression methods in terms of entropy, applications and transforms used
3. Is image enhancement a subjective approach? Justify your answer
4. Is lossless compression preferred to lossy compression? Justify your answer
5. Differentiate region based segmentation and thresholding based segmentation in terms of approach and
applications
177
16IT010 Computer Forensics (Elective VI)

3103
Course Outcomes
1. Understand the real time computer forensic issue.
2. Understand data recovery, forensics lab certification and physical requirements.
3. Identify different storage formats for data acquisition.
4. Analyze various data acquisition tools for collecting digital evidence.
5. Apply various strategies to secure digital evidences.
6. Identify and apply various computer forensics tools to solve the computer forensic cases.
CO-PO Mapping:
COs PO2 PO3 PO5
1 1 1 2
2 2 1 2
3 2 1 2
4 2 2 2
5 2 2 3
6 2 2 3
UNIT I
Computer Forensics and Investigations & Investor’s Office and Laboratory
Understanding Computer Forensics, Preparing for Computer Investigations, Taking A Systematic Approach,
Procedure for Corporate High-Tech Investigations, Understanding Data Recovery Workstations and
Software,Understanding Forensics Lab Certification Requirements, Determining the Physical Requirements for a
Computer Forensics Lab, Selecting a Basic Forensic Workstation.
Nature and scope of cybercrime-categories of cybercrime, social engineering
11+4
UNIT II
Data Acquisition& Processing Crime and Incident Scenes
Understanding Storage Formats for Digital Evidence, Determining the Best Acquisition Method, Contingency
Planning for Image Acquisitions, Using Acquisition Tools, Validating Data Acquisition, Performing RAID Data
Acquisition, Using Remote Network Acquisition Tools, Using Other Forensics Acquisition Tools.
Open source data acquisition tools
11+4
UNIT III
Digital Evidence
Identifying Digital Evidence, Collecting the Evidence in Private-Sector Incident Scenes, Processing law
Enforcement Crime Scenes, Preparing for a Search, Securing a Computer Incident or Crime Scene, Sizing Digital
evidence at the Scene, Storing Digital evidence, obtaining a Digital Hash.
Selecting a basic forensic work station, methodologies to store digital evidence
12+3
UNIT IV
Current Computer Forensics Tools
Evaluating Computer Forensics Toll Needs, Computer Forensics Software Tools, Computer Forensics Hardware
Tools, Validating and Testing Forensics Software.; Computer Forensics Analysis and Validation: Determining What
Data to Collect and Analyze, Validating Forensic Data, Addressing Data-Hiding Techniques, Performing Remote
Acquisition.
Digital evidence handling procedures, Linux system forensics, windows system forensics
11+4
178
Total: 45+15 Hours

Textbook (s)
1. Nelson, Phillips Eninger, Steuart, Computer Forensics and Investigations, Cengage Learning, 4th Edition,
2009
2. Man Young Rhee, Internet Security: Cryptographic Principles, Algorithms and Protocols, Wiley
Publications, 2003
Reference (s)
1. John R.Vacca, Computer Forensics, Cengage Learning, 2005
2. MarjieT.Britz, Computer Forensics and Cyber Crime: An Introduction, 3rdEd, Prentice Hall, 2013
SAMPLE QUESTION (S)

Int. Test 1 Int. Test 2
Cognitive Level Assignment Test4 (%)
(%) (%)
Remember 30 20 10
Understand 35 30 10
Apply 30 30 10
Analyze 15 20 30
Evaluate -- -- 20
Create -- -- 20
Total (%) 100 100 100
Remember
1. List the various disk storage formats
2. List some digital evidences
3. List some tools used for digital evidences
4. List different type of compression methods.
Understand
1. Explain RAID Data Acquisition
2. Explain Identification of Digital Evidence,
3. Write about Locating and Recovering Graphics
4. Discuss about Mobile Device Forensics
Apply
1. Apply any different digital forensics tool to create OS image.
2. Apply different networking tools to collect evidences.
Analyze
1. Compare different digital forensic open source tools to select a suitable tool which identifies hidden data.
Evaluate
1. Evaluate the performance of dd and dfcldd LINUX commands
2. Evaluate the performance of Widows based tools when compared with LINUX
Create
1. Use any open source tool to create ISO image of a disk.
4
179
16IT011 E&M-Commerce (Elective VI)

3103
Course Outcomes
1. Identify E – commerce principles in market place.
2. Understand different business models for e-commerce
3. Identify M – commerce principles to various business domains
4. Understand the Framework Of Mobile Commerce
5. Get an exposure to current technological advancements in M-commerce.
6. Analyze security issues in E – commerce business models.
COs–POs Mapping
COs PO5 PO6
1 1 3
2 2 3
3 1 3
4 3 2
5 3 3
6 2 3
Unit I
Fundamentals of E-Commerce
Introduction -The e-commerce environment - The e-commerce marketplace -Focus on portals,
Location of trading in the marketplace - Commercial arrangement for transactions - Focus on
auctions - Business models for e-commerce - Revenue models - Focus on internet start-up
companies - the dot-com - E-commerce versus E-business.
E-Business models-Role of Internet
10+5 Hours
Unit II
MOBILE COMMERCE
Introduction – Infrastructure Of M– Commerce – Types Of Mobile Commerce Services –
Technologies Of Wireless Business – Benefits And Limitations, Support, Mobile Marketing &
Advertisement, Non–Internet Applications In M– Commerce – Wireless/Wired Commerce
Comparisons
Internet Security standards -E-commerce ethics 12+4 Hours
Unit III
MOBILE COMMERCE: TECHNOLOGY
A Framework For The Study Of Mobile Commerce – NTT Docomo’s I– Mode – Wireless Devices For
Mobile Commerce – Towards A Classification Framework For Mobile Location Based Services –
Wireless Personal And Local Area Networks –The Impact Of Technology Advances On Strategy
Formulation In Mobile Communications Networks
M-commerce application
13+3 Hours
180
UNIT-IV
Security in E&M-Commerce
Electronic payment systems-Digital Token-Based-Smart Cards-Credit Cards-Risks in Electronic Payment systems.
New kind of payments:E-Wallet,Paytm,paypal. Inter Organizational Commerce-EDI-EDI Implementation-Value
added networks. Focus on security design for e-business: Managing computer viruses,Controlling information
service usage,Monitoring of electronic communications, E-mail management,Hacking,Secure e-commerce
transactions,Approaches to developing secure systems,Current approaches to e-commerce security and Reassuring
the customer.
Security Risks in M-Commerce 10+3 Hours
Total: 45+15 Hours
Textbook(s)
1. Dave Chaffey, “E-Business and E-Commerce Management”, Third Edition, 2009, Pearson Education
2. Dr.Pandey , Saurabh Shukla E-commerce and Mobile commerce Technologies , Sultan chand ,2011
3. Kalakata, Whinston, Frontiers of electronic commerce, Pearson, 2006.
Reference(s)
1. Brian E. Mennecke, Troy J. Strader, “Mobile Commerce: Technology, Theory and Applications”, Idea
Group Inc., IRM press
2. Hendry Chan, Raymond Lee, Tharam Dillon-EllizabethChang, E-Commerce fundamentals and applications,
John Wiley, 2001
3. S.Jaiswal, Galgotia,E-Commerce, 2000
SAMPLE QUESTION (S)

Remember 40 40 --
Understand 50 50 --
Apply 10 10 70
Analyze -- -- 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define E-commerce
2. What is EDI
3. State the approaches of Supply chain management
4. List the factors Digital Video electronic Commerce
Understand
1. Demonstrate mercantile models.
2. Illustrate Electronic payment systems
5. InterpretAdvertising models for marketing
Analyze
1. Distinguish Desktop video processing and desktop video conferencing
2. Categorize advertising models
3. Analyze Commerce Catalogue
5
181
16IT504 Cloud Computing (Elective VI)

3103
Course Outcomes
1. Interpret the main concepts, key technologies, strengths, and limitations of cloud computing and the
possible applications for state-of-the-art cloud computing
2. Illustrate various problems and evaluate related cloud computing solutions.
3. Apply the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public cloud,
private cloud and hybrid cloud to different problems.
4. Analyze cloud provider for a defined environment and to a specific platform in a cost effective way.
5. Analyze case studies to derive the best practice model to apply when developing and deploying cloud based
applications
6. Build a virtual machine with a machine image
COs–POs Mapping
COs PO3 PO5 PO6
1 3 3 3
2 3 3 3
3 2 3 3
4 2 3 3
5 2 3 3
6 2 3 3
UNIT I
Cloud Computing
Introduction, SOA,Cloud Application Architectures, Value of Cloud Computing, Cloud Infrastructure models,
Scaling a Cloud Infrastructure, Capacity Planning, Cloud Scale.
Beyond the Syllabus: Tata Cloud, Salesforce.com
12 +4
UNIT II
Virtualization & Design
Virtual machine Implementation Levels of Virtualization, Virtualization Structures/Tools and Mechanisms,
Virtualization of CPU, Memory, and I/O Devices, Virtual Clusters and Resource Management, Virtualization for
Data-Center Automation, Cloud centers in detail: Comparing approaches, Xen, Eucalyptus, Cloud Stack, Open
Stack, Web Application Design, Machine Image Design, Privacy Design, Database Management,
Beyond the Syllabus: VMware, KVM.
13+4
UNIT III
Security &Defining Clouds for the Enterprise
Data Security, Network Security, Host Security, Compromise Response. Storage-as-a-Service, Database-as-a-
Service, Information-as-a-Service, Process-as-a-Service, Application-as-a-Service, Platform-as-a-Service,
Integration-as-a-Service, and Security as-Service.
Requirements for modern data centers-high availability and Service Orientated-Infrastructures (SOI). Modern data
center use case studies.
10 +4
182
UNIT IV
Disaster Recovery& Case Study
Disaster Recovery, Planning, Cloud Disaster Management, Types of Clouds–Eucalyptus, Amazon.
Microsoft Azure , IBM Bluemix
10 +3
Total: 45+15 Hours
Textbook (s)
1. George Reese, Cloud Application Architectures, 1st Edition O’Reilly Media, 2009
2. Ronald L.Krutz and Russell Dean Vines, Cloud Security, 1st Edition, Wiley Publishing, 2010
Reference (s)
1. Michael Miller, Cloud Computing-Web Based Applications that change the way you work and collaborate
online, 1st Edition, Pearson Education, Publishing, 2011
2. Kai Hwang, Geoffrey C Fox and .Jack J.Dongarra, Distributed & Cloud Computing from Parallel
Processing to the Internet of Things , 1st Edition, MK Publishing, 2010
3. David S Linthicum, Cloud Computing and SOA Convergence in Your Enterprise: A Step-by-Step Guide,
1st Edition, Addison-Wesley, 2009
SAMPLE QUESTION (S)

Level (%) (%)
Remember 40 45 --
Understand 40 45 --
Apply 20 10 90
Analyze -- -- 10
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Define Cloud Computing
2. List types of virtualization
3. Define proactive scaling
4. What is CIA Triad?
Understand
1. Explain different cloud Infrastructure models
2. Explain different levels of virtualization
3. Explain about cloud Network security in detail.
4. Explain about Recovery Point Objective.
Apply
1. Explain any IaaS service provided by Amazon
6
183
2. What is cloud Stack?

3. How disaster recovery planning can be done
4. How Web Application Design is used in designing cloud applications
Analyze
1. Compare cloud center and service infrastructure.
2. Analyze different cloud services provided by Amazon
3. With neat diagram explain the functioning of Xen Architecture.
4. List and explain various cloud service providers risks.
184
16CS010 Multimedia Databases (Elective VI)

3103
Course Outcomes
1. Analyse the issues and Apply techniques for building effective Multimedia Database Systems
2. Implement temporal database design techniques on past and current data
3. Apply Spatial Query Languages on Spatial databases
4. Analyze Text Types and Document Retrievals and Image DBs with Relations and R-Tree
5. Apply Handling techniques of Audio and video Databases
6. Apply Query Languages for Retrieving Multimedia Data with Multidimensional Data structures
COs–POs Mappings
COs PO3 PO5 PO6
1 3 2 2
2 3 2 1
3 2 2 2
4 2 2 2
5 2 2 2
6 3 2 2
UNIT I
MULTIMEDIA DATABASE DESIGN ISSUES
Data types – Indexing and Retrieval of Audio, Image and Video – Techniques and Data Structures for efficient
Multimedia Fundamental Concepts – Defining, Querying and modifying State Tables - Transaction-Time State
Tables - Bitemporal Tables - Temporal Database Design Introduction to Spatial Databases – Spatial objects –
Constraint Data Model – Spatial Access Methods , Spatial Query Languages: Extending the SQL for spatial data
Examples of queries that emphasis spatial data.
12+4
UNIT II
TEXT/DOCUMENT DATABASES
Text/Document Databases - Precision and Recall - Stop Lists - Word Stems and Frequency Tables - Latent Semantic
Indexing - TV-Trees - Other Retrieval Techniques. Image Databases - Raw Images - Compressed Image
Representations - Similarity-Based Retrieval - Alternative Image DB Paradigms - Representing Image DBs with
Relations - Representing Image DBs with R-Trees.
Retrieving Images By Spatial Layout - Implementations.
12+4
UNIT III
AUDIO AND VIDEO DATABASES
Audio Databases - A General Model of Audio Data - Capturing Audio Content through Discrete Transformation -
Indexing Audio Data. Video Databases - Organizing Content of a Single Video - Querying Content of Video
Libraries.
Video Segmentation
11+3
UNIT IV
MULTIMEDIA DATABASE ARCHITECTURE
Design and Architecture of a Multimedia Database - Organizing Multimedia Data Based on The Principle of
Uniformity - Media Abstractions - Query Languages for Retrieving Multimedia Data. Multidimensional Data
Structures: k-d Trees - Point Quad trees - The MX-Quad tree - R-Trees
Comparison of Different Data Structures
10+4 Hours
185
Textbook(s)
1. Principles of Multimedia Database Systems, V.S. Subrahmanian, Elsevier(Morgan Kauffman).Reprint
2011.
2. Guojun Lu, "Multimedia Database Management Systems”, Artech House Publishers
Reference(s)
1. Spatial Databases, Shashi Shekhar, Sanjiv Chawla, Pearson Education
2. Multimedia Database Systems, Prabhakaram, Springer
3. Philippe Rigaux, Michel O. Scholl, Agnes Voisard, "Spatial Databases: With Application to
GIS”, Morgan Kaufmann Publisher.
4. http://srmnotes.weebly.com/cs1138-multimedia-database.html.
SAMPLE QUESTION (S)

Remember 30 20 10
Understand 35 30 30
Apply 30 30 20
Analyze 15 20 20
Evaluate -- 10
Create -- -- 10
Total (%) 100 100 100
Remember
1. List the various issues of multimedia databases
2. Write the different Word Stems
3. Define Spatial Databases
4. List the steps to design a multimedia for real time application
Understand
1. Explain Multimedia Data Based on The Principle of Uniformity.
2. Explain Representing Image DBs with R-Trees
3. Write about Video Segmentation
4. Discuss about Video Databases
Apply
1. Compare k-d Trees with Point Quad trees and which one is efficient?
2. Compare and contrast Transaction-Time State Tables – Bi temporal Tables
Analyze
1. Compare Spatial Access Methods with respect to Spatial Query Languages
2. How the Query Languages is plays role for Retrieving Multimedia Data
7
186
16CS011 Wireless Adhoc Network (Elective VI)
3103
Course Outcomes
1. Understand the various challenging issues of wireless Ad hoc networks
2. Apply the MAC protocols using reservation and scheduling mechanism
3. Apply the routing protocols and transport layer protocol using various TCS mechanism in wireless Ad hoc
networks
4. Understand the issues of MAC and network layer solution to provide quality of service
5. Understand the significances of various battery management schemes for wireless Ad hoc networks
6. Analyze the security requirements and secure routing in wireless Ad hoc networks
COs–POs Mapping
COs PO3 PO5 PO6
1 2 3 1
2 3 2 2
3 3 3 2
4 2 3 1
5 1 3 1
6 2 3 2
UNIT I
Wireless Ad Hoc Networks: Introduction, Properties, applications, limitations, Issues in Ad Hoc Wireless
Networks, Ad Hoc Wireless Internet. MAC Protocols: Introduction, Issues in Designing a MAC protocol for Ad
Hoc Wireless Networks, Design goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications of MAC
Protocols, Contention - Based Protocols, Contention - Based Protocols with reservation Mechanisms.
Contention – Based MAC Protocols with Scheduling Mechanisms
15
UNIT II
Routing Protocols: Introduction, Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks,
Classification of Routing Protocols, Proactive/ Table–Driven Routing Protocols, Reactive/ On–Demand Routing
Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols, Power – Aware Routing Protocols. Transport
Layer: Introduction, Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks, Design Goals
of a Transport Layer Protocol for Ad Hoc Wireless Networks, Classification of Transport Layer Solutions, TCP
Over Ad Hoc Wireless Networks.
Other Transport Layer Protocol for Ad Hoc Wireless Networks.
16
UNIT III
Quality of Service: Introduction, Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks,
Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions, QoS Frameworks for Ad Hoc
Wireless Networks. Energy Management: Introduction, Need for Energy Management in Ad Hoc Wireless
Networks, Classification of Ad Hoc Wireless Networks, Battery Management Schemes, Transmission Power
Management Schemes.
System Power Management Schemes.
14
UNIT IV
Security Protocols: Network Security Requirements, Issues and Challenges in Security Provisioning, Network
Security Attacks, Key Management, Secure Routing in Ad Hoc Wireless Networks.
187
Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data Gathering,
Location Discovery.
Quality of a Sensor Network, Evolving Standards, Other Issues
15
Total: 45+15 Hours
Textbook(s)
1. Ad Hoc Wireless Networks: Architectures and Protocols - C. Siva Ram Murthy and B.S.Manoj, 2004, PHI.
2. Wireless Ad- hoc and Sensor Networks: Protocols, Performance and Control - Jagannathan Sarangapani,
CRC Press
Reference(s)
1. Wireless Sensor Networks - C. S. Raghavendra, Krishna M. Sivalingam, 2004, Springer.
2. Ad- Hoc Mobile Wireless Networks: Protocols & Systems, C.K. Toh ,First ed. Pearson Education
SAMPLE QUESTION (S)

Remember 40 50 20
Understand 35 30 20
Apply 25 20 60
Analyze -- -- --
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
1. Find out the major significance of cellular wireless networks and Ad hoc wireless networks.
2. List few latest application systems of Ad hoc wireless networks.
3. Identify the challenging issues in Ad hoc network configuration and maintenance.
4. Show the proactive steps to solve the hidden terminal problem.
5. List the transmission impediments of wireless channel.
6. List the issues that affect the design deployment and performance of ad hoc wireless system.
7. List the benefits when deployment of a commercial ad hoc wireless networks compared to wired network
8. Write the advantages of hybrid wireless networks.
9. Define Scalability.
10. Write the design goals of MAC protocol for adhoc networks.
11. Describe the issues of MAC protocol for ad hoc networks in brief.
12. Show the classifications of MAC protocol.
13. Identify the effects of exposed terminal problem in wireless networks.
14. Relate the advantages of directional antennas of MMAC over MACAW.
15. Name the mechanisms used in MAC layer.
16. List any two specific requirement of real- time MAC protocol.
17. Give the classification of contention based protocol.
18. State the major challenges in designing routing protocols.
19. List the characteristics of a routing protocol for ad hoc wireless networks.
20. Mention any four qualities of service metrics that are used to evaluate the performance of the network.
21. List the types of hybrid routing protocols.
8
188
22. Draw the structure of layered architecture.

23. Find out the components of WSN.
24. Define LEACH.
Understand
1. Summarize the issues that affect the deployment and performance of ad hoc wireless system.
2. Outline the benefits when deployment of a commercial ad hoc wireless networks compared to wired
network.
3. Compare Ad-hoc Networks and Wireless LAN.
4. Compare the efficiency of the packet queuing mechanism adopted in MACA and MACAW.
5. Relate contention based protocols with reservation mechanism and contention based protocols with
scheduling mechanism by means of packet delivery, reception and acknowledgement ratio.
6. Describe the design strategies of MACAW protocol.
7. Illustrate various steps involved in five phase reservation protocol with its frame format.
8. Compare the differences of Ad hoc on demand Distance vector routing protocol (AODV) and dynamic
sequence routing protocol (DSRP).
9. Identify any four reasons that lead to the quick power drain of nodes in mobile ad hoc network.
10. Explain the sensor network architecture with a suitable illustration.
Apply
1. Calculate th e maximum achievable da t a rate over a 9 KHz channel whose signal to noise ratio is 20
dB.
2. Think of four scenarios where wireless networks can replace wired networks in order to improve the
efficiency of people at their workplace. Briefly describe how in each case a wireless network will fit
the role better than a wired network.
3. Determine the transfer time of a 22 KB file with a mobile data network (a) with a transmission rate
of 10 Kbps and (b) repeat the same for 802.11 WLAN operating at 2 Mbps. (c) What is the length
of the file that WLAN can carry in the time that mobile data service carried a 20 KB file? (d) What
do you infer from the answers to the above questions?
4. Assume that in one slot in Bluetooth 256 bits of payload could be transmitted. How many slots are
needed if the payload size is (a) 512 bits, (b) 728 bits, and (c) 1,024 bits. Assume that the non -
payload portions do not change.
5. With reference to the discussion on scatternets, illustrate the trade-off of synchronization and
bandwidth using a timing diagram. (Hint: Consider the case when a Bluetooth device acts as a
master in one piconet and as a slave in another.)
6. Calculate the probability of data packet collision in the MACA protocol. Assume that Tc is the
control packet transmission and propagation delay, Tw is the optimal maximum back-off time, Î² is
the percentage of ready nodes, and R is the transmission range of each node.
Analyze
1. Discuss the deployment scenarios for various HIPERLAN standards in the ETSI BRAN system.
2. Compare the EY-NPMA and the CSMA/CA mechanisms.
3. In the serial communications, the baud rate of transmission is specified. Legacy applications on Bluetooth
devices specify the baud rate. In the case of the old serial communications, the data rate is the specified
baud rate, but in the case of Bluetooth serial communications, it is not so. Why?
4. Identify and elaborate some of the important issues in pricing for multi-hop wireless communication.
5. Channel quality estimation can be done both at the sender and the receiver. Which is more advantageous?
Why?
6. Compare an ad hoc network and a cellular network with respect to bandwidth usage and cost effectiveness.
7. Compare the pros and cons of using scheduling-based MAC protocols over reservation- based MAC
protocols.
189
Evaluate
1. Consider the topology given in below to s imulate DSR, SSA, and ABR protocols for path
establishment from node 1 to node 10, find the paths found and the ratio of the number of Route Request
packets sent in the network. (Links labeled "U" refer to unstable ones.)
2.
3. Justify whether the LCC algorithm (when run consistently with node degrees or node IDs) give a
deterministic result? If so, prove the above fact. Otherwise, give a counter -example.
4. Critique on how content-based multicasting (CBM) could be advantageous or disadvantageous as far
as the bandwidth utilization of the network is concerned.
5. Discuss how network security requirements vary in the following application scenarios of ad hoc wireless
networks:
A. Home Network
B. Classroom Network
C. Military Network
D. Emergency Search and Rescue Network
6. Discuss how security provisioning in ad hoc wireless networks differs from that in infrastructure-based
networks?
190
Department of Computer Science and Engineering, GMRIT| Curriculum | Regulation 2016
16IT012 Data Analytics I (Contemporary Course)

3103
Course Outcomes
1. Identify R
2. Make use of function R
3. Summarize Data
4. Work on Probability.
5. Interpret NOSQL
6. Solve Engineering Issues and Create Business Models
COs–POs Mapping
COs PO3 PO5 PO6
1 2 2 2
2 3 3 3
3 2 3 3
4 2 2 2
5 2 3 2
6 1 2 2

Unit I
Introduction to Analytics and R Programming
Introduction to Big data and Data Analytics, Knowing language R, Using R as calculator, understanding
components of R, Reading database using R, Importing & Exporting CSV, Working on Variables, Outliers and
Missing Data treatment, Combining Data sets in R, Discuss Functions and Loops.
Scripts-Documenting, commenting & sharing code

(12+3) Hours
Unit II
Summarizing Data & Revisiting Probability
Summary Statistics-Summarizing data with R, Probability, Expected Value, Random & Bivariate Random
Variables, Probability Distribution, Normal Distribution, Central Limit Theorem, Random Walk.
Visualizing-3D plotting,
(10+4) Hours
Unit III
SQL using R, Correlation and Regression Analysis
NO SQL, The Benefits of NOSQL, NOSQL Vs SQL Summary, Excel and R integration with R Connector Read
Excel Spreadsheet I R.
Basic Regression Analysis,Regression residuals, Correlation, Heteroscedasticity, Autocorrelation
&Multicollinearity, Introduction to Multiple Regression, Dummy Variables
Time-series Analysis
(13+4) Hours
Unit IV
Understanding Verticals and Requirements Gathering
Understanding the business problem related to engineering, identify the critical issues. Set business objectives,
Requirement gathering: Gather All the Data related to Business Objective.
191
Understand systems viz engineering design, manufacturing, automotive industries, tech system
(10+4) Hours
Total: (45+15) Hours
Textbook (s)
Steven Murray, Learn R, Kindle 1st Edition, 2013.

1.
2.
Norman Matloff, The Art of R Programming: A Tour of Statistical Software Design, 1st edition, Kindle
Edition, 2014
3. Mark Gardener, Beginning R-The Statistical Programming Language, 2nd Edition, John Wiley & Sons, Inc.,
2012.
4. NASSCOM Material
Reference (s)
1. Mark Gardener ,Beginning R: The Statistical Programming Language ,1st Edition, John Wily & sons,
2012
2. Emmanuel Paradis , R for Beginners, 1st Edition, kindle 2012
3. https://bigdatauniversity.com/courses/introduction-to-data-analysis-using-r/
4. http://www.r-tutor.com/elementary-statistics
SAMPLE QUESTION (S)

Remember 30 20 --
Understand 40 40 --
Apply 30 30 60
Analyze - 10 20
Evaluate - - 10
Create - - 10
Total (%) 100 100 100
Remember
1. What is Ordinary least squares(OLS)?
2. What is Dummy Variables?
3. What are 2 ways of looping in R? Give an Example?
4. How to find summary statistics in R?
Understand
1. Explain about Big data and Data Analytics?
2. Explain Components of R with Example?
3. Explain about NoSQL? What are the types of NoSQL tools based on Data models
4. Which of the following is not a functionality of R- Linear modeling and nonlinear modeling
Apply
1. How do you read excel dataset in R
2. Explain the process of how to connect data with R?
3. Relate between the Rbind and Cbind
1
192
Analyze
1. How to interpret data to make it useful for business?
2. What are various steps involved organizational decision making?
3. How to find summary statistics in R
Evaluate
1. Define Knowing the language R? Justify using R as Calculator with example?
2. Explain about Regression Residuals with example?
4. Define Probability Distribution? Explain various Probability Distribution curves?
Create
1. Design the different Visualization models for Twitter data?
2. Create the various components of descriptive statistics? Explain with suitable example
193
16IT013 Data Analytics-II (Contemporary Course)

3104
Course Outcomes
1. Design data architecture and familiarize various data sources and data management
2: Identify the export of data sources
3: Know the basics of Big Data Tools
4: Identify the standard reporting and compliance, decision Models
5: Identify the outlier and elimination
6: Prepare data for analysis.
COs–POs) Mapping
COs PO3 PO5 PO6 PO7
1 3 1 1 2
2 1 3 2 3
3 3 1 2 1
4 3 1 3 3
5 3 3 2 1
6 3 3 3 2
Unit-1 (10+3)
Data Management: Sources of Big data, Introduction to Data Management and importance of Data
management,Functions of Data Management, Data Management Goals, Data Management Principles, Data
Management Issues, Design Data Architecture and manage the Data for analysis, understand various sources of the
Data, Export all the Data onto the cloud.
The relationship between data management and enterprise architecture
Unit – 2 (12+4)
Big Data Tools: Introduction to the Big Data tools like spark, Scala, Impala, Identify gaps in the data and follow-up
for decision making: Missing data Imputation, Model based Techniques.
Big Data Analytics: Introduction to Big Data Analytics, Relational Database to Big data-Key Value store, Column
Oriented database, Document based database, Graph database, Overview of Hadoop, HDFS, MapReduce, Outlier
detection and elimination, Data preprocessing for the analysis.
Hadoop Clusters and the Hadoop Ecosystem
Unit – 3 (12+4)
Machine Learning Algorithms: Hypothesis testing and Determining the multiple analytical methodologies:
Supervised Learning, Unsupervised Learning, Reinforcement Learning, Train model using statistical/machine
learning algorithms, Test model, Sample for prediction, Explore the chosen algorithms for more accuracy
Overview of neural networks
Unint-4 (11+4)
194
Data Visualization: Prepare the data for visualization, Draw insights out of the visualization tool, Data
Visualization in Tablue: Extract the data, the workspace, Data Visualization.
Case Study: Exploring Employee Attrition data in R
Total: 45+15 Hours

1. Text Books:
1. 1 Hadoop, The Definitive Guide, 4th Edition, O”Reilly Publisher (Unit-2 )
2. NASSCOM Study material.
Reference Books:
SAMPLE QUESTION (S)

Remember 30 30 --
Understand 40 30 --
Apply 30 20 70
Analyze - 20 30
Evaluate - - --
Create - - --
Total (%) 100 100 100
Remember
1. Define Big data.
2. Define data analytics
3. Define No SQL
4. Define Machine Learning
Understand
1. Explain the functionalities of data management
2. Explain various sources of the data
3. What are the steps involved in Export job process in Amazon S3
4. What are the benefits of using spark, scala, and impala
5. what are the steps followed in machine learning algorithms
Apply
1. how you identify gaps in the data and what are the methods for reducing missing values in data set
2. write down the steps involved in data visualization in tableu
3.
Analyze
1. Which source of data is more reliable and why
2. What are the outliers and how do we detect them.
3. Why do we use data visualization and what is the role of tableu in data visualization
2
195
16IT014 Data Analytics-III (Contemporary Course)

4003
Course Outcomes
1. Describe the business processes involved in marketing and customer relationship management and explain
the role of analytical and predictive tools in these processes.
2. Analyze the import of predictive analytics on the organization
3. Implement data mining and machine learning techniques using a high-level programming.
4. design and analyze appropriate predictive models
5. Understand how best to apply Analytics methods and techniques in addressing strategic business problems
6. Conduct an in-depth analysis of a strategic business problems
COs–POs) Mapping
COs PO3 PO5 PO6
1 3 1 2
2 1 3 3
3 3 1 2
4 3 3 3
5 3 1 2
6 3 3 3

Unit – 1 12+3
Introduction to Predictive Analytics & Linear Regression
What and Why Analytics, Introduction to Tools and Environment, Application of Modelling in business, Databases
& Types of data and variables, Data modelling techniques, Missing Imputations etc.
Need for business modelling, Regression – concepts, Blue property –assumptions-Least Square Estimation,
Variable Rationalization, and model Building.
Introduction to Analytics and Analytics in Decision Making

Unit – 2 (10+4)
Logistic Regression, Objective Segmentation

Model Theory, Model fit statistics, Model conclusion, Analytics applications to Various business domain etc.
Regression Vs segmentation – Supervised and unsupervised Learning, Tree building – Regression, Classification,
Overfitting, Pruning and complexity, Multiple decision trees etc.
Unstructured data analysis
Unit – III 12+4

Time Series Methods/Forecasting, Feature Extraction:
ARIMA, Measures of forecast Accuracy, STL approach, Extract features from generated model as height, Average,
Energy etc and analyze for prediction.
Additive & Multiplicative models

Unit-IV
Working with documents 11+4
Standard operating procedures for documentation and knowledge sharing, Defining purpose and scope documents,
understanding structure of documents – case studies, articles, white papers, technical reports, minutes of meeting
196
etc. Style and forma, Intectual property and copyright . Document preparation tools – Visio, Power point, word,
excel etc. Version control, Accessing and updating corporate knowledge base, peer review and feed back.
Understanding the Word Object Model
Total: 45+15 Hours

2. Text Books:
Reference Books:
SAMPLE QUESTION (S)

Remember 30 30 --
Understand 40 30 --
Apply 30 20 70
Analyze - 20 30
Evaluate - - --
Create - - --
Total (%) 100 100 100
Remember
1. Define Predictive analytics
2. What is linear regression
3. Define imputation
4. What is ETL
5. Define time series
Understand
1. What are the steps involved in analysis of data
2. What is Ordinary Least square method? Explain with example
3. What is the difference between and ARMA and ARIMA? Explain with suitable example
4. What tools should use for documentation
Apply
4. How to impute missing data in R
5. What are the various methods of creating a decision tree
6. Write a procedure for creating diagrams in Visio
Analyze
1. Write the steps for preparing case study
2. Write a procedure creating flowcharts and organization charts in Visio
3
197
16CS013 Security Analyst II (Contemporary Course)

Prescribed by NASSCOM
4003
Course Outcomes:
At the end of the course students will be able to:
1. Suggest appropriatesecurity metrics used for individual/organization
2. Implement various security audit used to find vulnerabilities/threats.
3. Implementation of various vulnerability management methods.
4. Implementation of configuration reviews.
5. Propose and implement appropriate security policy for individual/organization.
COs–POs Mapping
COs PO1 PO2 PO4 PO5
1 2 3
2 1 3
3 3 2
4 1 3
5 1 3

UNIT I: INTRODUCTION (11+4)
Hours
Introduction to security Metrics, Characteristics of good metrics,Categories/Classification of Security
Metrics:Classifications by different organizations,A sample list of metrics, Using Security Metrics, Development
Process of the Metrics , Metrics and Reporting, Designing information security measurement Systems. Case
studies:Indicators of Compromise,NIST sample security metrics.
UNIT II (12+4)
Hours
Introduction to Security Audit: Definition and Need for security audit, Scope of an audit,Audit Types & Phases,
Audit methodology,AuditTasks,post auditing actions and reporting, case studies:Firewall Security Auditing,IDS
Security Auditing and Social Engineering Auditing.
UNIT – III: (10+3)

Hours
Vulnerability Management: Introduction to vulnerability management, Threats and
Vulnerabilities,VulnerabilityScanning,Information Security Assessments,Vulnerability Assessment
Methodology,Patch Management, reporting,casestudies:VulnerabilityScanning&Assessment
UNIT –IV: (12 +4)

Hours
Configuration Reviews: Configuration Management, Organizational Security Configuration management Policy,
Identify Security configuration management Tools,Implementing secure configurations,Unauthorized Access to
Configuration Stores,
Total: 45+15
Textbook (s)
1. NASSCOM Study Material
Reference (s)
198
SAMPLE QUESTION (S)

Remember 25 10 --
Understand 35 30 20
Apply 20 20 40
Total (%) 100 100 100
Remember
1. List the various security metrics
2. List advantages of security audit
3. Define Vulnerability.
Understand
1. Explain need of configurations
3. Write about NIST sample metrics
4. Discuss about vulnerability scanning.
Apply
1. Apply any auditing tool to perform security audit.
2. Apply different network scanning tools to collect vulnerable information.
Analyze
1. Analyze log files of IDS&IPS tools to find level of risk.
4
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills Pertaining to this course
199
16CS014 Security Analyst III(Contemporary Course)

Prescribed by NASSCOM
4003
Course Outcomes:
At the end of the course students will be able to:
1. Suggest appropriate security management system for individual/organization
2. Outline various techniques for configuring network devices.
3. Explain various techniques for configuring router.
4. Examine different information security Incident management methods.
5. Investigate various data backup methods & malicious code anomalies.
6. Asses suitable method to handle network security & malicious code incidents.
Program Outcomes:
PO 2:Identify, formulate, review research literature, and analyze complex engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences. (Problem
analysis)
PO 4: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. (Conduct investigations of
complex problems)
PO 5: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. (Modern tool
usage)
COs–POs Mapping
COs PO2 PO4 PO5
1 3
2 3
3 3 2
4 1 3
5 1 3
UNIT I: Managing Information Security Services (11+4) Hours

Information security management system standard(ISMS),Configuring Network Devices, Identifying unauthorized
Devices, Configuring Router, configuring modes- User EXEC/Privileged EXEC/Global Config/Interface
Config/Setup configuring.
UNIT II (12+4) Hours

Configuring router banner/Firewall/VPN server. Linux Network Configuration and Troubleshooting-
Commands:ifconfig,ifup,ifdown,ping,Traceroute,netstat,dig,nslookup,route,host,arp,ethtool,iwconfig,hostname and
system-config-network.
UNIT – III: (10+3) Hours

Information security Incident management & Data Backup
Information security Incident management overview-Handling-Response, Incident Response Roles and

Responsibilities, incident response process.
200
Data Backup introduction, Types of data Backup and its techniques, developing an effective data backup
strategy and plan, security policy for data backup procedure.
UNIT –IV: (12 +4) Hours

Handling Network Security Incidents:
Network Reconnaissance Incidents, Network Scanning Security incidents, Network attacks security incidents,
detecting DoS attack, strategies to prevent/stop a DoS incident.
Handling Malicious code incidents:
Incident Handling Preparation, Incident Prevention, Detection of Malicious code, Evidence Gathering and
handling, Eradication and recovery, Recommendations.
Textbook (s)
Reference (s)
SAMPLE QUESTION (S)
Remember 25 10 --
Understand 35 30 20
Apply 20 20 40
Total (%) 100 100 100
Remember
1. List the various security metrics
2. List advantages of security audit
3. Define Vulnerability.
Understand
1. Explain need of configurations
3. Write about NIST sample metrics
4. Discuss about vulnerability scanning.
Apply
1. Apply any auditing tool to perform security audit.
2. Apply different network scanning tools to collect vulnerable information.
Analyze
1. Analyze log files of IDS&IPS tools to find level of risk.
5
201
16IT016 Enterprise Application Development Using IBM RAD & Bluemix
4003
Course Outcomes
1. Master the fundamentals of website development, such as HTML5, Servlet,JSP with MVC Architecture
2. Use fundamental skills to maintain web server required to host a website
3. Build dynamic, database-driven web applications, such as use of a IBM RAD, to develop robust online
programs
4. Implement core concepts of database connectivity
5. Design websites using appropriate security principles, focusing specifically on the vulnerabilities inherent
in the common web implementation
6. Design, code, publish, deployment of web applications on IBM Bluemix
COs–POs Mapping
COs PO3 PO5 PO6 PO7
1 2 3 1 3
2 2 3 2 1
3 3 2 2 2
4 2 3 1 3
5 2 3 2 2
6 3 3 3 3
UNIT I: Introduction to JAVA EE Web component

Dynamic web project creation, Web component-Introduction to servlet, container- servlet API’s, Practical on servlet
life cycle, counter program-Service method practical, Servlet Context versus Config- Introduction of JSP,
Tags/implicit Object- Directives and Action Tag, Page Designing with RAD- Development Descriptor, Expression
Language- session Management: Cookie/HttpSession/URL Rewriting
Practicals on JSP tags ,Practicals on implicit objets 13+4 hours
UNIT II: JavaBeans and the Model-View-Controller Pattern

Model-View Controller- Java Server pages with java Beans-JDBC with database, Developing Dynamic Web
Application with logic & signup module with session- JSTL, servlet filter- Servlet Listener, Best Practices on server
side application- JDBC with database, Packing of web application.
Develop web applications with session, changing database configuration

10+3 hours
UNIT III: Introduction to Bluemix& Cloud computing overview
Consumption view- IaaS (Soft layer), PaaS(IBM Bluemix)- Buemix architecture, Overview and DashBoard-
Building an Application from Boilerplate in Bluemix UI- Deploying a Java Web app that uses the PostGreSQL
service with IBM Bluemix Eclipse tools- create a Dynamic web project exporting the war file and deploy from
Cloud Foundry
Development of Apps using Bluemix services- Registering Services in BluemixTM- Deploying a Nod.js
app that uses CloudantNoSQL DB- Demo Binding and Insertion of records- Build a Twitter influencer application
in Bluemix
202
Setup and installing- Eclipse and CD plugins, Jazz editor to deploy application toBluemix12+4 hours
UNIT IV: Development of Apps using Blue Mix

Development of Apps using Dev Ops Services on Blue Mix- Overview of Blue Mix DevOps Services- Importing
and deploying the application from DevOps- updating the application- Look for example (DAR)- Demonstrate
Weather Insights for a given location using deployed app on BlueMix
Demonstrate a Watson IOT climate control sample application deployment on Bluemix- Demonstrate
Watson Conversation API Service Integration with NodeJS UI- Deploy the app and showcase user Interaction with
Watson
Bluemix Services in Mobility & Big Data10+4 hours
Total: 45+15 Hours
Textbook (s)
1. IBM Career Education Course Material
Reference (s)
1. www.redbooks.ibm.com/redpapers/pdfs/redp5184.pdf
2. www.redbooks.ibm.com/redpapers/pdfs/redp5242.pdf
SAMPLE QUESTION (S)
Remember 30 30 20
Understand 20 20 20
Apply 20 20 35
Analyze 10 30 25
Evaluate - - -
Create - - -
Total (%) 100 100 100
Remember
1. Define Cloud Computing.
2. List Java web development Evolution
3. List JSP scripting elements
4. What is cloud foundry?
Understand
1. Differentiate between servlet context and Servlet config
2. Explain the components present in the URL
3. Explain all session management techniques
4. Explain different cloud service models
Apply
1. Demonstrate the process for war file deployment in the cloud.
2. How does bluemixstackupagaist AWS and Azure?
Analyze
1. Justify your answer .Which technique is used for Session management .
2. Deploy a Nod.js app that uses CloudantNoSQL DB
6
203
16IT017 IBM’s Big Data Analytics with Hadoop platform

4003
Course Outcomes
1. Identify the concept and challenges of big data and its existing technologies.
2. Understand Big Data and Hadoop ecosystem
3. Understand Hadoop Distributed File System (HDFS)
4. Design and implement of Hive and Sqoop scripts
5. Apply and handle MapReduce programs and Pig Scripts
6. UseBig SQL and Big R Programming
COs–POs Mapping
COs PO3 PO5 PO6 PO7
1 3 2 3 3
2 2 1 1 2
3 2 1 2 3
4 1 3 2 2
5 1 3 3 1
6 1 3 2 2
Unit I
Introduction to Hadoop & Big Data using IBM Infosphere Big Insights
Functions and features of Hadoop, Capabilities of Hadoop and HDFS, Administer HDFS, Big Data, , How Hadoop
solves the Big Data problem, IBM’s 4V’s, Hadoop ecosystem, Practical Questions
Linux Based Commands, The limitations of the existing solutions for Big Data problems, Types of Data.12+4 Hours
Unit II
Introduction to Sqoop, Sqoop Job & Hive
Import tables from RDBMS MYSQL FROM HDFS(HADOOP), Export data from HDFS TO RDBMS MYSQL,
Import particular columns of the table from RDBMS MYSQL TO HDFS, Import subset of tables RDBMS MYSQL
TO HDFS, Use of warehouse-dir in sqoop, Perform SQL queries in sqoop by using EVAL command, SQOOP
JOBS, Sqoop Job Incremental Import.
About Hive, Hive Components, Comparison with Traditional Database, Loading and Querying Data in Hive
Basic SQL Query Formation & Generation. 13+3 Hours
Unit III
Introduction to MapreduceProraming
Introduction to mapreduce Programing, Introduction to pig Latin language 11+3 Hours
Unit IV
Introduction of Big Data Programming & Big SQL
Introduction to Big Data Programming
Introduction to Big SQL , Big SQL Data Types, Big R overview 11+3 Hours
Total: 47+13 Hours
204
Textbook (s)
1. IBM CE - Essentials of Big Data with Hadoop using IBM InfoSphereBigInsights
2. IBM CE - Big Data Programming using IBM InfosphereBigInsights
Reference (s)
1. R. F. Gilberg, B. A.Forouzan, Data Structures A Pseudocode Approach with C, 2ndEdition, CENGAGE
Learning, 2005
2. S. Tanenbaum, Y. Langsam and M.J. Augenstein,Data Structures using C, Pearson Education, 1990
3. Seymour Lipschutz, Data Structures with C, Schaum Series, McGraw Hill Education, 2010
4. Horowitz, Sahni and Anderson-Freed, Fundamentals of Data Structures in C, 2ndEdition, Universities Press,
2008
5. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Pearson Education, 2002
SAMPLE QUESTION (S)

Remember 40 30 --
Understand 35 30 --
Apply 25 40 70
Analyze -- -- 10
Evaluate -- - 10
Create -- - 10
Total (%) 100 100 100
Remember
1. List theactive and passive namenodes
2. Does Apache Sqoop have a default database?
3. Define sqoop job
4. Abbreviate 3V’s
5. Give the syntax of orderby
6. Define Job Tracker
Understand
1. Explain the use of HDFS for applications having large data sets and not when there are a lot of small files?
2. Classify “HDFS Block” and an “Input Split”?
3. Illustrate the list all databases whose name starts with p.
4. Identify the procedure how the Namenode tackle Datanode failures
5. Represent Shuffling and Sorting in MapReduce?
Apply
1. On what concept the Hadoop framework needs to be applied? Name the port number for NameNode, Task
Tracker and Job Tracker and deploy the procedure how can you overwrite the replication factors in HDFS?
2. Demonstrate the statement “MapReduce chunks are handled by HDFS”.
3. Perform the following in Sqoop:
7
205
a. How do you fetch data which is the result of join between two tables ?.
b. How can you force sqoop to execute a free form Sql query only once and import the rows serially.
c. What are the basic differences between relational database and HDFS?
d. How to import only the updated rows form a table into HDFS using sqoop assuming the source has last
update timestamp details for each row?
Analyze
1. Start Pig Grunt in Hadoop/MapReduce mode.
Load records into a bag from:
/training/exercises/pig/input1.txt
The file contains two columns separated by a tab; be sure tocreate a schema where column one is of type
int and columntwo is of type charrarray.
Print the schema of the bag to screen.
Dump Records to the screen; your output should look like this:
(1,a)
(2,b)
(3,c)
(4,d)
Create another bag but limit the number of records to 2; print the bag to screen and Exit Pig Grunt.
2. Demonstrate speculative execution in Hadoop
3. Justify the role of Record Reader in Hadoop
Evaluate
1. Perform the following in Hive:

a. Start hive
b. Create a table called bookswith 3 columns that will be capable of storing data from
$/home/training/books.txt; Load data from books.txt(stored locally) into bookstable; bookstable should
have the following schema:(id INT, title STRING, publishDate STRING)
c. select record from bookstable with id of 2
d. create new table named purchasesby re-use existing HDFS location ‘/user/training/exercises/hive/ex1’;
purchasestable will have 3 columns:
(id INT, buyer STRING, purchaseDate STRING
e. select 5 rows from purchasestable
f. create books_purchasestable with the following schema
(id INT, title STRING, buyer STRING, purchaseDate STRING)
g. populate books_purchasestable by joining booksandpurchasestables via id column
h. select 10 records from books_purchasestable
i. drop books, purchasesandbooks_purchasestables
2. Determine the detailed procedure to debug Hadoop code
3. Conclude the need to run a Hadoop job with an output directory which is already present.
Create
1. Consider a Data Frame df1 and the test scores as
df1=>data.frame(students=c(“suresh”,”sandeep”,”rama”),Test=c(45,67,78)), Coding R as a query language
create slicing, dicing for the above data.
2. Conclude a procedure to reduce mapper output and not the reducer output
3. Generate a procedure to configure the replication factor in HDFS
206
16IT018 Foundation course in Security Identity and Access management

4003
Course Outcomes
1. Identify the need of ISIM in Organization.
2. Manage users, accounts and resources in Organization
3. Create, Manage and configure services, policies and workflows as per business requirements.
4. The requirement of IBM security Access manager in the Organization
5. Describe the purpose of junctions, enable web protection and auditing and tracking of users
6. Manage users groups and Policies
COs–POs Mapping
COs PO3 PO5 PO6 PO7
1 3 1 1
2 3 3 2 3
3 2 3 2
4 3 1 1 2
5 1 3 1 1
6 1 1 3 2

Unit I
Introduction to IBM Security Identity Manager 6.0, ISIM system Architecture , Deployment Architecture ,
Components of ISIM , Planning an ISIM Implementation , Identify the business requirement ,Security policy
,Topology Considerations for ISIM deployment , ISIM installation and configuration, Organization Management ,
Organization structure , Basic of Directory Server , User Management and role management , Separation of duty
policies , Role Modeling , Role engineering basic concepts , Role engineering tools, Identity feeds , Types of feeds ,
feeds creation and management 10+3 Hours
Unit II
Services and policies, Understanding services, Service selection policies, Identity policies, Provisioning resources,
Account provisioning for users, Configuring an entitlement, Provisioning policy join directives, Workflows,
Understanding workflows, Understanding notifications, Workflow elements, Approval requests, Access control,
Understanding Access Control items, Life Cycle Management , Auditing and Reporting
11+4 Hours
Unit III
IBM Security Access Manager for Web,Security Access Manager architecture,Understanding reverse proxy
concepts,Using the reverse proxy as a policy enforcer,Describing reverse proxy features,Using the Web Gateway
Appliance,Administration overview,Administering users,groups and domains,Managing ACLS and Protected object
policy,Importing and exporting from Policy Administration
11+4 Hours
Unit IV
Authentication Overview,Authentication methods,understanding Instances,understanding reverse proxy
junctions,using junction mapping table,using transparent junctions,using virtual host junctions,Creating HTTP
transformations,using Trust association interceptor,using WCP,Using logs ,audit and traces,Advanced topics,IBM
security Access Manager support
13+4 Hours
Total: 45+15 Hours
207
Textbook (s)
1. IBM Security Identity Manager 6 Basic Administration
2. IBM Security Access Manager Admin Guide
Reference (s)
 >https://www.ibm.com/support/knowledgecenter/en/SSRMWJ_6.0.0/com.ibm.isim.doc_6.0/ic-homepage.htm
 >http://www-01.ibm.com/support/docview.wss?uid=swg21689113
 >https://www-03.ibm.com/software/products/sl/access-mgr
 >http://www-01.ibm.com/support/docview.wss?uid=swg27046801
SAMPLE QUESTION (S)

Remember 25 10 --
Understand 35 30 20
Apply 20 20 40
Analyze -- -- 20
Evaluate -- -- 20
Total (%) 100 100 100
Remember
1. Explain ISIM deployment architecture in brief
2. List down the Types of users and brief it?
3. List down the types of identity feed?
Understand
1. What is provisioning, and list down the types?
2. What is workflow? Types of Workflow and explain design options ?
Apply
1. What is workflow? Types of Workflow and explain design options ?
2. Write down the steps for manager approval workflow?
Analyze
1.
What are the components of the organization tree in IBM Security Identity Manager ? explain with
examples
2. What is the need of reporting? How do we use Tivoli Common Reporting? Name the script name used to
configure.
Evaluate
1. Justify the security of roles in ISIM
Prove that the roles in ISIM cannot access other accounts without proper authentication
8
208

Syllabus PDF

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Syllabus PDF

Caricato da

Copyright:

Formati disponibili

GMRIT

Academic Regulations, Curriculum and Syllabi

Department of Computer Science and Engineering

Computer Science and Engineering (CSE)

(Affiliated to JNTUK, Kakinada and Accredited by NAAC ad NBA)

GMR Institute of Technology

1. Eligibility for Admission……………………………....................................................... iv

The Vision of GMRIT

 To be among the most preferred institutions for engineering and technological

The Mission of GMRIT

Academic Regulations for B. Tech. Programme*

1. Eligibility for Admission

b. Admission eligibility-Under Lateral Entry Scheme

2. Duration of the Programme

III. Computer Science and Engineering (CS)

a. Integrated Courses: Integrated courses are exclusively designed to provide a

4.1. Credit Distribution for Courses Offered

4.2. Structure of curriculum

a. Full Semester Internship (FSI) Model

A. Course Pattern for Four year Regular Programme (FSI)

VIII 4 (2 Compulsory + 2 Elective) 2 16

B. Course Pattern for Four Year Regular Programme (Non - FSI)

VIII 3 (2 Compulsory + 1 Elective) Project work 19

C. Course Pattern for Three Year Lateral Entry Programme (FSI)

VIII 4 (2 Compulsory + 2 Elective) 2 16

Total 24+4+1 Audit courses 10 + Term paper +Mini project+ 132

Internship report +CCEC +

VIII 3 (2 Compulsory + 1 Elective) Project work 19

4.3 Credit Break-up for Various Category of Courses

Total Theory Courses : 36 @ 3 credits each = 108

CCEC Activities : 2 @ 1 credits = 2

c. For three year lateral entry Programme (FSI)

Total Theory Courses : 24 @ 3 credits each = 72

d. For three year lateral entry Programme (Non FSI)

Total Theory Courses : 26 @ 3 credits each = 78

4.4 Division of Marks for Continuous and Semester End Assessment

Marks Marks for

Range of Percentage Letter Qualitative Grade

5.1 Continuous Assessment Pattern for all Courses

h. Full Semester Internship

On Site Assessment : 30 Marks

i. Co-Curricular and Extra Curricular (CCEC) Activities

j. Employability Skills (ES)

 Assessment for Aptitude skills

Assessment of Soft Skills

h. Industry Driven One Credit Courses

a) It is desirable for a candidate to put on 100% attendance in all the subjects.

Classification of degree will be as follows:

i. CGPA ≥ 7.5 : Degree with Distinction

e) Quick Supplementary Examination

9. Flexibility to Add or Drop Courses

10. Withdrawal from the Examination

a. s/he represents “she” and “he” both

11. Curriculum: The curriculum of all the UG Programmes is given below

1. To provide high-quality education in Computer Science Engineering to prepare the

Program Educational Objectives

PO 1: Apply the knowledge of mathematics, science, engineering fundamentals, and an

1. Choice based credit system

Department of Computer Science and Engineering

Contemporary Courses (CC)3

16HSX01 English Communication Skills I

COs – POs Mapping

Internal Assessment Pattern