Regulation 2019 (Amendments) Common To All B.E. / B.Tech. Degree Programmes (Choice Based Credit System)

HINDUSTHAN COLLEGE OF ENGINEERING AND TECHNOLOGY
(An Autonomous Institution Affiliated to Anna University, Chennai)
(Approved by AICTE, New Delhi, Accredited by NAAC with ‘A’ Grade)
COIMBATORE 641 032
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BE CSE – CURRICULUM & SYLLABI
Regulation 2019 (Amendments)

Common to all B.E. / B.Tech. Degree Programmes
(CHOICE BASED CREDIT SYSTEM)
HICET – Department of Computer Science and Engineering
INDEX
S. No. Description Page Number
1 Vision and Mission of the Department 3
2 Salient Features of Curriculum and Syllabi 4
3 PO’s and PEO’s 5
4 Regulation 8
5 Curriculum and Syllabi 31
Page | 2
Hindusthan College of Engineering and Technology

Approved by AICTE, New Delhi and Accredited with ‘A’ Grade by NAAC
(An Autonomous Institution, Affiliated to Anna University, Chennai)
Othakalmandapam Post, Coimbatore
REGULATION- 2019
(Amendments)
B. E COMPUTER SCIENCE AND ENGINEERING
Vision of the Department

To provide an excellence for individuals to develop technologically superior
socially conscious and nationally responsible citizens
Mission of the Department

 To develop competent Computer Science and Engineering professionals with
knowledge in current technology.
 To mould them to attain excellent leadership qualities there by making them
excel in their careers.
 To inspire and nurture students to come out with innovation and creativity
solutions meeting the societal needs.
Page | 3

Salient Features – R2019 Curriculum and Syllabi

 Semester II: Programming in C and C++ - Students will study C and C++ both the languages: one
unit in C and four units in C++.
 Semester III: Data structures: Advanced C concepts are included as first unit in this course.
 Semester IV: Data mining is introduced as core paper but earlier it was in Elective subject.
Probability, Statistics and Queuing theory – Laboratory component is included with R programming.
 Semester V: Software Engineering and Object Oriented Analysis Design are combined together as a
single course as Software Analysis and Design with Laboratory component. Motivation to students
with immense expertise, massive technical exposure & structured creative initiatives, Engineering
Clinic is introduced where the students can do mini- project based on any of the subjects in fifth
semester.
 Semester VI: Principles of Management is introduced as a management paper. Artificial Intelligence
is introduced as a core paper and earlier it was in elective. Students have to undergo Internship /
Inplant training to various renowned companies to pave way for them to get exposed to varied
atmosphere and to impart practical knowledge.
 Semester VII: Machine Learning Techniques is introduced with Laboratory component as a new
subject. Project Phase I is introduced with 2 credits.
 The department maintains partnerships and collaborations with leading industries to bridge the gap
between Industry and Academia. Internet and Web technology, and Business Intelligence – Data
warehousing and Analytics are introduced as Industry Recommended electives (Infosys).
 The curriculum is carefully designed to give the students a solid base by urging them to delve into
subjects like Knowledge Engineering, Wireless sensor networks, Multicore Architecture and
Programming, Digital Image Processing, Information Securtiy, Cyber Forensics, Responsive Web
Design, Information Retrieval Techniques, User Interface Design, Deep Learning, Block Chain
Technology as new elective papers.
 Mandatory courses and Language Competency courses are included in the curriculum for students to
improve personality development and communication.
Page | 4

Program Outcomes (PO’s)

Engineering Graduates will be able to:
ENGINEERING KNOWLEDGE: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.
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.
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.
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.
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.
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.
ETHICS: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
Page | 5
INDIVIDUAL AND TEAM WORK: Function effectively as an individual, and as a

member or leader in diverse teams, and in multidisciplinary settings.
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.
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.
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.
Page | 6

PROGRAM EDUCATIONAL OBJECTIVES (PEO’s)
PEO1: To acquire knowledge in the latest technologies and innovations and an ability to
identify, analyze and solve problems in computer engineering.
PEO2: To be capable of modeling, designing, implementing and verifying a computing system

to meet specified requirements for the benefit of society.
PEO3: To possess critical thinking, communication skills, teamwork, leadership skills and
ethical behavior necessary to function productively and professionally.
Page | 7
Regulation
2019
(Amendments)
Page | 8
HINDUSTHAN COLLEGE OF ENGINEERING AND TECHNOLOGY
(An Autonomous Institution Affiliated to Anna University)
Coimbatore, Tamil Nadu, India
REGULATIONS 2019 (with Amendments)
B.E. / B.Tech. DEGREE PROGRAMMES
(CHOICE BASED CREDIT SYSTEM)
The regulations here under are effective from the academic year 2019- 2020 and applicable
to Students admitted in Hindusthan College of Engineering and Technology, an
Autonomous Institution Affiliated to Anna University, Chennai. The regulations are subject
to amendments as may be made by the Academic Council of the Institution from time to
time. Any or all such amendments will be effective from such date to such batches of
students (including those already in the middle of the programme) as may be decided by the
Academic Council.
1. PRELIMINARY DEFINITIONS AND NOMENCLATURE

In this Regulation, unless the context otherwise specifies
i. “Programme” means Degree Programme, i.e. B.E. / B.Tech. Degree Programme.

ii. Choice Based Credit System : The Choice Based Credit System provides a
“cafeteria” type approach in which the students can take courses of their choice,
learn at their own pace, undergo additional courses and acquire more than the
required credits, and adopt an Interdisciplinary approach to learning.
iii. “Discipline / Branch” means Specialization or Discipline of B.E. / B.Tech.
Programme like Civil Engineering, Mechanical Engineering, Electrical
Engineering, etc.
iv. “Course” means a Theory or Practical subject like Mathematics, Physics,
Engineering Graphics, etc. that is normally studied in a semester.
v. “Head of the Institution” and “Chairman- Academic Council” mean the
Principal of the College.
vi. “Head of the Department”- HoD means Head of the Department concerned.
vii. “Controller of Examinations”- CoE means the authority who is responsible for all
activities of the End Semester Examination.
viii. “University” means Affiliated University i.e., ANNA UNIVERSITY, CHENNAI.
ix. “CIA” means Continuous Internal Assessment
x. “ESE” means End Semester Examinations
Page | 9
2. ADMISSION PROCEDURE
2.1 Students for admission to the First Semester of the Eight Semester B.E. / B.Tech. Degree
Programme shall be required to have a pass in Higher Secondary Examination (Academic 10 +
2) Curriculum or its Equivalent Examinations with Mathematics, Physics and Chemistry.
2.2 Lateral Entry Admission (As per AICTE clause 1.3 (viii) of Academic Year 20-21:
➢
Passed Diploma examination with at least 45% marks(40% marks in case of candidates belonging to
reserved category) in ANY branch of Engineering and Technology.
➢
Passed B.Sc., Degree from a recognized University as defined by UGC, with at least 45%
marks(40% marks in case of candidates belonging to reserved category) and passed 10 + 2
examination with Mathematics as a subject.
➢
Provided that the students belonging to B.Sc., Stream, shall clear the subjects Engineering
Graphics / Engineering Drawing and Engineering Mechanics of the First Year Engineering
Programme along with the Second Year subjects.
➢
Provided that the Students belonging to B.Sc., Stream shall be considered only after filling the
supernumerary seats in this category with students belonging to the Diploma stream.
➢
Passed D.Voc in the same or allied sector.
➢
In the above cases, suitable bridge courses, if required such as in Mathematics or basic Engineering
Foundation courses may be suitable designed and implemented.
3. MEDIUM OF INSTRUCTION
The medium of Instruction is English for all Courses, Examinations, Seminar Presentations and
Project / Thesis / Dissertation Reports.
4. BRANCHES OF STUDY
Regular students shall be admitted to one of the following Branches of study at the beginning of
the First Year and the Lateral Entry students are admitted at the beginning of the Second year
(Third Semester). The Programme shall provide a Degree of Bachelor of Engineering / Bachelor
of Technology of Anna University, Chennai. The allotment of Branch to a student is final and
the students are not permitted to change the Branch of study.
Branches of Study
B.E. Programmes
i. Aeronautical Engineering
ii. Agricultural Engineering
iii. Automobile Engineering
iv. Biomedical Engineering
v. Civil Engineering
vi. Computer Science and Engineering
vii. Electrical and Electronics Engineering
viii. Electronics and Communication Engineering
ix. Electronics and Instrumentation Engineering
x. Mechanical Engineering
xi. Mechatronics Engineering
Page | 10
B. Tech. Programmes
i. Information Technology.
ii. Food Technology.
iii. Chemical Engineering .
iv. Artificial Intelligence and Machine Learning.
5. STRUCTURE OF THE PROGRAMMES

Every B.E./B.Tech. Programme will have a Curriculum with a Syllabi consisting of Theory
courses, Practical courses, Theory courses with Practical Component and Employability
Enhancement Courses prescribed by the respective Board of Studies from time to time.
5.1 Categorization of Courses
• Humanities and Social Sciences including Management Courses(HMSC) include
Technical English, Engineering Ethics and Human Values, Environmental Science and
Engineering, Communication skills and Management Courses.
• Basic Sciences (BS) courses include Mathematics, Physics, Chemistry, Biology, etc.
• Engineering Sciences (ES) courses include Engineering Practices, Engineering Graphics,
Basics of Electrical / Electronics / Mechanical / Computer Engineering, Instrumentation
etc.
• Professional Core (PC) courses include the core courses relevant to the chosen
Specialization / Branch.
• Industry Core (IC) may include core courses relevant to the industry standards.
• Professional Elective (PE) courses include the elective courses relevant to the chosen
specialization/ branch.
• Open Elective (OE) courses include the courses from other Branches which a Student can
choose from the list specified in the curriculum of B.E. / B. Tech. / B. Arch. Programmes.
• Mandatory Course (MC): Includes the courses like (i) Constitution of India and
(ii) Essence of Indian Traditional Knowledge which are non-credit courses.
• Employability Enhancement Courses (EEC) includes Project Work, Internship, Career
Development Skills, Creative and Innovative Project, Seminar, Professional Practices,
Case Study and Industrial/Practical Training.
• Audit Courses(AC) expose the students to Unnat Bharathi Abhiyan, Constitution of
India, Essence of Indian Knowledge Traditional, Yoga, English for Research Paper
Writing, Value Education, Pedagogy Studies, Stress Management and Personality
Development through Life Enlightenment Skills. Registration to Minimum of one course
is mandatory to Students in Semester I to IV.
5.2 Personality and Character Development

• All students shall enroll, on admission, in any one of the Personality and Character
Development Programmes (NCC/NSS/YRC.etc) and undergo training for about 80 hours
and attend a camp of about seven days. The training shall include classes on Hygiene and
Health Awareness and also training in First-Aid.
Page | 11
• National Cadet Corps (NCC) will have about 20 parades .

• National Service Scheme (NSS) will have social service activities in and around the
College /Institution.
• National Sports Organization (NSO) will have sports, Games, Drills and Physical
Exercises.
• Youth Red Cross (YRC) will have activities related to social services in and around
College / Institutions.
While the training activities will normally be during weekends, the camp will normally
be during vacation period.
5.3 Mandatory Two Week Induction Programme

The Students are expected to undergo a mandatory two week induction programme comprising
of physical activity, creative arts, universal human values, proficiency modules, lectures by
eminent people, visits to local areas and familiarization to Department / Branch & Innovations
immediately after admission.
5.4 Number of courses per semester

Each semester curriculum shall normally have a blend of Theory Courses, Theory courses with
Lab Component not exceeding 6 and Laboratory courses and Employability Enhancement
Course(s) not exceeding 4 or 3. Each Employability Enhancement Course may have credits
assigned as per clause 7.1. However the total number of courses per semester shall not
exceed 10 including Fast Track course.
5.5 Industrial Training / Internship

5.5.1 The students may undergo Industrial training for a period as specified in the Curriculum
during Summer/Winter vacation. In this case, a student may undergo Industrial Training /
Internship for a minimum period of three weeks from Third semester to Fifth semester during
vacation.
5.5.2 The students may undergo Internship at Research organization/Department approved
Industries / Premier Institutions for the period prescribed in the curriculum during
Summer/Winter vacation.
5.6 Industrial Visit

Every student is required to go for at least one Industrial Visit every year starting from the
second year of the Programme. The Heads of Departments shall ensure that necessary
arrangements are made in this regard.
5.7 Value Added Courses

➢ The Students may optionally undergo Value Added Courses and the credits earned through
the Value Added Courses shall be over and above the total credit requirement prescribed in
the curriculum for the award of the degree. One / Two credit courses shall be offered by a
Department with the prior approval from the Head of the Institution / COE.
Page | 12
➢ The details of the Syllabus, Time Table and Faculty may be sent to the Controller of
Examinations after approval from the Head of the Institution at least one month before the
course is offered. Students can take a maximum of two „one credit courses‟ / one „two
credit course‟ during the entire duration of the Programme.
5.8 Online Courses

➢ Students may be permitted to take only one Online Course from
NPTEL/Edx/Coursera/MOOC etc., of 3 credits with the approval of Head of the Institution.
The students can study the online courses between 3rd semester and 7th semester. The list of
online courses will be provided by the respective Departments and approved by the Head of
the Institution from time to time.
➢ The details regarding online courses taken up by students shall be sent to the Controller of
Examinations (Autonomous) well in advance for the award of additional credit. At the end of
Seventh semester the evaluation will be done. The student needs to submit the certificate and
attend Viva voce Examinations to be conducted by a Evaluation Committee.
5.9 Fast Track Learning System:

In order to facilitate VIII semester students to take up the Industry based Projects / Training /
Internships the Fast Track Learning system is introduced. The student shall undergo the
Eighth Semester courses in the fifth, sixth and seventh semesters for fast track learning.
They should satisfy the following conditions.

➢ The student should not have History of Arrears and shall have CGPA of 8.00 and above.
➢ The students shall be permitted to carry out their final semester Project work for the entire
semester in Industry/Research organizations or in College itself.
➢ The Head of Department, in consultation with the faculty handling the said courses shall
forward the proposal recommended by the Head of Institution to the Controller of
Examinations for approval at least 4weeks before the commencement of the fifth / sixth /
seventh semester of the programme.
5.10 Credit Transfer Courses

a.) Students may be permitted to take upto 10% online courses (only theory) in V to VII
semester with prior approval of Departmental Consultative Committee, Dean Academics
and Office of the Controller of Examinations.
b.) The Students are permitted to undergo ONE Professional Elective Course in
NPTEL/SWAYAM/MOOCs etc. during VI Semester with the prior approval of
Departmental Consultative Committee, Dean Academics and Office of the Controller of
examinations. The student shall take up Assessments and End Semester Examinations
conducted by NPTEL/SWAYAM/ MOOCs and transfer the grades and credits.
Page | 13
c.) The students are permitted to undergo the One Open Elective course in
NPTEL/SWAYAM/ MOOCs etc. during VII with the prior approval of Departmental
Consultative Committee, Dean Academics and Office of the Controller of examinations.
The Student shall take up Assessments and End Semester Examinations conducted by
NPTEL/SWAYAM/ MOOCs and transfer the credits.
6. DURATION OF THE PROGRAMME
6.1 A student is ordinarily expected to complete the B.E. / B.Tech. Programme in 8
semesters (four academic years) but in any case not more than 14 Semesters (7 years) for
HSC (or equivalent) candidates and not more than 12 semesters(6 years) for Lateral Entry
Candidates. Each semester shall normally consist of 80 working days or 560 periods of 50
minutes each.
6.2 The Head of the Department shall ensure that every teacher imparts instruction as per the
number of periods specified in the syllabus, covering the full content of the specified syllabus
for the course being taught.
6.3 The Head of the Department may conduct additional classes for improvement, special
coaching, conduct of model test etc., over and above the specified periods. But for the
purpose of calculation of attendance requirement for writing the End Semester Examinations
by the students, the following method shall be used.
Total Number of Periods attended in all the courses per

Percentage of = Semester X 100
Attendance
(Number of Periods as prescribed in all the courses per week ) X 15
6.4 The total period for completion of the programme reckoned from the commencement of
the first semester to which the candidate was admitted shall not exceed the maximum
period specified in clause 6.1 irrespective of the period of break of study (vide clause 20.0)
in order that he/she may be eligible for the award of the degree.
7. CREDIT ASSIGNMENT
Each course is assigned certain number of credits based on the following:
Contact period per week Credit

1 Lecture Period 1
1 Tutorial Period 1
(As per AICTE Norms)
3 Practical Periods 1.5
2 Project Work Periods 1
2 Seminar Periods 1
Page | 14
7.1 CREDIT DISTRIBUTION FOR THE CATEGORY OF COURSES:

Total Number
S. No. Classification
of Credits
1 Humanities and Social Sciences 11
2 Basic Sciences 28
3 Engineering Sciences 14
4 Professional core 76
5 Professional Electives 15
6 Open Electives 6
7 Employability Enhancement Courses
Project Phase I – 2 Credits 15
Project Phase II – 12 Credits
Internship/Industrial Training – 1 Credit
8 Audit /Mandatory courses :Induction Training, Indian Additional
Constitution, Essence of Indian Traditional Knowledge credits /
Non-credit
Total 165
7.2 TOTAL CREDITS TO BE EARNED FOR THE AWARD OF DEGREE

For the award of degree, a student admitted in a regular stream has to earn a certain minimum
number of credits specified in the curriculum of the respective branch of study. The minimum
number of credits to be earned for the award of degree is 165. For Lateral entry students, the
minimum number of credits shall not be less than 123.
7.3 Additional Credits:

A Student can earn a maximum 15 extra credits over and above the total credits. This may be
earned through 1 credit courses such as Value added / Online / EEC Courses.
8. COURSE ENROLLMENT AND REGISTRATION FOR ESE.

8.1 The Institution is responsible for registering the courses that each student is proposing to
undergo in the ensuing semester. Each student has to register for all courses to be
undergone in the curriculum of a particular semester.
8.2 The students can also register for the courses which the student has failed in the earlier
semesters. The registration details of the candidates may be approved by the Head of the
Institution and forwarded to the Controller of Examinations. This registration is
mandatory for undergoing the course as well as for the writing of End Semester
Examinations.
8.3 No Elective course shall be offered by any department unless a minimum of 35 students
registered for the course. However, if the students admitted in the associated Branch and
Semester is less than 35, this minimum will not be applicable.
Page | 15
9. FACULTY ADVISOR
To help students in planning their courses of study, the Head of the Department / Senior Faculty
Advisor will allot a certain number of students to a teacher of the Department who shall function
as Faculty Advisor for those students throughout their period of study. The faculty advisor will
supervise the student during Enrollment, Registration of Courses and authorize the final
registration of the courses at the beginning of each semester and monitor their attendance and
counsel them periodically. If necessary, the Faculty Advisor may also inform the parents about
the progress / performance of the students.
10. CLASS COMMITTEE

Every class shall have a class committee consisting of faculty members of the class
concerned, six student representatives (includes girls and students of various categories such as
above average, average, slow learner etc) and a chairperson who is not teaching the course for
the class. The class committee for a class is constituted by the Head of the Department within the
first week of each semester. However, the first semester is generally common to all branches; the
class committee will be constituted by the HoD (S&H) / Principal. The overall goal of the class
committee is to improve the teaching-learning process.
The functions of the class committee include:

➢ Clarifying the Regulations of the Degree Programme and the details of rules therein.
Resolving difficulties experienced by students in the classroom and in the laboratories.
Informing the student representatives the academic schedule including the dates of
assessments (Tests & Assignments) and the syllabus coverage for each assessment.
➢ Evaluating the performance of the students of the class after each test and finding the ways
and means of improvement.
➢ Identifying the slow learners, if any, and requesting the faculty handling the course to provide
some additional help or guidance or coaching to such slow learners.
➢ The Principal may participate in any class committee meeting of the institution as and when
required.
➢ The Chair person is required to prepare the minutes of the meeting, signed by the members
and submit the same to HOD within two working days of the meeting. HOD will in turn
forward the same to the Principal.
➢ If there are some points in the minutes requiring action by the Management, the same shall be
brought to the notice of the Management by the Principal.
➢ The first meeting of the Class committee shall be held within two weeks from the date of
commencement of the semester, in order to inform the students about the nature and allocation
of marks for CIA within the framework of the regulations.
➢ The second meeting a week after the first test results.
➢ The class committee shall meet atleast three times in a semester.
➢ The third meeting before the last internal test of the semester.
Page | 16
Student representatives of the class committee should collect information regarding the teaching
learning process of the class from the fellow students of the class before attending the class
committee meeting. Also, during these meetings they shall meaningfully interact and express the
opinions and suggestions of the other students of the class to improve the effectiveness of the
Teaching-Learning process and also communicate the points discussed in the meeting to their
fellow students
11. COURSE COMMITTEE FOR COMMON COURSES

Each common theory course offered to more than one Discipline / Class, shall have a “Course
Committee” comprising all the faculty teaching the common course with one of them nominated
as Course Coordinator. The nomination of the course Coordinator shall be made by the Head of
the Department. The “Course committee” shall meet in order to arrive at a common scheme of
teaching, portion coverage and evaluation for the test. Wherever feasible, the course committee
may also prepare a common question paper for the internal assessment test(s).
12. OVERALL MONITORING COMMITTEE

In addition, there shall be an overall monitoring committee for each semester of a programme,
which comprises of
(i) the Head of the department (convener),
(ii) the Faculty Advisors of the programme and
(iii) Multiple Course Coordinator.
This overall monitoring committee shall meet periodically to discuss academic related matters,
progress and status of the students of the semester concerned. The overall monitoring committee
can also invite some of the students of the semester concerned for any of the committee meetings
if necessary.
13. ATTENDANCE REQUIREMENTS FOR COMPLETION OF THE SEMESTER

A student who has fulfilled the following conditions shall be deemed to have satisfied the
requirements for completion of a semester.
i. A student shall be permitted to take the ESE of any course, if

a. the student secures not less than 75% of attendance in the course during the semester and
b. the conduct and character of the student have been satisfactory.
ii. A student who has secured attendance between 74% and 65% (both included) due to
medical reasons (Hospitalization / Accident / Specific Illness) or due to participation in
University / District / State / National / International Level Sports or due to participation in
Seminar / Conference / Workshop / Training Programme / Voluntary Service / Extension
Activities or similar programmes with a prior permission obtained from the Principal/Vice
Principal shall be permitted to appear for the examination on the recommendation of the
Page | 17
concerned. It is mandatory for the HoD to verify and certify the genuineness of the case
before recommending the same to the Principal.
iii. All other students who have secured attendance between 65 % and 74% (both included)
upto maximum of three courses shall apply for condonation in the prescribed format with
prescribed fee as prescribed by Institution. A student can avail the condonation facility for
a maximum of two times during the course period.
iv. A student who secures less than 65% of overall attendance of any semester will not
be permitted to write any of the current semester courses and also will not be
permitted to continue the study in the subsequent semester. But the Student will be
permitted to appear for his / her arrear examinations, if any. The student has to redo
all the courses of that semester by rejoining the same semester in the subsequent
academic year with the recommendation of the Principal and approval of Anna
University/DOTE.
v. A student shall normally be permitted to appear for the ESE of any semester commencing
from I semester if he / she has satisfied the requirements and has registered for ESE
examination in all courses of the semester.
vi. Registration is mandatory for semester examinations as well as arrears

examinations failing which the student will not be permitted to move to the higher
semester.
vii. Every teacher is required to maintain an “ATTENDANCE AND ASSESSMENT

RECORD” for every semester, which consists of attendance marked in each theory or
Laboratory / EEC class, the assessment marks and the record of class work (topic covered),
separately for each course handled by the teacher. This should be submitted to the Head of
the Department periodically (at least three times in a semester) for checking the syllabus
coverage and the records of assessment marks and attendance. The Head of the
Department will affix his/her signature and date after due verification.
viii. The Dean-Academic and his team shall check the syllabus covered, attendance of the
students and with his comments the log books are sent to the HOD of the concerned
department. At the end of the semester, the record should be verified by an Audit team
headed by Dean-Academics and return to Head of the Department who shall keep this
document in safe custody (for four years). The records of attendance and assessment of
both current and previous semesters should be available for any inspection at any time.
Page | 18
14. WEIGHTAGE OF ASSESSMENT COMPONENTS OF A

COURSE Performance in each course of study shall be evaluated based on
a. Continuous Internal Assessments (CIA) throughout the semester and
b. End Semester Examination (ESE) at the end of the semester.
S. No Category of courses CIA ESE
1. Theory Courses(FC,PC,IC & PE) 25 75
2. Laboratory Courses 50 50
3. Theory Course with Laboratory component 50 50
4. Mini Project 50 50
Industrial Training/ Internship / Technical 0 100
5.
Seminar / Survey Camp
6. Project Work 100 100
15. CONTINUOUS INTERNAL ASSESSMENT: The performance of students in each course

will be continuously assessed in the following components by the respective faculty as per the
guidelines given below:
DISTRIBUTION OF MARKS
(i) Distribution of Marks for Attendance
S. No. Attendance % Marks

1 91 and above 5.0
2 86–90 4.0
3 81–85 3.0
4 75–80 2.0
(ii) Theory Course:

S. No. Category Maximum Marks
1. Assignment/Technical quiz/Presentation 5
2. Attendance 5
3. Internal tests (The TWO internal test marks are averaged to TEN marks 15
and FIVE marks for mid semester examination)
Total 25
(iii) Practical Course/Engineering Clinic

S. No. Category Maximum marks
1. Average marks of each experiment based on Rubrics 25

2. Model Exam 25
Total 50
Page | 19
iv) Theory with Lab Component Course
S. No. Category Maximum
Marks
1. Average of TWO Internal tests mark conducted each for 50marks
10
reduced to 10marks
2. The sum of Mid semester marks reduced to 5marks 5
3. All Experiment marks should be converted to 5 marks . Then the
End Semester Exam will be conducted for 50 marks and converted 25
to 20 marks (20+5=25 marks).
4. Attendance 5
5. Assignment 5
Total 50
16. OTHER EMPLOYABILITY ENHANCEMENT COURSES
16.1 Industrial Training / Internship:

A student may undergo Industrial Training / Internship for a minimum period of three weeks
from third semester to fifth semester during Summer/Winter Vacation. On completion of the
training, the student has to submit a report on the Training / Internship undergone and a
certificate from the organization concerned. At the end of Sixth semester, a three member
Departmental Committee constituted by Controller of Examinations will evaluate the report,
conduct Viva Voce Examination and award credit points. Non submission of the Industrial
Training report shall be considered as reappearance. Credits will be distributed as under:
Duration Credit
From Third Semester to Fifth Semester Three
Weeks Internship / Training 1
16.2 The Project work :
• CIA and ESE marks are 100 and 100 respectively. The End Semester Examination for
Project work shall consist of evaluation of the final report submitted by the Student or
Students of the project group (of not exceeding 4 students) by an External Examiner and
an Internal Examiner, followed by a Viva-Voce examination conducted separately for
each student by a committee consisting of the External Examiner, the Supervisor of the
Project Group and an Internal Examiner.
• For the End semester examination in both Theory and Practical courses including
Project work the Internal and External examiners shall be appointed by the Controller
of Examinations.
Page | 20
17. QUESTION PAPER PATTERN FOR INTERNAL & MID SEMESTER EXAM
(i) ALL UG Papers except

Engineering Graphics, Engineering Drawing &Machine Drawing
Internal test Midterm test
Maximum Marks : 50 Maximum Marks : 100
Part A : 6 x 2 = 12 marks Part A : 10 x 2 = 20 marks
Part B: 2x14= 28 marks (Either or Pattern) Part B : 5 x 14 = 70 marks (Either or Pattern)
Part C: 1 x 10 = 10 marks (Either or Pattern) Part C : 1 x 10 = 10 marks (Either or Pattern)
(ii) For Engineering Mathematics

Part A : 5 x 2 = 10 marks Part A : 10 x 2 = 20 marks
Part B : 2 x16= 32 marks (Either or Pattern) Part B : 5 x 16 = 80 marks (Either or Pattern)
1 x 8 = 8 marks (Either or Pattern)
(iii) For Engineering Graphics/Engineering Drawing

2 x 20 =40 marks (Either or Pattern) 5 x 20 = 100 marks (Either or Pattern)
1 x 10 =10 Marks (Either or Pattern)
(iv) For Machine Drawing
Internal Test Mid Term Test

2x 10 =20 marks (Either or Pattern) 2x 20 =40 marks (Either or Pattern)
1x 30 =30 marks (Either or Pattern) 1x 60 =60 marks (Either or Pattern)
18. DECLARATION OF THE MARKS OF CIA:

At the end of the semester, course Faculty shall tabulate marks allotted to students for CIA,
display it on notice board with the signature of the concerned HoD for students reference and
rectify grievances if any, and then the CIA mark is to be finalized. Course coordinator/ faculty
shall enter CIA marks in the Examination Management System (EMS) and display it on notice
board and hand over the copy of the same to the Department coordinator/HoD. He/she shall
collect the marks for all Courses in all Semesters, compile them semester wise, and hand over
the copy of the same to CoE.
Page | 21
19. ASSESSMENT OF ESE AND PASSING REQUIREMENTS
The courses offered fall under the following categories:
a). Theory course
b). Laboratory course
c). Theory courses with Laboratory
component d). Mini Project
e). Project Phase I & II
a) Theory Course: ESE will be held at the end of each semester for each course. The question
paper is set for a maximum of 100 marks. A student who secures not less than 50% of total
marks prescribed for the course (CIA + ESE) with a minimum of 45% of the marks prescribed
for the ESE shall be declared to have passed in the examination.
If a student fails to secure a pass in a particular course, it is mandatory that he/she shall register
and reappear for the examination in that course when examination is conducted by the CoE.
He/she should continue to register and reappear for the examination till he/she secures a “pass”.
If a student fails to secure a pass in theory courses in the current semester examination, He/she is
allowed to write arrear examinations for the next three consecutive semesters and their internal
marks shall be carried over for the above mentioned period of three consecutive semesters. If a
student fails to secure a pass in a course even after three consecutive arrear attempts, the student
has to forgo with the marks earned during his/her CIA.
Note: The CIA marks obtained by a student in the first appearance shall be retained only
for three successive appearances. After that, a student has to secure 50% marks in the ESE
so as to declare him/her “pass” in the course concerned. This is applicable for the students
who complete the programme with arrears (after eighth semester)
(i). Question Paper pattern for ESE (Except Engineering Graphics & Mathematics)
Maximum Marks : 100

Part A : 10 x 2 = 20 Marks
Part B : 5 x 14 = 70 Marks (Either or Pattern)
Part C: 1 x 10 = 10 Marks (Either or Pattern with no sub division)
(Application/Design/Analysis/Evaluation/Creativity/Case Study)
(ii) Question Paper pattern for Engineering Graphics/Engineering Drawing
Maximum Marks : 100

5x 20 = 100 Marks (Either or Pattern)
Page | 22
(iii) Question Paper pattern for Mathematics

Maximum Marks : 100
Part A : 10 x 2 = 20 Marks
Part B : 5 x 16 = 80 Marks (Either or Pattern)
(iv) Question Paper pattern for Machine Drawing

Maximum Marks : 100

b). Laboratory Course/Engineering Clinic:

The maximum marks for each laboratory / workshop practice course is 100. The performance of
the student shall be continuously assessed throughout the semester for 50 marks based on Rubrics
and the remaining 50 marks for the ESE. The ESE is conducted for 100 marks and reduced to 50
marks. A student who secures not less than 50% of total marks prescribed for the course (CIA +
ESE) with a minimum of 50% of the marks prescribed for the ESE shall be declared to have
passed in the examination.
Mark distribution for End Semester Practical examination

Component Experiment Preparation Process of the Result / Viva Total
/ Program Structure Experiment / Program Output Voce
Coding & Execution
Marks 20 50 15 15 100
c) Theory course with Laboratory component:

There is no ESE for laboratory component and shall be conducted in Internal Mode. In the ESE
for theory component, a question paper is set for a maximum 100 marks. A student who secures
not less than 50% of total marks prescribed for the course (CIA + ESE) with a minimum of 45%
of the marks prescribed for the ESE of theory component shall be declared to have passed in the
examination.
d). Mini Project:

The Mini Project work shall be carried out in the V / VI semester of B.E / B.Tech. Programme
and the evaluation will be done through Presentation and Viva - Voce examination.
i. CIA - 50 marks
ii.ESE - 50 marks
In CIA, three reviews are conducted by the concerned Project Supervisor and the marks are
awarded by the Supervisor based on the performance.
Review I Review II Review III Total
(out of 10Marks) ( out of 20 Marks) ( out of 20 Marks) 50 Marks
Page | 23
In ESE, the Report Evaluation and Viva - Voce examination will be conducted by a committee
constituted by COE. The committee comprises of three faculty members - External Examiner,
Supervisor & Internal examiner, but the assessment will be done by External and Internal
Examiners.
ESE (50 Marks)

Report Evaluation (30 Marks) Viva – Voce (20 Marks)
e). Project Phase I & II:

➢ The B.E. / B.Tech. Project work shall be carried out in the VII and VIII semester. Report
evaluation and the viva - voce examination will be conducted at the respective ESE. Project
work may be assigned to a single student or group of students not exceeding 4 in a group.
i) CIA - 100 marks
ii) ESE – Presentation / Report and Viva - Voce Examination- 100 marks
➢ There shall be three internal reviews during the semester by a review committee. The student /
students of the group shall make presentation on the progress made before the committee.
➢ The review committee is constituted by the concerned Head of the Department. There shall be
a minimum of three members in the review committee including the project Supervisor. The
student(s) will have to submit the project report on or before the date specified by the
concerned HOD.
➢ The ESE for project work shall consist of evaluation of the final project report submitted by
the student/students of the project group by an external examiner followed by a viva- voce
examination conducted separately for each student by a committee consisting of the External
examiner and an Internal examiner. The Principal / CoE of the college will appoint the
External Examiners.
➢ If the project report is not submitted in time then the student(s) is deemed to have failed in the
Project Work. The failed student(s) shall register for the same in the subsequent semester and
repeat the project work.
➢ A student failing in project work and viva - voce examination for want of marks or due to
absence shall register and appear as a supplementary student in the subsequent ESE.
➢ CIA and ESE marks for Project Work and the Viva-Voce Examination will be distributed as
indicated below.
Page | 24
CIA - 100 Marks

Review I ( 20 Marks) Review II ( 40 Marks) Review III ( 40 Marks)
Review Supervisor Review Supervisor Review Supervisor
Committee Committee Committee
(Excluding (Excluding (Excluding
Supervisor) Supervisor) Supervisor)
10 10 20 20 20 20
ESE – 100 Marks FOR ALL B.E. AND B.Tech. PROGRAMMES

