R18 Cse CS Syllabus

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY
(An Autonomous Institution under UGC, New Delhi)

(Permanently Affiliated to JNTUH, Approved by AICTE, New Delhi, Accredited by NAAC and Accredited by NBA)
Sheriguda Village, Ibrahimpatnam Mandal, Ranga Reddy Dist. – 501 510
BACHELOR OF TECHNOLOGY
COMPUTER SCIENCE & ENGINEERING
CHOICE BASED CREDIT SYSTEM (CBCS)

ACADEMIC REGULATIONS, COURSE STRUCTURE AND
SYLLABI FOR II, III & IV YEARS
UNDER AUTONOMOUS STATUS FOR THE BATCHES
ADMITTED FROM THE ACADEMIC YEAR 2018 - 19
B.Tech. Regular Four Year Degree Programme

(For the batches admitted from the academic year 2018–19)
&
B.Tech. (Lateral Entry Scheme)
(For the batches admitted from the academic year 2019 - 20)
Note: The regulations here under are subject to amendments as may be made
by the Academic Council of the College from time to time. Any or all such
amendments will be effective from such date and to such batches of candidates
(including those already undergoing the program) as may be decided by the
Academic Council.

Vision of the Institute

To be a premier institution in engineering
& technology and management for
competency, values and social
consciousness
Mission of the Institute

IM1: Provide high quality academic programs,
training activities and research facilities.
IM2: Promote continuous industry – institute
interaction aimed at promoting employability,
entrepreneurship, leadership and research
aptitude among stakeholders
IM3: Contribute the economic and technological
development of the region, state and Nation.
SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 2


VISION of the Department

To be a technologically adaptive centre for
computing by grooming the students as top notch
professionals.
MISSION of the Department

DM1: To offer quality education in computing.
DM2: To provide an environment that enables overall
development of all the stakeholders.
DM3: To impart training on emerging technologies like
Data Analytics, Artificial Intelligence and Internet
of Things.
DM4: To encourage participation of stakeholders in research
and development.

PROGRAM OUTCOMES (POs):

PO1 Engineering Knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
PO2 Problem Analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
PO3 Design / Development of Solutions: Design solutions for complex
engineering problems and design system components or processes that meet
the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid
conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities
with the engineering community and with society at large, such as, being able
to comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply these
to one’s own work, as a member and leader in a team, to manage projects and
in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest context of
technological change.

PROGRAM SPECIFIC OUTCOMES (PSOs):

To develop software projects using standard practices
PSO1 and suitable programming environment.
To identify, formulate and solve the real life problems

faced in the society, industry and other areas by
PSO2 applying the skills of the programming languages,
networks and databases learned.
To apply computer science knowledge in exploring and

PSO3 adopting latest technologies in various inter-disciplinary
research activities.
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO1: Higher Studies: Graduate with an ability to pursue higher
studies and get employment in reputed institutions and
organizations.
PEO2: Domain Knowledge: Graduate with an ability to design and

develop a product.
PEO3: Professional Career: Graduate with excellence by multidisciplinary

approach to achieve successful professional career.
PEO4: Life Long Learning: Graduate with an ability to learn advanced

skills to face professional competence through life long learning.


ACADEMIC REGULATIONS 2018 (BR-18) FOR CHOICE BASED CREDIT
SYSTEM (CBCS) B.TECH. DEGREE COURSES
(Applicable for Students admitted from the academic year 2018-2019)
PRELIMINARY DEFINITIONS AND NOMENCLATURES
 “Autonomous Institute / College” means an institute / college designated as

autonomous institute / college by the UGC, New Delhi and JNTUH Statutes,
2014.
 “Academic Autonomy” means freedom to a College in all aspects of

conducting its academic programs granted by the University for promoting
excellence.
 “Commission” means University Grants Commission (UGC), New Delhi.
 “AICTE” means All India Council for Technical Education.
 “University” means the Jawaharlal Nehru Technological University, Hyderabad.
 “College” means SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY ,

Hyderabad unless indicated otherwise by the context.
 “Program” means: Bachelor of Technology (B.Tech) degree program
 “Branch” means specialization in a program like B.Tech degree

program in Information Technology, B.Tech degree program in Computer
Science and Engineering etc
 “Course” or “Subject” means a theory or practical subject, identified by its course

– number and course-title, which is normally studied in a semester. For
example, R18MTH1101: Mathematics - I, R18MED1102 Engg. Graphics etc.
 T – Tutorial, P – Practical, D – Drawing, L - Theory, C – Credits


ACADEMIC REGULATIONS 2018 (BR-18) FOR CHOICE BASED CREDIT SYSTEM (CBCS)
B.TECH. DEGREE COURSES
(Applicable for Students admitted from the academic year 2018-2019)
1.0 Under-Graduate Degree Programme in Engineering & Technology
Sri Indu College of Engineering & Technology (Autonomous) offers a 4-year (8 semesters)
Bachelor of Technology (B.Tech.) degree programme, under Choice Based Credit System
(CBCS) with effect from the academic year 2018-19.
2.0 Eligibility for admission
2.1 Admission to the under graduate (UG) programme shall be made either on the
basis of the merit rank obtained by the qualified student in entrance test conducted
by the Telangana State Government (EAMCET) or the College or on the basis of
any other order of merit approved by the College, subject to reservations as
prescribed by the government from time to time.
2.2 The medium of instructions for the entire under graduate programme in
Engineering & Technology will be English only.
3.0 B.Tech. Programme structure
3.1 A student after securing admission shall complete the B.Tech. programme in a
minimum period of four academic years (8 semesters), and a maximum period of eight
academic years (16 semesters) starting from the date of commencement of first year first
semester, failing which student shall forfeit seat in B.Tech course. Each student shall
secure 160 credits (with CGPA ≥ 5) required for the completion of the under graduate
programme and award of the B.Tech. degree.
3.2 UGC/ AICTE specified definitions/ descriptions are adopted appropriately for various
terms and abbreviations used in these academic regulations/ norms, which are listed
below.
3.2.1 Semester scheme
Each under graduate programme is of 4 academic years (8 semesters) with the
academic year divided into two semesters of 22 weeks (≥ 90 instructional days) each,
each semester having - ‘Continuous Internal Evaluation (CIE)’ and ‘Semester End
Examination (SEE)’ under Choice Based Credit System (CBCS) and Credit Based
Semester System (CBSS) indicated by UGC, and curriculum/course structure as
suggested by AICTE are followed.

3.2.2 Credit courses
All subjects/ courses are to be registered by the student in a semester to earn credits
which shall be assigned to each subject/ course in an 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 or
Tutorials.
 One credit for two hours/ week/ semester for laboratory/ practical (P) courses.
Courses like Environmental Science, Constitution of India, Intellectual Property Rights,

and Gender Sensitization lab are mandatory courses. These courses will not carry any
credits.
3.2.3 Subject Course Classification
All subjects/ courses offered for the under graduate programme in E&T (B.Tech. degree
programmes) are broadly classified as follows. The College has followed almost all the
guidelines issued by AICTE/UGC.
S. Broad Course Course Group/
Course Description
No. Classification Category
1 BS – Basic Sciences Includes mathematics, physics and chemistry
subjects
Foundation ES - Engineering
2 Courses Includes fundamental engineering subjects
Sciences
(FnC)
HS – Humanities and Includes subjects related to humanities, social
3 Social sciences sciences and management
Core Courses PC – Professional Includes core subjects related to the parent
4 discipline/ department/ branch of Engineering.
(CoC) Core
PE – Professional Includes elective subjects related to the parent
5 discipline/ department/ branch of Engineering.
Electives
Elective
Course Elective subjects which include inter-
s (EℓC) disciplinary subjects or subjects in an area
6 OE – Open Electives outside the parent discipline/ department/
branch of Engineering.
B.Tech. project or UG project or UG major
7 Project Work project or Project Stage I & II
Core Courses Industrial training/ Industrial training/ Summer Internship/
8
Mini- project Industrial Oriented Mini-project/ Mini-project
Seminar/ Colloquium based on core
9. Seminar contents related to parent discipline/
department/ branch of Engineering.
10 Minor courses - 1 or 2 Credit courses (subset of HS)
Mandatory
11 - Mandatory courses (non-credit)
Courses (MC)

4.0 Course registration

4.1 A ‘faculty advisor or counselor’ shall be assigned to a group of 20 students, who will
advise the students about the under graduate programme, its course structure and
curriculum, choice/option for subjects/ courses, based on their competence,
progress, pre-requisites and interest.
4.2 The academic section of the college invites ‘registration forms’ from students before
the beginning of the semester through ‘registration’, ensuring ‘date and time
stamping’. The registration requests for any ‘current semester’ shall be completed
before the commencement of SEEs (Semester End Examinations) of the
‘preceding semester’.
4.3 A student can apply for registration, only after obtaining the ‘written approval’ from
faculty advisor/counselor, which should be submitted to the college academic
section through the Head of the Department. A copy of it shall be retained with Head
of the Department, faculty advisor/ counselor and the student.
4.4 A student may be permitted to register for all the subjects/ courses in a semester as
specified in the course structure with maximum additional subject(s)/course(s)
limited to 4 credits, based on progress and SGPA/ CGPA, and completion of the
‘pre- requisites’ as indicated for various subjects/ courses, in the department
course structure and syllabus contents.
4.5 Choice for ‘additional subjects/ courses’ must be clearly indicated, which needs the
specific approval and signature of the faculty advisor/ counselor.
4.6 If the student submits ambiguous choices or multiple options or erroneous entries
during 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 will be taken into consideration.
4.7 Subject/ course options exercised through registration are final and cannot be
changed or inter-changed; further, alternate choices also will not be 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 due to any unforeseen
or unexpected 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). Such alternate arrangements will be made
by the head of the department, with due notification and time-framed schedule,
within the first week after the commencement of class-work for that semester.
4.8 Dropping of subjects/ courses may be permitted, only after obtaining prior approval
from the faculty advisor/ counselor ‘within a period of 15 days’ from the beginning of
the current semester.
4.9 Open electives: The students have to choose three open electives (OE-I, II & III)
from the list of open electives given. However, the student cannot opt for an open
elective subject offered by his own (parent) department, if it is already listed under
any category of the subjects offered by parent department in any semester.
4.10 Professional electives: The students have to choose six professional electives (PE-I
toVI) from the list of professional electives given.

5.0 Subjects/ courses to be offered

5.1 A typical section (or class) strength for each semester shall be 60.
5.2 A subject/ course may be offered to the students, only if a minimum of 20 students
(1/3 of the section strength) opt for it. The maximum strength of a section is limited to
80 (60 + 1/3 of the section strength).
5.3 More than one faculty member may offer the same subject (lab/ practical may be
included with the corresponding theory subject in the same semester) in any
semester. However, selection of choice for students will be based on - ‘first come
first serve basis and CGPA criterion’ (i.e. the first focus shall be on early on-line
entry from the student for registration in that semester, and the second focus, if
needed, will be on CGPA of the student).
5.4 If more entries for registration of a subject come into picture, then the Head of the
Department concerned shall decide, whether or not to offer such a subject/ course for
two (or multiple) sections.
5.5 In case of options coming from students of other departments/ branches/ disciplines
(not considering open electives), first priority shall be given to the student of the
‘parent department’.
6.0 Attendance requirements:
6.1 A student shall be eligible to appear for the semester end examinations, if the student
acquires a minimum of 75% of attendance in aggregate of all the subjects/ courses
(excluding attendance in mandatory courses like Environmental Science,
Constitution of India, Intellectual Property Rights, and Gender Sensitization lab) for
that semester. Two periods of attendance for each theory subject shall be
considered, if the student appears for the mid-term examination of that subject. This
attendance should also be included in the fortnightly upload of attendance to
the College. The attendance of Mandatory Non-Credit courses should be uploaded
separately to the College.
6.2 Shortage of attendance in aggregate up to 10% (65% and above, and below 75%) in
each semester may be condoned by the college academic committee on genuine
and valid grounds, based on the student’s representation with supporting evidence.
6.3 A stipulated fee shall be payable for condoning of shortage of attendance.
6.4 Shortage of attendance below 65% in aggregate shall in no case be condoned.
6.5 Students whose shortage of attendance is not condoned in any semester are not
eligible to take their end examinations of that semester. They get detained and their
registration for that semester shall stand cancelled. They will not be promoted to the
next semester. They may seek re-registration for all those subjects registered in that
semester in which the student is detained, by seeking re-admission into that
semester as and when offered; 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 category.
6.6 A student fulfilling the attendance requirement in the present semester shall not be
eligible for readmission into the same class.

7.0 Academic requirements

The following academic requirements have to be satisfied, in addition to the attendance
requirements mentioned in item no.6.
7.1 A student shall be deemed to have satisfied the academic requirements and earned
the credits allotted to each subject/ course, if student secures not less than 35% (25
marks out of 70 marks) in the semester end examination, and a minimum of 40% (40
marks out of 100 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.
7.2 A student shall be deemed to have satisfied the academic requirements and earned
the credits allotted to Industrial Oriented Mini Project/Summer Internship and
seminar, if the student secures not less than 40% marks (i.e. 40 out of 100 allotted
marks) in each of them. The student is deemed to have failed, if he (i) does not
submit a report on Industrial Oriented Mini Project/Summer Internship, or does not
make a presentation of the same before the evaluation committee as per schedule,
or (ii) does not present the seminar as required in the IV year I Semester, or (iii)
secures less than 40% marks in Industrial Oriented Mini Project/Summer Internship
and seminar evaluations.
A student may reappear once for each of the above evaluations, when they are
scheduled again; if the student fails in such ‘one reappearance’ evaluation also, the
student has to reappear for the same in the next subsequent semester, as and when
it is scheduled.
7.3 Promotion Rules
S. No. Promotion Conditions to be fulfilled
1 First year first semester to Regular course of study of first year first
first year second semester semester.
2 First year second semester i. Regular course of study of first year
to second year first second semester.
semester
ii. Must have secured at least 18 credits
out of 37 credits i.e., 50% credits up to
first year second semester from all the
relevant regular and supplementary
examinations, whether the student
takes those examinations or not.
3. Second year first semester Regular course of study of second year
to second year second first semester.
semester
4 Second year second i. Regular course of study of second year
semester to third year first second semester.
semester ii. Must have secured at least 47 credits
out of 79 credits i.e., 60% credits up to
second year second semester from all
the relevant regular and supplementary
examinations, whether the student
takes those examinations or not.
5 Third year first semester to Regular course of study of third year first
third year second semester semester.

6 Third year second semester (i) Regular course of study of third year
to fourth year first semester second semester.
(ii) Must have secured at least 73 credits
out of 123 credits i.e., 60% credits up
to third year second semester from
all the relevant regular and
supplementary examinations,
whether the student takes those
examinations or not.
7 Fourth year first semester Regular course of study of fourth year
to fourth year second first semester.
semester
7.4 A student (i) shall register for all courses/subjects covering 160 credits as specified
and listed in the course structure, (ii) fulfills all the attendance and academic
requirements for 160 credits, (iii) earn all 160 credits by securing SGPA ≥ 5.0 (in
each semester), and CGPA (at the end of each successive semester) ≥ 5.0, (iv)
passes all the mandatory courses, to successfully complete the under graduate
programme. The performance of the student in these 160 credits shall be taken into
account for the calculation of ‘the final CGPA (at the end of under graduate
programme), and shall be indicated in the grade card of IV year II semester.
7.5 If a student registers for ‘extra 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 his department, the performances in
those ‘extra subjects’ (although evaluated and graded using the same procedure as
that of the required 160 credits) will not be taken into account while calculating the
SGPA and CGPA. For such ‘extra subjects’ registered, percentage of marks and
letter grade alone will be indicated in the grade card as a performance measure,
subject to completion of the attendance and academic requirements as stated in
regulations 6 and 7.1 – 7.4 above.
7.6 A student eligible to appear in the semester end examination for any subject/ course,
but absent from it or failed (thereby failing to secure ‘C’ grade or above) may
reappear for that subject/ course in the supplementary examination as and when
conducted. In such cases, internal marks (CIE) assessed earlier for that subject/
course will be carried over, and added to the marks to be obtained in the SEE
supplementary examination for evaluating performance in that subject.
7.7 A student detained in a semester due to shortage of attendance may be re-
admitted in the same semester in the next academic year for fulfillment of
academic requirements. The academic regulations under which a student has been
readmitted shall be applicable. However, no grade allotments or SGPA/ CGPA
calculations will be done for the entire semester in which the student has been
detained.
7.8 A student detained due to lack of credits, shall be promoted to the next academic
year only after acquiring the required academic credits. The academic regulations
under which the student has been readmitted shall be applicable to him.

8.0 Evaluation - Distribution and Weightage of marks

8.1 The performance of a student in each semester shall be evaluated subject– wise with
a maximum of 100 marks for theory and 75 marks for practical subjects. In addition,
an Industry oriented mini- project, Technical Seminar, Comprehensive viva-voce, and
Main Project Work shall be evaluated for 50, 50, 100 and 200 marks respectively.
8.2 For theory subjects the distribution shall be 30 marks for Internal Evaluation and 70
marks for the End-Examination, Two mid examinations will be conducted in each
semester as per the academic calendar. Each mid examination is evaluated for 25
marks. First mid examination should be conducted for 1 – 2 ½ Units of syllabus and
the second mid examination shall be conducted for 2 ½ - 5 Units of syllabus. The
mid descriptive type exam paper consists of Section-A and Section-B.
Section-A [compulsory] consists of 5 short answer questions and each
carries one mark.
Section-B consists of 6 questions out of which 4 are to be answered

and each question carries 5 marks. The time duration of each
mid examination is 90 minutes.
Two assignments are to be given to students covering the syllabus of first mid and second
Mid examinations and these assignments and Attendance are evaluated for 5 marks each.
The first assignment shall be submitted before first mid examinations and second
Assignment should be submitted before second mid examination.
At the end of the semester Internal Marks Maximum of 30 for the respective subjects are
allotted as follows:
a) 25 marks for the average of the two mid term examinations
b) 5 marks of the average of the two assignment marks & Attendance
 Award of final sessional marks : Subject-wise attendance, average marks of two

