Cse Syllabus 2019 4.7.2019

ACADEMIC REGULATIONS
COURSE STRUCTURE
AND
DETAILED SYLLABUS
COMPUTER SCIENCE AND

ENGINEERING
FOR
B. TECH FOUR YEAR DEGREE COURSE

(Applicable for the batches admitted from 2018-2019)
G.NARAYANAMMA INSTITUTE OF
TECHNOLOGY & SCIENCE (For Women)
(AUTONOMOUS)
Shaikpet, Hyderabad – 500104
DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
DEPARTMENT VISION
To provide engineering education in the field of Computer Science

with evolving technologies and to produce self-motivated,
employable individuals to society.
DEPARTMENT MISSION
● To pioneer education in Computer Science and Engineering,

Mathematics and Sciences, to mould the overall personality of
students.
● To nurture the students to be dynamic, industry ready and to have
multidisciplinary skills and leadership qualities.
● To inculcate work ethics and commitment in students for their
future endeavors to serve the society.
ACADEMIC REGULATIONS
COURSE STRUCTURE
AND
DETAILED SYLLABUS
COMPUTER SCIENCE AND

ENGINEERING
FOR
B. TECH FOUR YEAR DEGREE COURSE

(Applicable for the batches admitted from 2018-2019)
(AUTONOMOUS)
Shaikpet, Hyderabad – 500104
2 Computer Science and Engineering
2018-2019 3
B.TECH-ACADEMIC REGULATIONS – 2018

(GNITS-R18)
For CBCS Based B.Tech. Degree Courses
(Applicable for the students of B.Tech (Regular) from the Academic
Year 2018-19 and onwards)
1.0 Under-Graduate Degree Course (UGDC) in Engineering &
Technology (E&T)
G. Narayanamma Institute of Technology & Science (GNITS) -
for Women, Hyderabad, affiliated to Jawaharlal Nehru
Technological University Hyderabad (JNTUH), Hyderabad,
offers 4 Year (8 Semesters) Bachelor of Technology (B.Tech.)
Degree Course under Choice Based Credit System (CBCS) with
effect from the Academic Year 2018 – 19 onwards in the following
Branches of Engineering & Technology:
S.No. Branch
I. Computer Science and Engineering (CSE)
II. Electrical and Electronics Engineering (EEE)
III. Electronics and Communication Engineering (ECE)
IV. Electronics and Telematics Engineering (ETE)
V. Information Technology (IT)
2.0 Eligibility for Admission
2.1 The Admission to the UGDC shall be made either on the basis of
the merit rank obtained by the qualifying candidate at an Entrance
Test conducted by the Telangana State Government (TSEAMCET),
OR the University, OR on the basis of any other order of merit
approved by the University, subject to the reservations as prescribed
by the Government from time to time.
2.2 The medium of instruction for the entire UG Degree Course in
E&T shall be ENGLISH only.
3.0 B.Tech. Degree Course Structure
3.1 The B.Tech. Degree Courses at GNITS are of Semester Pattern,
with 8 Semesters constituting 4 Academic Years and each Academic
Year is of TWO Semesters (First/Odd and Second/Even
Semesters). Each Semester shall be of 22 Weeks duration
(inclusive of Examinations), with a minimum of 90 Instructional
Days per Semester.
3.2 UGC/AICTE specified Definitions/Descriptions are adopted
appropriately for various terms and abbreviations used in these
Academic Regulations/ Norms, which are listed under 3.2.1 to
3.2.4. The Course Structure is organized based on the AICTE
Model Curriculum for Under-Graduate Degree Courses in
Engineering & Technology (Jan. 2018).
3.2.1 Semester Scheme:
Each UGDC is of 4 Academic Years (8 Semesters), with each
academic year divided into two semesters of 22 weeks (>90
working days) each. Each semester has -‘Continuous Internal
Evaluation (CIE)’ and ‘End Semester Examination or Semester End
Examination (SEE)’. Choice Based Credit System (CBCS) and
Credit Based Semester System (CBSS) as denoted by UGC, and
Course Structure/Curriculum as suggested by AICTE are
followed. The terms ‘SUBJECT’ or ‘COURSE’ imply the same
meaning here, and refers to ‘Theory Subject’, or ‘Lab/Practical
Course’, or ‘Design/ Drawing Subject’, or ‘Elective’, or ‘Seminar’,
or ‘Project’, or ‘Mini-Project’, as the case may be.
3.2.2 Credit Courses
All the Subjects/ Courses are to be registered by a student in a
Semester to earn Credits. Credits shall be assigned to each Subject/
Course in a L : T : P : C (Lecture Periods: Tutorial Periods:
Practical Periods: Credits) Structure based on the following
general pattern:
● One Credit - for One hour/ Week/ Semester for Theory/
Lecture (L) Courses, and Tutorials (T); and,
● One Credit - for Two hours/ Week/ Semester for Laboratory/
Practical (P) Courses.
Student Activity Courses like NCC, NSS, NSO, and other courses
identified as Mandatory Courses (MC) shall not carry Credits.
3.2.3 Subject/ Course Classification
All the Subjects/ Courses offered for the UGDC are broadly
classified as :
(a) Foundation Courses (FnC), (b) Core Courses (CoC), and
(c) Elective Courses (ElC).
➣ Foundation Courses (FnC) are further categorized as :
(i) HS (Humanities and Social Sciences including

Management Courses),
2018-2019 5
(ii) BS (Basic Sciences Courses), and
(iii) ES (Engineering Sciences Courses);
➣ Core Courses (CoC) and Elective Courses (ElC) are
categorized as PS (Professional Subjects), which are further
subdivided as:
(i) PC (Professional/ Departmental Core) Courses
(ii) PE (Professional/ Departmental Electives) Courses
(iii) OE (Open Electives) Courses; and
(iv) Project Works (PW);
➣ Additional Courses :
● ONLINE Courses (offered by IITs/ MOOCs) ; and
➣ Mandatory Courses :
● MC - No Credits allocated.
3.2.4 Course Nomenclature:
The Curriculum Nomenclature or Course Structure Grouping for
each UG Degree Course (B.Tech. Degree Programmes) is as
listed below (along with AICTE specified % Range of Total
Credits):
4.0 Course Work

4.1 A student after securing admission shall pursue the B.Tech. UG
Degree Course in a minimum period of 4 Academic Years, and
a maximum period of 8 Academic Years (with effect from the
Date of Commencement of I Year).
4.2 As suggested by AICTE, a 3-week ‘Mandatory Induction
Programme’ shall be offered for all the Branches of Engineering
at the start of the I Year UGDC, to enable the newly admitted
students get acquainted with the new professional environment,
to develop awareness and understanding of the engineering
education requirements, and to get them prepared for the academic
schedules ahead. The features, activities and pattern of the Induction
Programme shall be as per the guidelines suggested in the Model
Curriculum. Conventional class work shall commence only after
the completion of the Induction Programme.
4.3 Each student shall Register for and secure the specified number
of Credits (160 Credits) required for the completion of the
UGDC and the Award of the B.Tech. Degree in the respective Branch
of Engineering.
4.4 Each Semester is structured to provide typically about 20 Credits
(20 C) on an average, totaling to 160 Credits (160 C) for the
entire B.Tech. Programme.
5.0 Course Registration
5.1 A ‘Faculty Advisor or Counselor’ shall be assigned to each B.Tech
student and the faculty advisor assigned shall advise/counsel the
student about the UGD Course, its Course Structure and
2018-2019 7
Curriculum, Choice/Option for Subjects/Courses, based on the
competence, progress, pre-requisites and interest of the student.
5.2 The Academic / Examination Section of the College invites
‘Registration Forms’ from the students apriori (before the
beginning of the Semester) through ‘ONLINE SUBMISSIONS’,
ensuring ‘DATE and TIME Stamping’. The ONLINE Registration
Requests for any ‘CURRENT SEMESTER’ shall be completed
BEFORE the commencement of SEEs (Semester End
Examinations) of the ‘PRECEDING SEMESTER’.
5.3 Every individual student is advised to register for all the number
of credits indicated in that semester workload of the respective
UGD Course Structure- this is termed as the ‘Minimum Work
Load’ (MWL).
5.4 A student can apply for ONLINE Registration, ONLY AFTER
obtaining the ‘WRITTEN APPROVAL’ from her assigned Faculty
Advisor, which should be submitted to the College Academic/
Examination Section through the Head of the Department (a copy
of the same is to be retained by the Head of the Department,
Faculty Advisor and the student).
5.5 A student may be permitted to register for the Subjects/ Courses
of her choice with the typical work load suggested in the respective
semester credit load allocation of that UG Degree Course
Structure as the Minimum Work Load (MWL), and maximum –
with possible additional courses of her choice, limited to a
Total Work Load (TWL) of 25 C, based on her PROGRESS
and SGPA/ CGPA, and completion of the ‘PRE-REQUISITES’
as indicated for various Subjects/Courses in the Department
Course Structure and Syllabus contents.
5.6 The choice for the ‘additional’ Subjects/Courses to reach the
Maximum Permissible Limit of 25 Credits (above the typical
MWL) must be indicated clearly, which needs the specific
approval and signature of the Faculty Advisor/ Counselor and the
HoD on the hard-copy.
5.7 If the student submits ambiguous choices or multiple options
or erroneous entries during ONLINE Registration for the
Subject(s)/Course(s) under a given/ specified Course Group/
Category as listed in the Course Structure, only the first mentioned
Subject/Course in that category shall be taken into consideration,
as applicable.
5.8 The Subject/Course Options exercised through ONLINE
Registration are final and CANNOT be changed, and CANNOT
be inter-changed; further, alternate choices shall also be not
considered. However, if the Subject/ Course that has already
been listed for Registration (by the Head of the Department) in
a semester could not be offered on account of any unforeseen
or unavoidable reasons, then the student shall be allowed to have
alternate choice - either for a new Subject (subject to offering
of such a Subject), or for another existing Subject (subject to
availability of seats), which may be considered. Such alternate
arrangements shall be made by the Head of the Department,
with due notification and time-framed schedule, within the FIRST
WEEK from the commencement of class-work for that semester.
5.9 Dropping of the Subjects/Courses may be permitted ONLY AFTER
obtaining the prior approval from the Faculty Advisor assigned
(subject to the retaining of the MWL), ‘within 15 Days of Time’
from the beginning of the current semester.
5.10 For the Mandatory Courses (like NCC/ NSS/ NSO etc.), a
‘Satisfactory Participation Certificate’ from the concerned
authorities of the relevant semester is essential. No Marks or
Grades or Credits shall be awarded for the Mandatory Courses.
6.0 Subjects/ Courses to be offered
6.1 A typical Section strength (or Class strength) for each semester
shall be 60.
6.2 A Subject/ Course may be offered to the students, ONLY IF a
Minimum of 30 Students opt for the same. The Maximum Class
Strength of a Section is limited to 80.
6.3 More than ONE TEACHER may offer the SAME SUBJECT
(Theory/ Tutorials/Lab./Practicals) in any semester. However,
selection choice for students will be based on - ‘FIRST COME
FIRST SERVE Basis and CGPA Criterion’ (ie., the first focus
shall be on the earliest stamping of ONLINE ENTRY from the
student for Registration in that semester, and the second
focus, if needed, shall be on the existing CGPA of the student).
6.4 If more entries for the Registration of a Subject come into
picture, then the Head of the Department concerned shall take
necessary action, whether to offer such a Subject/Course for TWO
(or multiple) SECTIONS or NOT .
2018-2019 9
6.5 In case of the options coming from the students of the other
Departments/ Branches/ Disciplines also (not considering OPEN
ELECTIVES), PRIORITY shall be given to the student of the
‘Parent Department/Branch’ first.
7.0 Attendance Requirements
7.1 A student shall be eligible to appear for the End Semester
Examinations if she acquires a minimum of 75% of attendance in
aggregate of all the Subjects/Courses (excluding Mandatory or
Non-Credit Courses) for that semester.
7.2 Condoning of shortage of attendance in aggregate up to 10% (65%
and above, and below 75%) in each semester may be granted by
the College Academic Committee (CAC) on genuine and valid
grounds based on the student’s representation with supporting
evidence. Provision of such condonation is however limited to
a maximum of 3 times during the maximum permissible UG
study period.
7.3 A stipulated fee shall be payable towards condoning of shortage of
attendance.
7.4 Shortage of Attendance below 65% in aggregate shall in NO case
be condoned.
7.5 A student, whose shortage of attendance is not condoned in a
semester is not eligible to take her End Examinations of that
semester; she get detained and her registration for that semester
shall stand cancelled. She shall not be promoted to the next
semester. She may seek re-registration for all those Subjects
registered in that semester in which she gets detained by
seeking re-admission for that semester as and when offered; in
case if there are any Professional Electives and/or Open Electives,
the same may also be re-registered if offered, however, if those
Electives are not offered in later semesters, then alternate Electives
may be chosen from the same set of Elective Subjects offered
under that Elective category.
8.0 Academic Requirements
The following Academic Requirements have to be satisfied in
addition to the Attendance Requirements mentioned under Clause
7.0.
8.1 A student shall be deemed to have satisfied the Academic
Requirements and earned the Credits allotted to each Subject/
Course, if she secures not less than 35% marks (25 out of 70
marks) in the End Semester Examination, and a minimum of 40%
of marks in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together
[in terms of Letter Grades, this implies securing ‘C Grade’ or
above in that Subject/ Course].
8.2 A student shall be deemed to have satisfied the Academic
Requirements and earned the Credits allotted to the Seminar
and the Mini-Project, if she secures not less than 40% of the
total marks (that is, 40 marks) to be awarded for each. The
student would be treated as failed, if she - (i) does not submit
a report on her Mini-Project, or does not make a presentation
of the same before the Evaluation Committee as per the schedule,
or (ii) does not present the Seminar as required in the III year
II Semester, or (iii) secures less than 40% of marks (40 marks)
in the Mini-Project/ Seminar evaluations. She may have to reappear
for the Mini-Project/Seminar evaluations, when they are scheduled
again in that semester; if she fails in such ‘one reappearance’
evaluation also, she has to reappear for the same in the next
subsequent semester, as and when they are scheduled as
supplementary candidate.
8.3 A student will not be promoted from the I Year to the II Year,
unless she fulfills the Attendance and Academic Requirements
and secures a total of 19 Credits out of 38 Credits specified
for the I Year, from all the relevant regular and supplementary
examinations, whether she takes those examinations or not.
8.4 A student will not be promoted from the II Year to the III Year,
unless she fulfills the Attendance and Academic Requirements
up to and inclusive of the II Year II Semester, from all the
relevant regular and supplementary examinations, whether she
takes those examinations or not.
8.5 A student will not be promoted from the III Year to the IV
Year, unless she fulfils the Attendance and Academic Requirements
up to and inclusive of the III Year II Semester, from all the relevant
regular and supplementary examinations, whether she takes those
examinations or not.
2018-2019 11
8.6 A student shall register for all the Subjects covering 160 Credits
as specified and listed (with the relevant Course/Subject
Classifications as mentioned) in the Course Structure, puts up
all the Attendance and Academic requirements for 160 Credits
securing a minimum of C Grade (Pass Grade) or above in each
Subject, and earns ALL 160 Credits securing SGPA > 5.0 ( in
each semester), and CGPA (at the end of each successive
semester) > 5.0 to successfully complete the UG Degree Course.
8.7 If a student registers for any ‘additional Subjects’ (in the parent
Department or other Departments/Branches of Engg.) other
than those listed Subjects totaling to 160 Credits as specified
in the Course Structure of her Department, the performances
in those ‘additional Subjects’ (although evaluated and graded)
shall not be taken into account while calculating the SGPA and
CGPA. For such ‘additional Subjects’ registered, the Letter Grade
alone shall be indicated in the Grade Card as a performance
measure subject to the completion of the Attendance and Academic
Requirements as stated under Clauses 7.0 and 8.1 - 8.6.
8.8 Students who fail to earn 160 Credits as per the Course Structure,
and as indicated above, within 8 Academic Years from the Date
of the Commencement of their I Year, shall forfeit their seats in
B.Tech. Programme and their admission shall stand cancelled.
8.9 When a student is detained due to the shortage of attendance in
any semester, she may be re-admitted into that semester as and
when offered, along with the Academic Regulations of the Batch
into which she gets readmitted. However, no Grade Allotments
or SGPA/ CGPA calculations shall be done for that entire
semester in which she got detained.
8.10 When a student is detained due to lack of Credits in any year,
she may be readmitted in the next year(s), after the fulfillment of
the Academic Requirements, along with the Academic Regulations
of the Batch into which she gets readmitted.
8.11 A student who is eligible to appear for the End Semester
Examination in any Subject/Course, but is absent for a particular
subject/course or has failed (thereby failing to secure C Grade
or above), may reappear for that Subject/Course at the
supplementary examination (SEE) as and when conducted. In
such cases, her Internal Marks (CIE) assessed earlier for that
Subject/Course shall be retained and carried over, and added to
the marks to be obtained in the SEE supplementary examination
for evaluating her performance in that Subject.
8.12 In view of AICTE/UGC suggestions and guidelines, it is resolved
to recommend the inclusion of “INTERNSHIP” for B.Tech
Programme students, in the 8th Semester (4th Year 2nd Semester),
for One Semester Duration, in addition to the B.Tech. Project
requirements already specified, with the following notes …
i. The internship will be “Industry Internship”, and is exclusively
meant for all those students who have been considered eligible
and selected accordingly by the Industry. Based on such
selection letters from the Industry, approvals will be given
to individual students by the Head of Department and the
Principal of the Institution to carry out the Industry Internship
for One Semester. The Internship Performance will be
evaluated by the Supervisor/Advisor/Guide from the Industry
for 100 marks (there will not be any Internals/Sessional from
the department side), and a Certificate is to be issued to
that effect from the Industry. The Internship will carry a
weightage of 3 Credits, and all students who undergo
Internship Programme are exempted from the prescribed
Open Elective Course of B.Tech.- 4th Year 2nd Semester (which
is also for 3 Credits).
ii. If any student fails to complete this Internship Programme
due to any reason whatsoever, or fails to secure at least
50% marks in their Internship Performance Evaluation, she
would have to register for the previously exempted Open
Elective Course of 4 th Year 2 nd Semester, in the next
subsequent semester(s), as a ‘supplementary candidate’, and
complete all the academic requirements as needed.
iii. Because of the mandatory physical presence of the student
required at the Industry during the Internship Period, provision
is made to the effect that students may be permitted to
choose ONE ON-LINE Course (of NPTEL/MOOCS level
- for 3 Credit Weightage), in place of the existing Professional
Elective Course (Professional Elective -6) in 4th Year 2nd
Semester of the B.Tech Programme, preferably in the same
domain specialization, subject to acceptance and approval
by the Head of Department, during 3rd year- 2nd semester or
4th year- 1st semester, as applicable. In such cases, the student’s
performance evaluation will be as per the ON-LINE Course
evaluation format. If any student fails to get the required
2018-2019 13
Grade/Marks in her ON-LINE Course evaluations, she would
have to repeat the same ON-LINE Course again (as and
when offered) and complete it successfully, or can register
for Professional Elective-6 in 4th Year 2nd Semester to meet
all the academic requirements.
9.0 Evaluation - Distribution and Weightage of Marks
9.1 The performance of a student in each semester shall be evaluated
Subject-wise (irrespective of the Credits assigned) with a maximum
of 100 marks for Theory, or Labs/Practicals, or Drawing/Design,
or Elective Course, or Seminar, or Mini-Project, or Project - I, or
Project -II etc. These evaluations shall be based on 30% CIE
(Continuous Internal Evaluation) and 70% SEE (Semester End
Examination), and a Letter Grade corresponding to the % of
marks obtained shall be given.
9.2 For all the Subjects/Courses as mentioned under 9.1,the distribution
shall be: 30 Marks for the CIE and 70 Marks for the SEE for the
entire UG Degree Course.
9.3 a. For the Theory Subjects during the semester, there shall be 2 mid-
term examinations for 25 marks each. Each mid-term examination
consists of one Objective section for 10 marks, plus one Subjective
section for 15 marks, with a total duration of 120 minutes. Further,
there shall be an allocation of 5 marks for the Assignment,
and there shall be 2 Assignments. The Objective section may be
set with multiple choice questions, True/False selections, fill-in
the blanks, matching type questions, etc. The Subjective section
shall contain 5 questions, out of which the student has to answer
any 3 questions, each question carrying 5 marks.
b. The first mid-term examination shall be conducted in the middle
of the semester for the first 50% of the syllabus, and the second
mid-term examination shall be conducted at the end of the semester
for the remaining 50% of the syllabus.
c. The First Assignment should be submitted before the conduct
of the first mid-term examination, and the Second Assignment
should be submitted before the conduct of the second mid-term
examination. The Assignments shall be as specified by the subject
teacher concerned.
d. The first mid-term examination marks and the first Assignment
Marks combined together shall make one set of CIE marks, and
the second mid-term examination marksand the second Assignment
Marks shall make the second set of CIE marks; and the AVERAGE
of the two sets of mid examination marks shall be taken as the
final marks secured by the student towards Continuous Internal
Evaluation (CIE) in that Theory Subject.
9.4 For the Lab/Practical Subjects, the Continuous Internal Evaluation
(CIE) during the semester shall be for 30 Marks, and the End
Semester Examination (SEE) shall be for 70 Marks. Out of the 30
Marks for internals (CIE), day-to-day assessment of the lab work
shall be assessed for 20 Marks; and one internal lab exam shall be
conducted by the laboratory teacher concerned for 10 Marks. The
Semester End Examination (SEE) for Lab/Practicals shall be
conducted at the end of the semester by Two Examiners nominated
by the Head of the Department and approved by the Principal.
9.5 For the Subjects with Design and/or Drawing, (such as Engineering
Graphics, Engineering Drawing, Machine Drawing, Production
Drawing Practice, and Estimation etc.), the distribution shall be:
30 Marks for CIE (20 Marks for the day-to-day work and 10 Marks
for the internal tests) and 70 Marks for SEE. There shall be TWO
internal tests in a semester and the AVERAGE of the two shall be
taken into consideration for the award of Marks for the internal
tests (CIE).
9.6 Open Electives: 4 Open Elective Courses shall be offered in
the 8 Semester UG Degree Course. Students are to choose ONE
from each set of Open Electives given. However, students cannot
opt for an Open Elective Subject offered by their own (parent)
Department or any other department, if it has been already listed
(or the contents included) under any category of the Subjects
offered by the parent department in any semester.
9.7 There shall be a Seminar Presentation in the III Year II Semester.
For the Seminar, the student shall collect the information on a
technical topic, prepare a Technical Report and submit the Technical
Report prepared to the Department at the time of Seminar
Presentation. The Seminar Presentation (along with the Technical
Report submitted) shall be evaluated for 100 marks by Two Faculty
Members assigned by the Head of the Department. There shall be
no SEE or external examination for the Seminar.
9.8 a. There shall be a Mini-Project, preferably in collaboration with an
Industry with the relevant specialization, to be registered
immediately after III Year II Semester examinations, and taken
up during the summer vacation (between III and IV Years) for about
eight weeks duration.
2018-2019 15
b. The Mini-Project work shall be submitted in a Report form, and a
presentation of the same shall be made before a Committee and is
evaluated for 100 Marks by the committee. The Committee shall
consist of the Head of the Department, the supervisor of Mini-
Project, and a Senior Faculty Member of the Department. There
shall be no internal marks for Mini-Project. Performance
evaluation of the Mini-Project shall be included in the IV Year
I Semester Grade Card.
9.9 Each student shall start the Project Work during the IV Year I
Semester as per the instructions of the Project Guide/ Project
Supervisor assigned by the Head of the Department.
a. The Project Work shall be divided and carried out in 2 phases:
Phase - I (Project-I) during IV Year I Semester, and Phase - II
(Project -II) during IV Year II Semester, and the student has to
prepare two independent Project Work Reports - one each
during each phase. First Report shall include the Project Work
carried out under Phase-I, and the Second Report (Final Report)
shall include the Project Work carried out under Phase -I and
Phase - II put together. Phase- I and Phase- II of the Project Work
shall be evaluated for 100 marks each.
b. Out of the total 100 marks allotted for each Phase of the Project
Work, 30 marks shall be for the CIE (Continuous Internal
Evaluation/CIE), and 70 Marks shall be for the End Semester Viva-
voce Examination/SEE). The Marks earned under CIE for both
Phases of the Project shall be awarded by the Project Guide/
Supervisor (based on the continuous evaluation of student’s
performance during the two Project Work Phases/periods); and
the marks earned under SEE shall be awarded by the Project
Viva-voce Committee/ Board (based on the work carried out, report
prepared and the presentation made by the student at the time
of Viva-voce Examination).
c. For the Project Phase - I, the Viva-voce shall be conducted at
the end of the IV Year I Semester, before the commencement
of that Semester End Examinations, at the Department Level
by a Committee comprising of the HOD or One Professor and
Supervisor (no external examiner), and the Project Phase - II (or
Final Project Viva-voce) shall be conducted by a Committee
comprising of an External Examiner, the Head of the Department
and the Project Supervisor at the end of the IV Year II Semester,
before the the commencement of semester and examinations. The
nomination of the External Examiner shall be done by the Principal
from the panel of 3 names of external faculty members (Professors
or Associate Professors outside the College) submitted by the
HOD.
9.10 For NCC/ NSS/ NSO Mandatory Courses and/or any other
Mandatory Non-Credit Course offered in a semester, a
‘Satisfactory Participation Certificate’ shall be issued to the
student from the authorities concerned, only after securing > 75%
attendance in the Course. No Marks or Letter Grade shall be allotted
for the Mandatory Courses.
10.0 Grading Procedure
10.1 Marks shall be awarded to indicate the performance of each student
in each Theory Subject, or Lab/ Practicals, or Workshop/Drawing,
or Elective Course, or Seminar, or Project, or Mini-Project, etc.,
and, based on the % of marks obtained in CIE + SEE (Continuous
Internal Evaluation + Semester End Examination, both taken
together) as specified under 9.0, a corresponding Letter Grade
shall be given
10.2 As a measure of the student’s performance, a 10-point Absolute
Grading System using the following Letter Grades and
corresponding percentage of marks shall be followed:
2018-2019 17
10.3 A student obtaining ‘F’ Grade in any Subject shall be considered
‘FAILED’ and will be required to reappear as ‘Supplementary
Candidate’ in the End Semester Examination (SEE), as and when
conducted. In such cases, her Internal Marks (CIE Marks) in those
Subject(s) will remain the same as those obtained earlier.
10.4 A Letter Grade does not imply any specific % of marks.
10.5 In general, a student shall not be permitted to repeat any Subject/
Course (s) for the sake of ‘Grade Improvement’ or ‘SGPA/ CGPA
Improvement’. However, she has to repeat all the Subjects/Courses
pertaining to that semester, when she is detained (as listed under
Clauses 8.9- 8.10).
10.6 A student earns Grade Points (GP) in each Subject/ Course on
the basis of the Letter Grade obtained by her in that Subject/Course
(excluding Mandatory non-credit Courses).Then the corresponding
‘Credit Points’ (CP) are computed by multiplying the Grade Points
with Credits for that particular Subject/Course.
Credit Points (CP) = Grade Points (GP) x Credits for a
Course
10.7 The student passes the Subject/Course only when she gets GP >
5 (C Grade or above).
10.8 The Semester Grade Point Average (SGPA) is calculated by
dividing the Sum of Credit Points (ΣCP) secured from ALL
Subjects/ Courses registered in a semester by the Total Number
of Credits registered during that semester. SGPA is rounded off
to TWO Decimal Places. SGPA is thus computed as
SGPA = …. For each Semester

where ‘i’ is the Subject indicator index (takes into account all
Subjects in a semester), ‘N’ is the no. of Subjects ‘REGISTERED’
for the semester (as specifically required and listed under the
Course Structure of the parent Department), Ci is the no. of Credits
allotted to the ith Subject, and Gi represents the Grade Points
(GP) corresponding to the Letter Grade awarded for that ith
Subject.
10.9 The Cumulative Grade Point Average (CGPA) is a measure of
the overall cumulative performance of a student over all the
semesters considered for registration. The CGPA is the ratio
of the Total Credit Points secured by a student in ALL the
registered Courses in ALL the semesters, and the Total Number
of Credits registered in ALL the semesters. CGPA is rounded
off to TWO Decimal Places. CGPA is thus computed from the
I Year Second Semester onwards, at the end of each semester,
as per the formula
CGPA= …for all S semesters
registered (ie., up to and inclusive of S semesters, S > 2 ),
Where ‘M’ is the TOTAL no. of Subjects (as specifically required
and listed under the Course Structure of the parent Department)
the student has ‘REGISTERED’ from the 1st Semester onwards
upto and inclusive of the semester S (obviously M > N ), ‘j’ is
the Subject indicator index (takes into account all Subjects
from 1 to S semesters), Cj is the no. of Credits allotted to the jth
Subject, and Gj represents the Grade Points (GP) corresponding
to the Letter Grade awarded for that j th Subject. After the
registration and completion of I Year I Semester however, the
SGPA of that semester itself may be taken as the CGPA, as there
are no cumulative effects.
10.10 For the Merit Ranking or Comparison Purposes or any other
listing, ONLY the ‘ROUNDED OFF’ values of the CGPAs shall
be used.
10.11 For Calculations listed under Clauses 10.6 -10.10, performance
in failed Subjects/Courses (securing F Grade) shall also be taken
into account, and the Credits of such Subjects/ Courses shall
also be included in the multiplications and summations. However,
Mandatory Courses will not be taken into consideration.
10.12 Passing Standards
10.12.1 A student shall be declared successful or ‘passed’ in a semester,
only when she gets a SGPA >5.00 (at the end of that particular
semester); and a student shall be declared successful or ‘passed’
in the entire UG Degree Course, only when she gets a CGPA >
5.00; subject to the condition that she secures a GP > 5 (C
Grade or above) in every registered Subject/Course in each
semester (during the entire UG Degree Course) for the Award of
the Degree, as required.
10.12.2 A student shall be declared successful or ‘passed’ in any Non-
Credit Subject/Course, if she secures a ‘Satisfactory Participation
Certificate’ for that Mandatory Course.
2018-2019 19
10.13 After the completion of each semester, a Grade Card or Grade
Sheet (or Transcript) shall be issued to all the Registered Students
of that semester indicating the Letter Grades and the Credits
earned. The Grade Card or the Grade Sheet shall show the details
of the Courses Registered (Course Code, Title, No. of Credits,
Grade Earned etc.), Credits earned, SGPA, and CGPA.
11.0 Declaration of Results
11.1 Computation of SGPA and CGPA are done using the procedure
listed under Clauses 10.6 -10.10.
11.2 CGPA is NOT indicative of the % of marks secured. However, in
case if % of marks equivalent to the FINAL CGPA (computed
at the end of UG Degree Course) is required, then the following
formula may be used as an estimate:
% of Marks = (final CGPA – 0.5) x 10
12.0 Award of Degree
12.1 A student who registers for all the specified Subjects/Courses as
listed in the Course Structure, satisfies all the Course
Requirements, and passes all the examinations prescribed in the
entire UG Degree Course, and secures the required number of
160 Credits (with CGPA > 5.0), within 8 Academic Years from
the Date of Commencement of the First Academic Year, shall
be declared to have ‘QUALIFIED’ for the Award of the B.Tech.
Degree in the chosen Branch of Engineering as selected at the
time of Admission.
12.2 A student who qualifies for the Award of the Degree as listed
under Clause 12.1, shall be placed in the following four Classes:
12.2.1 a) A student with final CGPA (at the end of the UG Degree
Course) > 8.00, and fulfilling the following conditions -
(i) should have passed all the Subjects/Courses in ‘FIRST
APPEARANCE’ within the first 4 Academic Years (or 8
Sequential Semesters) from the Date of Commencement of
her First Academic Year,
(ii) should have secured a CGPA > 8.00, at the end of each of
the 8 sequential semesters, starting from the I Year I
Semester onwards,
(iii) should not have been detained or prevented from writing the
End Semester Examinations in any semester due to shortage
of attendance or any other reason, SHALL be placed in ‘FIRST
CLASS with DISTINCTION’.
b. A student with final CGPA (at the end of UG Degree Course)
> 8.00, but not fulfilling the above conditions, shall be placed
in ‘FIRST CLASS’.
12.2.2 A student with final CGPA (at the end of the UG Degree
Course) > 6.50 but <8.00, shall be placed in ‘FIRST CLASS’.
12.2.3 A student with final CGPA (at the end of the UG Degree
Course) > 5.50 but <6.50, shall be placed in ‘SECOND CLASS’.
12.2.4 All other students who qualify for the Award of the Degree
(as per the Clause 12.1), with final CGPA (at the end of the
UG Degree Course) > 5.00 but < 5.50, shall be placed in ‘PASS
CLASS’.
12.2.5 A student with final CGPA (at the end of the UG Degree Course)
< 5.00 will not be eligible for the Award of the Degree.
12.2.6 A student fulfilling the conditions listed under the Clause
12.2.1 (a) alone will be the eligible candidate for the ‘University/
College Rank’ and/or ‘Gold Medal’ considerations.
13.0 Withholding of Results
13.1 If the student has not paid fees to the University/ College at any
stage, or has pending dues against her name due to any reason
whatsoever, or if any case of indiscipline is pending against her,
the result of the student may be withheld, and she shall not be
allowed to go into the next higher semester. The award or issue of
the Degree may also be withheld in such cases.
14.0 Transitory Regulations
14.1 A student who has discontinued for any reason, or has been
detained for want of attendance or lack of required credits as
specified, or who has failed in her B.Tech. Degree Course
after the UGDC period of 4 years, may be considered eligible
for readmission to the same Subjects/Courses (or equivalent
Subjects/ Courses, as the case may be), and/ or to the same
Professional Electives/ Open Electives (from the same set/
category of Electives available or equivalents suggested, as
the case may be) as and when she is offered (within the time
-frame of 8 years from the Date of Commencement of her I
Year I Semester), along with the Academic Regulations of the
Batch into which she gets readmitted.
2018-2019 21
15.0 Student Transfers
15.1 There shall be no Branch transfers after the completion of the
Admission Process.
16.0 Scope
i. Where the words “Subject” or “Subjects”, occur in these
regulations, they also imply “Course”or “Courses”.
ii. The Academic Regulations should be read as a whole, for the
purpose of any interpretation.
iii. In case of any doubt or ambiguity in the interpretation of the
above rules, the decision of the Principal is final.
iv. The College may change or amend the Academic Regulations,
Course Structure or Syllabi at any time, and the changes or
amendments made shall be applicable to all the students with
effect from the dates notified by the College Authorities.
ACADEMIC REGULATIONS - 2018

For CBCS Based B.Tech. Degree Courses for
Students Admitted under
Lateral Entry Scheme (LES)
(Effective for the students admitted into II year from the
Academic Year 2019-20 and onwards)
A) Eligibility for Admission
A.1 The Admission to the B.Tech. Programme (UG Degree Course)
shall be made either on the basis of the merit rank obtained by the
qualifying candidate at an Entrance Test conducted by the Telangana
State Government (TSECET), OR the University, OR on the basis
of any other order of merit approved by the University, subject to
the reservations as prescribed by the Government from time to
time.
B) B.Tech. Degree Course Structure for LES Students ~
B.1 Regular Full Time B.Tech. Degree Courses at GNITS are of
Semester Pattern, with 8 Semesters constituting 4 Academic Years
and each Academic Year is of TWO Semesters (First/Odd and
Second/Even Semesters). Students admitted under LES shall
join - the II Year stream of the Regular B.Tech. students in the
relevant branch of engineering (admitted for 4 Year UG Degree
Course in the previous year) and their UG Degree Course period
therefore shall be 3 Years (II, III and IV Years) or 6 Semesters
of the Regular Full Time B.Tech. Programme (commencing
from II Year I Semester).
B.2 The LES Students, after securing admission, shall pursue their
UG Degree course of study for not less than 3 years and not more
than 6 years, from the year of admission.
B.3 Each student shall Register for and secure the specified number
of Credits (122 Credits) required for the completion of the UGDC
and the Award of the B.Tech. Degree in the respective Branch of
Engineering.
C) Academic Requirements ~
C.1 A student will not be promoted from the II Year to the III Year,
unless she fulfills the Attendance and Academic Requirements and
secures a total of 24 Credits out of 41 Credits specified up to and
inclusive of the II Year II Semester, from all the relevant regular
2018-2019 23
and supplementary examinations, whether she takes those
C.2 A student will not be promoted from the III Year to the IV Year,
unless she fulfils the Attendance and Academic Requirements and
secures a total of 48 Credits out of 81 Credits specified up to
and inclusive of the III Year II Semester, from all the relevant regular
and supplementary examinations, whether she takes those
C.3 A student shall register for all the Subjects covering 122 Credits
as specified and listed (with the relevant Course/Subject
Classifications as mentioned) in the Course Structure, puts up all
the Attendance and Academic requirements for 122 Credits
securing a minimum of ‘C’ Grade (Pass Grade) or above in each
Subject, and earns ALL 122 Credits securing SGPA > 5.0 ( in
each semester), and > 5.0 CGPA (at the end of each successive
semester), to successfully complete the B.Tech. Degree Course.
C.4 A student who fails to earn 122 Credits specified as per the Course
Structure, and as indicated above, within 6 Academic Years from
the year of admission (that corresponds to the II Year I Semester
of the Regular Full Time B.Tech. Degree Course), shall forfeit
their seat in B.Tech. Programme and their admission shall stand
cancelled.
D) Award of Degree
D.1 A student who registers for all the specified Subjects/Courses
as listed in the Course Structure, satisfies all the Course
Requirements, and passes all the examinations prescribed in the
entire UG Degree Course, and secures the required number of
122 Credits (with CGPA >5.0), within 6 Academic Years from
the year of admission, shall be declared to have ‘QUALIFIED’
for the Award of the B.Tech. Degree in the chosen Branch of
Engineering as selected at the time of Admission.
D.2 A student who qualifies for the Award of the Degree as listed
under Clause D.1, shall be placed in the following Classes :
D.2.1a. A student with final CGPA (at the end of the UG Degree
Course) > 8.00, and fulfilling the following conditions -
i. should have passed all the Subjects/Courses in ‘FIRST
APPEARANCE’ within the first 3 Academic Years (or 6
Sequential Semesters) from the year of admission,
ii. should have secured a CGPA > 8.00, at the end of each of
the 6 sequential semesters, starting from the II Year I Semester
onwards,
iii. should not have been detained or prevented from writing
the End Semester Examinations in any semester due to
shortage of attendance or any other reason, SHALL be placed
in ‘FIRST CLASS with DISTINCTION’.
b. A student with final CGPA (at the end of UG Degree Course)
> 8.00, but not fulfilling the above conditions, shall be placed
in ‘FIRST CLASS’.
D.2.2 A student fulfilling the conditions listed under the Clause D.2.1
(a) alone will be the eligible candidate for the ‘University/College
Rank’ and/or ‘Gold Medal’ considerations.
D.2.3 All other clauses (and the corresponding CGPAs) shall be same as
those listed under clauses 12.2.2 to 12.2.5.
E) Other Regulations
All the Academic Regulations as applicable for the B.Tech. 4 Year
Degree Course students shall hold good for the B.Tech. Lateral
Entry Scheme students also, but for the variations as described
above, under Clauses A, B, C and D for LES students.
MALPRACTICES RULES DISCIPLINARY ACTION FOR /
IMPROPER CONDUCT IN EXAMINATIONS
Nature of Malpractices /
Punishment
Improper conduct
1. If the student : Possesses or
(a) keeps accessible in examination
hall,any paper, note book, progra-
mmable calculators, cell phones,
pager, palm computers or any
other form of material concerned
Expulsion from the examination
with or related to the subject of
the examination (theory or practi- hall and cancellation of the
cal) in which student is appearing performance in that subject only.
but has not made use of (material
shall include any marks on the
body of the student which can be
used as an aid in the subject of the
examination)
2018-2019 25
(b) Gives assistance or guidance or Expulsion from the examination

receives it from any other student hall and cancellation of the
orally or by any other body performance in that subject only
language methods or communi- of all the students involved. In
cates through cell phones with any case of an outsider, he will be
student or persons in or outside handed over to the police and a
the exam hall in respect of any case is registered against him.
matter.
hall and cancellation of the
2. Has copied in the examination hall
from any paper, book, programm- performance in that subject and
able calculators, palm computers all other subjects the student has
or any other form of material already appeared including
relevant to the subject of the practical examinations and
examination (theory or practical) project work and shall not be
in which the student is appearing. permitted to appear for the
remaining examinations of the
subjects of that semester/year.
The student who has imperso-
nated shall be expelled from
examination hall. The student is
also debarred and forfeits the seat.
The performance of the original
student, who has been imperso-
nated, shall be cancelled in all the
subjects of the examination (in-
cluding practicals and project
3. Impersonates any other student
work) already appeared and shall
inconnection with the examin- not be allowed to appear for
ation. examinations of the remaining
subjects of that semester/year.
The student is also debarred for
two consecutive semesters from
class work and all university
examinations. The continuation of
the course by the student is sub-
ject to the academic regulations
in connection with forfeiture of
seat. If the imposter is an outsider,
he will be handed over to the
police and a case is registered

against him.
hall and cancellation of perfor-
mance in that subject and all the
other subjects the student has
4. Smuggles in the answer book or already appeared including
additional sheet or takes out or practical examinations and project
arranges to send out the question work and shall not be permitted for
paper during the examination or the remaining examinations of the
answer book or additional sheet, subjects of that semester/year. The
during or after the examination. student is also debarred for two
consecutive semesters from class
work and all university examina-
tions. The continuation of the
course by the student is subject to
the academic regulations in
connection with forfeiture of seat.
5. Uses objectionable, abusive or
offensive language in the answer
paper or in letters to the examiners Cancellation of the performance
or writes to the examiner in that subject.
requesting him to award pass
marks.
6. Refuses to obey the orders of the In case of students of the college,
chief superintendent/assistant– they shall be expelled from
superintendent / any officer on examination halls and cancellation
duty or misbehaves or creates of their performance in that
disturbance of any kind in and subject and all other subjects the
around the examination hall or student(s) has (have) already
organizes a walk out or instigates appeared and shall not be
others to walk out, or threatens permitted to appear for the
the officer-in charge or any remaining examinations of the
person on duty in or outside the subjects of that semester/year. The
examination hall of any injury to students also are debarred and
his person or to any of his forfeit their seats. In case of
relations whether by words, either outsiders, they will be handed over
spoken or written or by signs or to the police and a police case is
by visible representation, assaults registered against them.
the officer-in-charge, or any
2018-2019 27
person on dutyin or outside the

examination hall or any of his
relations, or indulges in any other
act of misconduct or mischief
which result in damage to or
destruction of property in the
examination hall or any part of the
college campus or engages in any
other act which in the opinion of
the officer on duty amounts to use
of unfair means or misconduct or
has the tendency to disrupt the
orderly conduct of the exami-
nation.
hall and cancellation of perfor-
mance in that subject and all the
other subjects the student has
already appeared including
practical examinations and project
7. Leaves the exam hall taking away
work and shall not be permitted for
answer script or intentionally the remaining examinations of the
tears of the script or any part subjects of that semester/year. The
thereof inside or outside the student is also debarred for two
examination hall.
consecutive semesters from class
work and all end examinations. The
continuation of the course by the
student is subject to the academic
regulations in connection with
forfeiture of seat.
hall and cancellation of the
performance in that subject and
all other subjects the student
8. Possess any lethal weapon or has already appeared including
firearm in the examination hall. practical examinations and project
work and shall not be permitted
for the remaining examinations of
the subjects of that semester/
year.The student is also debarred
and forfeits the seat.
9. If student of the college, who is Student of the colleges expulsion

not a student for the particular from the examination hall and
examination or any person not cancellation of the performance in
connected with the college that subject and all other subjects
indulges in any malpractice or the student has already appeared
improper conduct mentioned in including practical examinations
clause 6 to 8. and project work and shall not be
permitted for the remaining
examinations of the subjects of
that semester/year. The student is
also debarred and forfeits the seat.
Person(s) who do not belong to the
college will be handed over to
police and, a police case will be
registered against them.
Expulsion from the examina-

tion hall and cancellation of the
performance in that subject and
all other subjects the student
10. Comes in a drunken condition to has already appeared including
the examination hall.
practical examinations and
Project work and shall not be
permitted for the remaining
examinations of the subjects of
that semester/year.
11. Copying detected on the basis of Cancellation of the performance

internal evidence, such as, during in that subject and all other
valuation or during special subjects the student has appeared
scrutiny. including practical examinations
and project work of that semester/
year examinations.
12. If any malpractice is detected

which is not covered in the above
clauses 1 to 11 shall be reported
to the Principal for further action
to award suitable punishment.
2018-2019 29
B.Tech. 4 Year (8 semesters) Regular Programme in
Computer Science and Engineering
COURSE STRUCTURE
(Applicable for the Batch admitted from the
Academic Year 2018-19 onwards)
I YEAR I SEMESTER
S. Group Course Course L T P Credits
No. Code
1 BS BS111AA Chemistry 3 1 - 4
Linear Algebra and
2 BS BS111AB 3 1 - 4
Multivariable Calculus
3 ES ES111AD Basic Electrical Engineering 3 1 - 4
Programming for Problem
4 ES ES111AF 3 - - 3
Solving
5 BS BS11101 Chemistry Lab - - 2 1
6 ES ES11103 Basic Electrical Engineering Lab - - 3 1.5
7 ES ES11105 Programming Lab - - 3 1.5
8 MC MC11106 Games and Sports 2 - - -
TOTAL 14 3 8 19
I YEAR II SEMESTER
No. Code
1 BS BS112AC Physics 3 1 - 4
Numerical Techniques and
2 BS BS112AG 3 1 - 4
Transform Calculus
3 HS HS112AJ English 2 - - 2
4 ES ES112AE Engineering Graphics 1 - 3 2.5
5 BS BS11208 Physics Lab - - 3 1.5
English Professional and
6 HS HS11212 - - 2 1
Communication Skills Lab
7 ES ES11210 Computational Mathematics Lab - - 3 1.5
8 ES ES11211 Engineering Workshop 1 - 3 2.5
9 MC MC11213 National Service Scheme (NSS) 2 - - -
TOTAL 12 2 14 19
Games & Sports / NSS: Participation Certificate is Mandatory
for each semester
COURSE STRUCTURE
II YEAR I SEMESTER
No. Code
1 BS BS113AL Probability and Statistics 3 - - 3
2 ES ES113AN Digital Logic Design 3 - - 3
3 ES ES113AP Engineering Mechanics 3 - - 3
4 PC PC113AS Data Structures 3 1 - 4
5 PC PC113AX Object Oriented Programming 3 - - 3
6 ES ES11316 IT Workshop Lab - - 3 1.5
Data Structures through
7 PC PC11319 - - 3 1.5
C++ Lab
Object Oriented Programming
8 PC PC11323 - - 3 1.5
through Java Lab
9 MC MC11317 Gender Sensitization 2 - - -
TOTAL 17 1 9 20.5
II YEAR II SEMESTER
No. Code
1 BS BS114AZ Discrete Mathematics 3 - - 3
Managerial Economics and
2 HS HS114BD 3 - - 3
Financial Analysis
Computer Organization and
3 PC PC114BH 3 - - 3
Architecture
4 PC PC114BN Operating Systems 3 - - 3
5 PC PC114BJ Database Management Systems 3 1 - 4
Computer Organization and
6 PC PC11427 - - 3 1.5
Microprocessor Lab
7 PC PC11433 Operating Systems Lab - - 3 1.5
Database Management
8 PC PC11428 - - 3 1.5
Systems Lab
9 MC MC114BE Environmental Sciences 2 - - -
TOTAL 17 1 9 20.5
2018-2019 31
COURSE STRUCTURE
III YEAR I SEMESTER
No. Code
1 HS HS115CE Fundamentals of Management 3 - - 3
2 PC PC115BU Computer Networks 3 - - 3
3 PC PC115BX Design and Analysis of Algorithms 3 1 - 4
Professional Elective-1
PE115CK Software Engineering
4 PE PE115BQ Advanced Computer Architecture 3 - - 3
PE115BT Computer Graphics
5 OE OE115XX Open Elective – 1 3 - - 3
6 HS HS11542 Employability and Soft skills Lab - - 2 1
7 PC PC11534 Computer Networks Lab - - 3 1.5
Design and Analysis of
8 PC PC11537 - - 3 1.5
Algorithms Lab
TOTAL 15 1 8 20
III YEAR II SEMESTER
No. Code
Formal Languages and Automata
1 PC PC116CX 3 - - 3
Theory
2 PC PC116CT Data Mining 3 - - 3
3 PC PC116DM Web Technologies 3 - - 3
Professional Elective -2
PE116DA Image Processing
4 PE PE116DD Machine Learning 3 - - 3
PE116DB Internet of Things
Web Technologies and Data
6 PC PC11655 - - 4 2
Mining Lab
Professional Elective -2 Lab
PE11646 Image Processing Lab
7 PE PE11648 Machine Learning Lab - - 2 1
PE11647 Internet of Things Lab
8 PW PW11652 Seminar 2 - - 2
TOTAL 17 - 6 20
COURSE STRUCTURE
IV YEAR I SEMESTER
No. Code
Entrepreneurship and Project
1 HS HS117DZ 3 - - 3
Management
2 PC PC117DQ Compiler Design 3 - - 3
Professional Elective – 3
PE117DN Artificial Intelligence
3 PE PE117DT Distributed Systems 3 - - 3
PE117EQ Soft Computing
PE117ER Software Testing Methodologies
4 PE PE117DP Cloud Computing 3 - - 3
PE117DY Embedded Systems
5 OE OE117XX Open Elective – 3
6 PC PC11756 Compiler Design Lab - - 2 1
7 PW PW11758 Mini Project * - - - 2
8 PW PW11761 Project Phase– I 1 - 4 3
TOTAL 16 - 6 21
*Summer between III & IV Year: Mini Project
IV YEAR II SEMESTER
No. Code
1 PC PC118FF Cryptography & Network Security 3 - - 3
PE118FZ Software Project Management
2 PE PE118FQ Information Retrieval Systems 3 - - 3
PE118FG Data Science using R
PE118FP Human Computer Interaction
3 PE PE118FM Graph Theory 3 - - 3
PE118EX Ad hoc and Sensor Networks
5 PW PW11863 Project Phase– II 2 - 12 8
TOTAL 14 - 12 20
2018-2019 33
Note : Open Elective – Students should take Open Electives from List
of Open Electives Offered by Other Departments/Branches Only.
Ex: - A Student of Computer Science and Engineering can take Open
Electives from all other departments/branches except Open Electives
offered by Computer Science and Engineering Dept.
I Year B.Tech. CSE I-Semester L T P C
Course Code: BS111AA 3 1 - 4
CHEMISTRY
(Common to CSE & IT)
Prerequisites:-Nil-
Course Objectives:
1. To bring adaptability to new developments in engineering chemistry
and to acquire the skills required to become a perfect engineer.
2. To include the importance of water in industrial usage, significance of
corrosion control to protect the structures.
3. To acquire the knowledge of reaction mechanisms involved in various
organic reactions.
UNIT 1: (~8 Lecture Hours)
Molecular Structure and Theories of Bonding: Atomic and molecular
orbitals: Linear combination of atomic orbitals (LCAO), molecular orbitals
of diatomic molecules. Molecular orbital energy level diagrams of
diatomic molecules, N2, O2 and F2. π Molecular orbital diagrams of
butadiene, benzene and aromaticity.
Crystal Field Theory (CFT): Salient Features of CFT: Crystal field
splitting patterns of transition metalion d-orbitals in tetrahedral, octahedral
and square planar complexes. Magnetic properties: Spin only magnetic
moments of transition metals of d 2 -d 9 configuration in octahedral
complexes. Band structure of solids and effect of doping on conductance.
Electrochemistry and Corrosion: Electrochemistry: Conductance:
Specific, equivalent and molar conductance and their interrelationship and
numerical problems. Electrochemical cell: Electrode potential, standard
electrode potential and emf of the cell. Nernst equation, its derivation and
applications. Types of electrodes: Standard hydrogen electrode, calomel
electrode and glass electrode. Electro chemical series and its applications.
Concept of concentration cells: Electrolytic concentration cell and
numerical problems. Batteries: Lead acid storage battery and lithium ion
battery.
Corrosion: Causes and effects of Corrosion: Theories of chemical and
electrochemical corrosion. Mechanism of electrochemical corrosion.
Types of corrosion: Galvanic, waterline and pitting corrosion. Factors
affecting rate of corrosion. Corrosion control methods: Cathodic
2018-2019 35
protection-Sacrificial anode and impressed current cathodic methods.
Surface coatings: Metallic coatings –hot dipping: galvanizing and tinning.
Electroplating: Copper plating and electroless plating - Nickel plating.
Periodic Properties and Nanomaterials: Periodic table: Electronic
configurations, atomic and ionic sizes, ionizationenergies, electronaffinity
and electronegativity. Variations of s,p,d,f orbital energies of atoms in
periodic table. Co-ordination numbers and geometries. Hard and soft acids
and bases. HSAB rule and its applications.
Nanomaterials:Synthesis:Top down and bottom up approaches. Properties
and applications of fullerenes, carbon nanotubes. General applications of
nanomaterials.
Water and its treatment: Hardness of water: Causes of hardness and
types of hardness-temporary and permanent. Expression and units of
hardness. Estimation of hardness of water by complexometric method
and numerical problems. Potable water and its specifications. Steps
involved in treatment of potable water: Disinfection of potable water by
chlorination and ozonisation. Boiler troubles: Scales, sludges, priming,
foaming and caustic embrittlement. Boiler feed water: Internal treatment
by calgon, phosphate and colloidal conditioning and external treatment of
Water by Ion exchange process. Desalination of water: Reverse osmosis.
Sewage and its treatment: primary, secondary and tertiary treatments.
Stereochemistry, Reaction Mechanism and Synthesis of Drug
Molecules: Representation of 3-Dimensional structures: Structural and
stereo isomers, configurations. Chirality, enantiomers, diastereomers,
optical activity and absolute configuration. Conformation analysis of n-
butane. Isomerism in transition metal complexes.
Substitution reactions: Nucleophilic substitution reactions, mechanism
of SN 1 and SN 2 reactions. Addition reaction: Electrophilic and
Nucleophilic addition. Addition of HBr to Propene: Markownikoff and
anti Markownikoff additions. Grignard reactions on carbonyl compounds.
Elimination reactions: Dehydrohalogenation of alkyl halides -Saytzeff
rule. Oxidation reactions: Oxidation of alcohols using KMnO4 and Chromic
acid. Reduction reactions: Reduction of carbonyl compounds using LiAlH4
and NaBH4. Synthesis of Drug molecules: Paracetamol and aspirin.
Text Books:
1. P.C Jain and Jain Monika, Engineering Chemistry, 16 th Edition,
DhanpatRai Publication Company.
2. Morison and Boyd, Organic Chemistry, 7 th Edition, Pearson
publications.
3. B.Rama Devi, Ch. VenkataRamana Reddy and PrasanthRath, Text Book
of Engineering Chemistry, Cengage Learning.
Reference Books:
1. B.H.Mahan University Chemistry, Addison –Wesley Publishing
Company.
2. M.J.Sienko and R.A.Plane, Chemistry: Principles and Applications,
McGraw Hill International.
3. J.D.Lee, Concise inorganic Chemistry, 5th Edition, Oxford Publication.
4. K.P.CVolhadt and N.E Schore, Organic Chemistry: Structure and
Function, 7th Edition, Freeman publications.
5. B.R.Puri and L.R.Sharma and Patani, Principles of Physical Chemistry,
6th Edition, McGraw-Hill Publication.
Online Resources:
1. htttp://www.nptelvideos.in/2017/10/engineering chemistry.html.
2. http://www.nptel.ac.in/engineering chemistry courses.
Course Outcomes:
After completion of the course, students will be able to
1. Analyze microscopic chemistry in terms of atomic and molecular
orbitals.
2. Students will gain the basic knowledge of electrochemical procedures
related to corrosion and its control.
3. Rationalize periodic properties such as ionization potential,
electronegativity and oxidation states.
4. Students can develop and apply the concepts to identify the hardness
and boiler troubles of water.
5. List major chemical reactions that are used in the synthesis of drugs.
6. Students can develop and apply the concepts for the solutions of
complex engineering problems.
2018-2019 37
Course Code: BS111AB 3 1 - 4
LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS
(Common to EEE, ECE, CSE, IT & ETE)
Prerequisites:-Nil-
Course Objectives:
1. To learn the concepts of rank of a matrix and applying it to understand
the consistency of system of equations.
2. To solve system of linear equations.
3. To study properties of Eigen values and Eigen vectors.
4. To find extreme values for functions of several variables.
5. To find the solutions of first, higher order ODE.
6. To evaluate the double and triple integrals for functions of several
variables.
UNIT1: (~8 Lecture Hours)
Linear System of Equations - Types of real matrices and complex matrices,
rank, echelon form, normal form, consistency and solution of linear systems
(homogeneous and Non-homogeneous), LU decomposition method.
Eigen values and Eigen Vectors - Eigen values, Eigen vectors and their
properties. Cayley - Hamilton theorem (without proof), Inverse and powers
of a matrix using Cayley - Hamilton theorem, Diagonalization.
Differential Equations – Linear, Bernoulli’s, Exact Differential Equations,
Differential Equations Reducible to exact, Orthogonal trajectories.
Linear differential equations of higher order with constant
coefficients: Non-homogeneous differential equations with RHS term of
the type polynomials in x,
Method of variation of parameters, Applications to Electrical circuits.
Functions of Several Variables – Limit & Continuity (Definitions), Partial
derivatives, Chain rules, total derivative, differentiation of implicit
functions, Jacobian, functional dependency. Maxima and minima of
functions of two variables (with and without constraints) and Lagrange’s
method of undetermined multipliers.
Multiple Integrals - Double and triple integrals, change of variables,
Change of order of integration.
Applications: Finding areas as double integral and volumes as triple
integrals.
Text Books:
1. Dr. B. S. Grewal, Higher Engineering Mathematics, 45th Edition, Khanna
Publishers.
2. N. P. Bali, Engineering Mathematics, 1st Edition, Lakshmi Publications.
Reference Books:
1. B.V.Ramana, Higher Engineering Mathematics, 1 st Edition, Tata
McGraw-Hill Publications.
2. E.Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley
and Sons Publisher.
3. Srimanta Pal, Subodh C. Bhunia, Engineering Mathematics, 1st Edition,
Oxford Higher Education.
Online Resources:
1. http://www.nptelvideos.in/2012/11/mathematics.html
2. http://nptel.ac.in/courses/111106051/
Course Outcomes:
After completion of the course, the students will be able to
1. Solve and analyze the solution for the system of equations.
2. Compute the Eigen values and Eigen vectors which come across under
linear transformations.
3. Determine the extreme values of functions of two variables with/ without
constraints.
4. Find the solutions of ordinary differential equations.
5. Evaluate double and triple integrals.
6. Apply the knowledge of mathematics for real situations.
2018-2019 39
Course Code: ES111AD 3 1 - 4
BASIC ELECTRICAL ENGINEERING
Prerequisites:-Nil-
Course Objectives:
1. To introduce the concepts of Basic Electrical parameters.
2. To analyze basic concepts of AC & DC circuits.
3. To carry out operational analysis of Electrical Machines, Transformers
and power converters.
Magnetic Circuits and DC Circuits
Magnetic Circuits: Magnetic circuits- MMF, flux, reluctance, Inductance;
B-H curve of magnetic materials; Minimization of Hysteresis and Eddy
current losses.
DC Circuits: Electrical Circuit elements: R, L and C, voltage and current
sources, Star-Delta Transformation, Kirchoff’s laws, Nodal and Mesh
analysis of simple circuits with dc excitation, Superposition, Thevenin’s
and Norton’s Theorems with independent sources- Simple Problems.
AC Circuits
1-φ AC Circuits: Representation of sinusoidal waveforms, peak and rms
values, phasor representation, real power, reactive power, apparent power,
power factor; Analysis of single-phase ac circuits consisting of R, L, C,
RL, RC, RLC combinations, series and parallel resonance.
3- φAC Circuits: Three phase balanced circuits, voltage and current
relations in star and delta connections - Simple Problems.
DC Machines and Transformers
Basic Concepts: Faraday’s laws of Electromagnetic induction – statically
& dynamically induced emf-Lenz’s law - Fleming’s Right hand rule.
DC Machines: Principle of operation - Construction - working; Types of
DC machines-EMF and Torque equation; Torque-Speed characteristics and
speed control of separately excited DCMotor - Numerical problems.
Transformers: Ideal and practical transformer, EMF equation, Simple
Problems. Equivalent circuit- losses in transformers, Three phase
transformer connections (Descriptive treatment only).
AC Machines (Descriptive treatment only)
3-φ Induction motors: Principle of Operation, Construction of a Three-
Phase Induction Motor; Production of rotating magnetic field; slip-
frequency of rotor emf - starting Torque -Torque under running conditions.
Torque - Slip characteristics.
Induction motors: Basic concepts of 1-φInduction motors: Split-phase
Induction Motor;
Synchronous Machines: Principle of Operation of Synchronous
Generators.
Power Converters & Switchgear (Descriptive treatment only)
Basic Concepts: Basic Semiconductor Devices: Diode, Transistor, SCR;
Power Converters: DC-DC Buck and Boost Converters; Single Phase
Inverters- Half & Full, Bridge Configuration (Elementary treatment only).
Switchgear: Introduction to Components of LT (Low Tension) Switchgear:
Switch Fuse Unit (SFU), MCB, ELCB, MCCB. Types of Wires and Cables,
Earthing.
Text Books:
1. T.K.Nagasarkar and M.S.Sukhija, Basic Electrical Engineering, 3rd
Edition 2018, Oxford University Press.
2. V.K Mehta, Rohit Mehta, Principles of Electrical Engineering, S.Chand
Publications.
Reference Books:
1. D.P.Kothari and I.J.Nagrath Basic Electrical Engineering, Tata McGraw
Hill, 2010.
2. V.DelToro, Electrical Engineering Fundamentals, Prentice Hall India,
1989.
3. D.C.Kulshreshtha, Basic Electrical Engineering, McGraw Hill, 2009,.
Course Outcomes:
After completion of this course, students will be able to
1. Analyze the basic circuits with application of Network Reduction
Techniques and Network Theorems.
2. Understand and analyze magnetic circuits.
3. Analyze the working principles of electrical machines and power
converters.
4. Understand the components of low voltage electrical installations.
5. Apply the above conceptual theories to real world Electrical &
Electronic problems and applications.
6. Understand and apply the Knowledge of various types of protective
systems in real time.
2018-2019 41
Course Code: ES111AF 3 - - 3
PROGRAMMING FOR PROBLEM SOLVING
Prerequisites:-Nil-
Course Objectives:
1. Learn the fundamentals of computers.
2. Understand the various steps in program development.
3. Learn the syntax and semantics of C programming Language.
4. Learn how to write modular and readable C programs.
5. Learn to write programs using structured programming approach in C
to solve problems.
Introduction to Computers- Computer Systems, Computing Environ-
ments, Computer Languages, Creating and running programs, Program
Development, algorithms and flowcharts, Number systems - Binary,
Decimal, Hexadecimal and Conversions. Introduction to C Language -
Background, C Programs, Identifiers, Types, Variables, Constants, Input /
Output, Operators (Arithmetic, relational, logical, bitwise etc.),
Expressions, Precedence and Associativity, Expression Evaluation, Type
conversions.
Statements - Selection Statements (making decisions)- if and switch
statements.
Repetition statements (loops) - while, for, do-while statements, Loop
examples, other statements related to looping – break, continue.
Arrays-Concepts, using arrays in C, array applications-linear search, binary
search and bubble sort, two – dimensional arrays, multidimensional arrays.
Strings – Concepts, C Strings, String Input / Output functions, arrays of
strings, string manipulation functions.
Functions - Designing Structured Programs, Functions, user defined
functions, inter function communication, Standard functions, Scope,
Storage classes - auto, register, static, extern, scope rules, type qualifiers,
recursion - recursive functions, Limitations of recursion.
Pointers – Introduction (Basic Concepts), Pointers for inter function
communication, pointers to pointers, compatibility, Pointer Applications-
Arrays and Pointers, Pointer Arithmetic and arrays, Passing an array to a
function, memory allocation functions, array of pointers, programming
applications, pointers to void, pointers to functions.
Enumerated, Structure and Union Types- The Type Definition (typedef),
Enumerated types, Structures - Declaration, initialization, accessing
structures, operations on structures, Complex structures- Nested
structures, structures containing arrays, structures containing pointers,
arrays of structures, structures and functions, Passing structures through
pointers, self-referential structures, unions, bit fields.
Introduction to files, Using files in C, Reading data from files- fscanf(),
fgets(), fgetc(), fread(), Writing Data to files - fprintf(), fputs(), fputc(),
fwrite(), Detecting the End-of-File, Error Handling functions, Random
access to files, Command Line Arguments, preprocessor commands.
Text Books :
1. B.A.Forouzan and R.F.Gilberg,Computer Science: A Strucured
Programming Approach Using C, 3rd Edition, Cengage learning.
2. Reema Thareja, Introduction to C Programming, 2nd Edition, Oxford
University Press.
Reference Books :
1. Byron Gottfried, Schaum’s Outline of Programming with C, 2nd Editon,
McGraw-Hill.
2. E.Balaguruswamy, Programming in ANSI C, 7th Edition, Tata McGraw-
Hill.
3. C Programming Language, B.W.Kernighan & Dennis Ritchie,
2nd Edition, PHI.
Online Resources:
www.geeksforgeeks.org
Course Outcomes:
1. Formulate and translate algorithms for arithmetic and logical problems
to programs (in C language).
2. Test and execute the programs and correct syntax and logical errors.
3. Implement conditional branching, iteration and recursion.
4. Decompose a problem into functions and synthesize a complete
program.
5. Use arrays, pointers and structures to formulate programs.
6. Understand the concepts of files and perform operations on them.
2018-2019 43
Course Code: BS11101 - - 2 1
CHEMISTRY LAB
Prerequisites:-Nil-
Course Objectives:
1. Chemistry Laboratory curriculum gives the students hands on
experience about various scientific and technical aspects.
2. Provide the students with a solid foundation in Chemistry laboratory
required to solve engineering problems.
3. To provide an overview of preparation of drugs.
List of Experiments:
Volumetric Analysis:
1. Estimation of hardness of water by Complexometric method using
EDTA.
2. Estimation of Ferrous ion by Permanganometry.
3. Estimation of Ferrous ion by Dichrometry.
4. Estimation of Chloride by Argentometry.
Chemical kinetics:
5. Determination of rate constant of acid catalysed hydrolysis of methyl
acetate.
Instrumental methods of Analysis:
6. Estimation of HCl by Conductometry.
7. Estimation of HCl and acetic acid in a given mixture by Conductometry.
8. Estimation of HCl by Potentiometry.
9. Estimation of Ferrous by Potentiometry using Potassium dichromate
(redox).
10.Estimation of manganese in KMnO4 by Colorimetry.
11. Determination of Viscosity of coconut oil and castor oil.
Synthesis of Drug molecule:
12.Preparation of Aspirin and Paracetamol.
Text Books:
1. B.D.Khosla, A.Gulati and V. Garg, Senior practical physical chemistry
(R.C,and and Co., Delhi).
2. K.K.Sharma and D.S.Sharma, An introduction to practical chemistry
(Vikaspublishing,N.Delhi).
3. Y.Bharathikumari and JyotsnaCherukuri, Laboratory manual of
engineering chemistry (VGS booklinks).
Reference Books:
1. Vogel’s Text book of Quantitative chemical analysis, 5th Edition, 2015.
2. Payal B. Joshi,Experiments in Engineering chemistry, 1st Edition, I.K
International Publishing house.
Online Resources:
http://www.nptel videos.in engineering chemistry labexperiments. htm
Course Outcomes:
After the completion of the course, the students will be able to
1. Expected to learn from this laboratory course the concept of error
and its analysis.
2. Demonstrate writing skills and can derive valid conclusions.
3. Compare the experimental results with those introduced in lecture,
draw relevant conclusions and substantiate.
4. Learn the ability to prepare advanced polymer materials.
5. Work on time reactions, thereby can get in depth knowledge on
chemical kinetics.
6. The course allows the students to develop and design new experimental
skills relevant to the course.
2018-2019 45
Course Code: ES11103 - - 3 1.5
BASIC ELECTRICAL ENGINEERING LAB
Prerequisites:-Nil-
Course Objectives:
1. To verify the Network Theorems and understand the usage of common
electrical measuring instruments.
2. To understand the basic characteristics of transformers and electrical
machines.
3. To get an exposure to the working of power electronic converters.
PART-A (Compulsory)
1. A) Basic Safety Precautions.
B) Study of measuring instruments & elements.
a) Voltmeters, Ammeters, Wattmeters, Multimeters, CRO.
b) Resistors, Inductors & Capacitors.
2. Study of Cut - out sections of
a) DC Machine b) 3-φ Induction Machine (cage type).
3. Study of Cut - out sections of
c) Synchronous Machine d) 1- φInduction Machine.
4. A) Study of Converters
a) DC – DC converters. b) DC – AC converters.
B) Study of Components of LT switchgear
a) SFU b) MCB c) ELCB d) MCCB
5. Series resonance. Determination of Resonant frequency & Bandwidth.
6. Parallel resonance. Determination of Resonant frequency & Bandwidth.
7. Verification of Superposition theorem with DC excitation.
8. Verification of Thevenin’s & Norton’s theorems with DC excitation.
PART-B (Any Two)
1. Load test on a 1-φ transformer. Determination of efficiency.
2. Verification of voltage and current relations in a 3 -φ transformer.
3. Measurement of Power in a 3 -φ balanced load.
4. Torque v/s speed characteristics of a separately excited DC motor.
5. Torque-slip characteristics of a 3 -φ Induction Motor.
6. OCC characteristics of a synchronous generator.
Note: All Experiments from PART-A and any Two Experiments from
Part –B are to be conducted
Course Outcomes:
After completion of this course, students will be able to
1. Identify & use basic measuring instruments and their usage.
2. Verify different network theorems with dc excitation.
3. Carry out analysis of simple circuits with dc excitation.
4. Analyze bridge rectifiers.
5. Identify power converters.
6. Identify different electrical machines & their characteristics.
2018-2019 47
PROGRAMMING LAB
Prerequisites:-Nil-
Course Objectives:
1. Learn Basic programming concepts.
2. Learn the syntax and semantics of C programming Language.
3. Write programs in C using structured programming approach to solve
the problems.
Week 1: Familiarization with programming environment.
Introduction to the working environment, Compiling, running and
debugging C Programs, Simple C programs.
Week 2: Simple computational problems using arithmetic expressions
a. Write a C program which reads time required (in Hours and Minutes)
to complete two tasks and then print the total time in hours and minutes.
b. Write a C program which reads five students marks in a test and then
prints average mark of passed students (Assume that a minimum of 35
is needed to pass) using operators.
c. Assume an Object is thrown upwards with some initial velocity, u (in
m/sec). Write a C program to find the maximum height which it can
reach. Assume acceleration due to gravity is 9.8m2 /sec.
Hint: Maximum height, h=u2 /2g.
Week 3: Problems involving if-then-else structures and switch statement
a. Write a C program to check whether a given number is even or odd
using bitwise operator.
b. Write a C program to find the roots of a quadratic equation.
c. Write a C program to carry out the arithmetic operations addition,
subtraction, multiplication, division and modulus using switch
statement.
Week 4: Iterative problems
a. Write a C program to find whether a given number is Armstrong or
not.
b. Write a C program to determine if the given number is a prime number
or not.
c. Write a C program to calculate the following Series:
Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!
d. Write a C program to find the number of even and odd digits in a given
number.
Week 5: Applications of 1D Array
a. Write a C program to generate all the prime numbers between 1and n,
where n is a value supplied by the user using Sieve of Eratosthenes
algorithm.
b. Write a C program to search for a Key value in a given list of integers.
Use linear search.
c. Write a C program to search for a Key value in a given list of integers.
Use binary search.
d. Write a C program to implement Bubble sort method to sort a given
list of integers in ascending order.
Week 6: Applications of Strings
a. Write a C program to perform the following:
i) To insert a sub-string into a main string at a given position.
ii) To delete n characters from a given position in a string.
b. Write a C program to determine whether the given string is a palindrome
or not.
c. Write a C program to replace a substring with another in a given line of
text.
Week 7: Applications of 2D arrays and Strings
a. Write a C program that reads two matrices and performs Addition of
two matrices.
b. Write a C program that reads two matrices and performs Multiplication
of two matrices.
c. Write a C program to Sort Array of Strings.
Week 8: Simple functions
a. The least common multiple (LCM) of two positive integers a and b is
the smallest integer that is evenly divisible by both a and b. Write a C
program that reads two integers and calls LCM (a, b) function that
takes two integer arguments and returns their LCM. The LCM (a, b)
function should calculate the least common multiple by calling the
GCD (a, b) function and using the following relation: LCM (a, b) = ab
/ GCD (a, b).
b. Write a function to find the factorial of a positive integer.
c. Write a menu-driven C program that allows a user to enter n numbers
and then choose between finding the smallest, largest, sum or average.
Use a switch statement to determine what action to take. Display an
error message if an invalid choice is entered.
2018-2019 49
d. Write a C program that reads two integers and calls a factorial function
to compute ncr value.
Week 9: Recursive functions
a. Write a C program that reads two integers x and n and calls a recursive
function to compute xn.
b. Write a C program that uses a recursive function to solve the Towers
of Hanoi problem.
c. Write a C program that uses a recursive function to generate Pascal’s
triangle.
d. A Fibonacci sequence is defined as follows: the first and second terms
in the sequence are 0 and 1. Subsequent terms are found by adding the
preceding two terms in the sequence. Write a C program which calls a
recursive function to generate the first n terms of the sequence.
Week 10: Pointers and dynamic memory allocation
a. Write a C program to find the number of times a given word (i.e., a
short string) occurs in a sentence.(i.e., a long string).
b. Using pointers, write a function that receives a character string and a
character as argument and deletes all occurrences of this character in
the string. Function should return the corrected string with no spaces.
c. Write a C program to find the maximum from a set of elements. The
number of elements will be decided during the execution of the
program.
Week 11: Structures
a. Write a menu-based program in C that uses a set of functions to perform
the following Operations:
i) Reading a Complex number ii) Writing a complex number
iii) Addition of two complex numbers iv)Subtraction of two complex
numbers
v) Multiplication of two complex numbers
Represent the complex number using a structure.
b. Declare a structure to store the following information of an employee:
Employee code, Employee name, Salary, Department number, Date of
joining (it is itself a structure consisting of day, month and year). Write
a C program to store the data of N employees where N is given by the
user (Use dynamic memory allocation). Include a Menu that allows
user to select any of the following features:
i) Use a function to display the employee information who are

drawing the maximum and minimum salary.
ii) Use a function to display the employee records in ascending order
according to their date of joining.
Week 12:
a. Write a C program to display the contents of a file to standard output
device.
b. Write a C program which copies one file to another, replacing all
lowercase characters with their uppercase equivalents.
c. Write a C program to count the number of times a character occurs in
a text file. The file name and the character are supplied as command-
line arguments.
d. Write a C program to reverse the first n characters in a file. The file
name and n are specified on the command line. Use fseek function.
Text Books:
1. B.A.Forouzan and R.F.Gilberg, Computer Science: A Structured
Programming Approach Using C, 3rd Edition, Cengage learning.
Reference Books:
1. Byron Gottfried, Schaum’s Outline of Programming with C, 2nd Editon,
McGraw-Hill.
2. Yashavant P. Kanetkar, Let Us C, 13th Edition, Bpb Publications.
3. B.W.Kernighan& Dennis Ritchie, C Programming Language,
2nd Edition, PHI.
4. E.Balaguruswamy, Programming in ANSI C, 7th Edition, Tata McGraw-
Hill.
Online Resources:
www.geeksforgeeks.org
Course Outcomes:
1. Compile, debug and test the program.
2. Apply the knowledge in C to write modular, structured programs in
solving real world problems.
3. Design programs to solve mathematical and scientific problems.
4. Write structured programs using control structures and functions.
5. Demonstrate usage of pointers and structures.
6. Solve problems using file concepts.
2018-2019 51
I Year B.Tech. CSE II-Semester L T P C
Course Code: BS112AC 3 1 - 4
PHYSICS
Prerequisites:-Nil-
Course Objectives:
1. To understand the interaction of light with matter through interference
and diffraction.
2. To understand the behavior of a particle quantum mechanically.
3. To understand the importance of dielectric and magnetic materials.
4. To analyze the semiconductors and semiconductor devices.
5. To understand the construction and working principle of different types
of lasers and light propagation through optical fiber.
Wave optics: Huygens’ Principle, superposition of waves, Interference
of light by division of wavefront and amplitude. Young’s double slit
experiment, Interference from a thin plane glass plate (reflected light),
Newton’s rings experiment. Types of diffraction, Farunhofer diffraction
due to single slit and ‘N’ slits; Diffraction grating experiment.
Principles of Quantum mechanics and Band theory of solids:
Introduction to Quantum mechanics, Wave particle duality and de-Broglie
hypothesis, Davission–Germer experiment; Uncertainty principle, Time-
dependent and time independent Schrodinger equation for wave function,
Born interpretation; Free-particle wave function, Particle in 1D box (square
well potential) energy values, Expectation values vs position in the box.
Density of states and occupation probability; Kronig-Penny model (using
Bloch theorem; qualitative), Energy bands in solids, E-k diagram,
classification of materials: Metals, Semiconductors and Insulators,
Effective mass of an electron.
Dielectric and magnetic materials: Dielectric materials: Electric
dipole, Dipole moment, Dielectric constant, Polarizability, Electric
susceptibility, Displacement vector, electronic, ionic and orientation
polarizations, their polarizabilitity expressions, internal field and Clausius-
Mossotti(equations only); Piezoelectricity, pyroelectricity and
ferroelectricity and their applications; BaTiO3 structure.
Magnetic materials: Permeability, field intensity, magnetic field
induction, magnetization, magnetic susceptibility, origin of magnetic
moment, Bohr magneton, classification of dia, para and ferro magnetic
materials on the basis of magnetic moment, hysteresis curve based on
domain theory, soft and hard magnetic materials, properties of antiferro
and ferri magnetic materials,
Superconductivity: Superconductivity phenomenon, Meissner effect,
applications of superconductivity.
Semiconductors: Intrinsic and extrinsic semiconductor carrier
concentrations, intrinsic carrier concentration; Dependence of Fermi level
on carrier-concentration and temperature (equilibrium carrier statistics),
Carrier generation and recombination, Diffusion and drift phenomenon
(Qualitative), Formation of PN junction, open circuit PN junction, energy
diagram of PN junction diode, Direct and indirect bandgaps; Hall-effect,
Semiconductor materials of interest for optoelectronic devices (LED,
Solar cell).
LASERs and Optical Fibers: LASERS: Properties of laser beams:
Mono-chromaticity, coherence, directionality and brightness, laser
speckles, Einstein’s theory of matter radiation interaction and A and B
coefficients; amplification of light by population inversion, different types
of lasers: gas lasers (He-Ne), solid-state lasers (ruby), Semiconductor
Lasers; applications of lasers in science, engineering and medicine.
Fiber Optics: Introduction, light propagation through optical fibre: Total
internal reflection, Types of optical fibres: step and graded index fibres,
Acceptance angle, Numerical aperture, Attenuation and bending losses in
optical fibres, Applications of optical fibres in Communication, Medicine
and as sensors.
Text Books:
1. MN Avadhanulu & PG Kshirsagar, A text book of Engineering Physics,
revised Edition of 2014, S Chand.
2. DK Bhattacharya & Poonam Tandon, Engineering Physics, fourth
impression, 2017, Oxford press.
Reference Books:
1. Eisberg and Resnick, Quantum Physics, 2nd Edition, Wiley.
2. B. E. A. Saleh and M. C. Teich, Fundamentals of Photonics, John Wiley
& Sons, Inc., 2007.
2018-2019 53
3. Material Science by Armugam, Anuradha publications,
4. Physics of the atom by Wehr and Richards. 4th Edition, Narosa.
Online Resources:
1. http://www.cod.edu/people/faculty/cartert/phy2112/slides/Lect29-
physical-optics-handout.pdf
2. https://www2.physics.ox.ac.uk/sites/default/files/2012-02-17/
optics_lectures_2012_pdf_10837.pdf
3. h t t p : / / w w w . i a p . u n i - j e n a . d e / i a p m e d i a / d e / L e c t u r e /
Physical+optics1501538400/PO16_Physical+optics+8+ Lasers.pdf
4. h t t p : / / a l a n . e c e . g a t e c h . e d u / E C E 6 4 5 1 / L e c t u r e s / E C E
6451L1IntroductionToElectronicMaterials.pdf
5. https://www.colorado.edu/physics/phys3330/phys3330_fa11/
Lecture%20notes/semiconductor%20lectures%202011.pdf
6. http://www.seklad69associates.com/seklad69associates.com/
EEG_811_files/Semiconductor%20Physics.pdf
7. https://www.youtube.com/watch?v=03j4ZvQCKWY
Course Outcomes:
1. Realize the importance of light interaction with matter and its effects
of superposition.
2. Understand the quantum mechanical behavior of particles in different
field environments.
3. Distinguish materials on the basis of their electric and magnetic
behavior and their applications.
4. Estimate the carrier concentration of different types of
semiconductors and be able to understand the working of
optoelectronic devices.
5. Realize the importance of Lasers in engineering fields.
6. Understand the underlying principles of optical fibers and fiber optics.
Course Code: BS112AG 3 1 - 4
NUMERICAL TECHNIQUES AND TRANSFORM CALCULUS
Prerequisites:-Nil-
Course Objectives:
1. To learn an alternative method for analytical methods in mathematical
concepts.
2. To apply numerical techniques in solving ordinary differential
equations.
3. To study the properties of vector valued functions and differential
operators.
4. To attain the knowledge on integrals of vector valued functions.
Numerical Solutions of Algebraic and Transcendental Equations:
Introduction, Bisection Method, Regula-False method, Iteration method
and Newton Raphson method. Solving linear system of equations by Gauss-
Jacobi and Gauss-Seidel method.
Curve Fitting: Fitting a linear, second degree, exponential curve by
method of least squares for the discrete data.
Numerical integration: Newton-Cote’s Quadrature Formula, Trapezoidal
Rule, Simpson’s 1/3rd and 3/8th Rule.
Numerical solutions of Ordinary Differential Equations: Solution
of ordinary differential equations by Taylor’s Series, Picard’s method of
Successive approximations, Euler’s and Modified Euler’s methods, Fourth
Order Runge-Kutta Method.
Laplace Transforms - Laplace Transform of Standard functions, First
and Second Shifting Theorems, Transforms of derivatives and integrals,
Multiplication and Division by ‘t’, Laplace Transform of Periodic Function,
Unit Step function, Dirac’s Delta function.
Inverse Laplace Transform- Method of Partial Fractions, Convolution
theorem (without proof) Applications of Laplace Transforms to Ordinary
Differential Equations.
2018-2019 55

Vector Differentiation- Scalar and Vector point functions, Gradient,
Divergence, Curl and related properties, Unit Normal Vector, Directional
Derivatives and Angle between the surfaces, Laplacian operator, Vector
identities.
Vector Integration - Line Integral-Work Done-Potential function, Area,
Surface and Volume Integral.
Vector Integral Theorems: Green’s theorems, Stoke’s theorems and
Gauss’s divergence theorems (Without Proofs) and their Verification.
Text Books:
1. Dr.B.S Grewal, Higher Engineering Mathematics, 45th Edition, Khanna
Publishers.
2. M.K.Jain, S.R.K.Iyengar and R.K.Jain, Numerical Methods for Science
and Engineering Computation, 6th Edition, New Age International
Publishers.
Reference Books:
1. R K Jain & S R K Iyengar, Advanced Engineering Mathematics,
5th Edition, Narosa Publishers.
2. Murray R Spiegel and Seymour Lipschutz, Vector Analysis, 2nd Edition,
Schaums’ Outlilne Series.
3. S.S.Sastry, Introductory Methods of Numerical Analysis, 5th Edition,
PHI Learning Pvt. Ltd.
Online Resources:
1. https://onlinecourses.nptel.ac.in/noc17_ma14/preview
2. nptel.ac.in/courses/117101056/17
Course Outcomes:
1. Find the root of the equation and solution of a system of equations.
2. Fit a curve for the given data.
3. Find the Numerical solutions for a given first order initial value
problem.
4. Use Laplace Transform techniques for solving ODE’s.
5. Verify the irrotational and solenoidal fields and find the potential
function.
6. Evaluate the line, surface and volume integrals and converting them
from one to another.
Course Code: HS112AJ 2 - - 2
ENGLISH
Prerequisites:-Nil-
Course Objectives:
1. To enable the students to understand the importance of English and to
develop their basic proficiency in the English language.
2. To train the students to expand their vocabulary and to understand the
usage of vocabulary technically and literally.
3. To develop the reading competence of the students through the sub skills
of reading.
4. To equip the students with an ability to produce grammatically correct
sentences and coherently well-developed paragraphs.
5. To enable the students to develop an appreciation of how the formal
elements of language and genre shape meaning and to gain richer
understanding of both the text and the cultural context.
● Reading Comprehension: Short story Cause, Then Cure from Wise
and Otherwise by Sudha Murthy. Reading Skills: SQW3R Method and
guessing and predicting.
● Vocabulary Building: Word formation - Root words - Prefixes and
Suffixes - Word formation.
● Remedial Grammar: Error correction related to: Subject - Verb
Agreement, Noun - Pronoun Agreement, and other aspects that are
reflected through their writing.
● Writing Skills: Sentence structure - Use of Phrases and Clauses in
sentences - Sentence Types: Assertive, Declarative, Interrogative,
Exclamatory, sentences and Simple, Compound, Complex and
Compound-Complex Sentences - Usage of punctuation marks.
● Reading Comprehension: Poem Caged Bird from A Collection of
Hundred Poems by Maya Angelou. Reading Skills: STEM Technique,
vocabulary and intended meaning.
● Vocabulary Building: Synonyms-Antonyms-Acronyms- Abbreviations
● Remedial Grammar: Error Correction related to: Articles and
Prepositions, Tenses, Conditional clauses, Tag Questions; and other
aspects that are reflected through their writing.
2018-2019 57
● Writing Skills: Principles of Paragraph writing - Cohesive Devices -
Creating Coherence - Topic sentence and supporting sentences in a
Paragraph - Techniques for writing Precisely - Jumbled sentences.
UNIT 3: (~ 6 Lecture Hours)
● Reading Comprehension: General Reading versus Academic Reading
Reading Skills: Reading for gist, main ideas, specific details.
● Vocabulary Building: Homophones - Homonyms –Homographs -
Words often confused.
● Remedial Grammar: Error correction related to: Adjectives and
Adverbials, Misplaced modifiers, Redundancies; and other aspects that
are reflected through their writing.
● Writing skills: Precis writing and Summarizing.
● Reading Comprehension: Excerpt from Wings of Fire: An
Autobiography Looking Ahead from APJ Abdul Kalam with Arun Tiwari
Abridged version.
Reading Skills: Reading for inference, discourse markers,
contextualization, summarizing.
● Vocabulary Building: Phrasal verbs- collocations-Idioms.
● Remedial Grammar: Error corrections related to: Adverbs and
Adjectives, Syntactical errors and punctuation marks; and other aspects
that are reflected through their writing.
● Writing Skills: Letter Writing-Introducing oneself-Statement of Intent
-Asking for direction-Seeking / giving information-Apologizing.
● Reading Comprehension: Travelogue The Pamplona Clone:
Jallikattufrom Intriguing India-The Historic South by Hugh and
Colleen Gantzer.
Reading Skills: Understanding the organization of text, global
comprehension.
● Vocabulary Building: One-word substitute - General vocabulary versus
Academic vocabulary - Literal meaning versus contextual meaning.
● Remedial Grammar: Sentence corrections and Editing and proof
reading; and other aspects that are reflected through their writing.
● Writing Skills: Letter of Application: Covering letter and Resume
Writing.
Note: The content prescribed for Reading Comprehension is for Reading
Practice only and shall not be given for assessment and evaluation. An
unknown Reading Passage shall be given for assessment and evaluation to
test the Reading Skills.
Text Books :
1. Vibrant English by Orient Blackswan, 2013.
2. Language and Life: A Skills Approach by Orient Black Swan, 2018.
Reference Books:
1. Sudha Murthy, Wise & Otherwise - A Salute to Life Penguin Books,
2006.
2. Hugh and Colleen Gantzer, Intriguing India - The Historic South NIYOGI
Books, 2012.
3. Collection of Poems //www.poetryfoundation.org//
4. Mukul Chowdhry, Simplified and abridged Wings of Fire: An
Autobiography, APJ Abdul Kalam with Arun Tiwari University Press
Pvt. Ltd., 2004.
Online Resources:
1. https://onlinecourses.nptel.ac.in/noc16_hs01
2. https://nptel.ac.in/courses/109106094/5
Course Outcomes:
1. Read complex texts actively comprehending the literal and figurative
use of language and be able to read in-between the lines.
2. Write grammatically correct sentences and coherently well- developed
paragraphs.
3. Apply the reading techniques and comprehend the passages critically.
4. Use appropriate vocabulary in the given context.
5. Appreciate how different genres use language and shape meanings.
6. Articulate clear questions, to provoke critical thinking, and ideas in
class discussion to speak confidently in public.
2018-2019 59
Course Code: ES112AE 1 - 3 2.5
ENGINEERING GRAPHICS
Prerequisites:-Nil-
Course Objectives:
The course will enable the students
1. To impart skills of drawing instruments and their use to convey exact
and complete information of any object.
2. To construct conics and cycloidal curves used for various engineering
applications.
3. To impart knowledge about standard principles of orthographic
projection of objects.
4. To develop different surfaces of simple solids.
5. To differentiate between isometric view and projection and conversion
of isometric views to orthographic views vice-versa.
UNIT 1: (~4 Lecture Hours and 12 Practical Hours)
Introduction to Engineering Graphics: Principles of Engineering Graphics
and their significance, Conic Sections-general and special methods,
Cycloid, Epi- cycloid and Hypo- Cycloid.
Orthographic Projections: Principles of Orthographic Projections –
Conventions - Projections of points, straight lines and planes.
Projection of Solids: Projections of solids in simple position (prisms,
pyramids, cylinders and cone), axis inclined to one plane, Axis inclined to
both the reference planes, Projection of solids using auxiliary plane
method.
Development of Surfaces: Basic concepts of development of surfaces,
Methods of development - Parallel line development and radial line
development, Development of prisms, pyramids, Cylinders and cones.
Isometric & Orthographic Projections: Principles of Isometric Projection
- Isometric Scale - Isometric Views - Conventions - Isometric views of
Lines, Plane figures, Simple Solids - Conversion of Isometric Views to
Orthographic Views.
Text Books:
1. Basanth Agrawal, Agrawal C.M., Engineering Graphics, 1st Edition, Tata
McGraw Hill, 2012.
2. Bhatt N.D., Elementary Engineering Drawing, Charotar Publishers,
2014.
Reference Books:
1. K .L. Narayana and P.Kannaiah, Engineering Drawing, scitech, 2010.
2. Venugopal.K, Engineering Drawing and Graphics Plus Autocad, New
Age International (P) Ltd., New Delhi, 2010.
3. Gill P.S., Engineering Drawing: Geometrical Drawing, SK Kataria &
sons., 2012.
4. Dhananjay A Jolhe, Engineering Drawing, Tata McGraw Hill, 2014.
Online Resources:
1. www.engineeringdrawing.org
2. Virtual labs (www.vlab.co.in)
Course Outcomes:
At the end of the course, the students will be able to
1. Know and understand the conventions and methods of Engineering
Graphics.
2. Construct the conics using different methods and cycloidal curves.
3. Draw and understand about orthographic projections of points, straight
lines and planes.
4. Improve visualisation skills in different types of solids.
5. Draw and understand about the development of surfaces of various
solids.
6. Ability to read, understand and interpret engineering drawings.
2018-2019 61
Course Code: BS11208 - - 3 1.5
PHYSICS LAB
Prerequisites:-Nil-
Course Objectives:
1. Students are introduced to handling different instruments to conduct
experiments as well as to interpret the data.
2. Students are introduced to experiments as to interpret the data and
correlate the same with their understanding of its theory.
3. The objective of the course is to enable students to design experiments
and analyses the concepts.
1. Dispersive power of the material of a prism – Spectrometer.
2. Determination of wavelengths of white source – Diffraction grating.
3. Newton’s Rings – Radius of curvature of Plano convex lens.
4. Melde’s experiment – Transverse and longitudinal modes.
5. Time constant of an R- C circuit (Charging and Discharging).
6. L-C-R circuit.- Resonance & Q-factor (series / Parallel).
7. Magnetic field along the axis of current carrying coil - Stewart and
Gees method and to verify Biot – Savart’s law.
8. Evaluation of numerical aperture of a given optical fiber.
9. Bending and attenuation losses of fibers.
10.Energy gap of a material of p-n junction.
11. Torsional pendulum – Rigidity modulus.
12.Wavelength of light and determining the LPI of unknown grating of a
diffraction grating using laser.
13.V-I characteristics of a solar cell.
14.Quantum dots (Beyond syllabus).
Note: Minimum 12 experiments must be performed.
Text Books:
Manual as prepared for the college by the faculty.
Online Resources:
1. http://www.bsauniv.ac.in/UploadImages/Downloads/PHYSICS - LAB -
MANUAL2017-(new-regulation). pdf
2. http://jnec.org/Lab-manuals/FE/Physics.pdf
3. https://www.myphysicslab.com/(simple simulations)
4. https://www.iist.ac.in/departments/physics-lab
5. https://wci.llnl.gov/simulation
Course Outcomes:
1. Handle different measuring instruments and asses their accuracy of
measurement.
2. Experiment and analyze the results to derive valid conclusions.
3. Compare the experimental results with those introduced in lecture,
draw relevant conclusions and substantiate.
4. Develop the experimental skills to design new experiments in
engineering.
5. Understand the ethics of working environment and deliver the results
in time.
6. Engage themselves in team work and understand each other’s strengths.
2018-2019 63
Course Code: HS11212 - - 2 1
ENGLISH PROFESSIONAL AND
COMMUNICATION SKILLS LAB
Prerequisites:-Nil-
Course Objectives:
1. To introduce the students to the pronunciation symbols and associated
sounds of English.
2. To enable the students understand the concept of syllable, word accent
and intonation.
3. To enhance the listening skills to understand the nuances of accent,
expression, tone and intended meaning to make them understand the
difference between stress timed language and syllable timed language.
4. To help the students overcome their inhibitions while speaking English
fluently thereby to build their confidence to express their ideas in
English.
5. To help the students understand the importance of inter-personal
communication, team dynamics and role behavior at the work place.
List of Activities:
Multimedia Lab:
1. Introduction to the Phonetic symbols and associated sounds of
English: Vowels - Consonants - Diphthongs. Extensive practice
through referring to a dictionary.
2. Word Accent and Pronunciation: Defining Syllable - Marking Word
Accent - Rules of Word Accent - Accent shift versus Suffixes.
Extensive practice through List of words, Homographs, Silent letters.
3. Intonation: Introduction to Stress and Rhythm - Tonal groups - weak
forms Tone versus context - Falling Tone, Rising Tone, Fall and Rise
in Tone. Extensive Practice through listening to different genres -
Speech, Poetry, Story, Conversations, Discussions, Talks.
4. Vocabulary Building: Practice exercises in vocabulary through word
bank and corpus list.
5. Listening skills: Focused Listening - Listening to understand main
ideas and specific information and to recognize the opinions, attitudes
and purpose of a speaker.
Communication Skills Lab:
1. Situational Dialogues/ Role Plays: Formal - Semiformal - informal
situations - Punctuation Marks - Tonal variations and voice modulations.
Practice in two-way conversations, Discussions, Talks and Interviews.
2. Communication skills at workplace: Task based activities for: Intra-
personal and Inter-personal communications-Types of communi-
cations: oral, written and non-verbal - Group dynamics.
3. Oral Presentations: Prepared and Extempore - Poster Presentations
and JAM [Just A Minute] - Choosing a topic – Developing the content
– Choosing appropriate vocabulary - Coherence in presentation –
Audibility.
4. Mini Project – In campus Survey Report: Project selection – Team
size – Preparing a questionnaire – data collection – data analysis –
conclusions and recommendations – Report submission in Manuscript
format.
5. Group Discussions: Definition of GD – Importance of GD – Stages
of GD – Etiquette, Communications, Content, Approach during GD –
Individual Roles – Group goals - Types of GD - Expectations and
outcomes.
Reference Books:
1. J.Sethi, Kamlesh Sadanand & DV Jindal A Practical Course in English
Pronunciation (with two Audio Cassettes) Prentice-Hall of India
Pvt.Ltd., New Delhi.
2. T.Balasubramanian, A text book of English Phonetics for Indian Students
Macmillan Publications.
3. RK.Bansal and JB.HarrisonSpoken English Orient Longman, 2006.
4. Krishna Mohan & NP Singh, Speaking English Effectively Macmillan
Publications.
5. Business English Communication – Preliminary Cambridge University
Press.
Course Outcomes:
After learning the contents of this course, the students will be able to
1. Differentiate between the letters of alphabet and the phonetic symbols.
2. Demonstrate the right pronunciation of the words in English using
phonetic transcription and word stress.
3. Speak with the proper intonation, voice modulation and tonal groups.
4. Demonstrate the listening skills through language modules.
5. Speak with clarity and confidence individually and in groups to discuss
and present the topics chosen and understand the nuances of team
dynamics.
6. Work individually and in teams present the topics and demonstrate their
public speaking skills and presentation skills through various aids like
posters, PPTs etc.,
2018-2019 65
COMPUTATIONAL MATHEMATICS LAB
Prerequisites: Programming for Problem Solving.
Course Objectives:
1. To illustrate the Flow chart and design an algorithm for the given
method.
2. To develop conditional and iterative statements to solve system of linear
equations using C language.
3. To inscribe C program that use pointers and functions to find the root
of given equation.
4. To implement loops, arrays and strings to solve differential equations
in C language.
1. Write a C Program to find the addition, subtraction, multiplication of
matrices.
2. Write a C Program to find the root of a given equation using Bisection
method.
3. Write a C Program to find the root of a given equation using method of
False position.
4. Write a C Program to find the root of a given equation using Iteration
method.
5. Write a C Program to find the root of a given equation using Newton
Raphson method.
6. Write a C Program to solve a given system of linear equations using
Jacobi’s method.
7. Write a C Program to solve a given system of linear equations using
Gauss Seidel iteration method.
8. Write a C Program to evaluate definite integral using Trapezoidal rule,
Simpson’s 1/3rd rule and 3/8th rule.
9. Write a C Program to solve a given differential equation using Taylor’s
series.
10.Write a C Program to solve a given differential equation using Picard’s
method.
11. Write a C Program to solve a given differential equation using Euler’s
method.
12.Write a C Program to solve a given differential equation using Runge-

Kutta method.
Text Books:
1. M.K.Jain, S.R.K.Iyengar, and R.K.Jain, Numerical Methods for Scientific
Publishers.
2. E Balagurusamy, C Programming and Data Structures, 4th Edition, Tata
McGraw-Hill Publications.
Reference Books :
1. Pradip Niyogi, Numerical Analysis and Algorithms, 5th Edition, Tata
McGraw-Hill Publishers.
2. Yashavant Kanetkar, Let us C-C Programming, 3rd Edition, Schaums’
outline series.
Online Resources:
1. http://nptel.ac.in/noc/individual_course.php?id=noc15-cs05
2. http://www.codingalpha.com/numerical-methods-c-program
Course Outcomes:
1. Write Flow chart and algorithm for the given program.
2. Have the ability to write C programs to solve specified problems.
3. Find the root of a given equation using C program.
4. Use arrays as part of the software solution.
5. Utilize pointers to efficiently solve problems.
6. Use functions from the portable C library.
2018-2019 67
Course Code: ES11211 1 - 3 2.5
ENGINEERING WORKSHOP
Prerequisites:-Nil-
Course Objectives:
1. To study of different hand operated Power Tools, uses and their
demonstration.
2. To gain a good basic working knowledge required for the production
of various engineering products.
3. To provide hands on experience about use of different engineering
materials, tools, equipment’s and processes those are common in the
Engineering field.
4. To develop a right attitude, team working, precision and safety at work
place.
5. To study commonly used carpentry joints.
6. To have practical exposure to various welding and joining processes.
I) Trades For Exercises: (~12 Lecture Hours and 36 Practices)
At least two exercises from each trade:
i) Carpentry ii) Fitting
iii) Tin-Smithy and Development of jobs carried out and Soldering
iv) House-wiring v) Foundry vi) Black smithy
II) Trades For Demonstration And Exposure: (~12 Lecture Hours)
i) Plumbing ii) Machine Shop iii) Wood Turning iv) Welding
Text Books:
1. B.L. Juneja, Workshop Practice, Cengage publications.
2. K. Venugopal, Workshop Manual, Anuradha Publications.
Reference Books:
1. P. Kannaiah & K. L. Narayana, Workshop manual, 2nd Edition, Scitech
publications (I) Pvt. Ltd., Hyderabad.
2. K. Venugopal, Dr. V. Prabhu Raja, G. Sreekanjana “Workshop Manual”
1st Edition, Anuradha Publications, 2012.
3. Hajra Choudury S.K., Hajra CHoudury A.K. and Nirjhar Roy S.K.,
Elements of Workshop technology, volI 2008 and Vol II 2010, Media
Promoters and Publishers private limited, Mumbai.
Online Resources:
www.technologystudent.com
Course Outcomes:
1. Demonstrate and understand the Engineering workshop safety
regulations.
2. Identify and use marking tools, measuring equipment and to work to
prescribed accuracies.
3. Know various operations in basic engineering workshops.
4. Understand the practical difficulties encountered in industries during
any assembly work.
5. Do simple electrical work through their carrier.
6. Design different prototype in the fittings, carpentry, foundry, black
smithy and sheet metal work.
2018-2019 69
II Year B.Tech. CSE I-Semester L T P C
Course Code: BS113AL 3 - - 3
PROBABILITY AND STATISTICS
Prerequisites:-Nil-
Course Objectives:
1. To learn the random variables and theoretical probability distributions.
2. To study the sampling distribution of mean and testing of hypothesis.
3. To learn the concept of confidence interval for proportions and small
sample tests.
4. To check and determine the relation between two variables/ attributes.
Random Variables: Introduction to random variables, Discrete random
variable, Continuous random variable, Probability distributions and
cumulative distribution functions, properties, Mathematical expectation.
Probability Distributions: Binomial distribution, Poisson distribution,
Normal distribution, Sampling Distribution of means. (σ Known and
unknown).
Theory of Estimation: Point estimation, Interval estimation, Confidence
interval for mean.
Inference Theory (Large Samples): Null hypothesis, Alternate
hypothesis, Type I and Type II errors, Critical region, Test of significance
for single mean, Test of significance for difference of means.
Testing of Hypothesis: Confidence interval for proportions, Test of
significance for single and difference of proportions.
Small sample tests: t, F and Chi-Square distributions.
Correlation and Regression: Coefficient of correlation, Rank
correlation, Regression coefficient, Lines of regression, Multiple
correlation and regression.
Text Books:
1. S.C.Gupta and V.K.Kapoor, Fundamentals of Mathematical Statistics,
11th Edition, Sultan Chand & Sons.
2. Vijay K Rohatgi, Statistical Inference, Aug 2003, Dover Publications
Inc.
Reference Books:
1. S.P.Gupta, Statistical Methods, 33rd Edition, Sultan Chand & Sons.
2. M.K.Jain, S.R.K.Iyengar and R.K.Jain, Numerical Methods for Science
Publishers.
3. Miller and John E Freund, Probability and Statistics for Engineers, 5th
Edition.
Online Resources:
Course Outcomes:
1. Differentiate among the random variables involved in the probability
models which are useful for all branches of engineering.
2. Understand probability distributions such as Binomial, Poisson and
Normal distributions.
3. Analyze data and draw conclusion about collection of data under study
using theory of estimation.
4. Apply testing of hypothesis for large samples.
5. Apply testing of hypothesis for small samples.
6. Estimate and establish relation between variables using correlation and
regression analysis.
2018-2019 71

Course Code: ES113AN 3 - - 3
DIGITAL LOGIC DESIGN
Prerequisites:-Nil-
Course Objectives:
1. Understand basic number systems, codes and logical gates.
2. Know the concepts of Boolean algebra and minimization logic.
3. Learn the design of combinational and sequential circuits.
4. Know the basics of various types of memories.
5. Study the hardware implementation using Programmable Logic
Devices.
Fundamentals of Digital Design: Digital Systems, Binary Numbers,
Number Base Conversions, Octal, Hexadecimal and other Base numbers,
Complements, Signed Binary Numbers, Binary Codes, Error Detection
and Correction, Binary Logic, Boolean Algebra: Basic theorems and
properties of Boolean Algebra, Boolean functions, Digital Logic Gates.
Minimization of Logic Functions: Standard representation for logic
functions, K-Map representation, Simplifications of logic functions using
K-Map, Sum of products , Product of sums simplification, Don’t care
conditions, NAND and NOR implementations.
Combinational Digital Circuits: Combinational Circuits(CC), Design
Procedure, Combinational circuit for different code converters and Parity
generator/Checker, Binary Adder-Subtractor, Decimal Adder, Binary
Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, De-
multiplexers, ALU: Micro-operations, Arithmetic Logic Shift Unit.
Sequential Circuits and Systems: Synchronous Sequential Circuits,
Latches, Flip-flops, Analysis of clocked sequential circuits, Registers,
Shift registers, Ripple counters, Synchronous counters, other counters
and Applications of counters. Asynchronous Sequential Circuits -
Introduction, Analysis procedure, Circuits with latches, Design procedure.

Semiconductor Memories and Programmable Logic Devices:
Memory: Introduction, Read-Write Memory (RAM), Read Only Memory
(ROM), Memory decoding, Programmable Logic Array, Programmable
Array Logic, Sequential programmable devices: SPLD, CPLD, FPGA.
Text Books :
1. M. Morris Mano and M.D.Ciletti, Digital Design, 5th Edition, Pearson.
2. R.P. Jain, Modern Digital Electronics, Tata McGraw Hill Education,
2009.
Reference Books:
1. A. Kumar, Fundamentals of Digital Circuits, Prentice Hall India, 2016.
2. M.Morris Mano, Computer System Architecture, 3rd Edition, Pearson.
3. H. Roth and L.L.Kinney, Fundamentals of Logic Design, 7th Edition,
Cengage Learning.
4. M. Rafiquzzaman, Fundamentals of Digital Logic & Micro Computer
Design, 5th Edition, John Wiley.
Online Resources:
1. www.tutorialspoint.com/digital_circuits/index.htm
2. https://onlinecourses.nptel.ac.in
Course Outcomes:
1. Demonstrate different Number systems, Binary codes and Boolean
algebra.
2. Solve Boolean expressions using minimization methods.
3. Understand the concepts of Combinational circuits and design simple
applications.
4. Distinguish different types of Sequential circuits.
5. Describe functionality of memory devices.
6. Design Hardware that suits various Micro-Operations.
2018-2019 73
Course Code: ES113AP 3 - - 3
ENGINEERING MECHANICS
Prerequisites:-Nil-
Course Objectives:
1. To understand the resolving forces and moments for a given force
system.
2. To analyze the types of friction for moving bodies and problems related
to friction.
3. To determine the centroid and second moment of area.
4. To understand the basic concept of kinetics of bodies.
Introduction to Mechanics: Basic Concepts, system of Forces Coplanar
Concurrent Forces - Moment of Forces and its Application - Couples and
Resultant of Force Systems. Equilibrium of system of Forces: Free body
diagrams, Equations of Equilibrium of Coplanar Systems.
Friction: Types of friction, Limiting friction, Laws of Friction. Static
and Dynamic Frictions: Motion of Bodies – ladder & Wedge friction.
Centroid and Center of Gravity: Introduction, Centroids of lines,
Centroids of area, Centroids of Composite figures. Theorem of Pappus
Centre of Gravity of Bodies, Centroids of Volumes, Center of gravity of
composite bodies.
Area moments of Inertia: Introduction, Definition of Moment of Inertia,
Polar Moment of Inertia, Radius of gyration. Transfer Theorem for moment
of inertia, Moments of inertia by integration, Moments of Inertia of
Composite Figures.
Mass Moment of Inertia: Introduction - Moment of Inertia of Masses –
Radius of gyration - Transfer Formula for Mass Moments of Inertia –
Mass moments of inertia by integration - Mass moment of inertia of
composite bodies.
Kinetics: Kinetics of a particle - D’Alemberts principle. Work-energy
and power. Principle of conservation of energy, Kinetics of rigid body in
translation, work done, Principle of work-energy.
Text Books:
1. K. Vijaya Kumar Reddy and J. Suresh Kumar, Singer’s Engineering
Mechanics Statics and Dynamics, BSP, 2016.
2. S.S. Bhavikatti, A Text Book of Engineering Mechanics, New Age
International (P) Limited Publications, New Delhi, 2018.
3. N.H. Dubey, Engineering Mechanics Statics and Dynamics, McGraw
Hill Education (India) Private Limited, New Delhi, 2016.
Reference Books:
1. Beer F.P and Johnston E.R Jr., Vector Mechanics for Engineers, TMH,
2016.
2. Hibbeler R.C and Ashok Gupta, Engineering Mechanics, Pearson
Education, 2010.
3. Tayal A.K., Engineering Mechanics-Statics & Dynamics, Umesh
Publications, 2011.
4. Meriam. J. L., Engineering Mechanics, Volume-I Statics, John Wiley
& Sons, 2012.
5. Andrew Pytel and Jaan Kiusalaas., Engineering Mechanics, Cengage
Learning, 2014.
Online Resources:
1. https://freevideolectures.com.
2. https://www.mathalino.com, Virtual labs (www.vlab.co.in)
Course Outcomes:
At the end of the course, students will be able to
1. Judge whether the body under the action of planer force system is at
rest or in motion.
2. Analyze equilibrium of a body subjected to a system of forces including
free body diagrams.
3. Solve the problems of Bodies subjected to friction.
4. Locate centroids/centre of gravity and compute moment of Inertia of
various sections.
5. Compute mass moment of Inertia of standard and composite sections.
6. Understand the basic concept of kinetics of bodies.
2018-2019 75
Course Code: PC113AS 3 1 - 4
DATA STRUCTURES
Prerequisites: Programming for Problem Solving
Course Objectives:
1. Understand the basic concepts such as abstract data types, linear and
non-linear data structures.
2. Understand the notations used to analyze the performance of
algorithms.
3. Understand the behavior of data structures such as stacks, queues, trees,
hash tables, search trees, graphs and their representations.
4. Choose an appropriate data structure for a specified application.
5. Understand and analyze various searching and sorting algorithms.
C++ Programming Concepts: Review of C, Input and Output in C++,
Functions in C++ – Value Parameters, Reference Parameters, Parameter
Passing, Function Overloading, New and Delete operators, Class and
Object, Access specifies, Constructors and Destructor, Friend Functions,
Operator Overloading, Generic Programming – Function Templates, Class
Templates, Inheritance and Polymorphism.
Basic Concepts: Algorithm Specification - Introduction, Recursive
algorithms, Data Abstraction, Performance analysis – Time Complexity
and Space Complexity, Asymptotic Notation – Big O, Omega and Theta
notations, Complexity Analysis Examples, Data Objects and Structures,
Introduction to Linear and Non-linear data structures.
Linear list ADT: Array Representation and Linked Representation, Singly
Linked List Operations and Complexity – Insertion, Deletion, Circularly
Linked List Operations and Complexity – Insertion, Deletion, Doubly
Linked List Operations and Complexity – Insertion, Deletion, Application
of Linked List – Sparse Matrix.
Stack ADT: Definition, Array and Linked implementations, Applications–
Infix to Postfix Conversion, Postfix Expression Evaluation, Recursion
Implementation.
Queue ADT: Definition, Array and Linked Implementations, Circular
Queues–Insertion and Deletion Operations.
Trees: Definition, Terminology, Binary Trees-Definition, Properties of
Binary Trees, Binary Tree ADT, Representation of Binary Trees – Array
and Linked Representations, Binary Tree Traversals, Threaded Binary Trees
– Definition.
Priority Queues: Definition and Applications, Max Priority Queue ADT–
Implementation, Max Heap - Definition, Insertion into and Deletion from
a Max Heap.
Searching: Linear Search, Binary Search, Hashing – Introduction, Hash
Tables, Hash Functions, Overflow Handling, Comparison of Searching
methods.
Sorting: Insertion Sort, Selection Sort, Quick Sort, Heap Sort, Merge
Sort, Comparison of Sorting Methods.
Graph: Definitions, Terminology, Applications, Properties, Graph ADT,
Graph Representations-Adjacency matrix, Adjacency lists, Graph Search
methods-DFS and BFS, Complexity analysis.
Search Trees: Binary Search Tree ADT, Definition, Operations –
Searching, Insertion and Deletion; Balanced Search Trees – AVL Trees–
Definition and Insertion, B-Trees – Definition and Examples only,
Comparison of Search Trees.
Text Books:
1. Sartaj Sahni, Data structures, Algorithms and Applications in C++, 2nd
Edition, Universities Press.
2. M. A.Weiss, Data structures and Algorithm Analysis in C++, 3rd Edition,
Pearson.
Reference Books:
1. Hubbard John R, Theory and Problems of Data structures with C++,
1st Edition, TMH.
2. Adam Drozdek, Data structures and Algorithms in C++, 4th Edition,
Cengage learning.
3. M.T. Goodrich, R. Tamassia and D. Mount, Data structures and
Algorithms in C++, 1st Edition, Wiley India.
4. D. Samanta, Classic Data Structures, 2nd Edition, PHI.
5. E. Balagurusamy, Object Oriented Programming with C++, 4th Edition,
TMH.
2018-2019 77
Online Resources:
1. www.cise.ufl.edu/~sahni/dsaac
2. www.geeksforgeeks.org/data-structures
3. www.opendatastructures.org/ods-cpp.pdf
Course Outcomes:
1. Demonstrate the basic concepts of C++ programming.
2. Analyze the time and space complexities of algorithms.
3. Use basic data structures such as linked list, stack and queue.
4. Design programs using advanced data structures like hash tables, binary
trees, search trees, heaps and graphs.
5. Choose appropriate data structures to represent data items in real world
problems.
6. Analyze and implement various kinds of searching and sorting
techniques.
Course Code: PC113AX 3 - - 3
OBJECT ORIENTED PROGRAMMING
Course Objectives:
1. Learn the concepts of object oriented programming.
2. Introduce the implementation of inheritance, packages and interfaces.
3. Understand the concepts of exception handling and multithreading.
4. Introduce the java collection framework and I/O classes.
5. Gain knowledge in designing Graphical User Interface using applets
and swing controls.
OOP concepts: Data abstraction, encapsulation, inheritance,
polymorphism, classes and objects, Procedural and Object oriented
programming paradigms.
Java Basics: History of Java, Java buzzwords, Data types, Variables, Arrays,
operators, expressions, control statements, Introducing classes, Methods,
Constructors, Inner classes, Anonymous Inner classes, String handling.
Inheritance: Inheritance concepts, Member access, Creating Multilevel
hierarchy, using super, using final with inheritance, forms of inheritance,
benefits of inheritance, costs of inheritance, Polymorphism- Adhoc
polymorphism, pure polymorphism, method overriding, abstract classes,
Object class.
Packages: Defining a Package, CLASSPATH, Access protection,
importing packages.
Interfaces: Defining an interface, implementing interfaces, Nested
interfaces, variables in interfaces and extending interfaces.
Exception handling: Fundamentals of exception handling, Exception
types, using try and catch, multiple catch clauses, nested try statements,
throw, throws and finally, built-in exceptions, creating own exception sub
classes.
Multithreading: Differences between thread-based multitasking and
process-based multitasking, Java thread model, creating threads, thread
priorities, synchronizing threads, inter thread communication.
2018-2019 79

Stream based I/O (java.io): The Stream classes - Byte streams and
Character streams, Reading Console Input and Writing Console Output,
File class, Reading and Writing files, Random access file operations,
Generics, Enumerations.
The Collections Framework (java.util): Collections overview,
Collection Interfaces, The Collection classes - ArrayList, LinkedList,
Iterator, The For-Each alternative, HashTable, Properties, Stack, Vector,
StringTokenizer, Calendar, Random, Scanner.
Event Handling: The Delegation Event Model - Events, Event sources,
Event Listeners, Event classes, Handling mouse and keyboard events,
Adapter classes.
GUI Programming with Swing: Introduction, limitations of AWT, MVC
architecture, Swing components, Swing containers, Swing Controls -
JLabel, JTextField, JButton, JToggleButton, JCheckBox, JRadioButton,
JTabbedPane, JScrollPane, JList, JComboBox, Swing Menus, Dialogs.
Layout Managers-FlowLayout, Border Layout, GridLayout, CardLayout,
GridBagLayout.
Applets: The Applet class, Difference between Applets and Applications,
Life Cycle of an Applet, passing parameters to applets.
Text Books:
1. Herbert Schildt, Java: The Complete Reference, 9th Edition, McGraw
Hill Education (India) Pvt. Ltd.
2. Herbert Schildt and Dale Skrien, Java Fundamentals - A Comprehensive
Introduction, McGraw Hill Education (India) Pvt. Ltd., 2013.
Reference Books:
1. Jaime Nino and Frederick. A. Hosch, An Introduction to Programming
and Object Oriented Design using Java, John Wiley & sons, 2013.
2. Timothy Budd, Understanding Object-Oriented Programming with Java,
updated Edition, Pearson Education.
3. Y. Daniel Liang, Introduction to Java Programming, Comprehensive
Version, 7th Edition, Pearson Education.
4. P. Radha Krishna, Object Oriented Programming through Java,
Universities Press, 2008.
Online Resources:
1. https://docs.oracle.com/javase/tutorial/java/TOC.html
2. www.javatpoint.com/java-tutorial
Course Outcomes:
1. Understand the object oriented programming concepts and solve real
world problems.
2. Demonstrate the use of inheritance and packages.
3. Understand and implement the concepts of exception handling.
4. Develop multithreaded applications with synchronization.
5. Solve problems using java collection framework and I/O classes.
6. Design Graphical User Interface using applets and swing controls.
2018-2019 81
IT WORKSHOP LAB
Prerequisites:-Nil-
Course Objectives:
1. Introduction to a personal computer and its basic peripherals, the
process of disassembling and assembling a personal computer.
2. Establish the connection between PC and internet from home,
workplace and effective usage of the internet, getting knowledge in
awareness of cyber hygiene.
3. Bring in the usage of Productivity tools using open office tools and
LaTeX.
Week 1: PC Hardware:
a. Identification of the peripherals of a computer, components in a CPU
and its functions.
b. Draw the block diagram of the CPU along with the configuration of
each peripheral.
c. Disassembling and assembling the PC back to working condition.
Week 2: Office Writer:
a. Creating a Resume: Features to be covered: Formatting Styles,
Inserting table, Bullets and Numbering, Changing Text Direction, Cell
alignment, Footnote, Hyperlink, Symbols, Spell Check, Track Changes.
b. Creating a newsletter: Features to be covered: Table of Content,
Newspaper columns, Images from files and clipart, Drawing toolbar
and Word Art, Formatting Images, Textboxes, Paragraphs in word.
Week 3: Office Writer:
a. Create Letters using Mail Merge: Features to be covered: Date and
Time option, Greeting Line, Inserting Table and database.
Office Calc:
b. Creating a Scheduler: Features to be covered: Gridlines, Format
Cells, Summation, auto fill, Formatting Text.
Week 4: Office Calc:
a. Calculation of Grade Point Average: Features to be covered : Cell
Referencing, Formulae in spreadsheet - average, standard deviation,
Charts, Renaming and Inserting worksheets, Hyper linking, Count
function, Sorting, Conditional formatting.
b. Data Processing: Features to be covered, Importing data from

different files, database.
Week 5: Office Calc:
Data Analyzing and Visualizing: Features to be covered: Pivot Tables,
Pivot Charts, Slicers and Dashboards.
Week 6: Office Base:
Creating Databases in MS-Access: Features to be covered: Creating
database using templates, Object types – Tables, Queries etc.
Week 7: Generating Reports using Office Base:
Features to be covered: creating Reports using Report wizard.
Week 8: Office Impress:
Creation of Power Point Presentation:
Features to be covered: PPT Orientation, Slide Layouts, Inserting Text,
Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows,
Hyperlinks, Inserting Images, Tables and Charts.
Week 9: LaTeX:
a. Creating a Report in LaTeX: Features to be covered: Newspaper
columns, Inserting Images from files, Formatting Images, Inserting
tables, Graphs and references.
b. Creating Slides in LaTex: Features to be covered: Inserting Text,
Formatting Text, Text colour, Bullets and Numbering.
Week 10: Internet & World Wide Web:
a. Configure the TCP/IP setting and connect to LAN to access the internet.
b. Customize the web browsers with the LAN proxy settings, bookmarks,
search toolbars and pop up blockers. Also, plug-ins like Macromedia
Flash and JRE for applets should be configured.
c. Usage of search engines like Google, Yahoo, ask.com and others.
Week 11: Develop pages using HTML consisting of Text, images, tables,
lists, Hyperlinks.
Week 12:Develop pages using HTML frames and Style sheets.
Text Books:
1. Introduction to Information Technology, ITL Education Solutions
limited, 7th Edition, Pearson Education.
2. Frank Mittelbach and Michel Goossens, LaTeX Companion, 2 nd
Edition, PHI/Pearson.
2018-2019 83
Reference Books:
1. Vikas Gupta, Comdex Information Technology Course Tool Kit,
Edition, WILEY Dreamtech, 2005.
2. David Anfinson and Ken Quamme, IT Essentials PC Hardware and
Software Companion Guide 3 rd Edition, CISCO Press, Pearson
Education.
3. Kate J. Chase, PC Hardware and A+ Handbook, PHI (Microsoft), 2004.
Online Resources:
1. www.w3schools.org.in
2. https://en.wikibooks.org/wiki/LaTeX
Course Outcomes:
1. Apply basic computer knowledge in identifying peripherals and perform
Computer Assembling.
2. Apply the office tools for preparing Documents, Presentations, Data
Analyzing and visualizing.
3. Apply the tools for creating, importing & exporting Databases and
Generate reports.
4. Analyze various resources available on the internet and the World Wide
Web.
5. Develop static Web Pages using HTML.
6. Apply LaTeX Tools for preparing documents and slides.
Course Code: PC11319 - - 3 1.5
DATA STRUCTURES THROUGH C++ LAB
Course Objectives:
1. Write and execute programs in C++ to solve problems using linear
data structures such as arrays, linked lists, stacks and queues.
2. Learn to write C++ programs to implement various sorting and
searching algorithms.
3. Write C++ programs to implement various non-linear data structures
like trees, graphs and search trees.
Week 1: Write C++ programs to implement the following concepts:
a. Function overloading b. Friend function c. Function template
Week 2: Write C++ programs to implement the following concepts:
a. Operator overloading b. Class template c. Types of inheritance
Week 3: Write a C++ program that uses functions to perform the following
operations on a singly linked list of integers:
a. Creation b. Insertion c. Deletion d. Display
Week 4: Write a template based C++ program that uses functions to
perform the following operations on a doubly linked list of elements:
a. Creation b. Insertion c. Deletion d. Display
Week 5:
a. Write a C++ program to implement stack ADT using an array and a
linked list.
b. Write a C++ program that uses stack operations to convert a given
infix expression into its postfix equivalent. Implement the stack using
an array.
Week 6: Write a C++ program to implement a queue ADT using an array
and a singly linked list.
Week 7: Write a C++ program that uses function templates to perform
the following:
a. Search for a key element in a list of elements using linear search.
b. Search for a key element in a list of sorted elements using binary
search.
2018-2019 85
c. To arrange a list of elements in ascending order using insertion sort.
Week 8:
a. Write a template based C++ program that implements selection sort
algorithm to arrange a list of elements in descending order.
b. Write a C++ program that implements heap sort algorithm for sorting
a list of integers in ascending order.
Week 9:
a. Write a template based C++ program that implements quick sort
algorithm to arrange a list of elements in ascending order.
b. Write a C++ program that implements merge sort algorithm for sorting
a list of integers in ascending order.
Week 10: Write a C++ program to implement all the functions of a
dictionary (ADT) using hashing.
Week 11: Write a C++ program that uses functions to perform the
following:
a. Create a binary search tree of integers.
b. Traverse the above binary search tree recursively in preorder, inorder
and postorder.
c. Search for an integer key in the above binary search tree recursively.
d. Traverse the above binary search tree non recursively in inorder.
Week 12: Write a C++ program to perform the following:
a. Traverse a given graph using DFS algorithm.
b. Traverse a given graph using BFS algorithm.
Text Books:
1. D. S. Malik, Data Structures using C++, 2nd Edition, Cengage learning.
2. V. Patil, Data Structures using C++, 1st Edition, Oxford University
Press.
Reference Books:
1. E. Horowitz, S. Sahni and D.Mehta, Fundamentals of Data structures
in C++, 2nd Edition, Universities Press.
2. Nell Dale, C++ Plus Data Structures, 5th Edition, Jones and Bartlett
Publishers.
Online Resources:
1. www.cs.uh.edu/~rizk/teaching/cosc2430/books/Data Structures
UsingC.pdf
2. www.sanfoundry.com/cpp-programming-examples-data-structures/
3. www.cplusplus.happycodings.com/data-structures/
Course Outcomes:
1. Apply OOP paradigm for implementation of various data structures.
2. Design and analyze the time and space complexity of algorithm or
program.
3. Develop the programs for various linear data structures like stack,
queue and linked list.
4. Implement various kinds of searching and sorting techniques.
5. Implement non-linear data structures like graphs and binary search
trees.
6. Choose the appropriate data structure for solving real world problems.
2018-2019 87
OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB
Course Objectives:
1. Develop skills to apply object oriented programming in problem
solving.
2. Demonstrate the use of inheritance and interfaces.
3. Implement the concepts of exception handling and multithreading.
5. Write GUI programs using applets and swing controls.
Note: Use Linux for Lab Experiments. Though not mandatory, encourage
the use of Eclipse platform.
Week 1: Write a Java program that prints all real solutions to the quadratic
equation ax2+ bx + c=0. Read in a, b, c and use the quadratic formula. If
the discriminant b2 -4ac is negative, display a message stating that there
are no real solutions.
Week 2:
a. Write a Java program that demonstrates constructor overloading.
b. Write a Java program to implement the use of inner classes.
Week 3:
a. Write a Java program to create an abstract class named ‘Shape’ that
contains two integers and an empty method named printArea( ). Provide
three classes named Rectangle, Triangle and Circle such that each one
of the classes extends the class Shape. Each one of the classes contains
only the method printArea( ) that prints the area of the given shape.
b. Write a Java program that implements multiple inheritance.
c. Write a Java program that demonstrates method overriding.
Week 4:
a. Write a Java program that implements a multi-threaded application that
has three threads. First thread generates random integer every 1 second
and if the value is even, second thread computes the square of the
number and prints. If the value is odd, the third thread will print the
value of cube of the number.
b. Write a Java program that implements producer – consumer problem
using the concept of Inter thread communication.
Week 5:
a. Write a Java program to list all the files in a directory including the
files present in all its subdirectories.
b. Write a Java program for the following:
i) Create a doubly linked list of elements.
ii) Delete a given element from the above list.
iii) Display the contents of the list after deletion.
Week 6: Write a Java program that loads names and phone numbers from
a text file where the data is organized as one line per record and each field
in a record is separated by a tab (\t). It takes a name or phone number as
input and prints the corresponding other value from the hash table (hint:
use hash tables).
Week 7:
a. Develop an applet that displays a simple message.
b. Develop an applet in java that receives an integer in one text field, and
computes its factorial value and returns it in another text field, when
the button named “Compute” is clicked.
Week 8: Write a Java program that creates a user interface to perform
integer divisions. The user enters two numbers in the text fields, Num1
and Num2. The division of Num1 and Num 2 is displayed in the Result
field when the Divide button is clicked. If Num1 or Num2 are not integers,
the program would throw a Number Format Exception. If Num2 is Zero,
the program would throw an Arithmetic Exception. Display the exception
in a message dialog box.
Week 9: Write a Java program that works as a simple calculator. Use a
GridLayout to arrange buttons for the digits and for the +, -, *, %
operations. Add a text field to display the result. Handle any possible
exceptions like divide by zero.
Week 10: Write a Java program that simulates a traffic light. The program
lets the user select one of the three lights: red, yellow or green with radio
buttons. On selecting a button, an appropriate message with “Stop” or
“Ready” or “Go” should appear.
Week 11:Write a Java program that handles all mouse events and shows
the event name at the center of the window when a mouse event is fired.
(Use Adapter classes).
2018-2019 89
Week 12: Suppose that a table named Table.txt is stored in a text file. The
first line in the file is the header, and the remaining lines correspond to
rows in the table. The elements are separated by commas. Write a Java
program to display the table using Labels in Grid Layout.
Text Books:
1. Herbert Schildt, Java- The Complete Reference, 9th Edition, McGraw
2. Paul Deitel and Harvey Deitel, Java- How to Program, Early Objects,
10th Edition, Pearson Education.
Reference Books:
1. Bruce Eckel, Thinking in Java, 3rd Edition, Pearson Education.
2. Cay S.Horstmann and Gary Cornell, Core Java, Volume 1-Fundamentals,
9th Edition, Pearson Education.
Online Resources:
1. http://docs.oracle.com/javase/tutorial/java/TOC.html
Course Outcomes:
1. Implement the concepts of object oriented programming to solve
problems.
2. Develop programs using inheritance and interfaces.
6. Develop GUI based applications using applets and swing controls.
Course Code: MC11317 2 - - -
GENDER SENSITIZATION
(Mandatory Course)
Prerequisites:-Nil-
Course Objectives:
1. To develop students’ sensibility with regard to issues of gender in
contemporary India.
2. To provide a critical perspective on the socialization of men and
women.
3. To introduce students to information about some key biological
aspects of genders.
4. To expose the students to debates on the politics and economics of
work.
5. To help students reflect critically on gender violence.
6. To expose students to more egalitarian interactions between men and
women.
Understanding Gender:
Gender: Why Should We Study It? (Towards a World of Equals: Unit -1)
Socialization: Making Women, Making Men (Towards a World of Equals:
Unit-2) Introduction, Preparing for Womanhood, Growing up Male, First
lessons in Caste, Different Masculinities.
Gender and Biology:
Missing Women: Sex Selection and Its Consequences (Towards a World
of Equals: Unit -4) Declining Sex Ratio. Demographic Consequences.
Gender Spectrum : Beyond the Binary (Towards a World of Equals: Unit
-10) Two or Many? Struggles with Discrimination.
Gender And Labour:
Housework: The Invisible Labour (Towards a World of Equals: Unit -3)
“My Mother doesn’t Work.” “Share the Load.”
Women’s Work: Its Politics and Economics (Towards a World of Equals:
Unit -7) Fact and Fiction. Unrecognized and Unaccounted work. Additional
Reading: Wages and Conditions of Work.
2018-2019 91
Issues of Violence:
Sexual Harassment: Say No! (Towards a World of Equals: Unit -6) Sexual
Harassment, not Eve-teasing- Coping with Everyday Harassment- Further
Reading: “Chupulu”.
Domestic Violence: Speaking Out (Towards a World of Equals: Unit -8)
Is Home a Safe Place? -When Women Unite [Film]. Rebuilding Lives.
Additional Reading: New Forums for Justice - Thinking about Sexual
Violence (Towards a World of Equals: Unit -11) - Blaming the Victim- “I
Fought for my Life….” - Additional Reading: The Caste Face of Violence.
UNIT 5 : (~6 Lecture Hours)
Gender: Co - Existence
Just Relationships: Being Together as Equals (Towards a World of
Equals: Unit -12) Mary Kom and Onler, Love and Acid just do not Mix,
Love Letters, Mothers and Fathers, Additional Reading: Rosa Parks-The
Brave Heart.
Text Books:
All the five Units in the Textbook, Towards a World of Equals: A
Bilingual Textbook on Gender, written by A. Suneetha, Uma
Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj, Asma
Rasheed, GoguShyamala, DeepaSreenivas and Susie Tharu and published
by Telugu Akademi, Hyderabad, Telangana State in the year 2015.
Reference Books:
1. Menon and Nivedita, Seeing like a Feminist, Zubaan-Penguin Books,
New Delhi, 2012.
2. Abdulali Sohaila, I Fought For My Life and Won, Available online at:
http://www.thealternative.in/lifestyle/i-fought-for-my-lifeand-won-
sohaila-abdulal/
Online Resources:
NPTEL:http://textofvideo.nptel.ac.in/110105080/lec20.pdf
Course Outcomes:
Students will have developed a better understanding of important issues
related to gender in contemporary India.
1. Students will be sensitized to basic dimensions of the biological,
sociological, psychological and legal aspects of gender. This will be
achieved through discussion of materials derived from research, facts,
everyday life, literature and film.
2. Students will attain a finer grasp of how gender discrimination works
in our society and how to counter it.
3. Students will acquire insight into the gendered division of labour and
its relation to politics and economics.
4. Men and women students and professionals will be better equipped to
work and live together as equals.
5. Students will develop a sense of appreciation of women in all walks of
life.
6. Through providing accounts of studies and movements as well as the
new laws that provide protection and relief to women, the textbook
will empower students to understand and respond to gender violence.
2018-2019 93
II Year B.Tech. CSE II-Semester L T P C
Course Code: BS114AZ 3 - - 3
DISCRETE MATHEMATICS
Prerequisites:-Nil-
Course Objectives:
1. Introduce the concepts of mathematical logic.
2. Gain knowledge in sets, relations and functions.
3. Solve problems using counting techniques and combinatorics.
4. Introduce generating functions and recurrence relations.
5. Use Graph Theory for solving real world problems.
Mathematical Logic: Introduction, Statements and Notation,
Connectives, Well-formed formulas, Tautology, Duality law, Equivalence,
Implication, Normal Forms, Functionally complete set of connectives,
Inference Theory of Statement Calculus, Predicate Calculus, Inference
theory of Predicate Calculus.
Set theory: Basic Concepts of Set Theory, Relations and Ordering,
Functions- composition of functions, Inverse Functions, Recursive
Functions, Lattices and its properties.
Algebraic structures: Algebraic systems-Examples and General
Properties, Semi groups and Monoids, groups, sub groups, homomorphism,
Isomorphism.
Elementary Combinatorics: Basics of Counting, Combinations and
Permutations, Enumeration of Combinations and Permutations,
Enumerating Combinations and Permutations with Repetitions,
Enumerating Permutations with Constrained Repetitions, Binomial
Coefficients, The Binomial and Multinomial Theorems, The Principle of
Inclusion- Exclusion, Pigeon hole principle and its application.
Recurrence Relations: Generating Functions of Sequences, Calculating
Coefficients of Generating Functions, Recurrence relations, Solving
Recurrence Relations by Substitution and Generating functions, The
Method of Characteristic roots, Solutions of Inhomogeneous Recurrence
Relations.
Graphs: Basic Concepts, Isomorphism and Subgraphs, Trees and their
Properties, Spanning Trees, Directed Trees, Binary Trees, Planar Graphs,
Euler’s Formula, Multigraphs and Euler Circuits, Hamiltonian Graphs,
Chromatic Numbers, The Four Color Problem.
Text Books:
1. Joe L.Mott, Abraham Kandel and Theodore P. Baker, Discrete
Mathematics for Computer Scientists & Mathematicians, 2nd Edition,
Pearson Education.
2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with
Applications to Computer Science, 2002, Tata McGraw Hill.
Reference Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications with
Combinatorics and Graph Theory, 7th Edition, McGraw Hill Education
(India) Private Limited.
2. D.S.Malik and M.K. Sen, Discrete Mathematics, Theory and
Applications, Revised Edition, Cengage Learning.
3. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, A
Computer Oriented Approach, 4th Edition, McGraw Hill education
(India) Private Limited.
4. Thomas Koshy, Discrete Mathematics with Applications, Elsevier
Academic Press, 2012.
Online Resources:
http://www.cs.yale.edu/homes/aspnes/classes/202/notes.pdf.
Course Outcomes:
1. Apply mathematical logic to solve problems.
2. Understand the concepts and perform the operations related to sets,
relations and functions.
3. Gain the conceptual background needed and identify structures of
algebraic nature.
4. Apply basic counting techniques to solve combinatorial problems.
5. Formulate problems and solve recurrence relations.
6. Apply Graph Theory in solving computer science problems.
2018-2019 95
Course Code: HS114BD 3 - - 3
MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS
Prerequisites:-Nil-
Course Objectives:
1. To provide the basic concepts of economics.
2. To interlink the concepts of economics for effective business decision
making.
3. To provide fundamental knowledge of accounting, process of preparing
accounting statements and interpret them thereby.
Managerial Economics and Demand Analysis:
Managerial Economics: Introduction to Economics, Definition of
Managerial Economics, Nature and Scope of Managerial Economics,
Multidisciplinary nature of Managerial Economics, Role of Managerial
Economist.
Demand Analysis: Introduction to Demand, Determinants of demand, Law
of demand and its Exceptions, Nature of demand, Movement and Shift of
demand curve.
Elasticity of Demand, Demand Forecasting and Production Analysis:
Elasticity of demand: Concept of Elasticity of demand, Types of
Elasticity- Price, Income, Cross and Advertising. Factors affecting and
Significance of Elasticity of demand.
Demand Forecasting: Need for Demand Forecasting - Factors governing
Demand Forecasting, Methods of Demand Forecasting (Survey methods
and Statistical methods).
Production Analysis: Factors of Production, Production Function.
Production function with one variable input, Two variable inputs using
Isoquant and Isocosts. Optimal combination of Resources using Isoquants
and Isocosts. Laws of returns, Economies and Diseconomies of Scale.
Cost Analysis, Market Structure and Pricing:
Cost Analysis: Cost concepts, Short run and Long run Cost analysis.
Market Structures: Classification of Markets, Features of Perfect
Competition, Monopoly, Monopolistic, Oligopoly and Duopoly.
Pricing: Pricing Objectives, Methods of Pricing and Pricing Strategies.
Introduction to Financial Accounting:
Financial Accounting: Introduction to Accounting, Double Entry Book-
Keeping, Accounting Principles, Accounting Terminology. Journal, Ledger,
Trial Balance, Final Accounts with Adjustments (Simple Problems).
Financial Analysis and Interpretation:
Ratio Analysis: Need, importance and significance of Ratio Analysis,
Liquidity Ratios, Profitability Ratios, Activity Ratios, Solvency Ratios,
Interpretation of Ratios for decision making (Simple problems).
Reference Books:
1. P L Mehta, Managerial Economics, Analysis, Problems & Cases, 8th
Edition, Sultan Chand & Sons, 2001.
2. S.N. Maheshwari, Suneel K Maheshwari and Sharad K. Maheshwari,
Financial Accounting, 5th Edition, Vikas Publishing House Pvt. Ltd,
2015.
3. D.N.Dwivedi, Managerial Economics, 9th Edition, Vikas Publishing
House Pvt. Ltd, 2016.
4. R.L.Varshney and K.L Maheshwari, Managerial Economics, 14th
Edition, Sultan Chand & Sons, 2005.
5. T.S.Grewal, Double Entry Book Keeping, Sultan Chand & Sons, Reprint
2006.
Online Resources:
1. Managerial Economics http://nptel.ac.in/courses/110101005/162.
2. Financial Accounting http://nptel.ac.in/courses/110107073.
Course Outcomes:
1. Cognize the Basic Concepts of Economics.
2. Analyze the economic concepts for using discretion in business
problem solving.
3. Comprehend the concepts of Accounting for business decision making.
4. Assimilate the basic Accounting Procedure and interpret the
statements.
5. Analogize the external business environment for attainment of business
goals.
6. Enable forecasting and analyzing the external business environment.
2018-2019 97

Course Code: PC114BH 3 - - 3
COMPUTER ORGANIZATION AND ARCHITECTURE
Prerequisites: Digital Logic Design
Course Objectives:
1. Know the basic components of computers.
2. Understand the architecture of 8086 processor.
3. Learn the instruction sets, instruction formats and various addressing
modes of 8086.
4. Understand the memory and I/O organization.
5. Understand the parallelism both in terms of single and multiple
processors.
Functional Blocks of a Computer: Introduction, Block diagram of
digital computer, Instruction codes, Computer Registers, Common bus
system, Computer instructions, Instruction cycle and Instruction set.
Register Transfer Language.
Data Representation: Fixed and floating point arithmetic-Addition,
Subtraction, Multiplication, Division.
Control unit Design: Hardwired control unit, Control memory, Address
sequencing, Micro-programmed control unit design, Hardwired Vs Micro-
programmed design.
The 8086 Microprocessor: Architecture, Register organization, 8086
signal description, Physical memory organization, Minimum and Maximum
mode system and timing diagrams, Addressing modes, 8086 Instruction
Set and Assembler Directives, Assembly Language example programs,
Stack structure of 8086, Interrupt structure of 8086, Interrupt vector table,
Procedures and macros.
Peripheral Devices and their characteristics: Introduction, Input-
Output Interface, Modes of Transfer-Programmed I/O, Priority Interrupt,
Direct memory Access, Input – Output Processor (IOP), Intel 8089 IOP,
Standard I/O interfaces – PCI, USB, SCSI.
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary
Memory, Associative Memory, Cache Memory - Mapping functions,
Replacement algorithms, Write policies.
Pipelining: Introduction, Arithmetic Pipeline, Instruction Pipeline, RISC
Pipeline, Vector Processing, Array Processors, Hazards.
Multiprocessors: Characteristics of Multiprocessors, Interconnection
Structures, Inter processor arbitration, Inter processor communication
and synchronization, Cache coherence.
Text Books:
1. M. Morris Mano, Computer System Architecture, 3rd Edition, Pearson.
2. K. M. Bhurchandi and A.K Ray, Advanced Microprocessors and
Peripherals, 3rd Edition, Tata McGraw-Hill Education.
Reference Books:
1. David A. Patterson and John L. Hennessy, Computer Organization and
Design: The Hardware/Software Interface, 5th Edition, Elsevier.
2. Carl Hamacher, Computer Organization and Embedded Systems, 6th
Edition, McGraw Hill Higher Education.
3. William Stallings, Computer Organization and Architecture: Designing
for Performance, 10th Edition, Pearson Education.
Online Resources:
http://nptel.ac.in/courses/106103068/pdf/coa.pdf
Course Outcomes:
1. Recognize the basic components and the design of CPU, ALU and
Control Unit.
2. Know the architecture of 8086.
3. Realize the instruction set, instruction formats and addressing modes
of 8086.
4. Write assembly language programs for problem solving.
5. Understand the memory hierarchy and I/O organization.
6. Comprehend the advantage of instruction level parallelism and
pipelining for high performance Processor design.
2018-2019 99

Course Code: PC114BN 3 - - 3
OPERATING SYSTEMS
Prerequisites: Data Structures
Course Objectives:
1. To understand the role of OS in the overall computer system and study
the operations performed by OS as a resource manager.
2. To understand the scheduling policies and different memory
management techniques for different operating systems.
3. To understand process concurrency and synchronization.
4. To understand the concepts of I/O, storage and file management and
introduce system call interface for file and process management.
5. To introduce the goals and principles of protection.
Introduction: Overview-Introduction-Operating system objectives, User
view, System view, Operating system definition ,Computer System
Organization, Computer System Architecture, OS Structure, OS
Operations, Process Management, Memory Management, Storage
Management, Protection and Security, Computing Environments.
Operating System services, User and OS Interface, System Calls, Types
of System Calls, System Programs, Operating System Design and
Implementation, OS Structure.
Process: Process concepts-The Process, Process State, Process State
transitions, Process Control Block, Context Switch.
Threads: Definition, Various states, Benefits of threads, Types of threads,
Concept of multithreads.
Process Scheduling: Scheduling Queues, Schedulers, Scheduling
Criteria, Scheduling algorithms, Multiprocessor Scheduling. Case Studies:
Linux, Windows.
Process Synchronization: Inter-process Communication: Background,
The Critical Section Problem, Race Conditions, Mutual Exclusion,
Peterson’s solution, Synchronization Hardware, Semaphores, Classic
Problems of Synchronization- Bounded Buffer Problem, The Producer/
Consumer Problem, Reader’s & Writer Problem, Dinning Philosopher
Problem, Event counters, Monitors, Message passing.
Deadlocks: Deadlocks - System Model, Deadlock Characterization:
Necessary and sufficient conditions for Deadlock, Methods for Handling
Deadlocks: Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock.
Memory Management: Basic Hardware, Address Binding, Logical and
physical address space, Dynamic loading, linking and Shared libraries,
Swapping, Contiguous Memory Allocation- Fixed and variable partition–
Internal and External fragmentation and Compaction; Segmentation,
Paging- Hardware support for paging, Protection, shared pages, Structure
of Page Table. Case Studies: Linux, Windows
Virtual Memory Management: Background, Demand Paging-locality
of reference, Page fault; Copy-on-Write, Page replacement, Page
Replacement Algorithms, Allocation of Frames, Thrashing.
File Management: Concept of File - Attributes, operations, file types,
internal structure, access methods, Directory structure, file protection,
file System structure, Allocation methods (contiguous, linked,
indexed),Free-space management (bit vector, linked list, grouping),
directory implementation (linear list, hash table), efficiency and
performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN,
C-SCAN, Disk formatting- Boot-block, Bad blocks.
Protection: System Protection, Goals of Protection, Principles of
Protection.
Text Books:
1. Abraham Silberschatz, Peter B.Galvin and Greg Gagne, Operating
System Concepts, 9th Edition, Wiley Asia Student Edition.
2. William Stallings, Operating Systems: Internals and Design Principles,
5th Edition, Prentice Hall of India.
Reference Books:
1. Charles Crowley, Operating System: A Design-oriented Approach, 1st
Edition, Irwin Publishing.
2. Gary J. Nutt and Addison, Operating Systems: A Modern Perspective,
2nd Edition, Wesley.
3. Maurice Bach, Design of the Unix Operating Systems, 8th Edition,
Prentice Hall of India.
2018-2019 101
4. Daniel P. Bovet and Marco Cesati, Understanding the Linux Kernel,
3rd Edition, O’Reilly and Associates.
Online Resources:
1. Abraham-Silberschatz-Operating-System-Concepts—9th2012.12.pdf
2. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/
Course Outcomes:
1. Acquire a High-level understanding of what is an operating system and
the role it plays and the services it provides.
2. Understand process management concepts including scheduling,
synchronization.
3. Describe System model for deadlock, Methods for handling deadlocks.
4. Understand memory management including virtual memory.
5. Acquire knowledge on issues related to file system interface and
implementation.
6. Understand the issues related to disk management.

Course Code: PC114BJ 3 1 - 4
DATABASE MANAGEMENT SYSTEMS
Prerequisites: Data Structures
Course Objectives:
1. Understand the basic concepts and the applications of database systems.
2. Master the basics of SQL and construct queries using SQL.
3. Understand the relational database design principles.
4. Become familiar with the basic issues of transaction processing and
concurrency control.
5. Become familiar with database storage structure and recovery
mechanisms.
Introduction: Database System Applications, Purpose of Database
Systems, View of Data, Database Languages-DDL, DML, Relational
Databases, Data Storage and Querying, Transaction Management, Database
Architecture, Database Users and Administrators.
Database Design and the E-R Model: The Entity-Relationship Model,
Constraints, Removing Redundant Attributes in Entity Sets, Entity-
Relationship Diagrams, Reduction to Relational schemas, Entity-
Relationship Design Issues, Extended E-R Features.
Introduction to the Relational Model: Structure of Relational
Databases, Database Schema, Schema Diagrams, The Relational Algebra,
Tuple Relational Calculus, Domain Relational Calculus.
Introduction to SQL: Overview of the SQL Query Language, SQL Data
Definition, Basic Structure of SQL Queries, Additional Basic Operations,
Set Operations, Null Values, Aggregate Functions, Nested Subqueries.
Advanced SQL: Join Expressions, Views, Integrity Constraints, Triggers.
Normalization: Functional Dependencies, Lossless decomposition, 1NF,
2NF, 3NF, Dependency Preservation, BCNF, Multi -valued dependencies,
4NF,Join Dependencies, 5NF.
Transaction Management: Transaction Concept, A Simple Transaction
Model, Storage Structure, Transaction Atomicity and Durability,
2018-2019 103
Transaction Isolation, Serializability, Transaction Isolation and Atomicity,
Transaction Isolation Levels.
Concurrency Control: Lock-Based Protocols, Multiple Granularity,
Timestamp-Based Protocols, Validation-Based Protocols.
Recovery System: Failure Classification, Storage, Recovery and
Atomicity, Recovery Algorithm, Failure with loss of non-volatile storage,
Remote Backup systems.
Indexing: Ordered Indices, B+ -Tree Index files.
Text Books:
1. A. Silberschatz, Henry. F. Korth and S. Sudarshan, Database System
Concepts, 6th Edition, McGraw Hill Education (India) Private Limited.
2. C.J. Date, A.Kannan, and S.SwamiNadhan, An Introduction to Database
systems, 8th Edition, Pearson Education.
Reference Books:
1. Raghu Ramakrishnan and Johannes Gehrke, Database Management
Systems, 3rd Edition, McGraw Hill Education (India) Private Limited.
2. R Elmasri and Shamkant B. Navathe, Database Systems, 6th Edition,
Pearson Education.
Online Resources:
www.w3schools.in https://beginnersbook.com/2015/04/dbms-tutorial/
Course Outcomes:
1. Understand concepts and the applications of database systems and
implement in real time applications.
2. Construct an Entity-Relationship (E-R) model from specifications and
transform to relational model.
3. Demonstrate the basic concepts of relational database management
system and construct unary/binary/set/aggregate queries in Relational
Algebra and in SQL.
4. Apply normalization on database.
5. Understand principles of database transaction management.
6. Understand the storage and recovery of database.

COMPUTER ORGANIZATION AND MICROPROCESSOR LAB
Prerequisites: Digital Logic Design
Course Objectives:
1. Design and implement combinational circuits using logic gates.
2. Analyze and design sequential circuits using logic gates.
3. Write programs in Assembly language to solve the problems.
4. Understand, compile and debug the programs.
Week 1: Implement the following experiments using Logic gates and IC’s
a. Logic gates using universal gates. b. Design a Full adder.
c. Design 4x1 and 8x1 MUX.
Week 2: Implement the following experiments using Logic gates and IC’s
a. Design a 3 to 8 decoder. b. Design a 4-bit comparator.
Week 3: Implement the following experiments using Flip-flops
a. Design a 4-bit shift register. b. Design a decade counter.
Week 4: Write an Assembly Language Program (ALP) to evaluate the
expressions a=b+c-d*e and z=x*y+w-v+u/k. Considering 8-bit, 16-bit and
32-bit binary numbers as b, c, d, e, k, u, v, w, x and y.
Week 5: Write an ALP of 8086 to take N numbers as input and arrange
them in ascending and descending order.
Week 6: Write an ALP of 8086 to take N numbers as input and do the
following operations on them
a. Find max and minimum. b. Find average
Week 7: Write an ALP of 8086 to take a string as input and do the following
operations on it
a. Find the length. b. Find whether it is Palindrome or not.
Week 8: Write an ALP of 8086 to take a string as input and find whether
given string is substring or not.
Week 9: Write an ALP of 8086 to take a number as input and find the
factorial using a procedure call.
Week 10: Write an ALP of 8086 to take a number as input and find the
Fibonacci series up to n terms using a procedure call.
2018-2019 105
Week 11: Write an ALP of 8086 for interfacing with Analog to Digital
Converter.
Week 12: Write an ALP of 8086 for interfacing with Digital to Analog
Converter.
Text Books:
1. M. Morris Mano, Computer System Architecture, 3rd Edition, Pearson.
2. K. M Bhurchandi and A.K Ray, Advanced Microprocessors and
Peripherals, 3rd Edition, Tata McGraw-Hill Education.
Reference Books:
1. Anand Kumar, Switching theory and logic design, 2013, PHI.
2. Douglas V. Hall, Microprocessor and Interfacing, 2nd Edition, Tata
McGraw-Hill Education.
Online Resources:
http://nptel.ac.in/courses/106103068/pdf/coa.pdf
Course Outcomes:
1. Design combinational circuits using logic gates.
2. Design sequential circuits using logic gates.
3. Recognize the representation of data, addressing modes and instructions
sets.
4. Write and execute programs in Assembly language to solve the
problems.
5. Compile and debug the programs.
6. Analyze and interface different peripherals with the microprocessor.

OPERATING SYSTEMS LAB
Prerequisites: Programming for Problem Solving, Data Structures
Course Objectives:
1. To write programs in Linux environment.
2. To implement the scheduling algorithms.
3. To develop solutions for synchronization problems using semaphores.
4. To implement page replacement algorithms and other memory
management techniques.
5. To implement file allocation methods.
Use Linux operating system and GNU C compiler:
Week 1: Programs using system calls
a. Write a C program to simulate ls | sort command.
b. Write a C program to implement the Process system calls. Create a
new process, create a child process to it and then make it wait and
abort.
c. Write a C program to simulate copy the contents of one file to another
using system calls.
Week 2: Write C programs to simulate the following CPU scheduling
algorithms: a. FCFS b. SJF
Week 3 : Write C programs to simulate the following CPU scheduling
algorithms: a. Priority b. Round Robin
Week 4: Write a C program to solve the Producer- Consumer problem
using semaphores.
Week 5: Write a C program to solve the Dining- Philosopher problem
using monitors.
Week 6: Write a C program to simulate Bankers Algorithm for Dead Lock
Avoidance.
Week 7: Write a C program to simulate Bankers Algorithm for Dead Lock
Prevention.
Week 8: Write C program to simulate the paging technique of memory
management.
2018-2019 107
Week 9: Write C program to simulate the segmentation technique of
memory management.
Week 10: Write C programs to simulate the following page replacement
algorithms: a. FIFO b. LRU
Week 11: Write C programs to simulate the following Directory
organization techniques: a. Single level directory b. Two level
Week 12: Write C programs to simulate the following File allocation
methods: a. Contiguous b. Linked
Text Books:
1. Abraham Silberschatz, Peter Galvin and Greg Gagne, Operating System
Concepts, 9th Edition, Wiley Asia Student Edition.
Reference Books:
1. P.C.P Bhatt, An Introduction to Operating Systems, 2nd Edition, PHI.
2. Terrence Chan, Unix System Programming Using C++, PHI/ Pearson.
3. Andrew S Tanenbaum, Modern Operating Systems, 3rd Edition, PHI.
Online Resources:
1. http://codex.cs.yale.edu/avi/os-book/OS9/
2. www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems
Course Outcomes:
1. Design and solve synchronization problems.
2. Simulate and implement scheduling concepts.
3. Model a deadlock situation and implementing methods for handling
deadlocks.
4. Simulate and implement memory management techniques.
5. Simulate and implement various file management concepts.
6. Use different system calls for writing application programs.

DATABASE MANAGEMENT SYSTEMS LAB
Prerequisites:-Nil-
Course Objectives:
1. Understand the different issues involved in the design and
implementation of a database system.
2. Learn and practice data modeling using the entity-relationship and
developing database designs.
3. Understand and use data manipulation language to query, update, and
manage a database.
4. Understand the significance of integrity constraints, triggers,
assertions, views, procedures and cursors.
Week 1: Practicing DDL commands: Creating tables for various relations
(in SQL).
Week 2: Practicing DML commands: Inserting data into relational tables.
Week 3: Practicing DRL commands: Retrieving data from tables,
Implement all the operation like Union, Intersect, Minus, in, exist,
aggregate functions (Min., Max) etc.
Week 4: Practicing Nested queries, Correlated queries, Group by and joins.
Week 5: Practicing DML commands: Updation and Deletion commands
on tables
Week 6: Creating Views.
Week 7: Writing Assertions.
Week 8: Writing Triggers.
Week 9: Implementing Operations on relations (tables) using PL/SQL.
Week 10 – 12: Case Study on Bus Reservation System
Objective: To enable the students to practice the concepts learnt in the
subject DBMS by developing a database using MySQL for example
company named “Roadway Travels” whose description is as follows, The
student is expected to practice the designing, developing and querying a
database in the context of example database “Roadway travels”.
2018-2019 109
Bus reservation system: Travelling is growing business in Telangana and
other states of India, and even in some of other countries also. Buses are
the public transport used to communicate between cities. The tickets for
the buses have to be bought only by going to the station. This wastes a lot
of time as one has to go to the station buy a ticket.
To save time and efforts, many agents are allowed to give reservation
at different places of a city or town, such that we can reserve a ticket by
walking to a nearest place than going to a faraway bus station. This facility
made public happier. Of course we can give our cell phone number of the
person who is boarding the bus such that the message will be sent to that
cell phone number; such that the person can board into the bus just by
showing the message of the cell phone without producing the printed ticket
even. It is convenient for booking ticket for the children who are studying
at some other place also.
Then it leads to the concept of online reservation through Internet by
sitting at your home using your credit card. The state of art of private bus
reservations now are a ticket can be booked online by using our table top
or laptop with our credit card by giving our children cell phone number
from our house, even without walking to the nearest agent. Of course, we
can do reservation even at mid night, or early morning when the nearest
agent’s office is not available.
Enquiries can be performed by us through Internet for the availability
of buses, timings and seats of different facilities. Different statistical
details are required for analysis for the sake of scheduling new buses, or
rescheduling the existing bus.
a) Creation of Tables /relations as per the case study. For example: BUS
(Bus_No, Source, Destination, Departure_Time) Ticket (RC,
Ticket_No,Bus_No, Date_of_journey, No_Seats, Cell_No, Address),
Passenger (PPNO,Ticket_No, Name, Age, Sex)
b) Normalization of tables. c) Inserting data into the tables.
d) Practice the following Queries:
i. Display unique PPNO of all passengers.
ii. Display all the names of male passengers.
iii. Display the ticket numbers and names of all the passengers.
iv. Find the names of passengers whose age is between 30 and 45.
v. Display the sorted list of passenger’s names.
vi. Write a Query to display the Information present in the Passenger
and cancellation tables.
vii. Find the total number of cancelled seats.
e) Design and develop the following:
i. Trigger ii. Cursor
Text Books:
1. Vikram Vaswani, The Complete Reference MySQL, 1st Edition, McGraw
Hill Education (India) Private Limited.
2. Joan Casteel, Oracle 10g: SQL, 1 st Edition, Thomson Course
Technology.
Reference Books:
1. A. Silberschatz, Henry. F. Korth and S. Sudarshan, Database System
Concepts, 6th Edition, McGraw Hill Education(India) Private Limited.
2. Raghu Ramakrishnan, Johannes Gehrke, Database Management
2018-2019 111
Online Resources:
1. https://dev.mysql.com/doc/
2. https://docs.oracle.com/en/database/
3. https://www.w3schools.in/
Course Outcomes:
1. Analyze the requirements of database application.
2. Design ER model for the given problem.
3. Convert ER diagram to relational database schema.
4. Apply normalization techniques for development of application
software to realistic problems.
5. Formulate queries using SQL DML/DDL/DCL commands.
6. Apply triggers, cursors and stored procedures.

Course Code: MC114BE 2 - - -
ENVIRONMENTAL SCIENCES
(Mandatory Course)
Prerequisites:-Nil-
Course Objectives:
1. Understanding the importance of ecological balance for sustainable
development.
2. Understanding the impacts of developmental activities and mitigation
measures.
3. Understanding the environmental policies and regulations.
4. Create awareness about environmental issues & identify the sustainable
solutions.
5. To sensitize the young minds to wildlife environment.
6. To develop the knowledge on various environmental components and
their interrelation with each other.
Ecosystems:Definition, Scope and Importance of ecosystem.
Classification, structure, and function of an ecosystem, food chains, food
webs, and ecological pyramids. Flow of energy, Biogeochemical cycles,
Bioaccumulation, Bio-magnification, ecosystem value, services and
carrying capacity, Field visits.
Natural Resources: Introduction, Classification of Resources, Living and
Non-Living resources, Water Resources: use and over utilization of surface
and ground water, floods and droughts, Dams: benefits and problems.
Mineral Resources: use and exploitation, environmental effects of
extracting and using mineral resources. Land Resources, Energy
Resources: growing energy needs, renewable and non-renewable energy
sources, use of alternate energy source, case studies.
Biodiversity and Biotic Resources: Introduction, Definition, genetic,
species and ecosystem diversity, value of biodiversity; consumptive use,
productive use, social, ethical, aesthetic and optional values. India as a
mega diversity nation, Hot spots of biodiversity. Field visit. Threats to
biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts;
Conservation of biodiversity: In-Situ and Ex-situ conservation.
2018-2019 113
Environmental Pollution and Control Technologies: Classification
of pollution, Air Pollution: Primary and secondary pollutants, Automobile
and Industrial pollution, Ambient air quality standards. Water pollution:
Sources and types of pollution, drinking water quality standards. Soil
Pollution: Sources and types, Impacts of modern agriculture, degradation
of soil. Noise Pollution: Sources and Health hazards, standards, Solid
waste: Municipal Solid Waste management, composition and
characteristics of e-Waste and its management.
Global Environmental Problems and Global Efforts: Climate change
and impacts on human environment. Ozone depletion and Ozone depleting
substances (ODS). Deforestation and desertification. International
conventions / Protocols: Earth summit, Kyoto protocol, and Montréal
Protocol.
Environmental Policy, Legislation & EIA: Environmental Protection
act, Legal aspects Air Act- 1981, Water Act, Forest Act, Wild life Act,
Municipal solid waste management and handling rules, biomedical waste
management and handling rules, Hazardous Waste (Management and
Handling) Rules. EIA: EIA structure, methods of baseline data acquisition.
Overview on Impacts of air, water, biological and Socio-economical
aspects. Strategies for risk assessment, Concepts of Environmental
Management Plan (EMP).
Towards Sustainable Future: Concept of Sustainable Development,
Population and its explosion, Crazy Consumerism, Environmental
Education, Urban Sprawl, Human health, Environmental Ethics, Concept
of Green Building.
Text Books:
1. Erach Bharucha, Text book of Environmental Studies for Undergraduate
Courses, University Grants Commission.
2. R. Rajagopalan, Environmental Studies, Oxford University Press.
Reference Books:
1. Richard T. Wright, Environmental Science: towards a sustainable future,
PHL Learning Private Ltd. New Delhi, 2008.
2. Gilbert M. Masters and Wendell P. Ela, Environmental Engineering
and science, PHI Learning Pvt. Ltd, 2008.
3. Daniel B. Botkin & Edward A. Keller, Environmental Science, Wiley
INDIA Edition.
4. Anubha Kaushik, Environmental Studies, 4 th Edition, New age
international publishers.
5. Dr. M. Anji Reddy, Text book of Environmental Science and Technology,
BS Publications, 2007.
Online Resources:
1. http://www.open.edu/openlearn/free-courses/full-catalogue
2. https://www.edx.org/course/subject/environmental-studies
3. https://www.mooc-list.com/tags/environmental-management
4. https://www.enviroblog.net
Course Outcomes:
1. Benefited by various ecological principles and environmental
regulations for sustainable development.
2. Able to identify/analyze/evaluate/demonstrate the consequences of
developmental activities and mitigation measures.
3. Develop the advanced technologies in protection/conservation of
resources in sustainable approach.
4. Improved in attitude & thinking of the students will be positively
towards earth & environment.
5. Benefited by knowing the concepts like Green Buildings, Low Carbon
Lifestyle, International conventions etc.
6. It helps the students to improve the quality of life.
2018-2019 115
III Year B.Tech. CSE I-Semester L T P C

Course Code: HS115CE 3 - - 3
FUNDAMENTALS OF MANAGEMENT
Prerequisites: Managerial Economics and Financial Analysis
Course Objectives:
1. To educate the importance of Management in Business Decision Making.
2. To implant the conceptual aspects required for Managerial Decision
Making.
3. To elicit the practical application of Management in Engineering Decision
Making.
UNIT 1: (~10 lecture hours)
Introduction to Management:
Management: Definition - Nature and Scope – Functions - Managerial Roles
- Levels of Management - Managerial Skills - Challenges of Management -
Evolution of Management - Classical Approach- Scientific Management and
Administrative Theory - The Behavioural approach - The Quantitative approach
- The Systems Approach - Contingency Approach – Corporate Social
Responsibility for Businesses.
Planning and Decision Making
Planning: General Framework for Planning - Planning Process - Types of
Plans and Types of Planning - Management by Objectives - Development of
Business Strategy - Strategic Planning Process – Environmental Scanning.
Decision Making - Characteristics of Decision Making - Types of Decisions
- Steps in Decision Making - Approaches to Decision Making - Individual
Decision Making and Group Decision Making.
Organization and HRM
Organization: Principles of Organization - Organizational Design -
Departmentation-Delegation-Empowerment-Centralization - Decentralization
- Recentralization-Organizational Structures-Organizational Culture-
Organizational Climate and Organizational Change.
Human Resource Management: Talent Management – Importance - Human

Resource Planning - Recruitment and Selection - Training and Development -
Performance Appraisal - Transitioning.
Leading and Motivation
Leading: Leadership - Characteristics of a Leader - Power and Authority -
Leadership Styles - Leadership Theories – Traditional Leadership Theories -
Behavioral Leadership Theories - Situational Leadership Theories - Leader
as Mentor and Coach – Team Leadership.
Motivation - Types of Motivation - Relationship between Motivation and
Performance - Content Motivational Theories – Abraham Maslow’s Need
Hierarchy Theory - Fredrick Herzberg’s Two Factor Theory – Mc. Gregor
Theory -X and Y.
Controlling
Control-Types and Strategies for Control - Steps in Control Process -
Methods of Budgetary and Non- Budgetary Controls - Characteristics of
Effective Controls - Establishing control systems.
Text Books:
1. Stephen P. Robbins, Fundamentals of Management, Pearson Education,
2009.
2. Dr. M. Sakthivel Murugan, Management Principles and Practices, New
Age International (P) Ltd., 1st Edition, 2010.
3. Y. K Bhushan, Fundamentals of Business organization and Management,
Sultan Chand and Sons, 16th Edition, 2004.
Reference Books:
1. Andrew Du Brin, Management Essentials, 9 th Edition, Cengage
Learning, 2012.
2. VSP Rao, Management (Text & cases), 2nd Edition, Excel Books, 2012.
3. James A.F. Stoner, R. Edward Freeman and Danial R. Gilbert,
Management, 6th Edition, Prentice-Hall of India Pvt. Ltd.,
4. NVS Raju, Industrial Engineering & Management, Cengage Learning,
2013.
Online Resources:
Concept of Management and Evolution of Management Thought http://
nptel.ac.in/courses/122108038/9
2018-2019 117
Course Outcomes:
After learning the contents of this course, the student must be able to
1. Associate the concept of Management in practical scenario for effective
decision making.
2. Synthesize the preparation of effective plans in strategizing the decision
making process.
3. Circumscribe the authority responsibility conduct in an organization.
4. Intuit the human resource management in an organization towards
achievement of effectiveness.
5. Cognize the role of leader and motivation in the attainment of
objectives of an organization.
6. Understand articulating techniques of controlling in the process of an
organization.

Course Code: PC115BU 3 - - 3
COMPUTER NETWORKS
Prerequisites: Computer Organization and Architecture
Course Objectives:
1. Introduce the fundamental types of computer networks.
2. Demonstrate the TCP/IP and OSI models with merits and demerits.
3. Develop an understanding of modern network architecture from a
design and performance perspective.
4. Introduce UDP and TCP Models along with application layer protocols.
Data Communications: Components, Data Representation and its flow,
Networks, Network types, Internet history standards and administration.
Overview of the Internet: Protocol Layering, TCP/IP Protocol Suite,
OSI Model.
Physical Layer: Data and Signals, Multiplexing, Spread Spectrum, Guided
and Unguided transmission media.
Data Link Layer: Design issues, Error detection and Correction,
Elementary Data Link Layer Protocols, sliding window protocol.
Mac Sub layer: Channel Allocation Problem, Multiple Access Protocols,
Classic Ethernet Physical Layer and Mac Sub layer Protocol, Ethernet
Performance, Data Link Layer Switching.
Network Layer: Network Layer Services, packet switching, Network
Layer Performance, IPv4 addresses, Forwarding of IP packets, Internet
Protocol (IP), IPv6 Protocol and addressing, Transition from IPv4 to IPv6,
Mobile IP.
Routing Algorithms: Least Cost Routing, Distance vector Routing, Link-
State Routing, and Hierarchical Routing.
Internet Control Protocols: ARP, RARP, ICMP and DHCP.
Transport Layer: Transport Layer Services, Transport Layer Protocols,
services and port numbers, UDP, TCP and SCTP.
Application Layer: DNS, TELNET, FTP, E-MAIL, WWW, HTTP.
2018-2019 119
Text Books:
1. Behrouz A. Forouzan, Data Communications and Networking, 5th
Edition, TMH., 2013.
2. Andrew S Tanenbaum, Computer Networks, 5th Edition, Pearson
Education.
Reference Books:
1. William Stallings, Data and Computer Communications, 8th Edition,
Pearson Prentice Hall India.
2. Douglas Comer, Internetworking with TCP/IP, Volume 1, 6th Edition,
3. W. Richard Stevens and Addison-Wesley, TCP/IP Illustrated Volume
1, United States of America.
Online Resources:
1. http://www.mhhe.com/engcs/compsci/forouzan
2. http://highered.mheducation.com
3. https://www.pearson.com/us/higher-education
5. https://www.coursera.org
Course Outcomes:
After the completion of the course, students will be able to
1. Understand the basics of computer networks, networking devices and
protocols.
2. Understand the functionalities of different layers of OSI and TCP/IP
reference models.
3. Analyze the performance of link layer and MAC layer protocols.
4. Acquire the knowledge of addressing and routing protocols and apply
the same for different routing problems and applications.
5. Understand the services offered by transport entities and transport
protocols.
6. Demonstrate various application layer protocols in real time.

Course Code: PC115BX 3 1 - 4
DESIGN AND ANALYSIS OF ALGORITHMS
Prerequisites: Programming for Problem Solving, Data Structures
Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Apply important algorithmic design paradigms and methods of analysis.
3. Synthesize efficient algorithms in common engineering design
situations.
4. Classify and categorize the problems into P and NP.
Introduction: Characteristics of algorithm, Analysis of algorithm:
Asymptotic analysis of complexity bounds – best, average and worst-case
behaviour, Performance measurements of Algorithm- Time and space trade-
offs, Analysis of recursive algorithms through recurrence relations-
Substitution method and Masters method, Fundamental Algorithmic
strategies-General Methods.
Divide and conquer- Binary search, Merge sort, Quick sort, Strassen’s
Matrix Multiplication.
Disjoint Sets: Disjoint set operations, union and find algorithms,
connected components and bi-connected components.
Greedy method- Knapsack problem, Job sequencing with deadlines,
Minimum cost spanning trees, Single source shortest path problem.
Dynamic Programming- Chained matrix multiplication, All pairs
shortest path problem, Optimal binary search trees, 0/1 knapsack problem,
Reliability design, Traveling sales person problem.
Backtracking- The N-queen problem, Sum of Subsets problem, Graph
Coloring, Hamiltonian cycles.
Branch and Bound- 0/1 Knapsack problem, LC Branch and Bound
solution, FIFO Branch and Bound solution, Traveling sales person problem.
Approximation Algorithms - The vertex-cover problem, the traveling-
salesman problem, the subset-sum problem.
2018-2019 121
NP-Hard and NP-Complete problems-Basic concepts, Non-deter-
ministic algorithms, NP - Hard and NP- Complete classes, Cook’s theorem.
Text Books:
1. Ellis Horowitz, Sartaj Sahni and S. Rajasekharan, Fundamentals of
Computer Algorithms, 2nd Edition, Universities Press.
2. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford
Stein, Introduction to Algorithms, 4th Edition, MIT Press/McGraw-Hill.
Reference Books:
1. Sartaj Sahni, Data Structures, Algorithms and Applications in JAVA,
2nd Edition, Universities Press.
2. M. T. Goodrich and R.Tomassia, Algorithm Design: Foundations,
Analysis and Internet examples, John Wiley and sons.
3. S. Sridhar, Design and Analysis of Algorithms, Oxford Univ. Press.
4. Aho, Ullman and Hopcroft, Design and Analysis of algorithms, Pearson
Education.
5. R. Neapolitan and K. Naimipour, Foundations of Algorithms, 4th Edition,
Jones and Bartlett Student edition.
6. T. H. Cormen, C. E. Leiserson, R.L. Rivest, and C. Stein, Introduction
to Algorithms, 3rd Edition, PHI.
7. P. H. Dave and H.B.Dave, Design and Analysis of Algorithms,
2nd Edition, Pearson Education.
Online Resources:
http://nptel.ac.in/courses/106101060/
Course Outcomes:
1. Apply design principles and concepts to algorithms.
2. Analyze asymptotic run time complexity of algorithms including
formulating recurrence relations.
3. Apply different designing methods for development of algorithms to
realistic problems, such as divide and conquer, greedy.
4. Develop the dynamic programming algorithms, and analyze it to
determine its computational complexity.
5. Implement Branch and Bound, Back Tracking Techniques to Solve
Problems.
6. Formulate Non-deterministic algorithms for NP hard and NP complete
problems and explain what an approximation algorithm is.
Course Code: PE115CK 3 - - 3
SOFTWARE ENGINEERING
(Professional Elective-1)
Prerequisites:-Nil-
Course Objectives:
1. Understand the software life cycle models.
2. Understand the importance of the software development process.
3. Understand the importance of modelling and modelling languages.
4. Design and develop correct and robust software products.
Introduction to Software Engineering: The evolving role of software,
changing nature of software, software myths.
A Generic view of process: Software engineering- a layered technology,
a process framework, the capability maturity model integration (CMMI),
process patterns, process assessment, personal and team process models.
Process models: The waterfall model, incremental process models,
evolutionary process models, the unified process.
Software Requirements: Functional and non-functional requirements,
user requirements, system requirements, interface specification, the
software requirements document.
Requirements engineering process: Feasibility studies, requirements
elicitation and analysis, requirements validation, requirements
management.
System models: Context models, behavioral models, data models, object
models, structured methods.
Design Engineering: Design process and design quality, design concepts,
the design model.
Creating an architectural design: software architecture, data design,
architectural styles and patterns, architectural design, conceptual model
of UML, basic structural modelling, class diagrams, sequence diagrams,
collaboration diagrams, use case diagrams, component diagrams.
Performing user interface design: Golden rules, User interface analysis,
and design, interface analysis, interface design steps, Design evaluation.
Testing Strategies: A strategic approach to software testing, test strategies
2018-2019 123
for conventional software, black-box and white-box testing, validation
testing, system testing, the art of debugging.
Product metrics: Software quality, metrics for analysis model, metrics
for design model, metrics for source code, metrics for testing, metrics
for maintenance.
Metrics for Process and Products: Software measurement, metrics for
software quality.
Risk management: Reactive Vs proactive risk strategies, software risks,
risk identification, risk Projection, risk refinement, RMMM, RMMM plan.
Quality Management: Quality concepts, software quality assurance,
software reviews, formal technical reviews, statistical software quality
assurance, software reliability, the ISO 9000 quality standards.
Text Books:
1. Roger S. Pressman, Software Engineering- A practitioner’s Approach,
6th Edition, McGraw Hill Companies, Inc.
2. Sommerville, Software Engineering, 7th Edition, Pearson Education.
Reference Books:
1. James F. Peters, WitoldPedrycz and John Wiely, Software Engineering-
an Engineering approach, 1st Edition.
2. Grady Booch, James Rambaugh and Ivar Jacobson, The Unified
Modeling Language User Guide, 2nd Edition, Pearson Education.
3. Waman S Jawadekar, Software Engineering Principles and Practice
2004, The McGraw-Hill Companies.
Online Resources:
1. https://alison.com/courses/software-engineering.
2. https://study.com/articles/List_of_Free_Online_Software_
Engineering_ Courses.html
Course Outcomes:
1. Get acquaintance of basic software engineering methods and practices,
process frame work and process models.
2. Emphasize on software requirement, SRS documents and Project
Management.
3. Develop different system models that describe the functionality of
the system.
4. Design and maintain efficient, reliable and cost effective software
solutions and suitable software metrics.
5. Understand various software testing approaches.
6. Emphasize on Software measurement, software risks and quality
control.
Course Code: PE115BQ 3 - - 3
ADVANCED COMPUTER ARCHITECTURE
Prerequisites: Computer Organization and Architecture, Operating
Systems.
Course Objectives:
1. Knowledge of contemporary computer architecture, issues and
techniques.
2. Understand the advanced hardware-based techniques for exploiting
instruction level parallelism.
3. Analyse the architectures and techniques used for building high
performance scalable multithreaded and multiprocessor systems.
4. Apply the learned knowledge to conduct research in computer
architecture.
Fundamentals of Computer design- Technology trends- cost- measuring
and reporting performance quantitative principles of computer
design. Instruction set principles and examples- classifying instruction
set- memory addressing- type and size of operands- addressing modes
for signal processing-operations in the instruction set- instructions
for control flow- encoding an instruction set.-the role of compiler.
Instruction level parallelism (ILP) - over coming data hazards- reducing
branch costs –high performance instruction delivery- hardware based
speculation- limitation of ILP.
ILP software approach- compiler techniques- static branch protection -
VLIW approach - H.W support for more ILP at compile time- H.W verses
S.W Solutions. Memory hierarchy design- cache performance- reducing
cache misses penalty and miss rate – virtual memory- protection and
examples of VM.
Multiprocessors and thread level parallelism- symmetric shared
memory architectures- distributed shared memory- Synchronization- multi
threading.
2018-2019 125
Storage systems- Types-Buses - RAID- errors and failures- bench marking
a storage device-designing an I/O system. Inter connection networks and
clusters-interconnection network media-practical issues in inter-
connecting networks- examples-clusters- designing a cluster.
Text Books:
1. John L. Hennessy and David A. Patterson Morgan Kaufmann, Computer
Architecture: A Quantitative Approach, 3rd Edition, (An Imprint of
Elsevier).
Reference Books:
1. Kai Hwang and A.Briggs, Computer Architecture and parallel Processing
International Edition, McGraw-Hill.
2. DezsoSima, Terence Fountain and Peter Kacsuk, Advanced Computer
Architectures, Pearson.
3. David E. Culler and Jaswinder Pal singh with Anoop Gupta, Parallel
Computer Architecture, A Hardware / Software Approach, Elsevier.
Online Resources:
1. https://users.dimi.uniud.it/~antonio.dangelo/OpSys/materials/
Computer_Architecture.pdf.
2. http://courses.cs.tamu.edu/ejkim/614/
3. https://www.cs.ucf.edu/~dcm/Teaching/CDA5106-Fall2015/Slides/
4. https://onlinecourses.nptel.ac.in.
5. www.coursera.org
Course Outcomes:
1. Understand the basic principles of computer design.
2. Classify instruction set architectures.
3. Use various methods for performance enhancements such as pipelines,
dynamic scheduling, branch prediction, caches, and vector processors.
4. Acquire Knowledge of memory hierarchy design.
5. Describe modern architectures such as RISC, VLIW and
multiprocessor systems.
6. Understand the issues in designing a cluster.
Course Code: PE115BT 3 - - 3
COMPUTER GRAPHICS
Prerequisites: Programming for Problem Solving.
Course Objectives:
1. To understand the basics of computer graphics, different graphics
systems and applications of computer graphics.
2. To analyze various algorithms for scan conversion and filling of basic
objects and their comparative analysis.
3. To apply the concepts of clipping, shading to view data with pictorial
representation.
4. Explore projections, visible surface detection techniques for display
of 2D and 3D scene.
5. Apply Rendering on projected objects in 2D, use of illumination
models, geometric transformations and animation techniques.
Introduction, Application areas of Computer Graphics, overview of graphics
systems, video-display devices, raster-scan systems, random scan systems,
graphics monitors and work stations and input devices.
Output primitives: Points and lines, line drawing algorithms, mid-point
circle. Filled area primitives: Scan line polygon fill algorithm, boundary-
fill and flood-fill algorithms.
2-D Geometrical transforms: Translation, scaling, rotation, reflection
and shear transformations, matrix representations and homogeneous
coordinates, composite transforms, transformations between coordinate
systems.
2-D Viewing: The viewing pipeline, viewing coordinate reference frame,
window to view-port coordinate transformation, viewing functions, Cohen-
Sutherland and Cyrus-beck line clipping algorithms, Sutherland –
Hodgeman polygon, clipping algorithm.
3-D Geometric transformations: Translation, rotation, scaling, reflection
and shear transformations, composite transformations.
3-D viewing: Viewing pipeline, viewing coordinates, view volume and
general projection transforms and clipping.
2018-2019 127
3-D Object representation: Polygon surfaces, quadric surfaces, Basic
illumination models, polygon rendering methods: Constant Intensity
shading, Gouraud Shading, Phong shading, Fast phong shading.
Visible surface detection methods: Classification, back-face detection,
depth-buffer, scan-line, depth sorting, BSP-tree methods, area sub-division
and octree methods.
Computer Animation: Design of animation sequence, general computer
animation functions, raster animation, computer animation languages, key
frame systems, motion specifications.
Text Books:
1. Donald Hearn and M. Pauline Baker, Computer Graphics C version,
2nd Edition, Pearson Education.
2. VanDam, Feiner and Hughes, Computer Graphics Principles & practice,
Foley, 2nd Edition, Pearson Education.
Reference Books:
1. Zhigandxiang, Roy Plastock and Schaum’s outlines, Computer Graphics,
2nd Edition, Tata Mc-Graw hill.
2. David F Rogers, Procedural elements for Computer Graphics,
2nd Edition, Tata Mc Graw hill.
3. Neuman and Sproul, Principles of Interactive Computer Graphics, TMH.
4. ShaliniGovil and Pai, Principles of Computer Graphics, 2005, Springer.
5. Steven Harrington, Computer Graphics, 2nd Edition, TMH.
Online Resources:
1. http://www.svecw.edu.in/Docs%5CCSECGLNotes2013.pdf
2. http://www.jimssouthdelhi.com/studymaterial/BCA5/BCA-503.pdf
Course Outcomes:
1. Learn the basics of computer graphics and graphics display devices.
2. Understand different types of graphics drawing algorithms and two
dimensional transformations.
3. Familiarize the techniques of clipping, three dimensional graphics and
three dimensional transformations.
4. Design, develop and test various techniques which includes modelling,
rendering and shading.
5. Apply the basic techniques of animation.
6. Work in computer aided design for content presentation.

Course Code: HS11542 - - 2 1
EMPLOYABILITY AND SOFT SKILLS LAB
Prerequisites:-Nil-
Course Objectives:
1. To address various challenges of communication as well as behavioural
traits faced by individuals at workplace and organizations through case
studies and interactions.
2. To help the students engage with other members confidently through
various discussions and presentations.
3. To help the students write business documents and generate content
effectively.
4. To enhance soft skills among the students and to enable them to
understand its impact on employability.
5. To equip the students with career planning and employability.
UNIT 1: (~2 lecture hours and 4 practical sessions)
Interpersonal And Intrapersonal Communication Skills
1. Factors impacting Communication Skills:Self awareness-Self analysis
-Self appraisal-Self esteem.
2. Barriers and Factors impacting Interpersonal and Intrapersonal
communication, both verbal and non –verbal communication.
3. Student presentations through SWOT Analysis.
Team Building And Group Dynamics
1. Factors influencing group behavior-Process of group development:
Forming, Storming, Norming, Performing, Adjourning-Group Members
individual roles and responsibilities.
2. Critical thinking and logical reasoning through SPELT Analysis - Six
Thinking Hats and Mind Maps.
3. Student presentations and performance through group activities.
Written Communication Skills
1. Processes in writing: Brainstorming - Drafting-Revising - Editing -
Proof Reading-Final draft.
2018-2019 129
2. Prerequisites for Effective Writing: Lexical Resource: Vocabulary in

context-Grammatical function in use: Syntax and accuracy - Researching
- Note-making-Support visuals-Procedures and processes-Structuring
and Formatting -IT skills.
3. Writing tasks assigned in the written format of E-mail correspondence
-Covering letter and Resume building-Technical Report Writing –
Developing a Portfolio.
Presentation Skills
1. Processes in presentation: Analysing the audience - Selecting a topic -
Defining the objective - Preparing the structure - Practicing and
Delivering.
2. Prerequisites for Effective Presentation: Content development-
Researching-Note-taking-Drafting-Organizing-Formatting-Structuring
– Visual support - IT Skills
3. Presentations are done through Image description – Poster Presentation
– Pechakucha.
Group Discussions and Interview Skills
1. Prerequisites for Group Discussion-Definition, Rules, Types-Topical
issues, Case studies, Abstract topics-Evaluation criteria-Content,
Analytical and Reasoning skills, Creativity, Organisation skills,
Communication skills, Listening skills, Leadership skills, Body
language, Group behavior.
2. Prerequisites for Interview Skills – Researching companies, Reading
job descriptions, Using appropriate language, Using STAR method to
answer interview questions- S - Situation, background setting and context
T- Task or Target, specifics of what’s required, when, where, who A-
Action, what you did, skills used, behaviours, characteristics R- Result
– outcome, what happened? How valuable the learning was?
3. Student presentations and performance through Group Discussions and
Mock Interviews.
Reference Books:
1. T.M.Farhathullah, Communication Skills for Technical Students, Orient
BlackSwan Pvt. Ltd., 2002.
2. Sangeetha Sharma and Binod Mishra, Communication Skills for
Engineers and Scientists, PH1 Learning Pvt. Ltd., 2011.
3. Sanjay Kumar and PushpLata, Communication Skills, Oxford Higher

Education, 2nd Education , 2015.
Online Resources:
1. https://onlinecourses.nptel.ac.in/noc19_hs22/preview
Course Outcomes:
1. Apply basic communication skills (LSRW) in work-related situations.
2. Acquire, organize, interpret and evaluate information for effective
communications within a group.
3. Demonstrate the ability to combine ideas or information in new ways
and present information on guided and structured format.
4. Make decisions and solve problems by specifying goals, identifying
resources and constraints and evaluating results.
5. Display personal qualities such as responsibility, self-management, self-
confidence, ethical behaviour and respect for self and others.
6. Work cooperatively with people of diverse backgrounds and abilities,
identify group’s goals and values and contribute to a group process with
ideas, suggestions and efforts.
2018-2019 131
COMPUTER NETWORKS LAB
Prerequisites: Programming for Problem Solving/ Object Oriented
Programming.
Course Objectives:
1. Understand the functionalities of various layers of OSI model.
2. Analyse flow control mechanisms for data link layer.
3. Implement various routing algorithms to compute the shortest distance.
4. Work on different network configuration commands.
Week 1: Implement the data link layer framing methods such as Character
Count.
Week 2: Implement the data link layer framing methods such as Character
stuffing.
Week 3: Implement the data link layer framing methods such as Bit
stuffing.
Week 4 : Implement on a dataset of characters using CRC polynomials-
CRC 12 and CRC 16.
Week 5 : Implement Go Back N Sliding window Protocol.
Week 6 : Implement Selective Repeat Sliding window Protocol.
Week 7 : Implement Dijkstra’s algorithm to compute the shortest path
through a graph.
Week 8 : Take an example subnet graph with weights indicating delay
between nodes. Now obtain Routing table at each node using Distance
Vector Routing algorithm.
Week 9 : Implementation of Networking commands like ping, ipconfig,
traceroute, TELNET, nslookup, ARP, RARP etc.
Week 10 : Implement Linux Network Configuration Commands.
a. Configuring NIC’s IP address.
b. Determining IP address and MAC address using if-config command.
c. Changing IP address using if-config command.
d. Static IP address and Configuration by Editing.
e. Determining IP address using DHCP.
f. Configuring Hostname in /etc/hosts file.
Week 11: Implementation of FTP.
Week 12 : Configure a mail server for IMAP/POP protocols and write a
simple SMTP client in C/Java client to send and receive mails.
Text Books :
1. Behrouz A. Forouzan, Data Communications and Networking, 5th
Edition, TMH, 2013.
2. Andrew S Tanenbaum, Computer Networks, 5th Edition, Pearson
Education.
Reference Books:
1. Elliotte Rusty Harold, 4th Edition, Java Network Programming.
2. W. Richard Stevens, TCP/IP Illustrated, Volume 1: The Protocols.
Online Resources:
1. https://docs.oracle.com/javase/tutorial/networking/overview/
networking.html
2. https://en.wikibooks.org/wiki/C_Programming/Networking_in_UNIX
Course Outcomes:
1. Implement data link layer functions such as framing methods.
2. Demonstrate error detection at the data link layer.
3. Evaluate the most suitable algorithm to find shortest path.
4. Execute basic Linux commands
5. Configure IP and MAC addresses.
6. Demonstrate application layer protocols using software and tools.
2018-2019 133
DESIGN AND ANALYSIS OF ALGORITHMS LAB
Prerequisites: Object Oriented Programming.
Course Objectives:
1. To write programs in java to solve problems using divide and conquer
strategy.
2. To write programs in java to solve problems using backtracking strategy.
3. To write programs in java to solve problems using greedy and dynamic
programming techniques.
Week 1:
a. Write a java program to implement Quick sort algorithm for sorting a
b. Write a java program to implement Merge sort algorithm for sorting a
Week 2: Write a java program to implement greedy algorithm for job
sequencing with deadlines.
Week 3 : Write a java program to implement Dijkstra’s algorithm for the
Single source shortest path problem.
Week 4 : Write a java program to implement Dijkstra’s algorithm for the
Single source shortest path problem.
Week 5 : Write a java program that implements Kruskal’s algorithm to
generate minimum cost spanning tree.
Week 6 : Write a java program to implement Floyd’s algorithm for the all
pairs shortest path problem.
Week 7 : Write a java program to implement Dynamic Programming
algorithm for the 0/1 Knapsack problem.
Week 8 : Write a java program to implement Dynamic Programming
algorithm for the Optimal Binary Search Tree Problem.
Week 9 : Write a java programs to implement backtracking algorithm for
the N-queens problem.
Week 10 : Write a java program to implement the backtracking algorithm
for the sum of subsets problem.
Week 11: Write a java program to implement the backtracking algorithm
for the Hamiltonian Cycles problem.
Week 12 : Write a Java Program to print Vertex Cover of a given undirected
graph.
Text Books :
1. SartajSahni, Data Structures, Algorithms and Applications in JAVA, 2nd
Edition, Universities Press.
2. Ellis Horowitz, SartajSahni and S. Raja sekharan, Fundamentals of
Reference Books:
1. Ellis Horowitz, SartajSahni and S. Rajasekharan, Fundamentals of
3. M. T. Goodrich and R.Tomassia, John Wiley and sons, Algorithm
Design: Foundations, Analysis and Internet examples.
4. S. Sridhar, Design and Analysis of Algorithms, Oxford Univ. Press.
5. Aho, Ullman and Hopcroft, Design and Analysis of algorithms, Pearson
Education.
6. R. Neapolitan and K. Naimipour, Foundations of Algorithms, 4th Edition,
Jones and Bartlett Student edition.
Online Resources:
1. https://www.hackerrank.com/
2. www.spoj.com
Course Outcomes:
1. Solve problems related to divide and conquer strategy.
2. Apply different designing methods for development of algorithms to
realistic problems using greedy method.
3. Develop the dynamic programming algorithms and analyze it to
determine its computational complexity.
4. Implement Back Tracking Techniques to solve problems.
5. Develop problems related to approximation algorithms.
6. Analyze and write efficient algorithms for any complex problems.
2018-2019 135
III Year B.Tech. CSE II-Semester L T P C
Course Code: PC116CX 3 - - 3
FORMAL LANGUAGES AND AUTOMATA THEORY
Prerequisites: Discrete Mathematics.
Course Objectives:
1. To introduce basic ideas of theoretical Computer Science from the
perspective of Formal languages.
2. To introduce the fundamental concepts of Formal languages, Grammars
and Automata theory.
3. Classify machines based on the hierarchy of languages.
4. Employ Finite state machines to solve problems in computing.
5. To understand deterministic and non-deterministic machines.
6. To understand the differences between decidability and undecidability.
Introduction to Finite Automata: Introduction, Structural Represen-
tations, Automata and Complexity, the Central Concepts of Automata
Theory-Alphabets, Strings, Languages, Problems, Deterministic Finite
Automata, Nondeterministic Finite Automata, An application: Text Search,
Finite Automata with Epsilon-Transitions, Equivalence between NFA with
and without transitions, Equivalence of NFA and DEA, NFA to DFA
conversion.
Regular Expressions and Languages: Regular Expressions, Finite
Automata and Regular Expressions, Applications of Regular Expressions,
Algebraic Laws for Regular Expressions.
Properties of Regular Languages: The Pumping Lemma for Regular
Languages, Application of Pumping Lemma, Closure and Decision
Properties of Regular Languages, Equivalence and Minimization of
Automata.
Grammar Formalism: Definition of Grammar, Types of Regular
Grammars: Right linear and Left linear grammars, Equivalence between
Regular grammar and FA, Inter conversion.
Context Free Grammars and Languages: Context Free Grammars,
Parse trees, Ambiguity in Grammars and Languages, Normal Forms for
Context Free Grammars, The Pumping Lemma for Context Free
Languages, Closure and Decision properties of CFL’s (Proofs omitted).
Push Down Automata: Definition of Pushdown Automaton, The
Languages of a PDA, Equivalence of PDA’s and CFG’s, Deterministic
Pushdown Automata.
Introduction to Turing Machines: The Turing Machine, Programming
Techniques for Turing Machines, Extensions to the Basic Tuning Machine,
Restricted Turing Machines, Universal Turing Machine.
Undecidability: A Language that is Not Recursively Enumerable, An
Undecidable Problem That is RE, Undecidable Problems about Turing
Machines, Post’s Correspondence Problem, Other Undecidable Problems.
Intractable Problems: The classes P and NP, An NP Complete Problem.
Text Books:
1. John E. Hopcroft, Rajeev Motwani and Jeffery D.Ullman, Introduction
to Automata Theory Languages and Computation, 3rd Edition, Pearson
Education.
2. Michael Sipser, Introduction to Theory of Computation, 3rd Edition,
Cengage Learning.
Reference Books:
1. Daniel I.A. Cohen, Introduction to Computer Theory, 2nd Edition, John
Wiley & Sons, Inc.
2. John C Martin, Introduction to languages and the Theory of
Computation, 4th Edition, TMH.
3. Lewis H.P. and Papadimition C.H., Elements of Theory of Computation,
2nd Edition, Pearson /PHI.
4. Mishra and Chandrashekaran, Theory of Computer Science - Automata
languages and computation, 2nd Edition, PHI.
5. K.V.N.Sunitha and N.Kalyani, Theory of Computation, 1st Edition,
Pearson Publications.
Online Resources:
1. Formal Languages and Automata Theory IIT Guwahati Course, Prof
DignataGoswami:http://freevideolectures.com/Course/3379/Formal-
Languages-and-Automata-Theory/2
2. Theory of Computation finite Automata exam study material for GATE
3. https://www.btechguru.com/prepare-gate-computer-science-and-
engineering-theory-of-computation- automata-1-5
5. https://online.stanford.edu/course/automata-theory
2018-2019 137
Course Outcomes:
1. Understand the concept of abstract machines and their power to
recognize the languages.
2. Employ finite state machines for modeling and solving computing
problems.
3. Design Grammars, Automata for formal languages.
4. Distinguish between decidability and undecidability of Problems.
5. Apply knowledge for problem solving using Turing machine.
6. Classify problems as P or NP.
Course Code: PC116CT 3 - - 3
DATA MINING
Prerequisites: Probability and Statistics, Database Management Systems.
Course Objectives:
1. Learn data mining concepts understand association rules mining.
2. Discuss classification algorithms learn how data is grouped using
clustering techniques.
3. To develop the abilities of critical analysis to data mining systems and
applications.
4. To implement practical and theoretical understanding of the
technologies for data mining.
5. To understand the strengths and limitations of various data mining
models.
Introduction to Data Mining: What is Data Mining, Definition, KDD,
Data Mining Architecture, Challenges, Data Mining Functionalities, Data
Mining Task Primitives, and Major Issues in Data Mining?
Data Pre-processing: Data Cleaning, Data Integration and Transformation,
Data Reduction: Dimensionality Reduction, Feature Subset Selection,
Discretization and Binarization, Measures of Similarity and Dissimilarity
– Basics, Similarities and dissimilarities between Simple Attributes and
Data Objects.
Association Rules: Problem Definition, Frequent Item Set Generation,
The APRIORI Algorithm, Support and Confidence Measures, Association
Rule Generation, FP- Growth Algorithm, Mining various kinds of
Association rules, Compact Representation of Frequent Item sets:
Maximal Frequent Item Sets, Closed Frequent Item Sets.
Classification and Prediction: Problem Definition, General Approaches
to solving a classification problem, Evaluation of classifiers,
Classification Techniques, Decision Tree Induction, Naive Bayes
Classifier, Bayesian Belief Networks, K–Nearest neighbor classification
– Algorithm and Characteristics, Prediction: Linear, Logistic Regressions.
Clustering: Problem Definition, Clustering Overview, Evaluation of
2018-2019 139
Clustering Algorithms, Partitioning Clustering -K-Means Algorithm, K-
Means Additional issues, PAM Algorithm, Hierarchical Clustering :
Agglomerative Methods and divisive methods, Basic Agglomerative
Hierarchical Clustering, Specific techniques: MIN, MAX, Group Average,
Ward’s method and Centroid methods Key Issues in Hierarchical clustering,
Strengths and Weakness, Outlier Detection.
Web and Text Mining: Introduction, Web Mining, Web Content Mining,
Web Structure Mining, Web Usage Mining, Text Mining – Unstructured
text, Episode rule discovery for texts, Hierarchy of categories, text
clustering.
Text Books:
1. Jiawei Han and Michelinen Kamber, Data Mining-Concepts and
Techniques, 2012, 3rd Edition, Morgan Kaufmann Publishers, Elsevier.
2. Pang-Ning Tan, Vipin Kumar and Michael Steinbanch, Introduction to
Data Mining, Pearson Education.
Reference Books:
1. Arun K Pujari, Data Mining Techniques, 3rd Edition, Universities Press.
2. Pualraj Ponnaiah, Data Warehouse Fundamentals by Wiley-
Interscience Publication.
3. VikaramPudi and P Radha Krishna, Data Mining by Oxford University
Press.
Online Resources:
1. https://www.kdnuggets.com/websites/index.html
2. https://www.ngdata.com/data-mining-resources.
Course Outcomes:
1. Understand the fundamental concepts and tasks of data mining.
2. Perform the pre-processing of data.
3. Formulate the association rules using different Algorithms.
4. Understand different classification techniques.
5. Understand different clustering techniques.
6. Understand algorithms used for web mining, text mining.
Course Code: PC116DM 3 - - 3
WEB TECHNOLOGIES
Prerequisites: Object Oriented Programming, Database Management
System.
Course Objectives:
1. To introduce PHP language for Server Side Scripting.
2. To introduce XML and processing of XML Data with Java.
3. To introduce Server side programming with Java Servlets and JSP.
4. To introduce Client side scripting with Java script and AJAX.
Introduction to PHP: Declaring variables, Data Types, Arrays, Strings,
Operators, Expressions, Control Structures, Functions, Reading data from
web form controls like text boxes, radio buttons, lists etc., Handling File
Uploads, Connecting to database (MySQL as reference), Executing simple
queries, handling results, Handling sessions and cookies.
File Handling in PHP: File operations like Opening, Closing, Reading,
Writing, Appending and Deleting etc. on Text and Binary files, Listing
Directories.
XML: Introduction to XML, Defining XML tags, their attributes and
values, Document Type Definition, XML Schemas, Document Object
Model, XHTML Parsing XML Data - DOM and SAX Parsers in java.
Introduction to Servlets: Common Gateway Interface (CGI), Lifecycle
of a Servlet, deploying a servlet, The Servlet API, Reading Servlet
parameters, Reading Initialization parameters, Handling Http Request &
Responses, Using Cookies and Sessions.
JDBC: Introduction to JDBC drivers, Types of Drivers, java.sql package,
connecting to a database using JDBC, manipulating data in database.
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing,
Declarations, Directives, Expressions, Code Snippets, implicit objects,
Using Beans in JSP Pages, Using Cookies and session for session tracking,
connecting to database in JSP.
2018-2019 141
Client side Scripting: Introduction to Java script: Java script language -
declaring variables, scope of variables, functions, event handlers (onclick,
onsubmit etc.), Document Object Model, Form validation, Simple AJAX
application.
Text Books:
1. Steven Holzner, PHP: The Complete Reference, 5th Edition, Published
on 01-Jan-2007 by Tata McGraw-Hill Education.
2. Uttam K. Roy, Web Technologies, Published: 23 December 2010 by
OXFORD University press.
3. Marty Hall and Larry Brown, Core Servlets and Java Server Pages,
2ndEditon, Volume 1: Core Technologies Published in 2004 by
Prentice Hall Professional.
4. Robert S. Sebesta, Programming World Wide Web, 4 th Edition,
published on 28-Mar-2014, Pearson Education.
Reference Books:
1. Chris Bates, Web Programming. Building Internet Applications. 3rd
Edition, Published June 1st 2006 by Wiley.
2. Hans Bergsten, Java Server pages, published on June 2009 by O’Reilly
Media.
3. Java Complete Reference 10th Edition, published: 10 November 2017
by Mc Graw Hill Education.
Online Resources:
1. https://www.w3schools.com/php.
2. https://docs.oracle.com/javaee/6/tutorial/doc/bnafe.html.
3. https://docs.oracle.com/javase/tutorial/jdbc/overview/index.html.
4. https://www.xmlfiles.com/xml.
5. https://www.admecindia.co.in/online-training-web-master.html.
Course Outcomes:
1. Develop a dynamic webpage by the use of java script, DHTML and
AJAX Programming.
2. Write a well formed / valid XML document and understand how to
parse and use XML data with java.
3. Understand the server side scripting with PHP language.
4. Connect databases to the server side applications.
5. Write a server side java application called Servlet to retrieve form
data sent from client, process it and store it on database.
6. Develop server side java application called JSP to catch form data sent
from client and store it on database.
Course Code: PE116DA 3 - - 3
IMAGE PROCESSING
Prerequisites: Probability and Statistics.
Course Objectives:
1. To study the image fundamentals and mathematical transforms
necessary for image processing.
2. Learn different image enhancement, segmentation and restoration
techniques.
3. Understand the basics of color image processing.
4. Apply various image morphological and compression techniques.
5. Understand the basic concepts of Representation and Description of
objects.
Introduction: Fundamental steps of image processing, components of
an image processing system. The image model and image acquisition,
sampling and quantization, relationship between pixels, distance functions,
scanner. Statistical and spatial operations, Intensity functions
transformations, histogram processing, smoothing & sharpening – spatial
filters Frequency domain filters, homomorphic filtering.
Image restoration: A model of the image degradation/restoration process,
noise models, restoration in the presence of noise–only spatial filtering,
Inverse filtering, Weiner filtering, constrained least squares filtering.
Morphological Image Processing : Morphological and other area
operations, basic morphological operations, opening and closing
operations, dilation erosion, Hit or Miss transform, morphological
algorithms.
Image Segmentation: Fundamentals , Point, Line, and Edge Detection:
Background, Detection of Isolated Points, Line Detection, Basic Edge
Detection, Thresholding: Basic Global Thresholding , Optimum Global
Thresholding Using Otsu’s Method Edge Models , Region-Based
Segmentation.
Color Image Processing: Color fundamentals, Color models, Pseudo
color image processing, basics of full–color image processing, color
transforms, smoothing and sharpening, Color edge detection.
2018-2019 143
Image compression: Fundamentals, Coding Redundancy, Spatial and
Temporal Redundancy, Irrelevant Information, Measuring Image
Information, Fidelity Criteria, Image Compression Models
Some Basic Compression Methods: Huffman Coding, Arithmetic
Coding, LZW Coding, Run-Length Coding, Symbol-Based Coding, Bit-
Plane Coding, Block Transform Coding, Predictive Coding, Digital Image
Watermarking.
Representation and Description: Boundary (Border) Following, Chain
codes, Polygonal approximation, Signature Boundary Segments, Skeletons,
Boundary Descriptors, Regional Descriptors, Relational Descriptors,
Principal components for Description, Relational Descriptors.
Text Books:
1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing,
3rd Edition, Pearson Education, 2008.
Reference Books:
1. M.Anji Reddy and Y.Hari Shankar, Digital Image Processing, BS
Publications, 2006.
2. A.K. Jain, Fundamentals of Digital Image Processing, PHI, 1989.
Online Resources:
1. https://www.tutorialspoint.com/dip/index.htm
2. https://www.cs.nmt.edu/~ip/lectures.html
3. http://eeweb.poly.edu/~onur/lectures/lectures.html
5. https://www.coursera.org/
Course Outcomes:
1. Understand the fundamental concepts of a digital image processing
system and analyze images in spatial domain and frequency domain
using various transforms.
2. Apply techniques for image restoration.
3. Identify different image analysis techniques and concepts for
morphological operators.
4. Interpret image segmentation techniques and understand the basic
concepts of color image processing.
5. Evaluate various compression techniques.
6. Interpret image representation and description techniques.
III Year B. Tech. CSE II-Semester L T P C
Course Code: PE116DD 3 - - 3
MACHINE LEARNING
Prerequisites:-Nil-
Course Objectives:
1. To be able to identify machine learning problems corresponding to
different applications.
2. To understand a various machine learning algorithms along with their
strengths and weaknesses.
3. To understand the basic theory underlying machine learning.
Introduction: Well posed learning problems, designing a learning system
Perspectives and issues in machine learning, Types of learning.
Concept Learning: Concept learning task, Concept Learning as search
through a hypothesis space, Finding maximally specific hypotheses,
Version spaces and the candidate elimination algorithm, Remarks on them,
Inductive Bias.
Decision Tree Learning: Decision Tree representation and learning
algorithm, appropriate problems for Decision Tree Learning, Hypothesis
space search in Decision Tree Learning, Inductive bias in Decision Tree
Learning: Occam’s razor, Issues in Decision Tree Learning, Learning with
active queries.
Neural Network Learning: Introduction, Neural Network representation,
appropriate problems for NN Learning, Perceptrons, Multi-layer networks
and the back propagation algorithm, Remarks.
Computational Learning Theory: PAC Hypothesis, Sample complexity
for finite and infinite hypothesis spaces, Mistake bound model, Irrelevant
features: Multiplicative rules for weight tuning.
Bayesian Learning: Bayes theorem and concept learning, Minimum
Description Length Principle, Bayes optimal classifier, Gibbs Algorithm,
Naïve Bayes Classifier, The EM algorithm.
Instance – Based Techniques: K-nearest neighbor Learning, Locally
2018-2019 145
Weighted Regression, Radial Basis Function, Case Based reasoning,
Remarks on Lazy vs Eager learning.
Analytic Learning: Introduction, Learning with perfect Domain Theories:
PROLOG-EBG, Remarks on Explanation-Based Learning.
Genetic Algorithm: Biological motivation, Representing Hypothesis,
Genetic Operators, Fitness function and selection, Hypothesis space
search, Genetic Programming, Models of Evolution and Learning,
Parallelizing Genetic Algorithms.
Text Books:
1. Tom M. Mitchell, Machine Learning, McGraw Hill Education, Edition
2013.
Reference Books:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT
Press, 2012.
2. Trevor Hasti, Robert Tibshirani and Jerome Friedman, The Elements
of Statistical Learning, 2nd Edition, Springer Series in Statistics, 2001.
3. William W Hsieh, Machine Learning Methods in the Environmental
Sciences, Neural Networks and Kernels, Cambridge University Press.
4. Stephen Marsland, Machine Learning - An Algorithmic Perspective,
CRC Press, 2009.
Online Resources:
1. http://www.cs.cmu.edu/~tom/
2. http://www.holehouse.org/mlclass/
Course Outcomes:
1. Gain Knowledge on the basic theory in machine learning.
2. Understand machine learning problems corresponding to different
applications.
3. Identify machine learning techniques appropriate to respective
problems.
4. Compare various machine learning algorithms along with their strengths
and weaknesses.
5. Analyze the machine learning algorithms under supervised and
unsupervised paradigms.
6. Apply different learning algorithms to solve problems of moderate
complexity.
Course Code: PE116DB 3 - - 3
INTERNET OF THINGS
Prerequisites: Programming for Problem Solving, Digital Logic Design
Course Objectives:
1. To introduce the terminology, technology and its applications.
2. To introduce the concept of M2M (machine to machine) with
necessary protocols.
3. To introduce the Python Scripting Language which is used in many IoT
devices.
4. To introduce the Raspberry Pi platform, that is widely used in IoT
applications.
5. To introduce the implementation of web based services on IoT devices.
Introduction to Internet of Things –Definition and Characteristics of
IoT, Physical Design of IoT-IoT Protocols, IoT Communication Models,
IoT Communication APIs.
IoT enabled Technologies-Wireless Sensor Networks, Cloud Computing,
Big data analytics, Communication protocols, Embedded Systems, IoT
Levels and Templates Domain Specific IoTs – Home, City, Environment,
Energy, Retail, Logistics, Agriculture, Industry, Health and Lifestyle.
IoT and M2M-Software Defined Networks, Network Function
Virtualization, Difference between SDN and NFV for IoT Basics of IoT
System Management with NETCONF, YANG-NETCONF, YANG, and
SNMP NETOPEER.
Introduction to Python - Language features of Python, Data types, data
structures, Control of flow, functions, Modules, packaging, File Handling,
Date/Time Operations, Classes, Exception handling Python packages -
JSON, XML, HTTPLib, URLLib, SMTPLib.
IoT Physical Devices and Endpoints-Introduction to Raspberry Pi-
Interfaces (serial, SPI, I2C) Programming-Python program with Raspberry
Pi with focus of interfacing external gadgets, Controlling Output and
Reading input from pins.
2018-2019 147
IoT Physical Servers and Cloud Offerings-Introduction to Cloud
Storage models and communication APIs Webserver-Web server for IoT,
Cloud for IoT, Python web application framework, designing a RESTful
web API.
Text Books:
1. Arshdeep Bahga and Vijay Madisetti, Internet of Things - A Hands-on
Approach, Universities Press, 2015, ISBN: 9788173719547.
2. Matt Richardson and Shawn Wallace, Getting Started with Raspberry
Pi, O’Reilly (SPD), 2014, ISBN: 9789350239759.
Reference Books:
1. David, Hanes and Salgueiro Gonzalo, IoT Fundamentals: Networking
Technologies, Protocols and Use Cases for the Internet of Things,
Pearson 2017.
2. Dirk Slama and Frank Puhlmann, Enterprise IoT: Strategies and Best
Practices for Connected Products and Services, 2015.
Online Resources:
1. https://www.tutorialspoint.com.
2. https://www.edureka.co.
3. https://www.onlinecourses.nptel.ac.in
Course Outcomes:
1. Understand the IoT Systems.
2. Understand the concept of M2M (machine to machine) with necessary
protocols.
3. Create programs using python scripting language in IoT devices.
4. Create programs for Raspberry Pi interfaces.
5. Understand to communicate with IoT Systems through web-interface.
6. Apply IoT principles for domain specific applications.
Course Code: PC11655 - - 4 2
WEB TECHNOLOGIES AND DATA MINING LAB
Prerequisites: Programming for Problem Solving, Object Oriented
Programming, Database Management Systems.
Course Objectives:
1. To develop client-server application using web technologies.
2. To introduce server side programming with PHP, Java servlets and JSP.
3. To introduce client side scripting with JavaScript.
4. Intended to provide practical exposure of the concepts in data mining
algorithms.
5. The course is intended to obtain hands-on experience using data mining
software.
6. Intended to provide practical exposure of the classification and
clustering algorithms.
List of Programs:
Week 1:
a. Install the following on the local machine
• Apache Web Server (if not installed)
• Tomcat Application Server locally
• Install MySQL (if not installed)
• Install PHP and configure it to work with Apache web server and
MySQL (if not already configured)
b. Build Data Warehouse and Explore WEKA.
c. Perform data pre-processing tasks and Demonstrate performing
association rule mining on data sets.
Week 2:
a. Implement the web application using PHP, The user is first served a
login page which takes user’s name and password. After submitting the
details the server checks these values against the data from a database
and takes the following decisions. If name and password matches, serves
a welcome page with user’s full name. If name matches and password
doesn’t match, then serves “password mismatch” page If name is not
found in the database, serves a registration page, where user’s full name
is asked and on submitting the full name, it stores, the login name,
password and full name in the database (hint: use session for storing
the submitted login name and password).
2018-2019 149
b. Task 1: Credit Risk Assessment. Sample Programs using German Credit
Data.
i. List all the categorical (or nominal) attributes and the real-valued
attributes separately.
ii. What attributes do you think might be crucial in making the credit
assessment?
Week 3:
a. Implement the web application using PHP, A simple calculator web
application that takes two numbers and an operator (+, -, /, * and %)
from an HTML page and returns the result page with the operation
performed on the operands, such that it stores each query in a database
and checks the database first for the result. If the query is already
available in the Database, it returns the value that was previously
computed (from DB) or it computes the result and returns it after storing
the new query and result in Database.
b. A user validation web application Using PHP, where the user submits
the login name and password to the server, the name and password are
checked against an xml file instead of database and if the data matches,
a successful login page is returned. Otherwise a failure message is
shown to the user.
c. Generate simple rules in plain English using credit risk assessment
for selected attributes.
d. Demonstrate classification algorithms on various UCI repository data
sets.
Week 4:
a. Implement the web application using PHP, A web application that lists
all cookies stored in the browser on clicking “List Cookies” button.
Add cookies if necessary.
b. Implement the web application using PHP, which takes a name as input
and on submit it shows a hello <name> page where<name> is taken
from the request. It shows the start time at the right top corner of the
page and provides a logout button. On clicking this button, it should
show a logout page with Thank You <name> message with the duration
of usage (hint: Use session to store name and time).
c. Create a Decision Tree for given dataset - train a Decision Tree using
the complete dataset as the training data. Report the model obtained
after training.
Week 5:
a. Create an XML document that contains 10 users information. Write a
Java program, which takes User Id as input and returns the user details
by taking the user information from the XML document using (i) DOM
Parser and (ii) SAX parser.
b. Demonstrate clustering algorithms for given data sets and report the
model.
c. Suppose you use your above model trained on the complete dataset,
and classify credit good/bad for each of the examples in the dataset.
What % of examples can you classify correctly? (This is also called
testing on the training set) Why do you think you cannot get 100 %
training accuracy?
Week 6:
a. Develop the web application using Servlet and JSP, where the user
submits the login name and password to the server, the name and
password are checked against an xml file instead of database and if the
data matches, a successful login page is returned. Otherwise a failure
message is shown to the user.
b. Is testing the model on the training set as you did above a good idea?
Why or Why not?
c. One approach for solving the problem encountered in the previous
question is using cross-validation? Describe what cross-validation is
briefly. Train a Decision Tree again using cross-validation and report
your results. Does your accuracy increase/decrease? Why?
Week 7:
a. Develop the web application using Servlet and JSP, The user is first
served a login page which takes user’s name and password. After
submitting the details the server checks these values against the data
from a database and takes the following decisions. If name and password
matches, serves a welcome page with user’s full name. If name matches
and password doesn’t match, then serves “password mismatch” page
If name is not found in the database, serves a registration page, where
user’s full name is asked and on submitting the full name, it stores, the
login name, password and full name in the database (hint: use session
for storing the submitted login name and password).
b. Check to see if the data shows a bias against “foreign workers” (attribute
20), or “personal-status” (attribute 9). One way to do this (perhaps
rather simple minded) is to remove these attributes from the dataset
and see if the decision tree created in those cases is significantly
different from the full dataset case which you have already done. To
remove an attribute you can use the preprocess tab in Weka’s GUI
2018-2019 151
Explorer. Did removing these attributes have any significant effect?
Discuss.
Week 8:
a. Develop the web application using Servlet and JSP,A simple calculator
that takes two numbers and an operator (+, -, /, * and %) from an HTML
page and returns the result page with the operation performed on the
operands, such that it stores each query in a database and checks the
database first for the result. If the query is already available in the
Database, it returns the value that was previously computed (from DB)
or it computes the result and returns it after storing the new query and
result in Database.
b. Do you really need to input so many attributes to get good results?
Maybe only a few would do. For example, you could try just having
attributes 2, 3, 5, 7, 10, 17 (and 21, the class attribute (naturally)). Try
out some combinations. (You had removed two attributes in problem
7. Remember to reload the arff data file to get all the attributes initially
before you start selecting the ones you want.) .
Week 9:
a. Develop the web application using Servlet and JSP, which takes a name
as input and on submit it shows a hello <name> page where<name> is
taken from the request. It shows the start time at the right top corner
of the page and provides a logout button. On clicking this button, it
should show a logout page with Thank You <name> message with the
duration of usage (hint: Use session to store name and time).
b. Develop the web application using Servlet and JSP, which lists all
cookies stored in the browser on clicking “List Cookies” button. Add
cookies if necessary.
c. Sometimes, the cost of rejecting an applicant who actually has a good
credit (case 1) might be higher than accepting an applicant who has
bad credit (case 2). Instead of counting the misclassifications equally
in both cases, give a higher cost to the first case (say cost 5) and lower
cost to the second case. You can do this by using a cost matrix in Weka.
Train your Decision Tree again and report the Decision Tree and cross-
validation results. Are they significantly different from results obtained
in problem 6 (using equal cost)?
Week 10:
a. Write an HTML page that has one input, which can take multi-line text
and a submit button. Once the user clicks the submit button, it should
show the number of characters, words and lines in the text entered
using an alert message. Words are separated with white space and lines
are separated with new line character.(Add CSS to customize the
properties of tags)
b. Do you think it is a good idea to prefer simple decision trees instead
of having long complex decision trees? How does the complexity of a
Decision Tree relate to the bias of the model?
Week 11:
a. Write an HTML page including any required Java script that takes a
number from one text field in the range of 0 to 999 and shows it in
another text field in words. If the number is out of range, it should
show “out of range” and if it is not a number, it should show “not a
number” message in the result box.
b. You can make your Decision Trees simpler by pruning the nodes. One
approach is to use Reduced Error Pruning - Explain this idea briefly.
Try reduced error pruning for training your Decision Trees using cross-
validation (you can do this in Weka) and report the Decision Tree you
obtain? Also, report your accuracy using the pruned model. Does your
accuracy increase?
Week 12:
a. Develop the web application using Servlet and JSP, where the user
submits the login name and password to the server, the name and
password are checked against the data available in database and use
AJAX , if the data matches, a successful message Otherwise a failure
message is shown to the user below the submit button.
b. Demonstrate performing Regression on data sets
c. How can you convert a Decision Trees into “if-then-else rules”. Make
up your own small Decision Tree consisting of 2-3 levels and convert
it into a set of rules. There also exist different classifiers that output
the model in the form of rules – one such classifier in Weka is rules.
PART, train this model and report the set of rules obtained. Sometimes
just one attribute can be good enough in making the decision, yes, just
one! Can you predict what attribute that might be in this dataset? OneR
classifier uses a single attribute to make decisions (it chooses the
attribute based on minimum error). Report the rule obtained by training
a OneR classifier. Rank the performance of j48, PART and OneR.
d. Case study
Hospital Management System: Data Warehouse Consists Dimension
Table and Fact Table. REMEMBER The following Dimension
The dimension object (Dimension):
2018-2019 153
• Name • Aribute S (Levels) , with one primary key • Hierarchies
One time dimension is must.About Levels and Hierarchies. Dimension
objects (dimension) consist of a set of levels and a set of hierarchies
defined over those levels. The levels represent levels of aggregation.
Hierarchies describe parent child relationships among a set of levels. For
example, a typical calendar dimension could contain five levels. Two
Hierarchies can be defined on these levels
• Hi: YearL> QuarterL> MonthL> WeekL> DayL
• H2: YearL> WeekL> DayL
The hierarchies are described from parent to child, so that Year is the
parent of Quarter, Quarter the parent of Month, and so forth. About Unique
Key Constraints. When you create a definition for a hierarchy, Warehouse
Builder creates an Identifier key for each level of the hierarchy and a unique
key constraint on the lowest level (Base Level). Design a Hospital
Management system data warehouse (TARGET) consists of Dimensions
Patient, Medicine, Supplier, and Time. Where measures are ‘NO UNITS’,
UNIT PRICE. Assume the Relational database (SOURCE) table schemas
as follows
• TIME (day, month, year),
• PATIENT (patient_name, Age, Address, etc.,)
• MEDICINE ( Medicine_Brand_name, Drug_name, Supplier, no_units,
Ulinit_Price, etc.,)
• SUPPLIER( Supplier_name, Medicine_Brand name, Address, etc.,)
If each Dimension has 6 levels, decide the levels and hierarchies, assume
the level names suitably. Design the Hospital Management system data
warehouse using all sachems. Give the example 4-D cube with assumption
names.
Text Books:
1. Steven Holzner, PHP The Complete Reference, 5th Edition, Published
on 01-Jan-2007 by Tata McGraw-Hill Education.
2. Marty Hall, Larry Brown, Core Servlets and Java Server Pages Core
Technologies, Published on 2004 by Prentice Hall Professional,
2nd Edition, Volume 1.
3. Robert S. Sebesta, Programming World Wide Web, Published on
28-Mar-2014 by 4th Edition, Pearson Education.
4. Jiawei Han & Micheline Kamber, Data Mining-Concepts and
Techniques, Elsevier.
5. Alex Berson and Stephen J. Smith, Data Warehousing, Data Mining &
OLAP, Tenth reprint 2007, Tata McGraw-Hill Edition.
Reference Books:
1. Uttam K. Roy, Web Technologies, Published on 23 December 2010
by OXFORD University press.
2. Java Complete Reference, published on 10 November 2017 by 10th
Edition, McGraw Hill Education.
3. Chris Bates, Web Programming. Building Internet Applications,
Published June 1st 2006, 3rd Edition, by Wiley.
4. Java Server pages Hans Bergsten, Published on June 2009 by O’Reilly
Media.
5. W. H. Inmon, Building the Data Warehouse, Wiley Dreamtech India
Pvt. Ltd.
6. Margaret H Dunham, Data Mining Introductory and Advanced topics,
Pearson Education.
Online Resources:
1. https://www.tutorialspoint.com
2. https://www.w3schools.com
3. https://www.javaTpoint.com
5. https://www.kdnuggets.com/websites/index.html.
6. https://www.ngdata.com/data-mining-resources.
Course Outcomes:
1. Use LAMP Stack for web applications and MySql to connect Database
using PHP, to parse and validate the data using XML.
2. Develop web applications using Servlets and JSP’s.
3. Create dynamic web pages using Java Script and AJAX.
4. Apply pre-processing statistical methods for any given raw data.
5. Implement various algorithms for data mining in order to discover
interesting patterns from large amounts of data.
6. Implement various classification and clustering algorithms for data
mining.
2018-2019 155
Course Code: PE11646 - - 2 1
IMAGE PROCESSING LAB
Prerequisites:-Nil-
Course Objectives:
1. Study the image fundamentals and mathematical transforms necessary
for image processing.
2. Understand the image enhancement techniques
3. Apply image restoration and morphological operations.
4. Analyse features of an image.
5. Analyse various color spaces and image compression techniques.
Use any tool like MATLAB, SCILab, OpenCV/Python/R Progra-
mming etc.
Week 1: Write programs for the following
a. Loading and displaying an image. b. Displaying image as a matrix.
c. Converting matrix to an image
Week 2: Write a program for merging of two images and to obtain negative
of an image
Week 3: Write a program to
a. Compute the histogram of an input image
b. Calculation and equalisation of the histogram
Week 4: Write programs for image frequency domain filtering
a. Apply FFT on given image
b. Perform low pass and high pass filtering in frequency domain
c. Apply IFFT to reconstruct image
Week 5: Write a program to add noise in the image and apply image
restoration techniques.
Week 6: Implement morphological operations like erosion, dilation,
opening and closing.
Week 7: Implement feature extraction methods on a given image.
Week 8: Program for edge detection using different edge detection masks.
Week 9: Write a program to convert an image from RGB to HSV color
space.
Week 10: Write program for geometric transformation of image
(a) Translation (b) Scaling (c) Rotation (d) Shrinking (e) Zooming
Week 11: Implementation of image compression techniques.
Week 12: Write a program for implementation of PCA on an Image.
Text Books:
1. Rudra Pratap, Getting Started with MATLAB: 1st Edition, A Quick
Introduction for Scientists & Engineers, 2010.
2. R C Gonzalez and R E woods, Digital Image Processing, Addison 3rd
Edition, Pearson, 2013.
Reference Books:
1. S.N.Alam and S.S.Alam, Understanding MATLAB: 1st Edition, A
Textbook for Begineers, 2013.
Online Resources:
1. https://www.mathworks.com/help/releases/R2014b/pdf_doc/matlab/
getstart.pdf
2. http://cmp.felk.cvut.cz/~perdom1/vyuka/dzo/cv1/images_tb.pdf
4. https://www.coursera.org
Course Outcomes:
1. Understand the fundamental concepts of a digital image processing
system.
2. Apply transformations in frequency domain.
3. Evaluate the techniques for image enhancement and image restoration.
4. Analyse features of an image.
5. Interpret of various color spaces.
6. Analyse different compression techniques.
2018-2019 157
MACHINE LEARNING LAB
Prerequisites:-Nil-
Course Objectives:
1. Familiarize with the basics of Python.
2. Implement different machine learning algorithms and techniques using
Python.
3. Analyse the performance of different machine learning algorithms.
List of Programs:
Week 1: Getting familiarised with basic concepts like data types, data
frames, control structures, list, tuple dictionary and functions in Python.
Week 2: Explore python classes and packages related to Machine Learning
using .CSV file format and use the same format for all programs.
Week 3: Implement FIND-S algorithm for finding the most specific
hypothesis based on a given set of training data samples.
Week 4: For a given set of training data examples, implement Candidate-
Elimination algorithm to output a description of the set of all consistent
hypothesis.
Week 5: Build FIND-S and Candidate-Elimination algorithm on a different
data set.
Week 6: Implement Decision tree for classification of any given data set.
Week 7: Implement pruning of Decision tree.
Week 8: Implement an Artificial Neural Network by implementing the
Back propagation algorithm and test the same using appropriate data set.
Week 9: Implement the naïve Bayesian classifier and compute the
accuracy, precision and recall of the classifier, considering appropriate
data set.
Week 10: Implement k-Nearest Neighbour algorithm to classify any given
data set.
Week 11: Implement Regression algorithm in order to fit data points.
Week 12: Implement Radial basis algorithm to classify the given data set.
Text Books:
1. Tom M. Mitchell, Machine Learning, Mc Graw Hill Education, 1997.
2. Sebastian Raschka, Python Machine Learning, PACKT Publishing,
2015.
Reference Books:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT
Press, 2012.
2. Trevor Hastie, Robert Tibshirani and Jerome Friedman, The Elements
of Statistical Learning, 2nd Edition, Springer Series in Statistics, 2001.
3. William W Hsieh, Machine Learning Methods in the Environmental
Sciences, Neural Networks and Kernels, Cambridge University Press.
4. Stephen Marsland, Machine Learning - An Algorithmic Perspective,
CRC Press, 2009.
5. Charles R Severance, Python for Everybody: Exploring Data in Python
3, Create Space Independent Publishing, 2016.
Online Resources:
1. http://www.cs.cmu.edu/~tom/
2. http://www.holehouse.org/mlclass/
Course Outcomes:
1. Program using basic features of Python.
2. Apply and analyse concept learning techniques to version spaces.
3. Design statistical and hierarchical models in Machine Learning.
4. Analyse lazy and eager learning algorithms.
5. Identify machine learning techniques appropriate to respective
problems.
6. Compare various machine learning algorithms along with their strengths
and weaknesses.
2018-2019 159
INTERNET OF THINGS LAB
Course Objectives:
1. To impart necessary and practical knowledge of components of Internet
of Things.
2. To introduce the Python Scripting Language which is used in many IoT
devices.
3. To introduce the Raspberry Pi platform, that is widely used in IoT
applications.
4. Develop the required skills to build real-life IoT based projects.
Install the following on the local machine.
● Raspberry Pi OS. ● Python.
Implement and test the following experiments on a Raspberry Pi.
Week 1: Familiarization of the Equipment used for IoT lab.
Week 2: Start Raspberry Pi and try various Linux commands in command
terminal window: ls, cd, touch, mv, rm, man, mkdir, rmdir, tar, gzip, cat,
more, less, ps, sudo, cron, chown, chgrp, ping.
Week 3:
a. Program to Read your name and print Hello message with name.
b. Program to Read two numbers and print their sum, difference, product
and division.
Week 4:
a. Program to display Word and character count of a given string.
b. Program to calculate Area of a given shape (rectangle, triangle and
circle) reading shape and appropriate values from standard input.
Week 5:
a. Program to print a name ‘n’ times, where name and n are read from
standard input, using for and while loops.
b. Program to Handle Divided by Zero Exception.
Week 6: Program to print current time for 10 times with an interval of 10
seconds. Read a file line by line and print the word count of each line.
Week 7: Light an LED through Python program.
Week 8: Program to get input from two switches and switch on
corresponding LEDs.
Week 9: Program to Flash an LED at a given on time and off time cycle,
where the two times are taken from a file.
Week 10: Program to Flash an LED based on cron output (acts as an
alarm).
Week 11: Program to switch on a relay at a given time using cron, where
the relay’s contact terminals are connected to a load.
Week 12: Program to get the status of a bulb at a remote place (on the
LAN) through web.
Text Books:
1. Vijay Madisetti and Arshdeep Bahga, Ïnternet of Things- A Hands on
Approach, University Press.
2. Dr. SRN Reddy, Rachit Thukral and Manasi Mishra, Introduction to
Internet of Things: A practical Approach, ETI Labs.
Reference Books:
1. Pethuru Raj and Anupama C. Raman, The Internet of Things: Enabling
Technologies, platforms, and Use Cases, CRC Press.
2. Jeeva Jose, Internet of Things, Khanna Publishing House, Delhi.
3. Adrian McEwen, Designing the Internet of Things, Wiley.
4. Raj Kamal, Internet of Things: Architecture and Design, McGraw Hill.
5. Cuno P fister, Getting Started with the Internet of Things, O Reilly
Media.
Online Resources:
1. https://www.tutorialspoint.com.
2. https://www.edureka.co.
Course Outcomes:
1. Understand internet of Things and its hardware and software
components.
2. Interface I/O devices, sensors.
3. Create programs using python scripting language in IoT devices.
4. Interface IoT communication modules.
5. Remotely monitor data and control devices.
6. Develop real life IoT based projects.
2018-2019 161
IV Year B.Tech. CSE I-Semester L T P C
Course Code: HS117DZ 3 - - 3
ENTREPRENEURSHIP AND PROJECT MANAGEMENT
Prerequisites: Managerial Economics and Financial Analysis (MEFA),
Fundamentals of Management (FM)
Course Objectives:
1. To inculcate the entrepreneurial knowledge required to start and/or to
run a business.
2. To hone the entrepreneurial skills and creating sensibility in
entrepreneurial establishment.
3. To develop strategic skills in the project planning and implementation.
Introduction to Entrepreneurship
Entrepreneurship: Introduction to Entrepreneurship and Entrepreneur -
Characteristic and skills of an Entrepreneur - Factors affecting
Entrepreneurship development - Types of Entrepreneurs - Entrepreneur
Vs Intrapreneur, Entrepreneur Vs Entrepreneurship - Women Entrepreneurs
- Growth and Problems - Incubation Centers.
Entrepreneurial business selection and Entrepreneurial Finance
Entrepreneurial business selection: Criteria for selection of Business
Structure-Types of Business Structures - Sole Proprietorship-Partnership
- Limited Liability Partnership - One-person company - Joint stock company
– Features - Merits & Demerits.
Entrepreneurial Finance: Factors affecting Fixed Capital and Working
Capital requirements - Sources of raising Finance - Financial Institutions
in India.
Profit Planning Techniques
Capital Budgeting: Introduction-Need and Importance of Capital
Budgeting -Traditional methods - Payback Period Method - ARR Method.
Discounted Cash Flow Method-NPV-PI and IRR (simple problems).
Break-Even Analysis: Need, Scope and Significance - Assumptions -
Advantages and Limitations - Practical Applications (with simple problems)
Project Management
Network Analysis: Introduction to Network analysis – PERT & CPM
Analysis. Identification of Critical Path - Probability of Completing the
Project within a given time - Calculation of Float/Slack - Importance of
PERT & CPM in Decision Making.
Entrepreneurial Marketing
Marketing: Need for a New Product development process - Essentials of
Marketing Management - Key success factors in Marketing - Marketing
mix - Market Segmentation and Marketing Strategies based on PLC.
Text Books:
1. Dr. S. S.Khanka, Entrepreneurial Development, 1st Edition, S.Chand &
Company, 2018.
2. L.S.Srinath, PERT & CPM-Principles & Applications, 3rd Edition, EWP,
2012.
3. Khan and Jain, Financial Management, 6th Edition, TMH, 2012.
Reference Books:
1. Philip Kotler, Marketing Management, 14th Edition, Pearson, 2013.
2. Robert. D. Hisirch, Mathew. J. Manimal, Michael. P. Peter, Dean A.
Shepherd, Entrepreneurship, 9th Edition, McGraw Hill, 2017.
3. S. D. Sharma, Operations Research, 1st Edition, Macmillan, 2007.
4. Tulsian, Business organization & Management, 1st Edition, Pearson,
2008.
Online Resources:
Management Science II: http://nptel.ac.in/courses/122106032/
Course Outcomes:
After completion of the course, student will be able to
1. Possess sensibleness and skills required for establishment of business.
2. Construe the entrepreneurial ingenuity required for business
functioning.
3. Give perception on the probable business structures for entrepreneurial
decisions
4. Scrutinize the probable financial propositions in investment process.
5. Evaluate the entrepreneurial project feasibility of implementation and
its profitability.
6. Delve the market for the product developed through entrepreneurial
establishment.
2018-2019 163
Course Code: PC117DQ 3 - - 3
COMPILER DESIGN
Prerequisites: Data Structures, Computer Organization and Architecture,
Formal Languages and Automata Theory.
Course Objectives:
1. To understand the model and stages in the process of compilation.
2. To identify different methods to design parsers or tools.
3. To use knowledge of synthesized and inherited attributes in design of
translation schemes.
4. Ability to develop algorithms to improve efficiency of compilers.
Introduction: Overview of compilation, Language Processors, The
structure of a Compiler, Pass and Phases of translation, Interpretation and
bootstrapping, The science of building Compiler, Programming language
basics
Lexical analysis: The role of the Lexical analyzer, Input Buffering,
Recognition of Tokens, Finite Automata, From regular expression to
Automata, Design of a Lexical-Analyzer Generator, Optimization of DFA-
Based Pattern Matches, LEX - lexical analyzer generator tool.
Syntax Analysis: Introduction, Context free Grammars, Writing a
Grammar.
Top down Parsing: Backtracking, Recursive descent parsing, Predictive
parsing, LL(1) grammars.
Bottom up Parsing: Introduction to LR parsing, Shift reduce parsing,
Simple LR, More powerful LR Parsers, LR(0) items, SLR table
construction, Algorithm, LR(1) items, CLR table constructions, LALR
table constructions, Error recovery in Parsing, Handling ambiguous
grammar, YACC- automatic parser generator tool.
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation
Orders for SDD’s, Application of Syntax-Directed Translation, Syntax-
Directed Translation Schemes, Implementing L-Attributed SDD’s.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address
Code, Types and Declarations, Type checking, Control Flow, Back Patching,
Switch Statements, Intermediate Code for Procedures.
Run Time Environments: Symbol table entries & operations, Storage
organization, Stack Allocation of Space, Access to Nonlocal Data on the
Stack, Heap Management
Code Generation: Issues in the design of a Code Generator , The target
Language, Addresses in the Target Code, Basic Blocks and Flow Graphs, A
simple Code generator, Register Allocation and Assignment.
Code Optimizations: The principal sources of optimization, Optimization
of Basic Block, Introduction to Data-Flow Analysis, Foundations of Data-
Flow Analysis, Constant Propagation, Partial Redundancy Elimination,
Loops in Flow Graphs, Peephole Optimization.
Text Books:
1. A.V. Aho, Monica S. Lam, Ravi Sethi and J.D. Ullman, Compilers-
Principles, Techniques and Tools, 2nd Edition, Pearson Education.
2. Andrew N. Appel, Modern Compiler Implementation in C, Cambridge
University Press.
Reference Books:
1. John R. Levine, Tony Mason and Doug Brown, Lex & Yacc-O‘reilly.
2. Dick Grune, Henry E. Bal and Cariel T. H. Jacobs, Modern Compiler
Design- Wiley dreamtech.
3. Cooper and Linda, Engineering a Compiler- Elsevier.
4. Kenneth C.Louden, Compiler Construction, Course Technology Inc,
International Edition (24 January 1997).
5. Jean Paul Tremblay, P.G Sorenson and Sorenson Gaul G, The Theory
and Practice of Compiler Writing, International Edition, McGraw-Hill,
1985.
Online Resources:
1. http://www.vssut.ac.in/lecture_notes/lecture1422914957.pdf
2. http://www.svecw.edu.in/Docs%5CCSECDLNotes2013.pdf
Course Outcomes:
After completion of the course, student will be able to
1. Understand the working model of existing compilers.
2. Develop tools for different phases of compiler.
3. Compare top-down and bottom-up parsers for a given grammar.
4. Analyze and apply syntax directed translation schemes in different
phases.
5. Design techniques to improve the efficiency of a compiler.
6. Develop algorithms to generate code for target machine.
2018-2019 165

Course Code: PE117DN 3 - - 3
ARTIFICIAL INTELLIGENCE
Prerequisites: Data Structures, Discrete Mathematics
Course Objectives:
1. To learn the difference between optimal reasoning Vs. human like
reasoning.
2. To understand the notions of state space representation, uninformed
search, informed (heuristic) search.
3. To learn different knowledge representation techniques.
4. To understand the applications of AI: namely Game Playing, Expert
Systems, Machine Learning and Natural Language Processing.
Introduction, History, Foundations of AI, Sub areas of AI, Objectives and
Applications of AI.
Intelligent Agent: Agents and Environments and the Structure of Agents.
Solving Problem by Searching: Introduction, General Problem Solving.
Uninformed Search Strategies: Breadth First Search and Depth First
Search.
Informed (Heuristic) Search Strategies: Heuristic Function, A*
Algorithm and Hill Climbing.
Game Playing: Optimal Decisions in Games, the Minimax Algorithm,
Alpha-Beta Pruning, Constraint Satisfaction Algorithm.
Logic Concepts: Introduction, Propositional Logic, Predicate Logic,
Unification Algorithm, Natural Deduction System, Semantic Tableau
System in Propositional Logic, Resolution Refutation in Propositional
Logic.
Knowledge Representation: Introduction, Approaches to Knowledge
Representation, Knowledge Representation using Semantic Networks and
Extended Semantic Networks, Knowledge Representation using Frames.
Expert System and Applications: Introduction, Phases in Building Expert
Systems, Expert System Architecture, Expert Systems Vs. Traditional
Systems, Application of Expert Systems, List of Shells and Tools.

Uncertainty Measure: Probability Theory: Introduction, Probability
Theory, Bayesian Belief Networks, Dempster-Shafer Theory.
Machine Learning: Introduction, Machine Learning Systems, Supervised,
Unsupervised Learning and Reinforcement Learning. Learning Decision
Trees, Clustering, Support Vector Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks,
Single-Layer Feed-Forward Networks, Multi-Layer Feed-Forward
Networks, Recurrent Networks, Design Issues of Artificial Neural
Networks.
Advanced Knowledge Representation Techniques: Case Grammars,
Semantic Web.
Natural Language Processing: Introduction, Sentence Analysis Phases,
Grammars and Parsers, Types of Parsers.
Text Books:
1. Russell and Norvig, Artificial intelligence, A Modern Approach, 3rd
Edition, Pearson Education, 2014.
2. Rich, Knight and Nair, Artificial intelligence, 3rd Edition, Tata McGraw
Hill, 2009.
Reference Books:
1. Deepak Khemani, A First Course in Artificial Intelligence, McGraw-
Hill Education, 2013.
2. SarojKaushik, Artificial Intelligence, Cengage Learning, 2011.
3. D Samanta, Classic Data Structures, 2nd Edition, PHI.
Online Resources:
1. https://faculty.psau.edu.sa/filedownload/doc-7-pdf a154ffbcec
538a4161a406abf62f5b76-original.pdf
4. https://onlinecourses.nptel.ac.in/noc18_cs18/preview
5. https://www.edx.org/course/artificial-intelligence-ai-columbiax-
csmm-101x-4
2018-2019 167
Course Outcomes:
1. Understand the basics of AI and knowledge representation using
appropriate technique.
2. Apply AI techniques for problem solving using various search and game
playing algorithms.
3. Interpret architectures of different intelligent agents and Expert
Systems.
4. Interpret probabilistic and logical reasoning for knowledge.
5. Analyze different Machine Learning approaches for problem solving.
6. Recognize basics of Natural Language Processing.
Course Code: PE117DT 3 - - 3
DISTRIBUTED SYSTEMS
Prerequisites: Operating Systems, Database Management Systems.
Course Objectives:
1. To understand what and why a distributed system is.
2. To understand IPC, Group Communication & RPC Concepts.
3. To understand the DFS and different Name Services.
4. To understand theoretical concepts, namely, virtual time, agreement
and consensus protocols.
5. To understand the concepts of Replication and transaction in distributed
environment and associated concepts, namely, concurrency control,
deadlocks and error recovery.
Characterization of Distributed Systems: Introduction, Examples of
Distributed systems, Trends in distributed Systems, Focus on resource
sharing, Challenges, Case study: The World Wide Web.
System models: Introduction, Physical models, Architectural models,
Fundamental models.
Inter Process Communication: Introduction, The API for the Internet
Protocols, External data representation and marshalling, Multicast
communication, Network virtualization: Overlay networks, Case Study:
MPI.
Remote Invocation: Introduction, Request-reply protocols, Remote
Procedure Call, Remote method invocation, Case study: Java RMI.
Distributed File Systems: Introduction, File Service architecture, Case
study: SUN network file system and Andrew file system.
Name Services: Introduction, Name Services and the Domain Name
System, Directory Services, Case study: The Global Name Service.
Time and Global States: Introduction, Clocks, Events and Process states,
Synchronizing physical clocks, Logical time and logical clocks, Global
states.
2018-2019 169
Coordination and Agreement: Introduction, Distributed mutual
exclusion, Elections, Coordination and agreement in group communi-
cation, Consensus and related problems.
Distributed Transactions: Introduction, Flat and Nested Distributed
Transactions, Atomic commit protocols, Concurrency control in distributed
transactions, Distributed deadlocks, Transaction recovery.
Replication: Introduction, System model and the role of group communi-
cation, Fault-tolerant services, Transactions with replicated data, Case
study: The gossip architecture.
Text Books:
1. George Coulouris, J Dollimore, Tim Kindberg and G Blair, Distributed
Systems, Concepts and Design, 5th Edition,Pearson Education, 2012.
Reference Books:
1. Andrew S.Tanenbaum and Maarten VanSteen, Distributed systems-
Principles and Paradigms, 2nd Edition, PHI.
2. Sukumar Ghosh, Distributed Systems - An Algorithm Approach,
Chapman & Hall/CRC and Taylor & Fransis Group, 2007.
Online Resources:
1. https://www.smartzworld.com/notes/distributed-systems-notes-pdf-
ds/
2. nptel.ac.in/courses/106106107
3. https://edutainmentzone.blogspot.com › Home › DS › Education
4. https://swayam.gov.in/course/3946-distributed-systems
5. h t t p s : / / w w w. c o u r s e r a . o rg / c o u r s e s ? l a n g u a g e s = e n & q u e r y =
distributedsystems
6. https://onlinecourses.nptel.ac.in/noc17_cs42
Course Outcomes:
1. Understand the concepts, challenges of distributed system and various
system models.
2. Analyze the establishment of Inter process communication and remote
invocation between distributed systems.
3. Comprehend a distributed system with the features that support
distributed file system and name services.
4. Apply virtual time, agreement and consensus protocols in distributed
Systems.
5. Apply and analyze the knowledge of distributed transactions and
replication.
6. Familiarize with the design, implementation and other issues of
distributed system.
Course Code: PE117EQ 3 - - 3
SOFT COMPUTING
Prerequisites:-Nil-
Course Objectives:
1. Acquire the fundamental knowledge in soft computing.
2. Understand and analyze various searching and representations in logic.
3. Analyze the fundamentals of artificial neural network models.
4. Understand the basics of fuzzy sets and fuzzy logic rules.
5. Discuss the basics of genetic algorithms.
Problems and Search: Introduction to soft computing, Al problems,
Techniques, Heuristic Search Techniques- Generate and Test, Hill Climbing,
A* Algorithm, Constraint Satisfaction problem, Approaches to Knowledge
Representation.
Using Predicate Logic: Representing simple facts in logic, Representing
Instance and Isa Relationships, Computable Functions and Predicates.
Artificial Neural Networks: Fundamental Concepts, Basic models of
ANN, Important terminologies of ANN, McCulloch-Pitts Neuron, Linear
Separability, Hebb Network
Supervised Learning Networks: Introduction, Perceptron Networks,
Back-propagation Network, Radial Basis Functional Network.
Associative Memory Networks: Introduction, Training Algorithms for
Pattern Association, Auto associative memory network, Bidirectional
associative memory, Hopfield Networks.
Unsupervised Learning Network: Introduction, Kohonen Self-
Organizing Feature Maps, Learning Vector Quantization.
Introduction to Fuzzy Logic, Classical Sets (Crisp Sets) and Fuzzy
Sets: Introduction to Fuzzy Logic, Fuzzy sets.
Classical Relations and Fuzzy Relations: Introduction, Cartesian product
of relation, Classical Relation, Fuzzy Relations.
Membership Functions: Fuzzification, Methods of membership value
assignments, Defuzzification, Fuzzy Rule Base and Approximate
Reasoning.
2018-2019 171
Genetic Algorithms: Introduction, Genetic Algorithm and Search space,
Genetic Algorithm Vs Traditional Algorithms, Basic Terminologies,
Simple GA, General Genetic Algorithm.
Operators in GA-Encoding: Binary Encoding, Octal Encoding,
Hexadecimal Encoding.
Selection: Roulette wheel, Random, Rank, Tournament Selection.
Crossover (Recombination): Single-point, Two-point, Multipoint,
Uniform crossover.
Mutation: Flipping, Reversing, Stopping Condition for GA flow,
Applications of GA.
Text Books:
1. S N Sivanandam and S N Deepa , Principles of Soft Computing 2nd
Edition, Wiley India, 2011, rp2018.
2. Elaine Rich, Kevin Knight and Shivashankar B.Nair, Artificial
Intelligence, 3rd Edition TMH, 2009, rp2017.
Reference Books:
1. B.Yegnarayana, Artificial Neural networks - PHI learning, 1st Edition,
1999, rp2005.
2. Amit Konar, Artificial Intelligence and Soft Computing- Behavioural
and Cognitive Modelling of the Human Brain, CRC press, 1st Edition,
Taylor and Francis Group, 1999.
3. Hung T Nguyen and Elbert A Walker, A first course in Fuzzy Logic,
CRC Press, 3rd Edition, Taylor and Francis Group, 2006.
4. Fakhreddine Karray and Clarence D Silva, Soft Computing and
Intelligent System Design, Pearson Edition, 2004.
Online Resources:
1. https://drive.google.com/file/d/0B0z1V-RAPGVkT2MyTXlwdE
9XWXc/view?usp=sharing
2. https://onlinecourses.nptel.ac.in.
3. http://www.myreaders.info/html/soft_computing.html.
Course Outcomes:
1. Identify artificial intelligence and soft computing techniques in building
Intelligent machines.
2. Understand the concept of artificial neural networks.
3. Analyze the various Supervised and Unsupervised learning networks.
4. Apply fuzzy logic and reasoning to handle uncertainty.
5. Understand different operators and basic terminologies of genetic
algorithms.
6. Evaluate different soft computing techniques for suitable applications.
Course Code: PE117ER 3 - - 3
SOFTWARE TESTING METHODOLOGIES
Prerequisites: Programming for Problem Solving, Software Engineering.
Course Objectives:
1. To learn various software testing techniques and solutions in software
like unit test, integration, regression, and system testing.
2. To learn how to write software testing documents, and communicate
with engineers in various forms.
3. Know a variety of structural and functional testing techniques.
4. To gain overview of usage of software testing tools to test software
projects.
5. To understand the relationship between testing, software quality and
other verification techniques.
Introduction: Purpose of testing, Dichotomies, model for testing,
consequences of bugs, taxonomy of bugs.
Flow graphs and Path testing: Basics concepts of path testing,
predicates, path predicates and achievable paths, path sensitizing, path
instrumentation, application of path testing.
Transaction Flow Testing: Transaction flows, transaction flow testing
techniques.
Dataflow testing: Basics of dataflow testing, strategies in dataflow testing,
application of dataflow testing.
Domain Testing:-Domains and Paths, Nice & Ugly domains, Domain
testing, Domains and Interfaces Testing, Domains and Testability.
Paths, Path products and Regular expressions: path products & path
expression, reduction procedure, applications, regular expressions & flow
anomaly detection.
Logic Based Testing: - Overview, decision tables, path expressions, KV
charts, specifications.
State, State Graphs and Transition testing: state graphs, good & bad
state graphs, state testing, Testability tips.
2018-2019 173
Graph Matrices and Application: Motivational overview, matrix of
graph, relations, power of a matrix, node reduction algorithm, building
tools. (Student should be given an exposure to a tool like JMeter or Win-
runner).
Text Books:
1. Boris Beizer, Software testing techniques, 2nd Edition, Dreamtech.
2. Dr. K.V.K.K. Prasad, Software Testing Tools, Dreamtech.
Reference Books:
1. Perry and John Wiley, Effective methods of Software Testing, 2nd
Edition, 1999.
2. Brian Marick, The craft of software testing, Pearson Education.
Online Resources:
http://jmeter.apache.org/
Course Outcomes:
1. Understand terminology of Software Testing.
2. Understand and identify various transaction flow and data flow
problems, and solve these problems by selecting test models, criteria,
strategies and methods.
3. Gain knowledge and understanding of domain testing, path expressions
and regular expressions in software testing.
4. Apply the knowledge of decision tables, KV charts in logic based
testing, state graphs and state testing.
5. Gain knowledge and understanding of Graph matrices and its
applications.
6. Write test cases and to implement these methods, strategies, tools in
software projects.
Course Code: PE117DP 3 - - 3
CLOUD COMPUTING
Prerequisites: Operating Systems, Computer Networks.
Course Objectives:
1. To explain evolving computer model called cloud computing.
2. To introduce the various levels of services that can be achieved by
cloud.
3. To describe the security aspects of cloud.
Introduction- Cloud computing at a glance, Historical developments,
Building cloud computing environments.
Cloud Computing Architecture - The cloud reference model, Types of
clouds, Economics of the cloud, Open challenges.
Virtualization - Characteristics of virtualized environments, Taxonomy
of virtualization techniques, Virtualization and cloud computing, Pros and
cons of virtualization, Technology examples- Xen, VMware, Microsoft
Hyper-V. Migrating into a Cloud, Virtual Machines Provisioning and
Migration Services.
Cloud Platforms in Industry: Amazon web services, Google AppEngine,
Microsoft Azure, Aneka-Integration of private and public cloud
Cloud Applications: Scientific applications, Business and consumer
applications.
Security in the Cloud- Cloud Security Challenges, Software-as-a-Service
Security.
Secure Distributed Data Storage in Cloud Computing - Cloud Storage:
from LANs TO WANs, Technologies for Data Security in Cloud
Computing.
Data Security in the Cloud- The Current State of Data Security in the
Cloud, Cloud Computing and Data Security Risk, Cloud Computing and
Identity, The Cloud, Digital Identity, and Data Security, Content Level
Security-Pros and Cons.
2018-2019 175
SLA Management - Traditional Approaches to SLO Management, Types
of SLA, Life Cycle of SLA, SLA Management in Cloud, Automated Policy-
based Management.
Common Standards in Cloud Computing - The Open Cloud Consortium,
Distributed Management Task Force, Standards for Application
Developers, Standards for Messaging, Standards for Security.
Text Books:
1. Rajkumar Buyya, Christian Vecchiola and S.Thamarai Selvi, Mastering
Cloud Computing: Foundations and Applications Programming, 2013
McGraw Hill Education.
2. Rajkumar Buyya, James Broberg and Andrzej, Cloud Computing:
Principles and paradigms Wiley, 2011.
3. John W. Rittinghous and James F. Ransome, Cloud Computing:
Implementation, Management and Security by CRC, 2010.
Reference Books:
1. Kai Hwang, Geoffery C.Fox, Jack J Dongarra and Elsevier, Distributed
and cloud computing, 2012.
2. A. Kannammal, Fundamentals of Cloud Computing, CL India, 2015.
3. Tim Mather, Subra Kumaraswamy and Shahed Latif, Cloud Security and
Privacy, An Enterprise Perspective on Risks and Compliance.
By Publisher: O’Reilly Media 2009.
Online Resources:
1. https://ramslaw.files.wordpress.com/2016/07/0124114547cloud.pdf
2. http://www.chinacloud.cn/upload/2011-07/11073107539898.pdf
3. https://eniac2017.files.wordpress.com/2017/03/distributed-and-
cloud- computing.pdf
4. https://aws.amazon.com/
5. https://cloud.google.com/
Course Outcomes:
1. Articulate the main concepts, key technologies, strengths, and
limitations of cloud computing.
2. Illustrate the broad perceptive of cloud architecture and model.
3. Apply and design suitable Virtualization concept.
4. Explore some important cloud computing driven commercial systems
such as Google Apps, Microsoft Azure and Amazon Web Services and
other businesses cloud applications.
5. Assess cloud Storage systems and Cloud security, the risks involved,
its impact and develop cloud application.
6. Analyze the various standards for Cloud computing and its management.
Course Code: PE117DY 3 - - 3
EMBEDDED SYSTEMS
Prerequisites:-Nil-
Course Objectives:
1. To make students familiar with the basic concepts and terminology of
the embedded systems design flow.
2. Understand the hardware and software technologies used in embedded
systems.
3. To learn the Real Time Operating System concepts is Embedded
System.
Embedded Computing: Introduction, Complex Systems and
Microprocessor, The Embedded System Design Process, Formalisms for
System Design, Design Examples.
The 8051 Architecture: Introduction, 8051 Microcontroller Hardware,
Input/Output Ports and Circuits, External Memory, Counter and Timers,
Serial data Input/Output, Interrupts.
Basic Assembly Language Programming Concepts: The Assembly
Language Programming Process, Programming Tools and Techniques,
Programming the 8051. Data Transfer and Logical Instructions. Arithmetic
Operations, Decimal Arithmetic. Jump and Call Instructions, Further
Details on Interrupts.
Applications: Interfacing 8051 microcontroller with Keyboards,
Displays, D/A and A/D Conversions, Multiple Interrupts, Serial Data
Communication.
Introduction to Real – Time Operating Systems: Tasks and Task States,
Tasks and Data, Semaphores, and Shared Data; Message Queues,
Mailboxes and Pipes, Timer Functions, Events, Memory Management,
Interrupt Routines in an RTOS Environment.
Basic Design Using a Real-Time Operating System: Principles,
Semaphores and Queues, Hard Real-Time Scheduling Considerations,
Saving Memory and Power, An example RTOS like μC-OS (Open Source);
2018-2019 177
Embedded Software Development Tools: Host and Target machines, Linker/
Locators for Embedded Software, Getting Embedded Software into the
Target System; Debugging Techniques: Testing on Host Machine, Using
Laboratory Tools, An Example System.
Introduction to advanced architectures: ARM and SHARC, Processor
and memory organization and Instruction level parallelism; Networked
embedded systems: Bus protocols, I2C bus and CAN bus; Internet-Enabled
Systems, Design Example - Elevator Controller.
Text Books:
1. Wayne Wolf, Computers as Components-Principles of Embedded
computer system design, Elsevier. 2008.
2. Kenneth J. Ayala and Thomson, The 8051 Microcontroller, 3rd Edition,
Cengage Publication, 2005.
3. David E. Simon, An Embedded Software Primer, Pearson Education.
Reprint, 2005.
Reference Books:
1. Muhammad Ali Mazidi and Janice Gillispie Mazidi, The 8051
Microcontroller and Embedded Systems, 2nd Edition, Pearson, 2005.
2. Raj Kamal, Embedded Systems-Architecture, Programming and Design,
2nd Edition, TMH.
3. Shibu. K.V, Introduction to Embedded Systems, TMH, 2009.
4. Ajay V Deshmukhi, Micro Controllers- Theory and Applications, 1st
Edition, TMH, 2005.
Online Resources:
https://onlinecourses.nptel.ac.in/
Course Outcomes:
1. Understand the hardware and software technologies used in embedded
systems.
2. Analyse the architecture and instruction set of 8051microcontroller.
3. Design an interface for peripherals & I/O devices to a microcontroller.
4. Write programs in 8051 assembly language.
5. Understand the services and features of Real Time Operating System.
6. Use network topologies for embedded systems.
Course Code: PC11756 - - 2 1
COMPILER DESIGN LAB
Prerequisites: Programming for Problem Solving, Data Structures.
Course Objectives:
1. To practice and understand the working principle of compiler.
2. To learn the various techniques in design of scanner and parser.
3. Use of Syntax-Directed Translation schemes.
4. Generation of target code.
Week 1: Develop a lexical analyzer that reads a program in C from a file
to recognize identifiers, keywords, operators, special tokens , comments
and ignoring spaces, tabs, newlines characters in C language.
Week 2 : Generate lexical analyzer using LEX tool.
Week 3: Design Recursive Descent parser in C language to validate input
for a given grammar.
Week 4: Develop Predictive parser that validates input string using the
parsing table designed for a grammar.
Week 5 : Design LR parser that validates input string with respect to a
given grammar.
Week 6 :Design LALR parser for the given grammar using YACC.
Evaluation of arithmetic expression generated by unambiguous grammar.
Evaluation of arithmetic expression generated by ambiguous grammar.
Week 7:Using YACC specifications develop a parser that generates postfix
notation.
Week 8: Using YACC specifications develop a parser that generates three
address code for arithmetic expression.
Week 9: Using YACC write a program to generate abstract syntax tree.
Week 10: Write a program to generate machine code for the given
Intermediate code (Three Address Code/ Abstract Syntax Tree).
Text Books:
1. A.V. Aho and J.D.Ullman, Principles of compiler design, Pearson
Education
2018-2019 179
Reference Books:
1. John R. Levine, Tony Mason and Doug Brown, Lex and Yacc, O‘reilly.
2. Dick Grune, Henry E. Baland Cariel T. H. Jacobs, Modern Compiler
Design- Wiley dreamtech.
3. Cooper and Linda, Engineering a Compiler, Elsevier.
Online Resources:
1. http://dinosaur.compilertools.net/lex/index.html
3. http://www.svecw.edu.in/Docs%5CCSECDLNotes2013.pdf
Course Outcomes:
1. Understand the design features of a compiler for the given language.
2. Implement various phases of a compiler.
3. Develop the lexical analyzer for a given grammar specification.
4. Design top-down and bottom-up parsers for a given parser
specification.
5. Use LEX and YACC tools in generating powerful compilers.
6. Develop algorithms to generate code for a target machine.
IV Year B.Tech. CSE II-Semester L T P C
Course Code: PC118FF 3 - - 3
CRYPTOGRAPHY & NETWORK SECURITY
Prerequisites: Computer Networks
Course Objectives:
1. Understand basics of Cryptography and Network Security.
2. Secure a message over insecure channel by various means.
3. Acquire knowledge on standard algorithms used to provide
confidentiality, integrity and authenticity.
4. Understand the various key distribution and management schemes.
5. Knowledge on IP Security and Email Security.
6. Understand the Security Standards of Web and Wireless Network
Security.
Computer and Network Security Concepts: Computer Security
Concepts, Security Attacks, Security Services, Security Mechanisms, A
Model for Network Security.
Classical Encryption Techniques: Symmetric Cipher Moiques,
Steganography.
Block Ciphers and the Data Encryption Standard: Tradition Block
Cipher Structure, DES, Strength of DES.
Advanced Encryption Standard: A
ES structure, AES Transformation Functions, AES Key expansion.
Computer-based Symmetric Key Cryptographic Algorithms:
International Data Encryption Algorithm (IDEA), RC4,
Block Cipher Operations: Multiple Encryption and Triple DES,
Electronic Codebook, Cipher Block Chaining Mode, Cipher Feedback
Mode.
Asymmetric Ciphers: RSA Algorithm, Diffie-Hellman Key exchange,
Elgamal Cryptographic System.
Cryptographic Data Integrity Algorithms: Cryptographic Hash
functions: Applications of Cryptographic Hash functions, Two simple Hash
functions, Requirements and Security, SHA.
2018-2019 181
Message Authentication Codes: Message Authentication Requirements,
Message Authentication Functions, Requirements for Message
Authentication Codes, HMAC.
Digital Signatures: Digital Signatures, Elgamal Digital Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using
Symmetric Encryption, Symmetric Key Distribution Using Asymmetric
Encryption, Distribution of Public Keys.
X.509 Certificates, Kerberos.
Transport-Level Security: Web Security Considerations, Transport Layer
Security, HTTPs.
Electronic Mail Security: S/MIME, Pretty Good Privacy.
IP Security: IP Security overview, IP Security Policy, Encapsulating
security payload, combining security associations, Internet Key Exchange
Case Studies on Cryptography and Security: Secure Multiparty
Calculation, Virtual Elections, Single Sign On, Secure Inter-branch
Payment Transactions, Cross Site Scripting Vulnerability.
Text Books:
1. William Stallings, 7th Edition, Cryptography and Network Security.
2. AtulKahate, Cryptography and Network Security, 3rd Edition, McGraw
Hill.
Reference Books:
1. William Stallings, Network Security Essentials (Applications and
Standards), 4th Edition, Pearson Education.
2. C K Shyamala, N Harini and Dr T Padmanabhan, Cryptography and
Network Security, 1st Edition, Wiley India.
3. Bernard Menezes, Network Security and Cryptography, CENGAGE
Learning.
Online Resources:
1. https://www.tutorialspoint.com/information_security_cyber_law/
network_security.htm
2. http://scitechconnect.elsevier.com/wp-content/uploads/2013/09/
Network-Security-Basics.pdf
3. https://alison.com/course/introduction-to-computer-network-security
4. https://online.stanford.edu/course/network-security
5. https://www.coursera.org/browse/computer-science/computer-
security-and-networks?languages=en
Course Outcomes:
1. Identify network security threats and indicate countermeasures.
2. Illustrate various cryptographic algorithms.
3. Understand various message authentication algorithms and applications.
4. Identify security solutions for E-Mail and IP layer.
5. Demonstrate security solutions for web and internet.
6. Analyse vulnerabilities using different case studies.
2018-2019 183
IV Year B.Tech. CSE II Semester L T P C
Course Code: PE118FZ 3 - - 3
SOFTWARE PROJECT MANAGEMENT
Prerequisites: Software Engineering, Software Testing Methodologies
Course Objectives:
1. Create a Software System with a predetermined functionality and quality
in a given time frame and with given costs.
2. Focusing on principles, techniques, and methods applicable for various
software projects.
3. To analyze different types of tools for Model Based Management of
Software Projects.
Conventional Software Management: The waterfall model, conventional
software Management performance.
Evolution of Software Economics: Software Economics, pragmatic
software cost estimation.
Improving Software Economics: Reducing Software product size,
improving software processes, improving team effectiveness, improving
automation, Achieving required quality, peer inspections.
The old way and the new: The principles of conventional software
engineering, principles of modern software management, transitioning to
an iterative process.
Life cycle phases: Engineering and production stages, inception,
Elaboration, construction, transition phases.
Artifacts of the process: The artifact sets, Management artifacts,
Engineering artifacts, programmatic artifacts.
Model based software architectures: A Management perspective and
technical perspective.
Work Flows of the process: Software process workflows, Iteration
workflows.
Checkpoints of the Process: Major Milestones, Minor Milestones,
Periodic status assessments.
Iterative Process Planning: Work breakdown structures, planning
guidelines, cost and schedule estimating, Iteration planning process,
Pragmatic planning.
Project Organizations and Responsibilities: Line-of-Business Organi-
zations, Project Organizations, evolution of Organizations.
Process Automation: Automation Building Blocks, The Project
Environment.
Project Control and Process instrumentation: The seven core Metrics,
Management indicators, quality indicators, life cycle expectations
pragmatic Software Metrics, Metrics automation.
Tailoring the Process: Process discriminants, Example.
Future Software Project Management: Modern Project Profiles, Next
generation software economics, Modern Process transitions.
Case Study: The Command Center Processing and Display System-
Replacement (CCPDS-R)
Text Books:
1. Walker Royce, Software Project Management, Pearson Education,
1998.
2. Bob Hughes and Mike Cotterell, Software Project Management, 4th
Edition, Tata McGraw Hill, 2006.
Reference Books:
1. Andrew Stellman and Jennifer Greene, Applied Software Project
Management, O’Reilly, 2006.
2. Jennifer Greene and Andrew Stellman, Head First PMP, O’Reilly, 2007.
3. Richard H. Thayer and Edward Yourdon, Software Engineering Project
Management, 2nd Edition, Wiley India, 2004.
4. Jim Highsmith, Agile Project Management, Pearson Education, 2004.
5. Scott Berkun, The art of Project management, O’Reilly, 2005.
6. Pankaj Jalote, Software Project Management in Practice, Pearson
Education, 2002.
Online Resources:
1. https://www.projectmanager.com/resources
2. https://www.pcmag.com/roundup/260751/the-best-project-
management-software.
3. http://www.onlinecourses.nptel.in
4. http://www.coursera.org/
2018-2019 185
Course Outcomes:
1. Differentiate Conventional Software Management with respect to
Modern Practices.
2. Determine the various lifecycles of a Software Project.
3. Understand the specific roles with in a Software Organization as related
to Project and Process Management.
4. Analyze the basic infrastructure competences like Process Modeling
and Measurement.
5. Remember the basic steps of Project Planning and Project
Management.
6. Assess the Quality Assurance, Process Management and their
relationships along with the Case Study.
IV Year B. Tech. CSE II-Semester L T P C
Course Code: PE118FQ 3 - - 3
INFORMATION RETRIEVAL SYSTEMS
Prerequisites: Data Structures, Database Management Systems.
Course Objectives:
1. To learn the different strategies for information storage and retrieval.
2. To learn about the various retrieval utilities.
3. To understand indexing and querying in information retrieval systems.
4. To expose the students to the notions of structured and semi structured
data.
5. To learn about retrieval model.
Introduction, Retrieval strategies: Vector space model.
Probabilistic retrieval strategies: Simple term weights, Non binary
independence model, Language Models.
Retrieval Utilities: Relevance feedback, Clustering, Regression analysis,
Thesauri.
Retrieval Utilities: N-grams, Semantic networks, Parsing.
Cross-Language Information Retrieval: Introduction, Crossing the
language barrier.
Efficiency: Inverted Index, Query Processing, Signature Files, Duplicate
Document Detection
Integrating Structured Data and Text: A Historical Progression,
Information Retrieval as relational application, Semi-structured search
using a relational schema
Distributed Information Retrieval: A Theoretical model of distributed
retrieval, Web search
Text Books:
1. David A. Grossman and Ophir Frieder, Information Retrieval-
Algorithms and Heuristics, 2nd Edition, Springer.
2018-2019 187
Reference Books:
1. Gerald J Kowalski and Mark T Maybury, Information Retrieval Systems,
Springer, 2000.
2. Soumen Chakrabarti, Mining the Web: Discovering Knowledge from
Hypertext Data, Morgan-Kaufmann Publishers, 2002.
3. Christopher D. Manning, Prabhakar Raghavan and Hinrich Schutze, An
Introduction to Information Retrieval, Cambridge University Press,
Cambridge, England, 2009.
Online Resources:
1. http://www.crectirupati.com/sites/default/files/lecture_notes/IRS.pdf
2. http://www.unistmo.edu.mx/~daniel.garcia/MaterialDescargable
Privado/Librorecuperacioninformacion.pdf
3. http://www.swayam.gov.in
4. http://coursera.org
Course Outcomes:
1. Have knowledge to store and retrieve textual documents using
appropriate strategies.
2. Understand various retrieval utilities for improving search.
3. Understand the translation schemes of cross-language information
retrieval.
4. Apply indexing and compression of documents to improve space and
time efficiency.
5. Apply SQL queries for unstructured data.
6. Analyse and choose appropriate retrieval model.
Course Code: PE118FG 3 - - 3
DATA SCIENCE USING R
Prerequisites:-Nil-
Course Objectives:
1. To understand the fundamental concepts of data science
2. To explore basics of R Programming environment : R language, R-
studio and R packages
3. To learn various statistical concepts like linear and logistic regression,
cluster analysis, timeseries forecasting
4. To learn Decision tree induction, association rule mining and text
mining
Introduction To R: Introduction, Downloading and Installing R, IDE and
Text Editors, Handling, Packages in R.
Getting Started With R: Introduction, Working with Directory, Data
Types In R, Few Commands for Data Exploration.
Loading and Handling Data In R: Introduction, Challenges of Analytical
Data Processing, Expression, Variables, Functions, Missing Values
Treatment In R, Using As ‘ Operator To Change The Structure Of The Data,
Vectors, Matrices, Factors, List, Few Common Analytical Tasks,
Aggregation and Group Processing of a Variable, Simple Analysis Using
R, Methods for Reading Data, Comparison of R GUI‘s for Data Input,
Using R with Databases and Business Intelligence Systems.
Exploring Data In R: Introduction, Data Frames, R Functions for
Understanding Data in Data Frames, Load Data Frames, Exploring Data,
Data Summary, Finding the Missing Values, Invalid Values and Outliers,
Descriptive Statistics, Spotting Problems In Data with Visualization.
Linear Regression Using R: Introduction, Model Fitting, Linear
Regression, Assumptions of Linear Regression, Validating Linear
Assumption.
Logistic Regression: Introduction, What Is Regression?, Introduction
To Generalized Linear Model, Logistic Regression, Binary Logistic
Regression, Diagnosing Logistic Regression, Multinomial Logistic
Regression Model.
2018-2019 189
Decision Tree: Introduction, What Is A Decision Tree?, Decision Tree
Representation In R, Appropriate Problems For Decision Tree Learning,
Basic Decision Tree Learning Algorithm, Measuring Features, Hypothesis
Space Search In Decision Tree Learning, Inductive Bias In Decision Tree
Learning, Why Prefer Short Hypotheses, Issues In Decision Tree Learning.
Time Series in R: Introduction, What Is Time Series Data, Reading Time
Series Data, Decomposing Time Series Data, Forecasts Using Exponential
Smoothing, ARIMA Models.
Clustering: Introduction, What Is Clustering, Basic Concepts in
Clustering, Hierarchical Clustering, K-Means Algorithm, CURE
Algorithm, Clustering in Non-Euclidean Space, Clustering for Streams
and Parallelism.
Association Rules: Introduction, Frequent Itemset, Data Structure
Overview, Mining Algorithm Interfaces, Auxiliary Functions, Sampling from
Transaction, Generating Synthetic Transaction Data, Additional Measures
of Interestingness, Distance Based Clustering Transaction and Association.
Text Mining: Introduction, Definition of Text Mining, A Few Challenges
in Text Mining, Text Mining Verses Data Mining, Text Mining In R, General
Architectures of Text Mining Systems, Preprocessing of Documents In
R, Core Text Mining Operations, Using Background Knowledge for Text
Mining, Text Mining Query Languages.
Mining Frequent Patterns, Associations and Correlations: Basic Concepts
and Methods. Frequent Itemset, Closed Itemset and Association Rules.
Frequent Itemset: Mining Methods, Pattern Evaluation Methods, Sentiment
Analysis
Text Books:
1. Seema Acharya, Data Analytics using R, 1st Edition, McGraw Hill
education.
2. Nina Zumel and John Mount, Practical Data Science with R, 2nd Edition,
Manning publications.
Reference Books:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to
Data Mining, Pearson Education Inc.
2. Han, Jiawei, Jian Pei, and Micheline Kamber, Data mining: concepts
and techniques, 3rd Edition, Elsevier, 2011.
3. Jure Leskovec, Anand Rajaraman and Jeffrey D. Ullman, Mining of
Massive Datasets, Cambridge University Press
4. K G Srinivas and G M Siddesh, Statistical programming in R, Oxford
Publications.
Course Outcomes:
1. Use various data structures and packages in R for data visualization
and summarization.
2. Apply linear, non-linear regression models, and classification
techniques for data analysis
3. Build hypothesis using Decision Trees.
4. Apply knowledge to handle Time series data
5. Use clustering methods including K-means and CURE algorithm
6. Use the knowledge of general architecture of text mining systems.
2018-2019 191
IV Year B.Tech. CSE II -Semester L T P C
Course Code: PE118FP 3 - - 3
HUMAN COMPUTER INTERACTION
Prerequisites: Web Technologies.
Course Objectives:
1. To learn the principles and fundamentals of Human computer
interaction.
2. To understand contemporary theories developed for accounting HCI
issues which include user behavior, cognitive, affective, interpersonal
and social aspects in interaction design.
3. To acquire the skill to isolate the features of an existing interface design
with flaws and improve them.
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 process – Understanding How people interact with computers,
Important Human characteristics in design, Human considerations in
design, Human interaction speeds and understanding Business functions.
Screen Designing : Interface design goals – Screen meaning and purpose,
organizing screen elements, ordering of screen data and content – screen
navigation and flow – Visually pleasing composition – amount of
information – focus and emphasis – statistical graphics ,Types of statistical
graphics.
Technological consideration in interface design: Graphical systems,
Web systems, Examples of Screens.
Windows-Menus and Navigation schemes, select the proper kinds of
windows, select the proper device based controls and Choose the proper
Screen Based controls.
Components- text and messages, Icons and Multimedia, colors - uses,
problems, choosing colors.
Software tools – Specification methods, interface – Building Tools.
Interaction Devices – Keyboard and function keys – pointing devices –
speech recognition digitization and generation – image and video displays
– drivers.
Text Books:
1. Wilbert O Galitz, The essential guide to user interface design, Wiley
DreamaTech.
2. Ben Shneidermann, Designing the user interface, 3rd Edition, Pearson
Education Asia.
Reference Books:
1. Alan Dix, Janet Fincay, Gre Goryd, Abowd and Russell Bealg, Human -
Computer Interaction. Pearson Education.
2. Prece, Rogers and Sharps, Interaction Design, Wiley Dreamtech.
3. Soren Lauesen, User Interface Design, Pearson Education.
Online Resources:
1. https://xsrv.mm.cs.sunysb.edu/hci/323studyguide.html#Ch1
2. https://onlinecourses.nptel.ac.in/noc18_cs23/preview [by Prof.
PonnurangamKumaraguru ]
3. http://nptel.ac.in/courses/106103115/ [by Dr. Samit Bhattacharya,
Email: [email protected]. of Computer Science &Engg.]
4. https://medium.com/ux-for-india/list-of-courses-for-ux-hci-or-id-
aspirants-7f65770b33de
Course Outcomes:
1. Recognize the importance of good screen design and gain knowledge
of various graphical user interface concepts.
2. Demonstrate understanding of human sensory and cognitive system
and the limitations of human performance in HCI.
3. Adapt and extend the classic screen design standards and guidelines.
4. Use various interface paradigms in the implementation of user interface
design.
5. Choose appropriate screen components and employ specification
methods for building interactive prototypes.
6. Determine the human computer interaction methods to meet the needs
of practical software development process.
2018-2019 193
Course Code: PE118FM 3 - - 3
GRAPH THEORY
Prerequisites: Discrete Mathematics, Data Structures, Computer
Networks.
Course Objectives:
1. To understand and apply the fundamental concepts in graph theory.
2. To apply graph theory based tools in solving practical problems.
3. Define how graphs serve as models for many standard problems.
4. Students will be able to apply theoretical knowledge to solve realistic
problems in networks.
Fundamental Concepts: Graphs, Paths, Cycles, and Trails, Vertex
Degrees and Counting, Directed Graphs.
Trees and Distance: Basic Properties, Spanning Trees and Enumeration,
Optimization and Trees.
Matchings and Factors: Matchings and Covers, Algorithms and
Applications, Matchings in General Graphs.
Connectivity and Paths: Cuts and Connectivity, k-Connected Graphs,
Network Flow Problems.
Coloring of Graphs: Vertex Colorings and Upper Bounds, Structure of
K-Chromatic Graphs.
Coloring of Graphs: Enumerative Aspects.
Planar Graphs: Embeddings and Euler’s Formula, Characterization of
Planar Graphs, Parameters of Planarity.
Edges and Cycles: Line Graphs and Edge-Coloring, Hamiltonian Cycles,
Planarity, Coloring, and Cycles.
Text Books:
1. Douglas B. West, Introduction to Graph Theory, 2nd Edition, Prentice
– Hall of India Private Limited.
2. Narsingh Deo, Graph Theory with Applications to Engineering and
computer Science, PHI, Private Limited.
Reference Books:
1. L.R.Foulds, Graph Theory Applications, Springer Science and Business
Media, 2012.
2. Frank Harary, Graph Theory, CRC Press, 2018.
3. J. A. Bondy and U.S.R.Murty, Graph Theory with Applications, Springer,
2008.
Online Resources:
1. https://neo4j.com/blog/top-13-resources-graph-theory-algorithms/
2. https://www.udemy.com/graph-theory/
3. https://www.coursera.org/learn/graphs
4. https://onlinecourses.nptel.ac.in/noc17_ma19/course
5. https://www.class-central.com/tag/graph%20theory
6. https://swayam.gov.in/courses/4403-advanced-graph-theory
Course Outcomes:
1. Understand the approach to represent the real world problems in a
graphical way.
2. Write precise and accurate mathematical definitions using graph theory.
3. Apply principles and concepts of graph theory in solving practical
problems.
4. Use knowledge of trees in constructing efficient algorithms.
5. Validate applications using mathematical proof.
6. Model real world problems using graph theory.
2018-2019 195
Course Code: PE118EX 3 - - 3
AD HOC AND SENSOR NETWORKS
Prerequisites: Computer Networks
Course Objectives:
1. Understand the design issues in ad hoc and sensor networks.
2. Be familiar with different types of ad hoc routing protocols.
3. Exposed to the TCP issues in ad hoc networks.
4. Learn the architecture and protocols of wireless sensor networks.
Introduction to Ad Hoc Wireless Networks: Characteristics of MANETS,
Applications of MANETS, Challenges.
Routing In MANETS: Topology based versus position based approaches,
Topology based routing protocols, and position based routing, other routing
protocols
Data Transmission In MANETS: The broadcast storm, Multicasting,
Geocasting.
TCP Over Ad Hoc Networks: TCP protocol overview, TCP and MANETS,
Solutions for TCP over Ad Hoc.
Basics Of Wireless Sensors And Applications: The Mica Mote, Sensing
and Communication Range, Design Issues, Energy Consumption,
Clustering of Sensors, Applications.
Data Retrieval In Sensor Networks: Classification of WSNs, MAC
Layer, Routing Layer, High-Level Application Layer Support.
Security: Security in Ad Hoc Wireless Networks, Key Management, Secure
Routing, Cooperation in MANETs, Intrusion Detection Systems
Sensor Network Platforms and Tools: Sensor network Hardware.
Sensor Network Programming Challenges and Node-Level Software
Platforms.
Operating System-Tiny OS: Imperative Language: nesC, Data flow style
language: TinyGALS, Node- Level Simulators, NS-2 and its sensors
network extension, TOSSIM.
Text Books:
1. Carlos de Morais Cordeiro and Dharma Prakash Agrawal, Ad Hoc and
Sensor Networks: Theory and Applications, World Scientific
Publications / Cambridge University Press, 2006.
2. Feng Zhao, Leonidas Guibas, Wireless Sensor Networks: Information
Processing Approach, Elsevier Science Imprint, Morgan Kauffman
Publishers, 2005.
Reference Books:
1. C. Siva Ram Murthy and B.S.Manoj, Ad Hoc Wireless Networks:
Architectures and Protocols, Pearson Education, 2004.
2. Sudip Misra, Isaac Woungang, and Subhas Chandra Misra, Guide to
Wireless Ad Hoc Networks, Springer International Edition, 2011.
3. Sudip Misra, Isaac Woungang, and Subhas Chandra Misra, Guide to
Wireless Sensor Networks, Springer International Edition, 2012.
Online Resources:
1. https://struts.apache.org
2. https://dotnet.microsoft.com
3. https://www.edureka.co/microsoft-dotnet-framework-self-paced
Course Outcomes:
1. Use knowledge relating to HTML5 and JavaScript Technologies.
2. Analyze and apply suitable technology in client side applications.
3. Understand the concepts of various Web Services.
4. Build suitable applications using struts framework.
5. Design .net framework application.
6. Understand the concepts of Semantic Technology.
2018-2019 197
III Year B.Tech. I-Semester L T P C

Course Code: OE115KA 3 - - 3
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING/
DEPARTMENT OF INFORMATION TECHNOLOGY
FUNDAMENTALS OF DATA STRUCTURES
(Open Elective-1)
Prerequisites:-Nil-
Course Objectives:
1. Understand the basic concepts such as Linear and Non Linear Data
structures.
2. Understand the notations used to analyze the performance of
algorithms.
3. Understand the behavior of data structures such as stacks, queues, trees,
search trees, graphs and their representations.
4. Choose the appropriate data structure for a specified application.
5. Understand and analyze various searching and sorting algorithms.
Basic concepts- Algorithm Specification, Performance Analysis- Time
Complexity and Space Complexity, Asymptotic Notation-Big O, Omega
and Theta notations, Introduction to Linear and Non Linear data structures.
Stacks, Queues, Circular queues, Dequeue working and representation
using arrays, Applications of stacks: infix to post fix conversion, postfix
expression evaluation.
Linked list: Singly Linked List, Doubly Linked List, Circular linked list
working and representation. Implementation of stacks and queues using
linked list.
Trees: Terminology, Sequential and Linked representation, Tree traversals,
Binary trees, Binary search trees, operations - insertion and Searching,
m-way search trees (Definition only), B-trees-(Definition only).
Searching: Linear and binary Search methods.
Sorting: Bubble sort, Selection sort, Insertion sort, Quick sort, Merge
sort, Heap sort, Time complexities.

Graphs: Terminology, sequential and linked representation.
Graph traversals: Depth First Search & Breadth First Search, Spanning
trees, Prims and Kruskals method.
Text Books:
1. Horowitz, Sahni, and Anderson-Freed, Fundamentals of Data Structures
in C, 2nd Edition, Universities Press.
2. Mark Allen Weiss, Data Structures and Algorithms in C, 2nd Edition,
Addison-Wesley.
Reference Books:
1. R.F. Gilberg and B.A. Forouzan, Data structures: A Pseudocode
Approach with C, 2nd Edition, Cengage Learning.
2. E. Balaguru Swami, C Programming & Data structures, TMH, 2013.
3. A.M. Tanenbaum, Y. Langsam and M.J. Augensrein, Data Structures
using C, Pearson Education Asia, 2004.
4. S. Lipscutz and Schaum’s Outline Data Structures, TMH, July 2017.
5. R. Thareja, Data Structures using C, Oxford University Press, October
2015.
Online Resources:
1. www.cise.ufl.edu/~sahni/dsaac.
2. www.geeksforgeeks.org/data-structures
3. https://www.tutorialspoint.com
4. https://onlinecourses.nptel.ac.in/
Course Outcomes:
1. Analyse the time and space complexities of algorithms.
2. Differentiate between linear and non-linear data structures.
3. Use basic data structures such as linked list, stack and queue for data
representation.
4. Understand advanced data structures like binary trees, search trees and
graphs.
5. Choose appropriate data structures to represent data items in real world
problems.
6. Analyse various kinds of searching and sorting techniques.
2018-2019 199

Course Code: OE115KB 3 - - 3
DEPARTMENT OFCOMPUTER SCIENCEAND ENGINEERING/
DEPARTMENT OFINFORMATION TECHNOLOGY
JAVA PROGRAMMING
(Open Elective-1)
Prerequisites: -Nil-
Course Objectives:
1. Learn the concepts of object oriented programming.
2. Introduce the implementation of inheritance, packages and interfaces.
3. Understand the concepts of exception handling and multithreading.
4. Introduce the java collection framework and I/O classes.
5. Gain knowledge in designing Graphical User Interface using applets
and swing controls.
OOP concepts: Data Abstraction, Encapsulation, Inheritance, Polymor-
phism, Classes and Objects, Procedural and Object oriented programming
paradigms.
Java Basics: History of Java, Java buzzwords, Data types, Variables, Arrays,
operators, expressions, control statements, Introducing classes, Methods,
Constructors, Inner classes, Anonymous Inner classes, String handling.
Inheritance: Inheritance concepts, Member access, Creating Multilevel
hierarchy, using super, using final with inheritance, forms of inheritance,
benefits of inheritance, costs of inheritance, Polymorphism, method
overriding, abstract classes, Object class.
Packages: Defining a Package, CLASSPATH, Access Protection, Importing
packages.
Interfaces: Defining an Interface, implementing Interfaces, Nested
interfaces, Variables in interfaces and Extending Interfaces.
Exception handling: Fundamentals of Exception Handling, Exception
Types, Using try and Catch, multiple Catch Clauses, Nested Try statements,
Throw, Throws and finally, built-in exceptions, creating own exception
sub classes.
Multithreading: Differences between thread-based multitasking and

process-based multitasking, Java thread model, creating threads, thread
priorities, synchronizing threads, inter thread communication.
Stream based I/O (java.io): The Stream classes - Byte streams and
Character streams, Reading console Input and Writing Console Output, File
class, Reading and writing files, Random access file operations, Generics,
Enumerations.
The Collections Framework (java.util): Collections overview,
Collection Interfaces, The Collection classes- Array List, Linked List,
Iterator, Stack, Vector, String Tokenizer, Scanner.
Event Handling: The Delegation Event Model - Events, Event sources,
Event Listeners, Event classes, Handling mouse and keyboard events,
Adapter classes.
GUI Programming with Swing: Introduction, limitations of AWT, MVC
architecture, Swing components, Swing containers, Swing Controls -
JLabel, JTextField, JButton, JToggleButton, JCheckBox, JRadioButton,
JTabbedPane, JScrollPane, JList, JComboBox, Swing Menus, Dialogs.
Layout Managers- FlowLayout, BorderLayout, GridLayout, CardLayout,
GridBagLayout.
Applets: The Applet class, Difference between Applets and Applications,
Life Cycle of an Applet, passing parameters to applets.
Text Books:
1. Herbert Schildt, Java- The Complete Reference, 9th Edition, McGraw
2. Herbert Schildt and Dale Skrien, Java Fundamentals - A comprehensive
Introduction, McGraw Hill Education (India) Pvt. Ltd., 2013.
Reference Books:
1. Jaime Nino and Frederick. A. Hosch, An Introduction to Programming
and Object Oriented Design using Java, John Wiley & sons, 2013.
2. Timothy Budd, Understanding Object-Oriented Programming with Java,
updated Edition, Pearson Education.
3. Y. Daniel Liang, Introduction to Java Programming, Comprehensive
Version, 7th Edition, Pearson Education.
4. P. Radha Krishna, Object Oriented Programming through Java,
Universities Press 2008.
2018-2019 201
Online Resources:
1. https://docs.oracle.com/javase/tutorial/java/TOC.html
3. https://onlinecourses.nptel.ac.in/
Course Outcomes:
1. Understand the object oriented programming concepts and solve real
world problems.
2. Demonstrate the use of inheritance and packages.
6. Design Graphical User Interface using applets and swing controls.

Course Code: OE115KC 3 - - 3
DEPARTMENT OF ELECTRONICSAND COMMUNICATION ENGINEERING/
DEPARTMENT OF ELECTRONICS AND TELEMATICS ENGINEERING
BASIC ELECTRONICS
(Open Elective-1)
Prerequisite:-Nil-
Course Objectives:
1. To review the basic concepts of semiconductor physics.
2. To understand the concept of electronic devices, circuits and their
applications.
3. To explore the construction, operation and characteristics of various
electronic devices like diodes, transistors (BJTs and FETs).
4. To distinguish between various special purpose diodes.
P-N Junction Diode: Volt-Ampere characteristics, Ideal versus practical,
Static and dynamic resistances, Equivalent circuits, Load line analysis,
Applications of pn Diode. Break down Mechanisms-Avalanche breakdown,
Zener breakdown and its applications.
Rectifiers: P-N junction as a rectifier - Half Wave Rectifier, Full Wave
Rectifier: performance parameters.
Bipolar Junction Transistor (BJT):Construction, Principle of
Operation, Symbol, Amplifying Action, Common Emitter, Common Base
and Common Collector configurations.
Transistor Biasing And Stabilization: Operating point, DC & AC load
lines, Biasing Voltage divider bias.
Field Effect Transistors: JFET Construction and Principle of operation,
Symbol, Pinch-Off Voltage, Volt-Ampere Characteristic, MOSFET
characteristics (Enhancement and depletion mode), Symbols of MOSFET,
Comparison of BJT and FET, Introduction to CMOS circuits.
Small Signal Low Frequency Model of BJT: BJT modeling, Hybrid
model, Determination of h-parameters from transistor characteristics,
Analysis of CE, CB and CC configurations using h-parameters, low
2018-2019 203
frequency response of BJT Amplifiers, effect of coupling and bypass

capacitors, Comparison of CE, CB and CC configurations.
Special purpose Diodes: Opto-Electronic Devices – LEDs, Photo Diode
and Applications, Silicon Controlled Rectifier (SCR) – Operation,
Construction, Characteristics, Ratings, Applications.
Text Books:
1. J.Millman, C.C.Halkias, and Satyabratha Jit, Electronic Devices and
Circuits, 2nd Edition, Tata McGraw Hill, 2007.
2. R.L. Boylestad and Louis Nashelsky, Electronic Devices and Circuits,
9th Edition, Pearson/Prentice Hall, 2006
3. T.F. Bogart Jr., J.S.Beasley and G.Rico, Electronic Devices and Circuits,
6th Edition, Pearson Education, 2004.
Reference Books:
1. S.G.Burns and P.R.Bond, Principles of Electronic Circuits, 2nd Edition,
Galgotia Publications, 1998.
2. Millman and Grabel, Microelectronics, Tata McGraw Hill, 1988.
3. G. Streetman and S. K. Banerjee, Solid State Electronic Devices, 7th
Edition Pearson, 2014.
4. C.T. Sah, Fundamentals of Solid State Electronics, World Scientific
Publishing Co. Inc, 1991.
Online Resources:
1. http://www.radio-electronics.com
2. https://users.encs.concordia.ca/~rabinr
3. https://circuitdigest.com/electronic-circuits
4. -NPTEL
5. -edX
Course Outcomes:
At the end of this course students will demonstrate the ability to
1. Illustrate the fundamental behaviour of various diodes, transistors.
2. Explain the construction, operation and characteristics of BJT, JFET
and MOSFET.
3. Analyse the various amplifier circuits using small signal hybrid model.
4. Identify the necessity for biasing.
5. To know the operation of various special purpose devices like LED,
Photo diode and SCR.
6. Apply the knowledge of Diodes in designing circuits like rectifiers.
Course Code: OE115KD 3 - - 3
DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING
ELECTRICAL MATERIALS
(Open Elective-1)
Prerequisite:-Nil-
Course Objectives:
1. To impart knowledge on the concepts of Dielectric electric materials
in comparison with magnetic materials.
2. To introduce special purpose materials.
3. To make students familiar with the concepts of different materials for
electrical applications.
4. To familiarize students with the internal concepts of electrical materials.
Dielectric and Semiconductor Materials: Dielectric as Electric Field
Medium, leakage currents, dielectric loss, dielectric strength, breakdown
voltage, breakdown in solid dielectrics, flashover, liquid dielectrics, electric
conductivity in solid, liquid and gaseous dielectrics, Ferromagnetic
materials, in static fields, spontaneous, polarization, curie point, anti-
ferromagnetic materials.
Semiconductors: Intrinsic, Extrinsic types, Current carriers in
semiconductor, Thermistors, Photoconductors, P-N junction Diode,
Evolution of transistor.
Magnetic Materials: Classification of magnetic materials, properties of
ferromagnetic materials, curie point, spontaneous magnetization in
ferromagnetic materials, magnetic Anisotropy, Magnetostriction,
diamagnetism, magnetically soft and hard materials.
Special Purpose Materials - feebly magnetic materials, Ferrites, cast and
cermet permanent magnets, Ageing of magnets. Factors effecting
permeability and hysteresis.
Special Purpose Materials: Refractory Materials, Structural Materials,
Radioactive Materials, Galvanization and Impregnation of materials,
Processing of electronic materials, Insulating varnishes and coolants,
Properties and applications of mineral oils, Testing of Transformer oil as
per ISI.
2018-2019 205
Materials for Electrical Applications: Materials used for Resistors,
rheostats, heaters, transmission line structures, stranded conductors,
bimetals fuses, soft and hard solders, electric contact materials, electric
carbon materials, thermocouple materials. Solid, Liquid and Gaseous
insulating materials, Effect of moisture on insulation. Piezoelectric
materials, Pyroelectric materials.
Materials for Specific Applications :Materials for solar cells, fuel cells
and battery. Materials for coatings for enhanced solar thermal energy
collection and solar selective coatings, Cold mirror coatings, heat mirror
coatings, antireflection coatings.
Sintered alloys for breaker and switch contacts.
Text Books:
1. R K Rajput, A course in Electrical Engineering Materials, Laxmi
Publications, 2009.
2. C S Indulkar and S Thiruvengadam, An introduction to Electrical
Engineering Materials, Revised Edition, S. Chand & Company, 2013.
3. T K Basak, A course in Electrical Engineering Materials, New Age
Science Publications, 2009.
Reference Books:
1. A.J. Dekker, Electrical Engineering Materials, PHI Publication, 2006.
2. TTTI Madras, Electrical Engineering Materials, McGraw Hill Education,
2004.
Course Outcomes:
At the end of the course the students will be able to
1. Distinguish between magnetic and non-magnetic materials by acquiring
the knowledge of their atomic structures.
2. Analyse Dielectric and semiconductor materials.
3. Analyse the magnetic materials using their properties.
4. Identify special purpose materials for different applications.
5. Analyse the working of different materials from the point of view of
their applications in electrical industry.
6. Analyse the working of special purpose materials from the point of
view of their possible applications electrical & other fields.
III Year B.Tech. I-Semester / II-Semester L T P C
Course Code: OE115KE / OE116KE 3 - - 3
DEPARTMENT OF MECHANICAL ENGINEERING
OPERATIONS RESEARCH
(Open Elective-1)
Prerequisites:-Nil-
Course objectives:
1. Study the linear programming and dynamic programming techniques
used for business and engineering applications.
2. Know about the inventory, Game theory and replacement theory
applications in real world.
Introduction to Operations Research: Basics definition, scope,
objectives, phases, models and limitations of Operations Research. Linear
Programming Problem-Formulation of LPP, Graphical solution of LPP.
Simplex Method, Artificial variables, big-M methods, Special cases in
LP-Degeneracy, unbounded, infeasibility & alternative optima
Transportation Problem: Formulation, solution, unbalanced Transpor-
tation problem. Finding basic feasible solutions-Northwest corner rule,
Least cost method and Vogel’s approximation method. Optimality test by
MODI method & stepping stone method.
Assignment Model: Formulation, Hungarian method for optimal solution.
Solving unbalanced Assignment problem.
Sequencing Models. Solution of sequencing Problem-Processing n jobs
through 2 Machines-Processing n jobs through 3 Machines-Processing n
jobs through m Machines. Processing 2 jobs through m-machines.
Dynamic Programming: Characteristics of Dynamic programming.
Dynamic Programming approach for Coach/Shortest Path and cargo
loading problems.
Inventory Models: Inventory costs. Models with deterministic demand-
Model (a) Demand rate uniform and production rate infinite, Model (b)
Demand rate uniform and production rate finite.
2018-2019 207

Games Theory: Competitive games, rectangular game, saddle point,
minimax (maximin) method of optimal strategies, and value of the game.
Solution of games with saddle points, dominance principle. Rectangular
games without saddle point-mixed strategy for 2*2 games.
Replacement Models: Replacement of items that deteriorate whose
maintenance costs increase with time without change in the money value,
Replacement of items that fail suddenly: Individual Replacement policy,
Group Replacement policy.
Text Books:
1. P.SankaraIyer, Operations Research, Tata Mcgraw-Hill, 2008.
2. A.M. Natarajan, P. Balasubramani and A.Tamilarasi, Operations
Research, Pearson Education, India, 2012.
3. Hamdy A Taha, Operations Research an Introduction, Pearson
Education, 2010.
Reference Books:
1. S.D. Sharma, Operations Research Theory Methods and Applications,
Kedarnath Ramnath Publishers, 2015.
2. P. K. Gupta and D. S. Hira, Operations Research, S. Chand & Co., 2014.
3. J K Sharma, Operations Research Problems and Solutions, 3rd Edition,
Macmillan India Ltd, 2008.
Online Resources:
1. IOR Tutorials(Interactive Operations Research Tutorial)
2. http://www.nptel.ac.in
Course Outcomes:
1. Apply linear programming models to several Engineering Applications.
2. Use several other techniques like Transportation, Assignment and
Sequencing Models in the real world applications.
3. Study selected Dynamic Programming models for real world situations.
4. Apply simple mathematical models in Inventory into the real
Engineering Applications.
5. Solve Game theory problems related to business applications.
6. Develop optimum replacement policy.

Course Code: OE115KF 3 - - 3
DEPARTMENT OF HUMANITIES & MATHEMATICS
INTRODUCTION TO DATA ANALYTICS
(Open Elective -1)
Prerequisites:-Nil-
Course Objectives:
1. To learn the importance of Probability and Statistics
2. To know about the Regression
3. To gain a basic knowledge on Supervised and Unsupervised Learning
4. To study the concepts of Time Series Analysis
Descriptive Statistics: Role of data analytics in science and engineering,
different types of data and data Summarization methods; Measures of central
tendency & measure of dispersion; Probability - Conditional probability,
Baye’s theorem. Random variables - Discrete, continuous probability
distributions, expectations and variance.
Regression: Linear regression - Estimating co-efficient, assessing the
accuracy of co-efficient estimates, assessing accuracy of the model.
Multiple linear regression- Estimating co-efficient, relation between
response and predictors, marketing plan comparison of linear regression
with K-nearest neighbor.
Supervised Learning: Classification - Overview, logistic regression,
multiple logistic regressions, linear discriminant analysis, Baye’s theorem
for classification, quadratic discriminant analysis, comparison of
classification methods.
Unsupervised Learning: Associative rules - Generating candidate’s rules,
the Apriori algorithm, support and confidence, lift ratio, the process of
rule selection and interpreting results. Clustering- measuring distances
between two records, measuring distances between two clusters,
hierarchical (Agglomerative) clustering, non- hierarchical clustering, K-
means algorithm.
2018-2019 209

Time Series Analysis: Introduction, significance of time series analysis,
components of time series, secular trend, freehand of graphic method, semi-
average method, method of moving averages, method of least squares,
straight linear and non-linear trends, logarithmic methods, exponential
trends, growth curves, seasonal variation, method of simple averages, ratio-
to-trends, ratio-to-moving average method.
Text Books:
1. S.P.Gupta, Statistical Methods, 33rd Edition, Sultan - Chand & Sons.
2. Galit Shmueli, Peter C. Bruce, Inbal Yahav, Nitin R. Patel and Kenneth
C. Lichtendahl Jr., Data Mining For Business Analytics Concepts,
Techniques, and Applications in R, Wiley Publications.
3. Hastie and Trivor, et al., The Elements of Statistical Learning. Vol.2,
No.1.Newyork, Springer, 2009.
Reference Books:
1. Montgomery, Douglus C., and George C.Runger. Applied Statistics and
Probability for Engineers John Wiley & Sons. 2010.
2. Tang-Ning-Tan, Micheal-Steinbach, Vipin Kumar, Anuj Karpatne,
Introduction to Data Mining, Pearson India Education Services Ltd,
2016.
3. Roxy Peck, San Luis Obispo and Iowa Jay L. Devore, Introduction to
Statistics and Data Analysis, 5th Edition, Cengage Learning.
Online Resources:
1. onlinelibrary.wiley.com
2. nptel.ac.in/courses/Introduction to Data Analytics
Course outcomes:
After completing the course the student will be able to
1. Understand the definitions and concepts associated with central
tendency and measures of dispersion.
2. Find the probability of an event and know the properties of distribution.
3. Determine the regression co-efficient and test the accuracy of
co-efficient.
4. Learn basic concepts in supervised learning.
5. Attain basic knowledge in unsupervised learning.
6. Understand past behavior of data and forecast the future behavior using
time series analysis.
III Year B.Tech. I-Semester/II-Semester L T P C
Course Code: OE115KG / OE116KQ 3 - - 3
INTELLECTUAL PROPERTY RIGHTS
(Open Elective -1)
Prerequisites:-Nil-
Course Objectives:
1. To educate the importance of IPR in Engineering
2. To enlighten the various types of IP’s and their protection.
3. To maintain IPR’s for Business sustainability.
Introduction to Intellectual property
Intellectual property: Introduction-Features-Types of Intellectual
property - International organizations - Agencies and treaties, Conventions
-Importance of Intellectual property rights.
Patents: Concept of Patent -Duration -Patent Process -Patent searching
process-Procedure for filling Application of Patents - Ownership, Transfer,
Assignment and Licensing of Patent-Remedies for Infringement of Patents.
Copyrights and Trademarks
Copyrights-Fundamental of Copy right law - Originality of material- Rights
of Reproduction - Rights to perform the work publicly - Copyright
Ownership issues - Copyright registration - Notice of Copyright - Remedies
for infringement in Copyrights.
Trademarks-Purpose and functions of Trademarks-Acquisition of
Trademark rights - Protectable matter - Selecting and evaluating Trademark
- Trademarks registration process -Remedies for infringement in Trade
marks.
Industrial Designs: Assignment of Design – Essential requirement of
Registration-Registration Process of Industrial Designs – Benefits of
registration-Assignment, Transmission and Licensing of Industrial Designs
- Remedies for infringement of Designs.
2018-2019 211

Trade Secrets: Trade secret law -determinants of Trade secret status -
Liability for misappropriations of Trade Secrets -Protection for submission
- Trade secret litigation-Unfair competition – Interface between Intellectual
Property Rights and Competition – Safeguards against Unfair competitions.
Intellectual property audits: Types of IP Audit – Procedure of Preparing
Audit – Auditing IP Assets.
Text Books:
1. Deborah. E. Bouchoux, Intellectual property right, 1st Edition, Cengage
learning, 2015.
2. Prabuddha Ganguli, Intellectual property right-Unleashing the
knowledge economy, 1st Edition , Tate McGraw Hill Publishing company
Ltd., 2015.
Reference Books:
1. Kompal Bansal and Parikshit Bansal, Fundamentals of Intellectual
property for Engineers, 1st Edition, BS Publications, 2015.
Online Resources:
1. https://www.icsi.edu/media/webmodules/publications/9.4%20
Intellectual%20Property%20Rights.pdf
2. Introduction on Intellectual Property to Engineers and Technologists
https://nptel.ac.in/courses/109105112/
Course Outcomes:
After completion of the course the student will be able to
1. Understand the dynamics and legalistic framework of IPR’s
2. Acquaint with securing patents and its protection.
3. Seize the dimensions of Copy right protection.
4. Realize the eminence of Trade Marks in growth of business.
5. Essentials of safeguarding Industrial designs.
6. Sustentation of Trade Secrets and aspects of IP audit.
Course Code: OE115KH 3 - - 3
DEPARTMENT OF BASIC SCIENCES
DISASTER MANAGEMENT
(Open Elective -1)
Prerequisites:-Nil-
Course Objectives:
1. To understand the critical concepts in Disaster Management.
2. To gain the knowledge on the factors responsible for cause of various
disasters.
3. To provide the information on different disasters, tools and methods
for disaster management.
4. To provide an overview on the roles of Government and non-government
agencies in disaster management.
Understanding Hazards and Disaster: Introduction – Environmental
Hazard, Environmental Disaster and Environmental Stress. Concept of
Disaster-Concept of Risk. Different approaches in Disaster Manage-
ment. Levels of Disasters. Disaster Phenomena and Events (Global,
National and Regional).
Hazards and Vulnerabilities: Classification of Hazards and Disasters -
Natural and Man-made Hazards (Planetary, Extra Planetary, Endogenous
and Exogenous Hazards). Characteristics and damage potential of
natural hazards. Hazard assessment. Dimensions of vulnerability factors,
vulnerability assessment and disaster risk. Vulnerabilities to flood and
earthquake hazards.
Planetary and Extra Planetary Hazards: Endogenous Hazards and
Exogenous Hazards. Earthquake Hazards and disasters - Causes of
Earthquakes, distribution of earthquakes, Hazardous effects of earthquakes,
Earthquake Hazards in India, Human adjustment, perception and mitigation
of earthquake.
Cyclones - Causes, Effects, distribution, human adjustment, perception
and mitigation of Cyclones.
Cumulative Atmospheric Hazards and Disasters: Floods, Droughts,
Cold waves and Heat waves.
2018-2019 213
Floods - Causes of floods, Effects of Floods, Flood hazards in India, Flood
control measures, Human adjustment, perception and mitigation.
Droughts – Causes of Droughts, Impacts of droughts, Drought hazards in
India, Drought control measures. Extra Planetary Hazards and Disasters -
man induced Hazards and Disasters - Physical hazards and Disasters.
Disaster Management Mechanism: Concepts of risk management and
crisis management. Disaster Management Cycle – Prevention, Mitigation,
Preparedness, Response, Recovery and Rehabilitation. Planning for Relief.
Capacity Building & Coping with Disaster: Capacity Building: Concept,
Structural and Nonstructural measures, Capacity assessment, Strengthening
Capacity for Risk Reduction. Legislative support at State and National
levels. Case Studies.
Coping Strategies: Alternative adjustment processes, changing concepts
of disaster management. Industrial Safety Plan - Safety norms and survival
kits. Role of Mass media in disaster management. Crowd Management.
Planning for Disaster Management: Strategies planning for disaster
management, steps for formulating reduction in disaster risk. Disaster
Management Act and Policy in India – Organizational structure for disaster
management. Preparation of state and district level disaster management
plans. Sendai Framework on Disaster Risk Reduction (DRR). Use of latest
technologies – Remote Sensing (RS) and Geological Information System
(GIS).
Text Books:
1. Manual on Disaster Management, National Disaster Management
Agency, Govt of India.
2. Mrinalini Pandey, Disaster Management, 1st Edition, Wiley, 2014.
3. T. Bhattacharya, Disaster Science and Management, McGraw Hill
Education (India) Private Limited, 2015.
4. Pradeep Sahni, Disaster Mitigation: Experiences and Reflections PHI
Learning Private Limited, 2010.
5. Donald Hyndman and David Hyndman, Natural Hazards and Disasters,
Cengage Learning, 2006.
Reference Books:
1. N. Pandharinath and CK Rajan, Earth and Atmospheric Disasters
Management, BS Publications, 2009.
2. R. B. Singh, Environmental Geography, Heritage Publishers, New Delhi,
1990.
3. Savinder Singh, Environmental Geography Prayag Pustak Bhawann,
1997.
4. B. I. Kates and G. F. White, The Environment as Hazards, Oxford Press,
New York, 1978.
5. R. B. Singh, Disaster Management, Rawat Publication, New Delhi, 2000.
6. H. K. Gupta, Disaster Management Universities Press, India, 2003.
7. R. B. Singh, Space Technology for Disaster Mitigation in India (INCED),
University of Tokyo, 1994.
8. Satender, Disaster Management in Hills Concept Publishing Co., New
Delhi, 2003.
9. R. K. Bhandani, An Overview on Natural and Manmade Disaster and
their Reduction, CSIR, New Delhi.
10.M. C. Gupta, Manuals on Natural Disaster Management in India, National
Centre for Disaster Management, IIPA, New Delhi, 2001.
Online Resources:
1. National Disaster Management Plan, Ministry of Home affairs,
Government of India (http://www.ndma.gov.in/images/policyplan/
dmplan/draftndmp.pdf).
2. National Institute of Disaster Management (NIDM) (https://nidm.gov.in)
3. WHO-Disaster Management Resources-https://www.who.int/surgery/
publications/immesc_disaster_management/en/
4. https://swayam.gov.in/courses/4983-disaster-management
5. https://reliefweb.int/training/2455444/free-online-course-disaster-
risk-reduction-and-management
6. https://www.unisdr.org/we/inform/events/47107
7. https://www.futurelearn.com/courses/disaster-management/2
8. https://www.ifrc.org/en/get-involved/learning-education-training/
certified-professional-development-courses/online-certificate-
programme-in-disaster-management/
Course Outcomes:
1. Understand different kinds of disasters and their vulnerabilities.
2. Identify the causes, effects and mitigation measures of different
disasters.
3. Apply the disaster management mechanism in natural and man induced
calamities.
4. Analyse and solve the unforeseen situations with advanced technologies
like Remote Sensing and Geological Information Systems.
2018-2019 215
III Year B.Tech. II-Semester L T P C

Course Code: OE116KJ 3 - - 3
DEPARTMENT OF COMPUTER SCIENCEAND ENGINEERING/
OPERATING SYSTEMS
(Open Elective-2)
Prerequisites:-Nil-
Course Objectives:
1. To understand the role of OS in the overall computer system and study
the operations performed by OS as a resource manager.
2. To understand the scheduling policies and different memory
management techniques for different operating systems.
3. To understand process concurrency and synchronization.
4. To understand the concepts of I/O, storage and file management and
introduce system call interface for file and process management.
5. To introduce the goals and principles of protection.
Introduction: Overview-Introduction-Operating system objectives, User
view, System view, Operating system definition ,Computer System
Organization, Computer System Architecture, OS Structure, OS
Operations, Process Management, Memory Management, Storage
Management, Protection and Security, Computing Environments.
Operating System services, User and OS Interface, System Calls, Types
of System Calls, System Programs, Operating System Design and
Implementation, OS Structure.
Process: Process concepts-The Process, Process State, Process State
transitions, Process Control Block, Context Switch.
Threads: Definition, Various states, Benefits of threads, Types ofthreads,
Concept of multithreads.
Process Scheduling: Scheduling Queues, Schedulers, Scheduling
Criteria, Scheduling algorithms, Multiprocessor Scheduling. Case Studies:
Linux, Windows.
Process Synchronization: Inter-process Communication: Background,
The Critical Section Problem, Race Conditions, Mutual Exclusion,
Peterson’s solution, Synchronization Hardware, Semaphores, Classic

Problems of Synchronization- Bounded Buffer Problem, The Producer/
Consumer Problem, Reader’s & Writer Problem, Dinning Philosopher
Problem, Event counters, Monitors, Message passing.
Deadlocks: Deadlocks - System Model, Deadlock Characterization:
Necessary and sufficient conditions for Deadlock, Methods for Handling
Deadlocks: Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock.
Memory Management: Basic Hardware, Address Binding, Logical and
physical address space, Dynamic loading, linking and Shared libraries,
Swapping, Contiguous Memory Allocation- Fixed and variable partition–
Internal and External fragmentation and Compaction; Segmentation,
Paging- Hardware support for paging, Protection, shared pages, Structure
of Page Table. Case Studies: Linux, Windows
Virtual Memory Management: Background, Demand Paging-locality
of reference, Page fault; Copy-on-Write, Page replacement, Page
Replacement Algorithms, Allocation of Frames, Thrashing.
File Management: Concept of File - Attributes, operations, file types,
internal structure, access methods, Directory structure, file protection,
file System structure, Allocation methods (contiguous, linked,
indexed),Free-space management (bit vector, linked list, grouping),
directory implementation (linear list, hash table), efficiency and
performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN,
C-SCAN, Disk formatting- Boot-block, Bad blocks.
Protection: System Protection, Goals of Protection, Principles of
Protection.
Text Books:
1. Abraham Silberschatz, Peter B.Galvin and Greg Gagne, Operating
System Concepts, 9th Edition, Wiley Asia Student Edition.
Reference Books:
1. Charles Crowley, Operating System: A Design-oriented Approach,
1st Edition, Irwin Publishing.
2018-2019 217
2. Gary J. Nutt and Addison, Operating Systems: A Modern Perspective,

2nd Edition, Wesley.
3. Maurice Bach, Design of the Unix Operating Systems, 8th Edition,
4. Daniel P. Bovet and Marco Cesati, Understanding the Linux Kernel,
3rd Edition, O’Reilly and Associates.
Online Resources:
1. Abraham-Silberschatz-Operating-System-Concepts—9th 2012.12.pdf
2. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/
Course Outcomes:
1. Acquire a High-level understanding of what is an operating system and
the role it plays and the services it provides.
2. Understand process management concepts including scheduling,
synchronization.
3. Describe System model for deadlock, Methods for handling deadlocks.
4. Understand of memory management including virtual memory.
5. Acquire Knowledge on issues related to file system interface and
implementation.
6. Understand the issues related to disk management.
Course Code: OE116KK 3 - - 3
DATABASE MANAGEMENT SYSTEMS
(Open Elective-2)
Prerequisites:-Nil-
Course Objectives:
1. To understand the basic concepts and the applications of database
systems.
2. To master the basics of SQL and construct queries using SQL.
3. To understand the relational database design principles.
4. To become familiar with the basic issues of transaction processing
and concurrency control.
5. To become familiar with database storage structure and recovery
mechanisms.
UNIT 1: (~10 lecture Hours)
Introduction: Database System Applications, Purpose of Database
Systems, View of Data, Database Languages – DDL, DML, Relational
Databases, Data Storage and Querying, Transaction Management, Database
Architecture, Database Users and Administrators.
Database Design and the E-R Model: The Entity-Relationship Model,
Constraints, Removing Redundant Attributes in Entity Sets, Entity-
Relationship Diagrams, Reduction to Relational schemas, Entity-
Relationship Design Issues, Extended E-R Features.
UNIT 2: (~9 lectures Hours)
Introduction to the Relational Model: Structure of Relational
Databases, Database Schema, Schema Diagrams. The Relational Algebra,
Tuple Relational Calculus, Domain Relational Calculus.
Introduction to SQL: Overview of the SQL Query Language, SQL Data
Definition, Basic Structure of SQL Queries, Additional Basic Operations,
Set Operations, Null Values, Aggregate Functions, Nested Subqueries.
UNIT 3: (~10 lectures Hours)
Advanced SQL: Join Expressions, Views, Integrity Constraints, Triggers.
Normalization: Functional Dependencies, Lossless decomposition, 1NF,
2NF, 3NF, Dependency Preservation, BCNF, Multi–valued dependencies,
4NF, Join Dependencies, 5NF.
2018-2019 219
Transaction Management: Transaction Concept, A Simple Transaction
Model, Storage Structure, Transaction Atomicity and Durability,
Transaction Isolation, Serializability, Transaction Isolation and Atomicity,
Transaction Isolation Levels.
Concurrency Control: Lock-Based Protocols, Multiple Granularity,
Timestamp-Based Protocols, Validation-Based Protocols.
Recovery System: Failure Classification, Storage, Recovery and
Atomicity, Recovery Algorithm, Failure with loss of non-volatile storage,
Remote Backup systems.
Indexing: Ordered Indices, B+ -Tree Index files.
Text Books:
1. A. Silberschatz, Henry. F. Korth and S. Sudarshan, Data base System
Concepts, 6th Edition, McGraw Hill Education (India) Private Limited.
2. C. J. Date, A. Kannan and S. Swami Nadhan, An Introduction to Database
systems, 8th Edition, Pearson Education.
Reference Books:
1. Raghu Ramakrishnan and Johannes Gehrke, Data base Management
2. R Elmasri and Shamkant B. Navathe, Database Systems, 6th Edition,
Pearson Education.
Online Resources:
1. https://www.w3schools.in/
2. https://www.tutorialspoint.com/
3. https://beginnersbook.com/2015/04/dbms-tutorial/
4. https://www.coursera.org/courses?query=database
5. https://onlinecourses.nptel.ac.in/noc18_cs15
6. https://online.stanford.edu/course/databases-self-paced
Course Outcomes:
1. Understand concepts and the applications of database systems and
ability to implement in real time applications.
2. Construct an Entity-Relationship (E-R) model from specifications and
transform to relational model.
3. Demonstrate the basic concepts of relational database management
system and construct unary/binary/set/aggregate queries in Relational
Algebra and in SQL.
4. Apply normalization on database.
5. Understand principles of database transaction management.
6. Understand the storage and recovery of database
Course Code: OE116KL 3 - - 3
DEPARTMENT OF ELECTRONICS AND TELEMATICS ENGINEERING
PRINCIPLES OF ELECTRONIC COMMUNICATIONS
(Open Elective -2)
Prerequisites:-Nil-
Course Objectives:
1. Introduce the students to modulation and various analog
modulation schemes.
2. Distinguish between Pulse, Analog and Digital Communication
systems.
3. Analyse the concepts of satellite, optical communications.
4. Understand and compare cellular and telecommunication system
concepts.
Introduction: Need for Modulation, Frequency translation, Electroma-
gnetic spectrum, Gain, Attenuation and decibels.
Simple description on Modulation: Analog Modulation- Amplitude
Modulation Fundamentals, Amplitude Modulator and Demodulator
Circuits, Fundamentals of Frequency Modulation, Transmission of Binary
data in communication system-Principles of Digital transmission,
Transmission efficiency, modern concepts, wide band modulation.
Satellite Communication: Satellite Orbits, satellite communication
systems, satellite subsystems, Ground Stations Satellite Applications,
Global Positioning systems.
Optical Communication: Optical Principles, Optical Communication
Systems, Fiber-Optic Cables, Optical Transmitters & Receivers,
Wavelength Division Multiplexing.
Telecommunication Systems: Telephones Telephone system, Facsimile,
Internet Telephony. Cellular Communications: Cell phone technologies-
Cellular telephone systems, Mobile phone systems, Digital cell phone
systems(2G,2.5G,UMTS 3G,4G).
2018-2019 221
Text Books:
1. Louis E. Frenzel -Principles of Electronic Communication Systems,
3rd Edition, McGraw Hill publications, 2008.
Reference Books:
1. Theodore S. Rappaport, Wireless Communications-Principles and
practice, Prentice Hall, 2002.
2. Roger L. Freeman, Fundamentals of Telecommunications, 2nd Edition,
Wiley Publications.
Online Resources:
https://nptel.ac.in/courses/108104098/
Course Outcomes:
1. Analyze the basic concepts of modulation and understand the different
kinds of analog modulation techniques.
2. Understand and analyze the different types of pulse analog and digital
modulation systems.
3. Describe the Telephone systems and network fundamentals.
4. State the operative physical principle of launching satellites and explain
the concept & operation of GPS.
5. Comprehend about the principle of optical communication system,
functioning of optical cables and wave division multiplexing.
6. Describe the cell phone operational concepts.
Course Code: OE116KM 3 - - 3
RENEWABLE ENERGY SOURCES
(Open Elective-2)
Prerequisites:-Nil-
Course Objectives:
1. Various renewable energy resources available at a location and
assessments of its potential, using tools and techniques.
2. Solar energy radiation, its interactions, measurement and estimation
3. Site selection for wind turbines, wind systems, measurements and
instrument
4. Geothermal, wave, tidal and OTEC resources, site selection
Introduction To Renewable Energy Sources: Definition, Concepts of
NCES, Limitations of RES, Criteria for assessing the potential of NCES,
Classification of NCES, Solar, Wind, Geothermal, Biomass, Ocean energy
sources, Comparison of these energy sources.
Solar energy: Solar radiation spectrum - Extraterrestrial and terrestrial
solar radiation, solar constant -Radiation measurement - Instruments for
measuring solar radiation and Sun shine, solar radiation data.
Solar Energy Collection, Storage and Applications: Energy Collection:
Flat plate and Concentrating collectors, their performance analysis and
Classification of Concentrating collectors,
Energy Storage: Sensible heat, Latent heat, Stratified storage - Solar ponds.
Applications: Heating techniques, Cooling techniques, Solar Distillation
and Drying,
Solar Photovoltaic Generation: PV Generation, Photovoltaic energy
conversion – Operating principle, Photovoltaic cell concepts, Cell,
module, array, Series and parallel connections, Potential of India in Solar
energy utilization.
Wind Energy and Biomass: Wind energy: Power in Wind, Betz criteria,
Site selection, Types of wind mills, Characteristics of wind generators,
Potential of India in Wind Energy utilization.
Bio-mass: Principles of Bio-Conversion, Anaerobic, Aerobic digestion,
Types of Bio-gas digesters, Pyrolysis, Applications - Bio gas, Wood stoves,
Bio diesel, Economic aspects.
2018-2019 223
UNIT4: (~8 Lecture Hours)
Geothermal Energy And Ocean Energy: Geothermal energy:
Resources, Methods of harnessing the energy-Introduction to Thermo
dynamic Cycles- Potential of India in Geothermal energy options.
Ocean energy: OTEC - Principle of utilization, setting up of OTEC plants,
Thermodynamic cycles involved in OTEC. Tidal and wave energy – Potential
and conversion techniques, Mini-hydel power plants and their economics
in India.
Direct Energy Conversion: Direct Energy Conversion (DEC), Need
for DEC, Types of DEC - Fuel Cells, working of hydrogen fuel cell Magneto
Hydro Dynamic Energy Conversion (MHD), Thermo Electric and Thermo
Ionic Conversion (elementary treatment only), Working Principle,
Advantages and Disadvantages. Combined cycle and Co-generation.
Text Books:
1. G.D. Rai, Non-Conventional Energy Sources, 5th Edition, Khanna
Publishers, 2009.
2. D.P.Kothari, K.C.Singhal and Rakesh Ranjan, Renewable Energy
Sources and Emerging Technologies, 2nd Edition, P.H.I., 2014.
3. Twidell & Wier, Renewable Energy Resources, 3rd Edition, CRC Press
(Taylor & Francis), 2006.
Reference Books:
1. Tiwari, Ghosal, Renewable Energy Resources, Narosa Publications,
2005.
2. Sukhatme.S.P, Solar Energy: Principles of Thermal Collection and
Storage, 3rd Edition, Tata McGraw Hill, 2008.
Course Outcomes
After completion of this course the students should able to
1. Estimate the solar energy, Utilization of solar energy, Principles
involved in solar energy collection and conversion of it to electricity
generation
2. Explore the concepts involved in wind energy conversion system by
studying its components, types and performance
3. Understand the concept of Biomass energy resources and their
classification, types of biogas Plants- applications
4. Acquire the knowledge on Geothermal energy and it’s harnessing
methods
5. Illustrate ocean energy and explain the operational methods of their
utilization.
6. Describe the concept of direct energy conversion and their types and
working principle
Course Code: OE116KN 3 - - 3
DEPARTMENT OFMECHANICALENGINEERING
RESEARCH METHODOLOGY
(Open Elective-2)
Prerequisites:-Nil-
Course objectives:
1. To develop an understanding towards basic concepts of the research
methodology.
2. To familiarize primary disparity between quantitative research and
qualitative research.
3. To provide knowledge to define appropriate research problem and its
parameters.
4. To familiarize tools and techniques used for preparation of report
writing.
Research Methodology: Objectives and Motivation of Research, Types
of Research, Research Approaches, Significance of Research, Research
Methods verses Methodology, Research and Scientific Method,
Importance of Research Methodology, Research Process, Criteria of Good
Research, Problems Encountered by Researchers in India.
Defining the Research Problem: Definition of Research Problem,
selecting the Problem, Necessity of Defining the Problem, Technique
involved in Defining a Problem.
Literature Survey: Importance of Literature Survey, Sources of
Information, Assessment of Quality of Journals and Articles, Information
through Internet. Literature Review: Need of Review, Guidelines for
Review, Record of Research Review.
Research Design: Meaning of Research Design, Need for Research
Design, Feature of a Good Design, Important Concepts Related to Research
Design, Different Research Designs, Basic Principles of Experimental
Design.
Design of Sample Surveys: Sample Design, Sampling and Non Sampling
Errors, Sample Survey Versus Census Survey. Types of Sampling Designs:
Non Probability Sampling, Probability Sampling.
2018-2019 225
Data Collection and Preparation: Collection of Primary data:
Observation method, Interview method, Questionnaires, Schedules.
Collection of Secondary data, Case study method.
Data Preparation:Questionnaire checking, Editing, Coding,
Classification, Tabulation.
Graphical Representation: Pie chart, Bar chart, Histogram, Frequency
Polygon.
Interpretation and Report Writing: Meaning of Interpretation,
Techniques of Interpretation, Precautions of interpretation. Significance
of Report Writing, Steps in Writing the Report, Format of the Research
Report. Technical paper writing/Journal paper writing, Making
Presentation, Use of Visual Aids, Elementary Treatment of Plagiarism
Tools.
Text Books:
1. C.R Kothari & Gaurav Garg, Research Methodology, Methods &
Technique, New Age International Publishers, 2019.
2. R. Ganesan, Research Methodology for Engineers, MJP Publishers,
2016.
Reference Books:
1. R .Pannerselvam, Research Methodology, Prentice hall of India, 2014.
2. Ratan Khananabis and Suvasis Saha, Research Methodology,
Universities Press, Hyderabad, 2015.
3. G. Nageswara Rao, Research Methodology and Quantitative methods,
BS Publications, Hyderabad, 2012.
Online Resources:
onlinecourses.nptel.ac.in
Course Outcomes
1. Develop an understanding on various kinds of research and objectives
of doing research.
2. Perform literature reviews using print and online databases.
3. Design good research.
4. Collect required data for Research and to adopt methods for data
collection.
5. Interpret the data from research perception.
6. Write and present a substantial technical report and document.

Course Code: OE116KP 3 - - 3
BEHAVIOURAL SKILLS AND PROFESSIONAL
COMMUNICATION
(Open Elective-2)
Prerequisites:-Nil-
Course Objectives:
1. To achieve the desired life skills and social skills in their workplace.
2. To enable the students to handle and to overcome the professional
challenges and conflicts in a working environment.
3. To facilitate the students to understand and develop their managerial
skills in a professional environment.
4. To help the students understand professional and cross cultural
communication through digital technologies.
5. To develop critical thinking skills for speech and writing.
Life Skills: Essentials of desirable social skills and presentability skills
professionally-Confidence building-Self-esteem-Positive attitude-
Assertiveness -Professional etiquette and manners -Johari Window.
Critical Thinking Skills: Decision Making - Problem Solving –
Negotiation -Conflict resolution and Creative thinking – Blooms Taxonomy.
Managerial Skills: Time Management – Stress Management – Crisis
Management – Conflict Management – Relationship Management.
Professional Skills: Digital Communication - Social Networking – Cross
Cultural and Cross Functional Communication.
Human Values and Professional Ethics: Professional Codes of Ethics:
Importance and Impact – Ethical Challenges and Conflicts – Moral Issues
and dilemmas - Professional Etiquette and Netiquette.
Reference Books:
1. Meenakshi Raman and Shalini, Softskills: Key to success in workplace
and life, Cengage Publications, 2018.
2018-2019 227
2. Barun and K. Mitra, Personality Development and Soft Skills,

2nd Edition, Oxford University Press, 2016.
3. Sailesh Sen Gupta, Business and Managerial Communication, PH1
Learning Pvt. Ltd., 2011.
Online Resources:
2. https://onlinecourses.nptel.ac.in/noc19_mg03/preview
3. CEMCA – Life Skills for Engineers.
Course Outcomes:
1. Communicate with more confidence and self-esteem.
2. Give better presentation and explanation using digital aids and tools.
3. Perform effectively and efficiently in the work place environment.
4. Exhibit better tolerance and receptiveness in understanding and
accepting diversity.
5. Apply higher thinking order in the self-development process.
6. Equip oneself to handle the work related challenges and conflicts
professionally.
IV Year B.Tech. I Semester L T P C
Course Code: OE117KR 3 - - 3
CYBER SECURITY
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To demonstrate different types of Cybercrimes, Laws and IT Acts.
2. To introduce different types of Cyber Attacks and steps involved in
planning Cybercrimes.
3. To explore various security challenges faced by mobile workforce and
their implications under Cybercrime.
4. To introduce Proxy servers, Key loggers, SQL injections and wireless
network hacking.
5. To determine various web threats faced by organizations and understand
about Social Media Networking.
Introduction to Cybercrime: Introduction, Cybercrime – Definitions
and origins of the word, and Information Security, Who are Cybercriminals,
Classifications of Cybercrimes, And Cybercrime: The legal Perspectives
and Indian Perspective, Cybercrime and the Indian ITA 2000 - Hacking
and the Indian Law(s), A Global Perspective on Cybercrimes – Cybercrime
and the Extended Enterprise.
Cyber Offenses: How Criminals Plan Them: Introduction – Categories
of Cybercrime, How Criminals plan the Attacks – Reconnaissance, Passive
Attacks, Active Attacks, Scanning and Scritinizing Gathered Information,
Attack, Social Engineering, Cyber stalking – Types, Cases reported on
Cyberstalking, Working of Stalking, Real-Life incident of Cyberstalking,
Cybercafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack
Vector, Cloud Computing.
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation
of Mobile and Wireless Devices, Trends in Mobility, Credit card Frauds
in Mobile and Wireless Computing Era, Security Challenges Posed by
Mobile Devices, Registry Settings for Mobile Devices, Authentication
service Security, Attacks on Mobile/Cell Phones.
Mobile Devices: Security Implications for Organizations, Organizational
Measures for Handling Mobile, Organizational Security Policies and
Measures in Mobile Computing Era, Laptops.
2018-2019 229
Tools and Methods Used in Cybercrime: Introduction, Proxy Servers
and Anonymizers, Phishing, Password Cracking – Online Attacks, Offline
Attacks, Strong, Weak and Random Passwords, Keyloggers and Spywares
– Software Keyloggers, Hardware Keyloggers, Antikeylogger, Spywares,
Virus and Worms, Trojan Horse and Backdoors, Steganography, DoS and
DDoS attacks – DoS Attacks, Classification, Types and Levels, Tools used
to launch DoS attack, DDoS Attacks, How to protect from DoS/DDoS
Attacks, SQL Injection, Buffer Overflow.
Cyber Security: Organizational Implications Introduction, Cost of
Cybercrimes and IPR issues, Web threats for Organizations, Security and
Privacy Implications.
Social Media marketing: Security Risks and Perils for Organizations,
Social Computing and the associated challenges for Organizations.
Text Books:
1. Nina Godbole and Sunil Belapure, Cyber Security: Understanding
Cyber Crimes, Computer Forensics and Legal Perspectives, Wiley
INDIA.
Reference Books:
1. James Graham, Richard Howard and Ryan Otson, Cyber Security
Essentials, CRC Press.
2. Chwan-Hwa (john) Wu and J.David Irwin, Introduction to Cyber
Security, CRC Press T&F Group.
Online Resources:
1. https://www.open.edu/openlearn/futurelearn/cyber-security
2. https://www.cybrary.it/
3. https://www.cybersecurityeducation.org/resources/
4. https://www.onlinecourses.nptel.ac.in/
5. https://www/coursera.org/
Course Outcomes:
1. Understand the evolution of Internet in the context of emerging Cyber
threats and their laws.
2. Distinguish and classify the forms of Cybercriminal activities and
Social Engineering methods used to undertake crimes.
3. Apply risk management policies to protect organization’s critical
information and assets.
4. Analyse the tools and methods used in Cybercrime.
5. Understand the Security challenges for mobile and wireless devices.
6. Assess the Cybercrime scenarios in India, Global and Legal
Perspectives.
IV Year B. Tech. I-Semester L T P C

Course Code: OE117KS 3 - - 3
PYTHON PROGRAMMING
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To be able to introduce core programming basics and program design
with functions using Python programming language.
2. To understand a range of Object-Oriented Programming, as well as in-
depth data and information processing techniques.
3. To understand the high-performance programs designed to strengthen
the practical expertise.
Introduction to Python Programming: Using Python, The IDLE
Programming Environment, Input and Output Processing, Displaying
Output with the Print Function, Comments, Variables, Reading Input from
the Keyboard, Performing Calculations.
More about Data Output: New line, Item Separator, Escape Characters,
Formatting parameters.
Decision Structures and Boolean Logic: if, if-else, if-elif-else
Statements, Nested Decision Structures, Comparing Strings, Logical
Operators, Boolean Variables. Repetition Structures: Introduction, while
loop, for loop, Sentinels, Input Validation Loops, Nested Loops.
Functions: Introduction, Defining and Calling a Function, Designing a
Program to Use Functions, Local Variables, Passing Arguments to
Functions, Global Variables and Global Constants, Value-Returning
Functions Generating Random Numbers, Writing Our Own Value-
Returning Functions, The math Module, Random Module, Time Module
and Storing Functions in Modules.
Lists and Tuples: Sequences, Introduction to Lists, List slicing, Finding
Items in Lists with the in Operator, List Methods and Useful Built-in
2018-2019 231
Functions, Copying Lists, Processing Lists, Two-Dimensional Lists,

Tuples.
Strings: Basic String Operations, String Slicing, Testing, Searching, and
Manipulating Strings.
Dictionaries and Sets: Dictionaries, Sets, Serializing Objects.
Recursion: Introduction, Problem Solving with Recursion, Examples of
Recursive Algorithms.
Python File Input-Output: Opening and Closing file, various types of
file modes, reading and writing to files, manipulating directories
Exception Handling: What is Exception, various keywords to handle
exception- try, catch, except, else, finally, raise.
Regular Expressions: Concept of regular expression, various types of
regular expressions, using match function.
GUI Programming: Graphical User Interfaces, Using the tkinter Module,
Display text with Label Widgets, Organizing Widgets with Frames, Button
Widgets and Info Dialog Boxes, Getting Input with Entry Widget, Using
Labels as Output Fields, Radio Buttons, Check Buttons.
Introduction to plotting in Python: Basic Plots- Line and Scatter Plot,
Histograms and plotting data contained in files.
Text Books:
1. Tony Gaddis, Starting out with Python, 4th Edition, Pearson, 2017.
2. Kenneth A. Lambert, Fundamentals of Python, Delmar Cengage
Learning, 2013.
3. Charles Dierbach, Introduction to Computer Science using Python,
Wiley, 2013.
Reference Books:
1. James Payne, Beginning Python using Python 2.6 and Python 3, wrox
programmer to programmer, 2010.
2. Paul Gries, Practical Programming: 3rd Edition, An Introduction to
Computer Science using Python, 2016.
3. Clinton W. Brownley, Foundations for Analytics with Python”, 1st
Edition, O’Rielly Media, 2016.
Online Resources:
1. https://www.python.org/
2. https://www.coursera.org/learn/python
3. https://learnpythonthehardway.org/book/
4. https://www.coursera.org/specializations/python
5. https://www.learnpython.org/
6. https://www.cs.uky.edu/~keen/115/Haltermanpythonbook.pdf
Course Outcomes:
1. Gain knowledge on the basic principles of Python programming
language.
2. Understand different Decision Making statements and Functions.
3. Apply the knowledge of data structures like Lists, Dictionaries and
sets.
4. Understand and summarize different File and exception handling
operations.
5. Implement object oriented concepts.
6. Design GUI applications using Python.
2018-2019 233
IV Year B. Tech. I-Semester L T P C
Course Code: OE117KT 3 - - 3
ANDROID PROGRAMMING
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To demonstrate their understanding of the fundamentals of Android
operating systems.
2. To demonstrate their skills of using Android software development
tools.
3. To demonstrate their ability to develop software with reasonable
complexity on mobile platform.
4. To demonstrate their ability to deploy software to mobile devices.
5. To demonstrate their ability to debug programs running on mobile
devices.
Introduction to Android Operating System: Android OS design and
Features – Android development framework, SDK features, Installing and
running applications on Eclipse platform, Creating AVDs, Types of Android
applications, Best practices in Android programming, Android tools.
Android application components – Android Manifest file, Externalizing
resources like values, themes, layouts, Menus etc., Resources for different
devices and languages, Runtime Configuration Changes.
Android Application Lifecycle– Activities, Activity lifecycle, activity
states, monitoring state changes.
Android User Interface: Measurements – Device and pixel density
independent measuring units.
Layouts – Linear, Relative, Grid and Table Layouts.
User Interface (UI) Components – Editable and non-editable Text Views,
Buttons, Radio and Toggle Buttons, Checkboxes, Spinners, Dialog and
pickers.
Event Handling – Handling clicks or changes of various UI components.
Fragments – Creating fragments, Lifecycle of fragments, Fragment
states, Adding fragments to Activity, adding, removing and replacing
fragments with fragment transactions, interfacing between fragments and

Activities, Multi-screen Activities.
Intents and Broadcasts: Intent – Using intents to launch Activities,
Explicitly starting new Activity, Implicit Intents, Passing data to Intents,
Getting results from Activities, Native Actions, using Intent to dial a
number or to send SMS.
Broadcast Receivers – Using Intent filters to service implicit Intents,
Resolving Intent filters, finding and using Intents received within an
Activity.
Notifications – Creating and Displaying notifications, Displaying Toasts.
Persistent Storage: Files – Using application specific folders and files,
creating files, reading data from files, listing contents of a directory Shared
Preferences – Creating shared preferences, saving and retrieving data using
Shared Preference.
Database – Introduction to SQLite database, creating and opening a
database, creating tables, inserting retrieving and deleting data, Registering
Content Providers, Using content Providers. (insert, delete, retrieve and
update)
Advanced Topics: Alarms – Creating and using alarms.
Using Internet Resources – Connecting to internet resource, using
download manager.
Location Based Services – Finding Current Location and showing
location on the Map, updating location.
Text Books:
1. Reto Meier, Professional Android 4 Application Development, Wiley
India, (Wrox), 4th Edition, John Wiley & Sons, Inc, 2012.
2. James C Sheusi, Android Application Development for Java
Programmers, Cengage Learning, Course Technology, a part of
Cengage Learning, 2013.
Reference Books:
1. Wei-Meng Lee, Beginning Android 4 Application Development, 4th
Edition, Wiley India (Wrox), 2013.
2018-2019 235
Online Resources:
1. https://developer.android.com/guide
2. https://www.tutorialspoint.com/android/
3. https://developer.android.com/studio
4. https://nptel.ac.in/courses/106106147/6
5. https://in.udacity.com/course/new-android-fundamentals—ud851
6. https://medium.com/@tristaljing/10-best-app-development-courses-
for-beginners-and-get-a-job-d84dbf34b101
Course Outcomes:
At the end of the course the students are able to
1. Describe Android platform, Architecture and features.
2. Design User Interface and develop activity for Android App.
3. Use Intent, Broadcast receivers and Internet services in Android App.
4. Design and implement Database Application and Content providers.
5. Use multimedia, camera and Location based services in Android App.
6. Discuss various security issues in Android platform.
IV Year B.Tech. I-Semester L T P C
Course Code: OE117KU 3 - - 3
DEPARTMENT OFELECTRONICSAND TELEMATICS ENGINEERING
TELECOMMUNICATION SWITCHING SYSTEMS
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To expose through the evolution of switching systems from
electromechanical systems to stored-program-controlled digital
systems.
2. To provide knowledge to the students regarding design and performance
analysis of electronic space division switching systems.
3. To provide knowledge to the students regarding design and performance
analysis of time division switching systems.
4. To train the students about basic concepts of Telephone Networks.
5. To inculcate students on various traffic engineering concepts.
Telecommunication Switching Systems: Introduction, Evolution of
Telecommunications, Basics of a switching system, Crossbar Switching,
Principles of Crossbar Switching, Crossbar Switch Configuration,
Crosspoint Technology, Crossbar Exchange Organization.
Electronic Space Division Switching: Stored Program Control,
Centralized SPC, Distributed SPC, Software Architecture, Application
Software, Enhanced services, Two-Stage Networks, Three-Stage Networks,
n-Stage Networks.
Time Division Switching: Basic Time Division Space Switching, Basic
Time Division Time Switching, Time Multiplexed Space Switching, Time
Multiplexed Time Switching, Combination Switching, Three Stage
Combination Switching, n - Stage Combinational Switching.
Telecommunications Traffic : Introduction, The Unit of Traffic,
Congestion, Traffic Measurement, A Mathematical Model, Lost-Call
Systems- Theory, Traffic Performance, Loss Systems in Tandem, Use of
Traffic Tables, Queuing Systems-The Second Erlang Distribution,
Probability of Delay.
2018-2019 237
Telephone Networks : Subscriber loop systems, Switching hierarchy and
routing, Transmission plan, Transmission systems, Numbering plan,
Charging plan, Signaling techniques: In channel signaling, Common channel
signaling.
Text Books:
1. Thyagarajan Viswanathan, Tele Communication Switching System and
Networks, PHI, 2000.
2. J. E Flood, Telecommunications Switching and Traffic Networks,
Pearson Education, 2006.
Reference Books:
1. J. Bellamy, 2nd Edition, John Wiley, Digital telephony, 2001.
2. Achyut. S.Godbole, Data Communications & Networks, TMH, 2004.
3. H. Taub & D. Schilling, Principles of Communication Systems, 2nd
Edition, TMH, 2003.
4. S.Keshav, An Engineering approach to computer networking, Addison
Wesely.
Online References:
1. https://onlinelibrary.wiley.com/doi/book/10.1002/0471208051
2. https://en.wikipedia.org/wiki/Telecommunication
Course Outcomes:
1. Acquire knowledge about Telecommunication Switching Systems.
2. Understand different Telecommunication switching and signaling
methodologies.
3. Apply the concepts to solve the real time telecommunication problems.
4. Analyse the fundamental telecommunication traffic models.
5. Evaluate telecommunication switching systems.
6. Design a telecommunication switching system.
Course Code: OE117KV 3 - - 3
WASTE MANAGEMENT TECHNIQUES AND
POWER GENERATION
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To classify the sources of solid waste & e-waste.
2. To identify methods of solid waste disposal.
3. To understand various waste management techniques.
4. To study various energy generation methods as per type of waste
available locally.
5. To analyze energy generation methods and recycling of waste.
Waste Management and Handling: Sources & types of wastes (Industrial,
Municipal, Agro, Domestic). Generation of wastes, Pollution standards,
Waste characterization. Functional elements of waste management,
technological aspects related to waste generation, on site handling, storage,
collection, transfer and transport.
Processing techniques and equipment (volume reduction, size reduction,
component separation, dewatering, drying).
Waste Management Issues: Planning, organization & control Hazardous
& toxic wastes, hazard & its management, classification, generation,
handling, processing and disposal. Industrial safety, Waste disposal,
Environmental impact (toxic & non-toxic).
Conversion Techniques & Methods: Recovery of value added
components: Recycling, conversion products and energy Conversion
technologies: Incineration,-principle features of an incinerator -site
selection and plant layout of an incinerator - Thermo-chemical conversions.
Biochemical conversion: Biogas & ethanol Conventional Chemical &
biological treatment. Power generation & its utilization.
Processing Techniques and Recovery of Energy: Processing techniques
– purposes mechanical volume reduction-necessary equipments – chemical
2018-2019 239
volume reduction-mechanical size reduction selection of equipments-
components separation-methods-drying and dewatering. Refusal disposal
– various methods.
Concepts of Land Fill & e-Waste
Concepts of Land Fill: Land Fill method of solid waste disposal, Land
fill classification, Types, methods and Sitting consideration, Layout and
preliminary design of landfills: Composition, Movement and control of
landfill leachate and gases, Environmental monitoring for land fill gases.
e-Waste: e-waste in global context, Environmental concerns, Global trading
in hazardous waste, Management of e-waste, e-waste legislation,
Government regulations on e-waste management & Recycling.
Text Books:
1. T.V. Ramachandra, Management of Municipal Solid Waste, The Energy
and Resources Institute, TERI, 2009.
2. Thomas Christensen, Solid waste technology and Management,
2nd Volume Set., WILEY Publishers, 2011.
3. K.Sasi Kumar and Sanoop Gopi Krishna, Solid Waste Management, PHI
Learning Pvt. Ltd, 2009.
Reference Books:
1. Vasudevan Rajaram, Faisal Zia Siddiqui, Sanjeev Agrawal and Mohammad
Emran Khan, Solid and Liquid Waste Management: Waste to Wealth,
PHI Learning Pvt. Ltd, 2016.
2. P.Jayarama Reddy, Energy Recovery from Municipal Solid Waste by
Thermal Conversion Technologies, CRC Press, 2016.
3. Ms Bhatt Asheref Illiyan, Solid waste Management: An Indian
Perspective, Synergy Books India, 2012.
Course Outcomes:
Upon the completion of the course, the students will be able to
1. Understand technologies for generation of energy from solid waste.
2. Compare methods of solid waste disposal.
3. Identify sources of energy from waste using various conversion
techniques.
4. Analyze methods for waste management.
5. Assess the harmful effects of e-waste.
6. Differentiate between the normal waste and e-waste.
Course Code: OE117KW 3 - - 3
INDUSTRIAL MANAGEMENT
(Open Elective-3)
Prerequisites:-Nil-
Course Objectives:
1. To up skill the importance of Productivity in Production Process.
2. To give insights of managing Production activities.
3. To sensitize the importance of Quality.
Introduction to Industrial Management
Industrial Management – Introduction - Need, Scope, Evolution –
Industrial Engineering and Management.
Production Management – Plant location – Factors affecting Plant
location - Plant Layout – Types of Plant Layout – Product, Process, Fixed
Position and Combination Layout.
Production and Productivity
Production – Introduction – Types of Production – Job, Batch and Mass
Production – Methods of Production.
Productivity – Concept of Productivity – Production vs Productivity –
Objectives – Factors affecting Productivity – Kinds of Productivity –
Material, Labour, Capital, Machine and general measure of Productivity
(Theory only) – Measures to improve Productivity and its benefits.
Operations and Materials Management
Operations Management – Work study – Introduction – Objectives –
Scope of Work study- Method study - Definition - Objectives – Steps of
Method study. Work measurement – Definition, objectives and benefits of
Work measurements – Time study – Definition – Steps in Time study –
Uses of Time study.
Materials Management-Definition- Objectives-Functions-Purchase
procedure-ABC analysis -VED Analysis – Economic Order Quantity.
Inventory and Stores Management
Inventory Management – Introduction - Functions of Inventory Control
– Advantages of Inventory Control – Methods of Inventory issues – FIFO,
2018-2019 241
LIFO, Simple average and Weighted average methods (simple problems) –
Material Resource Planning (MRP) - Enterprise Resource Planning (ERP)
– Just in Time (JIT) - Supply Chain Management (SCM)
Stores Management – Stores Keeping – Classification of Stores – Stores
Records
Quality Management and Control
Quality Management – Introduction, Evolution, Contributions of Juran,
Deming, Crosby, Total Quality Management.
Statistical Quality Control -Advantages of Quality control-Shewart
Control Charts for variables - chart and R chart-Attributes-Defective –
Defect-Charts for Attributes -P Chart and C Chart (simple problems)-Six
Sigma.
Text Books:
1. O.P. Khanna, Industrial Engineering and Management, Dhanpat Rai
Publications Pvt. Ltd., 2004.
2. T.R. Banga, NK Agarwal and S.C. Sarma, Industrial Engineering and
Management Science, 10th Edition, Khanna Publishers, 2005.
Reference Books:
1. Joseph and G. Monks, Operations Management (Theory and Problems),
3rd Edition, McGraw- Hill Series in Management, 1987.
2013.
3. Besterfield H. Dale, Total Quality Management, 3rd Edition, Pearson,
2003.
Online Resources:
Operations Management https://onlinecourses.nptel.ac.in/noc18_me26/
preview
Course Outcomes:
1. Organize the activities of Business efficiently.
2. Adapt to appropriate method of production yielding productivity.
3. Identify efficient method of production.
4. Handle inventory efficiently for improving Productivity.
5. Implement and maintain Quality standards in Production.
6. Cohere to dynamic practices to improve Productivity.
IV Year B.Tech. II-Semester L T P C
Course Code: OE118KX 3 - - 3
PRINCIPLES OF ARTIFICIAL INTELLIGENCE
(Open Elective-4)
Prerequisites:-Nil-
Course Objectives:
1. To learn the difference between optimal reasoning vs human like
reasoning.
2. To understand the notions of state space representation, uninformed
search, informed (heuristic) search.
3. To learn different knowledge representation techniques.
4. To understand the applications of Al: namely Game Playing, Expert
Systems, Machine Learning and Natural Language Processing.
Introduction: History, Foundations of AI, Sub areas of AI, Objectives
and Applications of AI.
Intelligent Agent: Agents and Environments and the Structure of Agents.
Solving Problem by Searching: Introduction, General Problem Solving.
Uninformed Search Strategies: Breadth First Search and Depth First
Search. Informed (Heuristic) Search Strategies: Heuristic Function,
A* Algorithm and Hill Climbing.
Game Playing: Optimal Decisions in Games, the Minimax Algorithm,
Alpha-Beta Pruning, Constraint Satisfaction Algorithm.
Logic Concepts: Introduction, Propositional Logic, Predicate Logic,
Unification Algorithm, Natural Deduction System, Semantic Tableau
System in Propositional Logic, Resolution Refutation in Propositional
Logic.
Knowledge Representation: Introduction, Approaches to Knowledge
Representation, Knowledge Representation using Semantic Networks and
Extended Semantic Networks, Knowledge Representation using Frames.
Expert System and Applications: Introduction, Phases in Building Expert
Systems, Expert System Architecture, Expert Systems Vs Traditional
Systems, Application of Expert Systems, List of Shells and Tools.
2018-2019 243

Uncertainty Measure – Probability Theory: Introduction, Probability
Theory, Bayesian Belief Networks, Dempster-Shafer Theory.
Machine Learning: Introduction. Machine Learning Systems. Supervised,
Unsupervised Learning and Reinforcement Learning, Learning Decision
Trees, Clustering, Support Vector Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks,
Single- Layer Feed-Forward Networks, Multi-Layer Feed-Forward
Networks, Recurrent Networks, Design Issues of Artificial Neural
Networks.
Advanced Knowledge Representation Techniques: Case Grammars,
Semantic Web.
Natural Language Processing: Introduction, Sentence Analysis Phases,
Grammars and Parsers, Types of Parsers.
Text Books:
1. Russell and Norvig, Artificial intelligence, A Modern Approach,
Pearson Education, 3rd Edition. 2014.
2. Rich, Knight and Nair, Artificial intelligence, Tata McGraw Hill, 3rd
Edition 2009.
Reference Books:
1. Deepak Khemani, A First Course in Artificial Intelligence, McGraw-
Hill Education, 2013
2. Saroj Kaushik, Artificial Intelligence, Cengage Learning, 2011D,
Samanta, Classic Data Structures, 2nd Edition, PHI.
Online Resources:
1. https://faculty.psau.edu.sa/filedownload/doc-7-pdf a154ffbcec
538a4161a406abf62f5b76-original.pdf
4. https://onlinecourses.nptel.ac.in/noc18_cs18/preview
5. https://www.edx.org/course/artificial-intelligence-ai-columbiax-
csmm-101x-4
Course Outcomes:
1. Understand the basics of AI and knowledge representation using
appropriate technique.
2. Apply AI techniques for problem solving using various search and game
Playing algorithms.
3. Interpret architectures of different intelligent agents and Expert
Systems.
4. Interpret probabilistic and logical reasoning for knowledge.
5. Analyse different Machine Learning approaches for problem solving.
6. Recognize basics of Natural Language Processing.
2018-2019 245
Course Code: OE118KY 3 - - 3
CLOUD COMPUTING
(Open Elective-4)
Prerequisites:-Nil-
Course Objectives:
1. To explain evolving computer model called cloud computing.
2. To introduce the various levels of services that can be achieved by
cloud.
3. To describe the security aspects of cloud.
Introduction: Cloud computing at a glance, Historical developments,
Building cloud computing environments.
Cloud Computing Architecture: The cloud reference model, Types of
clouds, Economics of the cloud, Open challenges.
Virtualization: Characteristics of virtualized environments, Taxonomy
of virtualization techniques, Virtualization and cloud computing, Pros and
cons of virtualization, Technology examples- Xen, VMware, Microsoft
Hyper-V. Migrating into a Cloud, Virtual Machines Provisioning and
Migration Services.
Cloud Platforms in Industry: Amazon web services, Google AppEngine,
Microsoft Azure, Aneka-Integration of private and public cloud
Cloud Applications:Scientific applications, Business and consumer
applications.
Security in the Cloud: Cloud Security Challenges, Software-as-a-Service
Security.
Secure Distributed Data Storage in Cloud Computing: Cloud Storage:
from LANs to WANs, Technologies for Data Security in Cloud Computing.
Data Security in the Cloud: The Current State of Data Security in the
Cloud, Cloud Computing and Data Security Risk, Cloud Computing and
Identity, The Cloud, Digital Identity, and Data Security, Content Level
Security-Pros and Cons.
SLA Management: Traditional Approaches to SLO Management, Types
of SLA, Life Cycle of SLA, SLA Management in Cloud, Automated Policy-
based Management.
Common Standards in Cloud Computing: The Open Cloud Consortium,
Distributed Management Task Force, Standards for Application
Developers, Standards for Messaging, Standards for Security.
Text Books:
1. Rajkumar Buyya, Christian Vecchiola and S. Thamarai Selvi, Mastering
Cloud Computing: Foundations and Applications Programming,
McGraw Hill Education, 2013.
2. Rajkumar Buyya, James Broberg, Andrzej and Wiley, Cloud Computing:
Principles and paradigms, 2011.
3. John W. Rittinghouse and James F. Ransome, Cloud Computing:
Implementation, Management and Security, CRC, 2010.
Reference Books:
1. Kai Hwang, Geoffery C.Fox and Jack J Dongarra, Distributed and cloud
computing, Elsevier, 2012.
2. A. Kannammal, Fundamentals of Cloud Computing, CL India, 2015.
3. Tim Mather, Subra Kumaraswamy and Shahed Latif, Cloud Security
and Privacy, An Enterprise Perspective on Risks and Compliance.
Publisher: O’Reilly Media 2009.
Online Resources:
1. https://ramslaw.files.wordpress.com/2016/07/0124114547cloud.pdf
2. http://www.chinacloud.cn/upload/2011-07/11073107539898.pdf
3. https://eniac2017.files.wordpress.com/2017/03/distributed-and-
cloud- computing.pdf
4. https://aws.amazon.com/
5. https://cloud.google.com/
6. https:// onlinecourses.nptel.ac.in
7. https://coursera.org/learn/cloud-computing
Course Outcomes:
1. Articulate the main concepts, key technologies, strengths, and
limitations of cloud computing.
2. Illustrate the broad perceptive of cloud architecture and model.
3. Apply and design suitable Virtualization concept.
4. Explore some important cloud computing driven commercial systems
such as Google Apps, Microsoft Azure and Amazon Web Services and
other businesses cloud applications.
5. Assess cloud Storage systems and Cloud security, the risks involved,
its impact and develop cloud application.
6. Analyse the various standards for Cloud computing and its management.
2018-2019 247
Course Code: OE118KZ 3 - - 3
DEPARTMENT OFELECTRONICSAND TELEMATICS ENGINEERING
CELLULAR AND MOBILE COMMUNICATIONS
(Open Elective-4)
Prerequisite:-Nil-
Course Objectives:
1. To provide the student with an understanding of the Cellular concept,
Frequency reuse, Hand-off strategies.
2. To enable the student to analyze and understand wireless and mobile
cellular communication systems over a stochastic fading channel.
3. To provide the student with an understanding of Co-channel and Non-
Co-channel interferences.
4. To give the student an understanding of cell coverage for signal and
traffic, diversity techniques and mobile antennas.
5. To give the student an understanding of frequency management, Channel
assignment and types of handoff.
Introduction to Cellular Mobile Radio Systems: Limitations of
Conventional Mobile Telephone Systems, Basic Cellular Mobile System,
First, Second, Third and Fourth Generation Cellular Wireless Systems,
Uniqueness of Mobile Radio Environment- Fading - Time Dispersion
Parameters, Coherence Bandwidth, Doppler Spread and Coherence Time.
Fundamentals of Cellular Radio System Design: Concept of Frequency
Reuse, Co-Channel Interference, Co-Channel Interference Reduction
Factor, Desired C/I From a Normal Case in a Omni Directional Antenna
System, System Capacity, Trunking and Grade of Service, Improving
Coverage and Capacity in Cellular Systems- Cell Splitting, Sectoring,
Microcell Zone Concept.
Co-Channel Interference: Measurement Of Real Time Co-Channel
Interference, Design of Antenna System, Antenna Parameters and Their
Effects, Diversity Techniques-Space Diversity, Polarization Diversity,
Frequency Diversity, Time Diversity.
Non-Co-Channel Interference: Adjacent Channel Interference, Near End
Far End Interference, Cross Talk, Effects on Coverage and Interference by
Power Decrease, Antenna Height Decrease, Effects of Cell Site

Components.
Cell Coverage for Signal and Traffic: Signal Reflections in Flat And
Hilly Terrain, Effect of Human Made Structures, Phase Difference Between
Direct and Reflected Paths, Constant Standard Deviation, Straight Line Path
Loss Slope, General Formula for Mobile Propagation Over Water and Flat
Open Area, Near and Long Distance Propagation, Path Loss From a Point
to Point Prediction Model in Different Conditions, Merits of Lee Model.
Cell Site and Mobile Antennas: Space Diversity Antennas, Umbrella
Pattern Antennas, Minimum Separation of Cell Site Antennas, Mobile
Antennas.
Frequency Management and Channel Assignment:
Numbering And Grouping, Setup Access And Paging Channels, Channel
Assignments to Cell Sites and Mobile Units, Channel Sharing and
Borrowing, Sectorization, Overlaid Cells, Non Fixed Channel Assignment.
Handoffs and Dropped Calls:
Handoff Initiation, Types of Handoff, Delaying Handoff, Advantages of
Handoff, Power Difference Handoff, Forced Handoff, Mobile Assisted and
Soft Handoff, Intersystem Handoff, Introduction to Dropped Call Rates
and their Evaluation
Text Books:
1. W.C.Y. Lee, Mobile Cellular Telecommunications, 2nd Edition, Mc Graw
Hill, 1989.
2. Theodore. S. Rapport, Wireless Communications, 2nd Edition, Pearson
Education, 2002.
3. Upena Dalal, Wireless communication and networks, Oxford University
press.
Reference Books:
1. Gordon L. Stuber, Principles of Mobile Communications, 2nd Edition,
Springer International, 2001.
2. Simon Haykin and Michael Moher, Modern Wireless Communications,
Pearson Education, 2005.
3. Asrar U. H. Sheikh, Wireless Communications Theory and Techniques,
Springer, 2004.
2018-2019 249
4. Vijay Garg, Wireless Communications and Networking, Elsevier

Publications, 2007.
5. Andrea Goldsmith, Wireless Communications, Cambridge University
Press, 2005.
Online Resources:
1. https://onlinecourses.nptel.ac.in/noc17_cs37/preview Wireless and
Cellular Communication by Prof.R. David Koilpillai.
2. https://nptel.ac.in/courses/117102062/ : Wireless Communication by
Dr. Ranjan Bose
Course Outcomes:
1. Analyze and design wireless and mobile cellular systems.
2. Understand impairments due to multipath fading channel.
3. Understand the fundamental techniques to overcome the different fading
effects.
4. Understand Co-channel and Non Co-channel interferences.
5. Familiar with cell coverage for signal and traffic, diversity techniques
and mobile antennas.
6. Understanding of frequency management, Channel assignment, and types
of handoff.
Course Code: OE118MA 3 - - 3
DEPARTMENT OFELECTRICALAND ELECTRONICS ENGINEERING
ROBOTICS
(Open Elective-4)
Prerequisite:-Nil-
Course Objectives:
1. To understand basic concepts of robotics.
2. To learn various sensors and actuators used in the design of robots.
3. To learn various robot programming methods and languages.
Introduction: - Basic Concepts such as Definition, brief history, three
laws, depth of filed, Robot anatomy, Classification and usage, science and
technology of robots, associated parameters: resolution, accuracy,
repeatability, dexterity.
Sensors for Robots: - Characteristics of sensing devices, Selections of
sensors, Classification and applications of sensors. Types of Sensors, Need
for sensors and vision system in the working and control of a robot.
Drives: - Types of Drives, Actuators and its selection while designing a
robot system. Types of transmission systems
Control Systems: - Types of Controllers, Introduction to closed loop
control, second order linear systems and their control, control law
partitioning, trajectory-following control, modelling and control of a single
joint, present industrial robot control systems and introduction to force
control
Machine Vision System: - Vision System Devices, Image acquisition,
Masking, Sampling and quantisation, Image Processing Techniques, Noise
reduction methods, Edge detection, Segmentation
Robot Programming: Methods of robot programming, lead through
programming, motion interpolation, branching capabilities, WAIT, SIGNAL
and DELAY commands, subroutines,
2018-2019 251
Programming Languages: Introduction to various types such as RAIL

and VAL II …etc., Features of each type and development of languages for
recent robot systems
Associated Topics in Robotics: - Socio-Economic aspect of robotisation,
Economical aspects for robot design, Safety for robot and associated mass,
New Trends & recent updates in robotics, International Scenario for
implementing robots in Industrial and other sectors. Future scope for
robotisation.
Text Books:
1. John J. Craig, Introduction to Robotics (Mechanics and Control), 2nd
Edition, Addison-Wesley, 2004.
2. Mikell P. Groover et. al., Industrial Robotics: Technology, Programming
and Applications, McGraw – Hill International, 1986.
3. Richard D. Klafter, Thomas A. Chemielewski, Michael Negin, Robotic
Engineering: An Integrated Approach, Prentice Hall India, 2002.
Reference Books:
1. K.S. Fu, R.C. Gonzales, C.S.G. Lee, Robotics: Control, Sensing, Vision
and Intelligence, McGraw Hill, 1987.
2. Shimon Y. Nof, Handbook of Industrial Robotics, John Wiley Co, 2001.
Course Outcomes:
1. Identify a Robot for a specific application.
2. Identify parameters required to be controlled in a Robot.
3. To select suitable sensors and drive system for an application
4. To learn various robot programming methods and languages
5. To learn various industrial robot control systems and Mission Vision
system
6. To understand Socio-Economic aspect of robotisation.
Course Code: OE118MB 3 - - 3
MARKETING MANAGEMENT
(Open Elective- 4)
Prerequisites:-Nil-
Course Objectives:
1. To orient the importance of Marketing in Product delivery.
2. To understand buyer behavior in Product selection.
3. To give overview of Marketing Mix in Product delivery.
Introduction to Marketing Management
Marketing Management: Meaning and importance – Nature & Scope –
Core concepts including Marketing Mix and Marketing Research –
Evolution of Marketing concepts from Production concept to Societal
Marketing concept – Green Marketing – Marketing Process.
Market Segmentation & Buyer Behavior
Market Segmentation: Levels & Patterns of Market Segmentation –
Segmentation of Consumer & Business Markets –Target Marketing –
Developing and communicating a positioning strategy – Differential Tools
- New Product Development and its process.
Buyer Behavior: Importance of Buyer behavior -Factors influencing buyer
behavior – Cultural – Social – Personal & Psychological – Buying decision
process - stages of buying decision process.
Product Offerings and Pricing Strategies
Product Offering: The Product and Product Mix – Product Line decisions
– Brand Decisions – Packaging and Labeling.
Pricing Strategies: - Setting the Price - Adapting the Price – Initiating
and Responding the Price changes.
Managing Marketing Channels through Networks
Distribution: Distribution Channels and Value Network-Channel
Intermediaries-Channel Structure-Decision and Functions-Channel
Dynamics-Retailing-Types-Wholesaling-Market Logistics.
2018-2019 253
Promotion:- Nature and Importance of Promotions – Designing and
Managing Promotion Mix – Managing Advertising – Sales Promotion -
Personal Selling – Public Relation – Direct Marketing – Publicity and Social
Media – Managing Digital Communication – E-Marketing , M-Marketing,
Services Marketing.
Text Books:
1. Philip Kotler, Marketing Management, Prentice – Hall of India Pvt Ltd,
Eleventh Edition, 2003.
2. Philip Kotler and Kevin Lane Keller, Marketing Management, 15th
Edition, Pearson, 2016.
Reference Books:
1. Rajagopal, Marketing – Concept and Cases, New Age International (P)
Ltd., 2008
2013.
3. Richard J.Semenik, Promotion & Integrated Marketing Communication,
Thomson South-Western, 2006.
Online Resources:
Marketing Management:
1. https://nptel.ac.in/courses/110104068/
2. https://nptel.ac.in/courses/110104070/
Course Outcomes:
1. Understand the importance of the Marketing Management Process
2. Conduct Marketing Research, comprehend buyer behavior and
hypothesize market segmentation.
3. Identify the elements of product mix and pricing strategies.
4. Enumerate strategies of pricing in fixation.
5. Select appropriate network of product distribution.
6. Adapt to befitting promotional strategy.

Course Code: OE118MC 3 - - 3
DEPARTMENT OF BASIC SCIENCES
ENVIRONMENTAL IMPACT ASSESSMENT
(Open Elective-4)
Prerequisites:-Nil-
Course Objectives:
1. To provide knowledge on various aspects of Environment Impact
Assessment Methodologies.
2. To understand the impact of development activities on water, air and
biological Environment.
3. To prepare the Environmental Impact Statement (EIS) and Environmental
Audit (EA) Report.
4. To provide knowledge about Environmental Legislations and ISO 14000
standards pertaining to Environmental Management.
Basic Concepts of EIA: Definition of Environmental Impact Assessment
(EIA) and Environmental Impact Statement (EIS), Initial environmental
examination, Elements of EIA, Stages in EIA, factors affecting EIA,
Classification of environmental parameters, Impact analysis. Preparation
of Environmental Base map.
EIA Methodologies: Introduction, Criteria for the selection of EIA
Methodology, EIA methods- Adhoc method, Matrix method, Network
method, Environmental Media Quality Index method and Overlay methods.
Cost Benefit Analysis.
Assessment of Impact of Development Activities: Deforestation –
causes, effects and control measures, impact on Vegetation and Wildlife.
Review of Environmental Impact Assessment, guidelines for preparation
of Environmental Impact Statement. Environmental Impact Mitigation
measures.
Procurement of Relevant Soil Quality: Soil – types and quality, impact
prediction of soil quality due to human developmental activities, impact
assessment and its significance. Identification and incorporation of
mitigation measures.
2018-2019 255

Environmental Audit: Objectives of Environmental Audit, types of
Environmental Audit, Audit protocol. Stages of Environmental Audit - onsite
activities, evaluation of audit data and preparation of Audit report, Post
Audit activities.
Environmental Legislations: Objectives of Environmental Legislations,
The Environmental (Protection) Act 1986, The Water (Prevention and
Control of Pollution) Act 1974, The Air (Prevention and Control of
Pollution) Act 1981, The Motor Act 1988, The Wild life (Protection) Act
1972. Concept of ISO and ISO 14000, Case studies and preparation of
Environmental Impact Statement for various Industries.
Text Books:
1. Larry Canter, Environmental Impact Assessment, McGraw-Hill
Publications, 1996.
2. R.R Barthwal, Environmental Impact Assessment, New Age International
Publications, 2010.
3. Environmental Impact Assessment: Theory & Practice, P. Wathern
Publishers Rutledge, London, 1992.
Reference Books:
1. R.K. Khitoliya, Environmental Pollution, S. Chand Publishing, 2014.
2. J. Glynn and W. H. Gary, Environmental Science and Engineering,
Prentice Hall Publishers, 1996.
3. Suresh K. Dhameja, Environmental Science and Engineering, S.K.
Kataria and Sons Publication, New Delhi, 2006.
4. H. S. Bhatia, Environmental Pollution and Control, Galgotia Publication
Private Limited, Delhi, 2003.
5. M.Anji Reddy, Environmental Impact Assessment, BSP Books Private
Limited, 2017.
Online Resources:
1. Environmental Impact Assessment-Open Educational Resource http://
www.raymondsumouniversity.com/eia-local/about.html
2. Environmental Impact Assessment - https://unep.ch/etb/publications/
enviImpAsse.php
3. Urban Environmental Management - http://www.gdrc.org/uem/eia/
impactassess.html
4. Environmental Impact Assessment Report https://www.miga.org/sites/

default/files/archive/Documents/EIA_Rwanda_Stones.pdf
5. https://cept.ac.in/cce/admin/images/files/1347949702_po7tf.pdf
6. https://www.iisd.org/learning/eia/
7. https://www.iaia.org/iaia-training-courses.php
8. https://www.eiatraining.com/index.html
Course Outcomes:
1. Understand the basic concepts of Environmental Impact Assessment,
Environmental Impact Statement and Environmental Audit.
2. Identify the environmental aspects to be considered for the
Environmental Impact Assessment study.
3. Apply the knowledge of Environmental Impact Assessment studies in
Preparation of Environmental Impact Statement.
4. Prepare suitable methodology in Environmental Impact Assessment
documentation.
5. Analyse and evaluate the mitigation measures of developmental
activities on environmental components.
Program Outcomes (POs) - B.Tech. (CSE)
PO 1 Engineering Knowledge: To acquire firm knowledge of
Mathematics, Science, Engineering& Computer Science.
PO 2 Problem Analysis: To identify, formulate & analyze
requirements of IT Applications.
PO 3 Design/Development of Solutions: To effectively apply
engineering principles to the design of computer & IT based
Systems.
PO 4 Conduct Investigations of Complex Problems: To
synthesize research based knowledge in the design of
programming and analysis of data for providing valid
conclusions to complex problems.
PO 5 Modern Tool Usage: To possess skills for creating and
selecting modern software development tools.
PO 6 The Engineer and Society: To apply conceptual knowledge
relevant to professional engineering practices in societal,
health, safety, legal and cultural issues and their consequences.
PO 7 Environment and Sustainability: To understand the impact
of engineering solutions in social and economic environments
and work towards sustainable development.
PO 8 Ethics: To understand contemporary legal, social & ethical
issues in computing.
PO 9 Individual and Team Work: To effectively work as an
individual and adapt to a team environment.
PO 10 Communication: To communicate precisely and effectively
both in oral and written in all engineering activities.
PO 11 Project Management and Finance: To apply engineering and
management principles for managing and leading economically
feasible projects in multi-disciplinary environments as an
individual and team member.
PO 12 Life-Long Learning: To develop confidence to engage in
independent & lifelong learning in the context of Technological
changes.
(AUTONOMOUS)
INSTITUTE VISION
To become a center of quality education in Engineering and Technology
for women empowerment.
INSTITUTE MISSION
● To fulfill the academic aspirations of women engineers for
enhancing their intellectual capabilities and technical competency.
● To Leverage Leading – Edge Technologies and cultivate exemplary
work culture.
● To facilitate success in their desired career in the field of
engineering to build a progressive nation.
INSTITUTE QUALITY POLICY

G. Narayanamma Institute of Technology and Science (For Women),
Hyderabad is committed in imparting Quality Education and Training
for women empowerment in the field of “Engineering and Technology”
and to satisfy applicable requirements through continual improvement
of the Quality Management System by facilitating and supporting the
staff and students to work as a team in upgrading their knowledge and
skill in tune with the industrial and technological developments through
a set of Quality objectives.

Cse Syllabus 2019 4.7.2019

Uploaded by

Copyright:

Available Formats

Cse Syllabus 2019 4.7.2019

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse Syllabus 2019 4.7.2019

Uploaded by

Copyright:

Available Formats

ACADEMIC REGULATIONS

COMPUTER SCIENCE AND

B. TECH FOUR YEAR DEGREE COURSE

To provide engineering education in the field of Computer Science

● To pioneer education in Computer Science and Engineering,

COMPUTER SCIENCE AND

B. TECH FOUR YEAR DEGREE COURSE

B.TECH-ACADEMIC REGULATIONS – 2018

(i) HS (Humanities and Social Sciences including

4.0 Course Work

SGPA = …. For each Semester

ACADEMIC REGULATIONS - 2018

(b) Gives assistance or guidance or Expulsion from the examination

police and a case is registered

person on dutyin or outside the

9. If student of the college, who is Student of the colleges expulsion

Expulsion from the examina-

11. Copying detected on the basis of Cancellation of the performance

12. If any malpractice is detected

i) Use a function to display the employee information who are

UNIT 4: (~10 Lecture Hours)

12.Write a C Program to solve a given differential equation using Runge-

II Year B.Tech. CSE I-Semester L T P C

UNIT 5: (~8 Lecture Hours)

UNIT 4: (~10 Lecture Hours)

b. Data Processing: Features to be covered, Importing data from

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

II Year B.Tech. CSE II-Semester L T P C

III Year B.Tech. CSE I-Semester L T P C

Human Resource Management: Talent Management – Importance - Human

III Year B.Tech. CSE I-Semester L T P C

III Year B.Tech. CSE I-Semester L T P C

III Year B.Tech. CSE I-Semester L T P C

2. Prerequisites for Effective Writing: Lexical Resource: Vocabulary in

3. Sanjay Kumar and PushpLata, Communication Skills, Oxford Higher

IV Year B.Tech. CSE I-Semester L T P C

UNIT 4: (~9 Lecture Hours)

III Year B.Tech. I-Semester L T P C

UNIT 5: (~8 Lecture Hours)

III Year B.Tech. I-Semester L T P C

Multithreading: Differences between thread-based multitasking and

III Year B.Tech. I-Semester L T P C

frequency response of BJT Amplifiers, effect of coupling and bypass

UNIT 5: (~8 Lecture Hours)

III Year B.Tech. I-Semester L T P C

UNIT 5: (~9 Lecture Hours)

UNIT 5: (~10 Lecture Hours)

III Year B.Tech. II-Semester L T P C

Peterson’s solution, Synchronization Hardware, Semaphores, Classic

2. Gary J. Nutt and Addison, Operating Systems: A Modern Perspective,

III Year B.Tech. II-Semester L T P C

2. Barun and K. Mitra, Personality Development and Soft Skills,

IV Year B. Tech. I-Semester L T P C

Functions, Copying Lists, Processing Lists, Two-Dimensional Lists,