Report Evaluation (50 Marks) Viva – Voce (50 Marks)
External Examiner External Examiner Internal Examiner
50 25 25
Note: In all above cases, the total marks obtained (CIA+ESE) shall be converted
into corresponding grade point.
20. PROVISION FOR WITHDRAWAL FROM END SEMESTER EXAMINATION
A student may, for valid reasons, (medically unfit / unexpected family situations /sports approved
by Physical Director and HOD) be granted permission to withdraw from appearing for the end
semester examination in any course or courses in ANY ONE of the semester examinations during
the entire duration of the degree programme. The application shall be sent to Controller of
examinations with the recommendations of HOD and approval of the Principal along with
necessary documents.
Withdrawal application is valid if the student secures more than 75% of attendance in that
particular semester. A student can withdraw within TEN days prior to the commencement of the
examination in that course or courses. Notwithstanding the requirement of mandatory 10 days
notice, applications for withdrawal for special cases under extraordinary conditions will be
considered on the merit of the case.
In case of withdrawal from a course / courses the course will figure both in Marks Sheet as well as
in Result Sheet. Withdrawal essentially requires the student to register for the
course/courses. The student has to register for the course, fulfill the attendance requirements earn
continuous assessment marks and attend the end semester examination. However, withdrawal
shall not be construed as an appearance for the eligibility of a candidate for First Class with
Distinction.
Page | 25
21. PROVISION FOR AUTHORIZED BREAK OF STUDY
1. A student is permitted to go on temporary break of study for a maximum period of one year,
once in the entire duration of the programme. However, if a student intends to temporarily
discontinue the programme in the middle for valid reasons (such as accident or
hospitalization due to prolonged ill-health) and wishes to rejoin the programme in a later
semester he / she shall apply to the Head of the Institution in advance as per the procedures
and norms prescribed by the college authority.
2. The student when permitted to rejoin the programme after the break shall be governed by the
rules and regulations in force at the time of rejoining.
3. The duration specified for passing all the subjects for the purpose of classification shall be
extended if such break of study is approved by competent authorities.
4. The total period for completion of the programme reckoned from the commencement of the
first semester to which the student was admitted shall not exceed the maximum period
specified irrespective of the period of break of study in order that he / she may be eligible for
the award of degree.
5. If any student is detained for want of required attendance, progress or conduct, the period
spent in that semester shall not be considered as permitted “Break of Study” is not applicable
for this case.
22. FOR STUDENTS REJOINING THE PROGRAMME

A student who is required to repeat the study of any semester for want of attendance /
progress / conduct or who desires to rejoin the course after a period of discontinuance, may
join the semester which he/she is eligible or permitted to join, only at the time of its normal
commencement for a regular batch of students and after obtaining the approval from
Directorate of Technical Education (DoTE) and Anna University, Chennai. In that case
he/she has to come under the regulation which is being followed in that Academic year.
23. FOR TRANSFER STUDENTS

Students transferred from other Institutions may be admitted on obtaining the approval from
DoTE and Anna University, Chennai. In that case he/she has to come under the regulation
which is being followed in that Academic year and also should obtain equivalence from the
Controller of Examinations.
24. PROVISION OF SCRIBE:

i) The Appointment of scribes for the students with disabilities shall be done by the
Controller Office. In this connection the student shall submit her/his requisition approved by
HoD and Principal to CoE office well in advance prior to the examinations. (At least 15 days
before the commencement of Examinations).
Page | 26
ii) However, students injured during the study holidays and in between the examination
period and not able to write, on producing medical certificate from Civil Surgeon will be
given Scribe.
25. ELIGIBILITY FOR THE AWARD OF THE DEGREE

A student shall be declared to be eligible for the award of the B.E. / B.Tech. Degree provided the
student has
• Successfully gained the required number of total credits as specified in the curriculum
corresponding to the students programme within the stipulated time. Successfully completed the
course requirements, appeared for the End-Semester examinations and passed all the subjects
prescribed in all the 8 semesters and 6 years in the case of Lateral Entry) reckoned from the
commencement of the first (third in the case of Lateral Entry) semester to which the candidate
was admitted.
• Successfully passed any additional courses prescribed by the HoD whenever readmitted under
Regulations 2019
• Successfully completed the NCC / NSS / NSO / YRC requirements.
• No disciplinary action pending against the student.
• The award of Degree must have been approved by the Syndicate of the University.
25.1. AWARD OF LETTER GRADES

All assessments of a course shall be done on absolute marks basis. However, for the purpose of
reporting the performance of a student, letter grades, each carrying certain points, will be awarded
as per the range of total marks (out of 100) obtained by the students detailed below.
Letter Grade Grade Point Range of marks

O(Outstanding) 10 91 - 100
A + (Excellent) 9 81-90
A (Very Good) 8 71-80
B + (Good) 7 61-70
B (Above Average) 6 51-60
RA (Reappearance) 0 < 50
Absent 0
Withdrawal 0
With Held 0
RA – Reappearance
AB – Absent FAIL
W - Withdrawal from appearing for the examination in the course concerned.
WH – Withheld for Malpractice of any kind
After results are declared, Grade Sheets will be issued to each student.
Page | 27
CALCULATION OF GRADE POINT AVERAGE OF A SEMESTER (SGPA) AND

CUMULATIVE GRADE POINT AVERAGE (CGPA)
During each semester, the list of courses registered and the grades scored in each course are
used to compute the Grade Point Average (GPA). GPA is the ratio of the sum of the products of
the number of credits of courses registered and the grade points corresponding to the grades
scored in those courses, taken for all the courses, to the sum of the number of credits of all the
courses in the semester.
After the results are declared, grade sheet will be issued to each student which will contain the
following details. Grade Point Average (GPA) of a Semester (SGPA) and Cumulative Grade
Point Average (CGPA) of a programme are calculated as follows.
= Sum of the product of the GP by the corresponding credits of the courses offered in that semester
SGPA
Sum of the credits of the courses of that semester
i C GPi i
i.e., SGPA = Ci

i
Sum of the product of the GPs by the corresponding credits

CGPAof the entire programme = of the courses offered for the entire programme.
Sum of the credits of the courses of the entire semester
 CniGPni
n i
i.e.,CGPAof the entire programme = Cni

n i
Where,
Ci is the credit fixed for the course ‘i’ in the any semester
GPi is the grade point obtained for the course ‘i’ in any semester
n refers to the semester in which such courses are credited
Note: RA grade will be excluded for calculating GPA and CGPA
25.2 CLASSIFICATION OF THE DEGREE AWARDED
(i) First Class with Distinction:

A student who satisfies the following conditions shall be declared to have passed the examination
in First Class with Distinction:
Page | 28
➢ Should have passed the examination in all the courses of all eight semesters in the student’s
First Appearance within five years, which includes authorized break of study of one year. If
availed withdrawal from examination it will not be considered as an appearance.
➢ Should have secured a CGPA of not less than 8.50

➢ Should NOT have been prevented from writing ESE due to lack of attendance in any of the
courses.
(ii) First Class:

A student who satisfies the following conditions shall be declared to have passed the examination
in First Class:
➢ Should have passed the examination in all the courses of all eight semesters within
five years, which includes one year of authorized break of study (if availed) or prevention
from writing the ESE due to lack of attendance (if applicable).
➢ Should have secured CGPA of not less than 7.00
(iii) Second Class:

All other students, who qualify for the award of the Degree shall be declared to have passed the
examination in Second Class.
A student who is absent in ESE in a course /project work after having registered for the same shall
be considered to have appeared in that examination except approved withdrawal from ESE for the
purpose of classification.
26. REQUEST FOR PHOTO COPY OF THE VALUED ANSWER SCRIPT/ REVALUATION
A candidate can apply for photocopy of his/her semester examination answer paper in a theory
course, within 2 weeks from the declaration of results, on payment of a prescribed fee through
proper application to the Controller of Examinations through the Head of Institution.
The answer script is to be valued and justified by a faculty member, who handled the
subject and recommend for revaluation with breakup of marks for each question.
Based on the recommendation, the candidate can register for the revaluation through proper
application to the Controller of Examinations. The Controller of Examinations will arrange for the
revaluation and the results will be intimated to the candidate concerned through the Head of the
Institutions. Revaluation is not permitted for practical courses and for project work. A candidate
can apply for revaluation of answer scripts for not exceeding 6 subjects at a time.
Page | 29
Candidates not satisfied with Revaluation can apply for Review of his/ her examination answer
paper in a theory course, within the prescribed date on payment of a prescribed fee through proper
application to Controller of Examination through the Head of the Institution. Candidates applying
for Revaluation only are eligible to apply for Review.
27. SPECIAL SUPPLEMENTARY EXAMINATIONS

After the publication of VIII Semester ESE and the corresponding revaluation results if a student
has arrear in only one course for the entire programme, he/she will be permitted to take up the
supplementary examination within one month after the publication of the revaluation results.
28. INDUSTRIAL VISITS

Industrial visits shall be arranged for students to help them understand the Academic - Industry
environments. This will help them prepare themselves to meet the requirements of Industry when
they go for Employment or when they become Entrepreneurs.
29. DISCIPLINE
Every student is required to observe discipline and maintain decorum both inside and outside the
College and not indulge in any activity which lowers the prestige of the Institute.
30. MALPRACTICE
If a student indulges in malpractice in the End Semester Examinations he / she shall be liable for
punishment as per Anna University Rules and Regulations.
31. REVISION OF REGULATIONS AND CURRICULUM

The standing committee/Academic Council of the College reserves the right to revise or change or
amend the Regulations, the Scheme of Examinations, the Curriculum and the Syllabi from time to
time if found necessary.
CHAIRMAN BOS DEAN PRINCIPAL
Page | 30
CURRICULUM & SYLLABUS

Effective from Academic year 2019 - 2020
SEMESTER - I
Course Course
S.No Name of the Course L T P C CIA ESE TOTAL
Code Category
THEORY
1 19HE1101 Technical English HS 2 1 0 3 25 75 100
2 19MA1101 Calculus BS 3 1 0 4 25 75 100
THEORY & LAB COMPONENT
3 19PH1151 Applied Physics BS 2 0 2 3 50 50 100
4 19CY1151 Chemistry for Engineers BS 2 0 2 3 50 50 100
Python Programming and
5 19CS1151 ES 2 0 2 3 50 50 100
Practices
Basics of Electron
6 19EC1154 devices and Electric ES 2 0 2 3 50 50 100
Circuits
PRACTICAL
Language Competency
7 19HE1071R HS 1 0 0 1 100 0 100
Enhancement Course - I
MANDATORY
8 19MC1191 Induction Program MC 0 0 0 0 0 0 0
Total Credits 14 2 8 20 350 350 700
SEMESTER - II
Course Course
Code Category
THEORY
Business English for
1 19HE2101 HS 2 1 0 3 25 75 100
Engineers
Differential Equations
2 19MA2104 BS 3 1 0 4 25 75 100
And Linear Algebra
3 19PH2151 Material Science BS 2 0 2 3 50 50 100
4 19CY2151 Environmental Studies BS 2 0 2 3 50 50 100
Essentials of C and C++
5 19CS2152 ES 2 0 2 3 50 50 100
Programming
6 19ME2154 Engineering Graphics ES 1 0 4 3 50 50 100
PRACTICAL
7 19ME2001 Engineering Practices ES 0 0 4 2 50 50 100
Language Competency
8 19HE2071R Enhancement Course - HS 1 0 0 1 100 0 100
II
Total Credits 13 2 14 22 400 400 800
Page|31
SEMESTER - III
Course Course
S.No Name of the Course Category
L T P C CIA ESE TOTAL
Code
THEORY
Discrete Mathematics
1 19MA3104 BS 3 1 0 4 25 75 100
and Graph Theory
2 19CS3201 Data Structures PC 3 0 0 3 25 75 100
Database Management
3 19CS3202 PC 3 0 0 3 25 75 100
Systems
4 19CS3203 Computer Architecture PC 3 0 0 3 25 75 100
Digital Principles and
5 19CS3251 PC 3 0 2 4 50 50 100
System Design
PRACTICAL
Data Structures
6 19CS3001 PC 0 0 3 1.5 50 50 100
Laboratory
Database Management
7 19CS3002 PC 0 0 3 1.5 50 50 100
Systems Laboratory
MANDATORY
8 19AC3191 Constitution of India AC 2 0 0 0 0 0 0
Total Credits 17 1 8 20 250 450 700
SEMESTER - IV
Course Course
Code Category
THEORY
1 19CS4201 Java Programming PC 3 0 0 3 25 75 100
2 19CS4202 Software Engineering PC 3 1 0 4 25 75 100
3 19CS4203 Operating Systems PC 3 0 0 3 25 75 100
Probability, Statistics
4 19MA4151 BS 3 0 2 4 50 50 100
and Queuing Theory
Design and Analysis of
5 19CS4251 PC 3 0 2 4 50 50 100
Algorithms
PRACTICAL
6 19CS4001 Java Programming PC 0 0 3 1.5 50 50 100

Laboratory
Operating Systems
7 19CS4002 PC 0 0 3 1.5 50 50 100
Laboratory
MANDATORY
Value Education -
8 19AC4191 Essence of Indian AC 2 0 0 0 0 0 0
Traditional Knowledge
Total Credits 17 1 10 21 275 425 700
Page|32
SEMESTER - V
Course Course
Code Category
THEORY
1 19CS5201 Theory of Computing PC 3 1 0 4 25 75 100
2 19CS5202 Computer Networks PC 3 0 0 3 25 75 100
Principles of
3 19EC5231 Microprocessors and PC 3 0 0 3 25 75 100
Micro Controllers
4 19CS5251 Data mining PC 3 0 0 3 50 50 100

Object Oriented
5 19CS5252 PC 2 0 2 3 50 50 100
Analysis and Design
6 19CS53** Professional Elective I PE 2 0 2 3 50 50 100
PRACTICAL
7 19CS5001 Engineering Clinic PC 0 0 3 1.5 50 50 100
Principles of
Microprocessors and
8 19EC5031 PC 0 0 3 1.5 50 50 100
Micro-controllers
Laboratory
Total Credits 16 1 10 22 325 475 800
SEMESTER - VI
Course Course
Code Category
THEORY
Principles of
1 19CS6181 HS 3 0 0 3 25 75 100
Management
2 19CS6201 Artificial Intelligence PC 3 1 0 4 25 75 100
3 19CS6202 Mobile Computing PC 3 0 0 3 25 75 100
4 19**6401 Open Elective I OE 3 0 0 3 25 75 100
5 19CS63** Professional Elective II PE 3 0 0 3 25 75 100
6 19CS6251 Compiler Design PC 2 0 3 3.5 50 50 100
PRACTICAL
Mobile Application
7 19CS6001 Development PC 0 0 3 1.5 50 50 100
Laboratory
Page|33
Internship / Industrial
8 19CS6701 EEC 0 0 0 1 0 100 100
Training
Total Credits 17 1 6 22 225 575 800
SEMESTER - VII
Course Course
Code Category
THEORY
Cryptography and
1 19CS7201 PC 3 0 0 3 25 75 100
Network Security
2 19CS7202 Cloud Computing PC 3 0 0 3 25 75 100
3 19**7401 Open Elective II OE 3 0 0 3 25 75 100

Professional Elective
4 19CS73** PE 3 0 0 3 25 75 100
III
Machine Learning
5 19CS7251 PC 2 0 2 3 50 50 100
Techniques
PRACTICAL
Cloud Computing
6 19CS7001 PC 0 0 3 1.5 50 50 100
Laboratory
7 19CS7002 Security Laboratory PC 0 0 3 1.5 50 50 100
8 19CS7901 Project Phase I EEC 0 0 4 2 50 50 100
Total Credits 14 0 12 20 300 500 800
SEMESTER - VIII
Course Course
Code Category
THEORY
1 19CS83** PE 3 0 0 3 25 75 100
IV
2 19CS83** PE 3 0 0 3 25 75 100
V
PRACTICAL
3 19CS8901 Project Phase II EEC 0 0 24 12 100 100 200
Total Credits 6 0 24 18 150 250 400
LIST OF PROFESSIONAL ELECTIVES
Course Course
S.No Name of the Course Category
L T P C CIA ESE TOTAL
Code
PROFESSIONAL ELECTIVE I
Internet and Web
1 19CS5301 PE 2 0 2 3 50 50 100
Technology
Page|34
Advanced Java
2 19CS5302 PE 2 0 2 3 50 50 100
Programming
Fundamentals of Open
3 19CS5303 PE 2 0 2 3 50 50 100
Source Software
4 19CS5304 R Programming PE 2 0 2 3 50 50 100
Computer Graphics
5 19CS5305 PE 2 0 2 3 50 50 100
and Multimedia
PROFESSIONAL ELECTIVE II
Course Course
Code Category
Business Intelligence
– Data Warehousing 3 0 0 3 25 75 100
1 19CS6301 and Analytics PE
2 19CS6302 Embedded Systems PE 3 0 0 3 25 75 100
3 19CS6303 Internet of Things PE 3 0 0 3 25 75 100
Big Data Analytics
4 19CS6304 PE 3 0 0 3 25 75 100
and Tools
5 19CS6305 Soft Computing PE 3 0 0 3 25 75 100
PROFESSIONAL ELECTIVE III
Course Course
Code Category
Multi-core
1 19CS7301 Architecture and PE 3 0 0 3 25 75 100
Programming
2 19CS7302 Cyber Forensics PE 3 0 0 3 25 75 100
Wireless Sensor
3 19CS7303 PE 3 0 0 3 25 75 100
Networks
C# and .Net
4 19CS7304 PE 3 0 0 3 25 75 100
Programming
5 19CS7305 Software Testing PE 3 0 0 3 25 75 100
PROFESSIONAL ELECTIVE IV
Course Course
Code Category
Digital Image
1 19CS8301 PE 3 0 0 3 25 75 100
Processing
2 19CS8302 High Speed Networks PE 3 0 0 3 25 75 100
3 19CS8303 Information Security PE 3 0 0 3 25 75 100
Human Computer
4 19CS8304 PE 3 0 0 3 25 75 100
Interaction
Responsive Web
5 19CS8305 PE 3 0 0 3 25 75 100
Design
Page|35
PROFESSIONAL ELECTIVE V
Course Course
.No Name of the Course L T P C CIA ESE TOTAL
Code Category
Information Retrieval
1 19CS8306 PE 3 0 0 3 25 75 100
Techniques
2 19CS8307 User Interface Design PE 3 0 0 3 25 75 100
Visualization
3 19CS8308 PE 3 0 0 3 25 75 100
Techniques
4 19CS8309 Deep Learning PE 3 0 0 3 25 75 100
Block Chain
5 19CS8310 PE 3 0 0 3 25 75 100
Technology
OPEN ELECTIVES
Course Course
S. No Name of the Course L T P C CIA ESE TOTAL
Code Category
OPEN ELECTIVE - I
Introduction to Java
1 19CS6401 OE 3 0 0 3 25 75 100
Programming
2 19CS6402 Green Computing OE 3 0 0 3 25 75 100
OPEN ELECTIVE - II
Foundation Skills in
Information
1 19CS7401 OE 3 0 0 3 25 75 100
Technology
(NASSCOM)
2 19CS7402 Multimedia Systems OE 3 0 0 3 25 75 100
 Following are the Industry Core Courses (ICC) which will be offered as choice based course in the
following semesters:
S. Sem. Course
Course Title L T P C CIA ESE TOTAL
No. No Code
1 I 19CS1152 Object oriented programming using Python 2 0 2 3 50 50 100

2 II 19CS2153 Java Fundamentals 2 0 2 3 50 50 100
3 III 19CS3252 Clean Coding and Devops 3 0 2 4 50 50 100
4 IV 19CS4204 Design Thinking 3 0 0 3 25 75 100
5 IV 19CS4003 Design Thinking Laboratory 0 0 3 1.5 50 50 100
6 V 19CS5306 Predictive Modeling 2 0 2 3 50 50 100
7 VI 19CS6203 AI Analyst 3 1 0 4 25 75 100
8 VI 19CS6306 Business Intelligence 3 0 0 3 25 75 100
9 VII 19CS7306 Data Visualization 3 0 0 3 25 75 100
Page|36
 Following are the Audit Course for Semester – III
S. No Course Code Course Name L T P C

1 19AC3191 Constitution of India 2 0 0 0
2 19AC3192 Disaster Management 2 0 0 0
3 19AC3193 Sanskrit for Technical knowledge 2 0 0 0
4 19AC3194 Pedagogy Studies 2 0 0 0
5 19AC3195 English for Research Paper writing 2 0 0 0
 Following are the Audit Course for Semester – IV
S. No Course Code Course Name L T P C

1 19AC4191 Value Education 2 0 0 0
2 19AC4192 Stress Management by Yoga 2 0 0 0
Personality Development Through Life
3 19AC4193 2 0 0 0
Enlightenment Skills
4 19AC4194 Unnat Bharat Abhiyan 2 0 0 0
 Following are the Career Guidance courses:
Course
S. No. Course Title Semester L T P C
Code
Career Guidance – Level I
1 19HE1072 I 2 0 0 1
Personality, Aptitude and Career Development
2 19HE1073 Entrepreneurship & Innovation I 2 0 0 1
Career Guidance – Level II
3 19HE2072 II 2 0 0 1
Career Guidance – Level III
4 19HE3071 III 2 0 0 1
Career Guidance – Level IV
5 19HE4071 IV 2 0 0 1
Page|37
Programme Course Code Name of the Course L T P C

B.E. 19HE1101 TECHNICAL ENGLISH 2 1 0 3
1. To facilitate students to communicate effectively with coherence.

2. To train the learners in descriptive communication.
Course 3. To introduce professional communication.
Objective 4. To enhance knowledge and to provide the information on corporate environment.
5. To equip the trainers with the necessary skills on critical thinking.
Instructional
Unit Description
Hours
Listening and Speaking – Opening a conversation, maintaining coherence, turn taking,
closing a conversation (excuse, general wishes, positive comments and thanks) Reading –
Reading articles from newspaper, Reading comprehension Writing Chart analysis,
I 9
process description, Writing instructions Grammar and Vocabulary- Tenses, Regular
and irregular verb, technical vocabulary.
Listening and Speaking- listening to product description, equipment & work place
(purpose, appearance, function) Reading- Reading technical articles Writing- Letter
II 9
phrases, writing personal letters, Grammar and Vocabulary-articles, Cause & effect,
Prepositions.
Listening and Speaking- - listening to announcements Reading- Reading about technical
inventions, research and development Writing- Letter inviting a candidate for interview,
III 9
Job application and resume preparation Grammar and Vocabulary- Homophones and
Homonyms.
Listening and Speaking- - Practice telephone skills and telephone etiquette (listening and
responding, asking questions).Reading- Reading short texts and memos Writing-
invitation letters, accepting an invitation and declining an invitation Grammar and
IV 9
Vocabulary- Modal verbs, Collocation, Conditionals, Subject verb agreement and
Pronoun-Antecedent agreement.
Listening and Speaking- listening to technical group discussions and participating in

GDs Reading- reading biographical writing - Writing- Proposal writing, Writing
V definitions, Grammar and Vocabulary- Abbreviation and Acronym, Prefixes & suffixes, 9
phrasal verbs.
Total Instructional Hours 45
CO1- Trained to maintain coherence and communicate effectively.

CO2- Practiced to create and interpret descriptive communication.
Course CO3- Introduced to gain information of the professional world.
Outcome CO4- acquired various types of communication and etiquette.
CO5- Taught to improve interpersonal and intrapersonal skills.
TEXT BOOKS:
T1- Norman Whitby, “Business Benchmark-Pre-intermediate to Intermediate”, Cambridge University Press,
2016.
Page | 38
T2- Raymond Murphy, “Essential English Grammar”, Cambridge University Press, 2019.
REFERENCE BOOKS :
R1- Meenakshi Raman and Sangeetha Sharma. “Technical Communication- Principles and Practice”, Oxford
University Press, 2009.
R2- Raymond Murphy, “English Grammar in Use”- 4th edition Cambridge University Press, 2004.
R3- Kamalesh Sadanan “A Foundation Course for the Speakers of Tamil-Part-I &II”, Orient Blackswan, 2010.
Signed By Approved By
Dr Shankar S Dr Karunakaran K
CHAIRMAN, BOARD OF STUDIES PRINCIPAL
Page | 39

B.E. 19MA1101 CALCULUS 3 1 0 4
1. Understand the concept of differentiation
2. Interpret in the area of infinite series and their convergence.
Course 3. Evaluate the functions of several variables which are needed in many branches of
Objective engineering.
4. Understand the concept of double integrals.
5. Understand the concept of triple integrals.
Instructional
Unit Description
Hours
DIFFERENTIAL CALCULUS
I Rolle’s Theorem – Lagrange’s Mean Value Theorem- Maxima and Minima – Taylor’s 12
and Maclaurin’s Theorem.
SEQUENCE AND SERIES
II Definition and examples – Series – Test for Convergence – Comparison Test – D’ 12
Alembert’s Ratio Test – Alternative Series – Alembert’s Leibnitz test.
MULTIVARIATE CALCULUS (DIFFERENTIATION)

III Total derivatives - Jacobians – Maxima, M inima and Saddle points - Lagrange’s method 12
of undetermined multipliers – Gradient, divergence, curl and derivatives.
DOUBLE INTEGRATION
Double integrals in Cartesian coordinates – Area enclosed by the plane curves
IV (excluding surface area) – Green’s Theorem (Simple Application) - Stoke’s Theorem – 12
Simple Application involving cubes and rectangular parellopiped.
TRIPLE INTEGRATION
Triple integrals in Cartesian co-ordinates – Volume of solids (Sphere, Ellipsoid,
V Tetrahedron) using Cartesian co-ordinates. Gauss Divergence Theorem – Simple 12
Application involving cubes and rectangular parellopiped.

CO1: Apply the concept of differentiation in any curve.
CO2: Evaluation of infinite series approximations for problems arising in mathematical
Course modeling.
Outcome CO3: Identify the maximum and minimum values of surfaces.
CO4: Apply double integrals to compute area of plane curves.
CO5: Evaluation of triple integrals to compute volume of solids.
TEXT BOOKS:
T1 - Erwin Kreyszig, “Advanced Engineering Mathematics”, 10th Edition, Wiley India Private Ltd., New Delhi,
2018.
T2 - Veerarajan T, “Engineering Mathematics ”, McGraw Hill Education(India) Pvt Ltd, New Delhi, 2016.
Page | 40
REFERENCE BOOKS :
R1- Thomas & Finney “ Calculus and Analytic Geometry” , Sixth Edition,,Narosa Publishing House, New Delhi.
R2 - Weir,M.D and Joel Hass, ‘ Thomas Calculus” 12 th Edition,Pearson India 2016..
R3 - Grewal B.S, “Higher Engineering Mathematics”, 42nd Edition, Khanna Publications, Delhi, 2012.
Page | 41

B.E. 19PH1151 APPLIED PHYSICS 2 0 2 3
The student should be able to

1. Enhance the fundamental knowledge in properties of matter
2. Analysis the oscillatory motions of particles
Course 3. Extend the knowledge about wave optics
Objective 4. Gain knowledge about laser and their applications
5. Conversant with principles of optical fiber, types and applications of optical fiber
Instructional
Unit Description
Hours
PROPERTIES OF MATTER
Elasticity – Hooke‘s law – Stress-strain diagram - Poisson‘s ratio – Bending 6+3=9
I moment – Depression of a cantilever – Derivation of Young‘s modulus of the
material of the beam by Uniform bending theory and experiment.
Determination of Young’s modulus by uniform bending method.
OSCILLATONS
Translation motion –Vibration motion – Simple Harmonic motion – Differential
II Equation of SHM and its solution – Damped harmonic oscillation - Torsion 6+3=9
stress and deformations – Torsion pendulum: theory and
experiment.Determination of Rigidity modulus – Torsion pendulum.
WAVE OPTICS
Conditions for sustained Interference – air wedge and it’s applications -
Diffraction of light – Fresnel and Fraunhofer diffraction at single slit – 6+6=12
III Diffraction grating – Rayleigh’s criterion of resolution power - resolving power
of grating. Determination of wavelength of mercury spectrum –
spectrometer grating. Determination of thickness of a thin wire – Air
wedge method.
LASER AND APPLICATIONS

6+3=9
Spontaneous emission and stimulated emission – Population inversion –
IV Pumping methods – Derivation of Einstein‘s coefficients (A&B) – Type of
lasers – Nd:YAG laser and CO2 laser- Laser Applications – Holography –
Construction and reconstruction of images. Determination of Wavelength
and particle size using Laser.
FIBER OPTICS AND APPLICATIONS

Principle and propagation of light through optical fibers – Derivation of
V numerical aperture and acceptance angle – Classification of optical fibers 6
(based on refractive index, modes and materials) – Fiber optical communication
link – Fiber optic sensors – Temperature and displacement sensors.
Page | 42
After completion of the course the learner will be able to

CO1: Illustrate the fundamental properties of matter
CO2: Discuss the Oscillatory motions of particles
Course CO3: Analyze the wavelength of different colors
Outcome
CO4: Understand the advanced technology of LASER in the field of Engineering
CO5: Develop the technology of fiber optical communication in engineering field
TEXT BOOKS:
T1 - Rajendran V, Applied Physics, Tata McGraw Hill Publishing Company Limited, New Delhi, 2017.
T2- Gaur R.K. and Gupta S.L., Engineering Physics, 8 th edition, Dhanpat Rai Publications (P) Ltd., New
Delhi, 2015.
REFERENCE BOOKS:
R1 - Arthur Beiser “Concepts of Modern Physics” Tata McGraw Hill, New Delhi – 2015
R2 - M.N Avadhanulu and PG Kshirsagar “A Text Book of Engineering physics” S. Chand and Company ltd.,
New Delhi 2016
R3 - Dr. G. Senthilkumar “Engineering Physics – I” VRB publishers Pvt Ltd., 2016
Page | 43

B.E. 19CY1151 CHEMISTRY FOR ENGINEERS 2 0 2 3
The student should be conversant with

1. The boiler feed water requirements, related problems and water treatment techniques.
2. The principles of polymer chemistry and engineering applications of polymers and
composites.
Course
Objective 3. The principles of electrochemistry and with the mechanism of corrosion and its control.
4. The principles and generation of energy in batteries, nuclear reactors, solar cells, wind
mills and fuel cells.
5. The important concepts of spectroscopy and its applications.
Instructional
Unit Description
Hours
I WATER TECHNOLOGY: Hard water and soft water- Disadvantages of hard water-
Hardness: types of hardness, simple calculations, estimation of hardness of water – EDTA
method – Boiler troubles - Conditioning methods of hard water – External conditioning - 6 +3=9
demineralization process - desalination: definition, reverse osmosis – Potable water
treatment – breakpoint chlorination. Estimation of total, permanent and temporary
hardness of water by EDTA.
II POLYMER & COMPOSITES: Polymerization – types of polymerization – addition and
condensation polymerization – mechanism of free radical addition polymerization –
copolymers – plastics: classification – thermoplastics and thermosetting plastics,
preparation, Polymerization – types Polymerization – types of polymerization – addition
and condensation polymerization – mechanism of free radical addition polymerization – 6
copolymers – plastics: classification – thermoplastics and thermosetting plastics,
preparation, properties and uses of commercial plastics – PVC, Bakelite – moulding of
plastics (extrusion and compression); Composites: definition, types of composites –
polymer matrix composites (PMC) –FRP
III ELECTROCHEMISTRY AND CORROSION: Electrochemical cells – reversible and
irreversible cells - EMF- Single electrode potential – Nernst equation (derivation only) –
Conductometric titrations. Chemical corrosion – Pilling – Bedworth rule – electrochemical
corrosion – different types –galvanic corrosion – differential aeration corrosion – corrosion 6+9 =15
control – sacrificial anode and impressed cathodic current methods - protective coatings –
paints – constituents and functions. Conductometric titration of strong acid vs strong
base (HCl vs NaOH). Conductometric titration (Mixture of strong acid and base).
Conductometric precipitation titration using BaCl2 and Na2SO4\
IV ENERGY SOURCES AND STORAGE DEVICES: Introduction- nuclear energy- nuclear
fission- controlled nuclear fission- nuclear fusion differences between nuclear fission and
fusion- nuclear chain reactions- nuclear reactor power generator- classification of nuclear 6
reactor- light water reactor- breeder reactor. Batteries and fuel cells: Types of batteries-
alkaline battery- lead storage battery- lithium battery- fuel cell H2 -O2 fuel cell applications.
V ANALYTICAL TECHNIQUES: Beer-Lambert’s law – UV-visible spectroscopy and IR
spectroscopy – principles – instrumentation (block diagram only) – flame photometry –
principle – instrumentation (block diagram only) – estimation of sodium by flame
photometry – atomic absorption spectroscopy – principles – instrumentation (block diagram 6+3
only) – estimation of nickel by atomic absorption spectroscopy.
Determination of iron content of the water sample using spectrophotometer.(1,10
phenanthroline / thiocyanate method).
Page | 44
After the completion of the course, the learner will be able to
CO1: Differentiate hard and soft water and to solve the related problems on water purification
and its significance in industries and daily life
CO2: Acquire the basic knowledge of polymers, composites and FRP and their significance.
Course CO3: Develop knowledge on the basic principles of electrochemistry and understand the
Outcome causes of corrosion, its consequences to minimize corrosion to improve industrial design.
CO4: Develop knowledge about the renewable energy resources and batteries along with the
need of new materials to improve energy storage capabilities.
CO5: Identify the structure and characteristics of unknown/new compound with the help of
spectroscopy.
TEXT BOOKS
T1 - P.C.Jain and Monica Jain, “Engineering Chemistry” Dhanpat Rai Pub, Co., New Delhi (2018).
REFERENCES
R1 - B.Sivasankar “Engineering Chemistry” Tata McGraw-Hill Pub.Co.Ltd, New Delhi (2012).
R2 - S.S.Dara “A Text book of Engineering Chemistry” S.Chand & Co. Ltd., New Delhi (2017).
Page | 45

BE 19CS1151 PYTHON PROGRAMMING AND PRACTICES 2 0 2 3
1. To know the basics of algorithmic problem solving

2. To read and write simple Python programs
Course 3. To develop Python programs with conditionals and loops and to define Python functions
Objective and call them
4. To use Python data structures –- lists, tuples, dictionaries
5. To do input/output with files in Python
Instructional
Unit Description
Hours
ALGORITHMIC PROBLEM SOLVING
Algorithms, building blocks of algorithms (statements, state, control flow,
functions), notation(pseudo code, flow chart, programming language), algorithmic
I 9
problem solving, simple strategiesfor developing algorithms (iteration, recursion).
Illustrative problems: find minimum in a list, insert acard in a list of sorted cards,
guess an integer number in a range, Towers of Hanoi.
DATA, EXPRESSIONS, STATEMENTS
Python interpreter and interactive mode; values and types: int, float, boolean, string,
and list;variables, expressions, statements, tuple assignment, precedence of
II 7+2(P)
operators, comments;modules and functions, function definition and use, flow of
execution, parameters and arguments. Illustrative programs: exchange the values of
two variables, circulate the values of n variables, distance between two points.
CONTROL FLOW, FUNCTIONS
Conditionals: Boolean values and operators, conditional (if), alternative (if-else),
chained conditional (if-elif-else); Iteration: state, while, for, break, continue, pass;
III Fruitful functions: returnvalues, parameters, local and global scope, function 5+4(P)
composition, recursion; Strings: string slices, immutability, string functions and
methods, string module; Lists as arrays. Illustrative programs: square root, gcd,
exponentiation, sum an array of numbers, linear search, binary search.
LISTS, TUPLES, DICTIONARIES
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning
IV lists, listparameters; Tuples: tuple assignment, tuple as return value; Dictionaries: 3+6(P)
operations andmethods; advanced list processing - list comprehension; Illustrative
programs: selection sort, insertion sort, merge sort, histogram.
FILES, MODULES, PACKAGES
Files and exception: text files, reading and writing files, format operator; command
V 5+4(P)
line arguments,errors and exceptions, handling exceptions, modules, packages.
Illustrative programs: word count, copying file contents.
Total Instructional Hours (29 + 16) 45
CO1: Develop algorithmic solutions to simple computational problems

CO2: Read, write, execute by hand simple Python programs
Course CO3: Structure simple Python programs for solving problems and Decompose a Python
Outcome program into functions
CO4: Represent compound data using Python lists, tuples, dictionaries
CO5: Read and write data from/to files in Python Programs.
Page | 46
TEXT BOOKS:
T1: Guido van Rossum and Fred L. Drake Jr, An Introduction to Python – Revised andupdated for Python 3.6.2,
Shroff Publishers, First edition (2017).
T2: S. Annadurai, S.Shankar, I.Jasmine, M.Revathi, Fundamentals of Python Programming, Mc-Graw Hill
Education (India) Private Ltd, 2019
REFERENCE BOOKS:
R1: Charles Dierbach, ―Introduction to Computer Science using Python: A ComputationalProblem-Solving
Focus, Wiley India Edition, 2013.
R2: Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd., 2015
R3: Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming inPython: An Inter-
disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016
Page | 47