assignments and mid-examination marks will be added and rounded of to the next Integer.
8.2.1 For practical subjects there shall be a continuous evaluation during the semester for
25 sectional marks and 50 marks for end examination. Out of the 25 marks for
internal, day-to-day work in the laboratory shall be evaluated for 10 marks, and 10
marks for internal examination (two internal practical examinations will be conducted
and the average of the two examinations will be taken into account) and 5 marks for
laboratory record.
NOTE: A student who is absent for any assignment/Mid term examination for any
reason what so ever shall be deemed to have secured ‘zero’ marks in the
test/examination and no makeup test/examination shall be conducted.
8.2.2 For the subjects having 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 internal evaluation (15 marks for
day-to-day work and 15 marks for internal tests (the average of the two
examinations will be taken into account) and 70 marks for end examination.
There shall be two internal tests in a semester. The Internal and End Examination
pattern for the above subjects may be different from the other theory subjects.
8.2.3 There shall be an industry-oriented mini-Project, in collaboration with an
industry of their specialization, to be taken up during the vacation after III year II
Semester examination. The mini project shall be evaluated during the IV year II
Semester. The industry oriented mini project shall be submitted in report form and
should be presented before a committee, which shall be evaluated for 50 marks. The
committee consists of Head of the Department, the supervisor of mini project and a
senior faculty member of the department and External Examiner.
8.2.4 There shall be a seminar presentation in IV year II Semester. For the seminar, the
student shall collect the information on a specialized topic other than the project
topic and prepare a technical report, showing his understanding of the topic, and
submit to the department, which shall be evaluated by a Departmental committee
consists of the Head of the department, seminar supervisor and a senior faculty
member. The seminar report shall be evaluated for 50 marks. There shall be no
external examination for seminar.
8.2.5 There shall be a Comprehensive Viva-Voce in IV year I semester. The

Comprehensive Viva-Voce will be conducted by a Committee consisting of the Head
of the Department and three Senior Faculty members of the Department. The
Comprehensive Viva-Voce is aimed to assess the student’s understanding in
various subjects studied during the B.Tech. course of study. The Comprehensive
Viva-Voce is evaluated for 100 marks by the Committee. There will be no internal
assessment for the Comprehensive viva-voce.
8.3 The Project work shall be started by the student in the beginning of the IV year
II Semester. Out of a total of 200 marks for the project work, 50 marks shall be for
Internal Evaluation and 150 marks for the Semester end Examination. The Semester
end Examination (viva-voce) shall be conducted by a committee comprising of an
external examiner, Head of the Department and the project supervisor. The
evaluation of project work shall be conducted at the end of the IV year II Semester.
The Internal Evaluation shall be on the basis of three seminars conducted during the
IV year II semester for 20 marks by the committee consisting of Head of the
Department, project supervisor and senior faculty member of the Department and for
30 marks by the supervisor of the project.
8.4 Semester End Examination
(a) Theory Courses
Each course is evaluated for 70 marks. Examination is of 3 hours duration.
Question paper contains two sections [Section-A and Section-B]
Section-A : This Section Carries 20 marks [Five short answer questions of
four marks each and only one question to be set from any five units] which is
compulsory.

Section-B: This Section carries 50 marks with 5 questions consisting of two

parts each (a) and (b), out of which the student has to answer either (a) or (b),
not both. Each question in Part B carries 10 marks.
(b) Practical Courses

Each lab course is evaluated for 50 marks. The examination shall be
conducted by the laboratory teacher and another senior teacher concerned
with the subject of the same/other department/Industry. The external
examiner may be appointed by the Chief Superintendent in consultation with
HOD as and when required.
(c) Supplementary Examinations

Supplementary examinations will be conducted along with regular semester
end examinations. (during even semester regular examinations,
supplementary examinations of odd semester and during odd semester
regular examinations, supplementary examinations of even semester will be
conducted).
8.5 The laboratory marks and the internal marks awarded by the college are subject to
scrutiny and scaling by the College wherever necessary. In such cases, the internal
and laboratory marks awarded by the college will be referred to a committee. The
committee will arrive at a scaling factor and the marks will be scaled accordingly. The
recommendations of the committee are final and binding. The laboratory records and
internal test papers shall be preserved in the College as per the College rules and
produced before the committees of the College as and when asked for.
8.6 For mandatory courses of Environmental Science, Constitution of India, Intellectual
Property Rights, and Gender Sensitization lab, a student has to secure 40 marks out
of 100 marks (i.e. 40% of the marks allotted) in the continuous internal evaluation for
passing the subject/course. These marks should also be uploaded along with the
internal marks of other subjects.
8.7 No marks or letter grades shall be allotted for mandatory/non-credit courses. Only
Pass/Fail shall be indicated in Grade Card.
9.0 Grading procedure
9.1 Grades will be awarded to indicate the performance of students in each theory subject,
laboratory / practicals, seminar, Industry Oriented Mini Project, and project Stage - I
& II. Based on the percentage of marks obtained (Continuous Internal Evaluation plus
Semester End Examination, both taken together) as specified in item 8 above, a
corresponding letter grade shall be given.
9.2 As a measure of the performance of a student, a 10-point absolute grading system
using the following letter grades (as per UGC/AICTE guidelines) and corresponding
percentage of marks shall be followed:

% of Marks Secured in a Letter Grade Grade

Subject/Course (Class Intervals) (UGC Guidelines) Points
Greater than or equal to 90% O (Outstanding) 10
80 and less than 90% A+ (Excellent) 9
70 and less than 80% A (Very Good) 8
60 and less than 70% B+ (Good) 7
50 and less than 60% B (Average) 6
40 and less than 50% C (Pass) 5
Below 40% F (FAIL) 0
Absent Ab 0
9.3 A student who has obtained an ‘F’ grade in any subject shall be deemed to have
‘failed’ and is required to reappear as a ‘supplementary student’ in the semester end
examination, as and when offered. In such cases, internal marks in those subjects
will remain the same as those obtained earlier.
9.4 To a student who has not appeared for an examination in any subject, ‘Ab’ grade will
be allocated in that subject, and he is deemed to have ‘failed’. A student will be
required to reappear as a ‘supplementary student’ in the semester end examination,
as and when offered next. In this case also, the internal marks in those subjects will
remain the same as those obtained earlier.
9.5 A letter grade does not indicate any specific percentage of marks secured by the
student, but it indicates only the range of percentage of marks.
9.6 A student earns grade point (GP) in each subject/ course, on the basis of the letter
grade secured in that subject/ course. The corresponding ‘credit points’ (CP) are
computed by multiplying the grade point with credits for that particular subject/
course.
Credit points (CP) = grade point (GP) x credits …. For a course

9.7 A student passes the subject/ course only when GP ≥ 5 (‘C’ grade or above)
9.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
i=1
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.
9.9 The Cumulative Grade Point Average (CGPA) is a measure of the overall cumulative
performance of a student in all semesters considered for registration. The CGPA is
the ratio of the total credit points secured by a student in all registered courses in all

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 II
semester onwards at the end of each semester as per the formula
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’ i.e., from the 1 st
semester onwards up to and inclusive of the 8 th semester, ‘j’ is the subject indicator
index (takes into account all subjects from 1 to 8 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 jth subject. After registration and completion of I year I
semester, the SGPA of that semester itself may be taken as the CGPA, as there are no
cumulative effects.
Illustration of calculation of SGPA:
Course/Subject Credits Letter Grade Grade Points Credit Points

Course 1 4 A 8 4 x 8 = 32
Course 2 4 O 10 4 x 10 = 40
Course 3 4 C 5 4 x 5 = 20
Course 4 3 B 6 3 x 6 = 18
Course 5 3 A+ 9 3 x 9 = 27
Course 6 3 C 5 3 x 5 = 15
21 152
SGPA = 152/21 = 7.24
Illustration of calculation of CGPA up to 3 rd semester:
Course/Subject Credits Letter Grade Corresponding Credit

Semester
Title Allotted Secured Grade Point (GP) Point (CP)
I Course 1 3 A 8 24
I Course 2 3 O 10 30
I Course 3 3 B 6 18
I Course 4 4 A 8 32
I Course 5 3 A+ 9 27
I Course 6 4 C 5 20
II Course 7 4 B 6 24
II Course 8 4 A 8 32
II Course 9 3 C 5 15
II Course 10 3 O 10 30
II Course 11 3 B+ 7 21
II Course 12 4 B 6 24
II Course 13 4 A 8 32

II Course 14 3 O 10 30
III Course 15 2 A 8 16
III Course 16 1 C 5 5
III Course 17 4 O 10 40
III Course 18 3 B+ 7 21
III Course 19 4 B 6 24
III Course 20 4 A 8 32
III Course 21 3 B+ 7 21
Total Credit
Total Credits 69 518
Points
CGPA = 518/69 = 7.51
The above illustrated calculation process of CGPA will be followed for each
subsequent semester until 8th semester. The CGPA obtained at the end of 8th
semester will become the final CGPA secured for entire B.Tech. Programme.
9.10 For merit ranking or comparison purposes or any other listing, only the ‘rounded off’
values of the CGPAs will be used.
9.11 SGPA and CGPA of a semester will be mentioned in the semester Memorandum of
Grades if all subjects of that semester are passed in first attempt. Otherwise the
SGPA and CGPA shall be mentioned only on the Memorandum of Grades in which
sitting he passed his last exam in that semester. However, mandatory courses will
not be taken into consideration.
10.0 Issue of Grade Card:
After the completion of each semester, a grade card or grade sheet shall be issued to
all the registered students of that semester, indicating the letter grades and credits
earned. It will show the details of the courses registered (course code, title, no. of
credits, grade earned, etc.), credits earned.
11.0 Declaration of results
11.1 Computation of SGPA and CGPA are done using the procedure listed in 9.6 to 9.9.
11.2 For final percentage of marks equivalent to the computed final CGPA, the following
formula may be used.
% 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 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 B.Tech. degree in the chosen branch of
Engineering selected at the time of admission.

12.2 A student who qualifies for the award of the degree as listed in item 12.1 shall be
placed in the following classes.
12.3 A student with final CGPA (at the end of the under graduate programme) ≥ 8.00, and
fulfilling the following conditions - shall be placed in ‘first class with distinction’.
However, he
(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 first year first semester.
(ii) Should have secured a CGPA ≥ 8.00, at the end of each of the 8 sequential
semesters, starting from I year I semester onwards.
(iii) Should not have been detained or prevented from writing the semester end
examinations in any semester due to shortage of attendance or any other
reason.
A student not fulfilling any of the above conditions with final CGPA ≥ 8 shall be placed in ‘first
class’.
12.4 Students with final CGPA (at the end of the under graduate programme) ≥ 6.50 but <
8.00 shall be placed in ‘first class’.
12.5 Students with final CGPA (at the end of the under graduate programme) ≥ 5.50 but <
6.50, shall be placed in ‘second class’.
12.6 All other students who qualify for the award of the degree (as per item 12.1), with final
CGPA (at the end of the under graduate programme) ≥ 5.00 but < 5.50, shall be
placed in ‘pass class’.
12.7 A student with final CGPA (at the end of the under graduate programme) < 5.00 will
not be eligible for the award of the degree.
12.8 Students fulfilling the conditions listed under item 12.3 alone will be eligible for award
of ‘Gold Medal’ / College Toppers.
13.0 Withholding of results
13.1 If the student has not paid the fees to the College at any stage, or has dues pending
due to any reason whatsoever, or if any case of indiscipline is pending, the result of
the student may be withheld, and the student will 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 Student transfers
14.1 There shall be no branch transfers after the completion of admission process.
14.2 There shall be no transfers from one college/stream to another within the constituent
colleges and units of Sri Indu College of Engineering & Technology.

14.3 The students seeking transfer to colleges affiliated to JNTUH with special directions of
GAD / JNTUH from various other Universities/institutions have to pass the failed
subjects which are equivalent to the subjects of JNTUH, and also pass the subjects
of JNTUH which the students have not studied at the earlier institution. Further,
though the students have passed some of the subjects at the earlier institutions, if the
same subjects are prescribed in different semesters of JNTUH, the students have to
study those subjects in JNTUH in spite of the fact that those subjects are repeated.
14.4 The transferred students from other Universities/institutions to Sri Indu college who
are on rolls are to be provided one chance to write the CBT (internal marks) in the
equivalent subject(s) as per the clearance letter issued by the University.
14.5 The Sri Indu College of Engineering & Technology (Autonomous) will provide one
chance to write the internal examinations in the equivalent subject(s) to the
students transferred from other universities/institutions who are on rolls, as per the
clearance (equivalence) letter issued by the University.
15.0 Scope
15.1 The academic regulations should be read as a whole, for the purpose of any
interpretation.
15.2 In case of any doubt or ambiguity in the interpretation of the above rules, the decision
of the College Academic Council is final.
15.3 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
students with effect from the dates notified by the College authorities.
15.4 Where the words “he”, “him”, “his”, occur in the regulations, they include “she”, “her”,
“hers”.
*********

ACADEMIC REGULATIONS FOR B.TECH. (LATERAL ENTRY SCHEME)

FROM THE AY 2019-20
1. Eligibility for award of B. Tech. Degree (LES)
The LES students after securing admission shall pursue a course of study
for not less than three academic years and not more than six academic
years.
2. The student shall register for 123 credits and secure 123 credits with CGPA ≥
5 from II year to IV year B.Tech. programme (LES) for the award of B.Tech.
degree.
3. The students, who fail to fulfill the requirement for the award of the degree in
six academic years from the year of admission, shall forfeit their seat in
B.Tech.
4. The attendance requirements of B. Tech. (Regular) shall be applicable to
B.Tech. (LES).
5. Promotion rule
S. No Promotion Conditions to be fulfilled

1 Second year first semester to Regular course of study of second year
second year second semester first semester.
2 Second year second semester to (i) Regular course of study of second

third year first semester year second semester.
(ii) Must have secured at least 25
credits out of 42 credits i.e., 60%
credits up to second year second
semester from all the relevant regular
and supplementary examinations,
3 Third year first semester to third Regular course of study of third year
year second semester first semester.
4 Third year second semester to (i) Regular course of study of third year
fourth year first semester second semester.
(ii) Must have secured at least 51
credits out of 86 credits i.e., 60%
credits up to third year second
semester from all the relevant regular
and supplementary examinations,
5 Fourth year first semester to fourth Regular course of study of fourth year
year second semester first semester.
6. All the other regulations as applicable to B. Tech. 4-year degree course
(Regular) will hold good for B. Tech. (Lateral Entry Scheme).

MALPRACTICES RULES
DISCIPLINARY ACTION FOR / IMPROPER CONDUCT IN EXAMINATIONS
Nature of Malpractices/Improper conduct Punishment
If the student:
Possesses or keeps accessible in
examination hall, any paper, note book,
programmable calculators, cell phones,
pager, palm computers or any other form of
material concerned with or related to the
subject of the examination (theory or Expulsion from the examination hall and
1. (a) practical) in which student is appearing but cancellation of the performance in that
has not made use of (material shall include subject only.
any marks on the body of the student which
can be used as an aid in the subject of the
examination)
Gives assistance or guidance or receives it
from any other student orally or by any other Expulsion from the examination hall and
body language methods or communicates cancellation of the performance in that
(b) through cell phones with any student or subject only of all the students involved. In
persons in or outside the exam hall in respect case of an outsider, he will be handed over
of any matter. to the police and a case is registered
against him.
Has copied in the examination hall from any Expulsion from the examination hall and
paper, book, programmable calculators, palm cancellation of the performance in that
2. computers or any other form of material subject and all other subjects the student
relevant to the subject of the examination has already appeared including practical
(theory or practical) in which the student is examinations and project work and shall
appearing. not be permitted to appear for the
remaining examinations of the subjects of
that semester/year.
The hall ticket of the student is to be
cancelled and sent to the College.
The student who has impersonated shall
be expelled from examination hall. The
student is also debarred and forfeits the
seat. The performance of the original
student who has been impersonated, shall
be cancelled in all the subjects of the
examination (including practicals and
project work) already appeared and shall
3. Impersonates any other student in not be allowed to appear for examinations
connection with the examination. of the remaining subjects of that
semester/year. The student is also
debarred for two 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. If the imposter is an outsider, he will
be handed over to the police and a case is
registered against him.

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

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

Copying detected on the basis of internal subject and all other subjects the student
11. evidence, such as, during valuation or during has appeared for including practical
special scrutiny. examinations and project work of that
semester/year examinations.
If any malpractice is detected which is not
covered in the above clauses 1 to 11 shall be
12. reported to the College for further action to
award a suitable punishment.

Frequently asked Questions and Answers about autonomy

1. Who grants Autonomy? UGC, Govt., AICTE or University
In case of Colleges affiliated to a university and where statutes for grant of
autonomy are ready, it is the respective University that finally grants autonomy.
2. Shall SICET award its own Degrees?
No. Degree will be awarded by Jawaharlal Nehru Technological University,
Hyderabad with a mention of the name SRI INDU COLLEGE OF ENGINEERING &
TECHNOLOGY on the Degree Certificate.
3. What is the difference between a Deemed University and an Autonomy
College?
A Deemed University is fully autonomous to the extent of awarding its own
Degree. A Deemed University is usually a Non-Affiliating version of a University and
has similar responsibilities like any University. An Autonomous College enjoys
Academic Autonomy alone. The University to which an autonomous college is
affiliated will have checks on the performance of the autonomous college.
4. How will the Foreign Universities or other stake – holders know that we are an
Autonomous College?
Autonomous status, once declared, shall be accepted by all the stake holders.
Foreign Universities and Indian Industries will know our status through our college
website.
5. What is the change of Status for Students and Teachers if we become
Autonomous?
An autonomous college carries a prestigious image. Autonomy is actually earned
out of continued past efforts on academic performances, capability of self-
governance and the kind of quality education we offer.
6. Who will check whether the academic standard is maintained / improved after
Autonomy? How will it be checked?
There is a built in mechanism in the autonomous working for this purpose. An
Internal Committee called Academic Programme Evaluation Committee is a Non –
Statutory body, which will keep a watch on the academics and keep its reports
and recommendations every year. In addition to Academic Council, the highest
academic body also supervises the academic matters. At the end of three years,
there is an external inspection by the University for this purpose. The standards of
our question papers, the regularity of academic calendar, attendance of
students, speed and transparency of result declaration and such other parameters
are involved in this process.
7. Will the students of SICET as an Autonomous College qualify for University
Medals and Prizes for academic excellence?
No, SICET has instituted its own awards, medals, etc. for the academic performance
of the students. However for all other events like sports, cultural and co-curricular
organized by the University the students shall qualify.

8. Can SICET have its own Convocation?

No, since the University awards the Degree the Convocation will be that of the
University.
9. Can SICET give a provisional degree certificate?
Since the examinations are conducted by SICET and the results are also
declared by SICET, the college sends a list of successful candidates with
their final percentage of marks to the University. Therefore with the prior
permission of the University the college will be entitled to give the provisional
certificate.
10. Will Academic Autonomy make a positive impact on the Placements or
Employability?
Certainly. The number of students qualifying for placement interviews is expected
to improve, due to rigorous and repetitive classroom teaching and continuous
assessment, besides the autonomous status is more responsive to the needs of
the industry. As a result, there will be a lot of scope for industry oriented skill
development built-in into the system. The graduates from an autonomous
college will therefore represent better employability.
11. What is the proportion of Internal and External Assessment as an Autonomous
College?
Presently, it is 30% for internal assessment and 70% for external assessment.
As the autonomy matures the internal assessment component shall be increased
at the cost of external assessment.
12. Will there be any Revaluation or Re-Examination System?
No. There will not be any Revaluation system or Re-examination. But,
there is a personal verification of the answer scripts.
13. How fast Syllabi can be and should be changed?
Autonomy allows us the freedom to change the syllabi as often as we need.
14. Will the Degree be awarded on the basis of only final year performance?
No. The percentage of marks will reflect the average performance of all
the semesters put together.
15. Who takes Decisions on Academic matters?
The Academic Council of College is the top academic body and is responsible
for all the academic decisions. Many decisions are also taken at the lower level
like the BOS which are like Boards of Studies of the University.
16. What is the role of Examination committee?
The Exam Committee is responsible for the smooth conduct of inter and external
examinations. All matters involving the conduct of examinations, spot
valuations, tabulations, preparation of Memorandum of Marks etc fall within the
duties of the Examination Committee.
17. Is there any mechanism for Grievance Redressal?
Yes, the college has grievance redressal committee, headed by a senior
faculty member of the college.

18. How many attempts are permitted for obtaining a Degree?

All such matters are defined in Rules & Regulations.
19. Who declares the result?
The result declaration process is also defined. After tabulation work the entire
result is reviewed by the Moderation Committee. Any unusual deviations or
gross level discrepancies are deliberated and removed. The entire result is
discussed in the College Academic Council for its approval. The result is then
declared on the college notice boards as well put on the web site of the college.
It is eventually sent to the University.
20. What is our relationship with the Jawaharlal Nehru Technological University,
Hyderabad?
We remain an affiliated college of the Jawaharlal Nehru Technological University,
Hyderabad. The University has the right to nominate its members on the academic
bodies of the college.
21. Shall we require University approval if we want to start any New Courses?
Yes, It is expected that approvals or such other matters from an autonomous
college will receive priority.
22. Shall we get autonomy for PG and Doctoral Programmes also?
Yes, presently our PG programmes are also enjoying autonomous status.
23. How many exams will be there as an autonomous college?
This is defined in the Rules & Regulations.
24 Is the College adapting Choice Based Credit System (CBCS) or Not ?
Yes, this College has adapted CBCS system with effect from the Academic Year
2016-17.
25. What is Choice Based Credit System (CBCS)?

Choice Based Credit System (CBCS): The CBCS provides choice for students to
select from the prescribed courses (core, elective or minor or soft skill courses).
******


Choice Based Credit System (CBCS)
REGULATIONS – R18
B. Tech. COMPUTER SCIENCE & ENGINEERING
Common to EEE, CSE & IT
I YEAR I SEMESTER COURSE STRUCTURE
S. No. Course Code Course Title L T P Credits
Mathematics – I
1 R18MTH1101 3 1 0 4
(Linear Algebra and Calculus)
2 R18ECH1101 Chemistry 3 1 0 4
3 R18EEE1130 Basic Electrical Engineering 3 0 0 3
4 R18MED1101 Engineering Workshop 1 0 3 2.5
5 R18HAS1101 English 2 0 0 2
6 R18ECH1201 Engineering Chemistry Lab 0 0 3 1.5
7 R18HAS1201 English Language and Communication Skills
lab 0 0 2 1
8 R18EEE1212 Basic Electrical Engineering Lab 0 0 2 1
9 R18HAS1102 Environmental Science 3 0 0 0
10 R18IPG1101 Induction Programme for Three Weeks 0 0 0 0
Total Credits 15 2 10 19
I YEAR II SEMESTER COURSE STRUCTURE

R18MTH1102 Mathematics – II
1
(Advanced Calculus) 3 1 0 4
2 R18EAP1101 Applied Physics
3 1 0 4
3 R18CSE1101 Programming for Problem Solving
3 1 0 4
4 R18MED1102 Engineering Graphics
1 0 4 3
5 R18EAP1201 Applied Physics Lab
0 0 3 1.5
6 R18CSE1201 Programming for Problem Solving Lab
0 0 3 1.5
7 R18COI1101 Constitution of India
3 0 0 0
8 R18ITK1101 Essence of Indian Traditional Knowledge
3 0 0 0


REGULATIONS – R18
II YEAR I SEMESTER COURSE STRUCTURE

1 R18ECE2105 Analog Electronics 3 0 0 3
2 R18CSE2101 Data Structures 3 1 0 4
3 R18MTH2102 Computer Oriented Statistical Methods 4 0 0 4
4 R18CSE2102 Computer Organization & Architecture 3 0 0 3
5 R18CSE2103 Object Oriented Programming using C++ 2 0 0 2
6 R18ECE21L4 Analog Electronics Lab 0 0 2 1
7 R18CSE21L1 Data Structures Lab 0 0 3 1.5
8 R18CSE21L2 IT Workshop Lab 0 0 3 1.5
9 R18CSE21L3 C++ Programming Lab 0 0 2 1
10 R18MAC2100 Gender Sensitization Lab 0 0 2 0
II YEAR II SEMESTER COURSE STRUCTURE

S.
Course Code Course Title L T P Credits
No.
1 R18CSE2201 Discrete Mathematics 3 0 0 3
2 R18ECE2102 Digital Logic Design 3 0 0 3
3 R18CSE2202 Operating Systems 3 0 0 3
4 R18CSE2203 Database Management Systems 3 1 0 4
5 R18CSE2204 Java Programming 3 1 0 4
6 R18CSE22L1 Operating Systems Lab 0 0 3 1.5
7 R18CSE22L2 Database Management Systems Lab 0 0 3 1.5
8 R18CSE22L3 Java Programming Lab 0 0 2 1
9 R18MAC2200 Intellectual Property Rights 3 0 0 0


REGULATIONS – R18
III YEAR I SEMESTER COURSE STRUCTURE

1 R18MBA2201 Business Economics & Financial Analysis 3 0 0 3
2 R18CSE3102 Software Engineering 3 0 0 3
3 R18CSE3103 Computer Networks 3 0 0 3
4 R18CSE3104 Web Technologies 3 0 0 3
5 Professional Elective-I 3 0 0 3
R18CSE3111 Advanced Computer Architecture
R18CSE3112 Formal Languages & Automata Theory
R18CSE3113 Principles of Programming Languages
6 Professional Elective -II 3 0 0 3
R18CSE3121 Advanced Operating Systems
R18CSE3122 Artificial Intelligence
R18CSE3123 Distributed Databases
7 R18CSE31L1 Software Engineering Lab 0 0 3 1.5
8 R18CSE31L2 Computer Networks & Web Technologies Lab 0 0 3 1.5
9 R18HAS31L1 Advanced Communication Skills Lab 0 0 2 1
10 R18MAC3100 MOOCs-I 0 0 2 0
III YEAR II SEMESTER COURSE STRUCTURE
1 R18CSE3201 Machine Learning 3 1 0 4

2 R18CSE3202 Compiler Design 3 1 0 4
3 R18CSE3203 Design and Analysis of Algorithms 3 1 0 4
4 Professional Elective –III 3 0 0 3
R18CSE3231Software Testing Methodologies
R18CSE3232Scripting Languages
R18CSE3233Mobile Application Development
5 Open Elective-I 3 0 0 3
6 R18CSE32L1 Machine Learning Lab 0 0 3 1.5
7 R18CSE32L2 Compiler Design Lab 0 0 3 1.5
8 R18CSE32L3 Professional Elective-III Lab 0 0 2 1
9 R18MAC3200 MOOCs-II 0 0 2 0
*MC - Environmental Science – Should be Registered by Lateral Entry Students Only.


REGULATIONS – R18
IV YEAR I SEMESTER COURSE STRUCTURE

1 R18CSE4101 Cryptography & Network Security 3 0 0 3

2 R18CSE4102 Data Mining 2 0 0 2
3 Professional Elective -IV 3 0 0 3
R18CSE4141 Graph Theory
R18CSE4142 Informational Retrieval Systems
R18CSE4143 Cloud Computing
4 Professional Elective -V 3 0 0 3
R18CSE4151 Soft Computing
R18CSE4152 Internet of Things
R18CSE4153 Software Process & Project Management
5 Open Elective - II 3 0 0 3
6 R18CSE41L1 Cryptography & Network Security Lab 0 0 2 1
7 R18CSE41L2 Technical Seminar 0 0 2 1
8 R18CSE41P1 Comprehensive Viva-voce 0 0 6 3
9 R18CSE41P2 Industrial Oriented Mini Project/ Summer 0 0 0 2*
Internship
th th
* To be carried out during the summer vacation between 6 and 7 semesters
Note: Students should submit report of Industrial Oriented Mini Project/ Summer Internship for evaluation.
IV YEAR II SEMESTER COURSE STRUCTURE

1 R18HAS4201 Organizational Behaviour 3 0 0 3

2 Professional Elective -VI 3 0 0 3
R18CSE4261 Distributed Systems
R18CSE4262 Cyber Forensics
R18CSE4263 Human Computer Interaction
3 Open Elective-III 3 0 0 3
4 R18CSE42P1 Project Work 0 0 14 7
*MC – Satisfied/Unsatisfied

LIST OF OPEN ELECTIVES
Open Elective – I
S. Credit
Course Code Course Title L T P
No. s
1 R18CIV3271 Disaster Management & Mitigation
2 R18CSE3272 Database Concepts
3 R18ECE3273 Consumer Electronics
4 R18EEE3274 Electrical Estimation & Costing
3 0 0 3
5 R18INF3275 Information Technology Essentials
6 R18MED3276 Introduction to Robotics
7 R18HMS3277 Fundamentals of Entrepreneurship
8 R18HMS3278 Day to Day Biology
Open Elective –II

S.
No.
1 R18CIV4181 Green Building Engineering
2 R18CSE4182 Cyber Security Fundamentals
Principles of Modern Communication
3 R18ECE4183
Systems
4 R18EEE4184 Illumination Engineering 3 0 0 3
5 R18INF4185 E-Commerce
6 R18MED4186 Industrial Design & Ergonomics
7 R18HMS4187 Creative Writing
8 R18HMS4188 Design Thinking
Open Elective –III

S.
No.
1 R18CIV4291 Remote Sensing Concepts
2 R18CSE4292 Fundamentals of Soft Computing
3 R18ECE4293 Audio & Video Engineering
4 R18EEE4294 Non Conventional Energy Resources
5 R18INF4295 Information Security Fundamentals 3 0 0 3
6 R18MED4296 Total Engineering Quality Management
Human Values & Professional Ethics for
7 R18HMS4297
Engineers
8 R18HMS4298 Science Fiction


B.Tech. - II Year – I Semester L T P C
3 0 0 3
(R18ECE2105) Analog Electronics

Objectives:
This is a fundamental course, basic knowledge of which is required by all the circuit branch
engineers. This course focuses:
 To familiarize the student with the principle of operation, analysis and design of Junction diode,
BJT and FET transistors and amplifier circuits.
 To understand diode as rectifier.
 To study basic principle of filter circuits and various types.
UNIT -I:
P-N Junction Diode: Qualitative Theory of P-N Junction, P-N Junction as a Diode, Diode Equation,
Volt-Ampere Characteristics, Temperature dependence of VI characteristic, Ideal versus Practical –
Resistance levels (Static and Dynamic), Transition and Diffusion Capacitances, Diode Equivalent
Circuits, Load Line Analysis, Breakdown Mechanisms in Semiconductor Diodes, Zener Diode
Characteristics.
Special Purpose Electronic Devices: Principle of Operation and Characteristics of Tunnel Diode
(with the help of Energy Band Diagram), Varactor Diode, SCR and Semiconductor Photo Diode.
UNIT-II:
Rectifiers and Filters : The P-N junction as a Rectifier, Half wave Rectifier, Full wave Rectifier,
Bridge Rectifier, Harmonic components in a Rectifier Circuit, Inductor Filters, Capacitor Filters, L-
Section Filters, π- Section Filters, Comparision of Filters, Voltage Regulation using Zener Diode.
UNIT-III:
Bipolar Junction Transistor and UJT: The Junction Transistor, Transistor Current Components,
Transistor as an Amplifier, Transistor Construction, BJT Operation, BJT Symbol, Common Base,
Common Emitter and Common Collector Configurations, Limits of Operation , BJT Specifications,
BJT Hybrid Model, Determination of h-parameters from Transistor Characteristics, Comparison of CB,
CE, and CC Amplifier Configurations, UJT and Characteristics.
UNIT-IV:
Transistor Biasing and Stabilization: Operating Point, The DC and AC Load lines, Need for Biasing,
Fixed Bias, Collector Feedback Bias, Emitter Feedback Bias, Collector – Emitter Feedback Bias,
Voltage Divider Bias, Bias Stability, Stabilization Factors, Stabilization against variations in VBE and
β, Bias Compensation using Diodes and Transistors, Thermal Runaway, Thermal Stability, Analysis
Transistor Amplifier Circuit using h-parameters
UNIT-V:
Field Effect Transistor and FET Amplifiers
Field Effect Transistor: The Junction Field Effect Transistor (Construction, principle of operation,
symbol) – Pinch-off Voltage - Volt-Ampere characteristics, The JFET Small Signal Model, MOSFET
(Construction, principle of operation, symbol), MOSFET Characteristics in Enhancement and
Depletion modes.

FET Amplifiers: FET Common Source Amplifier, Common Drain Amplifier, Generalized FET
Amplifier, Biasing FET, FET as Voltage Variable Resistor, Comparison of BJT and FET.
TEXT BOOKS:
1. Millman’s Electronic Devices and Circuits – J. Millman, C.C.Halkias, and Satyabrata Jit, 2 Ed.,
1998, TMH.
2. Electronic Devices and Circuits – Mohammad Rashid, Cengage Learning, 2013
3. Electronic Devices and Circuits – David A. Bell, 5 Ed, Oxford
REFERENCE BOOKS:
1. Integrated Electronics – J. Millman and Christos C. Halkias, 1991 Ed., 2008, TMH.
2. Electronic Devices and Circuits – R.L. Boylestad and Louis Nashelsky, 9 Ed., 2006, PEI/PHI.
3. Electronic Devices and Circuits – B. P. Singh, Rekha Singh, Pearson, 2Ed, 2013.
4. Electronic Devices and Circuits - K. Lal Kishore, 2 Ed., 2005, BSP.
5. Electronic Devices and Circuits – Anil K. Maini, Varsha Agarwal, 1 Ed., 2009, Wiley India
Pvt. Ltd.
6. Electronic Devices and Circuits – S.Salivahanan, N.Suresh Kumar, A.Vallavaraj, 2 Ed., 2008,
TMH.
Course Outcomes:
At the end of the course the student will be able to:
 Describe the construction, operation and characteristics of electronic devices
like P-N- Junction and special Purpose diodes (Understand).
 Determine the application of diode as a rectifier (Apply)
 Illustrate the application of transistors as amplifier employing BJT devices
(Apply)
 Analyze the Biasing circuits using BJT Transistor Amplifier Circuit (Analyze)
 Evaluate construction, operation and characteristics of FET (Evaluate)
 Select Biasing circuits using FET Amplifiers (Analyze)


3 1 0 4
(R18CSE2101) Data Structures
Course Objectives:
 Exploring basic data structures such as stacks and queues.
 Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
 Introduces sorting and pattern matching algorithms
UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation,
insertion, deletion and searching operations on linear list, Stacks-Operations, array and linked
representations of stacks, stack applications, Queues-operations, array and linked representations.
UNIT - II
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion and
searching. Hash Table Representation: hash functions, collision resolution-separate chaining, open
addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing.
UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and
Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and
Searching, Red –Black, Splay Trees.
UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting: Heap Sort, External
Sorting- Model for external sorting, Merge Sort.
UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm,
the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.
TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson
Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
Education.
REFERENCE BOOKS:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A.
Forouzan, Cengage Learning. R18 B.TECH.

Course Outcomes:
 Ability to select the data structures that efficiently model the information in a
problem. (Understand)
 Ability to assess efficiency trade-offs among different data structure implementations
or combinations. (Create)
 Implement and know the application of algorithms for sorting and searching. (Create)
 Design programs using a variety of data structures, including hash tables, binary and
general tree structures, search trees, tries, heaps, graphs, and AVL-trees (Create)
 Ability to select the data structures that efficiently model the information in a problem
(Analyze)
 Illustrate the concept of Text pattern matching algorithm (Analyze)


4 0 0 4
(R18MTH2102) Computer Oriented Statistical Methods
Objectives: To learn
• The theory of Probability, and probability d istributions of single and multiple and random
variables
• The sampling theory and testing of hypothesis and making inferences
• Stochastic process and Markov chains.
UNIT-I: Probability
Sample Space, Events, Counting Sample Poi nts, Probability of an Event, Additive Rules, Conditional
Probability, Independence, and the Product Rule, Bayes' Rule,
Random Variables and Probability Distri butions: Concept of a. Random variable, Discrete
Probability Distributions, Continuous Probability Distributions, Statistical Independence.
UNIT-II: Mathematical Expectation
Mean of a Random Variable, Variance and Covariance of Random Variables, Means and Variances of
Linear Combinations of Random Variables, Chebyshev's Theorem.
Discrete Probability Distributions: Introduction and Motivation, Binomial, Distribution,
Geometric Distributions and Poisson distribution.
UNIT-III: Continuous Probability Distributions
Continuous Uniform Distribution, Normal Distribution, Areas under the Normal Curve, Applications
of the Normal Distribution, Normal Approximation to the Binomial, Gamma and Exponential
Distributions.
Fundamental Sampling Distributions: Random Sampling, Some Important Statistics, Sampling
Distributions, Sampling Distribution of Means and the Central Limit Theorem,
Sampling Distribution of S2, t-Distribution, F-Distribution.
UNIT-IV: Estimation & Tests of Hypotheses
Introduction, Statistical Inference, Classical Methods of Estimation.: Estimating the Mean,
Standard Error of a Point Estimate, Prediction Intervals, Tolerance Limits, Esti mating the
Variance, Estimating a Proportion for single mean, Difference between Two Means, between Two
Proportions for Two Samples and Maximum Likelihood Estimation.
Statistical Hypotheses: General Concepts, Testing a Statistical Hypothesis, Tests Concerning a Single
Mean, Tests on Two Means, Test on a Single Proportion, Two Samples: Tests on Two Proportions.
UNIT-V: Stochastic Processes and Markov Chains
Introduction to Stochastic processes-Markov process. Transition Probability, Transition Probability
Matrix, First order and Higher order Markov process, n-step transition probabilities, Markov chain,
Steady state condition, Markov analysis.
Course outcomes:
After learning the contents of this paper the student must be able to
 Apply the concepts of probability and distributions to some case studies
 Correlate the material of one unit to the material in other units
 Resolve the potential misconceptions and hazards in each topic of study.

Text Books
1. Ronald E.Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability &
Statistics For Engineers & Scientists, 9thEd. Pearson Publishers.
2. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna
publications.
3. S.D.Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi
References
1. T.T.Soong, Fundamentals of Probability And Statistics for Engineers, John Wiley &
Sons, Ltd, 2004.
2. Sheldon M Ross, Probability and statistics for Engineers and scientists, academic press.
Course Outcomes:
 Describe the probability of an event, product rule, addition rule & boye’s rule(Understand)
 Explain Random variables and chebyshev’s theorem , Discrete probability
distribution(Understand)
 Calculate the areas under the normal curve & applications of the normal distribution(Apply)
 Analyze the fundamental sampling distributions(Analyze)
 Test the Hypothesis of single mean, double mean, single proportion, double
proportion(Evaluate)
 Evaluate Transition Probabilty matrix(Evaluate)


3 0 0 3
(R18CSE2102) Computer Organization & Architecture
Objectives of the course:

 To understand basic components of computers.
 To explore the I/O organizations in depth.
 To explore the memory organization.
 To understand the basic chip design and organization of 8086 with assembly language programming.
Unit –I
Basic Computer Organization – Functions of CPU, I/O Units, Memory: Instruction: Instruction
Formats- One address, two addresses, zero addresses and three addresses and comparision; addressing
modes with numeric examples: Program Control- Status bit conditions, conditional branch instructions,
Program Interrupts: Types of Interrupts.
Unit -II:
Input-Output Organization- I/O Interface, I/O Bus and Interface modules: I/O Vs memory Bus,
Isolated Vs Memory-Mapped I/O, Asynchronous data Transfer- Strobe Control, Hand Shaking:
Asynchronous Serial transfer- Asynchronous Communication interface, Modes of transfer-
Programmed I/O, Interrupt Initiated I/O,DMA; DMA Controller, DMA Transfer, IOP-CPU-IOP
Communication, Intel 8089 IOP.
Unit - III:
Memory Organization: Memory hierarchy, Main Memory, RAM, ROM Chips, Memory Address
Map, Memory Connection to CPU, associate memory , Cache Memory, Data Cache, Instruction cache,
Miss and Hit ratio, Access time, associative, set associative, mapping , waiting into cache, Introduction
to virtual memory.
Unit - IV:
8086 CPU Pin Diagram- Special functions of general purpose registers, Segment register, concept of
pipelining, 8086 Flag register, Addressing modes of 8086.
Unit - V:
8086-Instruction formats: Assembly Language Programs involving branch & Call instructions,
sorting, evaluation of arithmetic expressions.
Suggested books:
1. Computer system Architecture: Morris Mano (UNIT-1,2,3).
2. Advanced Micro Processor and Peripherals- Hall/ A K Ray(UNIT-4,5).
Suggested reference books:
1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI.
2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition PHI/Pearson.
3. Fundamentals or Computer Organization and Design, - Sivaraama Dandamudi Springer Int.
Edition.
4. Computer Architecture a quantitative approach, John L. Hennessy and David A. Patterson,
Fourth Edition Elsevier.
5. Computer Architecture: Fundamentals and principles of Computer Design, Joseph D. Dumas II,
BS Publication.

Course outcomes
 Compare the architectures of different computers.( Evaluate)
 Identify different hardware components associated with the memory organization of a
computer(Remember)
 Evaluation of address of an operand by using various addressing modes. (Understand)
 Summarizes the memory organization(Understand)
 Describe the architecture of 8086 microprocessor.(Understand)
 Design and implement simple systems using 8086 processor with the knowledge of pin diagram,
registers and instruction formats of 8086 processor by writing assembly language programs. (create)


2 0 0 2
(R18CSE2103) Object Oriented Programming using C++

Course Objectives:
 Introduces Object Oriented Programming concepts using the C++ language.
 Introduces the principles of data abstraction, inheritance and polymorphism;
 Introduces the principles of virtual functions and polymorphism
 Introduces handling formatted I/O and unformatted I/O
 Introduces exception handling
Course Outcomes:
 Able to develop programs with reusability
 Develop programs for file handling
 Handle exceptions in programming
 Develop applications for a range of problems using object-oriented programming techniques
UNIT - I
Object-Oriented Thinking: Different paradigms for problem solving, need for OOP paradigm,
differences between OOP and Procedure oriented programming, Overview of OOP concepts-
Abstraction, Encapsulation, Inheritance and Polymorphism.
C++ Basics: Structure of a C++ program, Data types, Declaration of variables, Expressions, Operators,
Operator Precedence, Evaluation of expressions, Type conversions, Pointers, Arrays, Pointers and
Arrays, Strings, Structures, References. Flow control statement- if, switch, while, for, do, break,
continue, goto statements. Functions - Scope of variables, Parameter passing, Default arguments, inline
functions, Recursive functions, Pointers to functions. Dynamic memory allocation and de-allocation
operators-new and delete, Preprocessor directives.
UNIT - II
C++ Classes and Data Abstraction: Class definition, Class structure, Class objects, Class scope, this
pointer, Friends to a class, Static class members, Constant member functions, Constructors and
Destructors, Dynamic creation and destruction of objects, Data abstraction, ADT and information
hiding.
UNIT - III
Inheritance: Defining a class hierarchy, Different forms of inheritance, Defining the Base and Derived
classes, Access to the base class members, Base and Derived class construction, Destructors, Virtual
base class.
Virtual Functions and Polymorphism: Static and Dynamic binding, virtual functions, Dynamic
binding through virtual functions, Virtual function call mechanism, Pure virtual functions, Abstract
classes, Implications of polymorphic use of classes, Virtual destructors.
UNIT - IV
C++ I/O: I/O using C functions, Stream classes hierarchy, Stream I/O, File streams and String streams,
Overloading operators, Error handling during file operations, Formatted I/O.

UNIT - V
Exception Handling: Benefits of exception handling, Throwing an exception, The try block, Catching
an exception, Exception objects, Exception specifications, Stack unwinding, Rethrowing an exception,
Catching all exceptions.
TEXT BOOKS:
1. The Complete Reference C++, 4th Edition, Herbert Schildt, Tata McGraw Hill.
2. Problem solving with C++: The Object of Programming, 4th Edition, Walter Savitch, Pearson
Education.
REFERENCES:
1. The C++ Programming Language, 3rd Edition, B. Stroutstrup, Pearson Education.
2. OOP in C++, 3rd Edition, T. Gaddis, J. Walters and G. Muganda, Wiley Dream Tech Press.
3. Object Oriented Programming in C++, 3rd Edition, R. Lafore, Galigotia Publications Pvt Ltd.
Course outcomes
 Distinguish the procedural and object oriented paradigm along with
principles(Analyze)
 Understand dynamic memory management techniques using pointers, constructors,
destructors, etc (Understand)
 Describe the concept of function overloading, operator overloading, virtual functions
and polymorphism.(Understanding)
 Classify inheritance with the understanding of early and late binding (Understand)
 Illustrate the process of data file manipulations using C++ (Apply)
 An ability to incorporate Exception handling in Object Oriented programs(Analyze)


0 0 2 1
(R18ECE21L4) Analog Electronics Lab

PART A: (Only for Viva-voce Examination)
Electronic Workshop Practice (In 3 Lab Sessions):
1. Identification, Specifications, Testing of R, L, C Components (Color Codes), Potentiometers,
Switches (SPDT, DPDT, and DIP), Coils, Gang Condensers, Relays, Bread Boards, PCB’s
2. Identification, Specifications and Testing of Active Devices, Diodes, BJT’s, Low power
JFET’s, MOSFET’s, Power Transistors, LED’s, LCD’s, SCR, UJT.
3. Study and operation of
i) Multimeters (Analog and Digital)
ii) Function Generator
iii) Regulated Power Supplies
iv) CRO.
PART B: (For Laboratory Examination – Minimum of 10 experiments)

1. Forward & Reverse Bias Characteristics of PN Junction Diode.
2. Zener diode characteristics and Zener as voltage Regulator.
3. Half Wave Rectifier with & without filters.
4. Full Wave Rectifier with & without filters.
5. Input & Output Characteristics of Transistor in CB Configuration and h-parameter calculations.
6. Input & Output Characteristics of Transistor in CE Configuration and h-parameter calculations.
7. FET characteristics.
8. Design of Self-bias circuit.
9. Frequency Response of CC Amplifier.
10. Frequency Response of CE Amplifier.
11. Frequency Response of Common Source FET amplifier .
12. SCR characteristics.
13. UJT Characteristics
PART C: Equipment required for Laboratories:

1. Regulated Power supplies (RPS) -0-30 V
2. CRO’s -0-20 MHz.
3. Function Generators -0-1 MHz.
4. Multimeters
5. Decade Resistance Boxes/Rheostats
6. Decade Capacitance Boxes
7. Ammeters (Analog or Digital) -0-20 μA, 0-50μA, 0-100μA, 0-200μA, 0-10
mA.
8. Voltmeters (Analog or Digital) -0-50V, 0-100V, 0-250V
9. Electronic Components -Resistors, Capacitors, BJTs,
LCDs, SCRs, UJTs, FETs,
LEDs, MOSFETs,
Diodes- Ge& Si type, Transistors – NPN, PNP type)

Course outcomes
Upon completion of the Course, students will be able to:
 Determine the P-N-Junction diode & Zener diode characteristics.

 Calculate the Input and Output characteristics of BJT and FET.
 Evaluate Half Wave and Full Wave Rectifier with and without filters.
 Differentiate Measurement of h-parameters of transistor in CB, CE, CC configurations.
 Analyse the Frequency response of CE, CC and Common Source FET Amplifier.
 Measure SCR and UJT characteristics.


0 0 3 1.5
(R18CSE21L1) Data Structures Lab
Course Objectives:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.
Course Outcomes:
 Ability to develop C programs for computing and real-life applications using basic elements
like control statements, arrays, functions, pointers and strings, and data structures like stacks,
queues and linked lists.
 Ability to Implement searching and sorting algorithms
LIST OF EXPERIMENTS
1. Write a program that uses functions to perform the following operations on singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly linked list.:
3. Write a program that uses functions to perform the following operations on circular linked list.:
4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list of integers in
ascending order
i) Bubble sort ii) Selection sort iii) Insertion sort
7. Write a program that use both recursive and non recursive functions to perform the following
searching operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
8. Write a program to implement the tree traversal methods.
9. Write a program to implement the graph traversal methods.
TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson
Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein, PHI/Pearson
Education.
REFERENCE:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B. A.
Forouzan, Cengage Learning.

Course outcomes
 Design a program to implement the linear data structures using static and dynamic
memory allocation. (Create))
 Design a program to implement searching ,sorting techniques for the given
problem.(Create)
 Demonstrate the fundamental algorithms of tree data structures by experimenting the
programs.(Apply)
 Examine the traversing of a given graph by using the respect to graph traversal
techniques(Apply)
 Design a program to implement the pattern matching algorithms for the given
problem.(Create)


0 0 3 1.5
(R18CSE21L2) IT Workshop Lab

Course Objectives:
The IT Workshop for engineers is a training lab course spread over 60 hours. The modules include
training on PC Hardware, Internet & World Wide Web and Productivity tools including Word, Excel,
Power Point and Publisher.
PC Hardware introduces the students to a personal computer and its basic peripherals, the process of
assembling a personal computer, installation of system software like MS Windows, Linux and the
required device drivers. In addition hardware and software level troubleshooting process, tips and
tricks would be covered. The students should work on working PC to disassemble and assemble to
working condition and install Windows and Linux on the same PC. Students are suggested to work
similar tasks in the Laptop scenario wherever possible. Internet & World Wide Web module introduces
the different ways of hooking the PC on to the internet from home and workplace and effectively usage
of the internet. Usage of web browsers, email, newsgroups and discussion forums would be covered. In
addition, awareness of cyber hygiene, i.e., protecting the personal computer from getting infected with
the viruses, worms and other cyber attacks would be introduced. Productivity tools module would
enable the students in crafting professional word documents, excel spread sheets, power point
presentations and personal web sites using the Microsoft suite of office tools and LaTeX.
PC Hardware
Task 1: Identify the peripherals of a computer, components in a CPU and its functions. Draw the block
diagram of the CPU along with the configuration of each peripheral and submit to your instructor.
Task 2: Every student should disassemble and assemble the PC back to working condition. Lab
instructors should verify the work and follow it up with a Viva. Also students need to go through the
video which shows the process of assembling a PC. A video would be given as part of the course
content.
Task 3: Every student should individually install MS windows on the personal computer. Lab
instructor should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have windows
installed. The system should be configured as dual boot with both windows and Linux. Lab instructors
should verify the installation and follow it up with a Viva
Task 5: Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to get the
computer back to working condition. The work done should be verified by the instructor and followed
up with a Viva.
Task 6: Software Troubleshooting: Students have to be given a malfunctioning CPU due to system
software problems. They should identify the problem and fix it to get the computer back to working
condition. The work done should be verified by the instructor and followed up with a Viva.

Internet & World Wide Web

Task1: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area
Network and access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate, to the instructor, how to access the websites and email. If there is no internet
connectivity preparations need to be made by the instructors to simulate the WWW on the LAN.
Task 2: Web Browsers, Surfing the Web: Students customize their 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.
Task 3: Search Engines & Netiquette: Students should know what search engines are and how to use
the search engines. A few topics would be given to the students for which they need to search on
Google. This should be demonstrated to the instructors by the student.
Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet and would be
asked to configure their computer to be safe on the internet. They need to first install an antivirus
software, configure their personal firewall and windows update on their computer. Then they need to
customize their browsers to block pop ups, block active x downloads to avoid viruses and/or worms.
LaTeX and WORD

Task 1 – Word Orientation: The mentor needs to give an overview of LaTeX and Microsoft (MS)
office 2007/ equivalent (FOSS) tool word: Importance of LaTeX and MS office 2007/ equivalent
(FOSS) tool Word as word Processors, Details of the four tasks and features that would be covered in
each, Using LaTeX and word – Accessing, overview of toolbars, saving files, Using help and
resources, rulers, format painter in word.
Task 2: Using LaTeX and Word to create project certificate. Features to be covered:- Formatting Fonts
in word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and Colors,
Inserting Header and Footer, Using Date and Time option in both LaTeX and Word.
Task 3: Creating project abstract Features to be covered:-Formatting Styles, Inserting table, Bullets and
Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check,
Track Changes.
Task 4 : 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 and Mail Merge in word.
Excel
Excel Orientation: The mentor needs to tell the importance of MS office 2007/ equivalent (FOSS) tool
Excel as a Spreadsheet tool, give the details of the four tasks and features that would be covered in
each. Using Excel – Accessing, overview of toolbars, saving excel files, Using help and resources.
Task 1: Creating a Scheduler - Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text
Task 2 : Calculating GPA - .Features to be covered:- Cell Referencing, Formulae in excel – average,
std.deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function, Task 3:
Performance Analysis - Features to be covered:- Split cells, freeze panes, group and outline, Sorting,

Boolean and logical operators, Conditional formatting
LaTeX and MS/equivalent (FOSS) tool Power Point

