Академический Документы
Профессиональный Документы
Культура Документы
2016
B. Tech.
Computer Science and Engineering
(4 Year Program)
2016
2016
Undergraduate Programmes
Contents
ii
GMR Institute of Technology (GMRIT) | Regulation 2016
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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.
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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.
v
GMR Institute of Technology (GMRIT) | Regulation 2016
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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
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
GMR Institute of Technology (GMRIT) | Regulation 2016
Total
Sem. No. of Theory Courses No. of Lab Courses
Credits
III 3 + Employability Skills+ CCEC 25
6 (5 Theory + 1 Integrated) 3+ CCEC Activities+ Employability
IV 25 + 1+1
Skills
Summer Internship (Audit course) 00
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
ix
GMR Institute of Technology (GMRIT) | Regulation 2016
D. Course Pattern for Three year Lateral Entry Programme (Non FSI)
Total
Sem. No. of Theory Courses No. of Lab Courses
Credits
III 3 + Employability Skills+ CCEC 25
6 (5 Theory + 1 Integrated)
3+ CCEC Activities+ Employability
IV 24 + 1+1
Skills
Summer Internship (Audit course) 00
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 24 + 1+1
Integrated + 2 Elective) Skills
VII 3 (1 Compulsory + 2 Elective) 2 13
x
GMR Institute of Technology (GMRIT) | Regulation 2016
xi
GMR Institute of Technology (GMRIT) | Regulation 2016
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:
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.
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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:
Preparation, Observation & Result : 10 Marks
Record : 05 Marks
Internal Test : 05 Marks
Viva – Voce : 05 Marks
With Mini Project (through Augmented Experiments):
Preparation, Observation & Result : 05 Marks
Record : 05 Marks
Internal Test : 05 Marks
Viva – Voce : 05 Marks
Augmented Experiment : 05 Marks
xiii
GMR Institute of Technology (GMRIT) | Regulation 2016
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
Continuous Assessment : 25 Marks
Distribution
Review 1 : 05 Marks
Review 2 : 05 Marks
Literature Survey : 05 Marks
Final Presentation : 05 Marks
g. Project
Continuous Assessment : 100 Marks
Distribution
Innovativeness of the Project : 05 Marks
Literature Survey : 10 Marks
Experimentation / Simulation : 20 Marks
Result Analysis : 05 Marks
Review 1 : 20 Marks
Review II : 20 Marks
Final Presentation : 10 Marks
Project Report : 10 Marks
xiv
GMR Institute of Technology (GMRIT) | Regulation 2016
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.
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.
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
GMR Institute of Technology (GMRIT) | Regulation 2016
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.
6. Attendance Requirements
7. Promotion Policies
xvi
GMR Institute of Technology (GMRIT) | Regulation 2016
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
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
GMR Institute of Technology (GMRIT) | Regulation 2016
(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
xviii
GMR Institute of Technology (GMRIT) | Regulation 2016
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
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)
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
GMR Institute of Technology (GMRIT) | Regulation 2016
General
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.
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
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
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
Program Outcomes
Engineering graduate will be able to
ii
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
CURRICULUM FEATURES
UNDER ACADEMIC REGULATION 2016
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, GMRIT | Curriculum | Regulations 2016
iv
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
Fifth Semester
Course Periods
No Course POs
Code L T P C
1 16IT404 Computer Networks 2, 3 3 1 - 3
2 16IT505 Object Oriented Analysis and Design 2, 3, 4, 5 3 - 2 4
3 16IT602 Artificial Intelligence 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
16CS510 Term Paper / Mini Project 2, 3, 4, 5, 8, 9, 10, 11, - - 3 2
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, 4, 7, PSO2 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 2, 3, 4, 5, 9 - - 3 2
2, 4. 8. 10. 12
16CS510 /
8 Mini Project / Term Paper 2, 3, 4, 5, 8, 9, 10, 11, - - 3 2
16CS509
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, 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
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
v
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
Total 9 3 - 19/16
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 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 2, 3, 5 3 1 - 3
6 16CS007 IoT for Engineering Applications 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 3, 5, 6 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
2
Student the who opt for FSI-16CS706 during 8th semester, have to register an additional course in
consultation with HoD during 7th semester
vi
Department of Computer Science and Engineering, GMRIT | Curriculum | Regulations 2016
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
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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.
1
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
2
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
1 3 2
2 3 2
3 3 2
4 3 2
5 3 2
6 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
1. B. S. Grewal, Higher Engineering Mathematics, 42nd Ed., Khanna Publishers, New Delhi, 2012
th
2. E. Kreyszig, Advanced Engineering Mathematics, 9 Ed., Wiley, 2012
th
3. R. K. Jain, S. R. K.Iyengar, Advanced Engineering Mathematics, 4 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
th
Mathematics, Volume-I, 12 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
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
4
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs PO1
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
6
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs PO1
1 3
2 3
3 3
4 3
5 3
6 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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)
th
1. Irving H. Shames and G. Krishna MohanaRao, Engineering Mechanics, 4 Ed., Pearson, 2006
2. R. K. Bansal, Engineering Mechanics, Laxmi Publications, 2004
Internal Assessment Pattern
4
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test (%)
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
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
9
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
11
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
6
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
12
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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)
List of Augmented Experiments7
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
7
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
13
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
8
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
15
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs PO10
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
17
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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+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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
th
4. Erwin Kreyszig, Advanced Engineering Mathematics, 9 Ed., Wiley, 2012
Internal Assessment Pattern
10
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test (%)
Remember 30 30 -
Understand 40 40 -
Apply 30 30 60
Analyze - - -
Evaluate -- -- 30
Create -- -- 10
Total (%) 100 100 100
Understand
1. If ( ) = , ∈ ℕ in the interval[− , ], then for what values of the Fourier series of ( ) contains only sine terms
2. Form the partial di fferential equation by eliminating arbit rary 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
3 x
y y0 Sin . If it is released from rest from this position, find the displacement y( x, t)
l
10
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
20
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs PO1
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
11
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
23
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
0
2. When a metal X (of reduction potential = 0.337V at 25 C) 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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs PO1
1 3
2 3
3 2
4 3
5 3
6 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
1. D. P. Kothari and I. J. Nagrath, Theory and Problems of Basic Electrical Engineering, 4 th Ed., PHI
Learning Private limited, 2013
nd
2. S. Ghosh, Fundamentals of Electrical & Electronics Engineering, 2 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)
rd
1. J. B. Gupta, Basic Electrical and Electronics Engineering, 3 Ed., S. K. Kataria & Sons, 2009
th
2. B. L. Theraja, Fundamentals of Electrical Engineering and Electronics, 5 Ed., S. Chand & Company
Ltd, 2013
st
3. K. Alice Mary and P.Ramana, Basic Electrical Engineering, 1 Ed., Winger Publications, 2013
4. Basic Electrical Engineering by K.Alice Mary and P.Ramana, Winger Publications, 1 st Edition, 2013
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
26
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
1 2 3
2 2 3
3 3 3
4 2
1 2
5 2 2
6 1 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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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, 6th Ed., Tata McGraw
Hill, 2008
2. A. Kaushik, C. P. Kaushik, Perspectives in Environmental Studies, 4 th Ed., New Age International
Publishers, 2008
3. H. S. Peavy, D. R. Rowe, G. Tchobanoglous, Environmental Engineering, 1st Ed., McGraw Hill, 1984
4. T. E. Graedel, B. R. Allenby, Industrial Ecology and Sustainable Engineering, 1 st Ed., Pearson
Publications, 2009
13
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
28
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
List of Experiments
14
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
29
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
30
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
15
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
31
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
32
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
16
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
33
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
34
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Linked Lists: Basic operations of singly, doubly and circular linked lists, implementation of stack and queue using
singly linked list
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.
Binary Search Trees: definition, basic operations of BST (Searching, Insertion and deletion)
35
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
37
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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: Hierarchical abstractions, Base class and subclass, subtype, substitutability, forms of inheritance-
specialization, specification, construction, extension, limitation, combination, Benefits of inheritance, super
keyword, final keyword with inheritance, polymorphism, abstract classes
Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, Member
access rules
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
Control Flow In Exceptions– JVM reaction to Exceptions– Inter Communication of Threads– Critical Factor in
Thread–Deadlock
39
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
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
2
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
40
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit I
Fundamentals of Computers & Basic Computer Organization and Design
Introduction to Digital Computers-Hardware and Software-Computer types-Functional units-Register transfer
language: 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 and the Memory System
Fixed Point Representation-floating Point Representation-addition and Subtraction-Multiplication Algorithms-
Division Algorithms-Floating Point Arithmetic Operations
Memory Hierarchy-Semiconductor RAM Memories-Read-only Memories-Cache Memories-Performance
considerations - Secondary Storage-Virtual Memories.
Decimal Arithmetic Unit & Operations- Error Detection code -Memory Management Hardware
12+4 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 - PDP and VAX Instruction Formats
11+3 Hours
Unit IV
Input-Output Organization and Pipeline Processing
42
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
43
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Evaluate
44
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
45
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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.
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test4 (%)
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
4
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
46
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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, Floating point number representation
Practical Components
1. Realization of Logic gates and verification of Truth tables
2. Realization of basic gates using Universal gates
3. Implementation of Switching function by using Logic 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
Practical Components
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
48
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
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
5
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
49
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
REMEMBER
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
EVALUATE
1. Design and build a counter that will go through the following sequence
50
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
6. 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?
7. 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.
8. 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.
9. Design a traffic light controller.
10. Design An Arithmetic-Logic Unit (ALU).
51
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
53
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
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
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
55
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
56
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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.
List of Augmented Experiments7
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
8. Attendance Management System
9. Medical Store Billing Management System
7
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
57
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
58
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
List of Augmented Experiments9
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
10. Hotel Management System
9
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
59
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
60
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Computer and Cyber Forensic Basics: Introduction to Computers, Computer History, Software, Hardware,
Classification, Computer Input-Output Devices, Windows, DOS Prompt Commands, Basic Computer Terminology,
Internet, Networking, Computer Storage, Cell Phone / Mobile Forensics, Computer Ethics and Application
Programs, Cyber Forensic Basics- Introduction to Cyber Forensics, Storage Fundamentals, File System Concepts,
Data Recovery, Operating System Software and Basic Terminology. Cyber Crimes and IT Laws: Introduction to
IT laws & Cyber Crimes – Internet, Hacking, Cracking, Viruses, Virus Attacks, Pornography, Software Piracy,
Intellectual property, Legal System of Information Technology, Social Engineering, Mail Bombs, Bug Exploits, and
Cyber Security, Introduction to Encase Forensic Edition, Forensic Tool Kit (FTK).
15 Hours
1. Chris Reed & John Angel, Computer Law, OUP, New York, (2007)
2. Justice Yatindra Singh, Cyber Laws, Universal Law Publishing Co, New Delhi, (2012)
3. Vasu Deva, Cyber Crimes and Law Enforcement, Commonwealth Publishers, New Delhi, (2003)
61
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Unit IV
62
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test7 (%)
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
Apply
7
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
63
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
64
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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.
The keyboard/ Display controller 8279 12+4 Hours
Total: 45 + 15 Hours
65
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Understand
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
Analyze
66
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Create
67
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
68
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test 8(%)
Remember 30 15 --
Understand 25 15 --
Apply 25 25 30
Analyze 20 25 40
Evaluate -- 10 30
Create -- 10 --
Total (%) 100 100 100
Remember
Understand
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
69
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
70
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
71
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Practical Components
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
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
Apply
9
Practical test should contain only questions related to Higher Order Thinking (HOT) Skills
72
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
73
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 –Kleen’s Theorem - Decision Algorithm
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 - Turing Machines as Enumerators;
Linear Bounded Automata 12+4 Hours
Unit IV
Undesirability and Complexity Classes
74
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Recursive Functions and Sets - Recursively Enumerable Sets - properties of Recursive and Recursively Enumerable
Languages - Rice’s Theorem - Post Correspondence Problem - Halting Problem -
Space and Time Complexity - P TIME - NP - P SPACE etc. - Polynomial Reducibility
P - NP - NP-Complete - and NP-Hard Problem
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, 2nd
Edition - 2006.
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
75
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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:
SA
AB
Ba/b/c
Analyze
Evaluate
76
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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.
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.
77
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
11+4 Hours
Total: 45+15 Hours
Textbook (s)
Reference (s)
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
78
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
79
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
List of Experiments
(For Laboratory examination–Minimum of 10 experiments)
Part-A
Part-B
Interfacing 8086 – Any 3 Experiments
1. 8251 – USART.
2. Traffic lights
3. Message Displays
4. Keyboard
5. Stepper Motor
6. DAC
12
Students shall opt any one of the Mini–Projects in addition to the regular experiments
80
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
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.
81
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
12
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
82
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
List of Experiments
1. Design the following static web pages required for a Training and placement cell web site. 1) Home Page
2) Login Page 3) Registration page
2. 4) Company Details Page 5) Alumni Details Page 6) Placement Staff Details Page
3. 7) Student personal Info Page 8) Student Academic Info page 9) Semester Wise Percentage & their
Aggregate page
5. Apply different font styles, font families, font colors and other formatting styles to the above static web
pages.
6. Install wamp server and tomcat server, access above developed static web pages using these servers.
7. 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.
8. Write a JSP/PHP to connect to the database, Insert the details of the student academic information with
student academic info page.
9. 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 “.
83
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
11. Write a JSP to insert the student’s semester wise percentages and calculate aggregate and insert into
database.
12. Write a JSP to search the students according to their aggregate and produce sorted list or according to their
Enroll number.
84
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
10
Students shall opt any one of the Mini–Projects in addition to the regular experiments
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.
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)
85
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 internalfunctionalities of main protocols such as HTTP, FTP, SMTP, TCP, UDP, IP
COs–POs Mapping
COs PO3
1 1
2 1
3 2
4 1
5 3
6 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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.
83
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Transport Layer
Transport Services-Connection management-Elements of Transport Protocols-Internet Transport Protocols: UDP
and TCP. IPv4 & IPv6, Application Layer-Domain name system-Electronic Mail-WWW,
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,8 thEdition, Pearson Prentice Hall, 2007
2. W.A. Shay, Thomson, Understanding communications and Networks, 3rd Edition, Cengage Learning, 2005
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.
1
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
84
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
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.
85
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit I
Introduction to OOAD & UML
Object Oriented Analysis vs. Object Oriented Design-Importance of modeling-and principles of modeling-object
oriented modeling-Conceptual model of the UML-Architecture-and Software Development Life Cycle. Modeling
concepts: overview of Structural-Behavioral and Architectural Modeling
Object Modeling Technique (OMT)-Object basics-Object state and behavior
Practical Components
1. Suggest to explain overview of UML.
2. Suggest to explainrational rose software.
12+6 Hours
Unit II
Behavioral Modeling
Introduction to Use case diagrams-Include-extend and generalization relationship in use cases. Introduction to
Activity Diagrams-uses of Activity diagrams-fork and join in activity-Swimlanes in Activity diagrams. Overview of
interaction diagrams-sequence vs. collaboration diagrams-Relationship between sequence diagrams and use cases
System.
Types and Roles- Process and threads and their notations in UML
Practical Components
1. Explain UML Diagrams at Glance
2. Draw the Use case,Sequence and Activity Diagram for Point of sale
11+12 Hours
Unit III
Class & Object Diagrams and Advanced Structural Modeling
Classes-Relationships-and common Mechanisms. Class and object diagrams-Advanced classes-advanced
relationships-Interfaces-Packages. Forward and Reverse Engineering concepts
Events and signals-concepts of state machines and state chart diagrams
Association classes-Abstract class
86
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Practical Components
1. Suggest case study of Library management systems.
2. Draw The Use case and Activity and State Chart Diagrams for Point of sale
11+3Hours
Unit IV
Architectural Modeling
Introduction to Components-Component diagrams-Component vs. classes. Introduction to Deployment and
deployment diagrams. Deployment vs.component. Case Study: Online banking System.
Patterns and frameworks-Systems and models
Practical Components
1. Perform case study online banking system
2. Draw the Use Case, Activity, State Chart for Point of sale
11+9Hours
Total: 75 Hours
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.
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
87
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Apply
1. ChooseCase 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. Differentiateconcepts of state machines and state chart diagrams
Evaluate
1. Judge Deployment vs. componentdiagram
2. Choose a suitable diagram when it is a design phase
88
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
89
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbooks (s)
1. E.RichK.Knight, and B. Nair, Artificial Intelligence, 3rdEdition, TMH, 1 July 2017
2. RusselNorvig, 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
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
3
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
90
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
91
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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-Transition diagram for recognition of Tokens-Reserved Words and
Identifiers
Input buffering-Lex tool
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-Intermediate Code -Three Address Code-Quadruples-Triples-Indirect Triples-Abstract
Syntax Trees-DAG for Expressions-Symbol Tables-Runtime Environment: Storage Organization-Stack Allocation-
Access to Non-local data-Heap Management
92
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
4
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
93
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 Algorithm as Technology
Performance Analysis: - Space complexity, Time complexity Growth of Functions: Asymptotic Notation- Big oh
notation, Omega notation, Theta notation, little oh, little omega. Recurrences: The Master Method.
Divide and conquer: General method, applications:-Fibonacci Search, Quick sort, Disjoint Sets: Disjoint operations,
UNION-FIND Algorithms
Time complexities of basic operations on arrays, stacks, heaps, graphs
12+5 hours
Unit II
Algorithm Design Techniques
Greedy method: General method, applications:-Job sequencing with deadlines, Minimum cost spanningtrees
(Kruskal’s Algorithms), Single source shortest path problem (Dijkstra’s Algorithms), Optimal MergePatterns (two
way merge pattern).Dynamic Programming: General method, applications:-Matrix chain multiplication, 0/1
knapsackproblem, all pairs shortest path problem.
Graph representation, graph applications. Longest common sub sequence problem
13+3 hours
Unit III
Search space and optimization problem techniques
Backtracking: General method, applications:-n-queen problem, sum of subsets problemBranch and Bound: General
method, LC Branch and Bound solution & FIFO Branch and Boundsolution.Applications: - Traveling sales person
problem
0/1 knapsack problem, graph coloring problem
11+3 hours
94
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Introduction to NP Problems and computing algorithms
NP-Hard and NP-Complete problems: Basic concepts, NP - Hard and NP Complete classes, Cook’stheorem.
Directed Hamiltonian Cycle – Flow shop scheduling - Number-Theoretic Algorithms: the Chinese remainder
theorem
Proof of 3-SAT problem
11+3 hours
Total: 45+15 Hours
Textbook (s)
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekaran, University press.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI Pvt.
Ltd./ Pearson Education
Reference (s)
1. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng,
R.C.Chang and T.Tsai, McGraw Hill.
2. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
3. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education.
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
5
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
95
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 (inti = n; i> 0; i /= 2)
for (int j = 0; j <i; j++)
count += 1;
return count;
}
96
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
97
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
10
Students shall opt any one of the Mini–Projects in addition to the regular experiments
98
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
99
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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.
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.
100
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Methods of Production (Job, Batch and Mass Production) - Inventory Control, Objectives, Functions – Analysis of
Inventory – EOQ.
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.
Reference (s)
1. PanneerSelvam. R, Engineering economics, 2 nd Ed.,, Prentice Hall of India, New Delhi, 2013
2. R.B.Khanna, Project Management, PHI Learning Pvt. Ltd. New Delhi, 2011
3. R. PanneerSelvam&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, 4 th Ed., Tata McGraw Hill, 2014
6. Koontz &Weihrich, Essentials of Management, 6th Ed., TMH, 2010
7. Chuck Williams and Mukherjee, Principle of Management 7 th Ed., Cengage Learning, 2013
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test6 (%)
Remembering 25 20 --
Understanding 25 15 --
Application 20 20 30
Analysis 10 15 30
Evaluate 20 20 20
Create - 10 20
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
6
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
101
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
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
102
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
103
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
3024
Course Outcomes
1. Understand the stages of KDD process and detailed architecture of Data Warehouse and data preprocessing
2. Understand GUI of WEKA and IBM SPSS modeler
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. Apply appropriate data mining techniques on complex types of data
COs–POs Mapping
COs PO2 PO3 PO5 PO6
1 3 1 1 1
2 3 1 3 2
3 3 3 2 1
4 3 3 2 2
5 3 3 2 1
6 3 2 2 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
Practical Components
1. Introduction to Graphical User Interface (GUI) of WEKA
2. Introduction to IBM SPSS Modeler and Nodes Palette
3. Perform Data Pre-processing on sample data set
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
Practical Components
1. Perform Association Analysis to derive the association rules using Aprioriand FP-Growth Algorithm.
2. Preparing the data for analysis using data audit node.
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
Practical Components
1. Implement the Classification using Decision Tree Induction.
2. Implement theClassification using Regression.
104
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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?
3. What is the classification of association rules based on various criteria?
4. Explain the various OLAP operations.
7
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
105
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
106
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
1. Demonstrate knowledge and understanding of the security and ethical issues of the Internet of Things
2. Identify vulnerabilities, including recent attacks, involving in Internet of Things
3. Describe countermeasures for Internet of Things devices
4. Analyze the societal impact of IoT security applications
5. Develop critical thinking skills to design the state-of-the-art technologies in IoT
6. Compare threat environments based on industrial perception
COs–POs Mapping
COs PO3 PO7 PSO2
1 3 3 1
2 2 2 2
3 1 2 1
4 3 2 1
5 3 3 1
6 2 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I
IoT Concepts and Architectures
Introduction - Internet of Things Definition Evolution - IoT Architectures - Resource Management - IoT Data
Management and Analytics - Communication Protocols - Internet of Things Applications – Security - Identity
Management and Authentication – Privacy - Standardization and Regulatory Limitations
Open Source Semantic Web Infrastructure for Managing IoT Resources in the Cloud
11+3 Hours
Unit II
Device/Cloud Collaboration Framework & Fog Computing
Device/Cloud Collaboration Framework: Powerful Smart Mobile Devices - Runtime Adaptation Engine - Privacy-
Protection Solution. Applications of Device/Cloud Collaboration: Context-Aware Proactive Suggestion - Semantic
QA Cache - Image and Speech Recognition.
Fog Computing: Definitions and Characteristics - Reference Architecture – Applications - Research Directions and
Enablers - Commercial Products - Case Study on SMART City
IoT Enablers and Solutions
11+4 Hours
Unit III
Virtualization on Embedded Boards as Enabling Technology for the Cloud of Things
Cloud and Fog Computing - Three Delivery Models of Fog and Cloud-of-Things Computing - Machine Reference
Model With its Three Interface Levels - Virtualization Technique Taxonomy - Hardware-Level and Process-Level
Virtualization Taxonomy - ARM Virtualization Extensions - XEN ARM Virtualization - KVM ARM Virtualization
- Virtualization and Real-Time
Micro Virtual Machines (MICROVMS) For Cloud assisted Cyber-Physical Systems (CPS): Virtual Machines and
Micro Virtual Machines - Architecture for Deploying Cps in the Cloud and the Expansion of the IoT - Extending the
Possibilities of the IoT by Cloud Computing - Micro Virtual Machines with the Sensor Observation Service and
Path Between Smart Objects and CPS
IoT Architecture for Selected Use Cases: eHealth, Precision Agriculture and Domotic
12+4 Hours
107
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Stream Processing In IoT: Foundations, State-Of-The-Art and Future Directions
Stream Processing in the System Architecture of IoT - Comparison of the Stream Model and the Batch Model -
Differences Between Two Use-Cases of Stream Processing: DSMS and CEP - The Characteristics of Stream Data in
IoT - General Architecture of a Stream Processing System in IoT - Continuous Logic Processing System -
Challenges and Future Directions
Framework for Distributed Data Analysis for IoT: Anomaly Detection - Problem Statement and Definitions -
Distributed Anomaly Detection - Efficient Incremental Local Modeling
Home Temperature Monitoring System, Raspberry Pi Platform, Introduction to Object Orientation Programming
(OOP) with Java, Webcam and Raspberry Pi Camera Projects
11+4 Hours
Total: 45+15
Textbook (s)
1. RajkumarBuyya, Amir VahidDastjerdi, “Internet of Things: Principles and Paradigms,” Elsevier 2016
Reference (s)
1. Dieter Uckelmann, Mark Harrison, Florian Michahelles, Architecting the Internet of Things,
Springer, 2011
2. Luigi Atzor, The Internet of Things: A survey, Journal on Networks, Elsevier Publications, 2010
3. http://postscapes.com/
4. http://www.theinterntofthings.eu/what-is-the-internet-of-things
Remember
7. Write the major significance of Internet of Things.
8. State the crucial requirement f IoT in terms of application and its supporting natures.
9. List the dominant technologies behind IoT development.
10. Identify two major differences between Internet of Everything and Industrial IoT.
11. Write about the data-center based cloud tools that use to run the machine learning algorithm
internally.
12. Recognizes an alternative approach that results in better adaptivity in case of network fluctuations
and increased latency.
13. Identify the on-demand processing and storage capabilities that is used to analyze the data
generated by IoT objects in batch or stream format.
8
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
108
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
109
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
5. Defend the augmented reality applications in terms of Game based on Fog Computing and Linked
Data
110
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
COs-POs Mapping
COs PO2 PO3
1 2 2
2 3 2
3 2 2
4 3 2
5 1 1
6 2 3
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
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 .
Multi Task gadget: wide area mobile data - air link standards for data - wireless application environment
12+4 Hours
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.
111
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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)
Remember
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)
112
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Apply
1. Illustrate 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.
113
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
1 3
2 2
3 2
4 3
5 2
6 2
3-Strongly linked , 2-Moderately linked ,1-weakly linked
The Internet of Things (IoT) is a system of interrelated computing devices, mechanical and digital machines,
objects, animals or people that are provided with unique identifiers and the ability to transfer data over a
network without requiring human-to-human or human-to-computer interaction.
List of Experiments
1. Accident Detection System.
2. Health Monitoring System.
3. Traffic congestion detection System.
4. Surveillance Systems.
5. Home Security Systems/ Automation System.
6. “Next generation” IoT applications must be able to capture, collect, interpret, and act on vast
amounts of information – detecting connectivity gaps, handling interruptions, and meeting
specific business and industry requirements.
114
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
115
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Elective I
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
COs PO2 PO3
1 2 1
2 3 2
3 3 2
4 1 2
5 3 2
6 1 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
116
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
System Engineering and Quality Assurance
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
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
Apply
1. Write statements that perform the following one-dimensional-array operations
2. Find traditional system life cycle approach for building information systems.
9
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
117
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
118
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
119
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Computer Animation & Fundamentals of Multimedia
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
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
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
10
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
120
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
121
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO2 PO3
1 3 3
2 2 2
3 3 3
4 2 2
5 3 2
6 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
122
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
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
11
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
123
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
124
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Elective II
16CS008 Qualitative Data Analysis (Elective V)
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
1 3
2 3
3 3
4 1
5 2
6 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
125
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
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.
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
12
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
126
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO2 PO3 PO5
1 2 2 2
2 3 2 1
3 2 3 2
4 3 2 2
5 3 2 2
6 2 1 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
services - Features of a Real-time operating system - Unix as a Real-time operating system - Unix-based Real-time
127
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Understand
# Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
128
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
129
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO3 PO5
1 2 2
2 2 2
3 3 2
4 1 3
5 2 3
6 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
130
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test13 (%)
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.
4. Identify the attributes for Web Services Enhancements
13
Assignment Test should contain only questions related to Higher Order Thinking (HOT) Skills
131
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Cos PO2 PO 3 PO 5
1 3 2 2
2 3 2 2
3 2 3 3
4 3 2 2
5 3 2 2
6 2 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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.
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).
11+4 Hours
132
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Fuzzy logic and Genetic Algorithm
Introduction to Fuzzy Sets: Difference between Classical Sets & Fuzzy Sets – Properties.
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)
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. FakhreddineKarray and Clarence de Silva - Soft Computing and Intelligent Systems Design, 2004.
8. AndriesEngelbrecht - 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.
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
133
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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, W j 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?
134
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO5 PO6
1 1 1
2 1 2
3 1 2
4 1 1
5 1 2
6 1 2
Unit I
Concepts of DDBMS
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
13+4 Hours
Unit II
Introduction to NoSQL
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
134
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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)
10+4 Hours
Unit IV
Statistics with R Programming
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
10+3 Hours
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
Remember
1. List out data sources
2. Name the basic advantages of data analysis
1
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
135
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
136
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
137
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 PO4
1 1
2 2
3 1
4 3
5 3
6 1
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
138
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
139
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
140
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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, 4 th 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
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test2 (%)
Remember 25 -- --
Understand 35 25 --
Apply 40 45 60
Analyse -- 30 40
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Remember
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
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
Assignment Test should contain only questions related to Higher Order Thinking (HOT) skills
141
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
142
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
143
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
3
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
144
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
145
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
1 1
2 2
3 1
4 1
5 1
6 2
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
146
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Textbook (s)
1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and Implementation, 2nd
edition, Kluwer Academic Press, 2000.
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
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
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
147
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO2 PO3 PO8 PO11 PO12
1 1 1 1 2 1
2 2 2 2 2 2
3 3 1 1 1 3
4 2 3 3 1 2
5 3 3 3 1 3
6 3 3 3 1 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 Hours
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 Hours
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 Hours
148
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 Hours
Total: 45+15 Hours
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.
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
149
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs-POs Mapping
COs PO2 PO3 PO7
1 1 1 1
2 1 1 1
3 1 1 1
4 2 1 2
5 2 2 2
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
13+3 Hours
150
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Reference(s)
1. Andrew S.Tanenbaum, Distributed Operating Systems, Pearson Education, 1995
SAMPLE QUESTION (S)
Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test6 (%)
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:
6
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
151
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Apply:
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.
152
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
153
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
5. Demonstrate the pitfalls for Client/Server Computing
6. Illustrate Late Binding with system.reflection and Activator class
7. Justify the reasons for employing distributed computing in business
7
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
154
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Apply
155
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO2 PO3 PO5
1 1 1 2
2 2 1 2
3 2 2 3
4 3 2 2
5 3 2 2
6 3 2 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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.
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.
13+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.
Need for Authentication, Principles of Key Distribution, Responsibilities of Key Distribution Centre
156
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
12+4 Hours
UNIT IV
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.
10+3 Hours
Total: 45+15 Hours
Text Books
1. William Stallings, ”Cryptography and Network Security: Principles and Practice”, 7th edition, , Pearson,
2017
2. Bernard Menezes, “Network Security and Cryptography 2nd edition”, Cengage Learning.
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
157
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs) Mapping
COs PO2 PO5
1 2 1
2 2 2
3 3 1
4 2 2
5 2 1
6 3 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
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
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
158
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Unit IV
Modelling and Visualization
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, 1 st 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.
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.
8
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
159
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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.
160
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO8
1 3
2 2
3 2
4 2
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 .
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.
10+3 Hours
161
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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.
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
Cognitive Int. Test 1 Int. Test 2 Comprehensive Test1
Level (%) (%) (%)
Remember 40 40 --
Understand 50 40 30
Apply 10 10 30
Analyze -- 10 20
1
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
162
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Evaluate -- -- 20
Create -- -- --
Total (%) 100 100 100
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.
163
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 PO3 PO5
1 1 1 2
2 3 1 2
3 3 1 1
4 3 2 2
5 3 2 2
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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),
164
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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.
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
2
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
165
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Analyze
1. Distinguish between Logistic Regression and SVM.
2. Analyze Dimensionality Reduction using PCA
3. Analyze various Neural Network Architectures in Machine Learning.
166
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 Hours
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.
167
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Watershed algorithm
10+4 Hours
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.
Remember
3
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
168
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
169
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
CO-PO Mapping:
COs PO2 PO3 PO5
1 1 2 1
2 2 2 2
3 2 3 1
4 2 2 2
5 2 2 1
6 2 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 Hours
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 Hours
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 Hours
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 Hours
170
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills
171
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mapping
COs PO2 PO6 PO7
1 1 3 2
2 2 3 3
3 1 3 3
4 3 2 3
5 3 3 2
6 2 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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
172
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
173
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 Hours
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 Hours
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 Hours
174
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
UNIT IV
Disaster Recovery& Case Study
Disaster Recovery, Planning, Cloud Disaster Management, Types of Clouds–Eucalyptus, Amazon.
Microsoft Azure , IBM Bluemix
10 +3 Hours
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, 1 st 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
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.
6
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course.
175
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Apply
1. Explain any IaaS service provided by Amazon
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.
176
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
COs–POs Mappings
COs PO3 PO5 PO6
1 3 2 1
2 3 2 2
3 2 2 1
4 2 2 2
5 2 2 1
6 3 2 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 Hours
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 Hours
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 Hours
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
177
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
10+4 Hours
Total: 45+15 Hours
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.
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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills
178
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 PO4 PO5
1 2 3 1
2 3 2 2
3 3 3 2
4 2 3 1
5 1 3 1
6 2 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
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 Hours
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 Hours
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 Hours
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.
179
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data Gathering,
Location Discovery.
Quality of a Sensor Network, Evolving Standards, Other Issues
15 Hours
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
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 ad- hoc 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
Assignment test should contain only questions related to Higher Order Thinking (HOT) Skills pertaining to this course
180
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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 t h e maximum achievable d a ta 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.
181
Department of Computer Science and Engineering, GMRIT | Syllabi | Regulation 2016
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?
182