BASICS OF ELECTRON DEVICES
B.E. 19EC1154 2 0 2 3
AND ELECTRIC CIRCUITS
1. To introduce the fundamental concepts of electrical circuits and theorems.
2. To introduce the concept of circuit transients and resonance.
Course
3. To understand the basics theory, operational characteristics of diodes and transistors.
Objective
4. To study the operating principles of special semiconductor devices..
5. To create awareness on the methods for electrical safety and protection.
Instructional
Unit Description
Hours
UNIT I : ELECTRICAL CIRCUITS AND ANALYSIS

Ohm‘s law, DC and AC circuits fundamentals, Kirchhoff‘s laws, Mesh and Nodal
I 6+3
analysis-Theorems and simple problems: Superposition, Maximum power transfer
theorem - Experimental study -Verification of superposition theorem.
UNIT II : CIRCUIT TRANSIENTS AND RESONANCES

Basic RL, RC and RLC circuits and their responses to DC and sinusoidal inputs –
6+3
II frequency response – Parallel and series resonances – Q factor. Experimental
verification of series resonance. Experimental study-Determination of Resonance
Frequency of Series RLC Circuits
UNIT III : DIODE AND TRANSISTOR
Characteristics of PN Junction Diode – Zener Diode and its Characteristics – Zener
6+3
III Effect– Zener Voltage Regulator.Bipolar Junction Transistor (BJT) Construction – CB,
CE, CC Configurations and Characteristics- Experimental study-PN Junction Diode
Characteristics,Zener Diode Characteristics
UNIT IV : SPECIAL SEMICONDUCTOR DEVICES

Construction, Characteristics and Applications of FET - UJT – SCR, Photo diode, 6+3
IV
Photo Transistor - LED and LCD- Implementation of Photo diode application.
Experimental study- FET Characteristics
UNIT V : BASICS OF POWER SUPPLY AND ELECTRICAL WIRING

Introduction to Power supply circuits: Half wave, Full wave Rectifier –SMPS - UPS
6+3
V (online & offline).Cable and wire types and applications – Two way and three way
control- Experimental study- Implementation of simple wiring circuit for a
Computer network.
CO1: Apply network theorems for AC and DC Circuits.
CO2: Understand the concept of transient response of circuits.
Course CO3: Ability to explain the theory, construction, and operation of diodes and BJT.
Outcome CO4: Ability to explain the theory, construction, and operation of FET and special
semiconductor diodes.
CO5: Ability to apply the methods to ensure electrical safety.
Page | 48
TEXT BOOKS:
T1 - W David A. Bell, “Electronic Devices and Circuits”, Oxford University Press, 5Th
Edition,(2008).
T2 - Sudhakar A and Shyam Mohan SP, “Circuits and Network Analysis and Synthesis”,Tata
McGraw Hill, (2007).
REFERENCES BOOKS:
R1 - M.Robert T. Paynter, “Introducing Electronics Devices and Circuits”, PearsonEducation,

7thEducation, (2006).
R2 - J. Millman&Halkins, SatyebrantaJit, “Electronic Devices &Circuits”,Tata McGraw Hill, 2 nd
Edition, 2008
R3 - William H. Hayt, J.V. Jack, E. Kemmebly and steven M. Durbin, “Engineering Circuit
Analysis”,Tata McGraw Hill, 6th Edition, 2002.
R4 - Robert Boylestad and Louis Nashelsky, “Electron Devices and Circuit Theory” Prentice Hall,
10th edition, July 2008
Page | 49
L T P C
Programme Course Code Name of the Course
B.E. 19HE2101 BUSINESS ENGLISH FOR ENGINEERS 2 1 0 3
1. To introduce to business communication.

2. To train the students to react to different professional situations.
Course
3. To make the learner familiar with the managerial skills
Objective
4. To empower the trainee in business writing skills.
5. To learn to interpret and expertise different content.
Instructional
Unit Description
Hours
Listening and Speaking – listening and discussing about programme and conference
arrangement Reading –reading auto biographies of successful personalities Writing
I 9
Formal & informal email writing, Recommendations Grammar and Vocabulary-
Business vocabulary, Adjectives & adverbs.
Listening and Speaking- listening to TED talks Reading- Making and interpretation of
posters Writing- Business letters: letters giving good and bad news, Thank you letter,
II Congratulating someone on a success” Grammar and Vocabulary- Active & passive 9
voice, Spotting errors (Tenses, Preposition, Articles).
Listening and Speaking-travel arrangements and experience Reading- travel reviews

III Writing- Business letters (Placing an order, making clarification & complaint letters). 9
Grammar and Vocabulary- Direct and Indirect speech.
Listening and Speaking- Role play - Reading- Sequencing of sentence Writing-
Business report writing (marketing, investigating) Grammar and Vocabulary-
IV 9
Connectors, Gerund & infinitive.
Listening and Speaking- Listen to Interviews & mock interview Reading- Reading short
stories, reading profile of a company - Writing- Descriptive writing (describing one’s
V own experience) Grammar and Vocabulary- Editing a passage(punctuation, spelling & 9
number rules).
CO1- Introduced to different modes and types of business communication.

CO2- Practiced to face and react to various professional situations efficiently.
Course CO3- learnt to practice managerial skills.
Outcome CO4- Familiarized with proper guidance to business writing.
CO5- Trained to analyze and respond to different types of communication.
TEXT BOOKS:
T1 - Norman Whitby, “Business Benchmark-Pre-intermediate to Intermediate”,Cambridge University Press,
2016.
T2- Ian Wood and Anne Willams. “Pass Cambridge BEC Preliminary”, Cengage Learning press 2015.
Page | 50
REFERENCE BOOKS :
R1 - Michael Mc Carthy, “Grammar for Business”, Cambridge University Press, 2009.
R2- Bill Mascull, “Business Vocabulary in use: Advanced 2nd Edition”, Cambridge University Press, 2009.
R3- Frederick T. Wood, “Remedial English Grammar For Foreign Students”, Macmillan publishers, 2001.
Page | 51
DIFFERENTIAL EQUATIONS AND LINEAR
B.E. 19MA2104 3 1 0 4
ALGEBRA
1. Develop the skill to use matrix algebra techniques that is needed by engineers for
practical applications
Course 2. Extend the knowledge of vector spaces
Objective 3. Describe some methods to solve different types of first order differential equations.
4. Solve ordinary differential equations of certain types using Wronskian technique.
5. Use the effective mathematical tools for the solutions of partial differential equations
Instructional
Unit Description
Hours
MATRICES
Eigen values and Eigen vectors of a real matrix – Properties of Eigen values and Eigen
I vectors (without proof) Cayley - Hamilton Theorem (excluding proof) - Orthogonal 12
matrices – Definition – Reduction of a quadratic form to canonical form by orthogonal
transformation.
VECTOR SPACES
Complex matrices – Conjugate of the matrix – Hermitian and Skew Hermitian matrices – 12
II
Properties (without proof) – Unitary matrix – Properties (without proof) - Inner product
spaces – Gram – Schmidt orthogonalization.
FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS

Equations of the first order and of the first degree – Homogeneous equations – Exact
III
differential equations – Linear equations – Equations reducible to the linear form – 12
Benoulli’s equation.
ORDINARY DIFFERENTIAL EQUATIONS OF HIGHER ORDER
Second order linear differential equations with constant and variable co-efficients –
IV 12
Cauchy – Euler equations – Cauchy – Legendre equation – Method of variation of
paramers.
PARTIAL DIFFERENTIAL EQUATIONS
Formation of partial differential equations by the elemination of arbitrary constants and
V 12
arbitrary functions – Solution of standard types of first order partial differential equations
of the form f(p,q)=0, Clairaut’s type : z = px+qy +f(p,q) – Lagrange’s linear equation.
CO1: Calculate Eigen values and Eigen vectors for a matrix which are used to determine the
natural frequencies
CO2: Infer the knowledge of vector spaces
Course
Outcome CO3: Apply few methods to solve different types of first order differential equations.
CO4: Develop sound knowledge of techniques in solving ordinary differential equations.
CO5: Solve Partial Differential Equations using various methods.
TEXT BOOKS:
T1- Grewal B.S, “Higher Engineering Mathematics”, 43rd Edition, Khanna Publications, Delhi, 2018.
T2- Howard Anton, Chris Rorres, Elements of Linear Algebra with Applications, Wiley, New Delhi, 2 nd Edition,
2015.
Page | 52
REFERENCE BOOKS :
R1-E. A. Coddington, An Introduction to ordinary Differential Equations, Prentice Hall India, 1995.
R2 - G.F.Simmons and S. G. Krantz, Differential Equations, Tata McGraw Hill, 2007.
R3 - Veerarajan T, “Engineering Mathematics”, McGraw Hill Education(India) Pvt Ltd, New Delhi, 2016
Page | 53

BE 19PH2151 MATERIAL SCIENCE 2 0 2 3
The student should be able to

1. Acquire fundamental knowledge of semiconducting materials which is related to the
engineering program
Course 2. Extend the knowledge about the magnetic materials
Objective 3. Explore the behavior of super conducting materials
4. Gain knowledge about Crystal systems
5. Understand the importance of ultrasonic waves
Instructional
Unit Description
Hours
I SEMICONDUCTING MATERIALS
Introduction – Intrinsic semiconductor – Compound and elemental semiconductor - 6+(6)
direct and indirect band gap of semiconductors. Carrier concentration derivation –
Fermi level – Variation of Fermi level with temperature – electrical conductivity –
band gap determination. Optical properties of semiconductor – Light through
optical fiber(Qualitative). Determination of band gap of a semiconductor.
Determination of acceptance angle and numerical aperature in an optical fiber
II MAGNETIC MATERIALS
Origin of magnetic moment – Bohr magneton – comparison of Dia, Para and Ferro 6+(3)
magnetism – Domain theory – Hysteresis – soft and hard magnetic materials – anti
ferromagnetic materials – Ferrites and its applications. B – H curve by Magnetic
hysteresis experiment.
III 6
SUPERCONDUCTING MATERIALS
Superconductivity : properties(Messiner effect, effect of magnetic field, effect of
current and isotope effects) – Type I and Type II superconductors – High Tc
superconductors – Applications of superconductors –Cryotron and magnetic
levitation.
IV CRYSTAL PHYSICS 6
Crystal systems - Bravais lattice - Lattice planes - Miller indices - Interplanar
spacing in cubic lattice - Atomic radius, Coordination number and Packing factor
for SC, BCC and FCC crystal structures.
V ULTRASONICS 6+(6)
Production – Magnetostrictive generator – Piezoelectric generator – Determination
of velocity using acoustic grating – Cavitations – Viscous force – co-efficient of
viscosity. Industrial applications – Drilling and welding – Non destructive testing –
Ultrasonic pulse echo system. Determination of velocity of sound and
compressibility of liquid – Ultrasonic wave. Determination of Coefficient of
viscosity of a liquid –Poiseuille’s method.
Page | 54
After completion of the course the learner will be able to

CO1: Understand the purpose of acceptor or donor levels and the band gap of a semiconductor
Course
CO2: Interpret the basic idea behind the process of magnetism and its applications in everyday
Outcome
CO3: Discuss the behavior of super conducting materials
CO4: Illustrate the types and importance of crystal systems
CO5: Evaluate the production of ultrasonics and its applications in NDT
TEXT BOOKS:
T1 - Rajendran V, Applied Physics, Tata McGraw Hill Publishing Company Limited, New Delhi, 2017.
T2- Gaur R.K. and Gupta S.L., Engineering Physics, 8th edition, Dhanpat Rai Publications (P) Ltd., New
Delhi, 2015.
REFERENCE BOOKS:
R1 - Arthur Beiser “Concepts of Modern Physics” Tata McGraw Hill, New Delhi – 2015
R2 - M.N Avadhanulu and PG Kshirsagar “A Text Book of Engineering physics” S. Chand and Company ltd.,
New Delhi 2016.
R3 - Dr. G. Senthilkumar “Engineering Physics – II” VRB publishers Pvt Ltd., 2016
Page | 55

B.E. 19CY2151 ENVIRONMENTAL STUDIES 2 0 2 3
The student should be conversant with
1. The natural resources, exploitation and its conservation

2. The importance of environmental education, ecosystem and biodiversity.
3. The knowledge about environmental pollution – sources, effects and control measures of
Course
environmental pollution.
Objective
4. Scientific, technological, economic and political solutions to environmental problems.
5. An awareness of the national and international concern for environment and its
protection.
Unit Description Instructional

Hours
I NATURAL RESOURCES 6
Renewable and Non renewable resources - Forest resources: Use and over-exploitation,
deforestation, timber extraction, mining, dams and their effects on forests and tribal
people - Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture – Energy resources: Renewable and non
renewable energy sources – Solar energy and wind energy - role of an individual in
conservation of natural resources.
II ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 6
Importance of environment – need for public awareness - concept of an ecosystem –
structure and function of an ecosystem - energy flow in the ecosystem – ecological
succession processes – Introduction, types, characteristic features, structure and function
of the forest and ponds ecosystem – Introduction to biodiversity definition: types and
value of biodiversity – hot-spots of biodiversity – threats to biodiversity– endangered and
endemic species of India – conservation of biodiversity: In-situ and ex-situ conservation of
biodiversity.
III ENVIRONMENTAL POLLUTION 6+9=15
Definition – causes, effects and control measures of: Air pollution- Water pollution –
Water quality parameters- Soil pollution - Noise pollution- Nuclear hazards – role of an
individual in prevention of pollution. Determination of Dissolved Oxygen in sewage
water by Winkler’s method. Estimation of alkalinity of water sample by indicator
method. Determination of chloride content of water sample by argentometric
method.
IV SOCIAL ISSUES AND THE ENVIRONMENT 6+3=9
From unsustainable to sustainable development – urban problems related to energy-
environmental ethics: Issues and possible solutions – 12 Principles of green chemistry-
Municipal solid waste management. Global issues – Climatic change, acid rain,
greenhouse effect and ozone layer depletion – Disaster Management – Tsunami and
cyclones. Determination of pH in beverages.
V HUMAN POPULATION AND THE ENVIRONMENT 6+3=9
Population growth, variation among nations – population explosion – family welfare
programme – environment and human health – effect of heavy metals – human rights –
value education – HIV / AIDS – women and child welfare –Environmental impact
analysis (EIA)- GIS-remote sensing-role of information technology in environment and
human health. Estimation of heavy metal ion (copper) in effluents by EDTA.
Page | 56
After the completion of the course, the learner will be able to
CO1: Develop an understanding of different natural resources including renewable resources.

CO2: Realise the importance of ecosystem and biodiversity for maintaining ecological
balance.
CO3: Understand the causes of environmental pollution and hazards due to manmade
Course
activities.
Outcome
CO4: Demonstrate an appreciation for need for sustainable development and understand the
various social issues and solutions to solve the issues.
CO5: Gain knowledge about the importance of women and child education and know about
the existing technology to protect environment.
TEXT BOOKS:
T1- Anubha Kaushik and C. P. Kaushik, “Perspectives in Environmental studies”, Sixth edition, New Age
International Publishers, New Delhi, 2019.
T2 – S.Annadurai and P.N. Magudeswaran, “Environmental studies”, Cengage Learning India Pvt.Ltd, Delhi,
2018
REFERENCES:
R1 – Erach Bharucha, “Textbook of environmental studies” University Press (I) Pvt.ltd, Hyderabad, 2015
R2 - G.Tyler Miller, Jr and Scott E. Spoolman“Environmental Science” Thirteenth Edition, Cengage

Learning, 2010.
R3 - Gilbert M. Masters and Wendell P. Ela “Introduction to Environmental Engineering and Science‟, 3rd
edition, Pearson Education, 2013.
Page | 57

BE 19CS2152 ESSENTIALS OF C AND C++ 2 0 2 3
PROGRAMMING
1. To Learn and develop basics of C programming

2. To understand Object Oriented Programming concepts and basic characteristics of C++.
Course
3. Be familiar with the constructors and operator overloading.
Objective
4. To understand the concepts of inheritance, polymorphism and virtual function
5. To learn and define concept of templates and exception handling.
Instructional
Unit Description
Hours
BASICS OF ‘C’ PROGRAMMING
Fundamentals of ‘ C’ programming – Structure of a ‘C’ program – Constants -
Variables – Data Types – Expressions using operators in ‘C’ – Managing Input
and Output operations-Branching and Looping - Arrays – One dimensional and
I Two dimensional arrays. 3+6(P)
Programs: 1. Write a C program to calculate sum of individual digits of a given
number. 2. Write a C program to count no. of positive numbers, negative numbers
and zeros in the array. 3. Write a C program to find sum of two numbers using
functions with arguments and without return type.
BASICS OF ‘C++’ PROGRAMMING
Introduction to C++ – structures and unions- Object oriented programming
concepts–Defining a Class – creating objects - access specifiers – Function in C++
- function and data members default arguments – function overloading – Inline
functions - friend functions – constant with class – static member of a class – nested
II 6+3(P)
classes – local classes.
Program: Write a C++ program to accept the student detail such as name and 3
differentmarks by get_data() method and display the name and average of marks
using display() method. Define a friend class for calculating the average of marks
using the method mark_avg().
CONSTRUCTOR AND OPERATOR OVERLOADING
Constructors - Default, Copy, Parameterized, Dynamic constructors, Default
argument – Destructor. - Function overloading- Operator overloading-Unary, Binary
III - Binary operators using friend function. 7+2(P)
Program: Write a C++ program to calculate the volume of different geometric
shapes like cube, cylinder and sphere and hence implement the concept of Function
Overloading.
INHERITANCE AND POLYMORPHISM
Inheritance – Public, Private and Protected derivations– Single– Multiple–
Multilevel– Hybrid– Hierarchical - Virtual base class – abstract class – composite
objects- Runtime polymorphism – virtual functions – pure virtual functions.
Program: Demonstrate Simple Inheritance concept by creating a base class
IV FATHER with data members SurName and BankBalance and creating a derived 7+2(P)
class SON, which inherits SurName and BankBalance feature from base class but
provides its own feature FirstName and DOB. Create and initialize F1 andS1
objects with appropriate constructors and display the Father & Son details. (Hint :
While creating S1 object, call Father base class parameterized constructor through
derived class by sending values).
TEMPLATES AND EXCEPTION HANDLING
V Function and class templates - Exception handling – try-catch-throw paradigm – 7+2(P)
exception specification – terminate and Unexpected functions – Uncaught exception.
Page | 58
Program: Write a C++ program to create a template function for Bubble Sort and
demonstrate sorting of integers and doubles.
Total Instructional Hours 45(30+15)
CO1:Able to develop simple applications in C using basic constructs.

CO2:Able to apply solutions to real world problems using basic characteristics of C++.
Course CO3:Able to write object-oriented programs using operator overloading, constructors and destructors.
Outcome CO4:Able to develop programs with the concepts of inheritance and polymorphism.
CO5:Able to understand and define solutions with C++ advanced features such as templates and exception
handling.
TEXT BOOKS:
T1:E.Balagurusamy, “Programming in ANSI C”, 7th Edition, McGraw HillPublication, 2016.
T2:E.Balagurusamy, “Object Oriented Programming with C++”, 7th Edition, McGraw Hill Publication, 2017.
REFERENCE BOOKS:
R1:Yashavant P. Kanetkar. “Let Us C”, BPB Publications, 2011.
R2:RohitKhurana, “Object Oriented Programming with C++”,Vikas Publishing, 2 nd Edition, 2016.
R3: B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2007.
Page | 59

BE 19ME2154 ENGINEERING GRAPHICS 1 0 4 3
1. To gain the knowledge of Engineer’s language of expressing complete details about

objects and construction of conics and special curves.
Course 2. To learn about the orthogonal projections of straight lines and planes.
Objective 3. To aquire the knowledge of projections of simple solid objects in plan and elevation.
4. To learn about the projection of sections of solids and development of surfaces.
5. To study the isometric projections of different objects.
Instructional
Unit Description
Hours
PLANE CURVES
Importance of engineering drawing; drafting instruments; drawing sheets – layout
and folding; Lettering and dimensioning, BIS standards, scales.
I 12
Geometrical constructions, Engineering Curves Conic sections – Construction of
ellipse, parabola and hyperbola by eccentricity method. Construction of cycloids and
involutes of square and circle – Drawing of tangents and normal to the above curves.
PROJECTIONS OF POINTS, LINES AND PLANE SURFACES
Introduction to Orthographic projections- Projection of points. Projection of straight
lines inclined to both the planes, Determination of true lengths and true inclinations
II 12
by rotating line method.
Projection of planes (polygonal and circular surfaces) inclined to both the planes by
rotating object method (First angle projections only).
PROJECTIONS OF SOLIDS
III Projection of simple solids like prisms, pyramids, cylinder and cone when the axis is 12
perpendicular and inclined to one plane by rotating object method.
SECTION OF SOLIDS AND DEVELOPMENT OF SURFACES
Sectioning of simple solids with their axis in vertical position when the cutting plane
is inclined to one of the principal planes and perpendicular to the other – Obtaining
IV 12
true shape of section.
Development of lateral surfaces of simple and sectioned solids – Prisms, pyramids,
cylinder and cone. Development of lateral surfaces of truncated solids.
ISOMETRIC AND ORTHOGRAPHIC PROJECTIONS
Isometric views and projections simple and truncated solids such as - Prisms,
pyramids, cylinders, cones- combination of two solid objects in simple vertical
V 12
positions.
Free hand sketching of multiple views from a pictorial drawing. Basics of drafting
using AutoCAD software.
COURSE OUTCOMES:
CO1: Understand and interpret the engineering drawings in order to visualize the objects and draw the
conics and special curves.
CO2: Draw the orthogonal projections of straight lines and planes.
CO3: Interpret the projections of simple solid objects in plan and elevation.
CO4: Draw the projections of section of solids and development of surfaces of solids.
CO5: Draw the isometric projections and the perspective views of different objects.
Page | 60
TEXT BOOK:
1. K.Venugopal, V.Prabu Raja, “Engineering Drawing, AutoCAD, Building Drawings”, 5 thedition New
Age International Publishers, New delhi 2016.
2. K.V.Natarajan, “A textbook of Engineering Graphics”, Dhanlaksmi Publishers, Chennai.
REFERENCES:
1. Basant Agrawal and C.M.Agrawal, “Engineering Drawing”, Tata McGraw Hill Publishing company
Limited,New Delhi 2008.
2. N.S. Parthasarathy, Vela Murali, “Engineering Drawing”, Oxford University PRESS, India 2015.
Page | 61

BE 19ME2001 ENGINEERING PRACTICES 0 0 4 2
OBJECTIVES:
To provide exposure to the students with hands on experience on various basic engineering practices in
Civil, Mechanical and Electrical Engineering.
GROUP A (CIVIL & MECHANICAL)

S.No Description of the Experiments
CIVIL AND MECHANICAL ENGINEERING PRACTICES
Preparation of Single pipe line and Double pipe line connection by using valves, taps, couplings, unions,
1
reducers and elbows.
Arrangement of bricks using English bond for 1brick thick wall and 11/2 brick thick wall for right angle
2
corner junction.
3 Arrangement of bricks using English bond for 1brick thick wall and 11/2 brick thick wall for T junction.
4 Preparation of arc welding of Butt joints, Lap joints and Tee joints.
5 Practice on sheet metal Models– Trays and funnels
6 Hands-on-exercise in wood work, joints by sawing, planning and cutting.
7 Practice on simple step turning, taper turning and drilling.
8 Demonstration on Smithy operation.
9 Demonstration on Foundry operation.
10 Demonstration on Power tools.
GROUP B (ELECTRICAL)
S.No Description of the Experiments
ELECTRICAL ENGINEERING PRACTICES
1 Residential house wiring using switches, fuse, indicator, lamp and energy meter.
2 Fluorescent lamp wiring.
3 Stair case wiring.
4 Measurement of Electrical quantities – voltage, current, power & power factor in single phase circuits.
5 Measurement of energy using single phase energy meter.
6 Soldering practice using general purpose PCB.
Measurement of Time, Frequency and Peak Value of an Alternating Quantity using CRO and Function
7
Generator.
8 Study of Energy Efficient Equipment’s and Measuring Instruments.
Total Practical Hours 45
Page | 62
COURSE OUTCOME:
At the end of the course the students shall be able to
CO1: Fabricate wooden components and pipe connections including plumbing works.
CO2: Fabricate simple weld joints.
CO3: Fabricate different electrical wiring circuits and understand the AC Circuits.
Page | 63

BE 19MA3104 DISCRETE MATHEMATICS AND GRAPH THEORY 3 1 0 4
1. Illustrate logical theory and proportional calculus techniques that will create logical thinking.
2. Generate counting problems using mathematical induction, inclusion and exclusion principles.
Course
3. Examine the Boolean algebra which is used in the Boolean logics and circuits.
Objectives
4. Describe the basic knowledge of graph theory which is applied in Computer networks.
5. Recognize the concepts of trees in computer engineering.
Instructional
Unit Description
Hours
MATHEMATICAL LOGIC
I Propositional logic - Tautology and Contradiction - Propositional equivalences - Normal forms 12
- Principal normal forms - Theory of Inference.
COMBINATORICS
II Mathematical induction – Recurrence relations – Solving linear recurrence relations - 12
generating functions – principle of inclusion and exclusion – applications.
LATTICES AND BOOLEAN ALGEBRA

III Lattices – Properties of lattices – Lattices as algebraic system – Sub lattices - some special 12
lattices – Boolean algebra – Definition and simple properties.
GRAPHS
Graphs – introduction – types of graphs – matrix representation of graphs – paths, cycles
IV connectivity – connectedness in undirected graphs – Euler and Hamiltonian graphs – 12
connectedness in directed graphs.
TREES
V Trees – properties of trees –spanning tree – minimum spanning tree – Rooted and binary trees – 12
properties of binary trees - spanning trees in a weighted graph.
CO1: Evaluate the notion of mathematical thinking, mathematical proofs, and algorithmic
thinking
and be able to apply them in problem solving.
Course CO2: Solve problems using counting techniques and recurrence relations.
Outcome
CO3: Understand the knowledge about Lattices and Boolean Algebra.
CO4: Apply the properties of graphs and related discrete structures in computer networks.
CO5: Analyze the various types of trees and their properties.
TEXT BOOKS:
T1 - Discrete Mathematics with proof-Eric Gossett-2nd Edition 2018.
T2- Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, Fifth Edition,
Pearson Education Asia, Delhi, 2016.
Page | 64
REFERENCE BOOKS :
R1 - T.Veerarajan, “Discrete Mathematics with Graph Theory and Combinatorics”, Tata. McGraw-Hill Education,
15th reprint, 2012
R2 - Kenneth H.Rosen, “Discrete Mathematics and its Applications”, seventh Edition, Tata McGraw Hill Pub.
Co. Ltd., New Delhi, 2013.
R3 - Thomas Koshy., “Discrete Mathematics with Applications”, Elsevier Publications,2010.
Page | 65

BE 19CS3201 DATA STRUCTURES 3 0 0 3
1. Understand the fundamental concepts of Programming such as Pointers, Structures and

union.
2. Understand the concept of various linear data structures like list, stack and queue.
Course
3. Understand the various non-linear data structures like binary tree, binary search tree, AVL,
Objective
splay tree and red black tree.
4. Understand the concepts of Sorting, Searching and Hashing techniques
5. Understand graph algorithms such as shortest path and minimum spanning tree
Instructional
Unit Description
Hours
FUNDAMENTAL CONCEPTS OF PROGRAMMING
Pointers – Definition – Initialization – Pointers arithmetic. Structures and unions –
I definition – Structure within a structure – Union – Programs using structures and 7
Unions – Storage classes, Pre-processor directives.
BASIC DATA STRUCTURES
List ADT-Single Linked List-Doubly Linked List-Circular Linked List-Polynomial
Addition. Stack ADT-Array Based Implementation-Linked List Implementation-
II Applications of Stack-Infix to Postfix Conversion, Postfix Evaluation, Matching 10
Parentheses. Queue ADT- Array Based Implementation-Linked List
Implementation-Double Ended Queue.
TREES
III Tree ADT-Binary Tree-Tree Traversal Algorithms-Search Tree: Binary Search 9
Tree-AVL Tree-Splay Tree-B+ trees-Red-Black Tree. Priority Queues- Binary Heap
SORTING AND SEARCHING
Sorting Algorithms-Insertion Sort, Bubble Sort, Selection Sort, Radix sort– Shell
IV Sort-Merge Sort-Quick Sort- Searching Algorithm: Linear Search-Binary Search. 9
Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing –
Extendible Hashing.
GRAPHS
Graph ADT- Representation of Graphs-Graph Traversals-Topological Sort- Shortest
V Paths- Dijkstra’s Algorithm-Network Flow Problem- Minimum Spanning Trees- 10
Prims-Algorithm- Kruskal’s Algorithm- Applications of Depth-First Search-
Biconnectivity-Euler Circuits. Introduction to NP-Completeness.
CO1: Develop applications in C using pointers, structures and unions.
CO2: Acquire knowledge the most common abstractions for data collections
Course
(e.g., stacks, queues, lists).
Outcome
CO3: Use non linear data structures such as trees to solve problems. .
CO4: Apply Algorithms for solving problems like sorting and searching.
CO5: Apply Graph algorithms to find the shortest path cost.
Page | 66
TEXT BOOKS:
T1: Reema Thareja, ―Programming in C, Oxford University Press, Second Edition, 2016.
T2: Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education, 1997.
REFERENCE BOOKS:
R1: Aaron M. Tenenbaum, Yeedidyah Langsam, Moshe J. Augenstein, ‘Data structures using C’, Pearson
Education, 2008.
R2: Stephen G. Kochan, “Programming in C”, Fourth edition, Pearson Education, 2015.
R3: Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second
Edition, University Press, 2008
Page | 67
Programme Course Code Name of the Course L P T C

BE 19CS3202 DATABASE MANAGEMENT SYSTEMS 3 0 0 3
1. To understand the role of data, files and databases in information systems and learn the
fundamentals of data models
2. To study SQL and relational database design
Course
3. To represent ER diagram for any customized applications
Objective
4. To understand various normal forms
5. To understand the fundamental concepts of transaction processing, concurrency control
techniques and recovery procedures
Instructional
Unit Description
Hours
INTRODUCTION TO DATABASE SYSTEMS
Introduction to database system, Characteristics of the Database Approach,
I Advantages of using the DBMS Approach, History of Database Applications. 8
Data Models, Schemas, and Instances, Three-Schema Architecture and Data
Independence, Database Languages
RELATIONAL DATABASE
Structure of Relational Databases, Database Schema, Keys, Relational Query
Languages, The Relational Algebra
II Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, 10
Basic Structure of SQL Queries, Additional Basic Operations, Set Operations, Null
Values, Aggregate Functions, Nested Subqueries
Join, Views, Integrity Constraints, Triggers
CONCEPTUAL DATA MODELING
Using High-Level Conceptual Data Models for Database Design, Entity Types,
Entity Sets, Attributes, and Keys, Relationship Types, Relationship Sets, Roles,
III 9
Weak Entity Types, ER Diagrams, Naming Conventions, and Design Issues, The
Enhanced Entity–Relationship (EER) Model: Subclasses, Superclasses, and
Inheritance, Specialization and Generalization.
NORMALIZATION THEORY
Functional Dependencies, Normal Forms Based on Primary Keys, Boyce-Codd
IV 9
Normal Form, Multivalued Dependency and Fourth Normal Form, Join
Dependencies and Fifth Normal Form
TRANSACTION MANAGEMENT
Transactions: Transaction Concept, A Simple Transaction Model, Transaction
Atomicity and Durability, Transaction Isolation, Serializability, Transaction
V Isolation and Atomicity 9
Concurrency Control: Lock-Based Protocols, Deadlock Handling, Multiple
Granularity
Recovery System: Failure Classification, Recovery Algorithm
CO1: Understand the functional components of DBMS and datamodels

CO2: Able to write SQL queries
Course CO3: Analyze a system and design ER diagram and Relational Schema
Outcome CO4: Able to perform normalization and write queries using normalization criteria
CO5: Illustrate the concepts for transaction processing, concurrency control and recovery
procedures for RDBMS.
Page | 68
TEXT BOOKS:
T1: Ramez Elmasri and Shamkant B.Navathe, Fundamentals of Database Systems, Pearson Education,7th
edition, 2013 (UNIT I, III & IV)
T2: Abraham Silberschatz, Henry F.Korth and S.Sudarshan, Database System Concepts, Mc Graw Hill, 7th
edition, 2019. (UNIT II, V)
REFERENCE BOOKS:
R1: Raghu Rama Krishnan, Database Management Systems, Tata Mcgraw Hill,6th edition,2010.
R2: Carlos Coronel and Steven Morris, Database System Design and Implementation, Cengage Learning, 11th
edition, 2013.
Page | 69

BE 19CS3203 COMPUTER ARCHITECTURE 3 0 0 3
1. To conceptualize the basic structure and operations of a digital computer.

2. To study the design of arithmetic and logic unit and implementation of fixed-point and
floating-point arithmetic operations.
Course
3. To understand the basic design principles of Pipelining for CPU performance improvement.
Objective
4. To develop a deeper understanding of parallel processors and multi-core processors.
5. To familiarize the concepts of hierarchical memory system, cache memories, virtual
memories, I/O Communication, Interrupts and Standard Interfaces.
Instructional
Unit Description
Hours
BASIC STRUCTURE OF A COMPUTER SYSTEM
Functional Units –Basic Operational Concepts-Performance – Instructions:
I 9
Language of the Computer – Operations, Operands – Representing Instructions–
Logical operations – Decision making – MIPS Addressing.
ARITHMETIC FOR COMPUTERS
II Addition and Subtraction – Multiplication – Division – Floating Point- Floating 8
Point Representation – Floating Point Operations – Subword Parallelism
PROCESSOR AND CONTROL UNIT
Basic MIPS implementation – Building Datapath – Control Implementation Scheme
III 10
– Pipelining –Pipelined Datapath and Control – Handling Data hazards & Control
hazards – Exceptions
PARALLEL PROCESSORS
The Difficulty of Creating Parallel Processing Programs – Flynn’s Classification-
SISD, MIMD, SIMD, SPMD, and Vector Architectures - Hardware multithreading –
IV 9
Multi-core processors and other Shared Memory Multiprocessors - Introduction to
Graphics Processing Units, Clusters, Warehouse Scale Computers and other
Message-Passing
MEMORY AND I/O SYSTEMS
Memory Hierarchy - Memory Technologies – Cache Memory – Measuring and
V Improving Cache Performance – Virtual Memory, TLB‘s – Accessing I/O Devices – 9
Interrupts – Direct Memory Access – Bus Structure – Bus Operation – Arbitration –
Interface Circuits - USB
CO1: Understand the basics structure of computers, operations and instructions

CO2: Practice the arithmetic operations performed by ALU.
Course
CO3: Design and analyze pipeline for consistent execution of instructions with hazards.
Outcome
CO4: Explain the structure of parallel processing architectures
CO5: Demonstrate knowledge about state-of-the-art I/O, memory , Interrupts and Interfaces
TEXT BOOKS:
T1: David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/Software
Interface, Fifth Edition, Morgan Kaufmann / Elsevier, 2014.
T2: Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, Computer Organization and
Embedded Systems, fifth Edition, Tata McGraw Hill, 2014
Page | 70
REFERENCE BOOKS:
R1: William Stallings, Computer Organization and Architecture – Designing for Performance, tenth Edition,
Pearson Education, 2016.
R2: John P. Hayes, Computer Architecture and Organization, Third Edition, Tata McGraw Hill, 2017 Paperback
version.
R3: John L. Hennessey and David A. Patterson, Computer Architecture – A Quantitative Approach, Morgan
Kaufmann / Elsevier Publishers, Sixth Edition, 2019 Paperback version.
Page | 71