Task 1: Students will be working on basic power point utilities and tools which help them create basic
power point presentation. Topic covered during this week includes: - PPT Orientation, Slide Layouts,
Inserting Text, Word Art, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows in
both LaTeX and PowerPoint. Students will be given model power point presentation which needs to be
replicated (exactly how it’s asked).
Task 2: Second week helps students in making their presentations interactive. Topic covered during
this week includes: Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables and Charts.
Task 3: Concentrating on the in and out of Microsoft power point and presentations in LaTeX. Helps
them learn best practices in designing and preparing power point presentation. Topic covered during
this week includes: - Master Layouts (slide, template, and notes), Types of views (basic, presentation,
slide slotter, notes etc), and Inserting – Background, textures, Design Templates, Hidden slides.
REFERENCE BOOKS:
1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech
2. The Complete Computer upgrade and repair book, 3rd edition Cheryl A Schmidt, WILEY
Dreamtech
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.
4. PC Hardware - A Handbook – Kate J. Chase PHI (Microsoft)
5. LaTeX Companion – Leslie Lamport, PHI/Pearson.
6. IT Essentials PC Hardware and Software Companion Guide Third Edition by David Anfinson
and Ken Quamme. – CISCO Press, Pearson Education.
7. IT Essentials PC Hardware and Software Labs and Study Guide Third Edition by Patrick
Regan – CISCO Press, Pearson Education.


0 0 2 1
(R18CSE21L3) C++ Programming Lab

Course Objectives
 Introduces object-oriented programming concepts using the C++ language.
 Introduces the principles of data abstraction, inheritance and polymorphism;
 Introduces the principles of virtual functions and polymorphism
 Introduces handling formatted I/O and unformatted I/O
 Introduces exception handling
LIST OF EXPERIMENTS
1. Write a C++ Program to display Names, Roll No., and grades of 3 students who have appeared
in the examination. Declare the class of name, Roll No. and grade. Create an array of class
objects. Read and display the contents of the array.
2. Write a C++ program to declare Struct. Initialize and display contents of member variables.
3. Write a C++ program to declare a class. Declare pointer to class. Initialize and display the
contents of the class member.
4. Given that an EMPLOYEE class contains following members: data members: Employee
number, Employee name, Basic, DA, IT, Net Salary and print data members.
5. Write a C++ program to read the data of N employee and compute Net salary of each employee
(DA=52% of Basic and Income Tax (IT) =30% of the gross salary).
6. Write a C++ to illustrate the concepts of console I/O operations.
7. Write a C++ program to use scope resolution operator. Display the various values of the same
variables declared at different scope levels.
8. Write a C++ program to allocate memory using new operator.
9. Write a C++ program to create multilevel inheritance. (Hint: Classes A1, A2, A3)
10. Write a C++ program to create an array of pointers. Invoke functions using array objects.
11. Write a C++ program to use pointer for both base and derived classes and call the member
function. Use Virtual keyword.

Course Outcomes
 Ability to develop applications for a range of problems using object-oriented

programming (Create)
 Programs to demonstrate the implementation of constructors, destructors and operator
overloading. (Apply)
 Apply virtual and pure virtual function & complex program situations(Apply)
 Apply fundamental algorithmic problems including type casting, inheritance, and
polymorphism. (Apply)
 Understand generic programming, templates, file handling. (Understand)
 Handle exceptions in programming (Analyze)


0 0 2 0
(R18MAC2100) Gender Sensitization Lab

Course Objectives:
 To develop students’ sensibility with regard to issues of gender in contemporary India.
 To provide a critical perspective on the socialization of men and women.
 To introduce students to information about some key biological aspects of genders.
 To expose the students to debates on the politics and economics of work.
 To help students reflect critically on gender violence.
 To expose students to more egalitarian interactions between men and women.
UNIT – I 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.
UNIT – II 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.
UNIT – III 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.
UNIT – IV 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 – V 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.
Prescribed Textbook : All the five Units in the Textbook, “Towards a World of Equals: A Bilingual
Textbook on Gender” written by A.Suneetha, Uma Bhrugubanda, Duggirala Vasanta, Rama Melkote,
Vasudha Nagaraj, Asma Rasheed, Gogu Shyamala, Deepa Sreenivas and Susie Tharu and published by
Telugu Akademi, Hyderabad,Telangana State in the year 2015.
Note: Since it is an Interdisciplinary Course, Resource Persons can be drawn from the fields of English
Literature or Sociology or Political Science or any other qualified faculty who has expertise in this

field from engineering departments.
REFERENCE BOOKS:
 Menon, Nivedita. Seeing like a Feminist. New Delhi: Zubaan-Penguin Books, 2012
 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/
Course Outcomes:
 Students will have developed a better understanding of important issues related to
gender in contemporary India.
 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.
 Students will attain a finer grasp of how gender discrimination works in our society
and how to counter it.
 Students will acquire insight into the gendered division of labour and its relation to
politics and economics.
 Men and women students and professionals will be better equipped to work and live
together as equals.
 Students will develop a sense of appreciation of women in all walks of life.
 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.


B.Tech. - II Year – II Semester L T P C
3 0 0 3
(R18CSE2201) Discrete Mathematics
Objectives of the course
Throughout the course, students will be expected to demonstrate their understanding of Discrete
Mathematics by being able to do each of the following:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counterexamples.
5. Apply logical reasoning to solve a variety of problems.
Unit - I:
Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary Relation,
Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product of Functions,
Bijective functions, Inverse and Composite Function, Size of a Set, Finite and infinite Sets, Countable
and uncountable Sets, Cantor's diagonal argument and The Power Set theorem, Schroeder-Bernstein
theorem.
Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition, The
Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, The
Fundamental Theorem of Arithmetic.
Unit - II:
Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and
combination.
Unit - III:
Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic Connectives and Truth
Tables, Logical Equivalence: The Laws of Logic, Logical Implication, Rules of Inference, The use of
Quantifiers. Proof Techniques: Some Terminology, Proof Methods and Strategies, Forward Proof,
Proof by Contradiction, Proof by Contraposition, Proof of Necessity and Sufficiency.
Unit - IV:
Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, Semi Groups,
Monoids, Groups, Congruence Relation and Quotient Structures, Free and Cyclic Monoids and
Groups, Permutation Groups, Substructures, Normal Subgroups, Algebraic Structures with two Binary
Operation, Rings, Integral Domain and Fields. Boolean Algebra and Boolean Ring, Identities of
Boolean Algebra, Duality, Representation of Boolean Function, Disjunctive and Conjunctive Normal
Form
Unit - V:
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph,
Isomorphism, Eulerian and Hamiltonian Walks, Graph Colouring, Colouring maps and Planar Graphs,
Colouring Vertices, Colouring Edges, List Colouring, Perfect Graph, definition properties and
Example, rooted trees, trees and sorting, weighted trees and prefix codes, Bi-connected component and
Articulation Points, Shortest distances.

Suggested books :
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill Susanna S.
Epp, Discrete Mathematics with Applications,4th edition, Wadsworth Publishing Co. Inc. C L
Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented Approach,
3rd Edition by, Tata McGraw – Hill.
Suggested reference books:

1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s Application to
Computer Science”, TMG Edition, TataMcgraw-Hill
2. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press. Schaum’s
Outlines Series, Seymour Lipschutz, Marc Lipson,
3. Discrete Mathematics, Tata McGraw - Hill
Course Outcomes
1. For a given logic sentence express it in terms of predicates, quantifiers, and logical connectives
2. For a given a problem, derive the solution using deductive logic and prove the solution based on
logical inference
3. For a given a mathematical problem, classify its algebraic structure
4. Evaluate Boolean functions and simplify expressions using the properties of Boolean algebra
5. Develop the given problem as graph networks and solve with techniques of graph theory.


3 0 0 3
(R18ECE2102) Digital Logic Design
Course Objectives:
This course provides in-depth knowledge of switching theory and the design techniques of digital
circuits, which is the basis for design of any digital circuit. The main objectives are:
 To learn basic techniques for the design of digital circuits and fundamental concepts used in
the design of digital systems.
 To understand common forms of number representation in digital electronic circuits and to
be able to convert between different representations.
 To implement simple logical operations using combinational logic circuits
 To design combinational logic circuits, sequential logic circuits.
 To provide extended knowledge of digital logic circuits in the form of state model approach.
UNIT -I:
Number System and Boolean Algebra And Switching Functions: Number Systems, Base
Conversion Methods, Complements of Numbers, Codes- Binary Codes, Binary Coded Decimal
Code and its Properties, Unit Distance Codes, Alpha Numeric Codes, Error Detecting and
Correcting Codes.
Boolean Algebra: Basic Theorems and Properties, Switching Functions, Canonical and Standard
Form, Algebraic Simplification of Digital Logic Gates, Properties of XOR Gates, Universal Gates,
Multilevel NAND/NOR realizations.
UNIT -II:
Minimization and Design of Combinational Circuits: Introduction, The Minimization with
theorem, The Karnaugh Map Method, Five and Six Variable Maps, Prime and Essential
Implications, Don’t Care Map Entries, Using the Maps for Simplifying, Tabular Method, Partially
Specified Expressions, Multi-output Minimization, Minimization and Combinational Design,
Arithmetic Circuits, Comparator, Multiplexers, Code Converters, Wired Logic, Tristate Bus
System, Practical Aspects related to Combinational Logic Design, Hazards and Hazard Free
Relations.
UNIT -III:
Sequential Machines Fundamentals: Introduction, Basic Architectural Distinctions between
Combinational and Sequential circuits, The Binary Cell, Fundamentals of Sequential Machine
Operation, The Flip-Flop, The D-Latch Flip-Flop, The “Clocked T” Flip-Flop, The “ Clocked J-K”
Flip-Flop, Design of a Clocked Flip-Flop, Conversion from one type of Flip-Flop to another,
Timing and Triggering Consideration, Clock Skew.
UNIT -IV:
Sequential Circuit Design and Analysis: Introduction, State Diagram, Analysis of Synchronous
Sequential Circuits, Approaches to the Design of Synchronous Sequential Finite State Machines,
Design Aspects, State Reduction, Design Steps, Realization using Flip-Flops Counters - Design of
Single mode Counter, Ripple Counter, Ring Counter, Shift Register, Shift Register Sequences,
Ring Counter Using Shift Register.
UNIT -V:
Sequential Circuits : Finite state machine-capabilities and limitations, Mealy and Moore models-
minimization of completely specified sequential machines, Partition techniques and merger chart methods – concept
of minimal cover table.

Algorithmic State Machine: Salient features of the ASM chart

VLSI Design flow: Design entry: Schematic, FSM & HDL, different modeling styles in VHDL, Data
types and objects, Dataflow, Behavioral and Structural Modeling, Synthesis and Simulation VHDL
constructs and codes for combinational and sequential circuits
TEXT BOOKS:
1. Switching and Finite Automata Theory- Zvi Kohavi & Niraj K. Jha, 3rd Edition, Cambridge.
2. Digital Design- Morris Mano, PHI, 3rd Edition.
3. Douglas Perry, “VHDL”, Tata McGraw Hill, 4th edition, 2002.
REFERENCE BOOKS:
1. Introduction to Switching Theory and Logic Design – Fredriac J. Hill, Gerald R. Peterson, 3rd
Ed,John Wiley & Sons Inc.
2. Digital Fundamentals – A Systems Approach – Thomas L. Floyd, Pearson, 2013.
3. Digital Logic Design - Ye Brian and HoldsWorth, Elsevier
4. Fundamentals of Logic Design- Charles H. Roth, Cengage Learning, 5th, Edition, 2004.
5. Digital Logic Applications and Design- John M. Yarbrough, Thomson Publications, 2006.
6. Digital Logic and State Machine Design – Comer, 3rd, Oxford, 2013.
Course Outcomes:
Upon completion of the course, students should possess the following skills:
 Interpret the various number systems & code converters, error detecting and
correcting, BCD, Gray Code, EX-3.
 Describe the operation of logic gates and Apply Boolean Algebra on K-map.
 Design / Analysis of Combinational Circuits.
 Diagram illustrates the operation &timing constrains for Latches &Flip-Flops and Registers and
Counters.
 Design &analyze sequential circuits.
 Use HDL &appropriate EDA tools for digital logic design &simulation.


3 0 0 3
(R18CSE2202) Operating Systems

Objectives:
 To understand main components of OS and their working
 To study the operations performed by OS as a resource manager
 To understand the different scheduling policies of OS
 To understand the different memory management techniques
 To understand process concurrency and synchronization
 To understand the concepts of input/ output, storage and file management
 To study different OS and compare their features.
UNIT - I:
Operating System Introduction: Operating Systems Objectives and functions, Computer System
Architecture, OS Structure, OS Operations, Evolution of Operating Systems - Simple Batch, Multi
programmed, time shared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems,
Special - Purpose Systems, Operating System services, user OS Interface, System Calls, Types of
System Calls, System Programs, Opening System Design and Implementation, OS Structure, Virtual
machines.
UNIT - II:
Process and CPU Scheduling - Process concepts - The Process, Process State, Process Control Block,
Threads, Process Scheduling - Scheduling Queues, Schedulers, Context Switch, Preemptive
Scheduling, Dispatcher, Scheduling Criteria, Scheduling algorithms, Multiple-Processor Scheduling,
Real-Time Scheduling, Thread scheduling, Case studies: Linux, Windows.
Process Coordination - Process Synchronization, The Critical section Problem, Peterson's solution,
Synchronization Hardware, Semaphores, and Classic Problems of Synchronization, Monitors, Case
Studies: Linux, Windows.
UNIT - III:
Memory Management and Virtual Memory - Logical & physical Address Space, Swapping,
Contiguous Allocation, Paging, Structure of Page Table. Segmentation, Segmentation with Paging,
Virtual Memory, Demand Paging, Performance of Demanding Paging, Page Replacement, Page
Replacement Algorithms, Allocation of Frames, Thrashing.
UNIT - IV:
File System Interface - The Concept of a File, Access methods, Directory Structure, File System
Mounting, File Sharing, Protection, File System Implementation - File System Structure, File System
Implementation, Allocation methods, Free-space Management, Directory Implementation, Efficiency
and Performance.
Mass Storage Structure - Overview of Mass Storage Structure, Disk Structure, Disk Attachment,
Disk Scheduling, Disk Management, Swap space Management.
UNIT - V:
Deadlocks - System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock.
Protection - System Protection, Goals of Protection, Principles of Protection, Domain of Protection,
Access Matrix, Implementation of Access Matrix, Access Control, Revocation of Access Rights,
Capability-Based Systems, Language-Based Protection.

TEXT BOOKS:
1. Operating System Principles, Abraham Silberchatz, Peter B. Galvin, Greg Gagne 8th Edition,
Wiley Student Edition.
2. Operating systems - Internals and Design Principles, W. Stallings, 6th Edition, Pearson.
REFERENCES BOOKS:
1. Modern Operating Systems, Andrew S Tanenbaum 3rd Edition PHI.
2. Operating Systems A concept - based Approach, 2nd Edition, D. M. Dhamdhere, TMH.
3. Principles of Operating Systems, B. L. Stuart, Cengage learning, India Edition.
4. Operating Systems, A. S. Godbole, 2nd Edition, TMH
5. An Introduction to Operating Systems, P.C.P. Bhatt, PHI.
6. Operating Systems, S, Haldar and A. A. Arvind, Pearson Education.
7. Operating Systems, R. Elmasri, A. G. Carrick and D. Levine, Mc Graw Hill.
8. Operating Systems in depth, T. W. Doeppner, Wiley.
Outcome:
 Apply optimization techniques for the improvement of system performance.
 Ability to understand the synchronous and asynchronous communication mechanisms in their
respective OS.
 Learn about minimization of turnaround time, waiting time and response time and also
maximization of throughput with keeping CPU as busy as possible.
 Ability to compare the different OS


3 1 0 4
(R18CSE2203) Database Management Systems

Objectives:
• To understand the basic concepts and the applications of database systems.
• To master the basics of SOL and construct queries using SOL.
• To understand the relational database design Principles.
• To become familiar with the basic issues of transaction processing and concurrency control.
• To become familiar with database storage structures and access techniques.
UNIT - I
Introduction-Database System Applications: Purpose of Database Systems, View of Data - Data
Abstraction, Instances and Schemas, Data Models ,Database Languages - DDL, DML. Database
Access from Application Programs, Transaction Management, Data Storage and Querying, Database –
Architecture, Database users and Administrators, History of Database systems.
Introduction to Data base design, ER diagrams, Beyond ER Design, Entities. Attributes and Entity sets,
Relationships and Relationship sets, Additional features of ER Model, Conceptual Design with the ER
Model, Conceptual design for Large enterprises. Relational Model: Introduction to the Relational
Model - Integrity Constraints over Relations, Enforcing Integrity constraints, Querying relational
data, Logical data base Design, Introduction to views - destroying /altering Tables and views.
UNIT- II
Relational Algebra and Calculus: Relational Algebra - Selection and projection, Set operations,
Renaming, Joins, Division, Examples of Algebra Queries, Relational Calculus – Tuple Relational
Calculus - Domain relational calculus - Expressive Power of Algebra and calculus.
Form of Basic SQL Query - Examples of Basic SQL Queries, Introduction to nested Queries,
Correlated Nested Queries, Set - Comparison Operators, Aggregate Operators, NULL values-
Comparison using Null values -Logical connectives -AND, OR and NOT - Impact on SQL Constructs,
outer Joins, Disallowing NULL values, Complex Integrity Constraints in SQL Triggers and active data
bases.
UNIT – III
Introduction to scheme refinement: problems caused by redundancy, Decompositions – Problem
related to decomposition, Functional Dependencies – Reasoning about FDS, Normal Forms – FIRST,
SECOND, THIRD Normal forms – BCNF – Properties of Decompositions – Loss less join
Decomposition, Dependency preserving Decomposition, Schema Refinement in Data base Design –
Multi valued Dependencies – FOURTH Normal Form, Join Dependencies, FIFTH Normal Form,
Inclusion Dependencies.
UNIT – IV
Transaction Management: Transaction Concept – Transaction State – Implementation of Atomicity
and Durability - Concurrent – Executions – Serializability – Recoverability – Implementation of
Isolation – Testing for serializability.
Concurrency Control: Lock – Based Protocols – Timestamp Based Protocols – Validation – Based
protocols – Multiple Granularity.
Recovery Syhstem – Failure Classification – Storage Structure – Recovery and atomicity – Log –
Based Recovery – Recovery with Concurrent Transactions – Buffer Management – Failure with loss of
nonvolatile storage – Advance Recovery systems – Remote Backup systems.

UNIT – V
Overview of Storage and Indexing : Data on External Storage, File Organization and Indexing –
Clustered Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based indexing, Tree
based Indexing Comparison of File Organizations.
Tree Structured Indexing: Intuitions for tree indexes, Indexed Sequential Access Methods (ISAM)
B+ Trees: A Dynamic Index Structure, Search Insert, Delete.
Hash Based Indexing: Static Hashing, Extendable hashing, Liner Hashing, Extendable hashing vs
Liner Hashing.
TEXT BOOKS:
1. Data base Management systems, Raghu Ramakrishan, Johannes Gehrke, TMH, 3 rd Edition,
2003.
2. Data base System Concepts, A. Silberschatz, H.F. Korth, S.Sudharshan, McGraw hill, VI
edition, 2006.
REFERENCE BOOKS
1. Database Systems, 6th edition, Ramez Elmastri, Shamkant B. Navathe, Pearson Education,
2013.
2. Database Principles, Programming, and Performance, P.O. Neil, E.O’Neil, 2 nd ed., ELSEVIER.
3. Database Systems, A Practical approach to Design implementation and Management Fourth
edition, Thomas Connolly, Carolyn Begg, Pearson education.
4. Database System Concepts, Peter Rob & Carlos Coronel, Cengage learning, 2008
5. Fundamentals of Relational Database Management systems, S.Sumathi, S. Esakkirajan,
Springer.
6. Database Management System Oracle SQL and PL/SQL, P.K.Das Gupta, PHI.
7. Introduction to Database Management, M.L. Gillenson and others, Wiley Student Edition.
8. Database Development and Management, Lee Chao, Auerbach publications, Taylor & Francis
Group.
9. Introduction to Database Systems, C.J.Date, Pearson Education.
10. Database Management Systems, G.K.Gupta, TMH.
Outcomes:
 Demonstrate the basic elements of a relational database management system.
 Ability to identify the data models for relevant problems.
 Ability to design entity relationship and convert entity relationship diagrams into RDBMS and
formulate SQL queries on the respect data.
 Apply normalization for the development of application software’s


3 1 0 4
(R18CSE2204) Java Programming

Objectives:
 To understand object oriented programming concepts, and apply them in problem solving.
 To learn the basics of java Console and GUI based programming.
UNIT – I
OOP concepts – Data abstraction, encapsulation, inheritance, benefits of inheritance, polymorphism,
classes and objects, Procedural and object oriented programming paradigms.
Java programming – History of Java, comments, data types variables constants, scope and life time of
variables, operators, operator hierarchy, expressions, type conversion and casting, enumerated types, ,
simple java stand along programs, arrays, console input and output, formatting output, constructors,
methods, parameter passing, static fields and methods, access control, this reference, overloading
methods and constructors, recursion, garbage collection, building strings, exploring string class.
UNIT- II
Inheritance – inheritance hierarchies, super and sub classes, Member access rules, super keyword,
preventing inheritance: final classes and methods, the Object class and its methods.
Polymorphism – dynamic binding, method overriding, abstract classes and methods.
Interfaces – interfaces vs. Abstract classes, defining an interface implementing interfaces, accessing
implementations through interface references, extending interface.
Inner classes – Uses of inner classes, local inner classes, anonymous inner classes, static inner classes,
examples.
Packages – Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing
packages.
UNIT – III
Exception handling - Dealing with errors, benefits of exception handling, the classification of
exceptions – exception hierarchy, checked exceptions and unchecked exceptions, usage of try, catch,
throw, throws and finally, re-throwing exceptions, exception specification, built in exceptions, creating
own exception sub classes.
Multithreading - Differences between multiple processes and multiple threads, thread states, creating
threads, interrupting threads, thread priorities, synchronizing threads, inter-thread communication,
producer consumer pattern.
UNIT – IV
Collection Framework in Java - Introduction to Java Collections, Overview of Java Collection
Frame work, Generics, Commonly used Collection classes – Array List, Vector, Hash table, Stack,
Enumeration, Iterator, String Tokenizer, Random, Scanner, calendar and Properties.
Files – Streams – byte streams, character streams, text input/output, binary input/output, random access
file operations, File management using File class.
Connecting to Database – JDBC Type 1 to 4 drivers, connecting to a database, querying a database
and processing the results, updating data with JDBC.

UNIT – V
GUI Programming with Java – The AWT class hierarchy, introduction to Swing, Swing vs AWT,
Hierarchy for Swing components, Containers – JFrame, JApplet, JDialog, JPanel, Overview of some
swing components – Jbutton, JLabel, JTextField, JTestArea, Simple swing applications, Layout
management – Layout manger types – border, grid and flow
Event handling – Events, Event Sources, Event classes, Event Listeners, Relationship between Event
sources and Listeners, Delegation event model, Examples: handling a button click, handling mouse
events, Adapter classes.
Applets – Inheritance hierarchy for applets, differences between applets and applications, life cycle of
an applet, passing parameters to applets, applet security issues,Introduction to Spring.
TEXT BOOK:
1. Java Fundamentals – A comprehensive introduction, Herbert Schildt and Dale Skrien, TMH
REFERENCE BOOKS :
1. Java for Programmers, P.J.Deitel and H.M.Deitel, Pearson education (OR) Java: How to
program P.J.Deitel and H.M.Deitel, PHI.
2. Object Oriented Programming through Java, P. Radha Krishna Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education.
4. Programming in Java, S.Malhotra and S. Choudhary, Oxford Univ. Press.
5. Spring 3.0,Black book,Dreamtech,Prabhu Sunderraman.
Outcomes:
 Understanding of OOP concepts and basics of java programming (Console and GUI based)
 The skills to apply OOP and Java programming in problem solving.
 Should have the ability to extend his/her knowledge of Java programming further on his/her
own.


0 0 3 1.5
(R18CSE22L1) Operating Systems Lab

Objectives:
 To use Linux Operating system for study of operating system concepts.
 To write the code to implemented modify various concepts in operating systems using Linux.
List of Programs:
1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate all page replacement algorithms
a) FIFO b) LRU c) LFU d) OPT
3. Simulate Paging Technique of memory management.
4. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
5. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
6. Simulate Bankers Algorithm for Dead Lock Avoidance
7. Simulate Bankers Algorithm for Dead Lock Detection
Outcomes:
 The course objectives ensure the development of students applied skills in operating systems
related areas.
 Students Williams knowledge in writing Software routines Modules or implementing various
concepts of Operating systems


0 0 3 1.5
(R18CSE22L2) Database Management Systems Lab

Objectives:
 This lab enables the students to practice the concept learnt in the subject DBMS by developing
a database for an 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". Students are expected to use "Mysql"
database.
Roadway Travels
"Roadway Travels" is in business since 1997 with several buses connecting different places in india. Its
main office is located in Hydearabd.
The company wants to computerize its operations in the following areas:
 Reservation and Ticketing
 Cancellations
Reservation & Cancellation:

Reservations are directly handled by booking office. Reservations can be made 30 days in advance and
tickets issued to passenger. One Passenger/person can book many tickets (to his/her family).
Cancellations are also directly handed at the bokking office.
In the process of computerization of Roadway Travels you have to design and develop a Database
which consists the data of Buses, Passengers, Tickets, and Reservation and cancellation details. You
should also develop query's usinf SQL to retrieve the data from database.
The above process involves many steps like 1. Analyzing the problem and identifying the Entities and
Relationships, 2. E-R Model 3. Relational Model 4. Normalization 5. Creating the database 6.
Querying. Students are suppossed to work on these steps week wise and finally create a complete
"Database System" to Roadway Travels. Examples are given at every experiment for guidance to
students.
Experiment 1: E-R Model
Analyze the carefully and come up with the entities in it. Identitfy what data has to be persisted in the
database. This contains the entities, attributes etc.
Identify the primary keys for all the entities. Identify the others keys like candidate keys, partial keys,
if any.
Example: Entities:
1. BUS
2. Ticket
3. Passenger
Relationships:
1. Reservation
2. Cancellation

PRIMARY KEY ATTRIBUTES:
1. Ticket ID (Ticket Entity)

2. Passport ID (Passenger Entity)
3. Bus_No (Bus Entity)
Apart from the above mentioned entities you can identify more. The above mentioned are few.
Note: The student is required to submit a document by writing the Entities and keys to the lab teacher.
Experiment 2: Concept design with E-R Model
Relate the entities appropriately. Apply cardnalities for each relationship. Identify strong entities and
weak entities (if any). Indicate the type of relationships (total / partial). Try to incorporate
generalization, aggregation, specialization etc wherever required.
Example: E-R diagram for bus
Note: The student is required to submit a document by drawing the E-R Diagram to the lab teacher.
Experiment 3: Relational Model
Represent all the entities (Strong, Weak) in tabular fashion. Represent realtionships in a tabular
fashion. There are different ways of representing relationships as tables based on the requirement.
Different types of attributes (Composite, Multi-valued, and Derived) have different way of
representation.
Example: The passenger tables look as below. This is an example. You can add more attributes based
on E-R model. This is not a normalized table.
Passenger
Name Age Sex Address Ticket_id Passport ID
Note: The student is required to submit a document by Represent relationships in a tabular fashion to
the lab teacher.

Experiment 4: Normalization
Database normalization is a technique for designing realtional database tables to minimize duplication
of information and, in so doing, to safegaurd the database against certain types of logical or structural
problems, namely data anormalies. For example, when multiple instances of a given piece of
information occur in a table, the possibility exists that these instances will not be kept consistent when
the data within tha table is updated, leading to a loass of data integrity. A table that is sufficiently
normalized is less vulnerable to problems of this kind, because its structure reflects the basic
assumptions for when multiple instances of the same information should be represented by a single
instance only.
For the above table in the First normalization we can remove the multiple valued attribute Ticket_id
and place it in another table along with the primary key of passenger.
First Normal Form: The above table can divided into two tables as shown below.
Passenger
Name Age Sex Address Passport ID
Passport ID Ticket_id
You can do the second and third normal forms if required. Any how Normalized tables are given at the
end.
Experiment 5: Installation of MySQL and practice DDL commands
Installation of MySQL. In this week you will learn Creating databases, How to create tables, altering
the database, droping tables and databases if not required. You will also try truncate, rename
commands etc.
Example for creation of a normalized "Passenger" table.
CREATE TABLE Passenger(

Passport_id INTEGER PRIMARY KEY,
Name VARCHAR(50) NOT NULL,
Age INTEGER NOT NULL,
Sex CHAR,
Address VARCHAR(50) NOT NULL
);

Similarly create all other tables.

Note: Detailed creation of tables is given at the end.
Experiment 6: Practicing DML commands
DML commandsare used for managing data within schema objects. Some examples:
 SELECT - retrieve data from the database

 INSERT - insert data into a table
 UPDATE - updates exisitng data within a table
 DELETE - deletes all records from a table, the space for the records remain
insert values into "Bus" table:
insert into Bus values (1234, 'hyderabad', 'tirupathi');
insert into Bus values(2345, 'hyderabad', 'banglore');
insert into Bus values(23, 'hyderabad', 'kolkata');
insert into Bus values(45, 'tirupathi', 'bangalore');
insert into Bus values(34, 'hyderabad', 'chennai');

insert values into "Passenger" table:
insert into Passenger values(1, 45, 'ramesh', 45, 'M', 'abc123');
insert into Passenger values(2, 78, 'geetha', 36, 'F', 'abc124');
insert into Passenger values(45, 90, 'ram', 30, 'M', 'abc12');
insert into Passenger values(67, 89, 'ravi', 50, 'M', 'abc14');
insert into Passenger values(56, 22, 'seetha', 32, 'F', 'abc55');

Few more Examples of DML commands:
SELECT * FROM Bus; (selects all the attributes and displays)

UPDATE Bus SET Bus_No = 1 WHERE Bus_No = 2;
Experiment 7: Querying
In this week you are going to practice queries(along with sub queries) using ANY, ALL, IN, EXISTS,
NOT EXIST, UNION, INTERSECT, Constraints etc.
Practice the following Queries:
1. Dispaly unique PNR_No of all passengers.
2. Display all the names of male passengers.
3. Display the ticket numbers and names of all the passengers.
4. Find the ticket numbers of the passengers whose name start with 'r' and ends with 'h'.
5. Find the names of passengers whose age is between 30 and 45.
6. Display all the passengers names beginning with 'A'
7. Display the sorted list of passengers names.

Experiment 8 and Experiment 9: Querying (continued...)

You are going to practice queries using Aggregate functions (COUNT, SUM, AVG, MAX,and MIN),
GROUP BY, HAVING and Creation and droping of VIEWS.
1. Write a Query to display the information present in the Passenger and cancellation tables. Hint:
Use UNION Operator.
2. Display the number of days in a week on which the 9W01 bus is available.
3. Find number of tickets booked for each PNR_No using GROUP BY CLAUSE. Hint: Use
GROUP BY on PNR_No.
4. Find the distinct PNR numbers that are present.
5. Find the number of tickets booked by a passenger where the number of seats is greater than 1.
Hint: Use GROUP BY, WHERE and HAVING CLAUSES.
6. Find the total number of cancelled setas.
Experiment 10: Triggers

In this week you are going to work on Triggers. Creation of insert trigger, delete trigger, update trigger.
Practice triggers using the above database.
E.g:
CREATE TRIGGER updatecheck BEFORE UPDATE ON passenger FOR EACH ROW

BEGIN
IF NEW.TickentNO > 60 THEN
SET New.TickentNO = TicketNo;
ELSE
SET New.TicketNo = 0;
END IF;
END
Experiment 11: Procedures
In this session you are going to learn Creation of stored procedure, Execution of procedure and
modification of procedure. Practice procedures using the database.
E.g:
CREATE PROCEDURE myproc()

BEGIN
SELECT COUNT(Tickets)
FROM Ticket
WHERE age >= 40;
END;
Experiment 12: Cursors
In this week you need to do the following: Declare a cursor that defines a result set.
Open the cursor to establish the result set. Fetch the data into local variables as needed from the cursor,
one row at a time. Close the cursor when done

CREATE PROCEDURE myproc(in_customer_id INT)

BEGIN
DECLARE v_id INT;
DECLARE v_name VARCHAR(30);
DECLARE c1 CURSOR FOR
SELECT stdid, stdFirstname FROM students WHERE stdid - in_customer_id;
OPEN c1;
FETCH c1 INTO v_id, v_name;
CLOSE c1;
END;
Tables:
BUS
Bus No: VARCAHR : PK(primary key)
Source: VARCHAR
Destination: VARCHAR
Passenger
PPNO: VARCHAR(15) : PK
Name: VARCHAR(15)
Age: INT(4)
Sex: CHAR(10) : Male/Female
Address: VARCHAR(20)
Passenger_Tickets
PPNO: VARCHAR(15) : PK
Ticket_No: NUMERIC(9)
Reservation
PNR_No: NUMERIC(9) : FK
Journey_date: DATETIME(8)
No_of_seats: INT(8)
Address: VARCHRA(50)
Contact_No: NUMERIC(9) --> Should not less than 9 and Should not accept any other character other
than interger
STATUS: CHAR(2) : Yes/No
Cancellation
PNR_No: NUMERIC(9) : FK
No_of_seats: INT(8)
Address: VARCHRA(50)
Contact_No: NUMERIC(9) --> Should not less than 9 and Should not accept any other character other
than interger
STATUS: CHAR(2) : Yes/No
Ticket
Ticket_No: NUMERIC(9) : FK
Age: INT(4)
Sex: CHAR(10) : Male/Female
Source: VARCHAR
Destination: VARCHAR
Dep_time: VARCHAR

RFERENCE BOOKS:
1. Introduction to SQL, Rick F.vander Lans, Pearson education.

2. Oracle PL/SQL, B.Rosenzweig and E.Silvestrova, Pearson education.
3. Oracle PL/SQL Programming, Steven Feuerstein, SPD.
4. SQL & PL/SQL for Oracle 10g, Black Book, Dr. P.S. Deshpande, Dream Tech.
5. Oracle Database 11g PL/SQL Programming, M.Mc Laughlin, TMH.
6. SQL Fundamentals, J.J. Patrick, Pearson Education.
Outcomes:
 Ability to design and implement a database schema for given problem.

 Be capable to Design and build a GUI application.
 Apply the normalization techniques for development of application software to realistic
problems.
 Ability to formulate queries using SQL DML/DDL/DCL commands.


0 0 2 1
(R18CSE22L3) Java Programming Lab

Objectives:
 To introduce java compiler and eclipse platform.
 To impart hand on experience with java programming.
Note:
i. Use Linux and MySQL for the Lab Experiments. Though not mandatory, encourage the use of
Eclipse platform.
ii. The list suggests the minimum program set. Hence, the concerned staff is requested to add more
problems to the list as needed.
1. Use Eclipse or Netbean platform and acquaint with the various menus. Create a test project, add
a test class and run it. See how you can use auto suggestions, auto fill. Try code formatter and
code refactoring like renaming variables, methods and classes. Try debug step by step with a
small program of about 10 to 15 lines which contains at least one if else condition and a for
loop.
2. Write a Java program that works as a simple calculator. Use a grid layout to arrange buttons for
the digits and for the +, -, *, % operations. Add a text field to display the result. Handle any
possible exceptions like divided by zero.
3.
a. Develop an applet in Java 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.
4. Write a Java program that creates a user interface to perform integer divisions. The user enters
two numbers in the text fields, Num1 andNum2. The division of Num1 and Num2 is displayed
in the Result field when the Divide button is clicked. If Num1 or Num2 were not an integer, the
program would throw a Number Format Exception. If Num2 were Zero, the program would
throw an Arithmetic Exception. Display the exception in a message dialog box.
5. Write a Java program that implements a multi-thread 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.
6. Write a Java program that connects to a database using JDBC and does add, delete, modify and
retrieve operations.
7. Write a Java program that simulates a traffic light. The program lets the user select one of three
lights: red, yellow, or green with radio buttons. On selecting a button, an appropriate message
with "Stop" or "Ready" or "Go" should appear above the buttons in selected colr. Initially there
is no message shown.
8. 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.

9. 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 seperated by
commas. Write a java program to display the table using Labels in Grid Layout.
10. 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).
11. 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 are seperated by a tab ( ). It takes a
name or phone number as input and prints the corresponding other value from the hash table
(hint: use hash tables).
12. Implement the above program with database instead of a text file.
13. Write a Java program that takes tab seperated data (one record per line) from a text file and
inserts them into a database.
14. Write a java program that prints the meta-data of a given table.
TEXT BOOK:
1. Java Fundamentals - A comprehensive Introduction, Herbert Schildt and dale skrien, TMH.
REFERENCE BOOKS:
1. Java for Programmers, P.J. Deitel and H.M. Deitel, Pearson education (OR) Java: How to
Program P.J. Deitel and H.M. Deitel, PHI.
2. Object Orients Programming through Java, P. Radha Krishna, Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education.
4. Programming in Java, S. Malhotra and S. Choudhary, Oxford Univ. Press.
Outcomes:
 Basics of java programming, multi-threaded programs and Exception handling.

 The skills to apply OOP in Java programming in problem solving.
 Ability to access data from a DB with Java programs.
 Use of GUI components (Console and GUI based).


3 0 0 0
(R18MAC2200) Intellectual Property Rights
UNIT – I: Introduction to Intellectual property:

Introduction, types of intellectual property, international organizations, agencies and treaties,
importance of intellectual property rights.
UNIT – II: Trade Marks:

Purpose and function of trademarks, acquisition of trade mark rights, protectable matter, selecting, and
evaluating trade mark, trade mark registration processes.
UNIT – III: Law of copy rights :

Fundamental of copy right law, originality of material, rights of reproduction, rights to perform the
work publicly, copy right ownership issues, copy right registration, notice of copy right, international
copy right law. Law of patents: Foundation of patent law, patent searching process, ownership rights
and transfer
UNIT – IV: Trade Secrets:

Trade secrete law, determination of trade secrete status, liability for misappropriations of trade secrets,
protection for submission, trade secrete litigation. Unfair competition: Misappropriation right of
publicity, false advertising.
UNIT – V: New development of intellectual property:

New developments in trade mark law; copy right law, patent law, intellectual property
audits. International overview on intellectual property, international – trade mark law, copy right law,
international patent law, and international development in trade secrets law.
TEXT BOOKS & REFERENCES:

 Intellectual property right, Deborah. E. Bouchoux, Cengage learning.
 Intellectual property right – Unleashing the knowledge economy, prabuddha ganguli, Tate
McGraw Hill Publishing company ltd.,


B.Tech. - III Year – I Semester L T P C
3 0 0 3
(R18MBA2201) Business Economics & Financial Analysis
Objectives:
To enable the student to understand and appreciate, with a particular insight, the importance
of certain basic issues governing the business operations namely; demand and supply,
production function, cost analysis, markets, forms of business organizations, capital
budgeting and financial accounting and financial analysis.
Unit I
Introduction & Demand Analysis: Definition, Nature and Scope of Managerial Economics.
Demand Analysis: Demand Determinants, Law of Demand and its exceptions. Elasticity of
Demand: Definition, Types, Measurement and Significance of Elasticity of Demand. Demand
Forecasting, Factors governing demand forecasting, methods of demand forecasting.
Unit II
Production & Cost Analysis: Production Function - Isoquants and Isocosts, MRTS, Least
Cost Combination of Inputs, Cobb-Douglas Production function, Laws of Returns, Internal
and External Economies of Scale. Cost Analysis: Cost concepts. Break-even Analysis (BEA)-
Determination of Break-Even Point (simple problems) - Managerial Significance.
Unit III
Markets & New Economic Environment: Types of competition and Markets, Features of
Perfect competition, Monopoly and Monopolistic Competition. Price-Output Determination
in case of Perfect Competition and Monopoly. Pricing: Objectives and Policies of Pricing.
Methods of Pricing. Business: Features and evaluation of different forms of Business
Organisation: Sole Proprietorship, Partnership, Joint Stock Company, Public Enterprises and
their types, New Economic Environment: Changing Business Environment in Post-
liberalization scenario.
Unit IV
Capital Budgeting: Capital and its significance, Types of Capital, Estimation of Fixed and
Working capital requirements, Methods and sources of raising capital - Trading Forecast,
Capital Budget, Cash Budget. Capital Budgeting: features of capital budgeting proposals,
Methods of Capital Budgeting: Payback Method, Accounting Rate of return (ARR) and Net
Present Value Method (simple problems).
Unit V
Introduction to Financial Accounting & Financial Analysis: Accounting concepts and
Conventions - Introduction IFRS - Double - Entry Book Keeping, Journal, Ledger, Trial
Balance - Final Accounts (Trasing Account, Profit and Loss Account and Balance Sheet with
simple adjustments). Financial Analysis: Analysis and Interpretation of Liquidity Ratios,
Activity Ratios, and Capital structure Ratios and Profitability ratios. Du Pont Chart.
TEXT BOOKS:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand, 2009.
2. S.A. Siddiqui & A.S. Siddiqui, Managerial Economics and Financial Analysis, New
Age international Publishers, Hyderabad 2013.
3. M. Kasi Reddy & Saraswathi, Managerial Economics and Financial Analysis, PHI
New Delhi, 2012.
REFERENCES:
1. Ambrish Gupta, Financial Accounting for Management, Pearson Education, New
Delhi, 2012.
2. H. Craig Peterson & W. Cris Lewis, Managerial Economics, Pearson, 2012.
3. Lipsey & Chrystel, Economics, Oxford University Press, 2012.
4. Domnick Salvatore: Managerial Economics In a Global Economy, Thomson, 2012.
5. Narayanaswamy: Financial Accounting - A Managerial Perspective, Pearson, 2012.
6. S.N. Maheswari & S.K. Maheswari, Financial Accounting, Vikas, 2012.
7. Truet and Truet: Managerial Economics: Analysis, Problems and Cases, Wiley, 2012.
8. Dwivedi: Managerial Economics, Vikas, 2012.
9. Shailaja & Usha: MEFA, University Press, 2012.
10. Aryasri: Managerial Economics and Financial Analysis, TMH, 2012.
11. Vijay Kumar & Appa Rao, Managerial Economics & Financial Analysis, Cengage
2011.
12. J.V. Prabhakar Rao & P.V. Rao, Managerial Economics & Financial Analysis,
Maruthi Publishers, 2011.
Outcomes:
At the end of the course, the student will
 Understand the market dynamics namely, demand and supply, demand forecasting,
elasticity of demand and supply, pricing methods and pricing in different market
structures.
 Gain an insight into how production function is carried out to achieve least cost
combination of inputs and cost analysis.
 Develop an understanding of
 Analyse how capital budgeting decisions are carried out.
 Understanding the framework for both manual and computerised accounting process
 Know how to analyse and interpret the financial statements through ratio analysis.


3 0 0 3
(R18CSE3102) Software Engineering

Objectives:
 To understanding of software process models such as waterfall and evolutionary models.
 To understanding of software requirements and SRS document.
 To understanding of different software architectural styles.
 To understanding of software testing approaches such as unit testing and integration testing.
 To understanding on quality control and how to ensure good quality software.
UNIT - I:
Introduction to Software Engineering: The evolving role of software, Changing Nature of
Software, Legacy 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.
UNIT - II:
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.
UNIT - III:
Design Engineering: Design process and Design quality, Design concepts, the design model, pattern
based software design.
Creating an architectural design: software architecture, Data design, Architectural styles and
patterns, Architectural Design, assessing alternative architectural designs, mapping data flow into a
software architecture.
Modeling component-level design : Designing class-based components, conducting component-level
design, Object constraint language, designing conventional components.
Performing User interface design: Golden rules, User interface analysis and design, interface
analysis, interface design steps, Design evaluation.
UNIT - IV:
Testing Strategies: A strategic approach to software testing, test strategies for conventional software,
Black-Box and White-Box testing, Validation testing, System testing, the art of Debugging.
Product metrics: Software Quality, Frame work for Product metrics, 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.

UNIT - V:
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. Software Engineering A practitioner’s Approach, Roger S Pressman, 6th edition.

McGrawHill International Edition.
2. Software Engineering, Ian Sommerville, 7th edition, Pearson education.
REFERENCE BOOKS :
1. Software Engineering, A Precise Approach, Pankaj Jalote, Wiley India, 2010.

2. Software Engineering: A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008
3. Fundamentals of Software Engineering, Rajib Mall, PHI, 2005
4. Software Engineering, Principles and Practices, Deepak Jain, Oxford University Press.
5. Software Engineering1: Abstraction and modelling, Diner Bjorner, Springer International
edition, 2006.
6. Software Engineering2: Specification of systems and languages, Diner Bjorner, Springer
International edition 2006.
7. Software Engineering Foundations, Yingux Wang, Auerbach Publications, 2008.
8. Software Engineering Principles and Practice, Hans Van Vliet, 3rd edition, John Wiley & Sons
Ltd.
9. Software Engineering3: Domains, Requirements, and Software Design, D. Bjorner, Springer
International Edition.
10. Introduction to Software Engineering, R. J. Leach, CRC Press.
Outcomes:
 Ability to identity the minimum requirements for the development of application.

 Ability to develop, maintain, efficient, reliable and cost effective software solutions.
 Ability to critically thinking and evaluate assumptions and arguments.



3 0 0 3
(R18CSE3103) Computer Networks

Objectives:
 To introduce the fundamental various types of computer networks.
 To demonstrate the TCP/IP and OSI models with merits and demerits.
 To explore the various layers of OSI Model.
 To introduce UDP and TCP Models.
UNIT - I:
Overview of the Internet: Protocol, Layering Scenario, TCP/IP Protocol Suite: The OSI Model,
Internet history standards and administration; Comparison of the OSI and TCP/IP reference model.
Physical Layer: Guided transmission media, wireless transmission media.
Data Link Layer - design issues, CRC codes, Elementary Data Link Layer Protocols, sliding window
protocol
UNIT - II:
Multi Access Protocols - ALOHA, CSMA, Collision free protocols, Ethernet- Physical Layer,
Ethernet Mac Sub layer, data link layer switching & use of bridges, learning bridges, spanning tree
bridges, repeaters, hubs, bridges, switches, routers and gateways.
UNIT - III:
Network Layer: Network Layer Design issues, store and forward packet switching connection less
and connection oriented networks-routing algorithms-optimality principle, shortest path, flooding,
Distance Vector Routing, Control to Infinity Problem, Hierarchical Routing, Congestion control
algorithms, admission control.
UNIT - IV:
Internetworking: Tunneling, Internetwork Routing, Packet fragmentation, IPv4, IPv6 Protocol, IP
addresses, CIDR, IMCP, ARP, RARP, DHCP.
Transport Layer: Services provided to the upper layers elements of transport protocol-addressing
connection establishment, Connection Release, Crash Recovery.
UNIT - V:
The Internet Transport Protocols: UDP-RPC, Real Time Transport Protocols, The Internet Transport
Protocols- Introduction to TCP, The TCP Service Model, The TCP Segment Header, The Connection
Establishment, The TCP Connection Release, The TCP Connection Management Modeling, The TCP
Sliding Window, The TCP Congestion Control, The future of TCP.
Application Layer- Introduction, providing services, Applications layer paradigms, Client server
model, Standard client-server application-HTTP, FTP, electronic mail, TELNET, DNS, SSH

TEXT BOOKS:
1. Data Communications and Networking - Behrouz A. Forouzan, Fifth Edition TMH, 2013.
2. Computer Networks - Andrew S Tanenbaum, 4th Edition, Pearson Education.
REFERENCES BOOKS:
1. An Engineering Approach to Computer Networks - S. Keshav, 2nd Edition, Pearson Edication.
2. Understanding communications and Networks, 3rd Edition, W. A. Shay, Cengage Learning.
3. Introduction to Computer Networks and Cyber Security, Chwan-Hwa (John) Wu, J. David
Irwin, CRC Press.
4. Computer Networks, L. L. Peterson and B. S. Davie, 4th edition, ELSEVIER.
5. Computer Networking: A Top-Down Approach Featuring the Internet, James F. Kurose, K. W.
Ross, 3rd Edition, Pearson Eduction.
Outcomes:
 Students should be understand and explore the basics of Computer Networks and Various
Protocols. He/She will be in a position to understand the World Wide Web concepts.
 Students will be in a position to administrate a network and flow of information further he/she
can understand easily the concepts of network security, Mobile, and ad hoc networks.


3 0 0 3
(R18CSE3104) Web Technologies

Objectives:
 To introduce PHP language for server side scripting
 To introduce XML and processing of XML Data with Java
 To Introduce Server Side Programming with Java Servlets and JSP
 To Introduce Client side scripting with Javascript and AJAX
UNIT – I
Introduction to PHP : Declaring Variables, data types, arrays, string operators, expressions, control
structures, functions, Reading data from web from 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, deleting
etc. on text and binary files, listing directories.
UNIT - II
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
in java.
UNIT – III
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, connecting to a database using JDBC.
UNIT – IV
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.
UNIT – V
Client side Scripting : Introduction to Javascript: Javascript Language – declaring variables, scope of
variables, functions, evnt handlers (onclick, onsubmit etc.), Document Object Model, Form Validation.
Simple AJAX application.
TEXT BOOKS:
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill
REFERENCE BOOKS:
1. Web Programming, building internet applications, Chris Bates 2 nd Edition, Wiley Dreamtech.
2. Java Server Pages – Hans Bergsten, SPD O’Reilly
3. Java Script, D. Flanagan, O’Reilly, SPD
4. Beginning Web Programming- Jon Duckett WROX.
5. Programming world wide web, R.W. Sebesta, Fourth Edition, Pearson
6. Internet and World Wide Web – How to program, Dietel and Nieto, Pearson

Outcomes:
 Gain knowledge of client side scripting, validation of forms and AJAX programming.
 Have understanding of server side scripting with PHP language.
 Have understanding of what is XML and how to parse and use XML Data with Java
 To introduce Server side programming with Java Servlets and JSP.


3 0 0 3
Professional Elective-I
(R18CSE3111) Advanced Computer Architecture
Objectives:
 Understand The Micro-Architectural Design Of Processors
 Learn About The Various Techniques Used To Obtain Performance Improvement And Power
Savings In Current Processors
UNIT – I
Fundamental of computer design-technology trends –cost-measuring and reporting performance
quantitative principle of computer design.
UNIT – II
Instruction set principles and examples-classifying instruction set memory addressing –type and size of
operands –addressing modes for signal processing –instruction level parallelism(ILP)-over coming data
hazards –high performance instruction delivery-limitation of ILP
UNIT – III
ILP software approach-compiler techniques-static branch protection –VLIW approach –HW support
for more ILP at compile time-H W verses S.W solutions
UNIT – IV
Memory hierarchy design-cache performance –reducing cache misses penalty and miss rate-virtual
memory-protection and example of VM. multiprocessors and thread level parallelism
UNIT – V
Storage Systems –Types-Buses –Raid-Errors And Failures.
Inter connection networks and clusters-interconnection network media-practical issues in
interconnecting network
TEXT BOOKS:
1.Computer Architecture A Quantitative Approach 3rd Edition John L.Hennessy &David A.
Patterson Morgon Kufmann(An Imprint Of Elsevier )
REFERENCE BOOK:
1. “Computer Architecture and Parallel Processing”Kai Hwang and A. Briggs international Edition
McGraw-Hill.
2. Advanced computer Architecture, dezso sima,Terence fountiain,peter kacsuk,person.
3. Parallel computer Architecture,a hardware /software approach ,david e.culler,jaswinder pal singh
with anoop gupta,Elsevier
Outcomes:
At the end of the course, the student should be able to:
 Evaluate Performance Of Different Architectures With Respect To Various Parameters
 Analyze Performance Of Different ILP Techniques
 Identify Cache and Memory Related Issues in Multi-Processors Possess the skill for
representing knowledge using the appropriate technique.


3 0 0 3
(R18CSE3112) Formal Languages & Automata Theory
Objectives:
The purpose of this course is to acquaint the student with an overview of the theoretical foundations of
computer science from the perspective of formal languages.
 Classify machines by their power to recognize languages.
 Employ finite state machines to solve problems in computing.
 Explain deterministic and non-deterministic machines.
 Comprehend the hierarchy of problems arising in the computer sciences.
UNIT I :
Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions,
finite automaton model, acceptance of strings, and languages, deterministic finite automaton and
non deterministic finite automaton, transition diagrams and Language recognizers.
Finite Automata : NFA with Î transitions - Significance, acceptance of languages. Conversions
and Equivalence : Equivalence between NFA with and without Î transitions, NFA to DFA
conversion, minimisation of FSM, equivalence between two FSM’s, Finite Automata with output-
Moore and Melay machines.
UNIT II :
Regular Languages : Regular sets, regular expressions, identity rules, Constructing finite Automata
for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping
lemma of regular sets, closure properties of regular sets (proofs not required).
Grammar Formalism : Regular grammars-right linear and left linear grammars, equivalence
between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees,
sentential forms. Right most and leftmost derivation of strings.
UNIT III :
Context Free Grammars : Ambiguity in context free grammars. Minimisation of Context
Free Grammars. Chomsky normal form, Greiback normal form, Pumping Lemma for Context
Free Languages. Enumeration of properties of CFL (proofs omitted).
Push Down Automata : Push down automata, definition, model, acceptance of CFL, Acceptance
by final state and acceptance by empty state and its equivalence. Equivalence of CFL and
PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA.
UNIT IV :
Turing Machine : Turing Machine, definition, model, design of TM, Computable functions,
recursively enumerable languages. Church’s hypothesis, counter machine, types of Turing machines
(proofs not required). linear bounded automata and context sensitive language.
UNIT V :
Computability Theory : Chomsky hierarchy of languages, linear bounded automata and
context sensitive language, LR(0) grammar, decidability of problems, Universal Turing Machine,
undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP
problems, NP complete and NP hard problems.

TEXT BOOKS :
1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and Ullman J.
D. Pearson Education
2. Introduction to Theory of Computation – Sipser 2nd edition Thomson
REFERENCES BOOKS:
1. Introduction to Forml languages Automata Theory and Computation Kamala Krithivasan Rama R.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. Theory Of Computation: A Problem - Solving Approach, Kavi Mahesh, Wiley India Pvt. Ltd.
4. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson /PHI.
5. Theory of Computer Science – Automata languages and computation -Mishra and
Chandrashekaran, 2nd edition, PHI.
Outcomes:
 Graduate should be able to understand the concept of abstract machines and their power to
recognize the languages.
 Attains the knowledge of language classes & grammars relationship among them with the help
of Chomsky hierarchy.
 Graduate will be able to understanding the pre-requisites to the course compiler or advanced
compiler design.


3 0 0 3
(R18CSE3113) Principles of Programming Languages
Objectives:
 To briefly describe various programming paradigms.
 To provide conceptual understanding of High level language design and implementation.
 To introduce the power of scripting languages.
UNIT I :
Preliminary Concepts: Reasons for studying, concepts of programming languages,
Programming domains, Language Evaluation Criteria, influences on Language design, Language
categories, Programming Paradigms – Imperative, Object Oriented, functional Programming , Logic
Programming. Programming Language Implementation – Compilation and Virtual Machines,
programming environments. Syntax and Semantics: general Problem of describing Syntax and
Semantics, formal methods of describing syntax - BNF, EBNF for common programming languages
features, parse trees, ambiguous grammars, attribute grammars, denotational semantics and axiomatic
semantics for common programming language features.
UNIT II :
Data types: Introduction, primitive, character, user defined, array, associative, record, union,
pointer and reference types, design and implementation uses related to these types. Names, Variable,
concept of binding, type checking, strong typing, type compatibility, named constants, variable
initialization. Expressions and Statements: Arithmetic relational and Boolean expressions, Short
circuit evaluation mixed mode assignment, Assignment Statements, Control Structures – Statement
Level, Compound Statements, Selection, Iteration, Unconditional Statements, guarded commands.
UNIT III :
Subprograms and Blocks: Fundamentals of sub-programs, Scope of life time of variables, static and
dynamic scope, design issues of subprograms and operations, local referencing environments,
parameter passing methods, overloaded sub-programs, generic sub-programs, parameters that are sub-
program names, design issues for functions user defined overloaded operators, co routines.
UNIT IV :
Abstract Data types: Abstractions and encapsulation, introductions to data abstraction, design
issues, language examples, C++ parameterized ADT, object oriented programming in small talk, C++,
Java, C#, Ada 95
Concurrency: Subprogram level concurrency, semaphores, monitors, massage passing, Java
threads, C# threads.
Exception handling: Exceptions, exception Propagation, Exception handler in Ada, C++ and Java.
Logic Programming Language: Introduction and overview of logic programming, basic elements
of prolog, application of logic programming.

UNIT V:
Functional Programming Languages: Introduction, fundamentals of FPL, LISP, ML,
Haskell, application of Functional Programming Languages and comparison of functional and
imperative Languages.
Scripting Language: Pragmatics, Key Concepts, Case Study: Python- Values and Types, Variables,
Storage and Control, Bindings and Scope, Procedural Abstraction, Separate Compilation, Module
Library.
TEXT BOOKS:
1. Concepts of Programming Languages Robert .W. Sebesta 8/e, Pearson Education, 2008.
2. Programming Language Design Concepts, D. A. Watt, Wiley dreamtech, rp-2007.
REFERENCE BOOKS:
1. Programming Languages, 2nd Edition, A. B. Tucker, R. E. Noonan, TMH.
2. Programming Languages, K. C. Louden, 2nd Edition, Thomson, 2003.
3. LISP Patric Henry Winston and Paul Horn Pearson Education.
4. Programming in Prolog, W. F. Clocksin & C. S. Mellish, 5th Edition, Springer.
5. Programming Python, M. Lutz, 3rd Edition, O'reilly, SPD, rp-2007.
6. Core Python Programming, Chun, II Edition, Pearson Education, 2007.
7. Guide to Programming with Python, Michel Dawson, Thomson, 2008
Outcomes:
 Ability to express syntax and semantics in formal notation.
 Ability to apply suitable programming paradigm for the application.
 Gain knowledge and comparison of the features programming languages.


3 0 0 3
Professional Elective -II

(R18CSE3121) Advanced Operating Systems
Objectives:
 To understand main components of Real time Operating system and their working
 To study the operations performed by OS as a resource manager
 To understand the scheduling policies of DOS
 To implement the working principles of OS
 To study different OS and compare their features
UNIT I
Real-time operating systems: Design issues, principles and case study.
UNIT II
Distributed operating system: Design issues, features and principles of working, case study.
UNIT III
Network operating system: Design issues, working principles and characteristic features,
case study.
UNIT IV
Kernel development: Issues and development principles, case study.
UNIT V
Protection, privacy, access control and security issues, solutions.
TEXT BOOKS:
1. A. Silberschatz - Applied Operating System Concepts, Wiley, 2000.
2. Lubemir F Bic and Alan C. Shaw - Operating System Principles, Pearson Education, 2003.
REFERENCE BOOKS:
1. Operating Systems : Internal and Design Principles - Stallings, 6th ed., PE.
2. Modern Operating Systems, Andrew S Tanenbaum 3rd ed., PE.
3. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne, 7th ed.,, John
Wiley
4. UNIX User Guide – Ritchie & Yates.
5. UNIX Network Programming - W.Richard Stevens ,1998, PHI.
6. The UNIX Programming Environment – Kernighan & Pike, PE.



3 0 0 3
(18CSE3122) Artificial Intelligence

Objectives:
 To learn the difference between optimal reasoning vs human like reasoning
 To understand the notions of state space representation, exhaustive search, heuristic search along
with the time and space complexities.
 To learn different knowledge representation techniques.
 To understand the applications of AI: namely Game Playing, Theorem proving, Expert Systems,
Machine Learning and Natural Language Processing
UNIT – I
Introduction: History, Intelligent Systems, Foundations of AI, Sub areas of AI, Applications
Problem Solving – State – Space Search and Control Strategies: Introduction General Problem Solving,
Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening A*,
Constraint Satisfaction.
Game Playing, Bounded Look-ahead Strategy and use of Evaluation Functions, Alpha-Beta Pruning.
UNIT – II
Login Concepts and Logic Programming: Introduction, Propositional Calculus Propositional Logic,
Natural Deduction System, Axiomatic System, Semantic Tableau System in Propositional Logic,
Resolution Refutation in Propositions Logic, Predicate Logic, Login Programming.
Knowledge Representation: Introduction, Approaches to Knowledge Representation, Knowledge
Representation using Semantic Network Extended Semantic Networks for KR, Knowledge
Representation using frames.
UNIT – III
Expert System and Applications: Introduction, Phases in Building Expert Systems, Expert, Application
of Expert Systems, List of Sheets and Tools.
Uncertainty Measure – Probability Theory: Introduction, Probability Theory Bayesian Belief Networks,
Certainty Factor Theory, Dempster-Shafer Theory
UNIT – IV
Machine-Learning Paradigms: Introduction, Machine Learning Systems, Supervised and Unsupervised
Learning Inductive Learning, Learning Decision Trees (Text Book 2) Deductive Learning Clustering,
Support Vector Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks, Single-Layer Feed – Forward
Networks, Multi-Layer Feed – Forward Networks Radial-Basis Function Networks, Design Issues of
Artificial Neural Networks, Recurrent Networks.
UNIT – V
Advanced knowledge Representation Techniques: Case Grammars Semantic Web.
Natural Language Processing: Introduction, Sentence Analysis Phases, Grammars and Parsers, Types
of Parsers, Semantic Analysis, Universal Networking knowledge.

TEXT BOOKS:
1. Saroj Koushik, Artificial Intelligence, Cengage Learning, 2011.
2. Russell, Novig, Artificial Intelligence, A Modern Approach, Pearson Education, Second
Edition, 2004.
REFERENCE BOOK:
1) Rich Knight, Nair, Artificial Intelligence, Tata McGraw Hill, Third Edition, 2009
Outcomes:
 Possess the ability to formulate an efficient problem space for a problem expressed in English.
 Possess the ability to select a search algorithm for a problem and characterize its time and space
complexities.
 Possess the skill for representing knowledge using the appropriate technique.
 Possess the ability to apply A1 techniques to solve problems of Game Paying, Expert Systems,
Machine Learning and Natural Language Processing.



3 0 0 3
Professional Elective -II

(R18CSE3123) Distributed Databases
Course Objectives
 To acquire knowledge on parallel and distributed databases and its applications.
 To study the usage and applications of Object Oriented databases.
 To learn the modeling and design of databases
 To acquire knowledge on parallel and distributed databases and its applications.
 Equip students with principles and knowledge of parallel and object oriented databases.
 Topics include distributed DBMS architecture and design; query processing and optimization;
 distributed transaction management and reliability; parallel and object database management
systems.
Course Outcomes
 Understand theoretical and practical aspects of distributed database systems.
 Study and identify various issues related to the development of distributed database system.
 Understand the design aspects of object oriented database system and related development.
UNIT - I
Features of Distributed versus Centralized Databases, Principles of Distributed Databases, Levels Of
Distribution Transparency, Reference Architecture for Distributed Databases, Types of Data
Fragmentation, Integrity Constraints in Distributed Databases, Distributed Database Design
UNIT - II
Translation of Global Queries to Fragment Queries, Equivalence transformations for Queries,
Transforming Global Queries into Fragment Queries, Distributed Grouping and Aggregate Function
Evaluation, Parametric Queries. Optimization of Access Strategies, A Framework for Query
Optimization, Join Queries, General Queries
UNIT - III
The Management of Distributed Transactions, A Framework for Transaction Management, Supporting
Atomicity of Distributed Transactions, Concurrency Control for Distributed Transactions,
Architectural Aspects of Distributed Transactions Concurrency Control, Foundation of Distributed
Concurrency Control, Distributed Deadlocks, Concurrency Control based on Timestamps, Optimistic
Methods for Distributed Concurrency Control.
UNIT - IV
Reliability, Basic Concepts, Nonblocking Commitment Protocols, Reliability and concurrency Control,
Determining a Consistent View of the Network, Detection and Resolution of Inconsistency,
Checkpoints and Cold Restart, Distributed Database Administration, Catalog Management in

Distributed Databases, Authorization and Protection
UNIT - V
Architectural Issues, Alternative Client/Server Architectures, Cache Consistency, Object Management,
Object Identifier Management, Pointer Swizzling, Object Migration, Distributed Object Storage,
Object Query Processing, Object Query Processor Architectures, Query Processing Issues, Query
Execution, Transaction Management, Transaction Management in Object DBMSs, Transactions as
Objects Database Integration, Scheme Translation, Scheme Integration, Query Processing Query
Processing Layers in Distributed Multi-DBMSs, Query Optimization Issues Transaction Management
Transaction and Computation Model, Multidatabase Concurrency Control, Multidatabase Recovery,
Object Orientation and Interoperability, Object Management Architecture CORBA and Database
interoperability, Distributed Component Object Model, COM/OLE and Database Interoperability,
PUSH-Based Technologies
TEXT BOOKS:
1. Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe Pelagatti, TMH.
2. Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick Valduriez , Pearson
Education, 2nd Edition.
REFERENCE BOOKS:
1. Distributed Database Systems, Chanda Ray, Pearson.
2. Distributed Database Management Systems, S. K. Rahimi and Frank. S. Haug, Wiley.


0 0 3 1.5
(R18CSE31L1) Software Engineering Lab

Course Objectives:
 To understand the software engineering methodologies involved in the phases for project
development.
 To gain knowledge about open source tools used for implementing software engineering
methods.
 To exercise developing product-startups implementing software engineering methods.
 Open source Tools: StarUML / UMLGraph / Topcased
Prepare the following documents and develop the software project startup, prototype
model, using software engineering methodology for at least two real time scenarios or for the
sample experiments.
 Problem Analysis and Project Planning -Thorough study of the problem – Identify Project
scope, Objectives and Infrastructure.
 Software Requirement Analysis – Describe the individual Phases/modules of the project and
Identify deliverables. Identify functional and non-functional requirements.
 Data Modeling – Use work products – data dictionary.
 Software Designing – Develop use case diagrams and activity diagrams, build and test class
diagrams, sequence diagrams and add interface to class diagrams.
 Prototype model – Develop the prototype of the product.
 The SRS and prototype model should be submitted for end semester examination.
List of Sample Experiments:

Course management system (CMS)
A course management system (CMS) is a collection of software tools providing an online environment
for course interactions. A CMS typically includes a variety of online tools and environments, such as:
1. An area for faculty posting of class materials such as course syllabus and handouts
2. An area for student posting of papers and other assignments
3. A grade book where faculty can record grades and each student can view his or her grades
4. An integrated email tool allowing participants to send announcement email messages to the
entire class or to a subset of the entire class
5. A chat tool allowing synchronous communication among class participants
6. A threaded discussion board allowing asynchronous communication among participants
In addition, a CMS is typically integrated with other databases in the university so that students
enrolled in a particular course are automatically registered in the CMS as participants in that course.
The Course Management System (CMS) is a web application for department personnel, Academic
Senate, and Registrar staff to view, enter, and manage course information formerly submitted via
paper. Departments can use CMS to create new course proposals, submit changes for existing courses,
and track the progress of proposals as they move through the stages of online approval.

Easy Leave
This project is aimed at developing a web based Leave Management Tool, which is of importance to
either an organization or a college.
The Easy Leave is an Intranet based application that can be accessed throughout the organization or a
specified group/Dept. This system can be used to automate the workflow of leave applications and
their approvals. The periodic crediting of leave is also automated. There are features like notifications,
cancellation of leave, automatic approval of leave, report generators etc in this Tool.
Functional components of the project:

There are registered people in the system. Some are approvers. An approver can also be a requestor. In
an organization, the hierarchy could be Engineers/Managers/Business Managers/Managing Director
etc. In a college, it could be Lecturer/Professor/Head of the Department/Dean/Principal etc.


0 0 3 1.5
(R18CSE31L2) Computer Networks & Web Technologies Lab
Objectives:
To Understand the functionalities of various layers of OSI model
To understand the operating System functionalities
To enable the student to program web applications using the following technologies HTML ,
Javascript ,AJAX ,PHP ,Tomcat Server, Servlets ,JSP
Part – A : Computer Networks Lab:
Implement the data link layer framing methods such as character, character stuffing and bit
stuffing.
Implement on a data set of characters the three CRC polynomials – CRC 12, CRC 16 and
CRC CCIP .
Implement Dijkstra‘s algorithm to compute the Shortest path thru a graph.
Take an example subnet graph with weights indicating delay between nodes. Now obtain
Routing table art each node using distance vector routing algorithm
1. Take an example subnet of hosts. Obtain broadcast tree for it.
2. Take a 64 bit playing text and encrypt the same using DES algorithm.
3.Write a program to break the above DES coding
4.Using RSA algorithm Encrypt a text data and Decrypt the same.
 System/ Software Requirement
Intel based desktop PCs LAN CONNECTED with minimum of 166 MHZ or faster processor with atleast 64 MB
RAM and 100 MB free disk space
Outcomes:
Ability to understand the encryption and decryption concepts in Linux environment
Ability to apply appropriate algorithm for the finding of shortest route.
Ability to configure the routing table.
Part – B : WEB TECHNOLOGIES LAB
1.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)
2.Write an HTML page including any required Javascript 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.
3.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.
4.Write an HTML page that contains a selection box with a list of 5 countries. When the user selects

a country, its capital should be printed next to the list. Add CSS to customize the properties of the
font of the capital (color, bold and font size).
5.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
(a) DOM Parser and
(b) SAX parser
6.Implement the following web applications using
(a) PHP,
(b) Servlets and
(c) JSP:
i. A user validation web application, where the user submits the login name and password to the
server. The name and password are checked against the data already available in Database and if
the data matches, a successful login page is returned. Otherwise a failure message is shown to the
user.
ii. Modify the above program to use an xml file instead of database.
iii. Modify the above program to use AJAX to show the result on the same page below the submit
button.
iv. 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.
v. Modify the above program 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 DB, 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 DB.
vi. A web application takes a name as input and on submit it shows a hello page where 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 message with the duration
of usage (hint: Use session to store name and time).
vii. A web application that takes name and age from an HTML page. If the age is less than 18, it
should send a page with “Hello , you are not authorized to visit this site” message, where should
be replaced with the entered name. Otherwise it should send “Welcome to this site” message.
viii. A web application for implementation:
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)
ix. A web application that lists all cookies stored in the browser on clicking “List Cookies” button.
Add cookies if necessary
Outcomes:
xUse LAMP Stack for web applications
Use Tomcat Server for Servlets and JSPs
Write simple applications with Technologies like HTML, Javascript,
AJAX, PHP, Servlets and JSPs Connect to Database and get results
Parse XML files using Java (DOM and SAX parsers)


0 0 2 1
(R18HAS31L1) Advanced Communication Skills Lab

Introduction
The introduction of the Advanced Communication Skills Lab is considered essential at 3 rd year level.
At this stage, the students need to prepare themselves for their careers which may require them to listen
to, read, speak and write in English both for their professional and interpersonal communication in the
globalised context.
The proposed course should be a laboratory course to enable students to use ‘good’ English and
perform the following:
 Gathering ideas and information to organise ideas relevantly and coherently.
 Engaging in debates.
 Participating in group discussions.
 Facing interviews.
 Writing project/research reports/technical reports.
 Making oral presentations.
 Writing formal letters.
 Transferring information from non-verbal to verbal texts and vice-versa.
 Taking part in social and professional communication.
Objectives:
This Lab focuses on using multi-media instruction for language development to meet the following
targets:
 To improve the students’ fluency in English, through a well-developed vocabulary and enable