BTECH 19CS3251 DIGITAL PRINCIPLES AND SYSTEM DESIGN 3 0 2 4
(Common to CSE and IT)
1. To understand different methods used for the simplification of Boolean functions.
2. To study combinational circuits.
Course
3. To learn synchronous sequential circuits.
Objective
4. To understand asynchronous sequential circuits.
5. To study the fundamentals of HDL.
Instructional
Unit Description
Hours
MINIMIZATION TECHNIQUES
Number systems: Decimal,Binary,Octal,Hexadecimal-Number-Base conversion-
Complements of Numbers: 1’s and 2’s complements- Boolean algebra and laws-De-
I Morgan’s Theorem-Principle of Duality-Minimization of Boolean expressions – 10
Minterm – Maxterm – Sum of Products (SOP) – Product of Sums (POS) – Karnaugh
map Minimization – Don’t care conditions (2variable,3variable&4-variable)-
Tabulation method.
COMBINATIONAL CIRCUITS
Circuits for arithmetic operations: adder: Half adder, Full adder, subtractor: Half
subtractor, Fullsubtractor-BCD adder-Magnitude comparator-Encoders, Decoders-
Multiplexers, Demultiplexers, Code converters: Binary to Gray, Gray to Binary
II 1. Experimental Design and implementation of Half Adder & Half Subtractor. 9+6(P)
2. Experimental Design and implementation of Binary to Gray and Gray to Binary
Conversion.
3. Experimental Design and implementation of Multiplexers and Demultiplexers
SYNCHRONOUS SEQUENTIAL CIRCUITS
Flip flops:SR,JK,D,T - Design of synchronous sequential circuits: State diagram - State
table – State minimization - State assignment. Shift registers:SISO,SIPO,PIPO,PISO –
III 9+4(P)
Counters:BCD,Up down counter.
Experimental Design and implementation of Synchronous and Asynchronous
Counters
ASYNCHRONOUS SEQUENTIAL CIRCUITS
IV Analysisanddesignofasynchronoussequentialcircuits-Reductionofstateandflow tables– 9
Race-freestateassignment–Hazards.
HARDWARE DESCRIPTION LANGUAGE
IntroductiontoHardwareDescriptionLanguage (HDL)- HDLfor combinational circuits-
V Half adder, Full adder, Multiplexer, De-multiplexer, HDLfor Sequential Circuits- Flip 9+4(P)
flops, Synchronous and Asynchronous Counters, Registers.
1.Coding Combinational/Sequential circuits using HDL
TEXT BOOKS:
T1 Morris Mano M. and Michael D. Ciletti, “Digital Design with an Introduction to the Verilog HDL”, V
Edition, Pearson Education, 2013.ISBN-13: 978-0-13-277420-8
Page | 72
REFERENCE BOOKS :
R1-.S. Salivahanan and S. Arivazhagan, “Digital Circuits and Design”,FourthEdition, Vikas Publishing House
Pvt. Ltd, New Delhi, 2012.ISBN: 978-93-259-6041-1
R2-.Thomas L. Floyd, “Digital Fundamentals”, Pearson Education, Inc, New Delhi, 2013
Page | 73

BE 19CS3001 DATA STRUCTURES LABORATORY 0 0 3 1.5
1. To learn the methodical way of solving problem.

Course
2. To comprehend the different methods of organizing large amount of data.
Objective
3. To efficiently implement the different data structures.
S. No. Description Of The Experiments
a) Singly linked list
1
b) Doubly linked list
a) Implementation of Stack using linked list.
2
b) Implementation of Queue using linked list.
a) Infix expression into its postfix Equivalent.
3
b) Implementation of deque using linked lists.
4 Binary search tree and traversal.

5 AVL tree.
6 Heaps using priority queue.
7 Hashing.
Implement the following sorting algorithms
8 a) Merge Sort
b) Quick Sort
Implementation of the following graph traversal algorithms:
9 a) Depth first traversal
b) Breadth first traversal
10 Minimum spanning tree using prim’s and kruskal’s algorithm.
Total Practical Hours: 45
CO1: Apply good programming design methods for program development.
Course
CO2: Apply the different data structures for implementing solutions to practical problems.
Outcome
CO3: Develop recursive programs using trees and graphs.
Page | 74

BE 19CS3002 DATABASE MANAGEMENT SYSTEMS 0 0 3 1.5
LABORATORY
1. To understand data definitions and data manipulation commands.

2. To learn the use of nested and join queries
Course
3. To understand views and constraints
Objective
4. To understand functions, procedures and procedural extensions of data bases
5. To understand design and implementation of typical database applications

Data Definition Commands, Data Manipulation Commands for inserting, deleting, updating
1
and retrieving Tables
2 Data Control and Transaction Control statements
3 Database Querying – Simple queries, Nested queries, Sub queries and Joins
4 Integrity Constraints
5 Views, Sequences, Synonyms
6 Database Programming: Implicit and Explicit Cursors
7 Procedures and Functions
8 Triggers
9 Exception Handling
10 Development of mini-projects with front end of your choice.

For the above experiments consider real time scenarios like
1. A new supermarket will be opened in 3 months. The owner wants to have a software to manage the
supermarket data (inventory, customers, sales,..). Design a database to insert, retrieve, update data. ex.
When a product is sold to a customer, the database changes may need to be done reducing the inventory.
Real world need for creating views. Provide different Users different roles for separate DB.
2. Design database for university which should include details about student, faculty, course, department.
Create, populate the database, perform updates and retrieval. Create views and triggers that does not allow
manipulation during holidays. Provide different privileges to different users.
CO1: Use typical data definitions and manipulation commands

CO2: Design applications to test Nested and Join Queries
Course
CO3: Implement simple applications that use Views
Outcome
CO4: Critically analyze the use of Tables, Views, Functions and Procedures
CO5: Implement applications that require a Front-end Tool
Page | 75

BE 19AC3191 CONSTITUTION OF INDIA 2 0 0 0
1. Sensitization of student towards self, family (relationship), society and nature.

2. Understanding (or developing clarity) of nature, society and larger systems, on the basis
Course of human relationships and resolved individuals.
Objective 3. Strengthening of self reflection.
4. Development of commitment and courage to act.
Instructional
Unit Description
Hours
BASIC FEATURES AND FUNDAMENTALE PRINCIPLES

Meaning of the constitution law and constitutionalism – Historical perspective of
I
the constitution of India – salient features and characteristics of the constitution of 4
India.
FUNDAMENTAL RIGHTS
Scheme of the fundamental rights – fundamental duties and its legislative status –
II The directive principles of state policy – its importance and implementation -
4
Federal structure and distribution of legislative and financial powers between the
union and states.
PARLIAMENTARY FORM OF GOVERNMENT

The constitution powers and the status of the president in India. – Amendement of
III the constitutional powers and procedures – The historical perspective of the
4
constitutional amendment of India – Emergency provisions : National emergency,
President rule, Financial emergency.
LOCAL GOVERNANCE
Local self government -constitutional scheme of India – Scheme of fundamental
IV
right to equality – scheme of fundamental right to certain freedom under article19 – 4
scope of the right to life and personal liberty under article 21.
INDIAN SOCIETY
V Constitutional Remedies for citizens – Political Parties and Pressure Groups; Right
4
of Women, Children and Scheduled Castes and Scheduled Tribes and other Weaker
Sections.
Course CO1: Understand the functions of the Indian government.

Outcome CO2: Understand and abide the rules of the Indian constitution.
TEXT BOOKS:
T1: Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of India, New Delhi.
T2: R.C.Agarwal, (1997) “Indian Political System”, S.Chand and Company, New Delhi.
Page | 76
T3: Maciver and Page(1997), “ Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi.
T4: K.L.Sharma, (1997) “Social Stratification in India: Issues and Themes”, Jawaharlal
Nehru University, New Delhi.
REFERENCE BOOKS:
R1: Sharma, Brij Kishore, “ Introduction to the Constitution of India:, Prentice Hall of India, New Delhi.
R2: U.R.Gahai, “Indian Political System “, New Academic Publishing House, Jalaendhar.
R3: R.N. Sharma, “Indian Social Problems “, Media Promoters and Publishers Pvt. Ltd.
Dr Shankar S Dr Karunakarn K
Page | 77
BE 19CS4201 JAVA PROGRAMMING 3 0 0 3
1. Learn the basics of java programming language

2. Discuss the packages and interfaces in java programming
Course
3. Learn IO streams and multithreading in java
Objective
4. Learn generics and collections framework in java
5. Understand event handling and swing in java
Instructional
Unit Description
Hours
INTRODUCTION
Review of Object oriented programming-Introduction to java programming-
Features of Java Language, JVM -The Java Environment-Primitive Data
I types-variables-arrays-control statements-classes and objects-access 9
specifier-methods-constructor-finalize method-strings-Inheritance – class
hierarchy – polymorphism – dynamic binding – final keyword – abstract
classes.
INTERFACES AND PACKAGES
Interfaces-Defining an interface-implementing an interface-applying
interface-variables in interface-extended interface-- Packages-defining
II 9
package-access protection-importing packages -Exception Handling-
exception types-uncaught exception-multiple catch-nested try-throw and
finally-built-in exceptions-user defined exception.
IO STREAMS AND MULTITHREAD
I/O basics-reading console input-writing console output-reading and writing
III files-Serialization- Multithreaded programming-java thread model-thread 9
priorities-synchronization-thread class and runnable interface-creating
multiple threads- inter thread communication.
GENERICS AND COLLECTIONS FRAMEWORK
Generics- simple Generic example-Generic class with parameters-The
IV General Form of a Generic Class-Bounded Types-Creating Generic method- 9
Generic interfaces- Generic class hierarchies-Generic restrictions. Collections
overview-interfaces-classes-an iterator.
EVENT HANDLING AND SWING
Window fundamentals-layout managers-working with 2D shapes-Using
color, fonts and images-The Delegation Event Model-Event Classes-The
ActionEvent Class-The AdjustmentEvent Class-The ComponentEvent Class-
-The KeyEvent Class- The MouseEvent Class -Event Listener Interfaces-The
V 9
ActionListener Interface-The AdjustmentListener Interface-The
ComponentListener Interface- The KeyListener Interface - The
MouseListener Interface- The MouseMotionListener Interface -Introduction
to Swing-Swing components-Text Fields, Text Areas-Buttons-Check Boxes-
Radio Buttons-Lists-Choices-Scrollbars-windows-Menus-Dialog Boxes.
Page | 78
Upon completion of this course, the students will be able to
CO1: To Understand the Basics of java Programming
Course CO2: Design program using user defined packages and interfaces
Outcome CO3: Develop applications using multithreading concepts in java
CO4: Design real time applications using generics and collection frameworks.
CO5: Apply event handling classes and swing concepts to create different applications in java
TEXT BOOKS:
T1 Herbert Schildt, “The complete reference java 2”, 11th edition, McGraw – Hill 2019.
T2 “Core Java 2”,Vol 2,Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh Edition, Pearson
Education.
REFERENCE BOOKS :
R1 - E.Balagurusamy,”Programming with java A Primer”, fifth edition, McGraw – Hill 2014.
R2 - H.M.Deitel, P.J.Deitel, "Java: how to program", Eleventh edition, Prentice Hall of India private limited,
2017.
Page | 79

BE 19CS4202 SOFTWARE ENGINEERING 3 1 0 4
1. Compare different process models.

2.Concepts of requirements engineering and Analysis Modeling.
Course 3. Apply systematic procedure for software design and deployment.
Objective 4.Compare and contrast the various testing and maintenance.
5. Manage project schedule, estimate project cost and effort required.
Instructional
Unit Description
Hours
SOFTWARE PROCESS AND AGILE DEVELOPMENT
Introduction to Software Engineering-Definitions of Software Engineering-
The Serial or Linear Sequential Development Model -Iterative Development
Model-The incremental Development Model-The Parallel or Concurrent
I Development Model-Software Process, Perspective and Specialized Process 12
Models –Introduction to Agility-Agile process-Extreme programming-XP
Process.-Introduction and Evolving Role of Software- Software
Characteristics-Software Applications.
REQUIREMENTS ANALYSIS AND SPECIFICATION

Software Requirements: Functional and Non-Functional, User requirements,
System requirements, Software Requirements Document – Requirement
II Engineering Process: Feasibility Studies, Requirements elicitation and 12
analysis, requirements validation, requirements management- Classical
analysis: Structured system Analysis, Petri Nets- Data Dictionary.
SOFTWARE DESIGN
Design process – Design Concepts-Design Model– Design Heuristic –
Architectural Design - Architectural styles, Architectural Design,
III Architectural Mapping using Data Flow- User Interface Design: Interface 12
analysis, Interface Design –Component level Design: Designing Class based
components, traditional Components.
TESTING AND MAINTENANCE

Software testing fundamentals-Internal and external views of Testing-white
box testing - basis path testing-control structure testing-black box testing-
Regression Testing – Unit Testing – Integration Testing – Validation Testing –
IV 12
System Testing And Debugging –Software Implementation Techniques:
Coding practices-Refactoring-Maintenance and Reengineering-BPR model-
Reengineering process model-Reverse and Forward Engineering.
PROJECT MANAGEMENT
Software Project Management: Estimation – LOC, FP Based Estimation,
Make/Buy Decision COCOMO I & II Model – Project Scheduling –
V Scheduling, Earned Value Analysis Planning – Project Plan, Planning Process, 12
RFP Risk Management – Identification, Projection - Risk Management-Risk
Identification-RMMM Plan-CASE TOOLS
.
Page | 80
CO1: Compare different process models.

Course CO2: Concepts of requirements engineering and Analysis Modeling.
Outcome CO3: Apply systematic procedure for software design and deployment.
CO4: Compare and contrast the various testing and maintenance.
CO5: Manage project schedule, estimate project cost and effort required.
TEXT BOOKS:
T1 Ian Sommerville, “Software Engineering”, 9th Edition, Pearson Education Asia, 2011
T2 Roger S. Pressman, ―Software Engineering – A Practitioner‟s Approach‖, Seventh Edition, Mc Graw-Hill
International Edition, 2010.
REFERENCE BOOKS:
R1: Rajib Mall, ―Fundamentals of Software Engineering‖, Third Edition, PHI Learning PrivateLimited, 2009.
R2: Pankaj Jalote, ―Software Engineering, A Precise Approach‖, Wiley India, 2010.
R3: Kelkar S.A., ―Software Engineering‖, Prentice Hall of India Pvt Ltd, 2007.
R4: Stephen R.Schach, ―Software Engineering‖, Tata McGraw-Hill Publishing Company Limited,2007.
Page | 81

BE 19CS4203 OPERATING SYSTEMS 3 0 0 3
1. Study the basic concepts and Understand the structure of operating systems
2. Learn about Processes, Scheduling algorithms and Deadlocks.
Course
3. Learn various memory management schemes.
Objective
4. Study I/O management and File systems.
5. Learn the Distributed operating systems
Instructional
Unit Description
Hours
OPERATING SYSTEMS OVERVIEW
Computer System Overview - Basic Elements, Instruction Execution, Interrupts-
operating systems overview- Evolution of Operating System.- Computer System
I Organization-Operating System Structure and Operations- System Calls, System 7
Programs, OS Generation and System Boot
PROCESS MANAGEMENT
Processes-Process Concept, Process Scheduling, Interprocess Communication; CPU
Scheduling - Scheduling criteria, Scheduling algorithms, Threads Overview,
II Multicore Programming, Multithreading Models. Process Synchronization - Critical 11
Section Problem, Mutex Locks, Semaphores, Monitors; Deadlock-System model,
Deadlock-Prevention, Avoidance and Recovery.
STORAGE MANAGEMENT
Memory Hierarchy, Cache Memory, Main Memory-Swapping-Contiguous Memory
III Allocation, Segmentation, Paging, Virtual Memory, Demand Paging, Page 9
Replacement, Allocation, Thrashing; Allocating Kernel Memory
FILE SYSTEM IMPLEMENTATION & MASS STORAGE STRUCTURE

Mass Storage Structure- Overview, Disk Structure, Disk Scheduling and
Management; File System Interface- File Concepts, Access methods, Directory
IV Structure, Organization and implementation, File System Structure - File System 9
Implementation-, File Sharing and Protection; Allocation Methods, Free Space
Management- I/O Systems.
TYPES OF OPERATING SYSTEMS

Single processor systems – Multiprocessor Systems – Clustered Systems – Real
V Time Systems – Open source operating system- Distributed Systems –Distributed 9
operating systems – Distributed file systems –Distributed Synchronization. Case
study: Linux Systems Virtualization.
CO1: Design various Scheduling algorithms.

CO2: Design deadlock, prevention and avoidance algorithms.
Course
CO3: Compare and contrast various memory management schemes.
Outcome
CO4: Design and Implement a prototype file systems.
CO5: Study the distributed operating systems.
Page | 82
TEXT BOOKS:
T1: Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 10 th Edition,
John Wiley and Sons Inc., 2018.
T2: Tom Adelstein, Bill Lubanovic , “Linux System Administration Solve Real-life Linux Problems
Quickly”, 2007, O'Reilly Media.
REFERENCE BOOKS:
R1: Andrew S. Tanenbaum, “Modern Operating Systems”, 4/E, Pearson Publications, Paperback 2019.
R2: Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill
Education”, 1996.
R3: D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Third Edition, TataMcGraw-
Hill Education, 2017.
R4:William Stallings, “Operating Systems –Internals and Design Principles”, 9/E, Pearson Publications,
2018.
Page | 83

B.E. 19MA4151 PROBABILITY, STATISTICS AND QUEUEING 3 0 2 4
THEORY
1. Construct a well defined knowledge of random variables.
2. Explain the concept of two dimensional random variables and determine covariance.
3 Illustrate the relation between two random variables by using correlation concepts along with R
Course
studio.
Objectives
4. Describe some basic concepts of statistical methods for testing the hypothesis together with R
studio.
5. Apply the basic characteristic features of a queuing system and analyze queuing models.
Instructional
Unit Description
Hours
PROBABILITY AND RANDOM VARIABLE
Random variable –Discrete and continuous random variables – Probability mass function -
Probability density function – Cumulative distribution functions - Moment generating
I functions. 9+3
Introduction to R programming and Application of descriptive statistics – Mean,
Median, Mode, variance and Box plot
TWO DIMENSIONAL RANDOM VARIABLES

Joint probability mass function - Joint probability density function – Marginal Probability
mass function – Marginal probability density function - Conditional Probability mass
II 9+3
function - Conditional Probability density function – Independent random variables.
Application of Normal distribution
CORRELATION AND REGRESSION

Correlation – Karl Pearson’s correlation coefficient – Spearman’s Rank Correlation –
III Regression lines (problems based on Raw data only).Applications of Correlation and 9+3
Regression
HYPOTHESIS TESTING
Large sample test based on Normal distribution – test of significance for single mean and
difference of means - Small sample test – t test for single mean and difference of mean - F
distribution for variance, Chi – Square test for independence of attributes – Goodness of
IV 9+6
fit.
Application of Student t- test for Single mean and difference of means
Application of Chi – square test
QUEUEING THEORY
V Markovian models: Single and Multiple server queueing models (Excluding proof) – 9
(M/M/1):(∞/FCFS), (M/M/1):(N/FCFS), (M/M/C):(∞/FCFS) and (M/M/C):(N/FCFS).
Total Instructional Hours 45+15
60
Total(45+15)
CO1: Understand the concepts of random variables.
CO2: Express the phenomenon of two dimensional random variables..
Course CO3: Compute correlation and predict unknown values using regression together with R studio.
Outcomes CO4: Understand the concepts of statistical methods for testing the hypothesis along with R
studio.
CO5: Identify the queuing models in the given system, analyze the result.
Page | 84
TEXT BOOKS:
T1 - Gupta S. P, “Statistical Methods”, Sultan Chand & Sons Publishers, 2017.
T2 – Medhi J,” stochastic Processes”, New Age International Publishers,New Delhi,2014.
REFERENCE BOOKS:
R1- Applied statistics and Probability for Engineers by C.Mont Gomery ,6 th Edition,Wiley Publications.
R2 - A.O. Allen, “Probability, Statistics and Queueing Theory with Computer Applications”, Elsevier, Second
Edition, 2012.
R3 - Walpole R. E., Myers S.L. & Keying Ye, “Probability and Statistics for Engineers and Scientists”, Pearson
Education Inc, 9th edition, 2012.
Page | 85
Programme Course Code Name Of The Course L T P C
B.E 19CS4251 DESIGN AND ANALYSIS OF ALGORITHM 3 0 2 4
1. Learn the algorithm analysis techniques.

Course 2. Become familiar with the different algorithm design techniques
3. Learn greedy technique to solve problems
Objective
4. Understand backtracking and iterative development of algorithms
5. Understand the limitations of Algorithm power
Instructional
Unit Description
Hours
I ANALYSIS OF ALGORITHM 9
Introduction – Algorithms - Notion of an Algorithm – Fundamentals of Algorithmic
Problem Solving- Analysis Framework – Asymptotic Notations and its properties –
Mathematical analysis for Recursive and Non-recursive algorithms
II BRUTE FORCE AND DIVIDE ANDCONQUER 9+4(P)
Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling
Salesman Problem – Knapsack Problem – Assignment problem- Sequential Search and
String Matching - Divide and conquer methodology – Merge sort – Quick sort – Binary
search – Multiplication of Large Integers
Program: 1. Sort a given set of elements using the Quicksort method and determine the time
required to sort the elements. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus n. The elements can
be read from a file or can be generated using the random number generator.
2. Implement a parallelized Merge Sort algorithm to sort a given set of elements and
determine the time required to sort the elements. Repeat the experiment for different values of
n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.
The elements can be read from a file or can be generated using the random number
generator.
III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 10+6(P)
Computing a Binomial Coefficient – All Pairs Shortest Path Algorithm -Warshall’s and
Floyd’ algorithm – Multistage Graphs - Optimal Binary Search Trees – Knapsack Problem
and Memory functions - Greedy Technique– MST - Prim’s algorithm- Kruskal’s Algorithm-
Dijkstra’s Algorithm-Huffman Trees.
Program: 1. Implement 0/1 Knapsack problem using Dynamic Programming
2. Find a subset of a given set S = {s1, s2,.....,sn} of n positive integers whose sum is equal to
a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions
{1, 2, 6} and {1, 8}.A suitable message is to be displayed if the given problem instance
doesn't have a solution.
3. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this
algorithm, implement it determine the speed-up achieved.
IV ITERATIVE IMPROVEMENT 9
The Simplex Method-The Maximum-Flow Problem – maximum Matching in Bipartite
Graphs- The Stable marriage Problem.
V BACKTRACKING, BRANCH AND BOUND 9+4(P)
The General Method – 8-Queens Problem- Sum of Subsets – Graph Coloring- Hamiltonian
Cycle - Branch and Bound – Assignment problem – Knapsack Problem – Traveling
Salesman Problem- Decision Trees-P, NP and NP-Complete Problems Approximation
Algorithms for NP – Hard Problems.
Program: 1. Implement any scheme to find the optimal solution for the TravelingSales
Person problem and then solve the same problem instance usingany approximation
algorithm and determine the error in the approximation.
Page | 86
2. Implement N Queen's problem using Back Tracking.
TOTAL HOURS 60 (46+14)

Course CO1: Design algorithms for various computing problems
Outcome CO2: Analyze the time and space complexity of algorithms
CO3: Critically analyze the different algorithm design techniques for a given problem
CO4: Modify existing algorithms to improve efficiency
CO5: Apply algorithm techniques for real time applications
TEXT BOOKS:
T1- AnanyLevitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson
Education, 2012.
T2- Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
REFERENCE BOOKS:
R1 - Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
Education, Reprint 2006.
R2- Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009.
R3 - Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
Page | 87

BE 19CS4001 JAVA PROGRAMMING LAB 0 0 3 1.5
1. To practice implementing Object Oriented Concepts, Package creation in Java

using appropriate coding standards
Course 2. To explore inheritance, interface and exception handling techniques.
Objective 3. To practice multithread programming.
4. To practice writing generic programs and collection classes in Java.
5. To develop simple applications using Event handling and swing concepts.
S. No. Description of the Experiments
a. Simple JAVA program with the user input.
1. b. Concept of classes, objects, methods and constructor.
c. Method overriding.
a. Abstract classes.
2. b. Multi-Level Inheritance.
c. Multiple Inheritance using interfaces.
3. Packages with necessary exception handling mechanisms.
4. Illustrate multi threads.

5. Object serialization.
a. Create Generic number calculator using Java.
6.
b. Linked List implementation using collections
7. Employee details using collection. OR JAVA application program using collection.
8. Program to illustrate file I/O concept.
9. Program that handles all mouse events.

10. Program using swing.
Simple OPAC system for library using event-driven and concurrent programming paradigms
11.
with JDBC.
Total Practical Hours 45
Upon completion of this course, the students will be able to
CO1: Understand the basics of Java Programming
Course CO2: Design program using Inheritance, interface and exception handling techniques.
Outcome CO3: Develop applications using multithread programming.
CO4: Implement data structure concepts using Generic programs and collection classes.
CO5: Design real time applications using Event handling and Swing.
Page | 88
BE 19CS4002 OPERATING SYSTEMS LAB 0 0 3 1.5
1.Learn shell programming and the use of filters in the UNIX environment.
2. Be familiar with implementation of CPU Scheduling Algorithms and file allocation strategies.
Course
3. Gain knowledge in simulating page replacement algorithms.
Objective
4.Be familiar with inter process communication.
5. Learn to use the paging techniques in memory management.
1 Basics of UNIX commands.
2 Shell Programming.
3 Create new process to overlay an executable binary image on an existing process using fork and exec.
4 Simulate inter process communication between related processes using pipes.

Implement the following CPU scheduling algorithms
5
a.Round Robin b. SJF c. FCFS
6 Implement bankers Algorithm for Dead Lock Detection
7 Implement bankers Algorithm for Dead Lock Avoidance

8 Simulate the producer consumer problem/Dining philosopher problem using semaphore.
9 Simulate paging technique of memory management.
Simulate page replacement algorithms
10 a.FIFO b. LRU c. LFU
Implement all file allocation strategies
11
a.Sequential b. Indexed c. Linked
CO1: Apply the basic Unix commands and shell concepts in real time.
CO2: Compare the performance of various CPU Scheduling Algorithms and file allocation
Course strategies.
Outcome CO3: Create programs using system calls.
CO4: Analyze the performance of the various page replacement algorithms
CO5: Develop process synchronization using semaphore.
Page | 89

VALUE EDUCATION - Essence Of
B.E. / B.Tech 19AC4191 2 0 0 0
Indian Traditional Knowledge
Course Objectives:
1) The course aims at imparting basic principles of thought process, reasoning and inferencing.
2) Sustainability is at the core of Indian Traditional Knowledge Systems connecting society and nature.
3) Holistic life style of Yogic-science and wisdom capsules in Sanskrit literature are also important in
modern society with rapid technological advancements and societal disruptions.
4) The course focuses on introduction to Indian Knowledge System, Indian perspective of modern scientific
world-view, basic principles of Yoga and holistic health care system, Indian philosophical
traditions,Indian linguistic tradition and Indian artistic tradition.
UNIT DESCRIPTIVE INSTRUCTIONAL HOURS
I Basic Structure of Indian Knowledge System 4
II Modern Science and Indian Knowledge System 4
III Yoga and Holistic Health care 4
IV Philosophical tradition 4
V Indian linguistic tradition (Phonology, Morphology, Syntax and semantics),
Indian artistic tradition and Case Studies. 4
TOTAL INSTRUCTIONAL HOURS : 20
Course Outcomes:
1) Ability to understand the structure of Indian system of life.
2) Connect up and explain basics of Indian Traditional knowledge in modern scientific perspective.
REFERENCE BOOKS:
R1. V. Sivaramakrishna (Ed.), Cultural Heritage of India-Course Material, Bharatiya Vidya Bhavan,
Mumbai, 5th Edition, 2014
R2. Swami Jitatmanand, Modern Physics and Vedant, Bharatiya Vidya Bhavan
R3. Fritzof Capra, Tao of Physics
R4. Fritzof Capra, The wave of Life.
R5. V N Jha ( Eng. Trans,), Tarkasangraha of Annam Bhatta, Inernational Chinmay Foundation, Velliarnad,
Amaku,am
R6. Yoga Sutra of Patanjali, Ramakrishna Mission, Kolkatta.
R7. GN Jha ( Eng. Trans.) Ed. R N Jha, Yoga-darshanam with Vyasa Bhashya, Vidyanidhi Prakasham, Delhi,
2016.
Page | 90
R8. RN Jha, Science of Consciousness Psychotherapy and Yoga Practices, Vidyanidhi Prakasham, Delhi,
2016.
R9. P R Sharma ( English translation), Shodashang Hridayam.
Page | 91

BE 19CS5201 THEORY OF COMPUTING 3 1 0 4
1. To understand the basic concepts of automata theory and finite automaton

2. To extend the concepts of automata theory in regular languages and expressions
3. To study about context free grammars and the normalizations of CFG
Course
4. To learn the essence of push down automata with stack presentations and modeling
Objective
turing machines
5. To discover the knowledge in decidability and tractability and to study the complexity
classes
Instructional
Unit Description
Hours
Automata Theory
Introduction-Need of automata theory-Formal proof- Additional Forms of Proof-
Inductive Proofs-Central Concepts of Automata Theory-DFA and NDFA-Finite
I 12
Automaton with Є- Transitions-Equivalence of DFA and NFA-Applications of
Finite Automata.
Regular Expressions
Regular Languages-Regular Expressions-Equivalence of finite Automaton and
regular expressions-Minimization of DFA-Closure Properties and Decision
II 12
Properties of Regular Languages-Problems based on Pumping Lemma-Applications
of Regular Expressions.
Context Free Grammars

Chomsky hierarchy of languages-Context-Free Grammar (CFG)-Parse Trees-
Ambiguity in grammars and languages-Normal forms for CFG-Chomsky Normal
III 12
Form (CNF)-Greibach Normal Form (GNF)-Pumping Lemma for Context Free
Language (CFL)-Applications of Context Free Grammar.
PushDown Automata and Turing Machines

Definition of the Pushdown automata-Types of PDA-Languages of a Pushdown
IV Automata - Equivalence of Pushdown automata and CFG-Definitions of Turing 12
machines-Models-Computable languages and functions-Techniques for Turing
machine construction-Multi head and Multi tape Turing Machines.
Undecidability
The Halting problem – Partial Solvability- Undecidability- Decidable and
V undecidable problems- Basic Definition and properties of Recursive (RL) and 12
Recursively enumerable (REL) languages. Intractable Problems- the Class P and
NP-Introduction to NP-Hardness and NP-Completeness
CO1: Understand the theoretical concepts of automata and equivalence of automata

Course CO2: Remember the automata in applying to obtain regular expressions and languages
Outcome CO3: Apply the normalization in context free grammar to obtain optimized CFG
CO4: Understand PDA and turing machines and apply for making mathematical models
CO5: Understand the decidability and tractability problems and apply for developed models
P a g e | 92
TEXT BOOKS:
T1: Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and
Computations”, ThirdEdition, Pearson Education, 2016.
T2: John C Martin, “Introduction to Languages and the Theory of Computation”, Fourth Edition, Tata McGraw
Hill Publishing Company, New Delhi, 2011.
REFERENCE BOOKS:
R1: Mishra K L P and Chandrasekaran N, “Theory of Computer Science - Automata, Languages and
Computation”, Third Edition, Prentice Hall of India, 2016.
R2: Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of Computation”, Second Edition,
Prentice Hall of India, Pearson Education, New Delhi, 2015.
R3: Peter Linz, “An Introduction to Formal Language and Automata”, Sixth Edition, Jones & Bartlett Learning,
2016.
R4: Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory and
Computation”, Pearson Education 2009
P a g e | 93

BE 19CS5202 COMPUTER NETWORKS 3 0 0 3
(COMMON TO CSE & IT)
1. To study the Protocol Layering and Physical Level Communication.
2. To understand the Data Communication System and the purpose of Layered
Course Architecture.
Objective 3. To analyze the concepts of Routing Methods and Sub-netting.
4. To learn the functions of Network Layer and the various Routing Protocols.
5. To familiarize the functions and Protocols of the Transport Layer.
Instructional
Unit Description
hours
OVERVIEW & PHYSICAL LAYER
Networks – Network Types – Protocol Layering – TCP/IP Protocol suite – OSI Model –
I Physical Layer: Performance – Transmission Media – Switching – Circuit-switched Networks – 9
Packet Switching.
DATA LINK LAYER

Introduction – Link-Layer Addressing – DLC Services – Data-Link Layer Protocols – HDLC–
9
II PPP - Media Access Control - Wired LANs: Ethernet - Wireless LANs – Introduction –IEEE
802.11, Bluetooth – Connecting Devices.
NETWORK AND ROUTING

Network Layer Services – Packet switching – Performance – IPV4 Addresses – Forwarding of
III IP Packets - Network Layer Protocols: IP, ICMP v4 – Unicast Routing Algorithms –Protocols – 9
Multicasting Basics – IPV6 Addressing – IPV6 Protocol.
TRANSPORT LAYER
Process to process delivery, User datagram protocol (UDP), Transmission control
9
protocol (TCP), Data traffic, Congestion, Congestion control, Quality of service,
IV 9
Techniques to improve QOS, Integrated services, Differentiated services, QOS in
switched networks.
APPLICATION LAYER
Client server model, Socket interface, Name space, Domain name space, Distribution
of name space, DNS in the internet, Resolution, DNS messages, DDNS, Encapsulation,
V 9
Electronic mail, File transfer, HTTP, World wide web (WWW), Digitizing audio and
video, Audio and video compression, Streaming stored audio/video, Streaming live
audio/video, Real time interactive audio/video, Voice over IP.
Upon completion of this course, the Students will be able to

CO1: Learn about the Protocol Layering and Physical Level Communication
Course CO2: Understand the Data Communication System and the purpose of Layered Architecture.
Outcome CO3: Analyze the concepts of Routing Methods and Subnetting.
CO4: Design protocols for various functions in the Network.
CO5: Understand the functions and Protocols of the Transport Layer.
P a g e | 94
TEXT BOOK:
T1: Larry Peterson, Bruce Davie, “Computer Networks: A Systems Approach”, Elsevier, Online Edition, 2019.
T2: Paul Goransson, Chuck Black and Timothy Culver, “Software Defined Networks - A Comprehensive
Approach”, Elsevier, Second Edition, 2017.
REFERENCES:
R1: James F. Kurose, Keith W. Ross, “Computer Networking – A Top-Down Approach Featuring the Internet”,
Pearson Education, Seventh Edition, 2017.
R2: Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall Publishers, Second Edition,
2015.
R3: Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw – Hill, Fifth Edition, 2013.
R4: Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw
Hill Publishers, 2011.
P a g e | 95

BE 19EC5231 PRINCIPLES OF MICROPROCESSORS AND 3 0 0 3
MICRO CONTROLLERS
1. Study the Architecture of 8085 and 8086 microprocessor.
2. Learn the design aspects of I/O and Memory Interfacing circuits.
Course 3. Study about communication and bus interfacing.
Objective 4. Study the Architecture of 8051 microcontroller
5. Study the concepts of microcontroller interfacing
Instructional
Unit Description
Hours
8086 MICROPROCESSOR
Introduction to 8086 – Microprocessor architecture – Addressing modes -
I Instruction set – Assembly language programming – Modular Programming - 9
Interrupts and interrupt service routines. Case study: I5 and I7 processors
8086 SYSTEM BUS STRUCTURE

8086 signals – Basic configurations – System bus timing –System design
using 8086 – Introduction to Multiprogramming – Multiprocessor
II 9
configurations – Coprocessor, Closely coupled and loosely Coupled
configurations – Introduction to advanced processors.
I/O INTERFACING
Parallel communication interface – Serial communication interface –
III D/A and A/D Interface – Timer Interface – Keyboard /display controller 9
– Interrupt controller – DMA controller.
8051 MICROCONTROLLER
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins
IV Ports and Circuits – Instruction set - Addressing modes - Assembly 9
language programming.
PROGRAMMING/INTERFACING MICROCONTROLLER
Programming 8051 Timers - Serial Port Programming - Interrupts
V 9
Programming – LCD & Keyboard Interfacing - ADC, DAC & Sensor
Interfacing - External Memory Interface- Stepper Motor.
CO1: Design and implement programs on 8086 microprocessor.