them to listen to English spoken at normal conversational speed by educated English speakers
and respond appropriately in different socio-cultural and professional contexts.
 Further, they would be required to communicate their ideas relevantly and coherently in
writing.
 To prepare all the students for their placements.
Syllabus:
The following course content to conduct the activities is prescribed for the Advanced Communication
Skills (ACS) Lab:
1. Activities on Fundamentals of Inter-personal Communication and Building
Vocabulary - Starting a conversation – responding appropriately and relevantly – using the
right body language – Role Play in different situations & Discourse Skills- using visuals -
Synonyms and antonyms, word roots, one-word substitutes, prefixes and suffixes, study of
word origin, business vocabulary, analogy, idioms and phrases, collocations & usage of
vocabulary.
2. Activities on Reading Comprehension –General Vs Local comprehension, reading for
facts, guessing meanings from context, scanning, skimming, inferring meaning, critical
reading & effective googling.
3. Activities on Writing Skills – Structure and presentation of different types of writing –
letter writing/Resume writing/ e-correspondence/ Technical report writing/ Portfolio
writing – planning for writing – improving one’s writing.
4. Activities on Presentation Skills – Oral presentations (individual and group) through JAM

sessions/seminars/PPTs and written presentations through posters/projects/reports/ e-

mails/assignments etc.
5. Activities on Group Discussion and Interview Skills – Dynamics of group discussion,
intervention, summarizing, modulation of voice, body language, relevance, fluency and
organization of ideas and rubrics for evaluation- Concept and process, pre-interview
planning, opening strategies, answering strategies, interview through tele-conference &
video-conference and Mock Interviews.
Minimum Requirement:
The Advanced Communication Skills (ACS) Laboratory shall have the following infra-structural
facilities to accommodate at least 35 students in the lab:
 Spacious room with appropriate acoustics.
 Round Tables with movable chairs
 Audio-visual aids
 LCD Projector
 Public Address system
 P – IV Processor, Hard Disk – 80 GB, RAM–512 MB Minimum, Speed – 2.8 GHZ
 T. V, a digital stereo & Camcorder
 Headphones of High quality
Prescribed Lab Manual: A book titled A Course Book of Advanced Communication Skills (ACS)
Lab published by Universities Press, Hyderabad.
Suggested Software:
The software consisting of the prescribed topics elaborated above should be procured and used.
 Oxford Advanced Learner’s Compass, 7th Edition
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.
 Lingua TOEFL CBT Insider, by Dreamtech
 TOEFL & GRE( KAPLAN, AARCO & BARRONS, USA, Cracking GRE by CLIFFS)
 The following software from ‘train2success.com’
 Preparing for being Interviewed
 Positive Thinking
 Interviewing Skills
 Telephone Skills
 Time Management
Books Recommended:
1. Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University
Press 2009.
2. Advanced Communication Skills Laboratory Manual by Sudha Rani, D, Pearson Education
2011.
3. Technical Communication by Paul V. Anderson. 2007. Cengage Learning pvt. Ltd. New
Delhi.
4. Business and Professional Communication: Keys for Workplace Excellence. Kelly M.
Quintanilla & Shawn T. Wahl. Sage South Asia Edition. Sage Publications. 2011.
5. The Basics of Communication: A Relational Perspective. Steve Duck & David T.
McMahan. Sage South Asia Edition. Sage Publications. 2012.
6. English Vocabulary in Use series, Cambridge University Press 2008.

7. Management Shapers Series by Universities Press(India)Pvt Ltd., Himayatnagar,

Hyderabad 2008.
8. Handbook for Technical Communication by David A. McMurrey & Joanne Buckley. 2012.
Cengage Learning.
9. Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New Delhi, 2009.
10. Handbook for Technical Writing by David A McMurrey & Joanne Buckely CENGAGE
Learning 2008.
11. Job Hunting by Colm Downes, Cambridge University Press 2008.
12. Master Public Speaking by Anne Nicholls, JAICO Publishing House, 2006.
13. English for Technical Communication for Engineering Students, Aysha Vishwamohan, Tata
Mc Graw-Hil 2009.
14. Books on TOEFL/GRE/GMAT/CAT/ IELTS by Barron’s/DELTA/
Cambridge University Press.
15. International English for Call Centres by Barry Tomalin and Suhashini Thomas, Macmillan
Publishers, 2009.
DISTRIBUTION AND WEIGHTAGE OF MARKS:

Advanced Communication Skills Lab Practicals:
1. The practical examinations for the ACS Laboratory practice shall be conducted as per the
University norms prescribed for the core engineering practical sessions.
2. For the English Language lab sessions, there shall be continuous evaluation during the year for 25
sessional marks and 50 End Examination marks. Of the 25 marks, 15 marks shall be awarded for
day-to-day work and 10 marks to be awarded by conducting Internal Lab Test(s). The End
Examination shall be conducted by the teacher concerned, by inviting the External Examiner from
outside. In case of the non-availability of the External Examiner, other teacher of the same
department can act as the External Examiner.
Mini Project: As a part of Internal Evaluation

1. Seminar/ Professional Presentation
2. A Report on the same has to be prepared and presented.
* Teachers may use their discretion to choose topics relevant and suitable to the needs of students.
* Not more than two students to work on each mini project.
* Students may be assessed by their performance both in oral presentation and written report.
Outcomes
 Accomplishment of sound vocabulary and its proper use contextually.
 Flair in Writing and felicity in written expression.
 Enhanced job prospects.
 Effective Speaking Abilities


0 0 2 0
(R18MAC3100) MOOCs-I


B.Tech. - III Year – II Semester L T P C
3 1 0 4
(R18CSE3201) Machine Learning

Course Objectives:
 To be able to formulate machine learning problems corresponding to different applications.
 To understand a range of machine learning algorithms along with their strengths and weaknesses.
 To understand the basic theory underlying machine learning.
 To be able to apply machine learning algorithms to solve problems of moderate complexity.
 To be able to read current research papers and understands the issues raised by current research.
UNIT - I
Introduction - Well-posed learning problems, Designing a learning system, Perspectives and issues in
machine learning Concept learning and the general to specific ordering – Introduction, A concept
learning task, Concept learning as search, Find-S: finding a maximally specific hypothesis, Version
spaces and the candidate elimination algorithm, Remarks on version spaces and candidate elimination,
Inductive bias
UNIT - II
Decision Tree learning – Introduction, Decision tree representation, Appropriate problems for decision
tree learning, The basic decision tree learning algorithm, Hypothesis space search in decision tree
learning, Inductive bias in decision tree learning, Issues in decision tree learning Artificial Neural
Networks – Introduction, Neural network representation, Appropriate problems for neural network
learning, Perceptions, Multilayer networks and the back propagation algorithm, Remarks on the back
propagation algorithm, An illustrative example face recognition Advanced topics in artificial neural
networks
Evaluation Hypotheses – Motivation, Estimation hypothesis accuracy, Basics of sampling theory, A
general approach for deriving confidence intervals, Difference in error of two hypotheses, Comparing
learning algorithms
UNIT - III
Bayesian learning – Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum
likelihood and least squared error hypotheses, Maximum likelihood hypotheses for predicting
probabilities, Minimum description length principle, Bayes optimal classifier, Gibbs algorithm, Naïve
Bayes classifier, An example learning to classify text, Bayesian belief networks The EM algorithm
Computational learning theory – Introduction, Probability learning an approximately correct
hypothesis, Sample complexity for Finite Hypothesis Space, Sample Complexity for infinite
Hypothesis Spaces, The mistake bound model of learning - Instance-Based Learning- Introduction,
k -Nearest Neighbour Learning, Locally Weighted Regression, Radial Basis Functions, Case-Based
Reasoning, Remarks on Lazy and Eager Learning Genetic Algorithms – Motivation, Genetic
Algorithms, An illustrative Example, Hypothesis Space Search, Genetic Programming, Models of
Evolution and Learning, Parallelizing Genetic Algorithms
UNIT - IV
Learning Sets of Rules – Introduction, Sequential Covering Algorithms, Learning Rule Sets: Summary,
Learning First Order Rules, Learning Sets of First Order Rules: FOIL, Induction as Inverted
Deduction, Inverting Resolution Analytical Learning - Introduction, Learning with Perfect Domain
Theories: Prolog-EBG Remarks on Explanation-Based Learning, Explanation-Based Learning of
Search Control Knowledge

UNIT - V
Combining Inductive and Analytical Learning – Motivation, Inductive-Analytical Approaches to
Learning, Using Prior Knowledge to Initialize the Hypothesis, Using Prior Knowledge to Alter the
Search Objective, Using Prior Knowledge to Augment Search Operators, Reinforcement Learning –
Introduction, The Learning Task, Q Learning, Non-Deterministic, Rewards and Actions, Temporal
Difference Learning, Generalizing from Examples, Relationship to Dynamic Programming
TEXT BOOKS:
1. Machine Learning – Tom M. Mitchell, - MGH
2. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis (CRC)
REFERENCE BOOKS:
1. Machine Learning Methods in the Environmental Sciences, Neural Networks, William W Hsieh,
Cambridge Univ Press.
2. Richard o. Duda, Peter E. Hart and David G. Stork, pattern classification, John Wiley & Sons
Inc., 2001
3. Chris Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.


3 1 0 4
(R18CSE3202) Compiler Design
Objectives:
 To describe the steps and algorithms used by language translators.
 To discuss the effectiveness of optimization.
 To explain the machine dependent aspects of Compilation
UNIT – I
Overview of Compilation: Phases of Compilation – Lexical Analysis, Regular Grammar and
regular expression for common programming language features, pass and Phases of translation,
interpretation, bootstrapping, data structures in compilation – LEX lexical analyzer generator.
Top down Parsing: Context free grammars, Top down parsing – Backtracking, LL (1),
recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing.
UNIT – II
Bottom up parsing : Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing ,
handling ambiguous grammar, YACC – automatic parser generator.
UNIT – III
Semantic analysis : Intermediate forms of source Programs – abstract syntax tree, polish notation
and three address codes. Attributed grammars, Syntax directed translation, Conversion of
popular Programming languages language Constructs into Intermediate code forms, Type checker.
Symbol Tables : Symbol table format, organization for block structures languages, hashing,
tree structures representation of scope information. Block structures and non block structure
storage allocation: static, Runtime stack and heap storage allocation, storage allocation for arrays,
strings and records.
UNIT – IV
Code optimization : Consideration for Optimization, Scope of Optimization, local optimization,
loop optimization, frequency reduction, folding, DAG representation.
Data flow analysis : Flow graph, data flow equation, global optimization, redundant sub
expression elimination, Induction variable elements, Live variable analysis, Copy propagation.
UNIT – V
Object code generation : Object code forms, machine dependent code optimization, register
allocation and assignment generic code generation algorithms, DAG for register allocation.
TEXT BOOKS :
1. Principles of compiler design -A.V. Aho . J.D.Ullman; Pearson Education.
2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge University Press.
REFERENCES :
1. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley dreamtech.
3. Engineering a Compiler-Cooper & Linda, Elsevier.
4. Compiler Construction, Louden, Thomson.
Outcomes:
 Ability to undestand the the design of a compiler given features of the languages.
 Ability to implement practical aspects of automata theory.
 Gain Knowledge of powerful compiler generation tools.


3 1 0 4
(R18CSE3203) Design and Analysis of Algorithms
Objectives:
 To analyze performance of algorithms.
 To choose the appropriate data structure and algorithm design method for a specified
application.
 To understand how the choice of data structures and algorithm design methods impacts the
performance of programs.
 To solve problems using algorithm design methods such as the greedy method, divide and
conquer, dynamic programming, backtracking and branch and bound.
 Prerequisites (Subjects) Data structures, Mathematical foundations of computer science.
UNIT I:
Introduction: Algorithm, Psuedo code for expressing algorithms, Performance Analysis-Space
complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation
and Little oh notation, Probabilistic analysis, Amortized analysis.
Divide and Conquer: General method , applications-Binary search, Quick sort, Merge sort,
Strassen’s matrix multiplication.
UNIT II:
Searching and Traversal Techniques: Efficient non - recursive binary tree traversal algorithm,
Disjoint set operations, union and find algorithms, Spanning trees, Graph traversals - Breadth first
search and Depth first search, AND / OR graphs, game trees, Connected Components, Bi - connected
components.
UNIT III:
Greedy Method: General method, applications - Job sequencing with dead lines, 0/1 knapsack
problem, Minimum cost spanning trees, Single source shortest path problem.
Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary
search trees, 0/1 knapsack problem, All pairs shortest path problem,Travelling sales person problem,
Reliability design.
UNIT IV:
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles.
Branch and Bound: General method, applications - Travelling sales person problem,0/1
knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.
UNIT V:
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard
and NP-Complete classes, Cook’s theorem.
TEXT BOOKS :
1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,
Galgotia publications pvt. Ltd.
2. Foundations of Algorithm, 4th edition, R. Neapolitan and K. Naimipour, Jones and Bartlett
Learning.
3. Design and Analysis of Algorithms, P. H. Dave, H. B. Dave, Pearson Education, 2008.
REFERENCES :
1. Computer Algorithms, Introduction to Design and Analysis, 3rd Edition, Sara Baase, Allen,
Van, Gelder, Pearson Education.

2. Algorithm Design: Foundations, Analysis and Internet examples, M. T. Goodrich and R.

Tomassia, John Wiley and sons.
3. Fundamentals of Sequential and Parallel Algorithm, K. A. Berman and J. L. Paul, Cengage
Learning.
4. Introducation to the Design and Analysis of Algorithms, A. Levitin, Pearson Education.
5. Introducation to Algorithms, 3rd Edition, T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C.
Stein, PHI Pvt. Ltd.
6. Design and Analysis of algorithm, Aho, Ullman and Hopcroft, Pearson Education, 2004.
Outcomes:
 Be able to analyze algorithms and improve the efficiency of algorithms.
 Apply different designing methods for development of algorithms to realistic problems, such as
divide and conquer, greedy and etc.
 Ability to understand and estimate the performance of algorithm.


3 0 0 3
Professional Elective –III

(R18CSE3231) Software Testing Methodologies
Objectives:
To understand the software testing methodologies such as flow graphs and path testing, transaction
flows testing, data flow testing domain testing and logic based testing.
UNIT I :
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.
UNIT II :
Transaction Flow Testing : Transaction flows, transaction flow testing techniques.
Dataflow testing: Basics of dataflow testing, strategies in dataflow testing, application of dataflow
testing.
UNIT III:
Domain Testing: Domains and paths, Nice & ugly domains, domain testing, domains and interfaces
testing, domain and interface testing, domains and testability.
UNIT IV :
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.
UNIT V :
State, State Graphs and Transition testing : State graphs, good & bad state graphs, state testing,
Testability tips.
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. Software Testing techniques - Boris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr.K.V.K.K.Prasad, Dreamtech.
REFERENCES :
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing, 3rd Edition, P.C. Jorgensen, Aurbach Publication (Dist by SPO)
3. Software Testing, n. Chauhan, Oxford University Press.
4. Introduction to Software Testing, P. Ammann & J. Offutt, Cambridge Univ. Press.
5. Effective methods of Software Testing, Perry, John Wiley 3rd Edition, 1999.
6. Software Testing Concepts and Tools, P. Nageswara Rao, dreamtech Press
7. Software Testing, M.G. Limye, TMH.
8. Software Testing, S. Desikan, G. Reamesh, Pearson
9. Foundations of Software Testing, D. Graham & Others, Cengage Learning.
10. Foundations of Software Testing, A.P. Madhur, Pearson.
Outcomes:
 Ability to apply the process of testing and various methodologies in testing for developed
software.
 Ability to write test cases for given softw3are to test it before delivery to the customer.


3 0 0 3

(R18CSE3232) Scripting Languages
Objectives:
This course demonstrates an in depth understanding of the tools and the scripting languages necessary
for design and development of applications dealing with Bio-information/ Bio-data. The instructor is
advised to discuss examples in the context of Bio-data/ Bio-information application development.
UNIT - I
Introduction to PERL and Scripting: Scripts and Programs, Origin of Scripting , Scripting Today,
Characteristics of Scripting Languages, Uses for Scripting Languages, Web Scripting, and the universe
of Scripting Languages. PERL- Names and Values, Variables, Scalar Expressions, Control Structures,
arrays, list, hashes, strings, pattern and regular expressions, subroutines.
UNIT - II
Advanced perl: Finer points of looping, pack and unpack, file system, eval, data structures, packages,
modules, objects, interfacing to the operating system, Creating Internet ware applications, Dirty Hands
Internet Programming, security Issues.
PHP Basics : PHP Basics- Features, Embedding PHP Code in your Web pages, Outputting the data to
the browser, Data types, Variables, Constants, expressions, string interpolation, control structures,
Function, Creating a Function, Function Libraries, Arrays, strings and Regular Expressions.
UNIT - III
Advanced PHP Programming: PHP and Web Forms, Files, PHP Authentication and Methodologies
-Hard Coded, File Based, Database Based, IP Based, Login Administration, Uploading Files with PHP,
Sending Email using PHP, PHP Encryption Functions, the Mcrypt package, Building Web sites for the
World.
UNIT - IV
TCL : TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data Structures, input/output,
procedures, strings, patterns, files, Advance TCL-eval, source, exec and uplevel commands, Name
spaces, trapping errors, event driven programs, making applications internet aware, Nuts and Bolts
Internet Programming, Security Issues, C Interface.
Tk-Visual Tool Kits, Fundamental Concepts of Tk, Tk by example, Events and Binding , Perl-Tk.
UNIT - V
Python: Introduction to Python language, python-syntax, statements functions, Built-in-functions
and Methods, Modules in python, Exception Handling.
Integrated Web Applications in Python — Building Small, Efficient Python Web Systems,
Web Application Framework.

TEXT BOOKS:
1. The World of Scripting Languages , David Barron, Wiley Publication
2. Python Web Programming, Steve Holden and David Beazley, New Riders Publications.
3. Beginning PHP and MySQL, 3rd Edition, Jason Gilmore, Apress Publications (Dream tech.).
REFERENCE BOOKS:
1. Open Source Web Development with LAMP using Linux, Apache, MySQL, Perl and PHP,
J.Lee and B.Ware (Addison Wesley) Pearson Education.
2. Programming Python, M.Lutz, SPD.
3. PHP 6 Fast and Easy Web Development, Julie Meloni and Matt Telles, Cengage
Learning Publications.
4. PHP 5.1, I.Bayross and S.Shah, The X Team, SPD.
5. Core Python Programming, Chun, Pearson Education.
6. Guide to Programming with Python, M.Dawson, Cengage Learning
7. Perl by Example, E. Quigley, Pearson Education.
8. Programming Perl, Larry Wall, T. Christiansen and J. Orwant, O'Reilly, SPD.
9. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.
10. PHP and MySQL by Example, E. Quigley, Prentice Hall(Pearson).
11. Perl Power, J.P.Flynt, Cengage Learning.
12. PHP Programming solutions, V.Vaswani, TMH.
Outcomes:
 Ability to understand the differences between scripting languages,
 Ability to apply your knowledge of the weaknesses of scripting languages to
select implementation.
 Master an understanding of python especially the object oriented concepts.


3 0 0 3

(R18CSE3233) Mobile Application Development
Mobile application development is the process by which application software is developed for low-
power handheld devices, such as personal digital assistants, enterprise digital assistants or mobile
phones. These applications can be pre-installed on phones during manufacture, downloaded by
customers from various mobile software distribution platforms, or delivered as web applications using
server-side or client-side processing (e.g. JavaScript) to provide an “application-like” experience
within a Web browser. Application software developers also have to consider a lengthy array of screen
sizes, hardware specifications and configurations because of intense competition in mobile software
and changes within each of the platforms.
Objectives:
On completion of this course the students should be able to:
1. Design, implement and evaluate a User Interface for a mobile application using J2ME.
2. Create a small but realistic working mobile application for small computing devices.
3. Categorise the challenges posed by developing mobile applications
and be able to propose and evaluate and select appropriate
solutions.
UNIT- I
J2ME Overview : Java 2 Micro Edition and the World of Java, Inside J2ME, J2ME and Wireless
Devices
Small Computing Technology: Wireless Technology, Radio Data Networks, Microwave Technology,
Mobile Radio Networks, Messaging, Personal Digital Assistants
UNIT- II
J2ME Architecture and Development Environment: J2ME Architecture, Small Computing Device
Requirements, Run-Time Environment, MIDlet Programming, Java Language for J2ME, J2ME
Software Development Kits, Hello World J2ME Style, Multiple MIDlets in a MIDlet Suite, J2ME
Wireless Toolkit
J2ME Best Practices and Patterns: The Reality of Working in a J2ME World, Best Practices
UNIT- III
Commands, Items, and Event Processing: J2ME User Interfaces, Display
Class, The Palm OS Emulator, Command Class, Item Class, Exception Handling
High-Level Display: Screens: Screen Class, Alert Class, Form Class, Item Class, List Class, Text Box
Class, Ticker Class
Low-Level Display: Canvas: The Canvas, User Interactions, Graphics, Clipping Regions, Animation

UNIT- IV
Record Management System: Record Storage, Writing and Reading Records, Record Enumeration,
Sorting Records, Searching Records, Record Listener
JDBC Objects: The Concept of JDBC, JDBC Driver Types, JDBC Packages, Overview of the JDBC
Process, Database Connection, statement Objects, Result set, Transaction Processing, Metadata, Data
Types, Exceptions.
JDBC and Embedded SQL: Model Programs, Tables, Indexing, Inserting Data into Tables, Selecting
Data from a Table, Metadata, Updating Tables, Deleting Data form a Table, Joining Tables,
Calculating Data, Grouping and Ordering Data, Subqueries, VIEWs
UNIT- V
Generic Connection Framework: The Connection, Hypertext Transfer Protocol, Communication
Management Using HTTP Commands, Session Management, Transmit as a Background Process
TEXT BOOKS:
1. J2ME: The Complete Reference, James Keogh, Tata McGrawHill.
2. Programming for Mobile and Remote Computers, G.T.Thampi, dreamtech press.
REFERENCE BOOKS:
1. Enterprise J2ME: Developing Mobile Java Applications – Michael Juntao Yuan, Pearson
Education, 2004
2. Beginning Java ME Platform, Ray Rischpater, Apress, 2009
3. Beginning J2ME: From Novice to Professional, Third Edition, Sing Li, Jonathan B. Knudsen,
Apress, 2005
4. Kicking Butt with MIDP and MSA:Creating Great Mobile Applications,1 st edition, J.Knudsen,
Pearson.
Outcomes:
 Ability to evaluate and select appropriate solutions to the mobile computing platform.
 Ability to develop the user interface.
 Ability design a simple mobile phone game.


0 0 3 1.5
(R18CSE32L1) Machine Learning Lab

Course objectives: This course will enable students to
1. Make use of Data sets in implementing the machine learning algorithms
2. Implement the machine learning concepts and algorithms in any suitable language of
choice.
Description :
1. The programs can be implemented in either JAVA or Python.
2. For Problems 1 to 6 and 10, programs are to be developed without using the built-in classes
or APIs of Java/Python.
3. Data sets can be taken from standard repositories
(https://archive.ics.uci.edu/ml/datasets.html) or constructed by the students.
Lab Experiments:
1. Implement and demonstrate the FIND-S algorithm for finding the most specific hypothesis based
on a given set of training data samples. Read the training data from a CSV file.
2. For a given set of training data examples stored in a .CSV file, implement and demonstrate the
Candidate-Elimination algorithm to output a description of the set of all hypotheses
consistent with the training examples.
3. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an
appropriate data set for building the decision tree and apply this knowledge to classify a new
sample.
4. Build an Artificial Neural Network by implementing the Back propagation algorithm and
test the same using appropriate data sets.
5. Write a program to implement the naïve Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
6. Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier
model to perform this task. Built-in Java classes/API can be used to write the program.
Calculate the accuracy, precision, and recall for your data set.
7. Write a program to construct a Bayesian network considering medical data. Use this model to
demonstrate the diagnosis of heart patients using standard Heart Disease Data Set. You can
use Java/Python ML library classes/API.
8. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for
clustering using k-Means algorithm. Compare the results of these two algorithms and
comment on the quality of clustering. You can add Java/Python ML library classes/API in the
program.
9. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set.
Print both correct and wrong predictions. Java/Python ML library classes can be used for this
problem.
10. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.


0 0 3 1.5
(R18CSE32L2) Compiler Design Lab

Objectives:
 To provide an understanding of the language translation peculiarities by designing a complete
translator for a mini language.
Recommended System / Software Requirements:

 Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB
RAM and 100 MB free disk space
 C++ compiler and JDK kit
Consider the following mini Language, a simple procedural high-level language, only operating on
integer data, with a syntax looking vaguely like a simple C crossed with Pascal. The syntax of the
language is defined by the following BNF grammar:
<program> ::= <block>
<block> ::= { <variabledefinition> <slist> } | { <slist> }
<variabledefinition> ::= int<vardeflist>;
<vardeflist> ::= <vardec> | <vardec>, <vardeflist>
<vardec> ::= <identifier> | <identifier> [ <constant> ]
<slist> ::= <statement> | <statement>; <slist>
<statement> ::= <assignment> | <ifstatement> | <whilestatement> | <block> | <printstatement> |
<empty>
<assignment> ::= <identifier> = <expression> | <identifier> [ <expression> ] = <expression>
<ifstatement> ::= <bexpression> then <slist> else <slist> endif | if <bexpression> then <slist> endif
<whilestatement> ::= while <bexpression> do <slist> enddo
<printstatement> ::= print ( <expression> )
<expression> ::= <expression> <additionop> <term> | <term> | addingop> <term>
<bexpression> ::= <expression> <relop> <expression>
<relop> ::= < | <= | == | >= | > | !=
<addingop> ::= + | -
<term> ::= <term> <mulitop> <factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> [ <expression> ] | ( <expression> )
<constant> ::= <digit> | <digit> <constant>
<identifier> ::= <identifier> <letterordigit> | <letter>
<letterordigit> ::= <letter> | <digit>
<letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z
<digit> ::= 0|1|2|3|4|5|6|7|8|9
<empty> has the obvious meaning
Comments (zero or more characters enclosed between the standard C / Java style comment brackets
/*...*/) can be inserted. The language has rudimentary support for 1-dimensional arrays. The
declaration
int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2] Note also that you should
worry about the scoping of names.

A simple program written in this language is:

{
int a[3], t1, t2;
t1 = 2;
a[0] = 1; a[1] = 2; a[t1] = 3;
t2 = -(a[2] + t1 * 6)/ a[2] - t1);
if t2 > 5 then
print(t2);
else
{
int t3;
t3 = 99;
t2 = -25;
print(-t1 + t2 * t3); /* this is a comment on 2 lines */
}
endif
}
1. Design a Lexical analyzer for the above language. The lexical analyzer should ignore redundant
spaces, tabs and newlines. It should also ignore comments. Although the syntax specification
states that identifiers can be arbitrarily long, you may restrict the length to some reasonable
value.
2. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.
3. Design Predictive parser for the given language.
4. Design LALR bottom up parser for the above language.
5. Convert the BNF rules into Yacc from and write code to generate abstract syntax tree.
6. Write program to generate machine code from the abstract syntax tree generated by the parser.
The following instruction set may be considered as target code.
The following is a simple register-based machine, supporting a total of 17 instructions. It has three
distinct internal storage areas. The first is the set of 8 registers, used by the individual instructions as
detailed below, the second is an area used for the storage of variables and the third is an area used for
the storage of program. The instructions can be precede by a label. This consists of an integer in the
range 1 to 9999 and the label is followed by a colon to separate it from the rest of the instruction. The
numerical label can be used as the argument to a jump instruction, as detailed below.
In the description of the individual instructions below, instruction argument types are specified as
follows:
R specifies a register in the form R0, R1, R2, R3, R4, R5, R6 or R7 (or r0, r1, etc).
L specifies a numerical label (in the rabge 1 tp 9999).
V specifies a "variable location" ( a variable number, or a variable location pointed to by a register -
see below).
A specifies a constant value, a variable location, a register or a variable location pointed to by a register
(an indirect address). Constant values are specified as an integer value, optionally preceded by a minus
sign, preceded by a # symbol. An indirect address is specified by an @ followed by a register.
So, for example an A-type argument could have the form 4 (variable number 4), #4 (the constant value
4), r4 (register 4) or @r4 (the contents of register 4 identifies the variable location to be accessed).
The instruction set is defined as follows:
LOAD A, R
loads the integer value specified by A into register R.
STORE R, V
stores the value in register R to variable V.

OUT R
outputs the value in register R.
NEG R
negates the value in register R.
ADD A, R
adds the value specified by A to register R, leaving the result in register R.
SUB A, R
subtracts the value specified by A from register R, leaving the result in register R.
MUL A, R
multiplies the value specified by A by register R, leaving the result in register R.
DIV A, R
divides register R by the value specified by A, leaving the result in register R.
JMP L
causes an unconditional jump to the instruction with the label L.
JEQ R, L
jumps to the instruction with the label L if the value in register R is zero.
JNE R, L
jumps to the instruction with the label L if the value in register R is not zero.
JGE R, L
jumps to the instruction with the label L if the value in register R is greater than or equal to zero.
JGT R, L
jumps to the instruction with the label L if the value in register R is greater than zero.
JLE R, L
jumps to the instruction with the label L if the value in register R is less than or equal to zero.
JLT R, L
jumos to the instruction with the label L if the value in register R is less than zero.
NOP
is an instruction with no effect. It can be tagged by a label.
STOP
stops execution of the machine. All programs should terminate by executing a STOP instruction.
Outcomes:
 By this laboratory, students will understand the practical approach of now a compiler works.
 This will enable him to work in the development phase of new computer languages in industry.


0 0 2 1
Professional Elective-III Lab

(R18CSE32L3) Software Testing Methodologies Lab
List of Experiments
 Write programs in ‘C’ Language to demonstrate the working of the following constructs:
i) do…while ii) while….do iii) if…else iv) switch v) for
 “A program written in ‘C’ language for Matrix Multiplication fails” Introspect the causes for its
failure and write down the possible reasons for its failure.
 Take any system (e.g. ATM system) and study its system specifications and report the various
bugs.
 Write the test cases for any known application (e.g. Banking application)
 Create a test plan document for any application (e.g. Library Management System)
Study of any testing tool (e.g. Win runner)
 Study of any web testing tool (e.g. Selenium)
 Study of any bug tracking tool (e.g. Bugzilla, bugbit)
 Study of any test management tool (e.g. Test Director)
 Study of any open source-testing tool (e.g. Test Link)
 Take a mini project (e.g. University admission, Placement Portal) and execute it. During the
Life cycle of the mini project create the various testing documents* and final test report
document.


0 0 2 1

(R18CSE32L3) Scripting Languages Lab
Week-1
1. Write a script that counts from 1 to 10 in steps of 1. For each number, displaywhether that number is
an odd or even number, and also display a message if thenumber is a prime number. Display this
information within an HTML table.
2. Write a program that displays a different message based on the time of day. Forexample, have the
site display “Good Morning!” if it is accessed in the morning.
3. Write a program that formats a block of text (to be input by the user) based onpreferences chosen by
the user. Give your user options for color of text, fontchoice, and size. Display the output on a new
page.
Week-2
1. Write a function that takes an array argument, and returns a string containingXHTML markup for a
definition list where each key of the array is a term, and eachcorresponding value is a definition.(Hint:
An XHTML definition list element consistsof < dl > ... < /dl > tags. Inside these tags, terms are marked
up using <dt> ... </dt> tags, and definitions using <dd> ... < /dd> tags.)
2. Write a Calculator class that can store two values, then add them, subtract them,multiply them
together, or divide them on request. Create another class,CalcAdvanced, that extends (inherits from)
the Calculator class. CalcAdvancedshould be capable of storing either one or two values.
CalcAdvanced should alsohave the methods: pow(), sqrt(), and exp().
Week-3
1. Create an Interactive Form with PHP script which does the following things:
a) It displays a registration form for the user to fill out. Certain fields arerequired to be filledin and
these are labelled with asterisks in the form. Theremaining fields are optional
b) When the form is sent, the script checks that the required fields have beenfilled in, if all required
fields are filled, the script displays a thank-youmessage.
c)If one or more required fields are missing, the script redisplays the formwith an error message, and
highlights the fields that still need to be filledin. The script remembers which fields the user already
filled in, and prefillsthose fields in the new form
Week-4
1. Create a multi-step form for registration and upload the image and signature withrestricted size
option upon successful submission displays the information filled bythe user.

Week-5
1. Create a user login system upon login, a simple shopping cart for online storeapplication is displayed
where there are three products to choose from, and usercan add any or all of the products to his cart,
remove products from the cart, andview the contents of the cart.
2. Write a script that uses cookies to remember how long ago a visitor first visited thepage. Display this
value in the page, in minutes and seconds.
Week-6
1. Print every number from 9 through 19 in base 16.11. Create a Python dictionary with [key, value] as
[person, phone_number] and workwith various dictionary functions.
Week -7
1. Write a Python script to create a dictionary with [word, count] where count is thenumber of
occurrences of the word in a given list of string.
2.Write a Python script using a function which returns a list containing Fibonacciseries of n terms.
Week-8
1. Implement Queue data structure in Python by defining a class Queue.
2. Write a program that reads a file and writes out a new file with the lines in reversedorder (i.e. the
first line in the old file becomes the last one in the new file.)
3. Write a program to perform matrix multiplication by reading the matrices from thefile and write the
resultant matrix to the file.
Week-9
1. Write a program to experiment with different layouts using different pack orders.
Week-10
1. Write a GUI to enter the employee details into the database and allows us toperform update and
remove employee information.
Week-11
1. Create a template that shows a menu from a restaurant and have Django createthe database.
Week-12
1. Create a single page application using AngularJS and NodeJS.


0 0 2 1

(R18CSE32L3) Mobile Application Development Lab
Contents
Mobile Application Development (Through J2ME) LABORATORY
Objectives:
Week - 1: Installation of Java Wireless Toolkit (J2ME) Week - 2 Working with J2ME Features
Week - 3 Threads & High Level UI
Week - 4 Working on Drawing and Images
Week - 5 Developing Networked Applications using the Wireless Toolkit Week - 6 Authentication
with a Web Server
Week - 7 & 8 Web Application using J2ME
Outcomes:
1. Ability to install J2ME toolkit.
2. Ability to develop the user interface and authenticate with a Web Server..
3. Ability to design Web application using J2ME.
Mobile Application Development (Through J2ME) LABORATORY

Objective:
In this lab, a student is expected to design, implement, document and present a mobile client/server
system using standard Java and Java 2 Micro Edition (J2ME) platform. Specifically it is required to
design and implement a system that consists mainly of a mobile client (MC) and a Proxy Server (PS).
MC will be written in J2ME, MIDP 2.0, while PS will be written in standard Java. It is necessary to use
a mobile phone emulator to develop and demonstrate the experiments.
It may be necessary to use other components or existing resources (servers) as needed. For instance a
database local to PS or a web service available on the Internet that can be invoked by the PS.
Week - 1: Installation of Java Wireless Toolkit (J2ME)

1) If the Java Development Kit (JDK) is not there or only having the Java Runtime Environment
(JRE) installed, install the latest JDK from http://java.sun.com/javase/downloads/index.jsp.
Current stable release of Java is JDK 6 Update 7 but check the web page in case there are newer
non-beta releases available.
2) Next, download the Java Wireless Toolkit (formerly called J2ME Wireless Toolkit) from:
http://java.sun.com/products/sjwtoolkit/ download.html.
3) Run the installer (for example, for W indows it is: sun_java_wireless_toolkit- 2_5_2-
windows.exe). The installer checks whether a compatible Java environment has been pre-
installed. If not, it is necessary to uninstall old versions of Java and perform Step 1 again.

Once after successful installation of Java and the tool kit compile this program and run the following
program in the toolkit.
Steps to run this program in toolkit:
1. Start -> All Programs -> Sun Java Tool Kit -> Wireless Tool Kit
2. Click New Project – Enter Project Name -> Enter Class Name -> Click on Create Project.
3. Choose appropriate API Selection and Configurations.
4. Place Java Source file in WTK2.1 / WTK2.2\ apps\ projectname\ src
5. Build the Project.
6. Run the Project.
import javax.microedition.lcdui.*;
import javax.microedition.midlet.*;
public class HelloWorld extends MIDlet{
private Form form;
private Display display;
public HelloWorld(){
super();
}
public void startApp(){
form = new Form(“Hello World”);
String msg = ”Hello World!!!!!!!”;
form.append(msg);
display = Display.getDisplay(this);
display.setCurrent(form);
}
public void pauseApp(){}
public void destroyApp(boolean unconditional){
notifyDestroyed();
}
}
Week - 2 Working with J2ME Features:
Working with J2ME Features: Say, creating a Hello World program Experiment with the most basic
features and mobile application interaction concepts (lists, text boxes, buttons, radio boxes, soft
buttons, graphics, etc)
2.1 Create a program which creates to following kind of menu.
* cut
* copy
* past
* delete
* select all
* unselect all

2.2 Event Handling.

Create a menu which has the following options:
* cut - can be on/off
* copy - can be on/off
* paste - can be on/off
* delete - can be on/off
* select all - put all 4 options on
* unselect all - put all 4 options off
2.3. Input checking

Create an MIDP application which examine, that a phone number, which a user has entered is in the
given format.
* Area code should be one of the following: 040, 041, 050, 0400, 044
* There should 6-8 numbers in telephone number (+ area code)
Week - 3 Threads & High Level UI:

3.1. Create a slide show which has three slides, which includes only text. Program should change to the
new slide after 5 seconds. After the third
slide program returns to the first slide.
3.2 High-level UI
Create a MIDP application, which show to the user 5-10 quiz questions. All questions have 4 possible
options and one right option exactly. Application counts and shows to the user how many right answers
were right and shows them to user.

3.3 Create a MIDP application, where the user can enter player name and points. The program saves
the information to the record using RMS at MIDP device. Program should also print out the top 10
player list to the end user. You can use this class in your game if you made own class for saving and
reading record sets.
Week - 4 Working on Drawing and Images

4.1 Create a slide show which has three slides, which includes pictures at PNG format. Program should
change to the new slide other 5 seconds.
4.2 Create a MIDP application, which draws a bar graph to the display. Data values can be given at
int[] array.

4.3 Create a MIDP application, which draws a bar graph to the display. Data values can be given at
int[] array. You can enter four data (integer) values to the input text field.
Week - 5 Developing Networked Applications using the Wireless Toolkit

Creating a Simple Client-Server Application
Create, compile and run a basic UDP-based client-server application.
Creating the Datagram Server project
1)Click on Wireless Toolkit 2.5.2 under the group: All Programs?Sun Java (TM) Wireless Toolkit
2.5.2.
2) Click on ‘New Project...’ button.
3) Enter project name as ‘DatagramServer’. Enter MIDlet name as ‘DatagramServer’. Note that the
Midlet name is the same as the name of the class in the source code, which extends the MIDlet class,
otherwise the application won’t run.
4) Another window pops up where it is required to select a target platform. Select ‘MIDP 1.0’ from the
drop down list.
5)After clicking OK, the project is created; and the Wireless Toolkit tells that the name of the folder
where source code files are created. The path of the source code folder is displayed in the debug output
window.
Creating and Compiling the DatagramServer source files
The Wireless Toolkit does not come with an IDE by default so Use any IDE or a text editor like
Notepad.
1)Create a new text file called DatagramServer.java in the source folder of the project. The exact
path of this folder is displayed in the Wireless Toolkit window.

2) Paste contents DatagramServer.java from into the source file.

Running your Server application on the Phone simulator
1) After compiling the project successfully, click on the Run button in the Wireless Toolkit
window.
2) A graphical window depicting a phone handset will appear with the name of your application
highlighted on its screen as shown below.
3) To start the application, click on the right soft-key (marked with a dot) below the ‘Launch’
command.
4) The phone simulator might ask if it is OK to run the network application. Select ‘Yes’ by
clicking on the appropriate soft-key. The server is now up and running.
5) Keep the server running during the creation, compilation and running of the Datagram Client
application.
Creating the DatagramClient project
1) Use the same instance of the Wireless Toolkit that is used for creating and compiling the
Datagram Server project.
2) Click on ‘New Project...’ button.
A new window pops up. Enter project name as ‘DatagramClient’. Enter MIDlet name as
‘DatagramClient’. Note that the Midlet name
is the same as the name of the class in the source code, which extends the MIDlet class.
4) Another window pops up where one has to select a target platform. Select ‘MIDP 1.0’ from the
drop down list.
5) After clicking OK, the project is created and the Wireless Toolkit tells where to place the source
code files. The path of the source code folder is displayed in the debug output window as
explained before.
Creating and Compiling the DatagramClient source files
1) Create a new text file called DatagramClient.java in the source folder of the project.
2) Paste contents DatagramClient.java into the source file.
3) Then click on the Build button in the Wireless Toolkit window. If the compilation is OK, it will
say Build Complete in the window’s debug output window, otherwise it will show the errors.
Note: In the source code, use the System.out.println() statement to output debug information to
this window.
Running your Client application on the Phone simulator
1) After compiling the project successfully, click on the Run button in the Wireless Toolkit
window.
2) A graphical window depicting a phone handset will appear with the name of the application
highlighted on its screen.
3) To start the application, click on the right soft-key (marked with a dot) below the ‘Launch’
command.
4) The phone simulator might ask if it is OK to run the network application. Select ‘Yes’ by
clicking on the appropriate soft-key. The client is now up and running.
5) When the client executes on the phone simulator, one should see a text box with the caption
‘Message’. Enter any message and press the right soft-key (corresponding to Send). If the client-
server application is working properly, the screen of the server phone will display the message

sent by the client and the client screen will now display a message sent by the server in response.
The response message from the server is the original client message in reverse.
6) Try various features of the phone simulator including the different look-and feel options.
Week - 6 Authentication with a Web Server
6.1 Write a sample program to show how to make a SOCKET Connection from j2me phone.
This J2ME sample program shows how to how to make a SOCKET
Connection from a J2ME Phone. Many a times there is a need to connect backend HTTP server from
the J2ME application. shows how to make a SOCKET connection from the phone to port 80.
6.2 Login to HTTP Server from a J2ME Program
This J2ME sample program shows how to display a simple LOGIN SCREEN on the J2ME phone and
how to authenticate to a HTTP server.
Many J2ME applications for security reasons require the authentication of the user. This free J2ME
sample program, shows how a J2ME application can do authentication to the backend server.
Note: Use Apache Tomcat Server as Web Server and Mysql as Database Server.
Week - 7 & 8 Web Application using J2ME
The following should be carried out with respect to the given set of application domains: (Assume that
the Server is connected to the well-maintained database of the given domain. Mobile Client is to be
connected to the Server and fetch the required data value/information)
 Students Marks Enquiry
 Town/City Movie Enquiry
 Railway/Road/Air (For example PNR) Enquiry/Status
 Sports (say, Cricket) Update
 Town/City Weather Update
 Public Exams (say Intermediate or SSC)/ Entrance (Say EAMCET) Results Enquiry
 Divide Students into Batches and suggest them to design database according to their domains
and render information according to their requests.


0 0 2 0
(R18MAC3200) MOOCs-II


B.Tech. - IV Year – I Semester L T P C
3 0 0 3
(R18CSE4101) Cryptography & Network Security

Course Objectives:
 Explain the objectives of information security
 Explain the importance and application of each of confidentiality, integrity, authentication and
availability
 Understand various cryptographic algorithms.
 Understand the basic categories of threats to computers and networks
 Describe public-key cryptosystem.
 Describe the enhancements made to IPv4 by IPSec
 Understand Intrusions and intrusion detection
 Discuss the fundamental ideas of public-key cryptography.
 Generate and distribute a PGP key pair and use the PGP package to send an encrypted e-mail
message.
 Discuss Web security and Firewalls
Course Outcomes:
 Student will be able to understand basic cryptographic algorithms, message and
web authentication and security issues.
 Ability to identify information system requirements for both of them such as client and server.
 Ability to understand the current legal issues towards information security.
UNIT – I: Security Concepts: Introduction, The need for security, Security approaches, Principles
of security, Types of Security attacks, Security services, Security Mechanisms, A model for Network
Security Cryptography Concepts and Techniques: Introduction, plain text and cipher text, substitution
techniques, transposition techniques, encryption and decryption, symmetric and asymmetric key
cryptography, steganography, key range and key size, possible types of attacks.
UNIT – II: Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA,
Block cipher operation, Stream ciphers, RC4. Asymmetric key Ciphers: Principles of public key
cryptosystems, RSA algorithm, Elgamal Cryptography, Diffie-Hellman Key Exchange, Knapsack
Algorithm.
UNIT – III: Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm
(SHA-512), Message authentication codes: Authentication requirements, HMAC, CMAC,
Digital signatures, Elgamal Digital Signature Scheme. Key Management and Distribution: Symmetric
Key Distribution Using Symmetric & Asymmetric Encryption, Distribution of Public Keys, Kerberos,
X.509 Authentication Service, Public – Key Infrastructure
UNIT – IV: Transport-level Security: Web security considerations, Secure Socket Layer and
Transport Layer Security, HTTPS, Secure Shell (SSH) Wireless Network Security: Wireless Security,
Mobile Device Security, IEEE 802.11 Wireless LAN, IEEE 802.11i Wireless LAN Security

UNIT – V: E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview,
IP Security architecture, Authentication Header, 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:
 Cryptography and Network Security – Principles and Practice: William Stallings, Pearson
Education, 6th Edition
 Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition
REFERENCE BOOKS:
 Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley
India, 1st Edition.
 Cryptography and Network Security : Forouzan Mukhopadhyay, Mc Graw Hill, 3rd Edition
 Information Security, Principles, and Practice: Mark Stamp, Wiley India.
 Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
 Introduction to Network Security: Neal Krawetz, CENGAGE Learning
 Network Security and Cryptography: Bernard Menezes, CENGAGE Learning


2 0 0 2
(R18CSE4102) Data Mining

UNIT I
Data Warehousing, Business Analysis and On-Line Analytical Processing (OLAP) : Basic Concepts
– Data Warehousing Components – Building a Data Warehouse – Database Architectures for Parallel
Processing – Parallel DBMS Vendors – Multidimensional Data Model – Data Warehouse Schemas for
Decision Support, Concept Hierarchies -Characteristics of OLAP Systems – Typical OLAP Operations,
OLAP and OLTP.
UNIT II
Data Mining – Introduction : Introduction to Data Mining Systems – Knowledge Discovery Process –
Data Mining Techniques – Issues – applications- Data Objects and attribute types, Statistical description
of data, Data Preprocessing – Cleaning, Integration, Reduction, Transformation and discretization, Data
Visualization, Data similarity and dissimilarity measures.
UNIT III
Data Mining – Frequent Pattern Analysis : Mining Frequent Patterns, Associations and Correlations –
Mining Methods- Pattern Evaluation Method – Pattern Mining in Multilevel, Multi Dimensional Space –
Constraint Based Frequent Pattern Mining, Classification using Frequent Patterns
UNIT IV
Classification and Clustering : Decision Tree Induction – Bayesian Classification – Rule Based
Classification – Classification by Back Propagation – Support Vector Machines –– Lazy Learners –
Model Evaluation and Selection-Techniques to improve Classification Accuracy. Clustering Techniques
– Cluster analysis-Partitioning Methods – Hierarchical Methods – Density Based Methods – Grid Based
Methods – Evaluation of clustering – Clustering high dimensional data- Clustering with constraints,
Outlier analysis-outlier detection methods.
UNITV:
Applications and Trends In Data Mining : Data mining applications, Data Mining Products and
Research Prototypes, Additional Themes on Data Mining and Social Impacts Of Data Mining.
TEXT BOOK:
1. Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques, Third Edition,
Elsevier, 2012.
2. Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata McGraw –
Hill Edition, 35th Reprint 2016.
REFERENCES:
1. K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and Practice,
Eastern Economy Edition, Prentice Hall of India, 2006.
2. Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and
Techniques, Elsevier, Second Edition.


3 0 0 3
Professional Elective -IV

(R18CSE4141) Graph Theory
UNIT I
INTRODUCTION: Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –
Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of
trees – Distance and centers in tree – Rooted and binary trees.
UNIT II
TREES, CONNECTIVITY & PLANARITY : Spanning trees – Fundamental circuits – Spanning
trees in a weighted graph – cut sets – Properties of cut set – All cut sets – Fundamental circuits and cut
sets – Connectivity and separability – Network flows – 1-Isomorphism – 2-Isomorphism –
Combinational and geometric graphs – Planer graphs – Different representation of a planer graph.
UNIT III
MATRICES, COLOURING AND DIRECTED GRAPH : Chromatic number – Chromatic
partitioning – Chromatic polynomial – Matching – Covering – Four color problem – Directed graphs –
Types of directed graphs – Digraphs and binary relations – Directed paths and connectedness – Euler
graphs.
UNIT IV
PERMUTATIONS & COMBINATIONS: Fundamental principles of counting – Permutations and
combinations – Binomial theorem – combinations with repetition – Combinatorial numbers – Principle
of inclusion and exclusion – Derangement – Arrangements with forbidden positions.
UNIT V
GENERATING FUNCTIONS : Generating functions – Partitions of integers – Exponential
generating function – Summation operator – Recurrence relations – First order and second order –
Non-homogeneous recurrence relations – Method of generating functions.
TEXT BOOKS:
3. NarsinghDeo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice
Hall of India, 2003.
4. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison
Wesley, 1994.
REFERENCES:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and
Mathematicians” , Prentice Hall of India, 1996.
3. Liu C.L., “Elements of Discrete Mathematics”, McGraw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, McGraw Hill, 2007


3 0 0 3
Professional Elective –IV
(R18CSE4142) Informational Retrieval Systems
Objectives :
 To learn the different models for information storage and retrieval To learn about the various
retrieval utilities.
 To understand indexing and querying in information retrieval systems.
 To expose the students to the notions of structured and semi structured data. To learn about
web search.
UNIT-I
Introduction:
Retrieval Strategies : Vector space model, Probabilistic retrieval strategies simple term weights, Non
binary independence model Language Models.
UNIT-II
Retrieval Utilities : Relevance feedback, Clustering, N-grams, Regression analysis, Thesauri.
UNIT-III
Retrieval Utilities : Semantic networks, Parsing Cross-language Information Retrieval: Introduction,
Crossing the language barrier.
UNIT-IV
Efficiency: Inverted index, Query processing, Signature files, Duplicate document detection.
UNIT-V
Integrating Structured Data and Text: A Historical progression, Information retrieval as a
relational application, Semi-structured search using a relational schema.
Distributed information Retrieval: A Theoretical model of distributed retrieval Web search.
TEXTBOOK:
1. David A. Grossman, Ophir Frieder, Information Retrieval – Algorithm and Heuristics, Springer,
2nd Edition (Distributed by Univerisities Press)
REFERENCES BOOKS :
2) Gerald J. Kowalski, Mark T Maybury. Information Storage and Retrieval Systems,
Springer, 2000
3) Soumen Chakrabarti, Mining the Web: Discovering Knowledge from Hypertext Data,
Morgan - Kaufmann Publications, 2002
4) Christopher D. manning, Prabhakar Raghavan, Hinrich Schotze, an Introduction to
Information Retrieval, Cambridge University Press, Cambridge, England, 2009.
Outcomes:
 Possess the ability to store and retrieve textual documents using appropriate models.
Possess the ability to use the various retrieval utilities for improving search
 Possess an understanding of indexing and compressing documents to improve space and time
efficiency.
 Possess the skill to formulate SQL like queries for unstructured data Understand issues in web
search.


3 0 0 3
Professional Elective –IV
(R18CSE4143) Cloud Computing
Objectives
 To explain the evolving computer model called cloud computing.
 To introduce the various levels of services that can be achieved by cloud.
 To describe the security aspects in cloud.
UNIT – I
Systems Modeling, Clustering and Virtualization: Distributed System Models and Enabling
Technologies, Computer Clusters for Scalable Parallel Computing, Virtual Machines and
Virtualization of Clusters and Data centers.
UNIT – II
Foundations: Introduction to Cloud Computing, Migrating into a Cloud, Enriching the ‘Integration as
a Service’ Paradigm for the Cloud Era, The Enterprise Cloud Computing Paradigm.
UNIT – III
Infrastructure as a Service (IAAS) & Platform and Software as a Service (PAAS / SAAS): Virtual
machines provisioning and Migration services, On the Management of Virtual machines for Cloud
Infrastructures, Enhancing Cloud Computing Environments using a cluster as a Service, Secure
Distributed Data Storage in Cloud Computing.
Aneka, Comet Cloud, T-Systems’, Workflow Engine for Clouds, Understanding Scientific
Applications for Cloud Environments.
UNIT – IV
Monitoring, Management and Applications: An Architecture for Federated Cloud Computing, SLA
Management in Cloud Computing, Performance Prediction for HPC on Clouds, Best Practices in
Architecting Cloud Applications in the AWS cloud, Building Content Delivery networks using Clouds,
Resource Cloud Mashups.
UNIT – V
Governance and Case Studies: Organizational Readiness and Change management in the Cloud age,
Data Security in the Cloud, Legal Issues in Cloud computing, Achieving Production Readiness for
Cloud Services.
TEXT BOOKS
1) Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and Andrzej M.
Goscinski, Wiley, 2011.
2) Distributed and Cloud Computing, Kai Hwang, Geoffery C.Fox, Jack J.Dongarra, Elsevier, 2012.
REFERENCE BOOKS
1) Cloud Computing : A Practical Approach, Anthony T.Velte, Toby J.Velte, Robert Elsenpeter,
Tata McGraw Hill, rp2011.
2) Enterprise Cloud Computing, Gautam Shroff, Cambridge University Press, 2010.
3) Cloud Computing: Implementation, Management and Security, John W. Rittinghouse, James
F.Ransome, CRC Press, rp2012.
4) Cloud Application Architectures: Building Applications and Infrastructure in the Cloud,
George Reese, O’Reilly, SPD, rp2011.

5) Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather,
Subra Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp2011.
Outcomes
Ability to understand the virtualization and cloud computing concepts.


3 0 0 3
Professional Elective -V
(R18CSE4151) Soft Computing
OBJECTIVES:
• Learn the Various Soft Computing Frame Works
• Be Familiar with Design Of Various Neural Networks
• Be Exposed To Fuzzy Logic
• Learn Genetic Programming.
UNIT I: INTRODUCTION
Artificial Neural Network: Introduction, Characteristics- Learning Methods – Taxonomy– Evolution of
Neural Networks- Basic Models –Applications. Fuzzy Logic: Introduction – Crisp Sets- Fuzzy Sets –
Crisp Relations and Fuzzy Relations: Cartesian product of Relation – Classical Relation, Fuzzy
Relations, Tolerance And Equivalence Relations, Non-Iterative Fuzzy Sets.
UNIT II: NEURAL NETWORKS

McCulloch-Pitts Neuron – Linear Separability – Hebb Network – Supervised Learning Network:
Perceptron Networks – Adaptive Linear Neuron, Multiple Adaptive Linear Neuron, BPN, RBF, and
TDNN.
Associative Memory Network: Auto-Associative Memory Network, Hetero-Associative Memory
Network, BAM, Hopfield Networks, Iterative Auto-associative Memory Network & Iterative
Associative Memory Network –Unsupervised Learning Networks: Kohonen Self Organizing Feature
Maps, LVQ – CP Networks, ART Network.
UNIT III: FUZZY LOGIC

Membership Functions: Features, Fuzzification, Methods Of Membership Value Assignments-
Defuzzification: Lambda Cuts – Methods –Fuzzy Measures – Measures Of Fuzziness -Fuzzy Integrals
– Fuzzy Rule Base And Approximate Reasoning : Truth Values And Tables, Fuzzy Propositions,
Formation Of Rules-Decomposition Of Rules, Aggregation Of Fuzzy Rules, Fuzzy Reasoning-Fuzzy
Inference Systems-Overview Of Fuzzy Expert System-Fuzzy Decision Making.
UNIT IV: GENETIC ALGORITHM

Genetic Algorithm And Search Space – General Genetic Algorithm – Operators – Generational Cycle
– Stopping Condition – Constraints – Classification – Genetic Programming – Multilevel Optimization
– Real Life Problem- Advances In GA
UNIT V: HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS

Neuro-Fuzzy Hybrid Systems – Genetic Neuro Hybrid Systems – Genetic Fuzzy Hybrid And Fuzzy
Genetic Hybrid Systems – Simplified Fuzzy ARTMAP – Applications: A Fusion Approach of
Multispectral Images With SAR, Optimization of Traveling Salesman Problem, Soft Computing Based
Hybrid Fuzzy Controllers.
TEXT BOOKS:
1. J.S.R.Jang, C.T. Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI / Pearson
Education 2004.
2. S.N.Sivanandam and S.N.Deepa, “Principles of Soft Computing”, Wiley India Pvt Ltd, 2011.

REFERENCES:
1. S.Rajasekaran and G.A.Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic
Algorithm: Synthesis & Applications”, Prentice-Hall of India Pvt. Ltd., 2006.
2. George J. Klir, Ute St. Clair, Bo Yuan, “Fuzzy Set Theory: Foundations and Applications”
Prentice Hall, 1997.
3. David E. Goldberg, “Genetic Algorithm in Search Optimization and Machine Learning”
Pearson Education India, 2013.
4. James A. Freeman, David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques, Pearson Education India, 1991.


3 0 0 3
Professional Elective -V
(R18CSE4152) Internet of Things
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of web based services on IoT devices
Unit – I : Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design
of IoT – IoT Protocols, IoT communication models, Iot Communication APIs IoT enabaled
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
Unit – II : IoT and M2M – Software defined networks, network function virtualization, difference
between SDN and NFV for IoT Basics of IoT System Management with NETCOZF, YANG-
NETCONF, YANG, SNMP NETOPEER
Unit – III : Introduction to Python – Language features of Python, Data types, data structures,
Control of flow, functions, modules, packaging, file handling, data/time operations, classes, Exception
handling Python packages – JSON, XML, HTTPLib, URLLib, SMTPLib
Unit – IV : 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, reading input from pins.
Unit – V : 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:
 Internet of Things – A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities
Press, 2015, ISBN: 9788173719547
 Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O’Reilly (SPD), 2014,
ISBN: 9789350239759


3 0 0 3
Professional Elective –V
(R18CSE4153) Software Process & Project Management
Objectives:
 Describe and determine the purpose and importance of project management from the
perspectives of planning, tracking and completion of project.
 Compare and differentiate organization structures and project structures.
 Implement a project to manage project schedule, expenses and resources with the application of
suitable project management tools.
UNIT I : Software Process Maturity : Software maturity Framework, Principles of Software Process
Change, Software Process Assessment, The Initial Process, The Repeatable Process, The Defined
Process, The Managed Process, The Optimizing Process.
Process Reference Models : Capability Maturity Model (CMM), CMMI, PCMM, PSP, TSP.
UNIT II : Software Project Management Renaissance : Conventional Software Management,

Evolution of Software Economics, Improving Software Economics, The old way and the new way.
Life-Cycle Phases and Process artifacts : Engineering and Production stages, inception phase,
elaboration phase, construction phase, transition phase, artifact sets, management artifacts, engineering
artifacts and pragmatic artifacts, model based software architectures.
UNIT III: Workflows and Checkpoints of process : Software process workflows, Iteration
workflows, Major milestones, Minor milestones, Periodic status assessments.
Process Planning : Work breakdown structures, Planning guidelines, cost and schedule estimating
process, iteration planning process, Pragmatic planning.
UNIT IV: Project Organizations : Line-of- business organizations, project organizations, evolution
of organizations, process automation.
Project Control and process instrumentation : The seven core metrics, management indicators,
quality indicators, life-cycle expectations, Pragmatic software metrics, and metrics automation.
UNIT V: CCPDS-R Case Study and Future Software Project Management Practices : Modern
Project Profiles, Next-Generation software Economics, Modern Process Transitions.
TEXT BOOKS:
1. Managing the Software Process, Watts S. Humphrey, Pearson Education.
2. Software Project Management, Walker Royce, Pearson Education.
REFERENCE BOOKS:
1. Effective Project Management: Traditional, Agile, Extreme, Robert Wysocki, Sixth
edition, Wiley India, rp2011.
2. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education,
2000
3. Process Improvement essentials, James R. Persse, O’Reilly, 2006
4. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition, TMH,
2006

5. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O’Reilly,
2006.
6. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly, 2007
7. Software Engineering Project Managent, Richard H. Thayer & Edward Yourdon, 2nd
edition, Wiley India, 2004.
8. The Art of Project Management, Scott Berkun, SPD, O’Reilly, 2011.
9. Applied Software Project Management, Andrew Stellman & Jennifer Greene, SPD,
O’Reilly, rp2011.
10. Agile Project Management, Jim Highsmith, Pearson education, 2004.


0 0 2 1
(R18CSE41L1) Cryptography & Network Security Lab
1. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program
should XOR each character in this string with 0 and displays the result.
2. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program
should AND or and XOR each character in this string with 127 and display the result.
3. Write a Java program to perform encryption and decryption using the following algorithms
a. Ceaser cipher b. Substitution cipher c. Hill Cipher
4. Write a C/JAVA program to implement the DES algorithm logic.
5. Write a C/JAVA program to implement the Blowfish algorithm logic.
6. Write a C/JAVA program to implement the Rijndael algorithm logic.
7. Write the RC4 logic in Java Using Java cryptography; encrypt the text “Hello world” using
Blowfish. Create your own key using Java key tool.
8. Write a Java program to implement RSA algorithm.
9. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.
10. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
11. Calculate the message digest of a text using the MD5 algorithm in JAVA.


0 0 2 1
(R18INF41L2) Technical Seminar

0 0 0 2
(R18INF41P2) Industrial Oriented Mini Project/ Summer Internship

0 0 6 3
(R18INF41P1) Comprehensive Viva-Voce


B.Tech. - IV Year – II Semester L T P C
3 0 0 3
(R18HAS4201) Organizational Behaviour

The Objective of the course is to give a basic perspective of Management theories and practices. This
will form foundation to study other functional areas of management. Also this course provides insight
into behavioral issues.
Unit – 1:Introduction to Management: Definition, Types of Managers, Mintzberg Managerial roles,
Functions of Management, Administration vs. Management, Evolution of Management Thought –
Planning: Nature of planning, Steps in planning, types of planning, Levels of planning – The Planning
Process. Decision Making : The process and techniques of decision making.
Unit – 2: Organising: Nature of organizing, organisation levels and span of management – Factors
determining span – Organizational design and structure –departmentation, line and staff concepts,
staffing – delegation, decentralization and recentralisation of authority – responsive organizations.
Meaning and types of power – Empowerment – Groups Vs. Teams – Nature of groups –dynamics of
informal groups – dysfunctions of groups and teams – Teams in modern work place.
Unit – 3: Introduction to Organisational Behavior: Definition, Nature and Scope – Environmental

and organizational context and the impact on organizations – Perception: Nature and importance of
Perception – Perceptual selectivity and organization. Attribution Theories. Personality and
Attitudes – Meaning of personality – Johari Window and Transactional Analysis – Nature and
Dimension of Attitudes- Behavioral Modification.
Unit – 4: Motivation and Leading: Theories of Motivation-Maslow’s need hierarchy, Hertzberg’s Two
Factor Theory. Job design and Goal setting for High performance- Socio technical Design and High
performance work practices. Leading: Leading Vs Managing – Leadership Theories- Leadership styles
– developing leadership skills – transformational leaders, transactional leaders, Leadership in Cross-
cultural environment – Evaluating Leader- Women and Corporate leadership.
Unit – 5: Communication and Control: Meaning, Types of communication and barriers to effective
communication in Organizations, Using Communication Skills to manage Conflicts. Controlling:
Basic control process- Requirements for effective control – control techniques – Overall controls and
preventive controls.
References
 Koontz, Weihrich & Aryasri: Principles of Management, TMH,New Delhi, 2009
 Luthans, Fred: Organisational Behaviour, 11/e, McGraw Hill, 2009
 Stoner, Freeman and Gilbert: Jr. Management, Pearson,New Delhi, 2009.
 Aryasri & VSP Rao: Management and Organisational Behaviour, Excel, 2009
 Kavitha Singh:Organisational Behaviour, Pearson, 2009.
 Kellogg: Conflict in Organizational Groups, Kogan Page,2009
 John M. Ivancevich: Organisational Behaviour & Management, TMH, 2009
 Schermerhorn: Management, Wiley 2009
 Pierce and Gardner: Management and Organisational Behaviour: An Integrated Perspective,
Cengage, 2009.
 BPP:Organisational Behaviour, Viva, 2009

 Aswathappa: Organisational Behaviour,Himalaya, 2009

 Certo and Certo: Modern Management,10/e,PHI,2009
 R Satyaraju & A.Parthasarathy: Management Text and Cases, PHI, 2009.
 Prem Vrat, K K Ahuja, P K Jain: Case Studies in Management, Vikas, 2006.


3 0 0 3
Professional Elective -VI

(R18CSE4261) Distributed Systems
Objectives
 To understand what and why a distributed system is
 To understand theoretical concepts, namely, virtual time, agreement and consensus protocols
 To understand IPC, Group communication & RPC concepts.
 To understand the DFS and DSM Concepts.
 To understand the concepts of transaction in distributed environment and associated concepts,
namely, concurrency control, deadlocks and error recovery.
UNIT – I
Characterization of Distributed Systems : Introduction, Examples of distributed Systems, Resource
Sharing and the Web, Challenges.
System Models : Introduction, Architectural models and Fundamental models
UNIT II
Time and Global States: Introduction, Clocks, events and Process states, Synchronizing physical
clocks, logical time and logical clocks, global states, distributed debugging.
Coordination and Agreement: Introduction, Distributed mutual exclusion, Elections, Multicast
communication, consensus and related problems.
UNIT – III
Inter Process Communication : Introduction, The API for the Internet Protocols , External Data
Representation and marshalling, Client-Server Communication, Group Communication, Case Study:
IPC in UNIX.
Distributed objects and Remote Invocation: Introduction, Communication between distributed
objects, Remote Procedure Call, Events and notifications, Case study: JAVA RMI.
UNIT – IV
Distributed File Systems: Introduction, File Service architecture, Case Study1: SUN network file
systems, Case Study 2: .The Andrew File System.
Name Services: Introduction, Name Services and the Domain Name System, Directory Services, Case
study of the Global Name Service
Distributed Shared Memory: Introduction, Design and Implementation issues, Sequential consistency
and IVY case study, Release consistency and Munin case study, Other consistency models
UNIT V
Transactions and Concurrency control: Introduction, Transactions, Nested Transactions, Locks,
Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency control.
Distributed Transactions: Introduction, Flat and Nested Distributed Transactions, Atomic commit
protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery

TEXT BOOKS:
1. Distributed Systems, Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Pearson
Education, 4TH Edition, 2009.
REFERENCES:
1. Distributed Systems: Principles and Paradigms, S. Tanenbaum and Maarten Van Steen, 2 nd
Edition, PHI.
2. Distributed Systems, An Algorithm Approach, Sukumar Ghosh, Chapman & Hali/CRC, Taylor
& Fransis Group, 2007.
Outcomes
 Able to comprehend and design a new distributed system with the desired features.
 Able to start literature survey leading to further research in any subarea.
 Able to develop new distributed applications.


3 0 0 3

(R18CSE4262) Cyber Forensics
objectives: The student should be made to:
 Learn the security issues network layer and transport layer.
 Be exposed to security issues of the application layer.
 Learn computer forensics.
 Be familiar with forensics tools.
 Learn to analyze and validate forensics data.
UNIT I : Network Layer Security &Transport Layer Security

IPSec Protocol – IP Authentication Header – IP ESP – Key Management Protocol for IPSec.Transport
layer Security: SSL protocol, Cryptographic Computations – TLS Protocol.
UNIT II : E-mail Security & Firewalls
PGP – S/MIME – Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related
terminology- Types of Firewalls – Firewall designs – SET for E-Commerce Transactions.
UNIT III : Introduction to Computer Forensics
Introduction to Traditional Computer Crime, Traditional problems associated with Computer Crime.
Introduction to Identity Theft & Identity Fraud. Types of CF techniques – Incident and incident
response methodology – Forensic duplication and investigation. Preparation for IR: Creating response
tool kit and IR team. – Forensics Technology and Systems – Understanding Computer Investigation –
Data Acquisition.
UNIT IV : Evidence Collection and Forensics Tools
Processing Crime and Incident Scenes – Working with Windows and DOS Systems. Current Computer
Forensics Tools: Software/ Hardware Tools.
UNIT V : Analysis and Validation
Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition – Network
Forensics – Email Investigations – Cell Phone and Mobile Devices Forensics.
Outcomes:
Upon completion of the course, the student should be able to:
 Discuss the security issues network layer and transport layer.
 Apply security principles in the application layer.
 Explain computer forensics.
 Use forensics tools.
 Analyze and validate forensics data.
Text books:
 Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”,
Wiley Publications, 2015.
 Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage
Learning, India Edition, 2016.

References:
 John R.Vacca, “Computer Forensics”, Cengage Learning, 2015
 Richard E.Smith, “Internet Cryptography”, 3rd Edition Pearson Education, 2014.
 Marjie T.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd Edition,
Prentice Hall, 2017.


3 0 0 3

(R18CSE4263) Human Computer Interaction
Objectives:
You will gain an overview of Human-Computer Interaction (HCI), with an understanding of user
interface design in general, and alternatives to traditional „keyboard and mouse“ computing; become
familiar with the vocabulary associated with sensory and cognitive systems as relevant to task
performance by humans; be able to apply models from cognitive psychology to predicting user
performance in various human-computer interaction tasks and recognize the limits of human
performance as they apply to computer operation; appreciate the importance of a design and evaluation
methodology that begins with and maintains a focus on the user; be familiar with a variety of both
conventional and non-traditional user interface paradigms, the latter including virtual and augmented
reality, mobile and wearable computing, and ubiquitous computing; and understand the social
implications of technology and their ethical responsibilities as engineers in the design of technological
systems. Finally, working in small groups on a product design from start to finish will provide you with
invaluable team-work experience.
UNIT- I
Introduction: Importance of user Interface – definition, importance of good design. Benefits of good
design. A brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct manipulation, graphical
system, Characteristics, Web user – Interface popularity, characteristics- Principles of user interface.
UNIT- II
Design process – Human interaction with computers, importance of human characteristics human
consideration, Human interaction speeds, understanding business junctions.
Screen Designing:- Design goals – Screen planning and purpose, organizing screen elements, ordering
of screen data and content – screen navigation and flow – Visually pleasing composition – amount of
information – focus and emphasis – presentation information simply and meaningfully – information
retrieval on web – statistical graphics – Technological consideration in interface design.
UNIT- III
Windows – New and Navigation schemes selection of window, selection of devices based and screen
based controls.
Components – text and messages, Icons and increases – Multimedia, colors, uses problems, choosing
colors.
UNIT- IV
Software tools – Specification methods, interface – Building Tools.