Course CO2: Design I/O circuits.
Outcome CO3: Design Memory Interfacing circuits.
CO4: Design and implement 8051 microcontroller based systems.
CO5: Design various interfacing and its programming methodologies
TEXT BOOKS:
T1 Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family - Architecture,
Programming and Design”, Prentice Hall of India, 2011.
P a g e | 96
T2 Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and Embedded
Systems: Using Assembly and C”, Second Edition, Pearson education, 2011
REFERENCE BOOKS:
R1: Doughlas V.Hall, “Microprocessors and Interfacing, Programming and Hardware”,TMH,2012
R2: A.K.Ray,K.M.Bhurchandi,”Advanced Microprocessors and Peripherals”,3 rd Edition,Tata
McGrawHill,2012.
R3: Sunil Mathur and Jeebananda Panda,”Microprocessor and Microcontrollers”,PHI Learning Pvt Ltd,2016.
R4: R.S.Gaonkar,”Microprocessor Architecture Programming and Application”,with 8085,Wiley Eastern
LTD.,New Delhi,2013.
P a g e | 97

BE 19CS5251 DATA MINING 3 0 0 3
Course 1. To introduce students to the basic concepts and techniques of Data Mining.
Objective 2. To develop skills of using recent data mining software for solving practical problems.
3. To gain experience of doing independent study and research.
4. To learn the concepts of data processing.
5. To perform data mining tasks with relevant tools
Unit Description Instructional

Hours
I DATA MINING
Motivation -Steps in Data Mining – Architecture - Data Mining and Databases – Data
Warehouses – Data Mining functionalities – Classification – Data Mining Primitives – 9
Major issues. DATA PREPROCESSING: Descriptive data summarization -Data
Cleaning – Data integration and transformation – Data Reduction – Data discretization
and concept hierarchy generation.
II DATA WAREHOUSE and OLAP TECHNOLOGY

Need for Data Warehouse- multidimensional data model- Data Warehouse architecture -
Data Warehousing to Data mining. MINING FREQUENT PATTERNS, 9
ASSOCIATIONS AND CORRELATIONS: Frequent item sets, Association rules –
mining various kinds of Association rules.
III WEKA TOOL

Introduction – Installation- Visualisation – filtering- selecting attributes- other popular
packages. CLASSIFICATION TASK: Introduction – Decision trees – Naïve Bayes’ 9
classification Artificial Neural Networks and Support Vector Machines.
IV CLUSTERING AND ESTIMATION

CLASSIFICATION AND PREDICTION: Issues regarding classification and prediction
-Accuracy and error measures – Evaluating the accuracy of classifiers and predictors. 9
CLUSTER ANALYSIS: Types of data – Partitioning Methods: k means and k Medoids.
V MINING OF TIME SERIES

Trend analysis – similarity search – sequence patterns in transactional data bases
sequential pattern mining: concepts and primitives. MINING TEXT, MULTIMEDIA 9
AND THE WORLD WIDE WEB: Text data analysis and information retrieval-
Dimensionality reduction for text – text mining approaches – similarity search in
multimedia data.
Course CO1: Develop understanding level in basic mining concepts and techniques
Outcome CO2: Develop skills using data mining OLAP and Weka tools
CO3: Enhance knowledge in mining software for solving practical problems
CO4: Represent concepts of data preprocessing
CO5: Read and write own mining algorithms and concepts for research.
P a g e | 98
TEXT BOOKS:
T1: HanJiawei, Micheline Kamber and Jian Pei “Data Mining: Concepts and Techniques”, Morgan Kaufmann,
2011.
T2: Shawkat Ali A B M, Saleh A. Wasimi, “Data Mining: Methods and Techniques”, Fifth Indian Reprint,
Cengage Learning, 2011.
REFERENCE BOOKS:
R1: Soman K. P., Shyam Diwakar, Ajay V. “Insight into Data Mining Theory and Practice”, Fifth
Printing, PHI Learning, 2011.
R2: Arun K Pujari, “Data Mining Techniques”, University Press, 2013.
R3: G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy Edition, Prentice Hall of
India,2006.
R4: Daniel T.Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.
P a g e | 99
PROGRAMME COURSE CODE NAME OF THE COURSE L T P C

B.E 19CS5252 OBJECT ORIENTED ANALYSIS AND 2 0 2 3
DESIGN
1. To express software design with UML diagrams
2. To design software applications using OO concepts.
Course 3. To identify various scenarios based on software requirements
Objective 4. To transform UML based software design into pattern based design using design patterns
5. To understand the various testing methodologies for OO software
Instructional
Unit Description
Hours
UNIFIED PROCESS AND USE CASE DIAGRAMS
Introduction to OOAD with OO Basics - Unified Process – UML diagrams – Use
Case –Case study – the Next Gen POS system, Inception -Use case Modelling –
I 6+3
Relating Use cases – include, extend and generalization.
Experiments: Document the Software Requirements Specification (SRS) for the
Student information system.
STATIC UML DIAGRAMS
Class Diagram–– Elaboration – Domain Model – Finding conceptual classes and
description classes – Associations – Attributes – Domain model refinement – Finding
conceptual class Hierarchies – Aggregation and Composition - Relationship between 6+3
II
sequence diagrams and use cases – When to use Class Diagrams. Experiments:
Identify use cases and develop the Use Case model for Student information system.
Identify the conceptual classes and develop a Domain Model and also derive a Class
Diagram from that for Recruitment system.
DYNAMIC AND IMPLEMENTATION UML DIAGRAMS
Dynamic Diagrams – UML interaction diagrams - System sequence diagram –
Collaboration diagram – When to use Communication Diagrams - State machine
diagram and Modeling –When to use State Diagrams - Activity diagram – When to
use activity diagrams - Implementation Diagrams - UML package diagram - When to
III use package diagrams - Component and Deployment Diagrams – When to use 6+3
Component and Deployment diagrams. Experiments: Using the identified scenarios,
find the interaction between objects and represent them using
UML Sequence and Collaboration Diagrams for Airline/Railway reservation system.
Draw relevant State Chart and Activity Diagrams for the same system for Exam
registration.
DESIGN PATTERNS
GRASP: Designing objects with responsibilities – Creator – Information expert – Low
Coupling – High Cohesion – Controller Design Patterns – creational – factory method
5+4
IV – structural – Bridge – Adapter – behavioural – Strategy – observer –Applying GoF
design patterns – Mapping design to code. Experiments: Improve the reusability and
maintainability of the software system by applying appropriate design pattern
TESTING
Object Oriented Methodologies – Software Quality Assurance – Impact of object 6+3
V
orientation on Testing – Develop Test Cases and Test Plans
Experiments: Implement the modified system and test it for various scenarios
TOTAL INSTRCTIONAL HOURS 45
P a g e | 100
CO1: Express software design with UML diagrams

CO2: Design software applications using OO concepts.
Course CO3: Identify various scenarios based on software requirements.
Outcome CO4: Transform UML based software design into pattern based design using design patterns
CO5: Understand the various testing methodologies for OO software
TEXT BOOKS:
T1: Craig Larman, ―Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
Iterative Development‖, Third Edition, Pearson Education, 2005.
T2: Ali Bahrami - Object Oriented Systems Development - McGraw Hill International Edition - 1999
REFERENCE BOOKS :
R1: Erich Gamma, a n d Richard Helm, Ralph Johnson, John Vlissides, ―Design patterns: Elements of Reusable
Object-Oriented Software‖, Addison-Wesley, 1995.
R2: Martin Fowler, ―UML Distilled: A Brief Guide to the Standard Object Modeling Language‖, Third edition,
Addison Wesley, 2003.
R3: Simon Bennett, Steve Mc Robb and Ray Farmer, “Object Oriented Systems Analysis and Design Using
UML”, Fourth Edition, Mc-Graw Hill Education, 2010.
R4: Paul C. Jorgensen, “Software Testing:- A Craftsman‟s Approach”, Third Edition, Auerbach Publications,
Taylor and Francis Group, 2008.
P a g e | 101

B.E 19EC5031 PRINCIPLES OF MICROPROCESSORS AND 0 0 3 1.5
MICROCONTROLLERS LABORATORY
1. To introduce ALP concepts and features

2. To write ALP for arithmetic and logical operations in 8086 and 8051
Course 3. To generate waveforms using Microprocessors. CO4: Execute Programs in 8051
Objective 4. To explain the difference between simulator and Emulator
5. To write ALP Programs for Arithmetic Operations

Using 8086 Micro processor and MASM software
1. Basic arithmetic and Logical operations.
2. Code conversion and decimal arithmetic.
3. Matrix operations
4. Searching
5. Sorting
Using 8086 Micro processor and Interfacing
6. Parallel interface
7. Serial interface
8. Key board and Display interface
9. A/D and D/A interface
Using 8051 Micro controller
10. Basic arithmetic and Logical operations.
11. Square and Cube program, Find 2‟s complement of a number
12. Stepper motor control interface
Total hours 45
CO1: Write ALP Programmes for Arithmetic Operations

CO2: Write ALP for arithmetic and logical operations in 8086 and 8051
Course
CO3: Generate waveforms using Microprocessors. CO4: Execute Programs in 8051
Outcome
CO4: Explain the difference between simulator and Emulator
CO5: Write ALP Programmes for Arithmetic Operations
P a g e | 102
Programme Course Code Course Name L T P C

BE 19CS6181 PRINCIPLES OF MANAGEMENT 3 0 0 3
1. To study the evolution of Management and learn the functions and responsibilities of
managers.
2. To Plan and know the tools and techniques to be used in the performance of the
Course
managerial job.
Objective
3. To enable them to analyze and understand the environment of the organization.
4. To understand the proper vocabulary to communicate effectively.
5. To comprehend the cognizance of the importance of control methods.
Instructional
Unit Description
Hours
INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS
Definition of Management – Science or Art – Manager Vs Entrepreneur - types of
managers - managerial roles and skills – Evolution of Management – Scientific,
I human relations , system and contingency approaches – Types of Business 9
organization - Sole proprietorship, partnership, company-public and private sector
enterprises - Organization culture and Environment – Current trends and issues in
Management.
PLANNING
Nature and purpose of planning – planning process – types of planning – objectives –
II setting objectives – policies – Planning premises – Strategic Management – Planning 9
Tools and Techniques – Decision making steps and process.
ORGANISING
Nature and purpose – Formal and informal organization – organization chart –
organization structure – types – Line and staff authority – departmentalization –
III delegation of authority – centralization and decentralization – Job Design - Human 9
Resource Management – HR Planning, Recruitment, selection, Training and
Development, Performance Management , Career planning and management
DIRECTING
Foundations of individual and group behavior – motivation – motivation theories –
IV motivational techniques – job satisfaction – job enrichment – leadership – types and 9
theories of leadership – communication – process of communication – barrier in
communication – effective communication –communication and IT.
CONTROLLING
System and process of controlling – budgetary and non-budgetary control techniques
V 9
– use of computers and IT in Management control – Productivity problems and
management – control and performance – direct and preventive control – reporting.
CO1: Understand the functions and responsibilities of managers.

CO2: Interpret the planning, policies, various tools and techniques.
CO3: Solve organizational problems and develop optimal managerial decisions.
Course
Outcome CO4: Importance of proper vocabularies to articulate ones own position and communicate
effectively.
CO5: Grasp both qualitative and quantitative information and formulate best control methods.
P a g e | 103
TEXT BOOKS:
T1: Stephen P. Robbins & Mary Coulter, ―Management‖, Prentice Hall (India) Pvt. Ltd., 10th Edition, 2009.
T2: JAF Stoner, Freeman R.E and Daniel R Gilbert ―Management‖, Pearson Education, 6th Edition, 2004.
REFERENCE BOOKS:
R1: Stephen A. Robbins & David A. Decenzo & Mary Coulter, ―Fundamentals of Management‖ Pearson
Education, 7th Edition, 2011.
R2: Robert Kreitner & Mamata Mohapatra, ― Management‖, Biztantra, 2008.
R3: Harold Koontz & Heinz Weihrich ―Essentials of management‖ Tata McGraw Hill,1998.
R4: Tripathy PC & Reddy PN, ―Principles of Management‖, Tata McGraw Hill, 1999.
P a g e | 104

BE 19CS6201 ARTIFICIAL INTELLIGENCE 3 1 0 4
1. To understand the various characteristics of Intelligent agents

2. To learn the different search strategies in AI
Course
3. To learn to represent knowledge in solving AI problems
Objective
4. To understand the different ways of designing software agents
5. To know about the various applications of AI.
Instructional
Unit Description
Hours
INTRODUCTION TO ARTIFICIAL INTELLIGENC
Introduction–Definition – The Foundations of Artificial Intelligence - The History of
I Artificial Intelligence - Future of Artificial Intelligence – Agents and Environments - 10
Good Behavior: The Concept of Rationality - The Nature of Environments - The
Structure of Agents.
SOLVING PROBLEMS BY SEARCHING
Problem - Solving Agents - Example Problems - Searching for Solutions -
Uninformed Search Strategies - Informed (Heuristic) Search Strategies - Heuristic
II Functions. BEYOND CLASSICAL SEARCH: Local Search Algorithms and 13
Optimization Problems - Local Searching Continuous Spaces - Searching with Non-
deterministic Actions - Searching with Partial Observations. ADVERSARIAL
SEARCH: Stochastic Games.
KNOWLEDGE AND REASONING
Knowledge - Based Agents - The Wumpus World - Logic -Propositional Logic: A
Very Simple Logic - Propositional Theorem Proving - Effective Propositional
III Model Checking - Agents Based on Propositional Logic. FIRST ORDER LOGIC: 13
Representation Revisited - Syntax and Semantics of First - Order Logic - Using First
- Order Logic - Knowledge Engineering in First - Order Logic.
PLANNING AND ACTING IN THE REAL WORLD
Time, Schedules, and Resources - Hierarchical Planning -Planning and Acting in
Non-deterministic Domains - Multi-agent Planning. KNOWLEDGE
IV REPRESENTATION: Ontological Engineering - Categories and Objects - Events 12
- Mental Events and Mental Objects - Reasoning Systems for Categories -
Reasoning with Default Information - The Internet Shopping World.
APPLICATIONS
AI applications – Language Models – Information Retrieval- Information Extraction
V 12
– Natural Language Processing – Machine Translation – Speech Recognition –
Robot – Hardware –Perception – Planning – Moving
CO1: Understand the various characteristics of Intelligent agents

CO2: Learn the different search strategies in AI
Course
CO3: Learn to represent knowledge in solving AI problems
Outcome
CO4: Understand the different ways of designing software agents
CO5: Learn about the various applications of AI.
TEXT BOOKS:
T1: S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
P a g e | 105
T2: I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley Educational
Publishers Inc., 2011.
REFERENCE BOOKS:
R1: M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science)‖, Jones and Bartlett
Publishers, Inc.; First Edition, 2008
R2: Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
R3: William F. Clocksin and Christopher S. Mellish,‖ Programming in Prolog: Using the ISO Standard‖, Fifth
Edition, Springer, 2003.
R4: Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
P a g e | 106

BE 19CS6202 MOBILE COMPUTING 3 0 0 3
1.
To understand the basic concepts of mobile computing.
2.
To learn the basics of mobile telecommunication system.
Course
3.
To be familiar with the network layer protocols and Ad-Hoc networks.
Objective
4.
To know the basis of transport and application layer protocols.
5.
To gain knowledge about different mobile platforms and application development.
Instructional
Unit Description
Hours
INTRODUCTION
Introduction to Mobile Computing – Applications of Mobile Computing-
I Generations of Mobile Communication Technologies- Multiplexing – Spread 9
spectrum -MAC Protocols – SDMA- TDMA- FDMA- CDMA.
MOBILE TELECOMMUNICATION SYSTEM

Introduction to Cellular Systems – GSM – Services & Architecture – Protocols –
II Connection Establishment – Frequency Allocation – Routing – Mobility 9
Management – Security – GPRS- UMTS – Architecture – Handover – Security.
MOBILE NETWORK LAYER

Mobile IP – DHCP – AdHoc– Proactive protocol-DSDV, Reactive Routing
III Protocols – DSR, AODV , Hybrid routing –ZRP, Multicast Routing- ODMRP, 9
Vehicular Ad Hoc networks ( VANET) –MANET Vs VANET – Security.
MOBILE TRANSPORT AND APPLICATION LAYER

Mobile TCP– WAP – Architecture – WDP – WTLS – WTP –WSP – WAE – WTA
IV 9
Architecture – WML
MOBILE PLATFORMS AND APPLICATIONS

Mobile Device Operating Systems – Special Constraints & Requirements –
V Commercial Mobile Operating Systems – Software Development Kit: iOS, 9
Android– MCommerce – Structure – Pros & Cons – Mobile Payment System –
Security Issues.
CO1: Explain the basics of mobile telecommunication systems.

CO2: Illustrate the generations of telecommunication systems in wireless networks.
Course CO3: Determine the functionality of MAC, network layer and Identify a routing protocol for a
Outcome given Ad hoc network.
CO4: Explain the functionality of Transport and Application layers.
CO5: Develop a mobile application using android/blackberry/ios/Windows SDK
TEXT BOOKS:
T1: Jochen Schiller, ―Mobile Communications‖, PHI, Second Edition, 2003.
T2: Prasant Kumar Pattnaik, Rajib Mall, ―Fundamentals of Mobile Computing‖, PHI Learning Pvt.Ltd, New
Delhi – 2012
REFERENCE BOOKS:
R1: Dharma Prakash Agarval, Qing and An Zeng, “Introduction to Wireless and Mobile systems”,Thomson
Asia Pvt Ltd, 2005.
P a g e | 107
R2: Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile
Computing‖, Springer, 2003.
R3: William.C.Y.Lee,―Mobile Cellular Telecommunications-Analog and Digital Systems‖, Second
Edition,TataMcGraw Hill Edition ,2006.
R4: C.K.Toh, ―AdHoc Mobile Wireless Networks, First Edition, Pearson Education, 2002.
P a g e | 108

BE 19CS6251 COMPILER DESIGN 2 0 3 3.5
1. To learn the design principles of a Compiler.

2. To learn about the Lexical analysis.
Course
3. To learn about Syntax analysis.
Objective
4. To apply the concepts for syntax directed translation and run time environment.
5. To apply the concepts of code optimization and code generation.
Instructional
Unit Description
Hours
INTRODUCTION TO COMPILERS
Introduction - Analysis of the source program -Translators-Compilation and
Interpretation- Language processors -The Phases of Compiler-Errors Encountered in
I 4+2
Different Phases-The Grouping of Phases-Compiler Construction Tools. Illustrative
programs: Design a lexical analyzer for given language and the lexical analyzer
should ignore redundant spaces,tabs, comments and new lines.
LEXICAL ANALYSIS
Lexical Analysis-Need and Role of Lexical Analyzer- Lexical Errors- Specification
of tokens - Recognition of tokens -Expressing Tokens by Regular Expressions-
II 8+3
Converting Regular Expression to DFA- Minimization of DFA-Language for
Specifying Lexical Analyzers-LEX.Illustrative programs: Implementation of Lexical
Analyzer using JLex, flex or other lexical analyser generating tools
SYNTAX ANALYSIS
Syntax analysis -Need and Role of the Parser- Top Down Parsing - General
Strategies-Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce
III Parser- LR Parser- LR (0)Item-Construction of SLR Parsing Table -Introduction to 8+6
LALR Parser - Error Handling and Recovery in Syntax Analyze-Illustrative
programs: Implementation of LALR Parsing- Implementation of Symbol Table and
YACC
SYNTAX DIRECTED TRANSLATION & RUN TIME ENVIRONMENT
Syntax directed Definitions-S-attributed definitions - L-attributed definitions -
Construction of Syntax Tree- Bottom-up and Top-down translation - type checking-
IV Type Conversions. RUN-TIME ENVIRONMENT: Source Language Issues-Storage 8+6
Organization-Parameter Passing-Symbol Tables- Dynamic Storage Allocation-
Illustrative programs: Implement type checking: Implement any one storage
allocation strategies(Heap,Stack,Static).
CODE OPTIMIZATION AND CODE GENERATION
Intermediate code generation - Intermediate languages - Declarations - Assignment
statements-DAG –Introduction to code optimization – Principal sources of
V optimization - Optimization of Basic Blocks -Introduction to global data-flow 3+6
analysis- Implement control flow analysis and Data flow Analysis- Construction of
DAG.Illustrative programs: Implementation of Simple Code Optimization
Techniques (Constant Folding., etc.)
CO1: Learn the design principles of a Compiler.

Course CO2: Learn about the Lexical analysis.
CO3: Learn about Syntax analysis.
Outcome
CO4: Apply the concepts for syntax directed translation and run time environment.
CO5: Apply the concepts of code optimization and code generation.
P a g e | 109
TEXT BOOKS:
T1: Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles, Techniques and
Tools”, 2nd Edition, Pearson Education, 2007.
T2: Aho A. V., Ullman J.D. Principles of Compiler Design, Narosa
REFERENCE BOOKS:
R1: Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern Architectures: A Dependence-based
Approach”, Morgan Kaufmann Publishers, 2002.
R2: Steven S. Muchnick, “Advanced Compiler Design and Implementation, “Morgan Kaufmann Publishers -
Elsevier Science, India, Indian Reprint 2003.
R3: Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers
Elsevier Science, 2004.
R4: Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson Education, 2008
P a g e | 110

BE 19CS6001 MOBILE APPLICATION DEVELOPMENT 0 0 3 1.5
LABORATORY
1. To develop mobile applications using GUI and Layouts.To understand how to work with
various mobile application development frameworks.
2. To develop mobile applications using Event Listener.
Course 3. To develop mobile applications using Databases.
Objective 4. To develop mobile applications using RSS Feed, Internal/External Storage, SMS, Multi-
threading and GPS.
5. To analyze and discover own mobile app for simple needs.

1. Develop an application that uses GUI components, Font and Colours
2. Develop an application that uses Layout Managers and event listeners.
3. Write an application that draws basic graphical primitives on the screen.
4. Develop an application that makes use of databases.
5. Develop an application that makes use of Notification Manager
6. Implement an application that uses Multi-threading
7. Develop a native application that uses GPS location information
8. Implement an application that writes data to the SD card.
9. Implement an application that creates an alert upon receiving a message
10. Write a mobile application that makes use of RSS feed
11. Develop a mobile application to send an email.
12. Develop a Mobile application for simple needs (Mini Project)
Total hours 45
CO1: Develop mobile applications using GUI and Layouts.

CO2: Develop mobile applications using Event Listener.
Course CO3: Develop mobile applications using Databases.
Outcome CO4: Develop mobile applications using RSS Feed, Internal/External Storage, SMS, Multi-
threading and GPS.
CO5: Analyze and discover own mobile app for simple needs.
P a g e | 111

BE 19CS7201 CRYPTOGRAPHY AND NETWORK 3 0 0 3
SECURITY
1. Understand the fundamentals of networks security, security architecture, threats and

vulnerabilities
Course 2. Apply the different cryptographic operations of symmetric cryptographic algorithms
Objective 3. Apply the different cryptographic operations of public key cryptography
4. Apply the various Authentication schemes to simulate different applications.
5. Understand various Security practices and System security standards
Instructional
Unit Description
Hours
INTRODUCTION
Security trends - Legal, Ethical and Professional Aspects of Security, Need for
Security at Multiple levels, Security Policies - Model of network security – Security
I attacks, services and mechanisms – OSI security architecture – Classical encryption 9
techniques: substitution techniques, transposition techniques, steganography-
Foundations of modern cryptography: perfect security – information theory –
product cryptosystem – cryptanalysis.
SYMMETRIC KEY CRYPTOGRAPHY
MATHEMATICS OF SYMMETRIC KEY CRYPTOGRAPHY: Algebraic
structures - Modular arithmetic-Euclid‟s algorithm- Congruence and matrices -
II Groups, Rings, Fields- Finite fields- SYMMETRIC KEY CIPHERS: SDES – Block 9
cipher Principles of DES – Strength of DES – Differential and linear cryptanalysis -
Block cipher design principles – Block cipher mode of operation – Evaluation
criteria for AES – Advanced Encryption Standard - RC4 – Key distribution.
PUBLIC KEY CRYPTOGRAPHY
MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes –
Primality Testing – Factorization – Euler‘s totient function, Fermat‘s and Euler‘s
III Theorem - Chinese Remainder Theorem – Exponentiation and logarithm - 9
ASYMMETRIC KEY CIPHERS: RSA cryptosystem – Key distribution – Key
management – Diffie Hellman key exchange - ElGamal cryptosystem – Elliptic
curve arithmetic-Elliptic curve cryptography.
MESSAGE AUTHENTICATION AND INTEGRITY
Authentication requirement – Authentication function – MAC – Hash function –
IV Security of hash function and MAC – SHA –Digital signature and authentication 9
protocols – DSS- Entity Authentication: Biometrics, Passwords, Challenge
Response protocols- Authentication applications - Kerberos, X.509
SECURITY PRACTICE AND SYSTEM SECURITY
Electronic Mail security – PGP, S/MIME – IP security – Web Security - SYSTEM
V 9
SECURITY: Intruders – Malicious software – viruses – Firewalls.
CO1: Understand the fundamentals of networks security, security architecture, threats and
vulnerabilities
Course CO2: Apply the different cryptographic operations of symmetric cryptographic algorithms
Outcome CO3: Apply the different cryptographic operations of public key cryptography
CO4: Apply the various Authentication schemes to simulate different applications.
CO5: Understand various Security practices and System security standards
P a g e | 112
TEXT BOOKS:
T1: William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall of
India/Pearson Education, New Delhi, 2010
T2: Atul Kahate, “Cryptography and Network Security”, Tata McGraw Hill Publishing Company, New
Delhi, 2007.
REFERENCE BOOKS:
R1: Behrouz Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”, Tata McGraw Hill
Publishing Company , New Delhi, 2010
R2: Charlie Kaufman, Radia Perlman, and Mike Speciner, Network Security: PRIVATE Communication in a
PUBLIC World, Prentice Hall, ISBN 0-13-046019-2
R3: Kaufman, Perlman and Speciner, “Network Security: Private Communication in a public world”, Prentice
Hall of India/ Pearson Education, New Delhi, 2004.
R4: C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and Network Security, Wiley India
Pvt.Ltd
P a g e | 113

BE 19CS7202 CLOUD COMPUTING 3 0 0 3
1. To understand the concept of cloud computing.

2. To appreciate the evolution of cloud from the existing technologies.
Course 3. To distinguish the intricacies of server, storage, network, desktop and application
Objective virtualizations.
4. To compare full and para virtualization.
5. To produce cloud applications in virtual machine platforms.
Instructional
Unit Description
Hours
INTRODUCTION
Introduction - Essentials - Benefits - Business and IT Perspective - Cloud and
Virtualization - Cloud Services Requirements - Cloud and Dynamic Infrastructure -
I 9
Cloud Computing Characteristics - Cloud Adoption. Cloud Models - Cloud
Characteristics - Measured Service -Cloud Models - Security in a Public Cloud -
Public versus Private Clouds - Cloud Infrastructure Self Service.
CLOUD SERVICES AND SOLUTIONS
Principal Technologies - Cloud Strategy - Cloud Design and Implementation using
SOA - Conceptual Cloud Model - Cloud Service Defined. Cloud Solutions -
II 9
Introduction - Cloud Ecosystem - Cloud Business Process Management - Cloud
Service Management - Cloud Stack - Computing on Demand (CoD) – Cloud
sourcing.
CLOUD OFFERINGS AND CLOUD MANAGEMENT
Cloud Offerings - Information Storage, Retrieval, Archive and Protection - Cloud
Analytics - Testing under Cloud - Information Security - Virtual Desktop
III 9
Infrastructure - Storage Cloud. Cloud Management - Resiliency - Provisioning -
Asset Management - Cloud Governance - High Availability and Disaster Recovery -
Charging Models, Usage Reporting, Billing and Metering.
CLOUD ENABLIBNG TECHNOLOGIES
IV Data center Technology – Virtualization Technology – Web Technology – 8
Multitenant Technology – service technology – case study in AWS.
CLOUD VIRTUALIZATION
Virtualization Defined - Virtualization Benefits - Server Virtualization -
Virtualization for x86 Architecture - Hypervisor Management Software -
V 10
Logical Partitioning (LPAR) - VIO Server - Virtual Infrastructure
Requirements - Storage virtualization - Storage Area Networks - Network-
Attached storage - Cloud Server Virtualization - Virtualized Data Center.
CO1: Understand the concept of cloud computing.

CO2: Appreciate the evolution of cloud from the existing technologies.
Course CO3: Distinguish the intricacies of server, storage, network, desktop and application
Outcome virtualizations.
CO4: Compare full and para virtualization.
CO5: Producing cloud applications in virtual machine platforms.
P a g e | 114
TEXT BOOKS
T1: James E. Smith, Ravi Nair, - Virtual Machines: Versatile Platforms for Systems and Processes,
Elsevier/Morgan Kaufmann, 2005.
T2: David Marshall, Wade A. Reynolds, - Advanced Server Virtualization: VMware and Microsoft Platform in
the Virtual Data Center, Auerbach Publications, 2006.
REFERENCE BOOKS:
R1: Kumar Reddy, Victor Moreno, - Network virtualization, Cisco Press, July, 2006.
R2: Chris Wolf, Erick M. Halter, - Virtualization: From the Desktop to the Enterprise, Apress 2005.
R3: Danielle Ruest, Nelson Ruest - Virtualization: A Beginner‟s Guide, TMH, 2009.
Thomas Erl, Zaigham Mahmood, Ricardo Puttini, ―Cloud Computing: Concepts,Technology and
R4:
Architecture‖, Prentice Hall Service Technology Series, 2013
P a g e | 115

BE 19CS7251 MACHINE LEARNING TECHNIQUES 2 0 2 3
1. To introduce the basic concepts and techniques of Machine Learning.

2. To have a thorough understanding of the Supervised and Unsupervised learning
Course techniques
Objective 3. To study the various probability based learning techniques
4. To understand graphical models of machine learning algorithms
5. To improve classification efficiency.
Instructional
Unit Description
Hours
FOUNDATIONS OF LEARNING
Components of learning – learning models – geometric models – probabilistic models –
logic models – grouping and grading – learning versus design – types of learning –
supervised – unsupervised – reinforcement – theory of learning – feasibility of learning
I – error and noise – training versus testing – theory of generalization – generalization 7+2
bound – approximation-generalization tradeoff – bias and variance – learning curve.
Illustrative Programs: Implement and demonstratethe FIND-Salgorithm for finding the
most specific hypothesis based on a given set of training data samples. Read the
training data from a .CSV file.
LINEAR MODELS
Linear classification – univariate linear regression – multivariate linear regression –
regularized regression – Logistic regression – perceptrons – multilayer neural networks
II – learning neural networks structures – support vector machines – soft margin SVM – 7+2
going beyond linearity – generalization and overfitting – regularization – validation.
Illustrative Programs: Create a training dataset using SVM, implement decision
boundary using SVM
DISTANCE-BASED MODELS
Nearest neighbor models – K-means – clustering around medoids – silhouttes –
hierarchical clustering – k-d trees – locality sensitive hashing– non-parametric
regression – ensemble learning – bagging and random forests – boosting – meta
III 7+2
learning. Illustrative Programs: 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.
TREE AND RULE MODELS
Decision trees – learning decision trees – ranking and probability estimation trees –
regression trees – clustering trees – learning ordered rule lists – learning unordered rule
IV lists – descriptive rule learning – association rule mining – first-order rule learning. 7+2
Illustrative Programs: 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 toclassify a new sample.
REINFORCEMENT LEARNING
Markov Chain Monte Carlo Methods – Passive reinforcement learning – direct utility
estimation – adaptive dynamic programming – temporal difference learning – active
reinforcement learning – exploration – learning an action-utility function –
V 7+2
Generalization in reinforcement learning – policy search – applications in game playing
– applications in robot control. Illustrative Programs: Metropolis–Hastings Algorithm
by using Markov Chain Monte Carlo Methods, HMM Baum–Welch (Forward–
Backward) Algorithm
P a g e | 116
CO1: Explain theory underlying machine learning .

Course CO2: Construct algorithms to learn linear and non-linear models
Outcome CO3: Implement data clustering algorithms.
CO4: Construct algorithms to learn tree and rule-based models.
CO5: Apply reinforcement learning techniques for real life problems.
TEXT BOOKS:
T1: Y. S. Abu-Mostafa, M. Magdon-Ismail, and H.-T. Lin, ―Learning from Data‖, AML Book Publishers,
2012.
T2: P. Flach, ―Machine Learning: The art and science of algorithms that make sense of data‖, Cambridge
University Press, 2012.
REFERENCE BOOKS:
R1: K. P. Murphy, ―Machine Learning: A probabilistic perspective‖, MIT Press, 2012.
R2: M. Mohri, A. Rostamizadeh, and A. Talwalkar, ―Foundations of Machine Learning‖, MIT Press, 2012.
R3: C. M. Bishop, ―Pattern Recognition and Machine Learning‖, Springer, 2007.
R4: D. Barber, ―Bayesian Reasoning and Machine Learning‖, Cambridge University Press, 2012.
P a g e | 117

BE 19CS7001 CLOUD COMPUTING LABORATORY 0 0 3 1.5
1. To configure various virtualization tools such as Virtual Box, VMware workstation.

Course 2. To design and deploy a web application in a PaaS environment.
Objective 3. To learn how to simulate a cloud environment to implement new schedulers.
4. To install and use a generic cloud environment that can be used as a private cloud.
5. To manipulate large data sets in a parallel environment.
1. Install Virtualbox/VMware Workstation with different flavours of linux or windows OS

on top of windows7 or 8.
2. Install a C compiler in the virtual machine created using virtual box and execute Simple
Programs
3. Install Google App Engine. Create hello world app and other simple web applications
using python/java.
4. Use GAE launcher to launch the web applications.
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not
present in CloudSim.
6. Find a procedure to transfer the files from one virtual machine to another virtual machine.
7. Find a procedure to launch virtual machine using trystack (Online Openstack Demo
Version)
8. Install Hadoop single node cluster and run simple applications like wordcount.
Total hours 45
CO1: Configure various virtualization tools such as Virtual Box, VMware workstation.
Course CO2: Design and deploy a web application in a PaaS environment.
Outcome CO3: Learn how to simulate a cloud environment to implement new schedulers.
CO4: Install and use a generic cloud environment that can be used as a private cloud.
CO5: Manipulate large data sets in a parallel environment.
CHAIRMAN, BOARD OF STUDIES
P a g e | 118

BE 19CS7002 SECURITY LABORATORY 0 0 3 1.5
1. To develop code for classical Encryption Techniques to solve the problems.

2. To build cryptosystems by applying symmetric and public key encryption algorithms.
Course 3. To construct code for authentication algorithms.
Objective 4. To develop a signature scheme using Digital signature standard.
5. To demonstrate the network security system using open source tools.

Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES concepts:
a. Caesar Cipher
b. Playfair Cipher
1. c. Hill Cipher
d. Vigenere Cipher
e. Rail fence – row & Column
f. Transformation
Transformation Implement the following algorithms
a. DES
b. RSA Algorithm
2. c. Diffiee-Hellman
d. MD5
e. SHA-1.
3. Perform an experiment how to use DumpSec.
4. Generate password hashes with openSSL.
5. Setup a honey pot and monitor the honeypot on network (KF Sensor)
6. Installation of rootkits and study about the variety of options
Perform wireless audit on an access point or a router and decrypt WEP and WPA.( Net
7.
Stumbler)
Demonstrate intrusion detection system (ids) using any tool (snort or any other open source
8.
software)
Total hours 45
CO1: Develop code for classical Encryption Techniques to solve the problems
CO2: Build cryptosystems by applying symmetric and public key encryption algorithms
Course CO3: Construct code for authentication algorithms
Outcome CO4: Develop a signature scheme using Digital signature standard
CO5: Demonstrate the network security system using open source tools
P a g e | 119