UNIT- V
Interaction Devices – Keyboard and function keys – pointing devices – speech recognition digitization
and generation – image and video displays – drivers.
TEXT BOOKS:
1. The essential guide to user interface design, Wilbert O Galitz, Wiley DreamTech.
2. Designing the user interface. 3rd Edition Ben Shneidermann, Pearson Education Asia.
REFERENCE BOOKS:
1. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg,
Pearson Education
2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
3. User Interface Design, Soren Lauesen , Pearson Education.
4. Human –Computer Interaction,D.R.Olsen, Cengage Learning.
5. Human –Computer Interaction, Smith - Atakan, Cengage Learning.
Outcomes:
Ability to apply HCI and principles to interaction design.
Ability to design certain tools for blind or PH people.


0 0 14 7
(R18INF42P1) Project Work

LIST OF OPEN ELECTIVES

Open Elective – I
S. Credit
Course Code Course Title L T P
No. s
1 R18CIV3271 Disaster Management & Mitigation
2 R18CSE3272 Database Concepts
3 R18ECE3273 Consumer Electronics
4 R18EEE3274 Electrical Estimation & Costing

3 0 0 3
5 R18INF3275 Information Technology Essentials
6 R18MED3276 Introduction to Robotics
7 R18HMS3277 Fundamentals of Entrepreneurship
8 R18HMS3278 Day to Day Biology


B.Tech. - III Year – II Semester OPEN ELECTIVE- I L T P C
3 0 0 3
(R18CIV3271) Disaster Management & Mitigation

Course Objectives
The objective of this course is to provide an understanding of basic concepts of various disasters and its
management. In addition, the course is expected to develop scientific temperament and mitigation
techniques to manage disaster.
1. To understand basic concepts of disaster and hazards if India.
2. To study the various natural disasters.
3. To study the various manmade disasters.
4. To understand the disaster management principles.
5. To study the modern techniques used in disaster mitigation and management.
UNIT I - Introduction To Disaster - Meaning, Nature, Importance of Hazard, Risk, Vulnerability and
DisasterDimensions & Scope of Disaster Management - India’s Key Hazards – Vulnerabilities -
National disaster management framework - Disaster Management Cycle.
UNIT II - Natural Disaster - Natural Disasters- Meaning and nature of natural disaster; their types
and effects. Floods, drought, cyclone, earthquakes, landslides, avalanches, volcanic eruptions, Heat and
cold waves, Climatic change: global warming, Sea level rise, ozone depletion.
UNIT III - Anthropogenic Disaster - Man Made Disasters- Nuclear disasters, chemical disasters,
biological disasters, building fire, coal fire, forest fire, oil fire, air pollution, water pollution,
deforestation and industrial waste water pollution.
UNIT IV - Approaches in Disaster Management - Pre- disaster stage (preparedness) - Preparing
hazard zonation maps, Predictability/ forecasting & warning - Preparing disaster preparedness plan
Land use zoning - Preparedness through Information, education. Emergency Stage - Rescue training
for search & operation - Immediate relief - Assessment surveys. Post Disaster stage – Rehabilitation -
Social Aspect - Economic Aspect and Environmental Aspect.
UNIT V - Disaster Mitigation - Meteorological observatory - Seismological observatory - Hydrology
Laboratory and Industrial Safety inspectorate.Technology in Disaster Management Emergency
Management Systems (EMS) in the Disaster Management Cycle Remote Sensing and Geographic
Information Systems(GIS) in Disaster Management, Contemporary Topics.
TEXT BOOK
1. Sharma.S.R, “Disaster management”, A P H Publishers, 2011.
REFERENCES
6. VenuGopalRao.K, “Geoinformatics for Disaster Management”, Manglam Publishers and
Distributors, 2010.
7. Singh.R.B, “Natural Hazards and Disaster Management: Vulnerability and Mitigation”, Rawat
Publications, 2006.
8. Gupta.H.K, “Disaster Management”, University Press, India, 2003.
9. Gupta.M.C, “Manuals on Natural Disaster management in India”, National Centre for Disaster
Management,IIPA, New Delhi, 2001.


3 0 0 3
(R18CSE3272) Database Concepts

Course Objectives
To study the concepts of Relational Database design and query languages
1. To provide a general introduction to relational model
2. To learn about ER diagrams
3. To learn about Query processing and Transaction Processing
UNIT I: Introduction to Database Management - Introduction to Database Management systems –

History - Characteristics – Users- three-level architecture- Entity-- relationship data model.
UNIT II: The Relational Data Model and Relational Algebra - Data structures – Mapping E-R
Model to Relational model – data manipulation – integrity – advantages – rules for fully relational
systems – relational algebra – relational algebra queries.
UNIT III: Structured Query Language and Normalization - SQL – Data definition – manipulation
– views SQL in procedural programming – data integrity and constraints – triggers – data control –
database security.Normalization – Undesirable properties – single-valued normalization – desirable
properties of decompositions – multivalued dependencies
UNIT IV: Storage Indexing and Transactions Management - Different types of memories –
secondary storage – buffer management – file structures – heap files – sorted files – index and types –
indexed sequential file – B-tree – B+ tree.Transaction management – concepts – examples – schedules
– serializability – concurrency control – deadlocks – lock and multiple granularity – nonlocking
techniques.
UNIT V: Database Backup, Recovery and Security - Database system failure – backup – recovery
and concept of log – log-based recovery techniques – types of recovery – log-based immediate update
recovery technique. Database Security – violations – identifications and authentication – authorization /
access control – security of statistical databases – audit policy – internet applications and encryption,
Contemporary Topics.
TEXT BOOK
1. Gupta.G.K, “Database Management Systems”, Tata McGraw Hill, 2011.
REFERENCES
1. Silberschatz, Korth.H and Sudarshan.S, “Database System Concepts”, 6th Edition, McGraw-
HillInternational, 2011.
2. Hector Garcia-Molina, Jeffrey D.Ullman, Jennifer Widom, “Database System The Complete
Book, 1st Edition, Pearson 2002.
3. RamezElmasri and ShamkantB.Navathe, “Fundamentals of Database Systems”, Fifth Edition,
Pearson, 2008.


3 0 0 3
(R18ECE3273) Consumer Electronics

Course Objectives:
 Students are able to understand consumer electronics fundamentals, microprocessors and
microcontrollers, energy management and intelligent building perspective. Audio systems,
Display systems, video systems and recording systems
 Student is able to demonstrate smart Home, Home Virtual Assistants, Home security systems
and types of sensors RFID Home , kitchen electronics and smart alarms, smart toilet, smart
floor and smart locks
 Students are able to discuss cordless telephones, Fax machines PDA’s TABLETs Smart phones
and Smart watches. Video conferencing systems, Internet enabled systems, Wi-Fi, Li-Fi, GPS
and Tracking systems
UNIT I:Consumer Electronics Fundamentals - History of Electronic Devices- Vacuum Tubes,

Transistors, Integrated Circuits- Moorse Law, Semiconductor Devices, Diodes, Rectifiers, Transistors,
Logic Gates, Combinational Circuits, ADC, DAC and Microprocessors, Microprocessor Vs
Microcontrollers, Microcontrollers in consumer electronics, Energy management, Intelligent Building
Perspective.
UNIT II: Entertainment Electronics - Audio systems: Construction and working principle of :
Microphone, Loud speaker, AM and FM receiver, stereo, 2.1 home theatre, 5.1 home theatre .
Display systems: CRT, LCD, LED and Graphics displays Video Players : DVD and Blue RAY.
Recording Systems: Digital Cameras and Camcorders.
UNIT III: Smart Home - Technology involved in Smart home, Home Virtual Assistants- Alexa and
Google Home. Home Security Systems - Intruder Detection, Automated blinds, Motion Sensors,
Thermal Sensors and Image Sensors, PIR, IR and Water Level Sensors.
UNIT IV: Home Appliances - Home Enablement Systems: RFID Home, Lighting control, Automatic
Cleaning Robots, Washing Machines, Kitchen Electronics- Microwave, Dishwasher, Induction Stoves,
Smart Refrigerators, Smart alarms, Smart toilet, Smart floor, Smart locks.
UNIT V: Communication Systems - Cordless Telephones, Fax Machines, PDAs- Tablets, Smart
Phones and Smart Watches. Introduction to Smart OS- Android and iOS. Video Conferencing
Systems- Web/IP Camera, Video security, Internet Enabled Systems, Wi-Fi, IoT, Li-Fi, GPS and
Tracking Systems, Contemporary Topics.
TEXT BOOKS:
1. Thomas L Floyd "Electronic Devices" 10th Edition Pearson Education Asia 2018.
2. Philp Hoff "Consumer Electronics for Engineers" - Cambridge University Press.1998.
3. Jordan Frith, " Smartphones as Locative Media ", Wiley. 2014.
4. Dennis C Brewer, " Home Automation", Que Publishing 2013.
5. Thomas M. Coughlin, "Digital Storage in Consumer Electronics", Elsevier and Newness 2012.

Course Outcomes:
C325.1. summarize the consumer electronics fundamentals and explain about microprocessors and
microcontrollers, energy management and intelligent building perspective (K2-Understand)
C325.2. Demonstrate Audio systems, Display systems, video systems and recording systems (K3-
Apply)
C325.3. Describe the smart Home, Home Virtual Assistants, Home security systems and Different
types of sensors (K2-Understand)
C325.4. Outline the home enablement systems like RFID Home, kitchen electronics and smart alarms,
smart toilet, smart floor and smart locks. (K4-Analyse)
C325.5. Discuss cordless telephones, Fax machines PDA’s TABLETs Smart phones and Smart watches.
C325.6. Compare and explain Android and iOS and demonstrate Video conferencing systems,
Internet enabled systems, Wi-Fi, Li-Fi, GPS and Tracking systems. (K5-Evaluate)


3 0 0 3
(R18EEE3274) Electrical Estimation & Costing

Unit I: Electrical Symbols and Diagrams: (i) Need of symbols; List of symbols for electrical
equipment and accessories used in electrical works. Light, fan and power circuits, alarm and indicating
circuit, contactor control circuits as per I.S.S. (ii) Type of diagrams - Wiring diagrams (multiple and
single line representation) and schematic diagrams as per I.S.S. (* One Drawing Sheet for at least - 50
symbols).
Wiring materials and accessories: (1) Brief description, general specifications (as per I.S.S.) and
approximate cost of different types of wires, cables, switches, distribution board, switch board, boxes,
batten and its accessories, conduit and its accessories, lamp holders, socket out lets, plug ceiling roses.
Fuse and energy meter used in domestic and power wiring installations.
Unit II: Light and Fan Circuits: Schematic and wiring diagrams (multiline and single line both)
using junction boxes and looping systems for the following types of circuits:- (i) Light and fan
controlled by necessary switches and regulators. (ii) Stair case wiring (iii) Corridor lighting (iv) One
lamp controlled by three or more switches.
Unit III: Principles of Estimating and Costing: Purpose of estimating and costing, essentials of
estimating and costing-market survey, price list and net prices, preparation of list of materials,
calculation of material and labor cost, contingencies, overhead charges, profit and total cost. Estimation
of Domestic Internal Wiring Circuits: (i) Description of various wiring systems and methods. (ii) Need
of earthing and point to be earthed in internal wiring system as per IE rules. (iii) I.S. specifications,
calculation of No. of points (light, fan, socket outlet), calculation of total load including domestic
power, determination of no. of circuits, size of wires and cables, switches and main switch, distribution
board and switch board, batten conduit and other wiring accessories.
Unit IV: Estimation of Power Wiring: I.S. specifications and I.E. rules, calculation of current for
single and three phase motors. Determination of sizes of cables, conductors distribution board, main
switches and starters for power circuits. Cost of equipment and accessories and schedule of materials.
Estimation and cost of material and work for motors up to 20 H.P., pump sets and small workshops.
Unit V: Estimation of Overhead and Underground Distribution Lines: Main components of
overhead lines-line supports, cross-arm, clamps, conductors and stay sets, lightening arrestors, danger
plates, ant climbing devices, bird guards, jumpers etc., concreting of poles, earthing of transmission
line, formation of lines, specification of materials for O.H. lines, I.S. specification and I.E. rules. Cost
of material and work for overhead and underground lines upto 11 KV only.
Estimation of Small Sub-Station: Main equipment and auxiliaries installed on the substation.
Estimation of materials required for a small distribution substation (indoor and outdoor type platform
and pole mounted). Costing of material and work of above substations, Contemporary Topics.
Text Books:
1. S.K Bhattacharya, “Electrical Engineering Drawing & Design Estimating”.Wiley Eastern Ltd.
New Delhi.
2. Surjeet Singh, “Electrical Eesign& Drawing” S.K.Kataria& Sons New Delhi.
Reference Books:
1. O. P. Soni,” Electrical Engg. Design & Drawing” SatyaPrakashan Delhi.


3 0 0 3
(R18INF3275) Information Technology Essentials

COURSE OBJECTIVES:
 To introduce the principles required for building web applications.
 To provide working knowledge of the technologies needed for web application development
 To know about scripting languages.
 To understand principles of database access and storage.
 To understand various applications related to Information Technology.
COURSE OUTCOMES: Student will be able to
 Design and deploy web-sites
 Design and deploy simple web-applications
 Create simple database applications
 Develop an information system
 Describe the basics of networking
UNIT I: Web Essentials - Creating a Website - Working principle of a Website - Browser
fundamentals - Authoring tools - Types of servers: Application Server - Web Server - Database Server
– HTML basics – HTML tags and their use
UNIT II: Scripting Essentials - Need for Scripting languages - Types of scripting languages - Client
side scripting - Server side scripting - PHP - Working principle of PHP - PHP Variables - Constants -
Operators – Flow Control and Looping - Arrays - Strings - Functions - File Handling - PHP and HTML
- Cookies – Sessions - Authentication – Introduction to JavaScript
UNIT III: Database Essentials - Database management - Database terms - MySQL - commands –
Data types – Indexes – Functions – Accessing MySQL using PHP.
UNIT IV: Networking Essentials - Fundamental computer network concepts - Types of computer
networks - - Network layers - TCP/IP model - Wireless Local Area Network - Ethernet - WiFi -
Network Routing - Switching - Network components
UNIT V: Application Essentials - Creation of simple interactive applications - Simple database
applications - Multimedia applications - Design and development of information systems – Personal
Information System – Information retrieval system – Social networking applications, Contemporary
Topics
TEXT BOOKS:
1. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5" Third Edition, O'REILLY,
2014.
2. James F. Kurose, “Computer Networking: A Top-Down Approach”, Sixth Edition, Pearson,
2012.
REFERENCES:
1. GottapuSasibhushanaRao, "Mobile Cellular Communication", Pearson, 2012.
2. R. Kelly Rainer , Casey G. Cegielski , Brad Prince, Introduction to Information Systems, Fifth
Edition, Wiley Publication, 2014. 3. it-ebooks.org


3 0 0 3
(R18MED3276) Introduction to Robotics

COURSE OBJECTIVE:To impart knowledge about the basics of robot components and applications.
COURSE OUTCOMES:
1. Basics of Robot anatomy
2. Working of end effectors and drive systems
3. Kinematics and transformation analysis of robot
4. Various types of robot sensors
5. Robot cell design and applications of robot
UNIT I: Robot Basics - Robot-Basic concepts, Need, Law, History, Anatomy, specification. Robot
configurations-Cartesian, cylinder, polar and articulate.Robot wrist mechanism, Precision and accuracy
of robot-simple problems.
UNIT II: Robot Elements - End effectors-Classification, Types of Mechanical actuation, Gripper
force analysis, Gripper design, Robot drive system-Types, Position and velocity feedback devices-
Robot joints and links-Types, Motion interpolation.
UNIT III: Robot Kinematics - Robot kinematics – Direct and inverse kinematics – 2 and 3 DOF of
kinematics analysis-Robot trajectories – Control of robot manipulators – Point to point, Contouring
motion- 2D and 3D Transformation-Scaling, Rotation, Translation, Homogeneous coordinates,
multiple transformation-Simple problems.
UNIT IV: Robot Sensors - Sensors in robot – Touch sensors-Tactile sensor – Proximity and range
sensors – Robotic vision sensor-Force sensor-Light sensors, Pressure sensors
UNIT V: Robot Cell Design And Applications - Robot work cell design and control – Safety
measures in Robot – Robot cell layouts – Multiple robots and machine interference – Robot cycle time
analysis – Industrial applications of robots, Nanorobots, Robot programming-Basic program,
TEXT BOOKS:
1. Deb.S.R, “Robotics Technology and Flexible Automation”, Tata McGraw – Hill Publishing
Company Limited, 2010.
2. Mikell. P. Groover, ‘Industrial Robotics Technology’, Programming and Applications,
McGraw Hill Co, 2008.
REFERENCES:
1. Klafter.R.D, Chmielewski.T.A, and Noggin’s., “Robot Engineering : An Integrated Approac”’,
Prentice Hall of India Pvt. Ltd.,1994.
2. Fu.K.S, Gonzalez.R.C&Lee.C.S.G, “Robotics control, sensing, vision and intelligence”,
McGraw Hill Book co, 1987
3. Craig.J.J, “Introduction to Robotics mechanics and control”, AddisonWesley, 1999.
4. Ray Asfahl.C, “Robots and Manufacturing Automation”, John Wiley & Sons Inc., 1985.
5. Kozyrey, Yu. “Industrial Robotics”, MIR Publishers Moscow, 1985.


3 0 0 3
(R18HMS3277) Fundamentals of Entrepreneurship

COURSE OBJECTIVES: To create awareness on entrepreneurship among engineering students and
stimulating self-motivation to start up enterprise
COURSE OUTCOMES:
1. To provide awareness about entrepreneurship
2. To develop idea generation, creative and innovative skills
3. To self-motivate the students by making aware of different opportunities and successful growth
stories
4. To learn how to start an enterprise and design business plans those are suitable for funding by
considering all dimensions of business.
5. To understand entrepreneurial process by way of studying different case studies and find exceptions
to the process model of entrepreneurship.
6. To run a small enterprise with small capital for a short period and experience the science and art of
doing business.
UNIT I: Introduction to Entrepreneurship - Understanding the Meaning of Entrepreneur;
Characteristics and Qualities of an Entrepreneur; Entrepreneurs VsIntrapreneurs and Managers;
Classification of Entrepreneurs; Factors Influencing Entrepreneurship; Entrepreneurial Environment;
Entrepreneurial Growth; Problems and Challenges of Entrepreneurs; Entrepreneurial Scenario in India.
UNIT II: Micro, Small and Medium Enterprises (MSMEs) - MSMEs – Definition and Significance
in Indian Economy; MSME Schemes, Challenges and Difficulties in availing MSME Schemes, Forms
of Business; Women Entrepreneurship; Rural Entrepreneurship; Family Business and First Generation
Entrepreneurs.
UNIT III: Idea Generation and Feasibility Analysis - Idea Generation; Creativity and Innovation;
Identification of Business Opportunities; Market Entry Strategies; Marketing Feasibility; Financial
Feasibilities; Political Feasibilities; Economic Feasibility; Social and Legal Feasibilities; Technical
Feasibilities; Managerial Feasibility, Location and Other Utilities Feasibilities.
UNIT IV: Business Model and Plan in Respective Industry - Business model – Meaning, designing,
analyzing and improvising; Business Plan – Meaning, Scope and Need; Financial, Marketing, Human
Resource and Production/Service Plan; Business plan Formats; Project report preparation and
presentation; Why some Business Plan fails?
UNIT V: Financing and How to Start up Business? - Financial opportunity identification; Banking
sources; Non-banking Institutions and Agencies; Venture Capital – Meaning and Role in
Entrepreneurship; Government Schemes for funding business; Pre launch, Launch and Post launch
requirements; Procedure for getting License and Registration; Challenges and Difficulties in Starting
an Enterprise, Contemporary Topics.
TEXT BOOKS :
1. Jayshree Suresh, “Entrepreneurial Development”, Margham Publishers, Chennai, 2011.
2. Poornima M Charantimath, “Entrepreneurship development small business enterprises”,
Pearson, 2013.

REFERENCES:
1. Raj Shankar, “Entrepreneurship: Theory And Practice”, Vijay Nicole imprints ltd in
collaboration with Tata Mc-graw Hill Publishing Co.ltd.-new Delhi, 2012
2. Robert D. Hisrich, Mathew J. Manimala, Michael P Peters and Dean A. Shepherd,
“Entrepreneurship”, 8th Edition, Tata Mc-graw Hill Publishing Co.ltd.-new Delhi, 2012
3. Martin Roger, “The Design of Business”, Harvard Business Publishing, 2009
4. Roy Rajiv, “Entrepreneurship”, Oxford University Press, 2011
5. Drucker.F, Peter, “Innovation and Entrepreneurship”, Harper business, 2006.


B.Tech. - III Year – II Semester OPEN ELECTIVE - I L T P C
3 0 0 3
(R18HMS3278) Day to Day Biology

COURSE OBJECTIVE: The purpose of this study is to know and understand the involvement of
biology in day-to-day life. This would give insight into his or herown biological system, the diseases
and disorders, antibiotics, and importance of environment in human life. This also provides application
of biology in day to day life.
COURSE OUTCOMES:
1. The student can understand the biology of human system and health.
2. This provides student with a scope for selection of healthy food and sustain environment.
UNIT I: Biology of Human Diseases and Disorders - Diabetes mellitus, communicable diseases,
genetic disorders, vector borne diseases, antibiotics - mode of action.
UNIT II: Biology for Human - Blood pressure, immune system and immunity, cardiac infarction, in
vitro fertilization, cord blood bank, stem cells.
UNIT III: Biology of Cosmetics and Detergents - Biology of complexion and texture, bioactive
natural products in industrial use, bio surfactants, antioxidants.
UNIT IV: Biology and Nutrition - Dietary index, carbohydrates, proteins and fats, HDL and LDL,
dairy products and application, herbal plants and home remedies.
UNIT V: Biology and Environment - Water pollution, air pollution, bioremediation, species
biodiversity, global warming and greenhouse effect, Contemporary Topics.
TEXT BOOKS:
1. Gareth J. Price, Biology: An Illustrated Guide to Science, Diagram Group, Infobase Publishing,
2006.
2. Pam Dodman, Real-Life Science Biology, Walch Publishing, 2008.
REFERENCES:
1. Biology:TheScience of Life, Stephen Nowicki, http://www.thegreatcourses.com/tgc/courses.
2. Neil Schlager, Science of everyday things: Real-Life Biology, Gale Publishing 2002.

Open Elective –II

S.
No.
1 R18CIV4181 Green Building Engineering
2 R18CSE4182 Cyber Security Fundamentals
Principles of Modern Communication

3 R18ECE4183
Systems
4 R18EEE4184 Illumination Engineering

3 0 0 3
5 R18INF4185 E-Commerce
6 R18MED4186 Industrial Design & Ergonomics
7 R18HMS4187 Creative Writing
8 R18HMS4188 Design Thinking


B.Tech. - IV Year – I Semester OPEN ELECTIVE - II L T P C
3 0 0 3
(R18CIV4181) Green Building Engineering

Course Outcomes: On successful completion of this course the student will be able to:
1. Describe the concepts of Green building
2. Adopt Renewable energy for buildings.
3. Implement Automation techniques in buildings.
4. Describe Actuator techniques for Automation
5. Choose appropriate materials for Green buildings
UNIT 1 Concept of Green Buildings : Green building initiatives, its origin, characteristics of a green
building, green buildings in India, certification of green buildings.Criteria for rating – sustainability.
Depleting natural resources of building materials; renewable and recyclable resources; energy efficient
materials; green cement, biodegradable materials, smart materials, engineering evaluation of these
materials. Case study.
UNIT 2 Sources of Energy Renewable and non-renewable sources of energy ; coal, petroleum,
nuclear, wind, solar, hydro, geothermal sources; potential of these sources, hazards, pollution; global
scenario with reference to demand and supply in India. Energy arises. Carbon Emission: Forecasting,
control of carbon emission, air quality and its monitoring carbon foot print; environmental issues,
minimizing carbon emission.
UNIT 3 - Intelligent Buildings Intelligent buildings-Building automation-Smart buildings- Building

services in high rise buildings-Green buildings-Energy efficient buildings for various zones-Case
studies of residence, office buildings and other buildings in each zones. Case Study.
UNIT 4 Actuator Techniques Actuator and actuator materials – Piezoelectric and Electrostrictive
Material – Magneto structure Material – Shape Memory Alloys – Electrorheological Fluids–
Electromagnetic actuation – Role of actuators and Actuator Materials.
UNIT 5 Materials For "Green" Systems Green materials, including biomaterials, biopolymers,
bioplastics, and composites Nanotech Materials for Truly Sustainable Construction: Windows,
Skylights, and Lighting. Paints, Roofs, Walls, and Cooling.Multifunctional Gas Sensors, Biomimetic
Sensors, Optical Interference Sensors Thermo-, light-, and stimulus-responsive smart materials,
TEXT BOOKS
1. Sustainable Construction , Charles J. Kibert.,Third Edition
2. Green Building A to Z, Jerry Yudelson.
REFERENCE BOOKS
1 Advanced Technology for Smart buildings,James Sinopoli
E BOOKS https://www.springer.com/in/book/9789811010002
https://www.elsevier.com/books/smart-buildings/casini/978-0-08-100635-1
MOOChttps://www.mooc-list.com/tags/green-building


3 0 0 3
(R18CSE4182) Cyber Security Fundamentals

Course Objectives:
1. Understand the need for Cyber security and its related threats and attacks
2. Learn methods to become secure in the cyber world and securely communicate in the cyber
world
3. Become knowledgeable about the best practices related to cyber security, regulations and laws
associated with the same.
Course Outcomes:
The broad education necessary to understand the impact of engineering solutions in a global,
economic, environmental and societal context
UNIT I: Need for Cyber Security - Introduction to security- CIA triad-Case studies- security attacks-
issues related to social networking - Guidelines
UNIT II: Methods to Secureyourself in the Cyber World - Why and What of Reversible and
Irreversible Cryptographic mechanisms? Applications of Digital Signature - Good password practices
UNIT III: E-Commerce: Secure Transactions - What is E-commerce? – Online banking security-
Online shopping fraudGuidelines and Recommendations
UNIT IV: EVERYDAY SECURITY - Connecting your laptop, mobile devices, PDAs to Internet-
Managing your browser-Facebook Security-E-mail security – Safe guarding from Viruses:
Antiviruses– Best practices and guidelines
UNIT V: CYBER SECURITY LAWS AND COMPETENT AUTHORITIES - Indian IT Act, 2008 -
What is Cyber Forensics? – Functions of cybercrime cell – Responding to a cyber-attack,
Contemporary Topics
REFERENCES:
1. “Information Security Awareness Handbook, ISEA, Department of Electronics and Information

Technology”, Government of India, 2010
2. deity.gov.in/sites/upload_files/dit/.../itact2000/it_amendment_act2008.pdf
3. www.schneier.com/blog/archives/2013/03/browser_securit.html
4. www.dhses.ny.gov/ocs/awareness-training-events/news/2010-03.cfm
5. https://www.watsonhall.com/e-commerce-security/


3 0 0 3
(R18ECE4183) Principles of Modern Communication Systems
Course Objectives:
This course aims at:
 Establishing a firm foundation for the understanding of telecommunication systems, and the
relationship among various technical factors when such systems are designed and operated
 To provide the student with an understanding of the mobile Cellular communications and their
evolution.
 To equip the students with various kinds of wireless networks and its operations.
 To provide students with solid foundation in orbital mechanics and launches for the satellite
communication
 Radar fundamentals and analysis of the radar signals
UNIT I: The evolution of electronic communication: From smoke signals to smart phones - History of
communications: Theoretical Foundations, Development & Applications - Frequencies for
communication - Frequency regulations - Overview of communication transmitter and receiver.
UNIT II: Mobile Cellular Communications: Evolution to cellular networks – Cellular systems
generations and standards: 1G, 2G, 3G, 4G - Cellular network components - Components of a mobile
phone - setting up a call process - Making a call process - Receiving a call process - Spectrum
allocation: Policies and strategies, Role of TRAI.
UNIT III: Wireless Communication: Introduction - Bluetooth - Infrared communication - IEEE
Wireless LANs (Wi-Fi) - IEEE 802.16 (WiMaX) - Future mobile and wireless networks: Introduction
to 5G- device to device communication- IoT.
UNIT IV: Satellite: History of Satellite communication, Basics of Satellites, Types of Satellites,
Capacity Allocation - Launch Vehicles and Orbits: Introduction to launching vehicles, Important
Orbits, working of rocket, Three Pioneers of Rocketry - Basics of Global Positioning System (GPS) -
Applications of GPS.
UNIT V:RADAR& NAVIGATION: Introduction, Radar Block diagram and Operation, Radar
Frequencies, Applications of Radar. Navigation Systems: Introduction & methods of navigation,
Instrument Landing System, Microwave landing system- Modern Navigation systems, Contemporary
Topics.
REFERENCES:
1. S.Haykin, ―Communication Systems, 4/e, John Wiley 2007
2. B.P.Lathi, ―Modern Digital and Analog Communication Systems, 3/e, Oxford University
Press,2007
3. Rappaport Theodore S - Wireless Communications: Principles and Practice, 2/E, Pearson
4. Education India, 2010 5. Vijay. K. Garg, ―Wireless Communication and Networking, Morgan
Kaufmann Publishers, 2007.
5. T.Pratt, C. Bostian and J.Allnutt; ―Satellite Communications, John Wiley and Sons, Second
Edition., 2003
6. M. I .Skolnik ―Introduction to Radar Systems, Tata McGraw Hill 2006.
7. Myron Kyton and W.R.Fried ―Avionics Navigation Systems, John Wiley & Sons 1997.

Course outcomes
After completion of the course, students will be able to:
C415.1. Differentiate various elements, processes, and parameters in communication systems, and
describe their functions, effects, and interrelationship (K2-Understand).
C415.2. Interpret the mobile cellular concepts, standards and all generations of cellular systems. (K2-
understand)
C415.3. Describe the existing and emerging wireless standards and Compare various wireless networks
and their specifications. (K5-Evaluate)
C415.4. Demonstrate the history of Satellite communication, applications and orbit concepts,
Placement of a Satellite in a Geo-Stationary orbit and GPS concept (K3- Apply)
C415.5 Summarize the radar fundamentals and analysis of the radar signals. (K4- Analyze)
C415.6 Explain the Navigation systems (K2-Understand).


3 0 0 3
(R18EEE4184) Illumination Engineering

COURSE OBJECTIVES:
 To provide an introduction to the fundamentals of illumination engineering and architectural
lighting design.
 To impart lighting fundamentals, measurement, and technology and their application in the
analysis and design of architectural lighting systems
COURSE OUTCOME: The students will be able to:

i. Identify the criteria for the selection of lamps and lighting systems for an indoor or outdoor
space
ii. Perform calculations on photometric performance of light sources and luminaires for lighting
design
iii. Evaluate different types of lighting designs and applications
UNIT I: Introduction of Light : Types of illumination, Day lighting, Supplementary artificial lighting
and total lighting, Quality of good lighting, Factors affecting the lighting-shadow, glare, reflection,
Color rendering and stroboscopic effect, Methods of artificial lighting, Lighting systems-direct,
indirect, semi direct, semi indirect, Lighting scheme, General and localized.
UNIT II: Measurement of Light: Definition of luminous flux, Luminous intensity, Lumen, Candle
power, Illumination, M.H.C.P, M.S.C.P, M.H.S.C.P, Lamp efficiency, Brightness or luminance, Laws
of illumination, Inverse square law and Lambert’s Cosine law, Illumination at horizontal and vertical
plane from point source, Concept of polar curve, Calculation of luminance and illumination in case of
linear source, round source and flat source.
UNIT III: Design of Interior Lighting : Definitions of maintenance factor, Uniformity ratio, Direct
ratio, Coefficients of utilization and factors affecting it, Illumination required for various work planes,
Space to mounting height ratio, Types of fixtures and relative terms used for interior illumination such
as DLOR and ULOR, Selection of lamp and luminance, Selection of utilization factor, reflection factor
and maintenance factor Determination of Lamp Lumen output taking into account voltage and
temperature variations, Calculation of wattage of each lamp and no of lamps needed, Layout of lamp
luminaire, Calculation of space to mounting height ratio, Indian standard recommendation and standard
practices for illumination levels in various areas, Special feature for entrance, staircase, Corridor
lighting and industrial building.
UNIT IV: Design of Outdoor Lighting: Street Lighting : Types of street and their level of
illumination required, Terms related to street and street lighting, Types of fixtures used and their
suitable application, Various arrangements in street lighting, Requirements of good street lighting,
Selection of lamp and luminaire, Calculation of their wattage, Number and arrangement, Calculation of
space to mounting height ratio, Calculation of illumination level available on road.

UNIT V:Design of Outdoor Lighting: Flood Lighting: Terms related to flood lighting, Types of
fixtures and their suitable applications, Selection of lamp and projector, Calculation of their wattage
and number and their arrangement, Calculation of space to mounting height ratio, recommended
method for aiming of lamp.
Special Features of Aesthetic Lighting: Monument and statue lighting, Sports lighting, Hospital
lighting, Auditorium lighting, Contemporary Topics.
Text Books:
1. D.C. Pritchard Lighting, Routledge, 2016
2. Jack L. Lindsey, Applied Illumination Engineering, PHI, 1991
3. John Matthews Introduction to the Design and Analysis of Building Electrical Systems,
Springer, 1993
4. M.A. Cayless, Lamps and Lighting, Routledge, 1996
References:
1. IS CODE 3646
2. IS CODE 6665


3 0 0 3
(R18INF4185) E – COMMERCE
COURSE OUTCOMES: At the end of the course, the students will be able to :
1. Understand the E – commerce strategies and value chains
2. Understand the E-commerce services
3. Understand E - commerce infrastructure, its applications and Supply Chain Management.
4. Know the availability of latest technology and applications of E-Payment Mechanism.
5. Apply E-Commerce in business-to-business application.
UNIT 1: Electronic Commerce: Overview, Definition, Advantages & Disadvantages of E-Commerce,
Threats of E-Commerce, Managerial Prospective, Rules & Regulation for Controlling Commerce,
Relationship Between E-Commerce & Networking, Different Types of Networking for E-Commerce,
internet, Intranet, EDI Systems, Wireless Application Protocol: Definition, Hand Held Devices,
Mobility & Commerce Model, Mobile Computing, Wireless Web, Web Security, Infrastructure
Requirement for E-Commerce, Business Model of E-Commerce; Model Based on Transaction Type,
Model Based on Transaction Party- B2B, B2C, C2B, C2C, E-Governance.
UNIT 2: E-Strategy: Overview, Strategic Methods for developing E-Commerce. Four C's
(Convergence, Collaborative, Computing, Content Management & Call Center). Convergence:
Technological Advances in Convergence - Types, Convergence and its implications, Convergence &
Electronic Commerce. Collaborative Computing: Collaborative Product Development, contract as per
CAD, Simulations Collaboration, Security. Content Management: Definition of Content, Authoring
Tools and Content Management, Content Management, Content - partnership, repositories,
convergence, providers, Web Traffic.
UNIT 3: Traffic Management: Content Marketing Call Center: Definition, Need, Tasks Handled,
Mode of Operation, Equipment, Strength & Weakness of Call Center, Customer Premises Equipment
(CPE).
Supply Chain Management: E-logistics, Supply Chain Portal, Supply Chain Planning Tools (SCP
Tools), Supply Chain Execution(SCE), SCEFramework, Internet's Effect on Supply Chain Power.
UNIT 4: E-Payment Mechanism: Payment through card system, E-Cheque, E-Cash, E-Payment,
Threats& Protections.
E-Marketing: Home - Shopping, E-Marketing, Tele- Marketing
UNIT 5: Electronic Data Interchange (EDI): Meaning, Benefits, Concepts, Application, EDI Model,
Protocols (UN EDI, FACT/ GTDI), ANSIX-12, Data Encryption (DES/RSA)
Risks of E-Commerce: Overview, Security for E-Commerce, Security Standards, Firewall,
Cryptography, Key Management, Password Systems, Digital Certificates, Digital Signatures,
Text Book:
1. Electronic Commerce - Technologies & Applications, Bhaskar Bharat, TMH
Reference Books:
1. E-commerce, MM Oka, EPH
2. Frontiers of Electronics Commerce, Kalakotia, Whinston, Pearson Education
3. Electronic Commerce, Loshinpete, Murphy P. A., Jaico Publishing Housing