BE 19CS5301 INTERNET AND WEB TECHNOLOGY 2 0 2 3
1.To understand the concepts of object oriented programming paradigm.

2.To learn the basics involved in publishing content on the World Wide Web.
Course
3.To expose students to the basic tools and applications used in Web publishing.
Objective
4.To understand how web pages are connected to database through JDBC.
5.To know about server side programming
Instructional
Unit Description
Hours
INTRODUCTION TO OBJECT ORIENTED PROGRAMMING
Objected oriented concepts – object oriented programming (review only) ––
advanced concept in OOP – relationship – inheritance – abstract classes –
I polymorphism – Object Oriented design methodology – approach – best practices. 5+2
UML class diagrams – interface – common base class. Illustrative Programs:
Polymorphism and inheritance
NETWORKING AND SECURITY

Internetworking – Working with TCP/IP – IP address – sub netting – DNS – VPN –
proxy servers – firewalls – Client/Server concepts - World Wide Web – components
of web application – MIME types, browsers and web servers – types of web content
– URL – HTML – HTTP protocol – Web applications – performance – Application
II servers – Web security. User Experience Design – Basic UX terminology – UXD in 6+3
SDLC – Rapid prototyping in Requirements. Illustrative programs: write an HTML
page that has one input, which can take multiline 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.
HTML AND CSS
Client Tier using HTML – Basic HTML tags – Look and feel using CSS – Client
side scripting using Java Script and Validations - Document Object Model (DOM).
III Illustrative programs: Create an XML template to describe the result of students in 6+3
an examination. The description should include the students roll number,
name, three subject names and marks, total marks, percentage and result.
JDBC
Business tier using POJO (Plain Old Java Objects) – Introduction to Frameworks –
Introduction to POJO – Multithreaded Programming – Java I/O – Java Database
Connectivity (JDBC). Illustrative programs :Write a program for maintaining
IV 6+4
database by sending queries. Design and implement a servlet book query with a help
of JDBC and SQL. Create MS-Acess database, create on ODBC link, complie and
execute java JDBC socket.
SERVLETS
Presentation tier using JSP – Role of Java EE in Enterprise applications – Basics of
Servlets - To introduce server side programming with JSP - Standard Tag Library.
V Illustrative programs: Write a servlet program to connect database and extract data 6+4
from the tables and display them, Authenticate the user when he/she submits the
login form using the user name and password from the database using JSP.
Total Instructional Hours 29+16=45
P a g e | 120
CO1: Understand the concepts of OOP paradigm.

Course CO2: Understand the basics of world wide web.
Outcome CO3: Understand the Principles behind the design and construction of Web applications.
CO4: Apply the concepts of JDBC.
CO5: Understand about server side programming.
TEXT BOOKS:
T1: Deitel, Deitel, Goldberg, "Internet & World Wide Web How to Program", Third Edition, Pearson Education,
2006.
T2: Raj Kamal, “Internet and Web Technologies”, Tata McGraw-Hill
REFERENCE BOOKS:
R1: Douglas E Comer, Internet Book, The: Everything You Need to Know About Computer Networking and
How the Internet Works, 4/E, Prentice Hall, 2007.
R2: Jeffrey C. Jackson, Web Technologies: A Computer Science Perspective, Prentice Hall, 2007.
R3: Herbert Schildt, Java: The Complete Reference, McGraw-Hill Professional, 2006.
R4: Ted Wugofski, XML Black Book 2nd Edition , Certification Insider Press
P a g e | 121

BE 19CS5302 ADVANCED JAVA PROGRAMMING 2 0 2 3
1. To learn GUI concepts using Swing and JavaFX.

2. To learn network programs using java
Course
3. To understand concepts needed for distributed and multi-tier applications
Objective
4. To understand Servlets and JDBC to develop web pages.
5. To understand bean concepts for enterprise application development
Instructional
Unit Description
Hours
GUI INTRODUCTION
Introducing Swing- swing menus-Introducing JavaFX-Exploring JavaFX Controls-
I JavaFX Menus. Illustrative Programs: Calculator using Swing, GUI application 4+4(P)
with controls menus and event handling using JavaFX
NETWORK PROGRAMMING IN JAVA

Networking classes and Interfaces-InetAddress- URL classes – URL Connection-
Reading data from the server –Reading the Header- writing data to server --Sockets
– Client Socket-Server Socket- secure sockets - UDP datagram and Sockets -
II 5+4(P)
multicast sockets - sending Email. Illustrative Programs: chat application using
TCP/IP, client/server application using UDP Communication, send email from java
application.
APPLICATIONS IN DISTRIBUTED ENVIRONMENT

Remote method invocation - Activation models - RMI custom sockets - Object
serialization - RMI- IIop implementation -CORBA - IDL technologies - Naming
III 5+6(P)
services - CORBA programming model. Illustrative Programs: simple calculator
application using RMI, Client/Server Application (Bank Details) using CORBA
MULTI-TIER APPLICATION DEVELOPMENT: Introduction to servlet -

servlet life cycle - Developing and deploying servlets - handling request and
response - Introduction to JDBC-JDBC drivers and architectures - CURD operation 4+4(P)
IV
using JDBC-connecting to non conventional database. Illustrative Programs: Login
form validation using servlet, implement CURD operations on student database.
ENTERPRISE APPLICATIONS: Introduction to J2EE – J2EE Architecture and

specifications, Client server application, web application, enterprise applications, 2,3
and n-tier applications. J2EE Frameworks: Struts MVC, Hibernate, Spring, J2EE
V 5+4(P)
Containers- Web Services Support- Packaging Application. Illustrative Programs:
Create Application Helloworld with struts on netbeans, create J2EE Application by
integrating Strut+Spring+Hibernate.
Total Instructional Hours (23 + 22) 45
CO1: To make use of GUI concepts in java programs.

CO2: Use the methods of network programming to create an application.
CO3: To make the students to develop distributed business applications and multitier
Course
Outcome applications
CO4: To develop web pages using advanced server-side programming through servlets and
JDBC.
CO5: To use bean concepts for developing enterprise application.
P a g e | 122
TEXT BOOKS:
T1: J. McGovern,R. Adatia,Y. Fain, 2003, J2EE 1.4 Bible, Wiley-dreamtech India Pvt. Ltd, New Delhi.
T2: H. Schildt, 2002, Java 2 Complete Reference, 5th Edition, Tata McGraw Hill, New Delhi.
REFERENCE BOOKS:
R1: Hortsmann & Cornell,”core Java 2 Advanced Feauture, 9th Edition”,pearson Education,2013.
R2: Ed Roman,”Mastering Enterprise Java Beans”,John Wiley & sons Inc.,1999.
R3: Elliotte Rusty Harold,”Java Network programming”,o’Reilly publishers,2000.
R4: Patrick Naughton,”Complete Reference: Java2,9th Edition”,Tata McGraw-Hill,2003
P a g e | 123

B.E 19CS5303 FUNDAMENTALS OF OPEN SOURCE 2 0 2 3
SOFTWARE
1. To understand open source operating systems and application
2. To understand MYSQL database with Query
Course
3. To learn programming using a Server Side Script language.
Objective
4. To study python programming language and understand the features.
5. To understand how object oriented database is connecting to python.
Instructional
Unit Description
Hours
INTRODUCTION
Introduction to Open sources – Need of Open Sources – Advantages of Open
Sources– Application of Open Sources. List of open source software and open source
hardware -Open source operating systems: LINUX: Introduction – General Overview
I – Kernel Mode and user mode – Process – Advanced Concepts – Scheduling – 6+3
Personalities – Cloning – Signals – Development with Linux. Illustrate Programs:
Windows and Linux installation with dual boot, Micro kernel installation like
MYSQL, PHP and PYTHON.
OPEN SOURCE DATABASE
MySQL: Introduction – Setting up account – Starting, terminating and writing your
own SQL programs – Record selection Technology – Working with strings – Date 6+3
II and Time– Sorting Query Results – Generating Summary – Working with metadata –
Using sequences – MySQL and Web. .Illustrate Programs:.DML and DDL command
using MYSQL
OPEN SOURCE PROGRAMMING LANGUAGES
PHP: Introduction – Programming in web environment – variables – constants – data
types – operators – Statements – Functions – Arrays – OOP – String Manipulation
and regular expression – File handling and data storage – PHP and SQL database – 6+3
III
PHP and LDAP – PHP Connectivity – Debugging and error handling, case study-
Symfony. Illustrate Programs: Running PHP: Simple applications like login form,
File handling ,Exception handling and Database connectivity using PHP
PYTHON: Syntax and Style – Python Objects – Numbers – Sequences – Strings
– Lists and Tuples – Dictionaries – Conditionals and Loops – Files – Input and
Output – Errors and Exceptions – Functions – Modules – Classes and OOP – 5+4
IV Execution Environment. Illustrate Programs: control flow statement, string
manipulation and function by using python, create class and object using python, File
handling and Exception handling using python.
PYTHON DATABASES AND PERSISTENCE
Persistence options in python-DBM Files-Pickled Objects-Shelve Files-The ZODB
Object- Oriented Database-SQL Database Interfaces- ORMs: Object Relational 6+3
V
Mappers- PyForm: A Persistent Object Viewer. Illustrate Programs: Database
connectivity.
TOTAL INSTRCTIONAL HOURS 45

CO1. Understand open source operating systems and application.
CO2. Develop MYSQL query.
Course
CO3. Develop PHP program with database connection.
Outcome
CO4. Create a python program using exception.
CO5. Develop a python application using database.
P a g e | 124
TEXT BOOKS:
T1.Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, Wiley Publications, 2003
T2.Steve Suchring, “MySQL Bible”, John Wiley, 2002
REFERENCE BOOKS :
R1: Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002
R2: Wesley J. Chun, “Core Python Programming”, Prentice Hall, 2001
R3: Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-Hill Publishing Company
Limited, Indian Reprint 2009.
R4: Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw- Hill Publishing
Company Limited, Indian Reprint 2009.
P a g e | 125

BE 19CS5304 R Programming 2 0 2 3
1. To learn the basics of R Programming and R overview.

2. To learn the R functions and R strings.
Course
3. To discuss about the R package and R files.
Objective
4. To understand the R data base and R charts.
5. To learn the concepts of R linear & non linear regression, R distribution.
Instructional
Unit Description
Hours
Unit I R Overview: Evolution of R – Features of R - What is R? - Why R?-
Installing R - R environment – R basic syntax – R data types – R variables – R
I constants- R operators. Illustrative programs: Take input from the user, 9
Addition of two numbers.
Unit II R Functions and Strings: R Decision Making – R Loops – R
Functions – R Strings – R Vectors – R List – Matrices – R Arrays – R Factors
II – R data frame. Illustrative programs: factorial of given number, Prime 9
Number, Sum of natural numbers, Create an array two 3x3 matrices.
Unit III R Package and R Files: R Packages – R Data reshaping – R CSV
Files - R Excel File – R Binary files – R XML Files – R JSON Files.
III Illustrative programs: Joining column and rows in data frame, Create and 9
read the XML file for employee details.
Unit IV R Data base and R charts: R Web data – R data base – R Pie chart –
R Bar chart – R Box Plots – R histogram – R Line Graphs – R Scatter plots
IV – R Mean , Median, Mode. Illustrative programs: pie chart in the current R 9
working directory, boxplot graph for the relation between mpg (miles per
gallon) and cyl (number of cylinders).
Unit V R Linear Regression, Non Linear Regression, R Distribution: R
Linear Regression - R Multiple Regression - R Logistic Regression - R
Normal, Binominal distribution – R Poisson regression – R Time series
V 9
analysis – R Nonlinear least square – R decision tree. Illustrative programs:
height of the probability distribution at each point for a given mean and
standard deviation.
CO1: Understand the fundamentals of R Programming.

CO2: Design the program using R functions and R String.
Course
Outcome CO3: Develop the application using R packages and R files.
CO4: Understand and design the application using R database and R charts.
CO5: Design the application using R linear & non linear regression, R distribution.
TEXT BOOKS:
T1: “Hands-On Programming with R”, Garrett Grolemund, First Edition.
T2: Lawrence Leemis. Learning Base R. Lightning Source, 2016.
P a g e | 126
REFERENCE BOOKS:
R1: Torsten Hothorn and Brian S. Everitt. A Handbook Using R. Chapman & Hall/CRC Press, Boca Raton,
Florida, USA, 3rd edition, 2014.
R2: Ruey S. Tsay. Multivariate Time Series Analysis With R and Financial Applications. John Wiley, New
Jersey, 2014.
R3: Michael J. Crawley. An Introduction using R. Wiley, 2nd edition, 2014.
R4: Mark Gardener. Beginning R. First Edition, Wrox Publication, 2012.
P a g e | 127
BE 19CS5305 COMPUTER GRAPHICS AND MULTIMEDIA 2 0 2 3
1. To understand about graphics devices, software and basic algorithms for geometric
objects.
Course 2. To understand two dimensional transformation techniques.
Objective 3. To understand three dimensional transformation techniques.
4. To gain knowledge about illumination methods, rendering and color models.
5. To understand the fundamental concepts of multimedia.
Instructional
UNIT Description
Hours
INTRODUCTION AND OVERVIEW OF GRAPHICAL SYSTEMS
Video Display Devices -Raster Graphics Systems -Graphics software and standards.
Graphics primitives generation algorithms: Line drawing algorithms-Direct method-
DDA- Bresenham’s line drawing algorithm-Midpoint circle and Ellipse drawing
I 7+2(P)
Algorithm. Filling algorithms: Scan-line polygon filling, inside-outside test,
boundary and flood-fill. Illustrative Programs: Implementation of Line, Circle and
Ellipse Drawing Algorithms.
TWO DIMENSIONAL GRAPHICS

Transformations: Translation, rotation, scaling, reflection and shearing,
Homogenous Coordinates, Composition of Transformations. 2D viewing
II pipeline, Window to viewport transformation. Clipping Algorithms: Point 5+4(P)
clipping, line clipping and polygon clipping algorithms. Illustrative Programs:
Implementation of 2D Transformation, viewing and Line Clipping Algorithm.
THREE DIMENSIONAL GRAPHICS 3D object Representation-Polygon

surfaces- Polygon tables- Plane equations – Polygon meshes; Curved Lines and
surfaces, Quadratic surfaces, Blobby objects, Parametric Curves: Cubic Splines,
III Bezier Curves and B-Splines, Transformations: Translation, rotation, scaling. 3D 5+4(P)
viewing pipeline, Projection. Illustrative Programs: Graphics programming using
OPENGL - Creating 3D Objects and scenes. Implementation of 3D Transformation.
VISIBLE SURFACE DETERMINATION, ILLUMINATION AND
COLOR MODELS Visible line determination algorithms, Illumination Models:
Diffuse, Specular and Ambient Reflection. Polygon-Rendering Methods, Flat
IV Shading, Gouraud Shading and Phong Shading, Ray-Tracing Methods, Adding 7+2(P)
Surface Detail-texture mapping. Color models: properties of light, XYZ, RGB, YIQ
and CMY color models. Illustrative Programs: Implementation of color models
.
INTRODUCTION TO MULTIMEDIA: Introduction, applications, Text:
Introduction about Fonts and Faces - Using Text in Multimedia – Hypermedia and
Hypertext. Images: Making Still Images –Images File Formats. Animation: The
Power of Motion, Principles of Animation, Animation by Computer, morphing,
V 5+4(P)
tweening. The Internet and Multimedia- Designing for the World Wide Web.
Illustrative Programs: Using Flash/Maya perform different operations (rotation,
scaling move etc.) on objects. Create an object using Key frame animation and Path
animation.
CO1: Apply various algorithms to scan, convert the basic geometrical primitives and
Course area filling.
Outcome CO2: Apply two dimensional transformations and clipping techniques to graphics
CO3: Learn the basic concepts of 3D object representation, transformations and projection.
P a g e | 128
CO4: Apply the concepts of color models, lighting and shading models, textures, ray tracing,
hidden surface elimination and rendering to graphics objects.
CO5: Learn about the basics of multimedia concepts.
TEXT BOOKS:
T1: Donald Hearn and Pauline Baker M, “Computer Graphics”, Prentice Hall, New Delhi, 2007
T2: Tay Vaughan, Multimedia: Makingit Work , 8thEdition, McGraw Hill Education 2011.
REFERENCE BOOKS:
R1: Hearn, Baker, Carithers “Computer Graphics with OpenGL”, 4 th Edition,Pearson Education, 2014
R2: Francis S Hill, Jr.Stephen M Kelley., “Computer Graphics using OpenGL”, 3 rd Edition, Pearson Education,
2007.
R3 K.R. Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic, "Multimedia Communication Systems:
Techniques, Standards, and Networks", Pearson Prentice Hall, 2014
R4: Ralf Steinmetz, Klara Nahrstedt, Multimedia Systems, 2013, Springer Science & Business Media.
P a g e | 129

BE 19CS6301 BUSINESS INTELLIGENCE – DATA WAREHOUSING 3 0 0 3
AND ANALYTICS
1. To study about Transaction Processing and Analytical applications.
Course 2. To demonstrate Business Intelligence framework.
Objective 3. To demonstrate Data Warehouse implementation and methodology.
4. To apply a business scenario, identify the metrics, indicators to achieve the business goal
5. To apply application of concepts using open source/MS Office
Instructional
Unit Description
Hours
INTRODUCTION TO BUSINESS INTELLIGENCE 9
Introduction to digital data and its types – structured, semi-structured and
I
unstructured, Introduction to OLTP and OLAP (MOLAP, ROLAP, HOLAP).
BUSINESS INTELLIGENCE PROCESS AND FRAMEWORK 9

BI Definitions & Concepts, BI Framework, Data Warehousing concepts and its
II role in BI, BI Infrastructure Components – BI Process, BI Technology, BI Roles
& Responsibilities, Business Applications of BI, BI best practices.
BASICS OF DATA INTEGRATION (EXTRACTION 9

TRANSFORMATION LOADING)
Concepts of data integration, needs and advantages of using data integration,
III introduction to common data integration approaches, Meta data - types and
sources, Introduction to data quality, data profiling concepts and applications,
introduction to ETL using Pentaho data Integration (formerly Kettle)
INTRODUCTION TO MULTI-DIMENSIONAL DATA MODELING 9

Introduction to data and dimension modeling, multidimensional data model, ER
Modeling vs. multi-dimensional modeling, concepts of dimensions, facts, cubes,
IV
attribute, hierarchies, star and snowflake schema, introduction to business metrics
and KPIs, creating cubes using Microsoft Excel
BASICS OF ENTERPRISE REPORTING 9

A typical enterprise, Malcolm Baldrige - quality performance framework,
V balanced scorecard, enterprise dashboard, balanced scorecard vs. enterprise
dashboard, enterprise reporting using MS Access / MS Excel, best practices in
the design of enterprise dashboards
TOTAL INSTRUCTIONAL HOURS 45
CO1: Understand difference between Transaction Processing and Analytical applications and
describe the need for Business Intelligence
CO2: Demonstrate to understand technology and processes associated with Business
Intelligence framework
Course
CO3: Demonstrate to understand Data Warehouse implementation methodology and project
Outcome
life cycle
CO4: Formulate given a business scenario, identify the metrics, indicators and make
recommendations to achieve the business goal
CO5: Demonstrate application of concepts using open source/MS Office
P a g e | 130
TEXT BOOKS:
T1: “Fundamentals of Business Analytics” by R.N.Prasad and Seema Acharya, Wiley 2011.
T2: “Data Strategy: How To Profit From A World Of Big Data, Analytics And The Internet Of Things” by
Bernard Marr
REFERENCE BOOKS:
R1: Business Intelligence by David Loshin, Second Edition, Elsevier, 2012.
R2: Business intelligence for the enterprise by Mike Biere, IBM Press, 2003.
R3: Business intelligence roadmap by Larissa Terpeluk Moss, Shaku Atre, Addison-Wesley Professional, 2003.
R4: “Data Analytics For Beginners: Your Ultimate Guide To Learn And Master Data Analysis. Get Your
Business Intelligence Right – Accelerate Growth And Close More Sales” by Victor Finch
P a g e | 131

BE 19CS6302 EMBEDDED SYSTEMS 3 0 0 3
1. Learn the architecture and programming of ARM processor.

2. Be familiar with the embedded computing platform design and analysis.
Course 3. Be exposed to the basic concepts of real time Operating system design.
Objective 4. Learn the system design techniques and networks for embedded systems
5. Learn the basic concepts of embedded system to develop the realtime applications.
Instructional
Unit Description
Hours
INTRODUCTION TO EMBEDDED COMPUTING AND ARM
PROCESSORS
Complex systems and micro processors– Embedded system design process –Design
example: Model train controller- Instruction sets preliminaries – ARM Processor –
I 9
CPU: programming input and output- supervisor mode, exceptions and traps – Co-
processors- Memory system mechanisms – CPU performance- CPU power
consumption.
EMBEDDED COMPUTING PLATFORM DESIGN

The CPU Bus-Memory devices and systems–Designing with computing platforms –
consumer electronics architecture – platform-level performance analysis –
Components for embedded programs- Models of programs- Assembly, linking and
II loading – compilation techniques- Program level performance analysis – Software 9
performance optimization – Program level energy and power analysis and
optimization – Analysis and optimization of program size- Program validation and
testing.
PROCESSES AND OPERATING SYSTEMS

Introduction – Multiple tasks and multiple processes – Multirate systems-
Preemptive real-time operating systems- Priority based scheduling- Interprocess
III communication mechanisms – Evaluating operating system performance- power 9
optimization strategies for processes – Example Real time operating systems-
POSIX-Windows CE.
SYSTEM DESIGN TECHNIQUES AND NETWORKS

Design methodologies- Design flows – Requirement Analysis – Specifications-
IV System analysis and architecture design – Quality Assurance techniques- Distributed 9
embedded systems – MPSoCs and shared memory multiprocessors.
CASE STUDY
V Data compressor – Alarm Clock – Audio player – Software modem-Digital still 9
camera – Telephone answering machine-Engine control unit – Video accelerator.
CO1: Understand the architecture and programming of ARM processor.

CO2: Understand and remember the concepts of embedded computing platform design and
Course analysis.
Outcome CO3: Understand the basic concepts of real time Operating system design.
CO4: Apply the system design techniques to develop software for embedded systems.
CO5: Apply the embedded-system concepts to develop the real time applications.
P a g e | 132
TEXT BOOKS:
T1: Marilyn Wolf, “Computers as Components – Principles of Embedded Computing System Design”, Third
Edition “Morgan Kaufmann Publisher (An imprint from Elsevier), 2012.
T2: Shibu. K.V, “Introduction to Embedded Systems”, 2e, Mc graw Hill, 2017.
REFERENCE BOOKS:
R1: Jonathan W.Valvano, “Embedded Microcomputer Systems Real Time Interfacing”, Third Edition Cengage
Learning, 2012.
R2: David. E. Simon, “An Embedded Software Primer”, 1st Edition, Fifth Impression, Addison-Wesley
Professional, 2007.
R3: Raymond J.A. Buhr, Donald L.Bailey, “An Introduction to Real-Time Systems- From Design to
Networking with C/C++”, Prentice Hall,1999.
R4: C.M. Krishna, Kang G. Shin, “Real-Time Systems”, International Editions, Mc Graw Hill 1997.
P a g e | 133

BE 19CS6303 INTERNET OF THINGS 3 0 0 3
1. To understand the basic concepts and various building blocks of Internet of Things
2. To understand Smart Objects and IoT Architectures
Course
3. To build simple IoT Systems using Raspberry Pi
Objective
4. To understand data analytics in the context of IoT and security issues in IoT
5. To develop IoT infrastructure for popular applications
Instructional
Unit Description
Hours
INTRODUCTION TO INTERNET OF THINGS
Definition & Characteristics of IoT, Physical Design of IoT, Things in IoT, IoT
Protocols, Logical Design of IoT, IoT Functional Blocks, IoT Communication
I 9
Models, IoT Communication APIs, IoT Enabling Technologies, IoT Levels and
Deployment Templates
IOT NETWORK ARCHITECTURE AND DESIGN

Drivers Behind New Network Architectures, Comparing IoT Architectures, A
II Simplified IoT Architecture, The Core IoT Functional Stack, IoT Data Management 9
and Compute Stack, The “Things” in IoT
DEVELOPING INTERNET OF THINGS
IoT Design Methodology, IoT Physical Devices and Endpoints: Basic building
blocks of an IoT Device, Exemplary Device: Raspberry Pi, About the Board, Linux
III 9
on Raspberry Pi, Raspberry Pi interfaces, Programming Raspberry Pi with Python,
Other IoT devices
DATA ANALYTICS AND SECURING IOT

DATA ANALYTICS: An Introduction to Data Analytics for IoT, Machine
Learning, Big Data Analytics Tools and Technology, Edge Streaming Analytics,
Network Analytics.SECURING IOT: A Brief History of OT Security, Common
IV 9
Challenges in OT Security, How IT and OT Security Practices and Systems Vary,
Formal Risk Analysis Structures: OCTAVE and FAIR, The Phased Application of
Security in an Operational Environment
CASE STUDIES
Smart and Connected Cities: Smart City IoT Architecture, Street Lighting
Architecture, Smart Parking Architecture and Smart Traffic Control
V 9
Transportation: An IoT Architecture for Transportation, Connected Roadways
Network Architecture, Connected Fleet Architecture, Connected Roadways Security
Weather monitoring system, Air Pollution Monitoring
CO1: Explain the concept of IoT and various building blocks

CO2: Understand various architectures and working of state-of-the-art IoT systems
Course CO3: Design IoT system using Rasperry Pi
Outcome CO4: Apply data analytics related to IoT and evaluate security issues related to the Internet of
Things
CO5: Analyze applications of IoT in real time scenario.
P a g e | 134
TEXT BOOKS:
T1: Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”, Universities Press, 2015
T2: David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry, “IoT Fundamentals:
Networking Technologies, Protocols and Use Cases for Internet of Things”, Cisco Press, 2017.
REFERENCE BOOKS:
R1: Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things – Key applications and
Protocols”, Wiley, 2012.
R2: Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, StamatisKarnouskos, David Boyle, “From
Machine -to-Machine to the Internet of Things: Introduction to a New Age of Intelligence”, 1st Edition,
Academic Press, 2014.
R3: Getting Started with the Internet of Things: Connecting Sensors and Microcontrollers to the Cloud
(Make: Projects) [Kindle Edition] by CunoPfister ,2011
R4: Adrian McEwen &Hakim Cassimally ,”Designing the Internet of Things”- (Nov 2013) .
P a g e | 135

BE 19CS6304 BIG DATA ANALYTICS AND TOOLS 3 0 0 3
1. To know the fundamental concepts of big data and analytics

2. To explore various tools and practices for working with big data
Course
3. To learn about stream computing and its importance
Objective
4. To know about the applications and researches in integration of large amounts of data
5. To apply the logics of security in handling large amount of data
Instructional
Unit Description
Hours
INTRODUCTION TO BIG DATA: Evolution of Big data – Best Practices for Big
data Analytics – Big data characteristics – Validating – The Promotion of the Value
of Big Data – Big Data Use Cases- Characteristics of Big Data Applications –
I Perception and Quantification of Value -Understanding Big Data Storage – A 9
General Overview of High-Performance Architecture – HDFS – MapReduce and
YARN – Map Reduce Programming Model
ACHIEVING ORGANIZATIONAL ALIGNMENT FOR BIG DATA
ANALYTICS: The Culture Clash Challenge- Aspects of Adopting- Right Decision
Makers -Roles-Developing a strategy for Integrating Big data Analytics into
II Enterprise- Strategic Plan-Practices- Acceptability- Scalability- Data Reuse- 9
Oversight and Governance-Mainstream Technology. Case Study: Enterprise
Integration- Exercises
MINING AND MAPREDUCE CONCEPTS: Data Mining- Statistical Limits on
Data Mining- MapReduce and the New Software Stack-Distributed File Systems-
III MapReduce- Algorithms Using MapReduce-Extensions to MapReduce- 9
Applications of Near- Neighbor Search- Shingling of Documents-Similarity-
Preserving Summaries of Sets
STREAM MEMORY: Introduction to Streams Concepts – Stream Data Model and
Architecture – Stream Computing, Sampling Data in a Stream – Filtering Streams –
Counting Distinct Elements in a Stream – Estimating moments – Counting oneness
IV in a Window – Decaying Window – Real time Analytics Platform(RTAP) 9
applications. Case Studies – Real Time Sentiment Analysis, Stock Market
Predictions. Using Graph Analytics for Big Data: Graph Analytics
NOSQL DATA MANAGEMENT FOR BIG DATA AND VISUALIZATION:
NoSQL Databases : Schema-less Models‖: Increasing Flexibility for Data
V 9
Manipulation-Key Value Stores- Document Stores – Tabular Stores – Object Data
Stores – Graph Databases Case Study: Google’s Big Table and its security.
CO1: Better understanding to work with big data tools and its analysis techniques
CO2: Explore about various tools and practices for working with big data
Course
CO3: Learn about stream computing and its importance
Outcome
CO4: Understand about the applications and researches in integration of large amounts of data
CO5: Apply the logics of security in handling large amount of data
TEXT BOOKS:
T1: Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University Press,
2012.
P a g e | 136
T2: David Loshin, “Big Data Analytics: From Strategic Planning to Enterprise Integration with Tools,
Techniques, NoSQL, and Graph”, Morgan Kaufmann/El sevier Publishers, 2013.
REFERENCE BOOKS:
R1: EMC Education Services, “Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data”, Wiley publishers, 2015.
R2: Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science and its Applications”,
Wiley Publishers, 2015.
R3: Dietmar Jannach and Markus Zanker, “Recommender Systems: An Introduction”, Cambridge University
Press, 2010.
R4: Kim H. Pries and Robert Dunnigan, “Big Data Analytics: A Practical Guide for Managers ” CRC Press,
2015.
P a g e | 137

BE 19CS6305 SOFT COMPUTING 3 0 0 3
1. To learn the basic concepts of Soft Computing.

2. To apply Artificial Neural Networks and various categories of ANN.
3. To become familiar with various techniques like neural networks.
Course
4. To apply fuzzy systems, fuzzy logic and its techniques to solve problems.
Objective
5. To learn the concepts of Genetic algorithms based solutions for real-world and
engineering problems.
Instructional
Unit Description
Hours
INTRODUCTION TO SOFT COMPUTING: Introduction-Artificial Intelligence-
Artificial Neural Networks-Fuzzy Systems-Genetic Algorithm and Evolutionary 9
I Programming-Swarm Intelligent Systems-Classification of ANNs-McCulloch and
Pitts Neuron Model-Learning Rules: Hebbian and Delta- Perceptron Network-
Adaline Network-Madaline Network.
ARTIFICIAL NEURAL NETWORKS: Back propagation Neural Networks –
Kohonen Neural Network -Learning Vector Quantization -Hamming Neural 9
II Network – Hopfield Neural Network- Bi-directional Associative Memory -Adaptive
Resonance Theory Neural Networks- Support Vector Machines – Spike Neuron
Models.
FUZZY SYSTEMS: Introduction to Fuzzy Logic, Classical Sets and Fuzzy Sets –
Classical Relations and Fuzzy Relations -Membership Functions -Defuzzification – 9
III Fuzzy Arithmetic and Fuzzy Measures -Fuzzy Rule Base and Approximate
Reasoning – Introduction to Fuzzy Decision Making.
GENETIC ALGORITHMS: Basic Concepts- Working Principles -Encoding-
Fitness Function – Reproduction -Inheritance Operators – Cross Over – Inversion 9
IV and Deletion -Mutation Operator – Bit-wise Operators -Convergence of Genetic
Algorithm.
HYBRID SYSTEMS: Hybrid Systems -Neural Networks, Fuzzy Logic and Genetic
-GA Based Weight Determination – LR-Type Fuzzy Numbers – Fuzzy Neuron – 9
V Fuzzy BP Architecture – Learning in Fuzzy BP- Inference by Fuzzy BP – Fuzzy
ArtMap: A Brief Introduction – Soft Computing Tools – GA in Fuzzy Logic
Controller Design – Fuzzy Logic Controller.
CO1: Apply various soft computing concepts for practical applications.

CO2: Choose and design suitable neural network for real time problems.
Course CO3: Explain the importance of optimization techniques and neural networks.
Outcome CO4: Use fuzzy rules and reasoning to develop decision making and expert system.
CO5: Review the various hybrid soft computing techniques and apply in real time problems.
TEXT BOOKS:
T1: N.P.Padhy, S.P.Simon, “Soft Computing with MATLAB Programming”, Oxford University Press, 2015.
T2: S.N.Sivanandam , S.N.Deepa, “Principles of Soft Computing”, Wiley India Pvt. Ltd., 2nd Edition, 2011.
P a g e | 138
REFERENCE BOOKS:
R1: Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, ―Neuro-Fuzzy and Soft Computing, Prentice-Hall
of India, 2002.
R2: Kwang H.Lee, ―First course on Fuzzy Theory and Applications, Springer, 2005.
R3: George J. Klir and Bo Yuan, ―Fuzzy Sets and Fuzzy Logic-Theory and Applications, Prentice Hall, 1996.
R4: S.Rajasekaran, G.A.Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithm, Synthesis
and Applications “, PHI Learning Pvt. Ltd., 2017.
P a g e | 139

BE 16CS7301 MULTICORE ARCHITECTURE AND 3 0 0 3
PROGRAMMING
1. To understand the need for multi-core processors, and their architecture.

2. To understand the challenges in parallel and multi-threaded programming.
Course 3. To learn about the various parallel programming paradigms such as OpenMP and MPI.
Objective 4. To develop multi-core programs and design parallel solutions.
5. To compare and contrast serial and parallel programming.
Instructional
Unit Description
Hours
MULTI-CORE PROCESSORS
Single core to Multi-core architectures – SIMD and MIMD systems –
I Interconnection networks – Symmetric and Distributed Shared Memory 9
Architectures – Cache coherence – Performance Issues – Parallel program design.
PARALLEL PROGRAM CHALLENGES

Performance – Scalability – Synchronization and data sharing – Data races –
Synchronization primitives (mutex, locks, semaphores, barriers) – deadlocks and
II 9
live locks – communication between threads (condition variables, signals, message
queues and pipes).
SHARED MEMORY PROGRAMMING WITH Open MP

Open MP Execution Model – Memory Model – Open MP Directives – Work-
III
sharing Constructs – Library functions – Handling Data and Functional Parallelism – 9
Handling Loops – Performance Considerations.
DISTRIBUTED MEMORY PROGRAMMING WITH MPI

MPI program execution – MPI constructs – libraries – MPI send and receive –
IV
Point-to-point and Collective communication – MPI derived data types – 9
Performance evaluation.
PARALLEL PROGRAM DEVELOPMENT: Case studies – n-Body solvers –

V 9
Tree Search – Open MP and MPI implementations and comparison.
CO1: Describe multi-core architectures and identify their characteristics and challenges.
CO2: Identify the issues in programming Parallel Processors.
Course CO3: Write programs using Open MP and MPI.
Outcome CO4: Design parallel programming solutions to common problems.
CO5: Compare and contrast programming for serial processors and programming for parallel
processors.
TEXT BOOKS:
T1: Peter S. Pacheco, ―An Introduction to Parallel Programming, Morgan-Kauffman/Elsevier, 2011.
T2: Darryl Gove, ―Multicore Application Programming for Windows, Linux, and Oracle Solaris, Pearson,
2011.
P a g e | 140
REFERENCE BOOKS:
R1: Michael J Quinn, ―Parallel programming in C with MPI and OpenMP, Tata McGraw Hill,2003.
R2: Victor Alessandrini, Shared Memory Application Programming, 1st Edition, Concepts and Strategies in
Multicore Application Programming, Morgan Kaufmann, 2015.
R3: Yan Solihin, Fundamentals of Parallel Multicore Architecture, CRC Press, 2015.
R4: Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.
P a g e | 141

BE 16CS7302 CYBER FORENSICS 3 0 0 3
1. To Learn basics of Computer Forensics

2. Be familiar with forensics tools
Course
3. Learn to analyze and validate forensics data
Objective
4. To gain the Knowledge about the Ethical Hacking
5. To Understand the concepts of Ethical hacking in web applications
Instructional
Unit Description
Hours
INTRODUCTION TO COMPUTER FORENSICS

An overview of Digital Forensics-Preparing for digital forensics-preparing a Digital
I 9
Forensics Investigation. Data Acquisition: Understanding Storage Formats for
Digital Evidence-Validating Data Acquisitions-Performing RAID Data Acquisition-
Using Network Acquisition Tools-Using other Forensics Acquisition Tools.
EVIDENCE COLLECTION AND FORENSICS TOOLS
Processing Crime and Incident Scenes – Working with Windows and DOS Systems.
II 9
Current Computer Forensics Tools: Software/ Hardware Tools.
ANALYSIS AND VALIDATION

Validating Forensics Data – Data Hiding Techniques – Performing Live Acquisition
III
– Network Forensics – Email Investigations – Cell Phone and Mobile Devices 9
Forensics
ETHICAL HACKING
Introduction to Ethical Hacking – Foot printing – Scanning
IV
Networks – Enumeration – System Hacking – Malware Threats :Trojan and 9
Backdoors – Sniffing
ETHICAL HACKING IN WEB

Social Engineering – Denial of Service – Session Hijacking – Hacking Web servers
V 9
– Hacking Web Applications –Web based Password Cracking Techniques– SQL
Injection – Hacking Wireless Networks – Hacking Mobile Platforms.
CO1: Understand the basics of computer forensics

Course CO2: Apply a number of different computer forensic tools to a given scenario
Outcome CO3: Apply and validate forensics data
CO4: Understand about Ethical hacking
CO5: Implement real-world hacking techniques in Ethical hacking.
TEXT BOOKS:
T1: Bill Nelson, Amelia Phillips, Frank Enfinger, Christopher Steuart, ―Computer Forensics and
Investigations, Cengage Learning, India Edition, 2016.
T2: CEH official Certfied Ethical Hacking Review Guide, Wiley India Edition, 2015.
P a g e | 142
REFERENCE BOOKS:
R1: John R.Vacca, ―Computer Forensics, Cengage Learning, 2005
R2: MarjieT.Britz, ―Computer Forensics and Cyber Crime: An Introduction, 3rd Edition, Prentice Hall, 2013.
R3: AnkitFadia ― Ethical Hacking Second Edition, Macmillan India Ltd, 2006
R4: Kenneth C.Brancik ―Insider Computer Fraud Auerbach Publications Taylor & Francis Group–2008.
P a g e | 143

BE 19CS7303 WIRELESS SENSOR NETWORKS 3 0 0 3
1. To understand the fundamentals of wireless communication technology and modulation

techniques.
2. To learn the concepts of Adhoc networks and design issues of sensor networks.
Course
3. To understand the architecture and protocols of wireless sensor networks
Objective
4. To understand the design issues and to learn the concepts of routing protocols
5. To understand the various challenges in providing Qos and to learn about energy
management.
Instructional
Unit Description
Hours
INTRODUCTION
Introduction: Fundamentals of wireless communication technology, the
electromagnetic spectrum radio propagation, characteristics of wireless channels,
I 9
modulation techniques, multiple access techniques, wireless LANs, PANs, WANs,
and MANs, Wireless Internet.
AD HOC NETWORKS – INTRODUCTION

Introduction to Adhoc/sensor networks: Key definitions of adhoc/ sensor networks,
unique constraints and challenges, advantages of ad-hoc/sensor network, driving
II 9
applications, issues in adhoc wireless networks, issues in design of sensor network,
sensor network architecture, data dissemination and gathering
WIRELESS SENSOR NETWORKS (WSNS) AND MAC PROTOCOLS

Single node architecture: hardware and software components of a sensor node –
WSN Network architecture: typical network architectures-data relaying and
III 9
aggregation strategies -MAC layer protocols: self-organizing, Hybrid
TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.
WSN ROUTING PROTOCOLS

Routing Protocols: Issues in designing a routing protocol, classification of routing
IV protocols, table-driven, on-demand, hybrid, flooding, hierarchical, and power aware 9
routing protocols.
QOS AND ENERGY MANAGEMENT

QoS: Issues and Challenges in providing QoS, classifications, MAC, network layer
V solutions, QoS frameworks, Need for energy management, classification, battery, 9
transmission power, and system power management schemes. Case study: Energy
Efficient Environmental monitoring.
CO1: Explain the concepts and applications of various wireless communication techniques.
CO2: Analyze the design issues of ad hoc and sensor networks.
Course CO3: Learn architecture of various wireless sensor networks and MAC protocols
Outcome CO4: To analyze the design issues and concepts of routing protocols.
CO5: Evaluate the QoS related performance measurements of WIRE LESS sensor networks
and real time case studies.
P a g e | 144
TEXT BOOKS:
T1: C. Siva Ram Murthy, and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and Protocols
“, Prentice Hall Professional Technical Reference, 2008.
T2: Feng Zhao and Leonides Guibas, “Wireless Sensor Networks”, Elsevier Publication – 2002
REFERENCE BOOKS:
R1: Carlos De Morais Cordeiro, Dharma Prakash Agrawal “Ad Hoc & Sensor Networks: Theory and
Applications”,World Scientific Publishing Company, 2006.
R2: Holger Karl and Andreas Willig “Protocols and Architectures for Wireless Sensor Networks”, Wiley, 2005.
R3: Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-Technology, Protocols, and
Applications”, John Wiley, 2007.
R4: Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.
P a g e | 145

BE 19CS7304 C# and .NET AND PROGRAMING 3 0 0 3
1. To understand the basics of C# and .NET.

2. To implement the C# language constructs and OOP.
Course 3. To implement advanced programming in C#.
Objective 4. Fundamental window programming.
5. Build web based applications using c#.
Instructional
Unit Description
Hours
INTRODUCTION TO C#
Introducing C#, Understanding .NET, overview of C#, Literals, Variables, Data
I Types, Operators, checked and unchecked operators, Expressions, Branching, 9
Looping, Methods, implicit and explicit casting, Constant, Arrays, Array Class,
Array List, String, String Builder, Structure, Enumerations, boxing and unboxing.
OBJECT ORIENTED ASPECTS OF C#
Class, Objects, Constructors and its types, inheritance, properties, indexers, index
II overloading, polymorphism, sealed class and methods, interface, abstract class, 9
abstract and interface, operator overloading, delegates, events, errors and exception,
Threading.
APPLICATION DEVELOPMENT ON .NET
Building windows application, Creating our own window forms with events and
controls, menu creation, inheriting window forms, SDI and MDI application, Dialog
III Box(Modal and Modeless), accessing data with ADO.NET, DataSet, typed dataset, 9
Data Adapter, updating database using stored procedures, SQL Server with
ADO.NET, handling exceptions, validating controls, windows application
configuration.
WEB BASED APPLICATION DEVELOPMENT ON .NET
Programming web application with web forms, ASP.NET introduction, working
with XML and .NET,Creating Virtual Directory and Web Application, session
IV 9
management techniques, web.config, web services, passing datasets, returning
datasets from web services, handling transaction, handling exceptions, returning
exceptions from SQL Server.
CLR AND .NET FRAMEWORK
V Assemblies, Versoning, Attributes, reflection, viewing meta data, type discovery, 9
reflection on type, marshalling, remoting, security in .NET.
CO1: To learn the basics of .net Frame work and C# language.

CO2: To learn C# elements and OOPS concepts.
CO3: To learn interface and inheritance concepts in C# language.
Course
CO4: To learn fundamentals of window application programming and create a window
Outcome
application.
CO5: To develop web applications and learn advanced features of C#.
P a g e | 146
TEXT BOOKS:
T1: Stanley B.Lippman , “C# Primer : A practical approach”, Pearson Education,1991.
T2: David.S.Platt, Introducing Microsoft . Net , Microsoft Press, 3rd, Edition, 2003.
REFERENCE BOOKS:
R1: Ben Albahari, Pter Drayton, Brad Merrill, “C# Essentials”, Oreilly& Associates, 2001.
R2: E.Balagurusamy, Programming in C # Tata McGraw Hill, 2002.
R3: Conard.J., et.al., Introducting .Net, wrox Press, 2000.
R4: Eric Gunnerson , “A Programmers Introduction to C# “,A Press, 2000.
P a g e | 147

BE 19CS7305 SOFTWARE TESTING 3 0 0 3
1. To learn the criteria for test cases.

2. To learn the design of test cases.
Course
3. To understand test management and test automation techniques.
Objective
4. To apply test metrics and measurements.
5. To document test plans and test cases designed.
Instructional
Unit Description
Hours
INTRODUCTION
Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic
definitions – Software Testing Principles – The Tester‟s Role in a Software
I Development Organization – Origins of Defects – Cost of defects – Defect Classes – 9
The Defect Repository and Test Design – Defect Examples – Developer/Tester
Support of Developing a Defect Repository – Defect Prevention strategies.
TEST CASE DESIGN

Test case Design Strategies – Using Black Bod Approach to Test Case Design –
Random Testing – Requirements based testing – Boundary Value Analysis –
Equivalence Class Partitioning – State-based testing – Cause-effect graphing –
II Compatibility testing – user documentation testing – domain testing – Using White 9
Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural
testing – code functional testing – Coverage and Control Flow Graphs – Covering
Code Logic – Paths – code complexity testing – Evaluating Test Adequacy Criteria.
LEVELS OF TESTING
The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit
Tests – The Test Harness – Running the Unit tests and Recording results – Integration
tests – Designing Integration Tests – Integration Test Planning – Scenario testing –
III Defect bash elimination System Testing – Acceptance testing – Performance testing – 9
Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests
– Testing OO systems – Usability and Accessibility testing – Configuration testing –
Compatibility testing – Testing the documentation – Website testing.
TEST AMANAGEMENT
People and organizational issues in testing – Organization structures for testing teams
– testing services – Test Planning – Test Plan Components – Test Plan Attachments –
Locating Test Items – test management – test process – Reporting Test Results – The
IV 9
role of three groups in Test Planning and Policy Development – Introducing the test
specialist – Skills needed by a test specialist – Building a Testing Group - Capability
Maturity Model (CMM) – Project Maturity Model (PMM).
TEST AUTOMATION
Software test automation – skill needed for automation – scope of automation –
design and architecture for automation – requirements for a test tool – challenges in
V 9
automation – Test metrics and measurements – project, progress and productivity
metrics. Tools: Selenium, TestingWhiz, Sahi, Tosca Testsuite and Katalon
Studio.
P a g e | 148
CO1: Prepare test planning based on the document.

Course CO2: Design test cases suitable for a software development for different domains.
CO3: Use automatic testing tools.
Outcome
CO4: Develop and validate a test plan.
CO5: Document test plans and test cases designed.
TEXT BOOKS:
T1: “The Art of Software Testing”, Second Edition, Glenford J. Myers, Corey Sandler, Tom Badgett,
Wiley, 2004.
T2: Paul C. Jorgensen Software Testing: A Craftsman’s Approach, Fourth Edition, CRC Press, 2013.
REFERENCE BOOKS:
R1: Testing Computer Software, Cem Kaner, Jack Falk, Hung Quoc Nguyen, Second edition ,Wiley
Publications,2010
R2: Ron Patton, ―Software Testing, Second Edition, Sams Publishing, Pearson Education, 2007. AU
Library.com
R3: James Whittaker- How to Break Software: A Practical Guide to Testing, May 2002.
R4: Mark Fewster and Dorothy Graham-“Software Test Automation – Effective Use of Test Execution
Tools”, May 2000.
P a g e | 149

BE 19CS8301 DIGITAL IMAGE PROCESSING 3 0 0 3
1. To learn the fundamentals of digital image processing

2. To Understand simple image enhancement techniques in Spatial and Frequency domain
Course
3. To learn concepts of degradation function and restoration techniques.
Objective
4. To understand image segmentation and representation strategies.
5. To apply image compression and recognition methods
Instructional
Unit Description
Hours
DIGITAL IMAGE FUNDAMENTALS: Steps in Digital Image Processing –
Components – Elements of Visual Perception – Image Sensing and Acquisition –
I Image Sampling and Quantization – Relationships between pixels - Color image 9
fundamentals - RGB, HSI models, Two-dimensional mathematical preliminaries, 2D
transforms - DFT, DCT.
IMAGE ENHANCEMENT: Spatial Domain: Gray level transformations –
Histogram processing – Basics of Spatial Filtering– Smoothing and Sharpening
Spatial Filtering, Frequency Domain: Introduction to Fourier Transform– Smoothing
II 9
and Sharpening frequency domain filters – Ideal, Butterworth and Gaussian filters,
Homomorphic filtering, Color image enhancement.
IMAGE RESTORATION: Image Restoration - degradation model, Properties,

Noise models – Mean Filters – Order Statistics – Adaptive filters – Band reject
III Filters – Band pass Filters – Notch Filters – Optimum Notch Filtering – Inverse 9
Filtering – Wiener filtering
IMAGE SEGMENTATION: Edge detection, Edge linking via Hough transform –

Thresholding - Region based segmentation – Region growing – Region splitting and
merging – Morphological processing- erosion and dilation, Segmentation by
IV 9
morphological watersheds – basic concepts – Dam construction – Watershed
segmentation algorithm.
IMAGE COMPRESSION AND RECOGNITION: Need for data compression,

Huffman, Run Length Encoding, Shift codes, Arithmetic coding, JPEG standard,
V MPEG. Boundary representation, Boundary description, Fourier Descriptor, 9
Regional Descriptors – Topological feature, Texture - Patterns and Pattern classes -
Recognition based on matching.
CO1: Learn the basic concepts of digital image processing like sampling, sensing and color
images
Course CO2: Understand simple image enhancement techniques in Spatial and Frequency domain
Outcome CO3: Learn the restoration concepts and filtering techniques.
CO4: Understand the basics of segmentation, features extraction
CO5: Apply the concept of compression and recognition methods for color models.
TEXT BOOKS:
T1: Rafael C. Gonzalez, Richard E. Woods, ‘Digital Image Processing‘, Pearson, Third Edition, 2010.
P a g e | 150
T2: S.Jayaraman, S.Esakkirajan, T.Veerakumar, “Digital Image Processing” Tata McGrawHill,2009
REFERENCE BOOKS:
R1: Kenneth R. Castleman, ‘Digital Image Processing‘, Pearson, 2007.
R2: William K. Pratt, ‘Digital Image Processing‘, John Wiley, New York, 2002
R3: Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011.
R4: Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First Edition, PHI Learning Pvt.
Ltd., 2011.
P a g e | 151

BE 19CS8302 HIGH SPEED NETWORKS 3 0 0 3
1. To understand the challenges of High Speed Networks and its related performance.
2. To analyze the cause of congestion, Frame relay and related factors.
Course 3. To analyze the cause of ATM congestion control, TCP flow control and related factors
Objective for Quality of Service
4. To understand resource allocation and service management approaches.
5. To understand network management and its protocols.
Instructional
Unit Description
Hours
HIGH SPEED NETWORKS: Introduction-frame relay networks –ATM protocol
architecture-ATM logical connection –ATM cells-ATM service categories -AAL-
I high speed LANS: the emergence of high speed LANS-Ethernets-fiber channel- 9
wireless LANS
CONGESTION AND TRAFFIC MANAGEMENT: Queuing Analysis- Queuing
Models – Single Server Queues – Effects of Congestion – Congestion Control –
II Traffic Management – Congestion Control in Packet Switching Networks – Frame 9
Relay Congestion Control.
TCP AND ATM CONGESTION CONTROL: TCP Flow control – TCP
Congestion Control – Retransmission – Timer Management – – Window
III management – Performance of TCP over ATM. Traffic and Congestion control in 9
ATM – Requirements – Attributes – Traffic Management Frame work, Traffic
Control – ABR traffic Management.
INTEGRATED AND DIFFERENTIATED SERVICES: Integrated Services
IV Architecture – Approach, Components, Services- Queuing Discipline, FQ, PS, 9
BRFQ, GPS, WFQ – Random Early Detection, Differentiated Services
PROTOCOLS FOR QOS SUPPORT : RSVP – Goals & Characteristics, Data
Flow, RSVP operations, Protocol Mechanisms – Multiprotocol Label Switching –
V Operations, Label Stacking, Protocol details – RTP – Protocol Architecture, Data 9
Transfer Protocol, RTCP.
CO1: Understand the challenges of High Speed Networks and its related performance.
CO2: Analyze the cause of congestion, Frame relay and related factors.
Course CO3: Analyze the cause of ATM congestion control, TCP flow control and related factors for
Outcome Quality of Service.
CO4: Understand resource allocation and service management approaches.
CO5: Understand network management and its protocols.
TEXT BOOKS:
T1: William Stallings, “HIGH SPEED NETWORKS AND INTERNET”, Pearson Education, Second Edition,
2002.
T2: Behrouz A. Forouzan, “Data Communication And Computer Networking”, 4th, 2011
P a g e | 152
REFERENCE BOOKS:
R1: Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION NETWORKS”, Jean Harcourt
Asia Pvt. Ltd., II Edition, 2001.
R2: Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “Mpls and Vpn Architecture”,
Volume 1 and 2, Cisco Press, 2003
R3: Adrian Farrel,” The Internet And Its Protocols”, Elsevier Publications, 2011
R4: Fred Halsall: Data Communication Computer Networks, And Open Systems:Addison Wesley,
Fifth edition, 2005.
P a g e | 153

BE 19CS8303 INFORMATION SECURITY 3 0 0 3
1. To understand the basics of Information Security.

2. To know the legal, ethical and professional issues in Information Security.
Course 3. To know the aspects of risk management.
Objective
4. To become aware of various standards in this area.
5. To know the technological aspects of Information Security.
Instructional
Unit Description
Hours
INTRODUCTION
History, Definition-Information Security, Critical Characteristics of Information,
I NSTISSC Security Model, Components of an Information System, Securing the 9
Components, Balancing Security and Access, The SDLC, The Security SDLC.
SECURITY INVESTIGATION
Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional
II Issues - An Overview of Computer Security - Access Control Matrix, Policy- 9
Security policies, Confidentiality policies, Integrity policies and Hybrid policies.
SECURITY ANALYSIS
Risk Management: Identifying and Assessing Risk, Assessing and
III Controlling Risk - Systems: Access Control Mechanisms, Information Flow 9
and Confinement Problem.
LOGICAL DESIGN
Blueprint for Security, Information Security Policy, Standards and Practices, ISO
IV 17799/BS 7799, NIST Models, VISA International Security Model, Design of 9
Security Architecture, Planning for Continuity.
PHYSICAL DESIGN
V Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access 9
Control Devices, Physical Security, Security and Personnel.
CO1: To discuss the basics of information security.

Course CO2: To illustrate the legal, ethical and professional issues in information security.
Outcome CO3: To demonstrate the aspects of risk management.
CO4: To become aware of various standards in the Information Security System.
CO5: To design and implementation of Security Techniques.
TEXT BOOKS
T1: Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas Publishing House,
New Delhi, 2017.
T2: Mark Stamp, “Information Security: Principles and Practice”, John Wiley and Sons, 2011.
P a g e | 154
REFERENCE BOOKS
Micki Krause, Harold F. Tipton, “Handbook of Information Security Management”, Vol 1-3 CRCPress
R1:
LLC, 2004.
R2: Stuart McClure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw- Hill, 2003.
R3: Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2002.
Alexander, David; Finch, Amanda; Sutton, David; Taylor, Andy, “Information Security Management
R4:
Principles, BCS Learning & Development Ltd, 2013.
P a g e | 155

BE 19CS8304 HUMAN COMPUTER INTERACTION 3 0 0 3
1. To learn the foundations of Human Computer Interaction.

2. To understand the design technologies for individuals and persons with disabilities.
Course 3. To understand the mobile human computer interaction.
Objective 4. To learn to design augmented reality and data visualization
5. To learn the guidelines for mobile user interface
Instructional
Unit Description
Hours
FOUNDATIONS OF HCI: The Human: I/O channels – Memory – Reasoning and
problem solving; The computer: Devices – Memory – processing and networks;
I Interaction: Models – frameworks – Ergonomics – styles – elements – interactivity- 9
Paradigms.
DESIGN & SOFTWARE PROCESS: Interactive Design basics – process –
scenarios – navigation – screen design – Iteration and prototyping. HCI in software
II process – software life cycle – usability engineering – Prototyping in practice – 9
design rationale. Design rules – principles, standards, guidelines, rules. Evaluation
Techniques – Universal Design.
MODELS AND THEORIES: Cognitive models –Socio-Organizational issues and
III stake holder requirements –Communication and collaboration models-task analysis- 9
models of the system
AUGMENTED REALITY: Ubiquitous computing and augmented realities-
IV Ubiquitous computing application research-virtual and augmented reality- 9
information and data visualization-Hypertext, Multimedia and WWW
MOBILE HCI: Mobile Ecosystem: Platforms, Application frameworks- Types of
V Mobile Applications: Widgets, Applications, Games- Mobile Information 9
Architecture, Mobile 2.0, Mobile Design: Elements of Mobile Design, Tools.
CO1: Design effective dialog for HCI.

Course CO2: Design effective HCI for individuals and persons with disabilities.
CO3: Understand the mobile human computer interaction.
Outcome
CO4: Understand the augmented reality and data visualization and websites
CO5: Apply the HCI implications for designing mobile applications.
TEXT BOOKS:
T1: Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, 3rd Edition,
Pearson Education, 2004 (UNIT I - IV).
T2: Brian Fling, “Mobile Design and Development”, First Edition , O’Reilly Media Inc., 2009 (UNIT –V).
P a g e | 156
REFERENCE BOOKS:
R1: Ben Shneiderman, Catherine Plaisant,“Designing the User Interface”, 6th Edition., et al., Addison
Wesley, 2017.
R2: Faulkner, “The essence of Human-Computer Interaction”, Prentice Hall, 1998
R3: Barfield L, “The user interface: concepts & design”, Addison Wesley, 1993
R4: Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly, 2009.
P a g e | 157

BE 19CS8305 RESPONSIVE WEB DESIGN 3 0 0 3
1. To identify the various issues of web design process and evaluation..

2. To determine templates for web pages and layout.
Course
3. To develop simple web applications using scripting languages..
Objective
4. To determine the various issues of web project development.
5. To address the core issues of web page maintenance and evaluation.
Instructional
Unit Description
Hours
INTRODUCTION TO HTML AND XHTML 6

I Origins and Evolution of HTML - Basic Syntax - Standard HTML Document
Structure - Basic Text Formatting - Images - Hypertext Links – Lists - Tables -
Frames and Forms.
CASCADING STYLE SHEETS
II 7
Introduction - Levels of Style Sheets - Style Specification Formats – Style Classes -
Properties and Property Values - Color - The span and div Tags.
HTML 5
III Media Queries supporting different viewports – Syntax - Fluid Layouts- Fluid 10
Images- Serving Different Images for different screen sizes - HTML 5 for
responsive designs - semantic elements in HTML5 – Embedding Media in HTML5.
CSS 3
IV Selectors - Typography and Color Modes – Aesthetics with CSS3 – Text shadows - 10
Box shadows - Background Gradients – patterns - Multiple Background images
Transitions - Transformations and Animations Forms with HTML5 and CSS3.
BASICS OF JAVASCRIPT
Basic OOPS Concepts - Introduction to JavaScript - JavaScript & HTML – The
DOM: Objects in the Browser - Conditionals & Control Flow - Repetitive Code.
V JavaScript framework: Angular JS, Express JS, Jest. 12
jQUERY: Introduction to jQuery - Working with jQuery Objects – Reading
JavaScript Documentation - Libraries, Plugins, and Widgets - Loops, Chaining and
Refactoring - Using jQuery Plugins.
CO1: Identify the various issues of web design process and evaluation.
Course CO2: Determine templates for web pages and layout.
Outcome CO3: Develop simple web applications using scripting languages.
CO4: Determine the various issues of web project development.
CO5: Address the core issues of web page maintenance and evaluation.
TEXT BOOKS:
T1: Ben Frain, ―Responsive Web Design using HTML5 and CSS3, PACKT Publishing, 2012.
T2: Thomas Powell and Fritz Schneider, Javascript 2.0 : The Complete reference, Tata McGraw Hill,2012.
P a g e | 158
REFERENCE BOOKS:
R1: Thomas Powell, ― HTML and CSS: The Complete Reference‖, Tata McGraw Hill, 2010.
R2: Jehl, Scott, Marcotte, Ethan (2014), Responsible responsive design. New York : A Book Apart (188 p).
R3: http://webdesignbyolga.com/responsive/
R4: Ethan Marcotte, ”Responsive Web Design”,May 25, 2010
P a g e | 159

BE 19CS8306 INFORMATION RETRIEVAL TECHNIQUES 3 0 0 3
1. To understand the basic concepts and techniques in Information Retrieval.

2. To understand how statistical models of text can be used in Information Retrieval
Course
3. To understand machine learning techniques for text classification and clustering.
Objective
4. To understand various search engine system operations.
5. To learn different techniques of recommender system.
Instructional
Unit Description
Hours
INTRODUCTION
Information Retrieval – Early Developments – The IR Problem – The Users Task –
Information versus Data Retrieval - The IR System – The Software Architecture of
I 9
the IR System – The Retrieval and Ranking Processes - The Web – The e-Publishing
Era – How the web changed Search – Practical Issues on the Web – How People
Search – Search Interfaces Today – Visualization in Search Interfaces
MODELING AND RETRIEVAL EVALUATION
Basic IR Models - Boolean Model - TF-IDF (Term Frequency/Inverse Document
Frequency) Weighting - Vector Model – Probabilistic Model – Latent Semantic
II 9
Indexing Model – Neural Network Model – Retrieval Evaluation – Retrieval Metrics
– Precision and Recall – Reference Collection – User-based Evaluation – Relevance
Feedback and Query Expansion – Explicit Relevance Feedback.
INDEXING
Static and Dynamic Inverted Indices – Index Construction and Index Compression.
Searching - Sequential Searching and Pattern Matching. Query Operations -Query
III 9
Languages – Query Processing - Relevance Feedback and Query Expansion -
Automatic Local and Global Analysis – Measuring Effectiveness and Efficiency
WEB RETRIEVAL AND WEB CRAWLING

The Web – Search Engine Architectures – Cluster based Architecture – Distributed
Architectures – Search Engine Ranking – Link based Ranking – Simple Ranking
IV Functions – Learning to Rank – Evaluations -- Search Engine Ranking – Search 9
Engine User Interaction – Browsing – Applications of a Web Crawler – Taxonomy –
Architecture and Implementation – Scheduling Algorithms – Evaluation
RECOMMENDER SYSTEM
Recommender Systems Functions – Data and Knowledge Sources –
V Recommendation Techniques – Basics of Content-based Recommender Systems – 9
High Level Architecture – Advantages and Drawbacks of Content-based Filtering –
Collaborative Filtering – Matrix factorization models – Neighborhood models.
CO1: Use an open source search engine framework and explore its capabilities
CO2: Apply appropriate IR Models
Course
Outcome CO3: Apply appropriate method of classification or clustering
CO4: Design and implement innovative features in a search engine
CO5: Design and implement a recommender system
P a g e | 160
TEXT BOOKS:
T1: Bengio, Yoshua, Ian J. Goodfellow, and Aaron Courville. "Deep learning." An MIT Press book, 2016.
T2: Ricardo Baeza-Yates and Berthier Ribeiro-Neto, ―Modern Information Retrieval: The Concepts and
Technology behind Search, Second Edition, ACM Press Books, 2011.
REFERENCE BOOKS:
R1: Bengio, Yoshua. "Learning deep architectures for AI." Foundations and trends in Machine Learning 2.1
(2009): 1127.
R2: Pattern Recognition and Machine Learning, Christopher Bishop, 2007
R3: Neural Networks: A Systematic Introduction, Raúl Rojas, 1996
R4: Mark Levene, An Introduction to Search Engines and Web Navigation, 2 nd Edition Wiley, 2010.
P a g e | 161

BE 19CS8307 USER INTERFACE DESIGN 3 0 0 3
1.
To learn the basics of User Interface Design.
2.
To understand the process of design interface and business functions.
Course
3.
To understand the concepts of screen design, web systems, windows and menus.
Objective 4.
To learn about multimedia and to design effective web pages.
5.
To understand the design process and to evaluate user interface design.
Instructional
UNIT Description
Hours
INTERACTIVE SOFTWARE AND INTERACTION DEVICE
Human–Computer Interface – Characteristics of Graphics Interface –Direct
I Manipulation Graphical System – Web User Interface –Popularity –Characteristic & 9
Principles.
HUMAN COMPUTER INTERACTION

User Interface Design Process – Obstacles –Usability –Human Characteristics In
Design – Human Interaction Speed –Business Functions –Requirement Analysis –
II 9
Direct – Indirect Methods – Basic Business Functions – Design Standards – General
Design Principles – Conceptual Model Design – Conceptual Model Mock-Ups.
WINDOWS
Characteristics– Components– Presentation Styles– Types– Managements–
Organizations– Operations– Web Systems– System Timings - Device– Based
Controls Characteristics– Screen – Based Controls –– Human Consideration In
III Screen Design – Structures Of Menus – Functions Of Menus– Contents Of Menu– 9
Formatting – Phrasing The Menu – Selecting Menu Choice– Navigating Menus–
Graphical Menus. Operate Control – Text Boxes– Selection Control– Combination
Control– Custom Control– Presentation Control.
MULTIMEDIA
Text for Web Pages – Effective Feedback– Guidance & Assistance–
IV Internationalization– Accessibility– Icons– Image– Multimedia – Coloring- Case 9
Study: Addressing usability in E- Commerce sites.
DESIGN PROCESS AND EVALUATION

V User Interface Design Process - Usability Testing - Usability Requirements and 9
Specification procedures and techniques- User Interface Design Evaluation
CO1: Learn the basics of User Interface Design.

Course CO2: Analyze the requirements of User Interface Design Process and Business functions.
CO3: Understand and analyze various controls of screen, web systems, windows and menus.
Outcome
CO4: Design web pages using multimedia.
CO5: Analyze the user interface requirements and design process.
TEXT BOOKS:
T1: Wilbent. O. Galitz ,“The Essential Guide to User Interface Design”, John Wiley& Sons, 2002.
T2: Ben Sheiderman, “Design the User Interface”, Pearson Education, 1998.
P a g e | 162
REFERENCE BOOKS:
R1: Alan Cooper, “The Essential of User Interface Design”, Wiley – Dream Tech Ltd., 2002..
R2 Designing Interfaces: Patterns for Effective Interaction Design by Jenifer Tidwell, Orelly Publications,
2005.
R3: Sharp, Rogers, Preece, ‘Interaction Design’, Wiley India Edition, 2007.
R4: Alan Dix et al, " Human - Computer Interaction ", Prentice Hall, 1993.
P a g e | 163

BE 19CS8308 VISUALIZATION TECHNIQUES 3 0 0 3
1. To know the basics of Data Representation

2. To understand the importance of data visualization.
Course 3. To learn Non-Computer Visualization and Fisheye views
Objective 4.To know the different dimensions of visualization techniques
5. To create various visualizations
Instructional
Unit Description
Hours
INTRODUCTION
Introduction – Issues – Data Representation – Data Presentation – Common
I 9
Mistakes in design
FOUNDATIONS FOR DATA VISUALIZATION

Visualization stages – Experimental Semiotics based on Perception Gibson’s
II Affordance theory – A Model of Perceptual Processing – power of visual 9
perception-Types of Data-visualization and data objects.
COMPUTER VISUALIZATION
Non-Computer Visualization – Computer Visualization: Exploring Complex
III Information Spaces – Fisheye Views – Applications – Comprehensible Fisheye 9
views – Fisheye views for 3D data – Interacting with visualization
MULTIDIMENSIONAL VISUALIZATION
IV One Dimension – Two Dimensions – Three Dimensions – Multiple Dimensions – 9
Trees – Web Works – Data Mapping: Document Visualization – Workspaces.
CASE STUDIES
V Small interactive calendars – Selecting one from many – Web browsing through a 9
key hole – Communication analysis – Archival analysis
Course CO1: Understand the fundamentals of data representation

Outcome CO2: Implement the concepts of data visualization and data objects
CO3: Explore complex information spaces and applications of fisheye view
CO4: Implement the different dimensions of Visualization Techniques
CO5: Illustrate various examples of Visualization
TEXT BOOKS:
T1:Colin Ware “Information Visualization Perception for Design” Margon Kaufmann Publishers,2004,
2nd edition.
T2: Robert Spence “Information visualization – Design for interaction”, Pearson Education, 2nd edition,2007
P a g e | 164
REFERENCE BOOKS:
R1: Stephen Few, “Information Dashboard Design-The Effective Visual Communication of Data”:
O'Reilly Media Publisher,1st Edition 2006
R2: Stuart.K.Card, Jock.D.Mackinlay and Ben Shneiderman, “Readings in Information Visualization
Using Vision to think”, Morgan Kaufmann Publishers
R3: Thomas Strothotte, ―Computer Visualization–Graphics Abstraction and Interactivity‖, Springer, 2011
R4: ChaomeiChan,“InformationVisualization”,Beyondthehorizon,2ndedition,SpringerVerlag,2004.
P a g e | 165

BE 19CS8309 DEEP LEARNING 3 0 0 3
1. To learn the foundation of deep networks and optimization algorithms of deep learning
2. To study about the various models for Deep Learning
Course
3. To know the essence of deep learning merging with python
Objective
4. To be familiar with Tensor flow for learning Deep networking
5. To study the various applications of Deep Learning Techniques
Instructional
Description
Unit Hours
BASICS
Biological Neuron, Idea of computational units, McCulloch–Pitts unit and Thresholding
I logic, Linear Perceptron, Perceptron Learning Algorithm, Linear separability. 9
Convergence theorem for Perceptron Learning Algorithm.
FEEDFORWARD NETWORKS
Multilayer Perceptron, Gradient Descent, Backpropagation, Empirical Risk Minimization,
II regularization, autoencoders. DEEP NEURAL NETWORKS: Difficulty of training deep 9
neural networks, Greedy layerwise training.
BETTER TRAINING OF NEURAL NETWORKS

Newer optimization methods for neural networks (Adagrad, adadelta, rmsprop, adam,
NAG), second order methods for training, Saddle point problem in neural networks,
III Regularization methods (dropout, drop connect, batch normalization). RECURRENT 10
NEURAL NETWORKS: Back propagation through time, Long Short Term Memory,
Gated Recurrent Units, Bidirectional LSTMs, Bidirectional RNNs.
CONVOLUTIONAL NEURAL NETWORKS: LeNet, AlexNet.
GENERATIVE MODELS
Restrictive Boltzmann Machines (RBMs), Introduction to MCMC and Gibbs Sampling,
IV gradient computations in RBMs, Deep Boltzmann Machines. RECENT TRENDS: 9
Variational Autoencoders, Generative Adversarial Networks, Multi-task Deep Learning,
Multi-view Deep Learning.
APPLICATIONS OF DEEP LEARNING TO COMPUTER VISION