4. E-Commerce, Murthy, Himalaya Publishing.

3 0 0 3
(R18MED4186) Industrial Engineering & Ergonomics
UNIT 1: Introduction: An approach to industrial design -elements of design structure for industrial
design in engineering application in modern manufacturing systems. Ergonomics and Industrial
Design: Introduction -general approach to the man- machine relationship- workstation design-working
position.
UNIT 2: Control and Displays: Shapes and sizes of various controls and displays-multiple, displays
and control situations - design of major controls in automobiles, machine tools etc Ergonomics and
Production: ergonomics and product design -ergonomics in automated systems- expert systems for
ergonomic design. Anthropometric data and its applications in ergonomic, design- limitations of
anthropometric data- use of computerized database.
UNIT 3: Visual Effects of Line and Form: The mechanics of seeing- psychology of seeing general
influences of line and form. Color: Color and light -color and objects- color and the eye -color
consistency- color terms- reactions to color and color continuation -color on engineering equipment.
UNIT 4: Aesthetic Concepts: Concept of unity- concept of order with variety -concept of purpose style
and environment- Aesthetic expressions. Style-components of style- house style, observation style in
capital goods, case study.
UNIT 5: Industrial Design in Practice: General Design -specifying design equipment- rating the
importance of industrial design -industrial design in the design process, Contemporary Topics.
REFERENCE BOOKS:
1. Industrial Design for Engineers - Mayall W.H. - London Hiffee books Ltd.-1988.
2. Applied Ergonomics Hand Book - Brain Shakel (Edited) - Butterworth scientific. London
3. Introduction to Ergonomics - R. C. Bridger - McGraw Hill Publications -1995.
4. Human Factor Engineering - Sanders & McCormick - McGraw Hill Publications – 6th edition,2002.


3 0 0 3
(R18HMS4187) Creative Writing

COURSE OBJECTIVE: This course introduces students to the practice of creative writing in the
genres of poetry and fiction. In addition to honing their skills as creative writers, students will develop
a critical vocabulary that will aid them in discussing poems and fiction produced by their peers. This
course allows for experimentation with writing poetry, short fiction, and creative nonfiction in a
writing workshop setting. Far from undertaking the task of making student a professional writer, this
class has its goal to familiarize the learner with the dynamics of imaginative literature, the synergy of
form and content, and with what makes a particular work effective.
COURSE OUTCOMES:
1. Discuss with some confidence many of the rhetorical devices, from metaphor to enjambment
associated with creative writing.
2. Appreciate the complexity of Poetry, Short Fiction, and Creative Nonfiction.
3. Understand the importance of Creative Writing as a means of self-expression.
4. Read and discuss with enhanced understanding Poetry, Short Fiction, and Creative Nonfiction
5. Show improvement in writing and analytical skills.
UNIT I: Introduction to Literary Forms - Elements of Poetry - Rhythm and Meter Poetic Forms –
Ballad, Lyrics, Elegy, Odes, Haiku, Sonnets Literary Genres- Short Fiction, Drama, and Non-Fiction
UNIT II: Poetry Writing - Appreciation of the form and content of poem Techniques - figurative
language - (structure - rhythm – imagery – tone – style point of view, voice - read and discuss
numerous poems)
Ballad - The Ballad of the Landlord by Langston Hughes; Lyrics - Kubla Khan by Samuel Taylor
Coleridge Elegy - Elegy Written in a Country’s Churchyard by Thomas Gray Odes – Ode to a
Nightingale by John Keats; Haik u- This Other World by Richard Wright Sonnet - On His Blindness by
John Milton Students Creative Assignment – Students will write three poems.
UNIT III: Short Fiction / Novel - Elements of Fiction - Character – Plot- Setting – Theme - Style;
Narrator - Point of view - Tone – Suspension of Disbelief. Genres - Adventure, Comic, Fantasy,
Gothic, Romance, Historical, Horror, Supernatural, Thriller, Science Fiction - Gooseberries by Anton
Chekhov Short Story - My Lost Dollar by Stephen Leacock Students Creative Assignment – Students
will write one Short Story
UNIT IV: Drama - Elements of Drama - Character Plot, Theme, Dialogue, Convention, Genre,
Audience, Stagecraft, Design, ConversionsDrama – The King of the Dark Chamber by Rabindranath
Tagore Students Creative Assignment- Students will write a review of the drama read in the class.
UNIT V: Non Fiction - Prose, Biography, Memoirs, and Personal Essays Walden or Life in the
Woods by Henry David Thoreau Students Creative Assignment - Students will write one or two essays,
REFERENCES
1. Candace H. Schaefer, Rick Diamond. 1998. The Creative Writing Guide: A Path to Poetry,
Nonfiction, and Drama, Longman, New York, USA
2. Shelly Clark and MarjoneSaisa, 2009. Road Trip: Conversations with Writers, The Backwaters
Press, Nebraska, USA
3. Nikki Moustaki (ed.), 1998. Writing Fiction: The Practical Guide from New York’s Acclaimed
Creative Writing School, Publisher: Bloomsbury, ISBN: 0156005743.


3 0 0 3
(R18HMS4188) Design Thinking

Course Objectives:
 To create awareness of design among students of engineering
 To motivate students to think of design before implementing an engineering project
 To teach a systematic approach to identifying and defining a problem before brainstorming for
a solution
 To instill a sense of significance towards applying creativity to product and service design
Course Outcomes: Upon completion of this course, the student shall be

1. Learn to identify design principles from an engineering perspective
2. Cultivate sensitivity towards design aspects in objects made by engineers and non-engineers,
which are typically used in daily life
3. Understand and create visual design elements to communicate more effectively
4. Construct clear problem statements, understand the importance of validation, and design
services creatively
5. Develop fundamental team skills: working in teams and managing teams, strategizing tasks,
and streamlining activities pertaining to a project
Students’ Responsibilities:
1. Students will form teams of 3–5 members each, while working collaboratively throughout the
semester.
2. Students will present and report the tasks to the class and to the concerned faculty members and
design experts, using their oral and written communication skills as well as creativity and team
skills.
3. Students must proactively engage in observing the objects and processes which are part of their
daily life and society from a design perspective and discuss with peers to learn collaboratively.
UNIT 1: Design Overview and Motivation History and Context of birth of Design; Design thinking:
Introduction and Motivation; Various definitions and interpretations of design, Design Vocabulary;
Design in Indian Context; Art and Design: Art in Design, Design beyond Art; Design in Creative
Industries
UNIT 2: Design Sensitization for Engineers- Design Engineering vs. Engineering Design, Examples of
Engineering Design and Design Engineering in various engineering domains, Examples of design
failures leading to bad products and services, Real-world examples of bad design that caused
engineering and technological disasters, Domain-specific Engineering Design examples
UNIT 3:Design Thinking Foundations The Design Double Diamond: Discover-Define-Develop-

Deliver User-centric design approaches: Importance of user-centricity for design, Empathisation,
Empathy Maps, Data collection from users and for users, Data Validation Responsible Innovation and
Ethical Design: Ethics as foundation for design, Concern for environment and sustainability

UNIT 4: Communication Skills for Design, Culture and Art Communication Media to express an idea:
Visuals, Text, Voice and Audio, Info graphics General guidelines for a good Presentation: Target
audience, slideshow templates, appropriate visual elements, presentation styles, guidelines General
guidelines for a good Report: Documentation classification, standards, styles, and templates Modes of
communication: Reports and documents, Presentation, poster, graphic, blog or website. Understanding
Art in Design: Need for creativity, Elements of Visual Design Aesthetics: Influences and impressions
of Colors, Shapes, Layouts, Patterns, and Fonts as Design Elements
UNIT 5:Applied Creativity and Design for Services Methods to brainstorm solutions for user issues;
Combining solutions to workable solution concepts; Identifying the user needs in a service-driven
economy; Process Flows and Customer Experience considerations for designing and improving
services; 5 Why’s; Service Delivery Pathways. Doing Design Looking for a problem, Ideation and
Rules of Ideation, Framing and stating the problem; Basic considerations of Prototyping/ Model
Building, Basics of Testing and Validation, Incorporating feedback, Contemporary Topics.
TEXT BOOKS:
1. Daniel Ling, “Complete Design Thinking Guide for Successful Professionals”, CreateSpace
Independent Publishing, 2015 (ISBN: 978-1514202739)
2. Tim Brown, “Change by Design”, Harper Business, 2012 (ISBN: 978-0062337382)
3. Jimmy Jain, “Design Thinking for Startups: A Handbook for Readers and Workbook for
Practitioners”, Notion Press, 2018 (ISBN: 978-1642495034)
4. Beverly Rudkin Ingle, “Design Thinking for Entrepreneurs and Small Businesses: Putting the
Power of Design to Work”, APress, 2013 (ISBN: 978-1430261810)
REFERENCES:
1. Donald A. Norman, “The Design of Everyday Things”, MIT Press, 2013 (ISBN: 978-
0262525671)
2. Bruno Munari, “Design As Art”, Penguin UK, 2009 (ISBN: 978-0141035819)
3. Tom Kelly, Jonathan Littman, “The Art of Innovation”, HarperCollins Business, 2002 (ISBN:
978-0007102938)
4. Thomas Lockwood, “Design Thinking: Integrating Innovation, Customer Experience, and
Brand Value”, Allworth Press, 2009 (ISBN: 978-158115)

Open Elective –III
S.
No.
1 R18CIV4291 Remote Sensing Concepts
2 R18CSE4292 Fundamentals of Soft Computing
3 R18ECE4293 Audio & Video Engineering
4 R18EEE4294 Non Conventional Energy Resources

3 0 0 3
5 R18INF4295 Information Security Fundamentals
6 R18MED4296 Total Engineering Quality Management
Human Values & Professional Ethics for

7 R18HMS4297
Engineers
8 R18HMS4298 Science Fiction


B.Tech. - IV Year – I Semester OPEN ELECTIVE - III L T P C
3 0 0 3
(R18CIV4291) Remote Sensing Concepts
COURSE OBJECTIVES: To introduce the concepts of remote sensing processes and its components.
To expose the various remote sensing platforms and sensors and to introduce the elements of data
interpretation
COURSE OUTCOMES:
1. At the end of the course the student will be able to understand
2. The characteristics of electromagnetic radiation and its interaction with earth features
3. The types and configuration of various satellites and sensors
4. The elements of data interpretation
UNIT I:Remote Sensing and Electromagnetic Spectrum- Definition – components of RS – History

of Remote Sensing – Merits and demerits of data collation between conventional and remote sensing
methods - Electromagnetic Spectrum – wave theory, particle theory, Stefan – Boltzmann Law and
Wien’s Law – visible and non-visible spectrum – Radiation sources: active & passive; Radiation
Quantities
UNIT II:EMR Interaction with Atmosphere- Standard atmospheric profile – main atmospheric
regions and its characteristics – interaction of radiation with atmosphere - Scattering (Rayleigh, Mie,
non-selective scattering) absorption and refraction – Atmospheric effects on visible, infrared, thermal
and microwave spectrum – Atmospheric windows.
UNIT III: EMR Interaction with Earth- Energy balance equation – Specular and diffuse reflectors –
Spectral reflectance &emittance – Spectro radiometer / Spectrophotometer – Spectral Signature
concepts – Typical spectral reflectance curves for vegetation, soil and water body – Factors affecting
spectral reflectance of vegetation, soil and water body.
UNIT IV: Platforms and Sensors- Ground based platforms –Airborne platforms – Space borne
platforms – Classification of satellites – Sun synchronous and Geosynchronous satellites – Resolution
concepts – Scanners - Along and across track scanners – Orbital and sensor characteristics of different
satellites – Airborne and Space borne TIR sensors – Calibration – S/N ratio – Passive/Active
microwave sensing – Airborne and satellite borne RADAR –SAR –LIDAR , UAV – High Resolution
Sensors
UNIT V: Data Products and Visual Interpretation- Photographic (film and paper) and digital
products – quick look products - High Resolution data products data - ordering – interpretation – basic
characteristics of image elements – interpretation keys (selective and elimination) – visual
interpretation of natural resources, Contemporary Topics.
TEXT BOOKS:
1. Richards, Remote sensing digital Image Analysis-An Introduction Springer - Verlag 1993.
2. Lillesand, T.M. and Kiefer R.W. Remote Sensing and Image interpretation, John Wiley and Sons,
Inc, New York, 2002.

REFERENCES:
1. Janza, F.Z., Blue H.M. and Johnson,J.E. Manual of Remote Sensing. Vol.I, American Society
of Photogrametry, Virginia, USA, 2002.
2. Verbyla, David, Satellite Remote Sensing of Natural Resources. CRC Press, 1995
3. Paul Curran P.J. Principles of Remote Sensing. Longman, RLBS, 2003.


3 0 0 3
(R18CSE4292) Fundamentals of Soft Computing

COURSE OBJECTIVES: The main objective of the Soft Computing Techniques to Improve Data
Analysis Solutions is to strengthen the dialogue between the statistics and soft computing research
communities in order to cross-pollinate both fields and generate mutual improvement activities.
UNIT I: Introduction: What is Soft Computing? Difference between Hard and Soft computing,
Requirement of Soft computing, Major Areas of Soft Computing, Applications of Soft Computing.
Neural Networks: What is Neural Network, Learning rules and various activation functions, Single
layer Perceptrons, Back Propagation networks, Architecture of Back propagation(BP) Networks,
Backpropagation Learning, Variation of Standard Back propagation Neural Network, Introduction to
Associative Memory, Adaptive Resonance theory and Self Organizing Map, Recent Applications.
UNIT II:Fuzzy Systems: Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation, Fuzzification,
Minmax Composition, Defuzzification Method, Fuzzy Logic, Fuzzy Rule based systems, Predicate
logic, Fuzzy Decision Making, Fuzzy Control Systems, Fuzzy Classification.
UNIT III: Genetic Algorithm: History of Genetic Algorithms (GA), Working Principle, Various
Encoding methods, Fitness function, GA Operators- Reproduction, Crossover, Mutation, Convergence
of GA, Bit wise operation in GA, Multi-level Optimization.
UNIT 4: Hybrid Systems: Sequential Hybrid Systems, Auxiliary Hybrid Systems, Embedded Hybrid
Systems, Neuro-Fuzzy Hybrid Systems, Neuro-Genetic Hybrid Systems, Fuzzy-Genetic Hybrid
Systems.
UNIT V: GA based Backpropagation Networks:

GA based Weight Determination, K - factor determination in Columns.
Fuzzy Backpropagation Networks: LR type Fuzzy numbers, Fuzzy Neuron, Fuzzy BP Architecture,
Learning in Fuzzy BP, Application of Fuzzy BP Networks, Contemporary Topics.
TEXT BOOKS:
1. Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis & Applications,
S.Rajasekaran, G. A. Vijayalakshami, PHI.
2. Genetic Algorithms: Search and Optimization, E. Goldberg.
3. Neuro-Fuzzy Systems, Chin Teng Lin, C. S. George Lee, PHI.
4. Build_Neural_Network_With_MS_Excel_sample by Joe choong.


3 0 0 3
(R18ECE4293) Audio and Video Engineering

Course Objectives:
 Student are able understand different amplifiers, graphic equalizer and Dolby NR recording
systems TV fundamentals like concept of aspect ratio ,image continuity etc Color theory
 Student are able to discuss composite video signal ad CCIR B standard for color signal
Transmission and reception, monochrome TV transmitter and receivers, Color TV transmitter
and compare TV camera tubes, Color picture tube
 Student are able Illustrate of color TV receivers(PAL-D) and Differentiate between NTSC PAL
and SCAM systems cable Television, MATV, CATV, CCTV, Cable TV network and DTH
UNIT I: Hi Fi Audio Amplifier - Introduction to Amplifiers: Mono, Stereo, Public Address;

Difference between stereo amplifier and Mono amplifier; Block diagram of Hi Fi amplifier and
explanation; Graphic equalizer concept, circuit diagram and operation. (5 Point Circuit diagram);
Dolby NR recording system; Types of speaker woofer, Midrange and Tweeter; Cross over network
circuit and its function.
UNIT II: TV Fundamentals - Concept of Aspect ratio, image continuity, interlace scanning, scanning
periods, horizontal and vertical, vertical resolution, horizontal resolution; Vestigial sideband
transmission, bandwidth for Colour signal, picture tube, brightness, contrast, viewing distance
luminance, hue, saturation, compatibility; Colour theory, primary colors and secondary colors, additive
Colour mixing subtractive Colour mixing; Composite Video Signal, Pedestal height, Blanking pulse,
Colour burst, Horizontal sync pulse details, Vertical sync pulse details, Equalizing pulses, CCIR B
standards for Colour signal transmission and reception.
UNIT III: TV Transmitters and Receiver - Audio and Video signal transmission; Positive and
Negative modulation; Merits and Demerits of Negative modulation; Introduction to television camera
tube (a) Vidicon; (b) Plumbicon; (c) Solid State camera based on CCD; Color Picture tube (a) PIL, (b)
Delta gun picture tube; Block diagram of monochrome TV transmitter; Block diagram of Colour TV
transmitter; Block diagram of monochrome TV Receiver.
UNIT IV: Colour TV - Block Diagram and operation of color TV receiver (PAL D type); Explain –
YagiUda Antenna; Explain block diagram of PAL-D decoder with circuit diagram of chroma signal
amplifier, Burst pulse blanking, Colour killer control, Basic Circuit for Separation of U and V signals.
AGC Amplifier.Colour signal matrixing, RGB drive amplifiers; EHT generation: circuit explanation
for line output stage using transistor or IC in Colour TV; Comparisons between NTSC, PAL and
SCAM Systems.
UNIT V: Cable Television - Working principle and specification of following components : Dish
antenna, LNBC, Multiplexer, Attenuators Connectors (two ways and three ways), Amplifier and cable;
MATV,CATV and CCTV;Design concept for cable TV network; Block diagram of dB meter with
working principle; Direct to Home System (DTH) Introduction and Block Diagram, Contemporary
Topics.

References :
1. Television & Radio Engineering (A.M. Dhake) Tata McGraw Hill.
2. Television Engg and Video System (R.G. Gupta) Tata McGraw Hill.
3. Audio Video Systems (R.G. Gupta) Tata McGraw Hill.
4. Modern TV Pratice (R.R. Gulati) New Age International.
5. Basic Radio and Television (S. Sharma) Tata McGraw Hill.
6. Colour Television Principles and Pratice (R.R. Gulati) New Age International.
7. Basic Television and Video System (Bernard Grob) Tata McGraw Hill.
8. Mono Chrome and Colour Television (R.R. Gulati0 New Age International.
9. Modern CD Player Servicing Manual (ManoharLotia) BPB Publication.
Course Outcomes:
After completion of the course, students will be able to:
C423.1. Explain and differ ate the different amplifiers, graphic equalizer and Dolby NR recording
systems (K3-apply)
C423.2. Describe the TV fundamentals like concept of aspect ratio, image continuity etc Color theory
(K2-Understand)
C423.3. Discuss about composite video signal ad CCIR B standard for color signal Transmission and
reception (K2-Understand)
C423.4. Discuss monochrome TV transmitter and receivers, Color TV transmitter and compare TV
camera tubes, Color picture tube (K5-Evaluate)
C423.5. Diagram Illustrate of color TV receivers (PAL-D) and Differentiate between NTSC PAL and
SCAM systems (K4-Analyse)
C423.6. Explain about cable Television, MATV, CATV, CCTV, Cable TV network and DTH (K2-
Understand)


3 0 0 3
(R18EEE4294) Non Conventional Energy Resources

Course Objectives
This course helps the students to understand the importance, availability, conversion technologies of
renewable energy resources and its applications
1. 1. To emphasis the current energy status and role of non-conventional and renewable energy sources.
2. To familiarize various aspects of Solar energy and utilization
3. To familiarize various aspects of Wind energy and utilization
4. To familiarize various aspects of Biomass energy and utilization
5. To emphasize the significance of Green Energy Technologies.
UNIT I: SOLAR ENERGY - Solar radiation its measurements and prediction - Solar thermal
collectors - Flat plate collectors, Concentrating collectors – Applications - Heating, Cooling,
Desalination, Drying, Cooking, etc - Principle of photovoltaic conversion of solar energy - Types of
solar cells and fabrication - Photovoltaic applications - Battery charging, Domestic lighting, Street
lighting and water pumping.
UNIT II:WIND ENERGY - Wind energy - Energy chains - Application - Historical background,
Merits and limitations - Nature of wind - Planetary and local day / night winds - Wind energy quantum
- Power in wind- Turbine efficiency - Torque Thrust calculations Velocity at different heights - Site
selection - Components of Wind Energy Conversion System (WECS).
UNIT III: BIOMASS ENERGY - Energy from Biomass - Biomass as Renewable Energy Source -
Types of Bio mass Fuels - Solid, Liquid and Gas - Biomass Conversion Techniques- Wet Process, Dry
Process-Photosynthesis - Biogas Generation - Factors affecting Biodigestion - Classification of bio gas
plant - Continuous, Batch and Fixed Dome types - Advantages and Disadvantages.
UNIT IV: TIDAL, OTEC, HYDEL AND GEOTHERMAL ENERGY - Tidal energy: Tide – Spring
tide, Neap tide – Tidal range – Tidal Power – Types of tidal power plant – Single and dual basin
schemes – Requirements in tidal power plant - Ocean Thermal Energy Conversion (OTEC): Principle -
Open and closed OTEC Cycles - Hydel Energy: Micro hydro - Geothermal Energy: Geothermal energy
sources - Power plant and environmental issues.
UNIT V:NEW ENERGY SOURCES - Hydrogen as a renewable energy source - Sources of Hydrogen
- Fuel for Vehicles - Hydrogen Production - Direct electrolysis of water, thermal decomposition of
water, biological and biochemical methods of hydrogen production - Storage of Hydrogen - Gaseous,
Cryogenic and Metal hydride - Fuel Cell – Principle of working, construction and applications,
TEXT BOOKS
1. Rai.G.D, “Non- conventional resources of energy”, Khanna publishers, Fourth edition, 2010.
2. Khan. B.H, “Non-Conventional Energy Resources”, The McGraw Hills, Second edition, 2009.

REFERENCES
1. Rao.S&Parulekar, “Energy Technology”, Khanna publishers, Fourth edition, 2005.
2. Pai.B.R and Ram Prasad.M.S, “Power Generation through Renewable Sources of Energy”, Tata
McGraw Hill, New Delhi, 1991.
3. Bansal.N.K, Kleeman and Meliss, “Renewable energy sources and conversion Techniques”,
Tata McGraw hill, 1990.
4. Godfrey Boyl “Renewable Energy: Power Sustainable Future”,Oxford University Press, Second
edition, 2006.
5. Ryan O’Hayre, Suk-Won Cha and Whitney colella, “Fuel Cell Fundamentals”, Second edition,
2009.
6. John W Twidell and Anthony D Weir, “Renewable Energy Resources”, Taylor and Francis,
2006.
7. Freris.L.L, “Wind Energy Conversion systems”, Prentice Hall, UK, 1990.


3 0 0 3
(R18INF4295) Information Security Fundamentals

COURSE OBJECTIVES:
1. To provide impeccable knowledge on various technical aspects of Information Security &
Computer Security principles
2. To provide foundation for understanding the key issues associated with protecting Computer
Systems & Information Assets.
3. To provide competency in designing consistent & reasonable Information security system with
appropriate Scanning & Enumeration mechanisms, determining the level of protection and
Response to security incidents.
UNIT I:Introduction to Information Security - Introduction to Information Security, Need for

Security - Threats to security & Attacks, Computer System Security and Access Controls - System
access and data access.
UNIT II:Communication Security - Introduction to cryptography, cryptosystems, Encryption &

Decryption Techniques - classical encryption techniques, communication channel used in
cryptographic system, various types of ciphers, Cryptanalysis, Hash function and Data integrity,
Security of Hashing function.
UNIT III: Network - Introduction to Network Security, Email Security, IP Security, Web Security,
Kerberos, X.509 techniques.
UNIT IV: Scanning & Enumeration Technology - Malicious software, Firewalls, Honey pots,
Intrusion Detection system, Intrusion Prevention system
UNIT V: Ethics In Information Security - Implementing Information Security, Legal Ethical &
Professional issues in Information Security, Contemporary Topics.
TEXT BOOKS:
1. Matt Bishop, “Computer Security: Art and Science”, Addison-Wesley Professional, First
Edition, 2003. ISBN: 0201440997.
2. William Stallings, “Cryptography and Network Security”, Pearson Education, Fourth Edition,
2006. ISBN: 8177587749
REFERENCES:
1. Michael E. Whitman, Herbert J. Mattord ,“Principles of Information Security” Cengage
Learning, Fourth Edition, 2010, ISBN: 1111138214
2. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network security: private communication in
a public world”, Second Edition, ISBN: 0130460192.
3. Dieter Gollmann ,”Computer Security “, Third Edition, ISBN: 0470741155.


3 0 0 3
(R18MED4296) Total Engineering Quality Management

COURSE OBJECTIVE: To understand the Engineering and Management aspects of Planning,
Designing, Controlling and Improving Quality in Manufactured products.
COURSE OUTCOMES:
1. To understand the fundamentals of quality
2. To understand the role of TQM tools and techniques in elimination of wastages and reduction
of defects
3. To develop quality as a passion and habit
UNIT I: Quality Gurus And TQM Kitemarks - Evolution of TQM – Quality Guru’s – Edward
Deming – Joseph Juran – Philip Crosby – Genichi Taguchi – Walter Shewart – Criteria for Deming’s
PrizeUNIT II - PRODUCT DESIGN AND ANALYSIS (9 hours) Basic Design Concepts and TQM –
Design Assurance – Design Validation – Failure Mode Effect Analysis – Fault Tree Analysis – Design
for Robustness – Value Analysis
UNIT-III: Process Improvement and Modern Production Management Tools - Six Sigma
Approach – Total Productive Maintenance – Just-In-Time – Lean Manufacturing Paradigms
UNIT IV: Quality Improvement Tools and Continuous Improvement - Q-7 Tools – New Q-7
Tools – Quality Function Deployment – Kaizen – 5S – PokaYoke
UNIT V: Quality Management Systems - Quality Management Systems – Introduction to ISO9000 –

TS16949:2002 and EMS14001 certifications, Contemporary Topics.
TEXT BOOKS
1. Total Engineering Quality Management, Sunil Sharma, 1st Edition, MacMillan India Limited.
2. Total Quality Management, Poornima M. Charantimath, 2nd Edition, Pearson Education.
REFERENCES
1. “Quality and Performance Excellence”, James R Evans, Edition, 7th Edition, Cengage
Learning.
2. “Quality Management”, Howard S Gitlow, Alan J Oppenheim, Rosa Oppenheim, David M
Levine,3rd Edition , Tata McGraw Hill Limited.
3. “Fundamentals of Quality Control & Improvement”, AmitavaMitra, 3rd Edition, Wiley
Publications, 2012.


3 0 0 3
(R18HMS4297) Human Values & Professional Ethics for Engineers

Course Objectives:
1. To know the different moral and ethical issues through various prominent theories.
2. To educate the code of ethics as well as the industrial standards and how they can be used for
ensuring safety and reducing the risk.
3. To vocalize the Rights and Responsibilities of individuals.
4. To enable the students to imbibe and internalize the Values and Ethical Behavior in the
personal and Professional lives.
Course Outcome: The students will understand the importance of Values and Ethics in their
personal lives and professional careers. The students will learn the rights and responsibilities as an
employee, team member and a global citizen.
UNIT – I Introduction to Professional Ethics: Basic Concepts, Governing Ethics, Personal &
Professional Ethics, Ethical Dilemmas, Life Skills, Emotional Intelligence, Thoughts of Ethics, Value
Education, Dimensions of Ethics, Profession and professionalism, Professional Associations,
Professional Risks, Professional Accountabilities, Professional Success, Ethics and Profession.
UNIT – II Basic Theories: Basic Ethical Principles, Moral Developments, Deontology, Utilitarianism,
Virtue Theory, Rights Theory, Casuist Theory, Moral Absolution, Moral Rationalism, Moral Pluralism,
Ethical Egoism, Feminist Consequentialism, Moral Issues, Moral Dilemmas, Moral Autonomy.
UNIT – III Professional Practices in Engineering: Professions and Norms of Professional Conduct,
Norms of Professional Conduct vs. Profession; Responsibilities, Obligations and Moral Values in
Professional Ethics, Professional codes of ethics, the limits of predictability and responsibilities of the
engineering profession. Central Responsibilities of Engineers – The Centrality of Responsibilities of
Professional Ethics; lessons from 1979 American Airlines DC-10 Crash and Kansas City Hyatt
Regency Walk away Collapse.
UNIT – IV Work Place Rights & Responsibilities, Ethics in changing domains of Research,
Engineers and Managers; Organizational Complaint Procedure, difference of Professional Judgment
within the Nuclear Regulatory Commission (NRC), the Hanford Nuclear Reservation. Ethics in
changing domains of research – The US government wide definition of research misconduct, research
misconduct distinguished from mistakes and errors, recent history of attention to research misconduct,
the emerging emphasis on understanding and fostering responsible conduct, responsible authorship,
reviewing & editing.
UNIT – V Global issues in Professional Ethics: Introduction – Current Scenario, Technology
Globalization of MNCs, International Trade, World Summits, Issues, Business Ethics and Corporate
Governance, Sustainable Development Ecosystem, Energy Concerns, Ozone Deflection, Pollution,
Ethics in Manufacturing and Marketing, Media Ethics; War Ethics; Bio Ethics, Intellectual Property
Rights, Contemporary Topics.
TEXT BOOKS:
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ethics in Engineering Practice & Research, Caroline Whitbeck, 2e, Cambridge
University Press 2015.

REFERENCES
1. Engineering Ethics, Concepts Cases: Charles E Harris Jr., Michael S Pritchard, Michael
J Rabins, 4e ,Cengage learning, 2015.
2. Business Ethics concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008.


3 0 0 3
(R18HMS4298) Science Fiction
COURSE OBJECTIVES: To help learners understand the link between Science and Technology and
Humanities, especially Fiction form in Literature, with a view to instilling in them a sensitivity to the
current issues of the world and probable issues that will crop up in the future world and imbibe in them
a fine sensibility to appreciate and handle with balance the borderline problems of interdisciplinary
nature with integrity and responsibility.
COURSE OUTCOMES:
1. To enable the learners to appreciate the literary form of Science Fiction
2. To give them a firsthand linguistic experience of the various types of Science Fiction novels
3. To equip the learners with the discretion to distinguish between a successful/effective science
fiction novel and the one not so
4. To enhance the learners’ communication skills and to develop their potential for creative writing
5. To spark off the dormant researcher in the learner so that he/she will use it for the betterment of
the world
UNIT I: Science Fiction – an Introduction - 1. What is science fiction? Characteristics. 2.
Classification 3. Types 4. A Historical Overview
UNIT II: Novels of other Worlds - 1. Utopian Science Fiction Novels Huxley, Aldous. Island.1932;
Harper Perennial Classics, 2002. 2. Dystopian Science Fiction Novels Huxley, Aldous. Brave New
World.Chatto and Windus, 1962.
UNIT III: Novels of other Beings - 1. Robots and Science Fiction Asimov, Isaac.I Robot.Granada,
1950. 2. Aliens and Science Fiction Card, Orson Scott. Ender’s Game. Starscape, 2002.
UNIT IV: Novels of Time Travel -1. Travel into future a. H. G. Well’s Time Machine. 2. Travel into
past a. Asimov, Isaac and Robert Silverberg. Child of Time.Tor, 1993.
UNIT V : Novels on Women’s Issues - 1. Man Controlling Women a. Shelley, Mary.
Frankenstein.1818; Barnes and Noble, 2009. 2. Varied Identities of Women b. RUSS, JOANNA. THE
FEMALE MAN. BEACON PRESS, 2000, Contemporary Topics
REFERENCES
1. Seed, David. “Science Fiction: A Very Short Introduction”. OUP, 2011.
2. Roberts, Adam. “Science Fiction”. 2 revised. Routledge, 2005.
3. Moylan, Tom and RaffaellaBaccolini. “Dark Horizons: Science Fiction and the Dystopian
Imagination”. Routledge, 2003.
4. Little, Judith.A. “Feminist philosophy and science fiction: utopias and dystopias”, Prometheus
Press, 2007.
5. Atwood, Margaret. “In Other Worlds”.Anchor, 2012.
6. Reid, Robin.A. “Women in Science Fiction and Fantasy”.Greenwood Press, 2009. 7. Schneider,
Susan. “Science Fiction and Philosophy: From Time Travel to Superintelligence”, Wiley
Blackwell, 2009.
7. Drout, Michael D.C. From “Here to Infinity: An Exploration of Science Fiction Literature”,. 7
CDs. Published in 2006 by Recorded Books.
8. Melzer, Patricia. “Alien Constructions: Science Fiction and Feminist Thought”, University of
Texas Press, 2006.

R18 Cse CS Syllabus

Uploaded by

Copyright:

Available Formats

R18 Cse CS Syllabus

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

R18 Cse CS Syllabus

Uploaded by

Copyright:

Available Formats

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY

(An Autonomous Institution under UGC, New Delhi)

CHOICE BASED CREDIT SYSTEM (CBCS)

B.Tech. Regular Four Year Degree Programme

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY

Vision of the Institute

Mission of the Institute

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 2

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY

VISION of the Department

MISSION of the Department

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 3

PROGRAM OUTCOMES (POs):

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 4

PROGRAM SPECIFIC OUTCOMES (PSOs):

To identify, formulate and solve the real life problems

To apply computer science knowledge in exploring and

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO2: Domain Knowledge: Graduate with an ability to design and

PEO3: Professional Career: Graduate with excellence by multidisciplinary

PEO4: Life Long Learning: Graduate with an ability to learn advanced

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 5

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY

PRELIMINARY DEFINITIONS AND NOMENCLATURES

 “Autonomous Institute / College” means an institute / college designated as

 “Academic Autonomy” means freedom to a College in all aspects of

 “Commission” means University Grants Commission (UGC), New Delhi.

 “AICTE” means All India Council for Technical Education.

 “University” means the Jawaharlal Nehru Technological University, Hyderabad.

 “College” means SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY ,

 “Program” means: Bachelor of Technology (B.Tech) degree program

 “Branch” means specialization in a program like B.Tech degree

 “Course” or “Subject” means a theory or practical subject, identified by its course

 T – Tutorial, P – Practical, D – Drawing, L - Theory, C – Credits

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 6

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 7

3.2.2 Credit courses

Courses like Environmental Science, Constitution of India, Intellectual Property Rights,

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 8

4.0 Course registration

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 9

5.0 Subjects/ courses to be offered

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 10

7.0 Academic requirements

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 11

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 12

8.0 Evaluation - Distribution and Weightage of marks

Section-B consists of 6 questions out of which 4 are to be answered

 Award of final sessional marks : Subject-wise attendance, average marks of two

8.2.5 There shall be a Comprehensive Viva-Voce in IV year I semester. The

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 14

Section-B: This Section carries 50 marks with 5 questions consisting of two

(b) Practical Courses

(c) Supplementary Examinations

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 15

% of Marks Secured in a Letter Grade Grade

Credit points (CP) = grade point (GP) x credits …. For a course

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS) Page 16