Image segmentation, object detection, automatic image captioning, Image generation
V with Generative adversarial networks, video to text with LSTM models. Attention 8
models for computer vision tasks. APPLICATIONS OF DEEP LEARNING TO
NLP: Introduction to NLP and Vector Space Model of Semantics.
CO1: Understand the concepts of deep networks and apply the optimization of deep learning
models
Course CO2: Remember the concepts of machine learning and apply it with deep learning models
Outcome CO3: Apply the deep learning concepts with python programming language
CO4: Apply the Tensor flow library for deep learning and understand FFNNs, CNNs, RNNs
CO5: Understand the applications of Deep Learning in various domains
TEXT BOOKS:
T1: Bengio, Yoshua, Ian J. Goodfellow, and Aaron Courville. “Deep learning.” An MIT Press book,2017 (Unit
I,II,V)
T2: Francois Chollet, “Deep Learning with Python”Manning Publications,2018 (Unit III)
P a g e | 166
REFERENCE BOOKS:
R1: Giancarlo Zaccone, Md. RezaulKarim, “ Deep Learning with TensorFlow:Explore neural networks and
build intelligent systems with python”, Packt Pulishing,2nd edition,2018 (Unit IV)
R2: Li Deng, Dong Yu “ Deep Learning Methods and Applications”, NowPublishers, 2014
R3: Bengio, Yoshua. "Learning deep architectures for AI." Foundations and trends in Machine Learning 2.1
(2009): 1127
R4: Hastie, T., Tibshirani, R. and Friedman, J. The Elements of Statistical Learning. Springer. 2001.
P a g e | 167

BE 19CS8310 BLOCK CHAIN TECHNOLOGY 3 0 0 3
1. To learn the basic concepts of distributed database and cryptography.

2. To understand the fundamentals of block chain systems and its applications.
Course
3. To learn about the distributed consensus and energy utilization.
Objective
4. To learn the concepts of crypto currency.
5. To introduce the applications of crypto currency and block chain technologies.
Instructional
Unit Description
Hours
BASICS
Distributed Database, Two General Problem, Byzantine General problem and Fault
Tolerance, Hadoop Distributed File System, Distributed Hash Table, ASIC resistance,
I 9
Turing Complete. Cryptography: Hash function, Digital Signature - ECDSA,
Memory Hard Algorithm, Zero Knowledge Proof.
BLOCK CHAIN
Introduction, Advantage over conventional distributed database, Block chain
Network, Mining Mechanism, Distributed Consensus, Merkle Patricia Tree, Gas
II 11
Limit, Transactions and Fee, Anonymity, Reward, Chain Policy, Life of Block chain
application, Soft & Hard Fork, Private and Public block chain.
DISTRIBUTED CONSENSUS
III Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn, Difficulty 9
Level, Sybil Attack, Energy utilization and alternate.
CRYPTOCURRENCY
History, Distributed Ledger, Bitcoin protocols - Mining strategy and rewards,
IV 9
Ethereum - Construction, DAO, Smart Contract, GHOST, Vulnerability, Attacks,
Side chain, Name coin.
CRYPTOCURRENCY REGULATION
Stakeholders, Roots of Bit coin, Legal Aspects-Crypto currency Exchange, Black
V Market and Global Economy. 7
Applications: Internet of Things, Medical Record Management System, Domain
Name Service and future of Block chain.
CO1: Understand the basic concepts of distributed database and cryptography

CO2: Evaluate block chain systems and its applications.
Course CO3: Analyze the distributed consensus and energy utilization
Outcome CO4: Evaluate the crypto currency related performance measurements.
CO5: Apply the logics crypto currency and block chain technologies.
TEXT BOOKS:
T1: Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, “Bitcoin
and Cryptocurrency Technologies”: A Comprehensive Introduction, Princeton University Press (July
19, 2016).
P a g e | 168
T2: Josh Thompson, ‘Blockchain: The Blockchain for Beginnings, Guild to Blockchain Technology and
Blockchain Programming’, Create Space Independent Publishing Platform, 2017.
REFERENCE BOOKS:
R1: Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies
R2: Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System
R3: DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction Ledger,”Yellow paper.2014.
R4 Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli, A survey of attacks on Ethereum smart contracts
P a g e | 169

BE 19CS6401 INTRODUCTION TO JAVA PROGRAMMING 3 0 0 3
1. To understand basic characteristics of Java

2. To understand Object Oriented Programming concepts and inheritance
Course 3. To know the principles of polymorphism and interfaces
Objective 4. To define exceptions and use I/O streams
5. To develop a java application with threads and generic classes
Instructional
Unit Description
Hours
INTRODUCTION TO JAVA FUNDAMENTALS
Introduction to java programming-Features of Java Language-JVM -The Java Environment-
Fundamental Programming Structures in Java – Comments -Primitive Data types-variables- 9
I
operators - control statements- arrays- Packages-defining package-access protection-importing
packages- JavaDoc comments.
INTRODUCTION TO OOP AND INHERITANCE

Object Oriented Programming – Class and Objects - Constructor - Inheritance – Super classes-
9
sub classes –Protected members – constructors in sub classes- the Object classes- Method
II
overloading -method over riding –Abstract class and Method – Encapsulation-Garbage
collection- static –final keyword.
INHERITANCE AND INTERFACES

Polymorphism-aggregation-association - Interfaces – defining an interface, implementing 9
III interface, differences between classes and interfaces and extending interfaces – Object cloning
-inner classes, Array Lists – Strings
EXCEPTION HANDLING AND I/O

9
Exceptions – exception hierarchy – throwing and catching exceptions – built-in exceptions,
IV
creating own exceptions, Stack Trace Elements. Input / Output Basics – Streams – Byte
streams and Character streams – Reading and Writing Console – Reading and Writing Files
MULTITHREADING AND GENERIC PROGRAMMING

Differences between multi-threading and multitasking, thread life cycle, creating threads, 9
V synchronizing threads, Inter-thread communication, daemon threads, thread groups. Generic
Programming – Generic classes – generic methods – Bounded Types – Restrictions and
Limitations.
TOTAL INSTRUCTIONAL HOURS 45

CO1:Understand basic Java programs with concepts
CO2:Develop Java programs using OOP principles and inheritance
Course CO3:Develop Java programs with the concepts interfaces
Outcome
CO4:Build Java applications using exceptions and I/O streams
CO5:Develop Java applications with threads and generic classes
TEXT BOOKS:
T1- Herbert Schildt, ―Java The complete reference‖, 8th Edition, McGraw Hill Education, 2011.
T2 - Cay S. Horstmann, Gary cornell, ―Core Java Volume –I Fundamentals‖, 9th Edition, Prentice Hall, 2013.
P a g e | 170
REFERENCE BOOKS :
R1 - Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers‖, 3rd Edition, Pearson, 2015.
R2 - Steven Holzner, ―Java 2 Black book‖, Dreamtech press, 2011.
R3 -Timothy Budd, ―Understanding Object-oriented programming with Java‖, Updated Edition, Pearson
Education, 2000.
R4 -C. Thomas Wu, “An introduction to Object-oriented programming with Java”, Fourth Edition, Tata McGraw-
Hill Publishing company Ltd., 2006.
P a g e | 171

BE 19CS6402 GREEN COMPUTING 3 0 0 3
1. To learn the fundamentals of Green Computing.

2. To enhance the skill in energy saving practices in their use of hardware.
Course 3. To analyze the Green computing Grid Framework.
Objective 4. To understand the issues related with Green compliance.
5. To study and develop various case studies.
Instructional
Unit Description
Hours
FUNDAMENTALS
Green IT Fundamentals: Business, IT, and the Environment – Green computing:
I carbon foot print, scoop on power – Green IT Strategies: Drivers, Dimensions, and 9
Goals – Environmentally Responsible Business: Policies, Practices, and Metrics.
GREEN ASSETS AND MODELING
Green Assets: Buildings, Data Centers, Networks, and Devices – Green Business
II Process Management: Modeling, Optimization, and Collaboration – Green 9
Enterprise Architecture – Environmental Intelligence – Green Supply Chains –
Green Information Systems: Design and Development Models.
GRID FRAMEWORK
Virtualization of IT systems – Role of electric utilities, Telecommuting,
III 9
teleconferencing and teleporting – Materials recycling – Best ways for Green PC –
Green Data center – Green Grid framework.
GREEN COMPLIANCE
Socio-cultural aspects of Green IT – Green Enterprise Transformation Roadmap –
IV 9
Green Compliance: Protocols, Standards, and Audits – Emergent Carbon Issues:
Technologies and Future.
CASE STUDIES
The Environmentally Responsible Business Strategies (ERBS) – Case Study
V 9
Scenarios for Trial Runs – Case Studies – Applying Green IT Strategies and
Applications to a Home, Hospital, Packaging Industry and Telecom Sector.
CO1: Knowledge about the fundamentals of Green Computing
CO2: Enhance the skill in energy saving practices in their use of hardware.
CO3: Analyze the Green computing Grid Framework
Course
CO4: Understand the issues related with Green compliance.
Outcome
CO5: Understand and develop various case studies.
TEXT BOOKS:
T1: Bhuvan Unhelkar, ―Green IT Strategies and Applications-Using Environmental Intelligence, CRC Press,
June 2014.
T2: Woody Leonhard, Katherine Murray, ―Green Home computing for dummies, August 2012.
REFERENCE BOOKS:
R1: Alin Gales, Michael Schaefer, Mike Ebbers, ―Green Data Center: steps for the Journey, Shroff/IBM
rebook, 2011.
P a g e | 172
R2: John Lamb, ―The Greening of IT, Pearson Education, 2009.

R3: Jason Harris, ―Green Computing and Green IT- Best Practices on regulations & industry, Lulu.com, 2008
R4: Carl speshocky, ―Empowering Green Initiatives with IT, John Wiley & Sons, 2010.
P a g e | 173

BE 19CS7401 FOUNDATION SKILLS IN INFORMATION 3 0 0 3
TECHNOLOGY(NASSCOM)
1. To introduce the basics of C programming language

2. To Learn about the concepts of structure and unions
Course
3. To be exposed about sorting, searching, hashing algorithms
Objective
4. To Learn various testing and maintenance measures
5. To outline the principles for Software Project Management
Instructional
Unit Description
Hours
BASIC PROGRAMMING CONCEPTS IN C LANGUAGE
Structure of a C program – compilation and linking processes – Constants, Variables
I – Data Types – Expressions using operators in C – Managing Input and Output 9
operations – Decision Making and Branching – Looping statements. Arrays –
Initialization – Declaration – One dimensional and Two-dimensional arrays.
FUNCTIONS, POINTERS, STRUCTURES AND UNIONS
Functions – Pass by value – Pass by reference – Recursion – Pointers – Definition –
II Initialization – Pointers arithmetic. Structures and unions – definition – Structure 9
within a structure – Union – Programs using structures and Unions – Storage
classes, Pre-processor directives.
SORTING, SEARCHING, HASHING TECHNIQUES
Sorting algorithms: Insertion sort – Selection sort – Shell sort – Bubble sort – Quick
III sort – Merge sort – Radix sort – Searching: Linear search –Binary Search Hashing: 9
Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible
Hashing
SOFTWARE TESTING AND ITS TYPES
Software testing fundamentals-Internal and external views of Testing-white box
testing-black box testing- Regression Testing – Unit Testing – Integration Testing –
IV 9
Validation Testing -alpha and beta testing -Acceptance testing – Performance
testing-– Usability and Accessibility testing –Compatibility testing – Test cases-
Testing the documentation
STAFFING IN SOFTWARE PROJECTS
Managing people – Organizational behavior – Best methods of staff selection –
Motivation – The Oldham – Hackman job characteristic model – Stress – Health and
V 9
Safety – Ethical and Professional concerns – Working in teams – Decision making –
Organizational structures – Dispersed and Virtual teams – Communications genres –
Communication plans – Leadership.
CO1: Understand the basics of C programming language

Course CO2: Apply the concepts of structures and unions
Outcome CO3: Apply the sorting, searching, hashing algorithms.
CO4: Understand the various testing and maintenance.
CO5: Understand the Project Management principles while developing software.
TEXT BOOKS:
T1: Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2nd Edition, Pearson
Education, 1988.
T2: Roger S. Pressman, “Software Engineering – A Practitioner‟s Approach”, Seventh Edition, Mc Graw-Hill
International Edition, 2010.
P a g e | 174
REFERENCE BOOKS:
R1: Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education, 1997.
R2: Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms”,
Second Edition, Mcgraw Hill, 2002.
R3: Ian Sommerville, “Software Engineering”, 9th Edition, Pearson Education Asia, 2011.
R4: Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.
P a g e | 175

BE 19CS7402 MULTIMEDIA SYSTEMS 3 0 0 3
1. To learn the basics of multimedia systems

2. To understand the various formats of multimedia files
Course
3. To know the compression and decompression techniques for multimedia files
Objective
4. To learn the multimedia design and user interface
5. To understand the operating systems and networks for multimedia
Instructional
Unit Description
Hours
MULTIMEDIA SYSTEMS DESIGN: AN INTRODUCTION
Multimedia Elements-Multimedia Applications-Multimedia Systems
I Architecture-Evolving Technologies for Multimedia Systems-Defining 9
Objects for Multimedia Systems- Multimedia Data Interface Standards-The
Need for Data Compression- Multimedia Databases
MULTIMEDIA FILE HANDLING
Data and File Format Standards-Resource Interchange File Format-MIDI File
Format-JPEG DIB File Format for Still and Motion Images-AVI Indeo File
II Format-MPEG Standards-TWAIN- Multimedia Input/Output Technologies- 9
Key Technology Issues-Pen Input-Video and Image Display systems-Image
Scanners-Digital Voice and Audio-Digital Camera-Video Images and
Animation-Full Motion Video
COMPRESSION AND DECOMPRESSION
Types of Compression-Binary Image Compression Schemes-Color, Gray
III Scale and Still-Video Image Compression-Audio compression-Fractal 9
Compression
MULTIMEDIA APPLICATION DESIGN, AUTHORING AND USER
INTERFACE
Multimedia Application Classes-Types of Multimedia Systems-Virtual
IV Reality Design-Components of Multimedia Systems-Organizing Multimedia 9
Databases-Application Workflow Design Issues-Distributed Application
Design Issues-Multimedia Authoring Systems-Hypermedia Application
Design Considerations-User Interface Design-Information Access
MULTIMEDIA OPERATING SYSTEMS and NETWORKING
SYSTEMS
Introduction-Real Time-Resource Management-Process Management-File
V 9
Systems-Additional Operating System Issues-System Architecture-
Introduction to network systems -Layers, Protocols and Services-Networks-
LANs-MANs-WANs
CO1: Understand the architecture and technologies of multimedia systems

CO2: Remember the various standards and input/output of multimedia files
Course CO3: Understand compression and decompression techniques for image, audio, video files
Outcome CO4: Apply multimedia applications, designs and user interface
CO5: Understand the multimedia OS and multimedia LANs, MANs and WANs
TEXT BOOKS:
T1: Prabhat K.Andleigh, Kiran Thakrar,”Multimedia systems Design”, First Impression 2015,Pearson
T2: Ralf steinmetz, Klara Nahrstedt,”Multimedia Computing, Communications & Applications”, Sixteenth
Impression, Pearson
P a g e | 176
REFERENCE BOOKS:
R1: J.F.K, Buford, ”Multimedia Systems”, ACM Press, 1994
R2: Fluckiger,” Understanding Networked Multimedia”, Prentice Hall
R3: Boyle, “Design for Multimedia Learning”, Prentice Hall
R4: Tay Vaughan, “Multimedia making it work”, Tata McGraw-Hill, 2008.
P a g e | 177
HICET – Hindusthan College of Engineering and Technology

B.E./B.Tech. 19CS1152 Object Oriented Programming using Python 2 0 2 3
(Common to CSE, IT, ECE and AI&ML)
1. To read and write simple Python programs.

2. To develop Python programs with conditionals and loops.
Course
3. To define Python functions and call them.
Objective
4. To understand OOP concepts and write programs using classes and objects.
5. To do input/output with files in Python.
Instructional
Unit Description
Hours
INTRODUCTION TO PYTHON
What is Python - Advantages and Disadvantages, Benefits and Limitation-
Downloading and Python-installation-Python Versions-Running Python Scripts,
Executing scripts with python launcher-Using interpreter interactively- Using
I 7+2(P)
variables-String types: normal, raw and Unicode-String operations and functions-
Math operator and functions. Illustrative program: find minimum in a list, insert
acard in a list of sorted cards, guess an integer number in a range, Towers of
Hanoi.
DATA TYPES, STATEMENTS,CONTROL FLOW
Data Types(List,Tuple,string,dicionary,set)-Operators and precedence of operators,
expressions, statements, comments; Conditionals: Boolean values and operators,
conditional (if), alternative (if -else), chained conditional (if –elif-else); Iteration:
II 5+4(P)
state, while, for, break, continue, pass. Illustrative programs: Find the square root of
a number, To find the given number is Prime or not, Write a Python program which
accepts a sequence of comma-separated numbers from user, generate a list and find
the sum and average of the numbers.
PYTHON FUNCTIONS
Introduction to functions-Global and local variable in python-Decorators in python-
Python lamda functions-Exception handling in python. Illustrative programs:
III Square root, GCD, exponentiation, linear search, binary search, Write a 5+4(P)
menu driven program to perform the following task:a) A function Sum_DigN( ) to
find the s um of the digits of a given n umber, b) A recursive function Sum_DigR( )
to find the same.
PYTHON OOPS
Introduction to oops concept-Python class and objects-Constructor in python-
Inheritance-Types of inheritance-Encapsulation in python-Polymorphism in python.
Illustrative programs: Write a Python program using class for the calculation of
telephone bill. The charges for the calls are fixed as follows:
IV Unit Call Cost/unit 5+4(P)
Below 100 calls No Charge, only rental amount Rs. 250
100-150 calls Rs. 1.00
151-300 calls Rs. 2.50
301-600 calls Rs. 4.50
Above 600 Rs. 6.00
FILES, PACKAGES
File handling in python-Open a file in python-How to read from a file in python-
writing to file in python-Python numpy-Python pandas. Illustrative programs: How
V 5+4(P)
to display the contents of text file in reverse order? Write the code for the same, not
exceeding 10 lines of code, Creating Modules and Packages for arithmetic
Operations.
P a g e | 178
CO1: Understanding the basic concepts to read, write and execute simple python programs.
Course CO2: Apply the conditional and looping concepts for solving problems.
CO3: Apply functions to decompose larger complex programs.
Outcome
CO4: Understanding the OOPS concepts and writing programs using classes and objects.
CO5: Understand to read and write data from/to files in Python Programs.
TEXT BOOKS:
T1: Guido van Rossum and Fred L. Drake Jr, An Introduction to Python – Revised andupdated for
Python 3.2, Network Theory Ltd., 2011.
REFERENCE BOOKS:
R1: Charles Dierbach, ―Introduction to Computer Science using Python: A
ComputationalProblem-Solving Focus, Wiley India Edition, 2013.
R2: Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd., 2015
R3: Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming inPython:
An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016
P a g e | 179

B.E. 19CS2153 JAVA FUNDAMENTALS 2 0 2 3
(Common to CSE, ECE and and AI&ML)
1. To Understand the Basics of java Programming.

2. To discuss the packages and interfaces in java programming
Course
3. To learn IO streams and multithreading in java
Objective
4. To learn generics and collections framework in java
5. To understand event handling and swing in java
Instructional
Unit Description
Hours
INTRODUCTION TO JAVA
JAVA-History of JAVA-Features of JAVA-Hello worlds java program-Setting path-
I JDK, JRV and JVM-JAVA variables-JAVA data types-Keywords-Operators. 5+2(P)
Illustrative Programs: Java program to swap two numbers using bitwise operator,
Java program to find the smallest three numbers using ternary operator.
CONTROL STATEMENTS
Introduction to control statements in programming-If-else-switch-for loop-while
loop-do while loop-Break-continue-JAVA comments. Illustrative programs: Find
II 5+6(P)
the square root of a number , To determine leap year or not, Java program to find
the factorial of number using recursion, Create Generic number calculator using
Java.
JAVA POLYMORPHISM
Introduction to polymorphism concepts-Method overloading-Method overriding-
Covariant return type-Super keyword-Instance Initializer block-final keyword-
III 7+2(P)
Runtime polymorphism-Dynamic binding-Instance of operator-Abstract class-
interface-abstract Vs interface. Illustrative programs: Method overriding, Abstract
classes.
ENCAPSUALATION, ARRAY
Java encapsulation-package-access modifier-Encapsulation-Object cloning- call by
IV value-Java array concepts-Single dimension array-Multi dimension array. 7+2(P)
Illustrative programs: Java program to check the whether the input character is
vowels or not
FILES, PACKAGES
File handling in python-Open a file in JAVA-How to read from a file in JAVA-
writing to file in JAVA-Exception handling-Java swing-java applet-Java AWT and
V 5+4(P)
events-Java collection. Illustrative programs: Find the most frequent words in a text
read from a file, Linked List implementation using collections, Program that handles
all mouse events, Program using swing.
CO1: Understanding the OOPS and basic concepts of Java.

Course CO2: Understand how to program using user defined packages and interfaces.
Outcome CO3: Apply multithreading concepts based on appropriate problems.
CO4: Understand generics and collections framework in java
CO5: Apply event handling classes and swing concepts to create different applications in java
TEXT BOOKS:
T1: Herbert Schildt, “The complete reference java 2”, 11th edition, McGraw – Hill 2019.
T2: “Core Java 2”,Vol 2,Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh Edition,
Pearson Education
P a g e | 180
REFERENCE BOOKS:
R1: E.Balagurusamy,”Programming with java A Primer”, fifth edition, McGraw – Hill 2014.
R2: H.M.Deitel, P.J.Deitel, "Java: how to program", Eleventh edition, Prentice Hall of India private
limited, 2017.
P a g e | 181
Course code Course Title L T P C
CAREER GUIDANCE – LEVEL I
19HE1072 2 0 0 1
Personality, Aptitude and Career Guidance
Pre-requisite None Syllabus version - 1
Course Objectives:
1. Introduce students to building blocks of Logical reasoning and Quantitative Aptitude
[SLO 1]
2. Train students on essential grammar for placements [SLO 2]
3. Introduce students on scientific techniques to pick up skills [SLO 3]
4. Provide an orientation for recruiter expectation in terms of non-verbal skills, and for
how to build one’s career with placements in mind [SLO 4]
Expected Course Outcome:

 Enable students to approach learning Aptitude with ease, and understand recruiter
expectation.
Student Learning Outcomes (SLO): 1, 2, 3 and 4
Module:1 Lessons on excellence 2 hours SLO: 3

Skill introspection, Skill acquisition, consistent practice
Module:2 Logical Reasoning 11 hours SLO: 1

Thinking Skill
 Problem Solving
 Critical Thinking
 Lateral Thinking
Taught through thought-provoking word and rebus puzzles, and word-link builder questions
Coding & decoding, Series, Analogy, Odd man out and Visual reasoning
 Coding and Decoding
 Series
 Analogy
 Odd Man Out
 Visual Reasoning
Sudoku puzzles
Solving introductory to moderate level sudoku puzzles to boost logical thinking and
comfort with numbers
Attention to detail
Picture and word driven Qs to develop attention to detail as a skill
P a g e | 182
Module:3 Quantitative Aptitude 11 hours SLO: 1

Speed Maths
 Addition and Subtraction of bigger numbers
 Square and square roots
 Cubes and cube roots
 Vedic maths techniques
 Multiplication Shortcuts
 Multiplication of 3 and higher digit numbers
 Simplifications
 Comparing fractions
 Shortcuts to find HCF and LCM
 Divisibility tests shortcuts
Algebra and functions
Module:4 Recruitment Essentials 2 hours SLO: 4

Looking at an engineering career through the prism of an effective resume
 Importance of a resume - the footprint of a person's career achievements
 How a resume looks like?
 An effective resume vs. a poor resume: what skills you must build
starting today and how?
Impression Management
Getting it right for the interview:
 Grooming, dressing
 Body Language and other non-verbal signs
 Displaying the right behaviour
Module:5 Verbal Ability 4 hours SLO: 2

Essential grammar for placements:
 Nouns and Pronouns
 Verbs
 Subject-Verb Agreement
 Pronoun-Antecedent Agreement
 Punctuations
Verbal Reasoning
Total Lecture hours: 30 hours
Mode of Evaluation: Assignments, 3 Assessments with End Semester (Computer

Based Test)
P a g e | 183
Programme Course Name of the Course L T P C

Code
BE/BTECH 19HE1073 Entrepreneurship & Innovation 0 0 2 1
1. To acquire the knowledge and skills needed to manage the development of

Course innovation.
2. To recognize and evaluate potential opportunities to monetize these innovations.
Objective 3. To plan specific and detailed method to exploit these opportunities.
` 4. To acquire the resources necessary to implement these plans.
5: To make students understand organizational performance and its importance.
Instruction
Modul Descripti al
e on
Hours
1. Entrepreneurial Thinking
2. Innovation Management
3. Design Thinking
4. Opportunity Spotting / Opportunity Evaluation
5. Industry and Market Research
6. Innovation Strategy and Business Models
7. Financial Forecasting
8. Business Plans/ Business Model Canvas
9. Entrepreneurial Finance
10. Pitching to Resources Providers / Pitch Deck
11. Negotiating Deals
12. New Venture Creation
13. Lean Start-ups
14. Entrepreneurial Ecosystem
15. Velocity Venture
CO1: Understand the nature of business opportunities, resources, and industries in

critical and creative aspects.
CO2: Understand the processes by which innovation is fostered, managed, and
commercialized.
Course CO3: Remember effectively and efficiently the potential of new business
Outcome opportunities.
CO4: Assess the market potential for a new venture, including customer need,
competitors, and industry attractiveness.
CO5: Develop a business model for a new venture, including revenue. Margins,
operations, working capital, and investment.
TEXT BOOKS
T1: Arya Kumar “Entrepreneurship – Creating and leading an Entrepreneurial
Organization”, Pearson, Second Edition (2012).
T2: Emrah Yayici “Design Thinking Methodology”, Artbiztech, First Edition(2016).
P a g e | 184
REFERENCE BOOKS
R1: Christopher Golis “Enterprise & Venture Capital”, Allen & Unwin
Publication, Fourth Edition (2007). R2: Thomas Lock Wood & Edger Papke
“Innovation by Design”, Career Press.com, Second Edition (2017). R3: Jonathan
Wilson “Essentials of Business Research”, Sage Publication, First Edition (2010).
WEB RESOURCES
 W1: https://blof.forgeforward.in/tagged/startup-lessons
 W2: https://blof.forgeforward.in/tagged/entrepreurship
 W3: https://blof.forgeforward.in/tagged/minimum-viable-product
 W4: https://blof.forgeforward.in/tagged/minimum-viable-product
 W5: https://blof.forgeforward.in/tagged/innovation
 W6:https://www.youtube.com/watch?v=8vEyL7uKXs&list=PLmP9QrmTNPqBEv
KbMSXvwlwn7fdnXe6Lw
P a g e | 185

19HE2072 CAREER GUIDANCE – LEVEL II
2 0 0 1
Course Objectives:
1. Solve Logical Reasoning questions of easy to intermediate level [SLO 6]
2. Solve Quantitative Aptitude questions of easy to intermediate level [SLO 7]
3. Solve Verbal Ability questions of easy to intermediate level [SLO 8]

 Enable students to solve questions on Verbal, Logical and Quantitative
Aptitude of placement level
Student Learning Outcomes (SLO): 6, 7, 8
Module:1 Logical Reasoning 8 hours SLO: 6
Word group categorization questions

Puzzle type class involving students grouping words into right group orders of logical
sense
Cryptarithmetic
Data arrangements and Blood relations
 Linear Arrangement
 Circular Arrangement
 Multi-dimensional Arrangement
 Blood Relations

Ratio and Proportion
 Ratio
 Proportion
 Variation
 Simple equations
 Problems on Ages
 Mixtures and alligations
Percentages, Simple and Compound Interest

 Percentages as Fractions and Decimals
 Percentage Increase / Decrease
 Simple Interest
 Compound Interest
P a g e | 186
 Relation Between Simple and Compound Interest

Number System
 Number system
 Power cycle
 Remainder cycle
 Factors, Multiples
 HCF and LCM

Essential grammar for placements
 Prepositions
 Adjectives and Adverbs
 Tenses
 Forms and Speech and Voice
 Idioms and Phrasal Verbs
 Collocations, Gerund and Infinitives
Reading Comprehension for placements

 Types of questions
 Comprehension strategies
 Practice exercises
Articles, Prepositions and Interrogatives

 Definite and Indefinite Articles
 Omission of Articles
 Prepositions
 Compound Prepositions and Prepositional Phrases
 Interrogatives
Vocabulary for placements

 Exposure to solving questions of
 Synonyms
 Antonyms
 Analogy
 Confusing words
 Spelling correctness
Mode of Evaluation: Assignments, 3 Assessments with End Semester (Computer Based Test)
P a g e | 187
Course code Course Title LT P C

19HE3071 CAREER GUIDANCE – LEVEL III
2 0 0 1
Course Objectives:
4. Display good writing skills while dealing with essays [SLO 12]

 Enable students to solve Aptitude questions of placement level with ease, as well as
write effective essays.
Student Learning Outcomes (SLO): 6, 7, 8, 12
Module:1 Logical Reasoning 9 hours SLO:6

Clocks, calendars, Direction sense and Cubes
 Clocks
 Calendars
 Direction Sense
 Cubes
Data interpretation and Data sufficiency

 Data Interpretation – Tables
 Data Interpretation - Pie Chart
 Data Interpretation - Bar Graph
 Data Sufficiency

Time and work
 Work with different efficiencies
 Pipes and cisterns
 Work equivalence
 Division of wages
Time, Speed and Distance

 Basics of time, speed and distance
 Relative speed
 Problems based on trains
 Problems based on boats and streams
 Problems based on races
P a g e | 188
Profit and loss, Partnerships and averages

 Basic terminologies in profit and loss
 Partnership
 Averages
 Weighted average

Sentence Correction
 Subject-Verb Agreement
 Modifiers
 Parallelism
 Pronoun-Antecedent Agreement
 Verb Time Sequences
 Comparisons
 Prepositions
 Determiners
Sentence Completion and Para-jumbles

 Pro-active thinking
 Reactive thinking (signpost words, root words, prefix suffix, sentence
structure clues)
 Fixed jumbles
 Anchored jumbles
Module:4 Writing skills for placements 2 hours SLO: 12

Essay writing
 Idea generation for topics
 Best practices
 Practice and feedback
Mode of Evaluation: Assignments, 3 Assessments with End Semester (Computer

Based Test)
P a g e | 189

19HE4071 CAREER GUIDANCE – LEVEL IV
2 0 0 1
Pre-requisite None Syllabus version
1
Course Objectives:
4. Crack mock interviews with ease [SLO 13]
5. Be introduced to problem-solving techniques and algorithms [SLO 14]

 Enable students to solve Aptitude questions of placement level with ease, as well as
write effective essays.
Student Learning Outcomes (SLO): 6, 7, 8, 13, 14
Module:1 Logical Reasoning 5 hours SLO:6

Logical connectives, Syllogism and Venn diagrams
 Logical Connectives
 Syllogisms
 Venn Diagrams – Interpretation
 Venn Diagrams - Solving

Logarithms, Progressions, Geometry and Quadratic equations
 Logarithm
 Arithmetic Progression
 Geometric Progression
 Geometry
 Mensuration
 Coded inequalities
 Quadratic Equations
Permutation, Combination and Probability

 Fundamental Counting Principle
 Permutation and Combination
 Computation of Permutation
 Circular Permutations
 Computation of Combination
 Probability
P a g e | 190

Critical Reasoning
 Argument – Identifying the Different Parts (Premise, assumption, conclusion)
 Strengthening statement
 Weakening statement
 Mimic the pattern
Module:4 Recruitment Essentials 3 hours SLO: 12

Cracking interviews - demonstration through a few mocks
Sample mock interviews to demonstrate how to crack the:
 HR interview
 MR interview
 Technical interview
Cracking other kinds of interviews

 Skype/ Telephonic interviews
 Panel interviews
 Stress interviews
Resume building – workshop

A workshop to make students write an accurate resume
Module:5 Problem solving and Algorithmic 12 hours SLO: 12

skills
 Logical methods to solve problem statements in Programming
 Basic algorithms introduced
Mode of Evaluation: Assignments, Mock interviews, 3 Assessments with End

Semester (Computer Based Test)
P a g e | 191

Regulation 2019 (Amendments) Common To All B.E. / B.Tech. Degree Programmes (Choice Based Credit System)

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

Regulation 2019 (Amendments) Common To All B.E. / B.Tech. Degree Programmes (Choice Based Credit System)

Uploaded by

Copyright:

Available Formats

HINDUSTHAN COLLEGE OF ENGINEERING AND TECHNOLOGY

(An Autonomous Institution Affiliated to Anna University, Chennai)

(Approved by AICTE, New Delhi, Accredited by NAAC with ‘A’ Grade)

COIMBATORE 641 032

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Regulation 2019 (Amendments)

S. No. Description Page Number

1 Vision and Mission of the Department 3

2 Salient Features of Curriculum and Syllabi 4

3 PO’s and PEO’s 5

5 Curriculum and Syllabi 31

Hindusthan College of Engineering and Technology

B. E COMPUTER SCIENCE AND ENGINEERING

Vision of the Department

Mission of the Department

Hindusthan College of Engineering and Technology

Salient Features – R2019 Curriculum and Syllabi

Hindusthan College of Engineering and Technology

Program Outcomes (PO’s)

ENGINEERING KNOWLEDGE: Apply the knowledge of mathematics, science,

PROBLEM ANALYSIS: Identify, formulate, review research literature, and analyze

DESIGN/DEVELOPMENT OF SOLUTIONS: Design solutions for complex engineering

CONDUCT INVESTIGATIONS OF COMPLEX PROBLEMS: Use research-based

THE ENGINEER AND SOCIETY: Apply reasoning informed by the contextual

INDIVIDUAL AND TEAM WORK: Function effectively as an individual, and as a

COMMUNICATION: Communicate effectively on complex engineering activities with the

PROJECT MANAGEMENT AND FINANCE: Demonstrate knowledge and

Hindusthan College of Engineering and Technology

PROGRAM EDUCATIONAL OBJECTIVES (PEO’s)

PEO2: To be capable of modeling, designing, implementing and verifying a computing system

1. PRELIMINARY DEFINITIONS AND NOMENCLATURE

i. “Programme” means Degree Programme, i.e. B.E. / B.Tech. Degree Programme.

5. STRUCTURE OF THE PROGRAMMES

5.2 Personality and Character Development

• National Cadet Corps (NCC) will have about 20 parades .

5.3 Mandatory Two Week Induction Programme

5.4 Number of courses per semester

5.5 Industrial Training / Internship

5.6 Industrial Visit

5.7 Value Added Courses

5.8 Online Courses

5.9 Fast Track Learning System:

They should satisfy the following conditions.

5.10 Credit Transfer Courses

Total Number of Periods attended in all the courses per

(Number of Periods as prescribed in all the courses per week ) X 15

Contact period per week Credit

7.1 CREDIT DISTRIBUTION FOR THE CATEGORY OF COURSES:

7.2 TOTAL CREDITS TO BE EARNED FOR THE AWARD OF DEGREE

7.3 Additional Credits:

8. COURSE ENROLLMENT AND REGISTRATION FOR ESE.

10. CLASS COMMITTEE

The functions of the class committee include:

11. COURSE COMMITTEE FOR COMMON COURSES

12. OVERALL MONITORING COMMITTEE

13. ATTENDANCE REQUIREMENTS FOR COMPLETION OF THE SEMESTER

i. A student shall be permitted to take the ESE of any course, if

vi. Registration is mandatory for semester examinations as well as arrears

vii. Every teacher is required to maintain an “ATTENDANCE AND ASSESSMENT

14. WEIGHTAGE OF ASSESSMENT COMPONENTS OF A

15. CONTINUOUS INTERNAL ASSESSMENT: The performance of students in each course

S. No. Attendance % Marks

(ii) Theory Course: